1 #define yy_create_buffer llvmAsm_create_buffer
2 #define yy_delete_buffer llvmAsm_delete_buffer
3 #define yy_scan_buffer llvmAsm_scan_buffer
4 #define yy_scan_string llvmAsm_scan_string
5 #define yy_scan_bytes llvmAsm_scan_bytes
6 #define yy_flex_debug llvmAsm_flex_debug
7 #define yy_init_buffer llvmAsm_init_buffer
8 #define yy_flush_buffer llvmAsm_flush_buffer
9 #define yy_load_buffer_state llvmAsm_load_buffer_state
10 #define yy_switch_to_buffer llvmAsm_switch_to_buffer
11 #define yyin llvmAsmin
12 #define yyleng llvmAsmleng
13 #define yylex llvmAsmlex
14 #define yyout llvmAsmout
15 #define yyrestart llvmAsmrestart
16 #define yytext llvmAsmtext
17 #define yylineno llvmAsmlineno
20 /* A lexical scanner generated by flex */
22 /* Scanner skeleton version:
27 #define YY_FLEX_MAJOR_VERSION 2
28 #define YY_FLEX_MINOR_VERSION 5
34 /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
46 /* Use prototypes in function declarations. */
49 /* The "const" storage-class-modifier is valid. */
52 #else /* ! __cplusplus */
60 #endif /* ! __cplusplus */
79 #define YY_PROTO(proto) proto
81 #define YY_PROTO(proto) ()
84 /* Returned upon end-of-file. */
87 /* Promotes a possibly negative, possibly signed char to an unsigned
88 * integer for use as an array index. If the signed char is negative,
89 * we want to instead treat it as an 8-bit unsigned char, hence the
92 #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
94 /* Enter a start condition. This macro really ought to take a parameter,
95 * but we do it the disgusting crufty way forced on us by the ()-less
96 * definition of BEGIN.
98 #define BEGIN yy_start = 1 + 2 *
100 /* Translate the current start state into a value that can be later handed
101 * to BEGIN to return to the state. The YYSTATE alias is for lex
104 #define YY_START ((yy_start - 1) / 2)
105 #define YYSTATE YY_START
107 /* Action number for EOF rule of a given start state. */
108 #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
110 /* Special action meaning "start processing a new file". */
111 #define YY_NEW_FILE yyrestart( yyin )
113 #define YY_END_OF_BUFFER_CHAR 0
115 /* Size of default input buffer. */
116 #define YY_BUF_SIZE (16384*64)
118 typedef struct yy_buffer_state *YY_BUFFER_STATE;
121 extern FILE *yyin, *yyout;
123 #define EOB_ACT_CONTINUE_SCAN 0
124 #define EOB_ACT_END_OF_FILE 1
125 #define EOB_ACT_LAST_MATCH 2
127 /* The funky do-while in the following #define is used to turn the definition
128 * int a single C statement (which needs a semi-colon terminator). This
129 * avoids problems with code like:
131 * if ( condition_holds )
134 * do_something_else();
136 * Prior to using the do-while the compiler would get upset at the
137 * "else" because it interpreted the "if" statement as being all
138 * done when it reached the ';' after the yyless() call.
141 /* Return all but the first 'n' matched characters back to the input stream. */
146 /* Undo effects of setting up yytext. */ \
147 *yy_cp = yy_hold_char; \
148 YY_RESTORE_YY_MORE_OFFSET \
149 yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
150 YY_DO_BEFORE_ACTION; /* set up yytext again */ \
154 #define unput(c) yyunput( c, yytext_ptr )
156 /* The following is because we cannot portably get our hands on size_t
157 * (without autoconf's help, which isn't available because we want
158 * flex-generated scanners to compile on their own).
160 typedef unsigned int yy_size_t;
163 struct yy_buffer_state
167 char *yy_ch_buf; /* input buffer */
168 char *yy_buf_pos; /* current position in input buffer */
170 /* Size of input buffer in bytes, not including room for EOB
173 yy_size_t yy_buf_size;
175 /* Number of characters read into yy_ch_buf, not including EOB
180 /* Whether we "own" the buffer - i.e., we know we created it,
181 * and can realloc() it to grow it, and should free() it to
184 int yy_is_our_buffer;
186 /* Whether this is an "interactive" input source; if so, and
187 * if we're using stdio for input, then we want to use getc()
188 * instead of fread(), to make sure we stop fetching input after
191 int yy_is_interactive;
193 /* Whether we're considered to be at the beginning of a line.
194 * If so, '^' rules will be active on the next match, otherwise
199 /* Whether to try to fill the input buffer when we reach the
204 int yy_buffer_status;
205 #define YY_BUFFER_NEW 0
206 #define YY_BUFFER_NORMAL 1
207 /* When an EOF's been seen but there's still some text to process
208 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
209 * shouldn't try reading from the input source any more. We might
210 * still have a bunch of tokens to match, though, because of
211 * possible backing-up.
213 * When we actually see the EOF, we change the status to "new"
214 * (via yyrestart()), so that the user can continue scanning by
215 * just pointing yyin at a new input file.
217 #define YY_BUFFER_EOF_PENDING 2
220 static YY_BUFFER_STATE yy_current_buffer = 0;
222 /* We provide macros for accessing buffer states in case in the
223 * future we want to put the buffer states in a more general
226 #define YY_CURRENT_BUFFER yy_current_buffer
229 /* yy_hold_char holds the character lost when yytext is formed. */
230 static char yy_hold_char;
232 static int yy_n_chars; /* number of characters read into yy_ch_buf */
237 /* Points to current character in buffer. */
238 static char *yy_c_buf_p = (char *) 0;
239 static int yy_init = 1; /* whether we need to initialize */
240 static int yy_start = 0; /* start state number */
242 /* Flag which is used to allow yywrap()'s to do buffer switches
243 * instead of setting up a fresh yyin. A bit of a hack ...
245 static int yy_did_buffer_switch_on_eof;
247 void yyrestart YY_PROTO(( FILE *input_file ));
249 void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
250 void yy_load_buffer_state YY_PROTO(( void ));
251 YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
252 void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
253 void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
254 void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
255 #define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
257 YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
258 YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
259 YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
261 static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
262 static inline void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
263 static void yy_flex_free YY_PROTO(( void * ));
265 #define yy_new_buffer yy_create_buffer
267 #define yy_set_interactive(is_interactive) \
269 if ( ! yy_current_buffer ) \
270 yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
271 yy_current_buffer->yy_is_interactive = is_interactive; \
274 #define yy_set_bol(at_bol) \
276 if ( ! yy_current_buffer ) \
277 yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
278 yy_current_buffer->yy_at_bol = at_bol; \
281 #define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
284 #define YY_USES_REJECT
287 #define YY_SKIP_YYWRAP
288 typedef unsigned char YY_CHAR;
289 FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
290 typedef int yy_state_type;
294 #define yytext_ptr yytext
296 static yy_state_type yy_get_previous_state YY_PROTO(( void ));
297 static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
298 static int yy_get_next_buffer YY_PROTO(( void ));
299 static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
301 /* Done after the current pattern has been matched and before the
302 * corresponding action - sets up yytext.
304 #define YY_DO_BEFORE_ACTION \
305 yytext_ptr = yy_bp; \
306 yyleng = (int) (yy_cp - yy_bp); \
307 yy_hold_char = *yy_cp; \
311 #define YY_NUM_RULES 99
312 #define YY_END_OF_BUFFER 100
313 static yyconst short int yy_acclist[177] =
315 100, 98, 99, 97, 98, 99, 97, 99, 98, 99,
316 98, 99, 98, 99, 98, 99, 98, 99, 98, 99,
317 90, 98, 99, 90, 98, 99, 1, 98, 99, 98,
318 99, 98, 99, 98, 99, 98, 99, 98, 99, 98,
319 99, 98, 99, 98, 99, 98, 99, 98, 99, 98,
320 99, 98, 99, 98, 99, 98, 99, 98, 99, 98,
321 99, 98, 99, 98, 99, 98, 99, 98, 99, 98,
322 99, 89, 87, 86, 86, 93, 91, 95, 90, 1,
323 75, 32, 57, 20, 89, 86, 86, 94, 95, 17,
324 95, 96, 51, 56, 30, 33, 54, 3, 42, 53,
326 22, 65, 55, 74, 69, 70, 52, 58, 88, 95,
327 95, 37, 66, 67, 82, 83, 44, 19, 92, 23,
328 4, 49, 43, 36, 11, 95, 2, 5, 46, 48,
329 38, 60, 64, 62, 63, 61, 59, 40, 84, 39,
330 45, 18, 72, 81, 35, 47, 27, 21, 34, 7,
331 77, 29, 80, 50, 68, 76, 24, 25, 78, 41,
332 73, 71, 6, 26, 8, 14, 9, 10, 31, 12,
333 28, 79, 85, 13, 15, 16
336 static yyconst short int yy_accept[398] =
338 1, 1, 1, 2, 4, 7, 9, 11, 13, 15,
339 17, 19, 21, 24, 27, 30, 32, 34, 36, 38,
340 40, 42, 44, 46, 48, 50, 52, 54, 56, 58,
341 60, 62, 64, 66, 68, 70, 72, 72, 73, 73,
342 74, 75, 76, 77, 77, 78, 78, 79, 80, 80,
343 81, 81, 81, 81, 81, 81, 81, 81, 82, 82,
344 83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
345 83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
346 83, 83, 84, 84, 84, 84, 84, 84, 84, 84,
347 84, 84, 84, 84, 85, 85, 85, 85, 85, 85,
349 85, 85, 85, 85, 85, 85, 85, 86, 87, 89,
350 90, 91, 92, 92, 93, 94, 94, 95, 95, 95,
351 96, 96, 96, 96, 97, 97, 97, 97, 97, 98,
352 98, 99, 99, 99, 99, 99, 99, 99, 99, 99,
353 99, 100, 100, 100, 100, 100, 100, 100, 100, 101,
354 102, 102, 102, 103, 103, 104, 105, 105, 105, 105,
355 105, 106, 106, 107, 107, 108, 108, 108, 108, 108,
356 108, 108, 108, 108, 108, 108, 108, 108, 108, 108,
357 108, 108, 108, 108, 108, 108, 109, 109, 110, 111,
358 111, 111, 111, 112, 112, 112, 112, 113, 114, 115,
360 115, 115, 115, 115, 115, 115, 115, 115, 115, 115,
361 115, 116, 116, 116, 116, 116, 116, 116, 116, 116,
362 117, 118, 118, 119, 119, 119, 120, 120, 120, 120,
363 120, 120, 120, 120, 120, 120, 121, 121, 121, 122,
364 123, 123, 124, 124, 124, 124, 124, 124, 124, 124,
365 124, 124, 125, 125, 126, 126, 127, 127, 127, 128,
366 128, 128, 128, 128, 128, 128, 128, 128, 129, 129,
367 130, 130, 130, 130, 130, 130, 131, 131, 131, 131,
368 131, 131, 132, 132, 133, 134, 135, 136, 137, 138,
369 139, 140, 140, 140, 140, 141, 142, 143, 143, 143,
371 143, 143, 143, 144, 144, 144, 144, 145, 145, 146,
372 146, 146, 146, 147, 148, 149, 149, 150, 150, 151,
373 151, 151, 152, 152, 153, 154, 155, 155, 156, 157,
374 158, 159, 159, 159, 160, 161, 162, 163, 163, 163,
375 163, 163, 164, 165, 165, 165, 165, 165, 165, 165,
376 165, 165, 165, 165, 165, 166, 167, 167, 167, 168,
377 169, 169, 169, 169, 170, 170, 171, 171, 171, 171,
378 171, 171, 171, 171, 171, 171, 171, 171, 171, 171,
379 171, 172, 172, 173, 173, 173, 173, 173, 173, 174,
380 174, 175, 175, 176, 176, 177, 177
384 static yyconst int yy_ec[256] =
386 1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
387 1, 1, 2, 1, 1, 1, 1, 1, 1, 1,
388 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
389 1, 2, 1, 4, 1, 5, 6, 1, 1, 1,
390 1, 1, 7, 1, 8, 9, 1, 10, 11, 11,
391 11, 11, 11, 11, 11, 11, 11, 12, 13, 1,
392 1, 1, 1, 1, 14, 14, 14, 14, 15, 14,
393 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
394 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
395 1, 1, 1, 1, 16, 1, 17, 18, 19, 20,
397 21, 22, 23, 24, 25, 5, 26, 27, 28, 29,
398 30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
399 40, 41, 1, 1, 1, 1, 1, 1, 1, 1,
400 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
401 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
402 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
403 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
404 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
405 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
406 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
408 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
409 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
410 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
411 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
412 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
416 static yyconst int yy_meta[42] =
418 1, 1, 2, 1, 3, 1, 1, 3, 3, 3,
419 3, 4, 1, 3, 3, 3, 3, 3, 3, 3,
420 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
421 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
425 static yyconst short int yy_base[402] =
427 0, 0, 834, 835, 835, 835, 829, 820, 34, 36,
428 38, 42, 46, 50, 0, 51, 54, 53, 56, 61,
429 76, 77, 79, 80, 82, 83, 84, 90, 31, 111,
430 94, 140, 113, 55, 110, 116, 827, 835, 818, 835,
431 0, 128, 131, 144, 150, 124, 160, 167, 172, 0,
432 136, 89, 168, 100, 41, 145, 114, 817, 139, 183,
433 184, 185, 173, 186, 187, 189, 191, 133, 188, 193,
434 200, 202, 194, 203, 205, 215, 208, 211, 207, 214,
435 57, 816, 224, 225, 227, 231, 233, 234, 241, 235,
436 236, 239, 247, 815, 251, 244, 245, 248, 254, 266,
438 255, 276, 269, 278, 270, 277, 814, 0, 287, 291,
439 813, 303, 309, 0, 812, 295, 811, 288, 310, 810,
440 296, 299, 315, 809, 316, 317, 318, 319, 808, 240,
441 322, 320, 321, 325, 326, 327, 328, 331, 336, 341,
442 343, 344, 345, 346, 348, 350, 353, 351, 807, 806,
443 355, 357, 805, 359, 804, 803, 380, 361, 363, 391,
444 802, 373, 801, 374, 800, 369, 365, 393, 396, 398,
445 401, 397, 399, 409, 403, 411, 405, 368, 413, 416,
446 417, 418, 367, 419, 423, 799, 425, 835, 431, 437,
447 443, 446, 449, 450, 439, 451, 798, 797, 796, 452,
449 453, 455, 454, 458, 461, 462, 463, 465, 464, 469,
450 795, 470, 472, 478, 475, 479, 480, 482, 483, 794,
451 793, 486, 792, 488, 490, 0, 494, 499, 489, 501,
452 502, 505, 497, 507, 508, 791, 517, 518, 790, 789,
453 519, 788, 521, 527, 522, 529, 523, 530, 531, 536,
454 538, 787, 539, 786, 541, 544, 544, 545, 785, 548,
455 556, 546, 557, 550, 558, 560, 564, 784, 566, 783,
456 568, 569, 570, 571, 576, 782, 572, 578, 590, 582,
457 592, 781, 579, 780, 779, 778, 777, 776, 775, 774,
458 773, 593, 580, 595, 772, 771, 770, 594, 599, 600,
460 596, 598, 769, 607, 610, 611, 768, 612, 767, 614,
461 613, 615, 766, 765, 764, 616, 763, 618, 762, 620,
462 627, 761, 626, 760, 759, 758, 624, 757, 756, 755,
463 754, 635, 638, 753, 752, 749, 739, 636, 639, 640,
464 641, 738, 737, 643, 644, 642, 646, 647, 649, 655,
465 662, 654, 665, 666, 736, 735, 668, 669, 734, 733,
466 670, 672, 673, 732, 676, 731, 674, 675, 678, 681,
467 684, 686, 682, 690, 693, 695, 696, 700, 698, 703,
468 730, 708, 728, 706, 704, 709, 710, 711, 726, 712,
469 722, 714, 574, 720, 491, 835, 753, 755, 280, 759,
474 static yyconst short int yy_def[402] =
476 396, 1, 396, 396, 396, 396, 397, 398, 399, 396,
477 398, 398, 398, 398, 400, 398, 398, 398, 398, 398,
478 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
479 398, 398, 398, 398, 398, 398, 397, 396, 398, 396,
480 401, 401, 396, 396, 398, 398, 398, 398, 398, 400,
481 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
482 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
483 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
484 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
485 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
487 398, 398, 398, 398, 398, 398, 396, 401, 401, 396,
488 398, 398, 398, 49, 398, 398, 398, 398, 398, 398,
489 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
490 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
491 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
492 398, 398, 398, 398, 398, 398, 49, 398, 398, 398,
493 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
494 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
495 398, 398, 398, 398, 398, 398, 398, 396, 396, 396,
496 396, 398, 398, 398, 398, 398, 398, 398, 398, 398,
498 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
499 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
500 398, 398, 398, 398, 398, 157, 398, 398, 398, 398,
501 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
502 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
503 398, 398, 398, 398, 398, 396, 398, 398, 398, 398,
504 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
505 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
506 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
507 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
509 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
510 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
511 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
512 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
513 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
514 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
515 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
516 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
517 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
518 398, 398, 398, 398, 398, 0, 396, 396, 396, 396,
523 static yyconst short int yy_nxt[877] =
525 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
526 14, 4, 15, 8, 8, 8, 16, 17, 18, 19,
527 20, 21, 22, 8, 23, 8, 24, 25, 26, 27,
528 28, 8, 29, 30, 31, 32, 33, 34, 35, 8,
529 36, 42, 40, 43, 43, 44, 44, 45, 45, 40,
530 46, 85, 40, 40, 47, 48, 48, 40, 47, 48,
531 48, 40, 40, 119, 40, 40, 40, 40, 40, 59,
532 51, 60, 40, 152, 55, 104, 62, 52, 56, 53,
533 63, 54, 61, 57, 49, 64, 58, 40, 40, 65,
534 40, 40, 67, 40, 40, 40, 74, 70, 77, 66,
536 40, 40, 68, 71, 75, 40, 72, 73, 69, 76,
537 93, 40, 79, 83, 81, 116, 82, 78, 80, 84,
538 86, 40, 40, 94, 40, 40, 95, 40, 87, 102,
539 118, 88, 111, 96, 89, 40, 106, 109, 109, 105,
540 43, 43, 103, 121, 40, 90, 91, 40, 92, 86,
541 40, 40, 110, 44, 44, 115, 40, 97, 47, 45,
542 45, 40, 136, 108, 98, 122, 99, 120, 100, 112,
543 112, 40, 123, 101, 113, 47, 48, 48, 40, 40,
544 113, 114, 114, 40, 40, 114, 114, 117, 114, 114,
545 114, 114, 114, 114, 40, 40, 40, 40, 40, 40,
547 40, 124, 40, 127, 40, 40, 131, 132, 137, 129,
548 125, 40, 126, 40, 40, 128, 40, 134, 40, 40,
549 143, 130, 40, 133, 135, 40, 40, 138, 141, 139,
550 142, 146, 140, 144, 148, 40, 40, 149, 40, 145,
551 151, 150, 40, 147, 40, 40, 40, 40, 153, 154,
552 40, 40, 40, 165, 155, 40, 40, 204, 40, 40,
553 159, 156, 40, 166, 164, 40, 40, 161, 160, 157,
554 162, 167, 158, 163, 171, 169, 173, 40, 179, 168,
555 40, 40, 41, 174, 172, 175, 170, 40, 40, 40,
556 176, 180, 181, 183, 185, 184, 109, 109, 177, 40,
558 189, 189, 186, 178, 182, 190, 40, 40, 195, 187,
559 40, 190, 112, 112, 40, 191, 192, 113, 193, 193,
560 40, 40, 197, 113, 194, 198, 40, 40, 40, 40,
561 40, 40, 40, 40, 196, 200, 40, 40, 40, 40,
562 206, 207, 40, 210, 202, 203, 205, 40, 211, 199,
563 201, 212, 40, 213, 40, 40, 40, 40, 208, 40,
564 209, 40, 40, 215, 40, 217, 40, 214, 40, 220,
565 40, 218, 40, 216, 40, 221, 40, 222, 40, 40,
566 40, 223, 219, 228, 40, 40, 252, 225, 224, 226,
567 226, 236, 247, 226, 226, 227, 226, 226, 226, 226,
569 226, 226, 40, 235, 40, 233, 234, 40, 40, 40,
570 40, 229, 40, 230, 40, 237, 40, 231, 239, 232,
571 40, 240, 40, 244, 40, 246, 238, 40, 40, 40,
572 40, 241, 249, 242, 40, 253, 40, 243, 251, 245,
573 189, 189, 248, 191, 191, 190, 256, 256, 254, 250,
574 40, 190, 256, 256, 255, 193, 193, 40, 193, 193,
575 40, 40, 40, 40, 40, 40, 40, 258, 257, 40,
576 260, 262, 40, 40, 40, 40, 40, 265, 263, 259,
577 40, 40, 269, 40, 264, 268, 40, 261, 272, 40,
578 40, 40, 266, 40, 40, 267, 271, 40, 273, 40,
580 40, 40, 40, 270, 275, 40, 276, 274, 40, 278,
581 40, 277, 40, 40, 282, 279, 40, 283, 40, 40,
582 284, 285, 287, 280, 281, 289, 292, 291, 40, 40,
583 40, 290, 40, 40, 40, 286, 288, 293, 40, 295,
584 40, 40, 40, 296, 294, 299, 298, 40, 297, 40,
585 40, 300, 40, 256, 256, 40, 40, 40, 303, 40,
586 307, 40, 301, 302, 308, 306, 309, 40, 40, 40,
587 313, 40, 310, 305, 312, 40, 304, 40, 311, 40,
588 40, 40, 40, 40, 317, 40, 314, 40, 318, 40,
589 40, 40, 316, 40, 315, 319, 322, 320, 324, 321,
591 323, 40, 326, 40, 40, 40, 40, 40, 325, 40,
592 40, 40, 327, 328, 330, 331, 329, 333, 40, 334,
593 336, 40, 40, 40, 40, 40, 40, 40, 332, 40,
594 335, 40, 344, 342, 338, 40, 340, 40, 40, 339,
595 346, 337, 341, 347, 348, 345, 40, 40, 343, 40,
596 40, 40, 40, 40, 40, 40, 349, 40, 40, 350,
597 40, 351, 352, 353, 357, 40, 40, 360, 354, 356,
598 358, 362, 359, 40, 364, 355, 40, 40, 363, 40,
599 40, 40, 361, 40, 40, 40, 40, 40, 366, 40,
600 371, 374, 40, 40, 369, 40, 367, 40, 370, 365,
602 372, 40, 378, 368, 40, 376, 40, 40, 373, 40,
603 377, 40, 379, 381, 40, 40, 383, 40, 375, 40,
604 40, 40, 40, 40, 380, 40, 384, 386, 387, 391,
605 388, 40, 385, 40, 394, 382, 389, 40, 390, 40,
606 393, 40, 40, 40, 40, 40, 40, 40, 40, 40,
607 40, 392, 395, 37, 37, 37, 37, 39, 39, 50,
608 40, 50, 50, 40, 40, 40, 40, 40, 40, 40,
609 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
610 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
611 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
613 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
614 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
615 40, 40, 40, 40, 40, 188, 40, 40, 40, 40,
616 107, 40, 38, 396, 3, 396, 396, 396, 396, 396,
617 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
618 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
619 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
620 396, 396, 396, 396, 396, 396
623 static yyconst short int yy_chk[877] =
625 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
626 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
627 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
628 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
629 1, 9, 29, 9, 9, 10, 10, 11, 11, 11,
630 12, 29, 55, 12, 13, 13, 13, 13, 14, 14,
631 14, 14, 16, 55, 18, 17, 34, 19, 81, 18,
632 16, 18, 20, 81, 17, 34, 19, 16, 17, 16,
633 19, 16, 18, 17, 13, 19, 17, 21, 22, 20,
634 23, 24, 21, 25, 26, 27, 24, 22, 25, 20,
636 52, 28, 21, 22, 24, 31, 23, 23, 21, 24,
637 31, 54, 26, 28, 27, 52, 27, 25, 26, 28,
638 30, 35, 30, 31, 33, 57, 31, 36, 30, 33,
639 54, 30, 46, 31, 30, 46, 36, 42, 42, 35,
640 43, 43, 33, 57, 68, 30, 30, 51, 30, 32,
641 59, 32, 44, 44, 44, 51, 56, 32, 45, 45,
642 45, 45, 68, 401, 32, 59, 32, 56, 32, 47,
643 47, 47, 59, 32, 47, 48, 48, 48, 48, 53,
644 47, 49, 49, 49, 63, 49, 49, 53, 49, 49,
645 49, 49, 49, 49, 60, 61, 62, 64, 65, 69,
647 66, 60, 67, 62, 70, 73, 65, 66, 69, 63,
648 61, 71, 61, 72, 74, 62, 75, 67, 79, 77,
649 74, 64, 78, 66, 67, 80, 76, 70, 73, 71,
650 73, 76, 72, 75, 77, 83, 84, 78, 85, 75,
651 80, 79, 86, 76, 87, 88, 90, 91, 83, 84,
652 92, 130, 89, 91, 85, 96, 97, 130, 93, 98,
653 88, 85, 95, 92, 90, 99, 101, 89, 88, 86,
654 89, 93, 87, 89, 96, 95, 98, 100, 101, 93,
655 103, 105, 399, 99, 97, 100, 95, 102, 106, 104,
656 100, 102, 102, 103, 104, 103, 109, 109, 100, 118,
658 110, 110, 105, 100, 102, 110, 116, 121, 118, 106,
659 122, 110, 112, 112, 112, 113, 113, 112, 113, 113,
660 113, 119, 121, 112, 116, 122, 123, 125, 126, 127,
661 128, 132, 133, 131, 119, 125, 134, 135, 136, 137,
662 132, 133, 138, 136, 127, 128, 131, 139, 137, 123,
663 126, 138, 140, 139, 141, 142, 143, 144, 134, 145,
664 135, 146, 148, 141, 147, 143, 151, 140, 152, 146,
665 154, 144, 158, 142, 159, 147, 167, 148, 183, 178,
666 166, 151, 145, 159, 162, 164, 183, 154, 152, 157,
667 157, 167, 178, 157, 157, 158, 157, 157, 157, 157,
669 157, 157, 160, 166, 168, 162, 164, 169, 172, 170,
670 173, 160, 171, 160, 175, 168, 177, 160, 170, 160,
671 174, 171, 176, 175, 179, 177, 169, 180, 181, 182,
672 184, 172, 180, 173, 185, 184, 187, 174, 182, 176,
673 189, 189, 179, 190, 190, 189, 190, 190, 185, 181,
674 195, 189, 191, 191, 187, 192, 192, 192, 193, 193,
675 193, 194, 196, 200, 201, 203, 202, 195, 194, 204,
676 200, 202, 205, 206, 207, 209, 208, 205, 203, 196,
677 210, 212, 209, 213, 204, 208, 215, 201, 213, 214,
678 216, 217, 206, 218, 219, 207, 212, 222, 214, 224,
680 229, 225, 395, 210, 216, 227, 217, 215, 233, 219,
681 228, 218, 230, 231, 227, 222, 232, 228, 234, 235,
682 229, 230, 231, 224, 225, 232, 235, 234, 237, 238,
683 241, 233, 243, 245, 247, 230, 231, 237, 244, 241,
684 246, 248, 249, 243, 238, 246, 245, 250, 244, 251,
685 253, 247, 255, 256, 256, 257, 258, 262, 250, 260,
686 257, 264, 248, 249, 258, 255, 260, 261, 263, 265,
687 264, 266, 261, 253, 263, 267, 251, 269, 262, 271,
688 272, 273, 274, 277, 269, 393, 265, 275, 271, 278,
689 283, 293, 267, 280, 266, 272, 275, 273, 278, 274,
691 277, 279, 280, 281, 292, 298, 294, 301, 279, 302,
692 299, 300, 281, 283, 293, 294, 292, 299, 304, 300,
693 302, 305, 306, 308, 311, 310, 312, 316, 298, 318,
694 301, 320, 316, 311, 305, 327, 308, 323, 321, 306,
695 320, 304, 310, 321, 323, 318, 332, 338, 312, 333,
696 339, 340, 341, 346, 344, 345, 327, 347, 348, 332,
697 349, 333, 338, 339, 345, 352, 350, 348, 340, 344,
698 346, 350, 347, 351, 352, 341, 353, 354, 351, 357,
699 358, 361, 349, 362, 363, 367, 368, 365, 354, 369,
700 363, 368, 370, 373, 361, 371, 357, 372, 362, 353,
702 365, 374, 372, 358, 375, 370, 376, 377, 367, 379,
703 371, 378, 373, 375, 380, 385, 377, 384, 369, 382,
704 386, 387, 388, 390, 374, 392, 378, 380, 382, 387,
705 384, 394, 379, 391, 392, 376, 385, 389, 386, 383,
706 390, 381, 366, 364, 360, 359, 356, 355, 343, 342,
707 337, 388, 394, 397, 397, 397, 397, 398, 398, 400,
708 336, 400, 400, 335, 334, 331, 330, 329, 328, 326,
709 325, 324, 322, 319, 317, 315, 314, 313, 309, 307,
710 303, 297, 296, 295, 291, 290, 289, 288, 287, 286,
711 285, 284, 282, 276, 270, 268, 259, 254, 252, 242,
713 240, 239, 236, 223, 221, 220, 211, 199, 198, 197,
714 186, 165, 163, 161, 156, 155, 153, 150, 149, 129,
715 124, 120, 117, 115, 111, 107, 94, 82, 58, 39,
716 37, 8, 7, 3, 396, 396, 396, 396, 396, 396,
717 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
718 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
719 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
720 396, 396, 396, 396, 396, 396
723 static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
724 static char *yy_full_match;
728 *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
729 yy_cp = yy_full_match; /* restore poss. backed-over text */ \
733 #define yymore() yymore_used_but_not_detected
734 #define YY_MORE_ADJ 0
735 #define YY_RESTORE_YY_MORE_OFFSET
737 #line 1 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
739 /*===-- Lexer.l - Scanner for llvm assembly files --------------*- C++ -*--===//
741 // The LLVM Compiler Infrastructure
743 // This file was developed by the LLVM research group and is distributed under
744 // the University of Illinois Open Source License. See LICENSE.TXT for details.
746 //===----------------------------------------------------------------------===//
748 // This file implements the flex scanner for LLVM assembly languages files.
750 //===----------------------------------------------------------------------===*/
751 #define YY_NEVER_INTERACTIVE 1
752 #line 28 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
753 #include "ParserInternals.h"
754 #include "llvm/Module.h"
756 #include "llvmAsmParser.h"
760 void set_scan_file(FILE * F){
761 yy_switch_to_buffer(yy_create_buffer( F, YY_BUF_SIZE ) );
763 void set_scan_string (const char * str) {
764 yy_scan_string (str);
767 #define RET_TOK(type, Enum, sym) \
768 llvmAsmlval.type = Instruction::Enum; return sym
772 // TODO: All of the static identifiers are figured out by the lexer,
773 // these should be hashed to reduce the lexer size
776 // atoull - Convert an ascii string of decimal digits into the unsigned long
777 // long representation... this does not have to do input error checking,
778 // because we know that the input will be matched by a suitable regex...
780 static uint64_t atoull(const char *Buffer) {
782 for (; *Buffer; Buffer++) {
783 uint64_t OldRes = Result;
785 Result += *Buffer-'0';
786 if (Result < OldRes) // Uh, oh, overflow detected!!!
787 ThrowException("constant bigger than 64 bits detected!");
792 static uint64_t HexIntToVal(const char *Buffer) {
794 for (; *Buffer; ++Buffer) {
795 uint64_t OldRes = Result;
798 if (C >= '0' && C <= '9')
800 else if (C >= 'A' && C <= 'F')
802 else if (C >= 'a' && C <= 'f')
805 if (Result < OldRes) // Uh, oh, overflow detected!!!
806 ThrowException("constant bigger than 64 bits detected!");
812 // HexToFP - Convert the ascii string in hexidecimal format to the floating
813 // point representation of it.
815 static double HexToFP(const char *Buffer) {
816 // Behave nicely in the face of C TBAA rules... see:
817 // http://www.nullstone.com/htmls/category/aliastyp.htm
822 UIntToFP.UI = HexIntToVal(Buffer);
824 assert(sizeof(double) == sizeof(uint64_t) &&
825 "Data sizes incompatible on this target!");
826 return UIntToFP.FP; // Cast Hex constant to double
830 // UnEscapeLexed - Run through the specified buffer and change \xx codes to the
831 // appropriate character. If AllowNull is set to false, a \00 value will cause
832 // an exception to be thrown.
834 // If AllowNull is set to true, the return value of the function points to the
835 // last character of the string in memory.
837 char *UnEscapeLexed(char *Buffer, bool AllowNull) {
839 for (char *BIn = Buffer; *BIn; ) {
840 if (BIn[0] == '\\' && isxdigit(BIn[1]) && isxdigit(BIn[2])) {
841 char Tmp = BIn[3]; BIn[3] = 0; // Terminate string
842 *BOut = (char)strtol(BIn+1, 0, 16); // Convert to number
843 if (!AllowNull && !*BOut)
844 ThrowException("String literal cannot accept \\00 escape!");
846 BIn[3] = Tmp; // Restore character
847 BIn += 3; // Skip over handled chars
857 } // End llvm namespace
859 using namespace llvm;
861 #define YY_NEVER_INTERACTIVE 1
862 /* Comments start with a ; and go till end of line */
863 /* Variable(Value) identifiers start with a % sign */
864 /* Label identifiers end with a colon */
865 /* Quoted names can contain any character except " and \ */
866 /* [PN]Integer: match positive and negative literal integer values that
867 * are preceeded by a '%' character. These represent unnamed variable slots.
869 /* E[PN]Integer: match positive and negative literal integer values */
870 /* FPConstant - A Floating point constant.
872 /* HexFPConstant - Floating point constant represented in IEEE format as a
873 * hexadecimal number for when exponential notation is not precise enough.
875 /* HexIntConstant - Hexadecimal constant generated by the CFE to avoid forcing
876 * it to deal with 64 bit numbers.
878 #line 879 "Lexer.cpp"
880 /* Macros after this point can all be overridden by user definitions in
884 #ifndef YY_SKIP_YYWRAP
886 extern "C" int yywrap YY_PROTO(( void ));
888 extern int yywrap YY_PROTO(( void ));
893 static inline void yyunput YY_PROTO(( int c, char *buf_ptr ));
897 static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
900 #ifdef YY_NEED_STRLEN
901 static int yy_flex_strlen YY_PROTO(( yyconst char * ));
906 static int yyinput YY_PROTO(( void ));
908 static int input YY_PROTO(( void ));
913 static int yy_start_stack_ptr = 0;
914 static int yy_start_stack_depth = 0;
915 static int *yy_start_stack = 0;
916 #ifndef YY_NO_PUSH_STATE
917 static void yy_push_state YY_PROTO(( int new_state ));
919 #ifndef YY_NO_POP_STATE
920 static void yy_pop_state YY_PROTO(( void ));
922 #ifndef YY_NO_TOP_STATE
923 static int yy_top_state YY_PROTO(( void ));
927 #define YY_NO_PUSH_STATE 1
928 #define YY_NO_POP_STATE 1
929 #define YY_NO_TOP_STATE 1
932 #ifdef YY_MALLOC_DECL
940 /* Just try to get by without declaring the routines. This will fail
941 * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
942 * or sizeof(void*) != sizeof(int).
947 /* Amount of stuff to slurp up with each read. */
948 #ifndef YY_READ_BUF_SIZE
949 #define YY_READ_BUF_SIZE 8192
952 /* Copy whatever the last rule matched to the standard output. */
955 /* This used to be an fputs(), but since the string might contain NUL's,
956 * we now use fwrite().
958 #define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
961 /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
962 * is returned in "result".
965 #define YY_INPUT(buf,result,max_size) \
966 if ( yy_current_buffer->yy_is_interactive ) \
969 for ( n = 0; n < max_size && \
970 (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
973 buf[n++] = (char) c; \
974 if ( c == EOF && ferror( yyin ) ) \
975 YY_FATAL_ERROR( "input in flex scanner failed" ); \
978 else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
979 && ferror( yyin ) ) \
980 YY_FATAL_ERROR( "input in flex scanner failed" );
983 /* No semi-colon after return; correct usage is to write "yyterminate();" -
984 * we don't want an extra ';' after the "return" because that will cause
985 * some compilers to complain about unreachable statements.
988 #define yyterminate() return YY_NULL
991 /* Number of entries by which start-condition stack grows. */
992 #ifndef YY_START_STACK_INCR
993 #define YY_START_STACK_INCR 25
996 /* Report a fatal error. */
997 #ifndef YY_FATAL_ERROR
998 #define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
1001 /* Default declaration of generated scanner - a define so the user can
1002 * easily add parameters.
1005 #define YY_DECL int yylex YY_PROTO(( void ))
1008 /* Code executed at the beginning of each rule, after yytext and yyleng
1011 #ifndef YY_USER_ACTION
1012 #define YY_USER_ACTION
1015 /* Code executed at the end of each rule. */
1017 #define YY_BREAK break;
1020 #define YY_RULE_SETUP \
1025 register yy_state_type yy_current_state;
1026 register char *yy_cp = NULL, *yy_bp = NULL;
1027 register int yy_act;
1029 #line 179 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1032 #line 1033 "Lexer.cpp"
1043 yy_start = 1; /* first start state */
1051 if ( ! yy_current_buffer )
1053 yy_create_buffer( yyin, YY_BUF_SIZE );
1055 yy_load_buffer_state();
1058 while ( 1 ) /* loops until end-of-file is reached */
1062 /* Support of yytext. */
1063 *yy_cp = yy_hold_char;
1065 /* yy_bp points to the position in yy_ch_buf of the start of
1070 yy_current_state = yy_start;
1071 yy_state_ptr = yy_state_buf;
1072 *yy_state_ptr++ = yy_current_state;
1076 register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
1077 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
1079 yy_current_state = (int) yy_def[yy_current_state];
1080 if ( yy_current_state >= 397 )
1081 yy_c = yy_meta[(unsigned int) yy_c];
1083 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
1084 *yy_state_ptr++ = yy_current_state;
1087 while ( yy_current_state != 396 );
1090 yy_current_state = *--yy_state_ptr;
1091 yy_lp = yy_accept[yy_current_state];
1092 find_rule: /* we branch to this label when backing up */
1093 for ( ; ; ) /* until we find what rule we matched */
1095 if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
1097 yy_act = yy_acclist[yy_lp];
1099 yy_full_match = yy_cp;
1104 yy_current_state = *--yy_state_ptr;
1105 yy_lp = yy_accept[yy_current_state];
1108 YY_DO_BEFORE_ACTION;
1110 if ( yy_act != YY_END_OF_BUFFER )
1113 for ( yyl = 0; yyl < yyleng; ++yyl )
1114 if ( yytext[yyl] == '\n' )
1118 do_action: /* This label is used only to access EOF actions. */
1122 { /* beginning of action switch */
1125 #line 181 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1126 { /* Ignore comments for now */ }
1130 #line 183 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1131 { return BEGINTOK; }
1135 #line 184 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1140 #line 185 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1145 #line 186 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1146 { return FALSETOK; }
1150 #line 187 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1155 #line 188 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1160 #line 189 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1161 { return CONSTANT; }
1165 #line 190 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1166 { return INTERNAL; }
1170 #line 191 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1171 { return LINKONCE; }
1175 #line 192 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1180 #line 193 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1181 { return APPENDING; }
1185 #line 194 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1186 { return EXTERNAL; } /* Deprecated, turn into external */
1190 #line 195 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1191 { return EXTERNAL; }
1195 #line 196 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1196 { return IMPLEMENTATION; }
1200 #line 197 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1201 { return ZEROINITIALIZER; }
1205 #line 198 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1206 { return DOTDOTDOT; }
1210 #line 199 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1215 #line 200 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1216 { return NULL_TOK; }
1220 #line 201 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1225 #line 202 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1226 { RET_TOK(TermOpVal, Unwind, UNWIND); }
1230 #line 203 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1231 { return NOT; } /* Deprecated, turned into XOR */
1235 #line 204 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1240 #line 205 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1245 #line 206 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1250 #line 207 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1255 #line 208 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1260 #line 209 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1261 { return POINTERSIZE; }
1265 #line 210 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1270 #line 211 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1275 #line 212 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1276 { return VOLATILE; }
1280 #line 214 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1285 #line 215 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1290 #line 216 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1291 { return FASTCC_TOK; }
1295 #line 217 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1296 { return COLDCC_TOK; }
1300 #line 219 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1301 { llvmAsmlval.PrimType = Type::VoidTy ; return VOID; }
1305 #line 220 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1306 { llvmAsmlval.PrimType = Type::BoolTy ; return BOOL; }
1310 #line 221 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1311 { llvmAsmlval.PrimType = Type::SByteTy ; return SBYTE; }
1315 #line 222 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1316 { llvmAsmlval.PrimType = Type::UByteTy ; return UBYTE; }
1320 #line 223 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1321 { llvmAsmlval.PrimType = Type::ShortTy ; return SHORT; }
1325 #line 224 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1326 { llvmAsmlval.PrimType = Type::UShortTy; return USHORT; }
1330 #line 225 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1331 { llvmAsmlval.PrimType = Type::IntTy ; return INT; }
1335 #line 226 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1336 { llvmAsmlval.PrimType = Type::UIntTy ; return UINT; }
1340 #line 227 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1341 { llvmAsmlval.PrimType = Type::LongTy ; return LONG; }
1345 #line 228 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1346 { llvmAsmlval.PrimType = Type::ULongTy ; return ULONG; }
1350 #line 229 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1351 { llvmAsmlval.PrimType = Type::FloatTy ; return FLOAT; }
1355 #line 230 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1356 { llvmAsmlval.PrimType = Type::DoubleTy; return DOUBLE; }
1360 #line 231 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1361 { llvmAsmlval.PrimType = Type::LabelTy ; return LABEL; }
1365 #line 232 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1370 #line 233 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1375 #line 235 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1376 { RET_TOK(BinaryOpVal, Add, ADD); }
1380 #line 236 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1381 { RET_TOK(BinaryOpVal, Sub, SUB); }
1385 #line 237 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1386 { RET_TOK(BinaryOpVal, Mul, MUL); }
1390 #line 238 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1391 { RET_TOK(BinaryOpVal, Div, DIV); }
1395 #line 239 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1396 { RET_TOK(BinaryOpVal, Rem, REM); }
1400 #line 240 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1401 { RET_TOK(BinaryOpVal, And, AND); }
1405 #line 241 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1406 { RET_TOK(BinaryOpVal, Or , OR ); }
1410 #line 242 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1411 { RET_TOK(BinaryOpVal, Xor, XOR); }
1415 #line 243 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1416 { RET_TOK(BinaryOpVal, SetNE, SETNE); }
1420 #line 244 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1421 { RET_TOK(BinaryOpVal, SetEQ, SETEQ); }
1425 #line 245 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1426 { RET_TOK(BinaryOpVal, SetLT, SETLT); }
1430 #line 246 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1431 { RET_TOK(BinaryOpVal, SetGT, SETGT); }
1435 #line 247 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1436 { RET_TOK(BinaryOpVal, SetLE, SETLE); }
1440 #line 248 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1441 { RET_TOK(BinaryOpVal, SetGE, SETGE); }
1445 #line 250 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1446 { RET_TOK(OtherOpVal, PHI, PHI_TOK); }
1450 #line 251 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1451 { RET_TOK(OtherOpVal, Call, CALL); }
1455 #line 252 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1456 { RET_TOK(OtherOpVal, Cast, CAST); }
1460 #line 253 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1461 { RET_TOK(OtherOpVal, Select, SELECT); }
1465 #line 254 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1466 { RET_TOK(OtherOpVal, Shl, SHL); }
1470 #line 255 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1471 { RET_TOK(OtherOpVal, Shr, SHR); }
1475 #line 256 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1476 { return VANEXT_old; }
1480 #line 257 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1481 { return VAARG_old; }
1485 #line 258 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1486 { RET_TOK(OtherOpVal, VAArg , VAARG); }
1490 #line 259 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1491 { RET_TOK(TermOpVal, Ret, RET); }
1495 #line 260 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1496 { RET_TOK(TermOpVal, Br, BR); }
1500 #line 261 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1501 { RET_TOK(TermOpVal, Switch, SWITCH); }
1505 #line 262 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1506 { RET_TOK(TermOpVal, Invoke, INVOKE); }
1510 #line 263 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1511 { RET_TOK(TermOpVal, Unwind, UNWIND); }
1515 #line 264 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1516 { RET_TOK(TermOpVal, Unreachable, UNREACHABLE); }
1520 #line 266 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1521 { RET_TOK(MemOpVal, Malloc, MALLOC); }
1525 #line 267 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1526 { RET_TOK(MemOpVal, Alloca, ALLOCA); }
1530 #line 268 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1531 { RET_TOK(MemOpVal, Free, FREE); }
1535 #line 269 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1536 { RET_TOK(MemOpVal, Load, LOAD); }
1540 #line 270 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1541 { RET_TOK(MemOpVal, Store, STORE); }
1545 #line 271 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1546 { RET_TOK(MemOpVal, GetElementPtr, GETELEMENTPTR); }
1550 #line 274 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1552 UnEscapeLexed(yytext+1);
1553 llvmAsmlval.StrVal = strdup(yytext+1); // Skip %
1559 #line 279 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1561 yytext[strlen(yytext)-1] = 0; // nuke colon
1562 UnEscapeLexed(yytext);
1563 llvmAsmlval.StrVal = strdup(yytext);
1569 #line 285 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1571 yytext[strlen(yytext)-2] = 0; // nuke colon, end quote
1572 UnEscapeLexed(yytext+1);
1573 llvmAsmlval.StrVal = strdup(yytext+1);
1579 #line 292 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1580 { // Note that we cannot unescape a string constant here! The
1581 // string constant might contain a \00 which would not be
1582 // understood by the string stuff. It is valid to make a
1583 // [sbyte] c"Hello World\00" constant, for example.
1585 yytext[strlen(yytext)-1] = 0; // nuke end quote
1586 llvmAsmlval.StrVal = strdup(yytext+1); // Nuke start quote
1587 return STRINGCONSTANT;
1592 #line 303 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1593 { llvmAsmlval.UInt64Val = atoull(yytext); return EUINT64VAL; }
1597 #line 304 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1599 uint64_t Val = atoull(yytext+1);
1600 // +1: we have bigger negative range
1601 if (Val > (uint64_t)INT64_MAX+1)
1602 ThrowException("Constant too large for signed 64 bits!");
1603 llvmAsmlval.SInt64Val = -Val;
1609 #line 312 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1611 llvmAsmlval.UInt64Val = HexIntToVal(yytext+3);
1612 return yytext[0] == 's' ? ESINT64VAL : EUINT64VAL;
1617 #line 317 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1619 uint64_t Val = atoull(yytext+1);
1620 if ((unsigned)Val != Val)
1621 ThrowException("Invalid value number (too large)!");
1622 llvmAsmlval.UIntVal = unsigned(Val);
1628 #line 324 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1630 uint64_t Val = atoull(yytext+2);
1631 // +1: we have bigger negative range
1632 if (Val > (uint64_t)INT32_MAX+1)
1633 ThrowException("Constant too large for signed 32 bits!");
1634 llvmAsmlval.SIntVal = (int)-Val;
1640 #line 333 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1641 { llvmAsmlval.FPVal = atof(yytext); return FPVAL; }
1645 #line 334 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1646 { llvmAsmlval.FPVal = HexToFP(yytext); return FPVAL; }
1648 case YY_STATE_EOF(INITIAL):
1649 #line 336 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1651 /* Make sure to free the internal buffers for flex when we are
1652 * done reading our input!
1654 yy_delete_buffer(YY_CURRENT_BUFFER);
1660 #line 344 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1661 { /* Ignore whitespace */ }
1665 #line 345 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1666 { return yytext[0]; }
1670 #line 347 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
1671 YY_FATAL_ERROR( "flex scanner jammed" );
1673 #line 1674 "Lexer.cpp"
1675 case YY_END_OF_BUFFER:
1677 /* Amount of text matched not including the EOB char. */
1678 int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
1680 /* Undo the effects of YY_DO_BEFORE_ACTION. */
1681 *yy_cp = yy_hold_char;
1682 YY_RESTORE_YY_MORE_OFFSET
1684 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
1686 /* We're scanning a new file or input source. It's
1687 * possible that this happened because the user
1688 * just pointed yyin at a new source and called
1689 * yylex(). If so, then we have to assure
1690 * consistency between yy_current_buffer and our
1691 * globals. Here is the right place to do so, because
1692 * this is the first action (other than possibly a
1693 * back-up) that will match for the new input source.
1695 yy_n_chars = yy_current_buffer->yy_n_chars;
1696 yy_current_buffer->yy_input_file = yyin;
1697 yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
1700 /* Note that here we test for yy_c_buf_p "<=" to the position
1701 * of the first EOB in the buffer, since yy_c_buf_p will
1702 * already have been incremented past the NUL character
1703 * (since all states make transitions on EOB to the
1704 * end-of-buffer state). Contrast this with the test
1707 if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
1708 { /* This was really a NUL. */
1709 yy_state_type yy_next_state;
1711 yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
1713 yy_current_state = yy_get_previous_state();
1715 /* Okay, we're now positioned to make the NUL
1716 * transition. We couldn't have
1717 * yy_get_previous_state() go ahead and do it
1718 * for us because it doesn't know how to deal
1719 * with the possibility of jamming (and we don't
1720 * want to build jamming into it because then it
1721 * will run more slowly).
1724 yy_next_state = yy_try_NUL_trans( yy_current_state );
1726 yy_bp = yytext_ptr + YY_MORE_ADJ;
1728 if ( yy_next_state )
1730 /* Consume the NUL. */
1731 yy_cp = ++yy_c_buf_p;
1732 yy_current_state = yy_next_state;
1739 goto yy_find_action;
1743 else switch ( yy_get_next_buffer() )
1745 case EOB_ACT_END_OF_FILE:
1747 yy_did_buffer_switch_on_eof = 0;
1751 /* Note: because we've taken care in
1752 * yy_get_next_buffer() to have set up
1753 * yytext, we can now set up
1754 * yy_c_buf_p so that if some total
1755 * hoser (like flex itself) wants to
1756 * call the scanner after we return the
1757 * YY_NULL, it'll still work - another
1758 * YY_NULL will get returned.
1760 yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
1762 yy_act = YY_STATE_EOF(YY_START);
1768 if ( ! yy_did_buffer_switch_on_eof )
1774 case EOB_ACT_CONTINUE_SCAN:
1776 yytext_ptr + yy_amount_of_matched_text;
1778 yy_current_state = yy_get_previous_state();
1781 yy_bp = yytext_ptr + YY_MORE_ADJ;
1784 case EOB_ACT_LAST_MATCH:
1786 &yy_current_buffer->yy_ch_buf[yy_n_chars];
1788 yy_current_state = yy_get_previous_state();
1791 yy_bp = yytext_ptr + YY_MORE_ADJ;
1792 goto yy_find_action;
1799 "fatal flex scanner internal error--no action found" );
1800 } /* end of action switch */
1801 } /* end of scanning one token */
1802 } /* end of yylex */
1805 /* yy_get_next_buffer - try to read in a new buffer
1807 * Returns a code representing an action:
1808 * EOB_ACT_LAST_MATCH -
1809 * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
1810 * EOB_ACT_END_OF_FILE - end of file
1813 static int yy_get_next_buffer()
1815 register char *dest = yy_current_buffer->yy_ch_buf;
1816 register char *source = yytext_ptr;
1817 register int number_to_move, i;
1820 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
1822 "fatal flex scanner internal error--end of buffer missed" );
1824 if ( yy_current_buffer->yy_fill_buffer == 0 )
1825 { /* Don't try to fill the buffer, so this is an EOF. */
1826 if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
1828 /* We matched a single character, the EOB, so
1829 * treat this as a final EOF.
1831 return EOB_ACT_END_OF_FILE;
1836 /* We matched some text prior to the EOB, first
1839 return EOB_ACT_LAST_MATCH;
1843 /* Try to read more data. */
1845 /* First move last chars to start of buffer. */
1846 number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
1848 for ( i = 0; i < number_to_move; ++i )
1849 *(dest++) = *(source++);
1851 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
1852 /* don't do the read, it's not guaranteed to return an EOF,
1855 yy_current_buffer->yy_n_chars = yy_n_chars = 0;
1860 yy_current_buffer->yy_buf_size - number_to_move - 1;
1862 while ( num_to_read <= 0 )
1863 { /* Not enough room in the buffer - grow it. */
1864 #ifdef YY_USES_REJECT
1866 "input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
1869 /* just a shorter name for the current buffer */
1870 YY_BUFFER_STATE b = yy_current_buffer;
1872 int yy_c_buf_p_offset =
1873 (int) (yy_c_buf_p - b->yy_ch_buf);
1875 if ( b->yy_is_our_buffer )
1877 int new_size = b->yy_buf_size * 2;
1879 if ( new_size <= 0 )
1880 b->yy_buf_size += b->yy_buf_size / 8;
1882 b->yy_buf_size *= 2;
1884 b->yy_ch_buf = (char *)
1885 /* Include room in for 2 EOB chars. */
1886 yy_flex_realloc( (void *) b->yy_ch_buf,
1887 b->yy_buf_size + 2 );
1890 /* Can't grow it, we don't own it. */
1893 if ( ! b->yy_ch_buf )
1895 "fatal error - scanner input buffer overflow" );
1897 yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
1899 num_to_read = yy_current_buffer->yy_buf_size -
1904 if ( num_to_read > YY_READ_BUF_SIZE )
1905 num_to_read = YY_READ_BUF_SIZE;
1907 /* Read in more data. */
1908 YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
1909 yy_n_chars, num_to_read );
1911 yy_current_buffer->yy_n_chars = yy_n_chars;
1914 if ( yy_n_chars == 0 )
1916 if ( number_to_move == YY_MORE_ADJ )
1918 ret_val = EOB_ACT_END_OF_FILE;
1924 ret_val = EOB_ACT_LAST_MATCH;
1925 yy_current_buffer->yy_buffer_status =
1926 YY_BUFFER_EOF_PENDING;
1931 ret_val = EOB_ACT_CONTINUE_SCAN;
1933 yy_n_chars += number_to_move;
1934 yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
1935 yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
1937 yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
1943 /* yy_get_previous_state - get the state just before the EOB char was reached */
1945 static yy_state_type yy_get_previous_state()
1947 register yy_state_type yy_current_state;
1948 register char *yy_cp;
1950 yy_current_state = yy_start;
1951 yy_state_ptr = yy_state_buf;
1952 *yy_state_ptr++ = yy_current_state;
1954 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
1956 register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
1957 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
1959 yy_current_state = (int) yy_def[yy_current_state];
1960 if ( yy_current_state >= 397 )
1961 yy_c = yy_meta[(unsigned int) yy_c];
1963 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
1964 *yy_state_ptr++ = yy_current_state;
1967 return yy_current_state;
1971 /* yy_try_NUL_trans - try to make a transition on the NUL character
1974 * next_state = yy_try_NUL_trans( current_state );
1977 #ifdef YY_USE_PROTOS
1978 static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
1980 static yy_state_type yy_try_NUL_trans( yy_current_state )
1981 yy_state_type yy_current_state;
1984 register int yy_is_jam;
1986 register YY_CHAR yy_c = 1;
1987 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
1989 yy_current_state = (int) yy_def[yy_current_state];
1990 if ( yy_current_state >= 397 )
1991 yy_c = yy_meta[(unsigned int) yy_c];
1993 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
1994 yy_is_jam = (yy_current_state == 396);
1996 *yy_state_ptr++ = yy_current_state;
1998 return yy_is_jam ? 0 : yy_current_state;
2003 #ifdef YY_USE_PROTOS
2004 static inline void yyunput( int c, register char *yy_bp )
2006 static inline void yyunput( c, yy_bp )
2008 register char *yy_bp;
2011 register char *yy_cp = yy_c_buf_p;
2013 /* undo effects of setting up yytext */
2014 *yy_cp = yy_hold_char;
2016 if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
2017 { /* need to shift things up to make room */
2018 /* +2 for EOB chars. */
2019 register int number_to_move = yy_n_chars + 2;
2020 register char *dest = &yy_current_buffer->yy_ch_buf[
2021 yy_current_buffer->yy_buf_size + 2];
2022 register char *source =
2023 &yy_current_buffer->yy_ch_buf[number_to_move];
2025 while ( source > yy_current_buffer->yy_ch_buf )
2026 *--dest = *--source;
2028 yy_cp += (int) (dest - source);
2029 yy_bp += (int) (dest - source);
2030 yy_current_buffer->yy_n_chars =
2031 yy_n_chars = yy_current_buffer->yy_buf_size;
2033 if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
2034 YY_FATAL_ERROR( "flex scanner push-back overflow" );
2037 *--yy_cp = (char) c;
2043 yy_hold_char = *yy_cp;
2046 #endif /* ifndef YY_NO_UNPUT */
2051 static int yyinput()
2058 *yy_c_buf_p = yy_hold_char;
2060 if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
2062 /* yy_c_buf_p now points to the character we want to return.
2063 * If this occurs *before* the EOB characters, then it's a
2064 * valid NUL; if not, then we've hit the end of the buffer.
2066 if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
2067 /* This was really a NUL. */
2071 { /* need more input */
2072 int offset = yy_c_buf_p - yytext_ptr;
2075 switch ( yy_get_next_buffer() )
2077 case EOB_ACT_LAST_MATCH:
2078 /* This happens because yy_g_n_b()
2079 * sees that we've accumulated a
2080 * token and flags that we need to
2081 * try matching the token before
2082 * proceeding. But for input(),
2083 * there's no matching to consider.
2084 * So convert the EOB_ACT_LAST_MATCH
2085 * to EOB_ACT_END_OF_FILE.
2088 /* Reset buffer status. */
2093 case EOB_ACT_END_OF_FILE:
2098 if ( ! yy_did_buffer_switch_on_eof )
2107 case EOB_ACT_CONTINUE_SCAN:
2108 yy_c_buf_p = yytext_ptr + offset;
2114 c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
2115 *yy_c_buf_p = '\0'; /* preserve yytext */
2116 yy_hold_char = *++yy_c_buf_p;
2123 #endif /* YY_NO_INPUT */
2125 #ifdef YY_USE_PROTOS
2126 void yyrestart( FILE *input_file )
2128 void yyrestart( input_file )
2132 if ( ! yy_current_buffer )
2133 yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
2135 yy_init_buffer( yy_current_buffer, input_file );
2136 yy_load_buffer_state();
2140 #ifdef YY_USE_PROTOS
2141 void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
2143 void yy_switch_to_buffer( new_buffer )
2144 YY_BUFFER_STATE new_buffer;
2147 if ( yy_current_buffer == new_buffer )
2150 if ( yy_current_buffer )
2152 /* Flush out information for old buffer. */
2153 *yy_c_buf_p = yy_hold_char;
2154 yy_current_buffer->yy_buf_pos = yy_c_buf_p;
2155 yy_current_buffer->yy_n_chars = yy_n_chars;
2158 yy_current_buffer = new_buffer;
2159 yy_load_buffer_state();
2161 /* We don't actually know whether we did this switch during
2162 * EOF (yywrap()) processing, but the only time this flag
2163 * is looked at is after yywrap() is called, so it's safe
2164 * to go ahead and always set it.
2166 yy_did_buffer_switch_on_eof = 1;
2170 #ifdef YY_USE_PROTOS
2171 void yy_load_buffer_state( void )
2173 void yy_load_buffer_state()
2176 yy_n_chars = yy_current_buffer->yy_n_chars;
2177 yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
2178 yyin = yy_current_buffer->yy_input_file;
2179 yy_hold_char = *yy_c_buf_p;
2183 #ifdef YY_USE_PROTOS
2184 YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
2186 YY_BUFFER_STATE yy_create_buffer( file, size )
2193 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
2195 YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
2197 b->yy_buf_size = size;
2199 /* yy_ch_buf has to be 2 characters longer than the size given because
2200 * we need to put in 2 end-of-buffer characters.
2202 b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
2203 if ( ! b->yy_ch_buf )
2204 YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
2206 b->yy_is_our_buffer = 1;
2208 yy_init_buffer( b, file );
2214 #ifdef YY_USE_PROTOS
2215 void yy_delete_buffer( YY_BUFFER_STATE b )
2217 void yy_delete_buffer( b )
2224 if ( b == yy_current_buffer )
2225 yy_current_buffer = (YY_BUFFER_STATE) 0;
2227 if ( b->yy_is_our_buffer )
2228 yy_flex_free( (void *) b->yy_ch_buf );
2230 yy_flex_free( (void *) b );
2235 #ifdef YY_USE_PROTOS
2236 void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
2238 void yy_init_buffer( b, file )
2245 yy_flush_buffer( b );
2247 b->yy_input_file = file;
2248 b->yy_fill_buffer = 1;
2250 #if YY_ALWAYS_INTERACTIVE
2251 b->yy_is_interactive = 1;
2253 #if YY_NEVER_INTERACTIVE
2254 b->yy_is_interactive = 0;
2256 b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
2262 #ifdef YY_USE_PROTOS
2263 void yy_flush_buffer( YY_BUFFER_STATE b )
2265 void yy_flush_buffer( b )
2275 /* We always need two end-of-buffer characters. The first causes
2276 * a transition to the end-of-buffer state. The second causes
2277 * a jam in that state.
2279 b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
2280 b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
2282 b->yy_buf_pos = &b->yy_ch_buf[0];
2285 b->yy_buffer_status = YY_BUFFER_NEW;
2287 if ( b == yy_current_buffer )
2288 yy_load_buffer_state();
2292 #ifndef YY_NO_SCAN_BUFFER
2293 #ifdef YY_USE_PROTOS
2294 YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
2296 YY_BUFFER_STATE yy_scan_buffer( base, size )
2304 base[size-2] != YY_END_OF_BUFFER_CHAR ||
2305 base[size-1] != YY_END_OF_BUFFER_CHAR )
2306 /* They forgot to leave room for the EOB's. */
2309 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
2311 YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
2313 b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
2314 b->yy_buf_pos = b->yy_ch_buf = base;
2315 b->yy_is_our_buffer = 0;
2316 b->yy_input_file = 0;
2317 b->yy_n_chars = b->yy_buf_size;
2318 b->yy_is_interactive = 0;
2320 b->yy_fill_buffer = 0;
2321 b->yy_buffer_status = YY_BUFFER_NEW;
2323 yy_switch_to_buffer( b );
2330 #ifndef YY_NO_SCAN_STRING
2331 #ifdef YY_USE_PROTOS
2332 YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
2334 YY_BUFFER_STATE yy_scan_string( yy_str )
2335 yyconst char *yy_str;
2339 for ( len = 0; yy_str[len]; ++len )
2342 return yy_scan_bytes( yy_str, len );
2347 #ifndef YY_NO_SCAN_BYTES
2348 #ifdef YY_USE_PROTOS
2349 YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
2351 YY_BUFFER_STATE yy_scan_bytes( bytes, len )
2352 yyconst char *bytes;
2361 /* Get memory for full buffer, including space for trailing EOB's. */
2363 buf = (char *) yy_flex_alloc( n );
2365 YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
2367 for ( i = 0; i < len; ++i )
2370 buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
2372 b = yy_scan_buffer( buf, n );
2374 YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
2376 /* It's okay to grow etc. this buffer, and we should throw it
2377 * away when we're done.
2379 b->yy_is_our_buffer = 1;
2386 #ifndef YY_NO_PUSH_STATE
2387 #ifdef YY_USE_PROTOS
2388 static void yy_push_state( int new_state )
2390 static void yy_push_state( new_state )
2394 if ( yy_start_stack_ptr >= yy_start_stack_depth )
2398 yy_start_stack_depth += YY_START_STACK_INCR;
2399 new_size = yy_start_stack_depth * sizeof( int );
2401 if ( ! yy_start_stack )
2402 yy_start_stack = (int *) yy_flex_alloc( new_size );
2405 yy_start_stack = (int *) yy_flex_realloc(
2406 (void *) yy_start_stack, new_size );
2408 if ( ! yy_start_stack )
2410 "out of memory expanding start-condition stack" );
2413 yy_start_stack[yy_start_stack_ptr++] = YY_START;
2420 #ifndef YY_NO_POP_STATE
2421 static void yy_pop_state()
2423 if ( --yy_start_stack_ptr < 0 )
2424 YY_FATAL_ERROR( "start-condition stack underflow" );
2426 BEGIN(yy_start_stack[yy_start_stack_ptr]);
2431 #ifndef YY_NO_TOP_STATE
2432 static int yy_top_state()
2434 return yy_start_stack[yy_start_stack_ptr - 1];
2438 #ifndef YY_EXIT_FAILURE
2439 #define YY_EXIT_FAILURE 2
2442 #ifdef YY_USE_PROTOS
2443 static void yy_fatal_error( yyconst char msg[] )
2445 static void yy_fatal_error( msg )
2449 (void) fprintf( stderr, "%s\n", msg );
2450 exit( YY_EXIT_FAILURE );
2455 /* Redefine yyless() so it works in section 3 code. */
2461 /* Undo effects of setting up yytext. */ \
2462 yytext[yyleng] = yy_hold_char; \
2463 yy_c_buf_p = yytext + n; \
2464 yy_hold_char = *yy_c_buf_p; \
2465 *yy_c_buf_p = '\0'; \
2471 /* Internal utility routines. */
2474 #ifdef YY_USE_PROTOS
2475 static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
2477 static void yy_flex_strncpy( s1, s2, n )
2484 for ( i = 0; i < n; ++i )
2489 #ifdef YY_NEED_STRLEN
2490 #ifdef YY_USE_PROTOS
2491 static int yy_flex_strlen( yyconst char *s )
2493 static int yy_flex_strlen( s )
2498 for ( n = 0; s[n]; ++n )
2506 #ifdef YY_USE_PROTOS
2507 static void *yy_flex_alloc( yy_size_t size )
2509 static void *yy_flex_alloc( size )
2513 return (void *) malloc( size );
2516 #ifdef YY_USE_PROTOS
2517 static inline void *yy_flex_realloc( void *ptr, yy_size_t size )
2519 static inline void *yy_flex_realloc( ptr, size )
2524 /* The cast to (char *) in the following accommodates both
2525 * implementations that use char* generic pointers, and those
2526 * that use void* generic pointers. It works with the latter
2527 * because both ANSI C and C++ allow castless assignment from
2528 * any pointer type to void*, and deal with argument conversions
2529 * as though doing an assignment.
2531 return (void *) realloc( (char *) ptr, size );
2534 #ifdef YY_USE_PROTOS
2535 static void yy_flex_free( void *ptr )
2537 static void yy_flex_free( ptr )
2551 #line 347 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"