Lines Matching defs:sig

63 static void print_convention( int *sig, const char *s, int length ) {
66 if( sig[i] == 0 ) continue; // do not print 'halves'
67 print_reg( sig[i] & 0xFFFF );
68 int reg = sig[i] >> 16;
84 static void java_convention( int *sig, const char *s, int length ) {
90 sig[i] = s[i]; // Reset sig array
109 switch( sig[i] ) {
142 int tmp = sig[i];
150 sig[i] = tmp;
154 if( sig[i] != Op_RegP && sig[i+1] != 'h' ) { printf("expecting (h)alf, found %c\n", sig[i+1]); return; }
172 sig[i] = tmp | (tmp+1)<<16; // Smear to pair
176 sig[i] = (flt_reg < flt_reg_max) ? (R_F0_num + flt_reg++) : STACK_num + stk_reg++;
179 if( sig[i+1] != 'h' ) { printf("expecting (h)alf, found %c\n", sig[i+1]); return; }
187 sig[i] = tmp | (tmp+1)<<16; // Smear to pair
189 case 'h': sig[i] = 0; break;
191 printf("Bad character: %c\n", sig[i] );
199 print_convention(sig,s,length);
207 static void native_convention( int *sig, const char *s, int length ) {
213 sig[i] = s[i]; // Reset sig array
228 switch( sig[i] ) {
230 sig[i] = int_stk_helper( j );
233 if( sig[i+1] != 'h' ) { printf("expecting (h)alf, found %c\n", sig[i+1]); return; }
236 sig[i] = tmp | ((tmp+1) << 16); // Smear to pair
239 sig[i] = ((j < 16) ? R_F1_num : (STACK_num + 1)) + (j<<1);
243 sig[i] = tmp | ((tmp+1) << 16); // Smear to pair
245 case 'h': sig[i] = 0; j--; break; // Do not count HALVES
247 printf("Bad character: %c\n", sig[i] );
257 switch( sig[i] ) {
261 sig[i] = int_stk_helper( i );
265 if( sig[i+1] != 'h' ) { printf("expecting (h)alf, found %c\n", sig[i+1]); return; }
267 sig[i] = tmp | (int_stk_helper( i+1 ) << 16);
269 case 'h': sig[i] = 0; break;
271 printf("Bad character: %c\n", sig[i] );
280 print_convention(sig,s,length);
293 int sig[1000];
296 java_convention( sig, s, length );
298 java_convention( sig, s, length );
300 java_convention( sig, s, length );
303 native_convention( sig, s, length );
305 native_convention( sig, s, length );
307 native_convention( sig, s, length );