src/cpu/sparc/vm/args.cc

Tue, 08 Aug 2017 15:57:29 +0800

author
aoqi
date
Tue, 08 Aug 2017 15:57:29 +0800
changeset 6876
710a3c8b516e
parent 1907
c18cbe5936b8
parent 0
f90c822e73f8
permissions
-rw-r--r--

merge

aoqi@0 1 /*
aoqi@0 2 * Copyright (c) 2002, 2006, Oracle and/or its affiliates. All rights reserved.
aoqi@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0 4 *
aoqi@0 5 * This code is free software; you can redistribute it and/or modify it
aoqi@0 6 * under the terms of the GNU General Public License version 2 only, as
aoqi@0 7 * published by the Free Software Foundation.
aoqi@0 8 *
aoqi@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0 12 * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0 13 * accompanied this code).
aoqi@0 14 *
aoqi@0 15 * You should have received a copy of the GNU General Public License version
aoqi@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0 18 *
aoqi@0 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0 20 * or visit www.oracle.com if you need additional information or have any
aoqi@0 21 * questions.
aoqi@0 22 *
aoqi@0 23 */
aoqi@0 24
aoqi@0 25 #include <stdio.h>
aoqi@0 26 #include <string.h>
aoqi@0 27
aoqi@0 28 static const int R_O0_num = 1000;
aoqi@0 29 static const int R_I0_num = 2000;
aoqi@0 30 static const int R_F0_num = 3000;
aoqi@0 31 static const int R_F1_num = R_F0_num + 1;
aoqi@0 32 static const int R_F2_num = R_F0_num + 2;
aoqi@0 33 static const int STACK_num= 4000;
aoqi@0 34
aoqi@0 35 static bool LP64 = false;
aoqi@0 36 static bool LONGS_IN_ONE_ENTRY = false;
aoqi@0 37
aoqi@0 38 static const int Op_RegI = 'I';
aoqi@0 39 static const int Op_RegP = 'P';
aoqi@0 40 static const int Op_RegF = 'F';
aoqi@0 41 static const int Op_RegD = 'D';
aoqi@0 42 static const int Op_RegL = 'L';
aoqi@0 43 static const int SPARC_ARGS_IN_REGS_NUM=6;
aoqi@0 44
aoqi@0 45 static void print_reg( int reg ) {
aoqi@0 46 if( reg == 0 )
aoqi@0 47 printf("__"); // halve's
aoqi@0 48 else if( reg >= STACK_num && reg < STACK_num+100 )
aoqi@0 49 printf("S%d_",reg - STACK_num);
aoqi@0 50 else if( reg >= R_F0_num && reg < R_F0_num+100 )
aoqi@0 51 printf("F%d_",reg - R_F0_num);
aoqi@0 52 else if( reg >= R_O0_num && reg < R_O0_num+100 ) {
aoqi@0 53 if( LONGS_IN_ONE_ENTRY ) {
aoqi@0 54 reg -= R_O0_num;
aoqi@0 55 printf("O%d",reg>>1);
aoqi@0 56 printf(reg&1 ? "H" : "L");
aoqi@0 57 } else
aoqi@0 58 printf("O%d_",reg - R_O0_num);
aoqi@0 59 } else
aoqi@0 60 printf("Wretched: %d\n", reg);
aoqi@0 61 }
aoqi@0 62
aoqi@0 63 static void print_convention( int *sig, const char *s, int length ) {
aoqi@0 64 // Print it out
aoqi@0 65 for( int i = 0; i < length; i++) {
aoqi@0 66 if( sig[i] == 0 ) continue; // do not print 'halves'
aoqi@0 67 print_reg( sig[i] & 0xFFFF );
aoqi@0 68 int reg = sig[i] >> 16;
aoqi@0 69 if( reg ) {
aoqi@0 70 printf(":");
aoqi@0 71 print_reg( reg );
aoqi@0 72 } else {
aoqi@0 73 printf(" ");
aoqi@0 74 }
aoqi@0 75 printf(" ");
aoqi@0 76 }
aoqi@0 77 printf("\n");
aoqi@0 78 }
aoqi@0 79
aoqi@0 80 static int INT_SCALE( int x ) {
aoqi@0 81 return LONGS_IN_ONE_ENTRY ? (x<<1) : x;
aoqi@0 82 }
aoqi@0 83
aoqi@0 84 static void java_convention( int *sig, const char *s, int length ) {
aoqi@0 85 if( LP64 && !LONGS_IN_ONE_ENTRY ) {
aoqi@0 86 printf("LP64 and 2-reg longs not supported\n");
aoqi@0 87 return;
aoqi@0 88 }
aoqi@0 89 for( int i = 0; i < length; i++ )
aoqi@0 90 sig[i] = s[i]; // Reset sig array
aoqi@0 91 bool is_outgoing = true;
aoqi@0 92
aoqi@0 93 int int_base = (is_outgoing ? R_O0_num : R_I0_num);
aoqi@0 94
aoqi@0 95 // Convention is to pack the first 6 int/oop args into the first 6
aoqi@0 96 // registers (I0-I5), extras spill to the stack. Then pack the first
aoqi@0 97 // 32 float args into F0-F31, extras spill to the stack. Then pad
aoqi@0 98 // all register sets to align. Then put longs and doubles into the
aoqi@0 99 // same registers as they fit, else spill to the stack.
aoqi@0 100 int int_reg_max = SPARC_ARGS_IN_REGS_NUM;
aoqi@0 101 int flt_reg_max = 32;
aoqi@0 102
aoqi@0 103 // Count int/oop and float args. See how many stack slots we'll need
aoqi@0 104 // and where the longs & doubles will go.
aoqi@0 105 int int_reg_cnt = 0;
aoqi@0 106 int flt_reg_cnt = 0;
aoqi@0 107 int stk_reg_pairs = 0;
aoqi@0 108 for( int i = 0; i < length; i++) {
aoqi@0 109 switch( sig[i] ) {
aoqi@0 110 case Op_RegL: // Longs-in-1-reg compete with int args
aoqi@0 111 if( LONGS_IN_ONE_ENTRY ) {
aoqi@0 112 if( int_reg_cnt < int_reg_max ) int_reg_cnt++;
aoqi@0 113 }
aoqi@0 114 break;
aoqi@0 115 case Op_RegP:
aoqi@0 116 if( int_reg_cnt < int_reg_max ) int_reg_cnt++;
aoqi@0 117 else if( !LP64 ) stk_reg_pairs++;
aoqi@0 118 break;
aoqi@0 119 case Op_RegI:
aoqi@0 120 if( int_reg_cnt < int_reg_max ) int_reg_cnt++;
aoqi@0 121 else stk_reg_pairs++;
aoqi@0 122 break;
aoqi@0 123 case Op_RegF:
aoqi@0 124 if( flt_reg_cnt < flt_reg_max ) flt_reg_cnt++;
aoqi@0 125 else stk_reg_pairs++;
aoqi@0 126 break;
aoqi@0 127 }
aoqi@0 128 }
aoqi@0 129
aoqi@0 130 // This is where the longs/doubles start on the stack.
aoqi@0 131 stk_reg_pairs = (stk_reg_pairs+1) & ~1; // Round
aoqi@0 132
aoqi@0 133 int int_reg_pairs = (int_reg_cnt+1) & ~1; // 32-bit 2-reg longs only
aoqi@0 134 int flt_reg_pairs = (flt_reg_cnt+1) & ~1;
aoqi@0 135
aoqi@0 136 int stk_reg = 0;
aoqi@0 137 int int_reg = 0;
aoqi@0 138 int flt_reg = 0;
aoqi@0 139
aoqi@0 140 // Now do the signature layout
aoqi@0 141 for( int i = 0; i < length; i++) {
aoqi@0 142 int tmp = sig[i];
aoqi@0 143 if( tmp == Op_RegP )
aoqi@0 144 tmp = LP64 ? Op_RegL : Op_RegI; // Treat ptrs and ints or long accordingly
aoqi@0 145 switch( tmp ) {
aoqi@0 146 case Op_RegI:
aoqi@0 147 // case Op_RegP:
aoqi@0 148 if( int_reg < int_reg_max) tmp = INT_SCALE(int_reg++) + int_base;
aoqi@0 149 else tmp = STACK_num + stk_reg++;
aoqi@0 150 sig[i] = tmp;
aoqi@0 151 break;
aoqi@0 152
aoqi@0 153 case Op_RegL:
aoqi@0 154 if( sig[i] != Op_RegP && sig[i+1] != 'h' ) { printf("expecting (h)alf, found %c\n", sig[i+1]); return; }
aoqi@0 155 // case Op_RegP:
aoqi@0 156 if( LONGS_IN_ONE_ENTRY ) {
aoqi@0 157 if( int_reg < int_reg_max ) {
aoqi@0 158 tmp = INT_SCALE(int_reg++) + int_base;
aoqi@0 159 } else {
aoqi@0 160 tmp = STACK_num + stk_reg_pairs;
aoqi@0 161 stk_reg_pairs += 2;
aoqi@0 162 }
aoqi@0 163 } else {
aoqi@0 164 if( int_reg_pairs < int_reg_max ) {
aoqi@0 165 tmp = int_reg_pairs + int_base;
aoqi@0 166 int_reg_pairs += 2;
aoqi@0 167 } else {
aoqi@0 168 tmp = STACK_num + stk_reg_pairs;
aoqi@0 169 stk_reg_pairs += 2;
aoqi@0 170 }
aoqi@0 171 }
aoqi@0 172 sig[i] = tmp | (tmp+1)<<16; // Smear to pair
aoqi@0 173 break;
aoqi@0 174
aoqi@0 175 case Op_RegF:
aoqi@0 176 sig[i] = (flt_reg < flt_reg_max) ? (R_F0_num + flt_reg++) : STACK_num + stk_reg++;
aoqi@0 177 break;
aoqi@0 178 case Op_RegD:
aoqi@0 179 if( sig[i+1] != 'h' ) { printf("expecting (h)alf, found %c\n", sig[i+1]); return; }
aoqi@0 180 if( flt_reg_pairs < flt_reg_max ) {
aoqi@0 181 tmp = R_F0_num + flt_reg_pairs;
aoqi@0 182 flt_reg_pairs += 2;
aoqi@0 183 } else {
aoqi@0 184 tmp = STACK_num + stk_reg_pairs;
aoqi@0 185 stk_reg_pairs += 2;
aoqi@0 186 }
aoqi@0 187 sig[i] = tmp | (tmp+1)<<16; // Smear to pair
aoqi@0 188 break;
aoqi@0 189 case 'h': sig[i] = 0; break;
aoqi@0 190 default:
aoqi@0 191 printf("Bad character: %c\n", sig[i] );
aoqi@0 192 return;
aoqi@0 193 }
aoqi@0 194 }
aoqi@0 195
aoqi@0 196 printf("java ");
aoqi@0 197 printf(LP64 ? "LP64 " : "LP32 ");
aoqi@0 198 printf(LONGS_IN_ONE_ENTRY ? "long1: " : "long2: ");
aoqi@0 199 print_convention(sig,s,length);
aoqi@0 200 }
aoqi@0 201
aoqi@0 202 static int int_stk_helper( int i ) {
aoqi@0 203 if( i < 6 ) return R_O0_num + (LONGS_IN_ONE_ENTRY ? i<<1 : i);
aoqi@0 204 else return STACK_num + (LP64 ? i<<1 : i);
aoqi@0 205 }
aoqi@0 206
aoqi@0 207 static void native_convention( int *sig, const char *s, int length ) {
aoqi@0 208 if( LP64 && !LONGS_IN_ONE_ENTRY ) {
aoqi@0 209 printf("LP64 and 2-reg longs not supported\n");
aoqi@0 210 return;
aoqi@0 211 }
aoqi@0 212 for( int i = 0; i < length; i++ )
aoqi@0 213 sig[i] = s[i]; // Reset sig array
aoqi@0 214
aoqi@0 215 // The native convention is V8 if !LP64, which means the V8 convention is
aoqi@0 216 // used both with and without LONGS_IN_ONE_ENTRY, an unfortunate split. The
aoqi@0 217 // same actual machine registers are used, but they are named differently in
aoqi@0 218 // the LONGS_IN_ONE_ENTRY mode. The LP64 convention is the V9 convention
aoqi@0 219 // which is slightly more sane.
aoqi@0 220
aoqi@0 221 if( LP64 ) {
aoqi@0 222 // V9 convention: All things "as-if" on double-wide stack slots.
aoqi@0 223 // Hoist any int/ptr/long's in the first 6 to int regs.
aoqi@0 224 // Hoist any flt/dbl's in the first 16 dbl regs.
aoqi@0 225 int j = 0; // Count of actual args, not HALVES
aoqi@0 226 for( int i=0; i<length; i++, j++ ) {
aoqi@0 227 int tmp;
aoqi@0 228 switch( sig[i] ) {
aoqi@0 229 case Op_RegI:
aoqi@0 230 sig[i] = int_stk_helper( j );
aoqi@0 231 break;
aoqi@0 232 case Op_RegL:
aoqi@0 233 if( sig[i+1] != 'h' ) { printf("expecting (h)alf, found %c\n", sig[i+1]); return; }
aoqi@0 234 case Op_RegP:
aoqi@0 235 tmp = int_stk_helper( j );
aoqi@0 236 sig[i] = tmp | ((tmp+1) << 16); // Smear to pair
aoqi@0 237 break;
aoqi@0 238 case Op_RegF: // V9ism: floats go in ODD registers
aoqi@0 239 sig[i] = ((j < 16) ? R_F1_num : (STACK_num + 1)) + (j<<1);
aoqi@0 240 break;
aoqi@0 241 case Op_RegD: // V9ism: doubles go in EVEN/ODD regs
aoqi@0 242 tmp = ((j < 16) ? R_F0_num : STACK_num) + (j<<1);
aoqi@0 243 sig[i] = tmp | ((tmp+1) << 16); // Smear to pair
aoqi@0 244 break;
aoqi@0 245 case 'h': sig[i] = 0; j--; break; // Do not count HALVES
aoqi@0 246 default:
aoqi@0 247 printf("Bad character: %c\n", sig[i] );
aoqi@0 248 return;
aoqi@0 249 }
aoqi@0 250 }
aoqi@0 251
aoqi@0 252 } else {
aoqi@0 253 // V8 convention: first 6 things in O-regs, rest on stack.
aoqi@0 254 // Alignment is willy-nilly.
aoqi@0 255 for( int i=0; i<length; i++ ) {
aoqi@0 256 int tmp;
aoqi@0 257 switch( sig[i] ) {
aoqi@0 258 case Op_RegI:
aoqi@0 259 case Op_RegP:
aoqi@0 260 case Op_RegF:
aoqi@0 261 sig[i] = int_stk_helper( i );
aoqi@0 262 break;
aoqi@0 263 case Op_RegL:
aoqi@0 264 case Op_RegD:
aoqi@0 265 if( sig[i+1] != 'h' ) { printf("expecting (h)alf, found %c\n", sig[i+1]); return; }
aoqi@0 266 tmp = int_stk_helper( i );
aoqi@0 267 sig[i] = tmp | (int_stk_helper( i+1 ) << 16);
aoqi@0 268 break;
aoqi@0 269 case 'h': sig[i] = 0; break;
aoqi@0 270 default:
aoqi@0 271 printf("Bad character: %c\n", sig[i] );
aoqi@0 272 return;
aoqi@0 273 }
aoqi@0 274 }
aoqi@0 275 }
aoqi@0 276
aoqi@0 277 printf("natv ");
aoqi@0 278 printf(LP64 ? "LP64 " : "LP32 ");
aoqi@0 279 printf(LONGS_IN_ONE_ENTRY ? "long1: " : "long2: ");
aoqi@0 280 print_convention(sig,s,length);
aoqi@0 281 }
aoqi@0 282
aoqi@0 283 int main( int argc, char **argv ) {
aoqi@0 284
aoqi@0 285 if( argc != 2 ) {
aoqi@0 286 printf("Usage: args IPFLhDh... (Java argument string)\n");
aoqi@0 287 printf("Returns argument layout\n");
aoqi@0 288 return -1;
aoqi@0 289 }
aoqi@0 290
aoqi@0 291 const char *s = argv[1];
aoqi@0 292 int length = strlen(s);
aoqi@0 293 int sig[1000];
aoqi@0 294
aoqi@0 295 LP64 = false; LONGS_IN_ONE_ENTRY = false;
aoqi@0 296 java_convention( sig, s, length );
aoqi@0 297 LP64 = false; LONGS_IN_ONE_ENTRY = true;
aoqi@0 298 java_convention( sig, s, length );
aoqi@0 299 LP64 = true ; LONGS_IN_ONE_ENTRY = true;
aoqi@0 300 java_convention( sig, s, length );
aoqi@0 301
aoqi@0 302 LP64 = false; LONGS_IN_ONE_ENTRY = false;
aoqi@0 303 native_convention( sig, s, length );
aoqi@0 304 LP64 = false; LONGS_IN_ONE_ENTRY = true;
aoqi@0 305 native_convention( sig, s, length );
aoqi@0 306 LP64 = true ; LONGS_IN_ONE_ENTRY = true;
aoqi@0 307 native_convention( sig, s, length );
aoqi@0 308 }
aoqi@0 309

mercurial