1 #define yy_create_buffer Upgrade_create_buffer
2 #define yy_delete_buffer Upgrade_delete_buffer
3 #define yy_scan_buffer Upgrade_scan_buffer
4 #define yy_scan_string Upgrade_scan_string
5 #define yy_scan_bytes Upgrade_scan_bytes
6 #define yy_flex_debug Upgrade_flex_debug
7 #define yy_init_buffer Upgrade_init_buffer
8 #define yy_flush_buffer Upgrade_flush_buffer
9 #define yy_load_buffer_state Upgrade_load_buffer_state
10 #define yy_switch_to_buffer Upgrade_switch_to_buffer
11 #define yyin Upgradein
12 #define yyleng Upgradeleng
13 #define yylex Upgradelex
14 #define yyout Upgradeout
15 #define yyrestart Upgraderestart
16 #define yytext Upgradetext
17 #define yylineno Upgradelineno
19 #line 20 "UpgradeLexer.cpp"
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 /* Some routines like yy_flex_realloc() are emitted as static but are
157 not called by all lexers. This generates warnings in some compilers,
158 notably GCC. Arrange to suppress these. */
160 #define YY_MAY_BE_UNUSED __attribute__((unused))
162 #define YY_MAY_BE_UNUSED
165 /* The following is because we cannot portably get our hands on size_t
166 * (without autoconf's help, which isn't available because we want
167 * flex-generated scanners to compile on their own).
169 typedef unsigned int yy_size_t;
172 struct yy_buffer_state
176 char *yy_ch_buf; /* input buffer */
177 char *yy_buf_pos; /* current position in input buffer */
179 /* Size of input buffer in bytes, not including room for EOB
182 yy_size_t yy_buf_size;
184 /* Number of characters read into yy_ch_buf, not including EOB
189 /* Whether we "own" the buffer - i.e., we know we created it,
190 * and can realloc() it to grow it, and should free() it to
193 int yy_is_our_buffer;
195 /* Whether this is an "interactive" input source; if so, and
196 * if we're using stdio for input, then we want to use getc()
197 * instead of fread(), to make sure we stop fetching input after
200 int yy_is_interactive;
202 /* Whether we're considered to be at the beginning of a line.
203 * If so, '^' rules will be active on the next match, otherwise
208 /* Whether to try to fill the input buffer when we reach the
213 int yy_buffer_status;
214 #define YY_BUFFER_NEW 0
215 #define YY_BUFFER_NORMAL 1
216 /* When an EOF's been seen but there's still some text to process
217 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
218 * shouldn't try reading from the input source any more. We might
219 * still have a bunch of tokens to match, though, because of
220 * possible backing-up.
222 * When we actually see the EOF, we change the status to "new"
223 * (via yyrestart()), so that the user can continue scanning by
224 * just pointing yyin at a new input file.
226 #define YY_BUFFER_EOF_PENDING 2
229 static YY_BUFFER_STATE yy_current_buffer = 0;
231 /* We provide macros for accessing buffer states in case in the
232 * future we want to put the buffer states in a more general
235 #define YY_CURRENT_BUFFER yy_current_buffer
238 /* yy_hold_char holds the character lost when yytext is formed. */
239 static char yy_hold_char;
241 static int yy_n_chars; /* number of characters read into yy_ch_buf */
246 /* Points to current character in buffer. */
247 static char *yy_c_buf_p = (char *) 0;
248 static int yy_init = 1; /* whether we need to initialize */
249 static int yy_start = 0; /* start state number */
251 /* Flag which is used to allow yywrap()'s to do buffer switches
252 * instead of setting up a fresh yyin. A bit of a hack ...
254 static int yy_did_buffer_switch_on_eof;
256 void yyrestart YY_PROTO(( FILE *input_file ));
258 void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
259 void yy_load_buffer_state YY_PROTO(( void ));
260 YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
261 void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
262 void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
263 void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
264 #define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
266 YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
267 YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
268 YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
270 static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
271 static inline void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )) YY_MAY_BE_UNUSED;
272 static void yy_flex_free YY_PROTO(( void * ));
274 #define yy_new_buffer yy_create_buffer
276 #define yy_set_interactive(is_interactive) \
278 if ( ! yy_current_buffer ) \
279 yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
280 yy_current_buffer->yy_is_interactive = is_interactive; \
283 #define yy_set_bol(at_bol) \
285 if ( ! yy_current_buffer ) \
286 yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
287 yy_current_buffer->yy_at_bol = at_bol; \
290 #define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
293 #define YY_USES_REJECT
296 #define YY_SKIP_YYWRAP
297 typedef unsigned char YY_CHAR;
298 FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
299 typedef int yy_state_type;
303 #define yytext_ptr yytext
305 static yy_state_type yy_get_previous_state YY_PROTO(( void ));
306 static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
307 static int yy_get_next_buffer YY_PROTO(( void ));
308 static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
310 /* Done after the current pattern has been matched and before the
311 * corresponding action - sets up yytext.
313 #define YY_DO_BEFORE_ACTION \
314 yytext_ptr = yy_bp; \
315 yyleng = (int) (yy_cp - yy_bp); \
316 yy_hold_char = *yy_cp; \
320 #define YY_NUM_RULES 156
321 #define YY_END_OF_BUFFER 157
322 static yyconst short int yy_acclist[234] =
324 157, 155, 156, 154, 155, 156, 154, 156, 155, 156,
325 155, 156, 155, 156, 155, 156, 155, 156, 155, 156,
326 147, 155, 156, 147, 155, 156, 1, 155, 156, 155,
327 156, 155, 156, 155, 156, 155, 156, 155, 156, 155,
328 156, 155, 156, 155, 156, 155, 156, 155, 156, 155,
329 156, 155, 156, 155, 156, 155, 156, 155, 156, 155,
330 156, 155, 156, 155, 156, 155, 156, 155, 156, 155,
331 156, 146, 144, 143, 143, 150, 148, 152, 147, 1,
332 129, 41, 89, 90, 75, 23, 146, 143, 143, 151,
333 152, 20, 152, 153, 63, 74, 39, 34, 42, 66,
335 3, 52, 65, 25, 99, 104, 102, 103, 101, 100,
336 105, 109, 70, 128, 94, 92, 83, 84, 93, 91,
337 64, 107, 98, 96, 97, 95, 108, 106, 76, 145,
338 152, 152, 86, 57, 110, 111, 88, 69, 136, 73,
339 87, 137, 54, 85, 22, 149, 68, 114, 72, 26,
340 4, 61, 67, 53, 71, 56, 11, 113, 152, 36,
341 2, 5, 58, 116, 60, 48, 78, 82, 80, 81,
342 79, 77, 50, 138, 112, 49, 55, 21, 126, 135,
343 45, 59, 30, 24, 44, 118, 117, 7, 131, 33,
344 134, 38, 62, 124, 120, 130, 27, 28, 119, 132,
346 51, 127, 125, 123, 43, 6, 29, 115, 37, 8,
347 17, 9, 122, 10, 121, 35, 12, 14, 13, 32,
348 40, 15, 31, 133, 139, 141, 142, 16, 46, 140,
352 static yyconst short int yy_accept[611] =
354 1, 1, 1, 2, 4, 7, 9, 11, 13, 15,
355 17, 19, 21, 24, 27, 30, 32, 34, 36, 38,
356 40, 42, 44, 46, 48, 50, 52, 54, 56, 58,
357 60, 62, 64, 66, 68, 70, 72, 72, 73, 73,
358 74, 75, 76, 77, 77, 78, 78, 79, 80, 80,
359 81, 81, 81, 81, 81, 81, 81, 81, 81, 82,
360 82, 83, 83, 83, 83, 83, 83, 83, 83, 83,
361 84, 84, 84, 84, 84, 84, 84, 84, 84, 84,
362 84, 84, 84, 84, 84, 84, 84, 84, 84, 84,
363 85, 85, 85, 85, 85, 85, 85, 85, 86, 86,
365 86, 86, 86, 86, 86, 86, 86, 86, 86, 86,
366 86, 86, 86, 86, 86, 86, 87, 87, 87, 87,
367 87, 87, 87, 87, 87, 87, 87, 87, 87, 87,
368 87, 87, 87, 87, 88, 89, 91, 92, 93, 94,
369 94, 95, 96, 96, 96, 97, 97, 97, 98, 98,
370 99, 99, 99, 99, 99, 100, 100, 100, 100, 100,
371 100, 100, 101, 101, 101, 102, 102, 102, 102, 102,
372 102, 102, 102, 102, 102, 102, 102, 102, 102, 102,
373 102, 103, 103, 103, 103, 103, 103, 103, 103, 103,
374 103, 104, 105, 105, 106, 107, 108, 109, 110, 111,
376 111, 112, 113, 113, 113, 114, 115, 115, 115, 115,
377 115, 115, 115, 115, 116, 117, 118, 118, 119, 119,
378 119, 119, 120, 121, 121, 121, 122, 122, 122, 122,
379 122, 122, 122, 122, 122, 123, 124, 125, 125, 125,
380 126, 126, 127, 127, 128, 128, 129, 129, 129, 129,
381 129, 129, 129, 129, 129, 129, 129, 129, 130, 130,
382 130, 131, 132, 132, 132, 132, 133, 133, 133, 133,
383 134, 134, 134, 135, 136, 137, 137, 137, 137, 137,
384 137, 137, 137, 137, 137, 137, 137, 137, 137, 137,
385 137, 138, 139, 139, 139, 139, 139, 140, 141, 141,
387 141, 142, 142, 142, 142, 142, 142, 142, 142, 142,
388 143, 144, 145, 145, 145, 146, 146, 146, 146, 147,
389 147, 148, 148, 148, 148, 148, 148, 148, 149, 149,
390 149, 149, 149, 150, 150, 150, 151, 151, 151, 152,
391 152, 153, 153, 154, 155, 155, 155, 155, 155, 155,
392 155, 156, 156, 156, 156, 156, 157, 157, 158, 158,
393 158, 159, 160, 161, 161, 161, 162, 162, 162, 162,
394 162, 162, 162, 162, 162, 162, 162, 162, 162, 162,
395 162, 163, 163, 164, 165, 165, 165, 165, 165, 165,
396 165, 165, 165, 165, 165, 166, 166, 166, 166, 166,
398 166, 166, 166, 167, 167, 167, 168, 169, 170, 171,
399 172, 173, 174, 174, 174, 174, 175, 175, 175, 175,
400 176, 177, 177, 178, 179, 179, 179, 179, 179, 179,
401 180, 180, 180, 180, 180, 180, 181, 181, 181, 182,
402 182, 182, 182, 182, 182, 182, 182, 183, 184, 185,
403 185, 185, 186, 187, 188, 188, 188, 189, 189, 189,
404 189, 189, 190, 190, 191, 192, 193, 194, 194, 194,
405 194, 195, 195, 195, 196, 197, 198, 199, 200, 200,
406 200, 201, 202, 203, 204, 204, 204, 204, 204, 204,
407 205, 205, 206, 206, 207, 208, 208, 208, 208, 208,
409 208, 209, 209, 209, 209, 209, 209, 209, 209, 209,
410 210, 210, 210, 210, 210, 210, 210, 210, 210, 210,
411 211, 211, 211, 211, 211, 212, 212, 212, 212, 212,
412 213, 214, 215, 215, 216, 216, 216, 216, 216, 217,
413 217, 217, 217, 218, 218, 219, 220, 220, 220, 220,
414 220, 220, 220, 220, 220, 220, 220, 220, 220, 220,
415 221, 221, 221, 221, 221, 221, 221, 221, 222, 222,
416 222, 222, 222, 222, 223, 223, 223, 223, 223, 224,
417 224, 224, 225, 225, 225, 225, 225, 225, 225, 225,
418 225, 225, 225, 225, 225, 225, 226, 226, 227, 228,
420 229, 229, 230, 230, 231, 232, 233, 233, 234, 234
423 static yyconst int yy_ec[256] =
425 1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
426 1, 1, 2, 1, 1, 1, 1, 1, 1, 1,
427 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
428 1, 2, 1, 4, 1, 5, 6, 1, 1, 1,
429 1, 1, 7, 1, 8, 9, 1, 10, 11, 11,
430 11, 11, 11, 12, 11, 13, 11, 14, 15, 1,
431 1, 1, 1, 1, 16, 16, 16, 16, 17, 16,
432 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
433 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
434 1, 1, 1, 1, 18, 1, 19, 20, 21, 22,
436 23, 24, 25, 26, 27, 5, 28, 29, 30, 31,
437 32, 33, 34, 35, 36, 37, 38, 39, 40, 41,
438 42, 43, 1, 1, 1, 1, 1, 1, 1, 1,
439 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
440 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
441 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
442 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
443 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
444 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
445 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
447 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
448 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
449 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
450 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
451 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
455 static yyconst int yy_meta[44] =
457 1, 1, 2, 1, 3, 1, 1, 3, 3, 3,
458 3, 3, 3, 4, 1, 3, 3, 3, 3, 3,
459 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
460 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
464 static yyconst short int yy_base[615] =
466 0, 0, 1308, 1309, 1309, 1309, 1303, 1292, 36, 40,
467 44, 50, 56, 62, 0, 63, 66, 81, 89, 47,
468 108, 91, 105, 96, 119, 117, 144, 128, 68, 170,
469 169, 202, 92, 111, 131, 125, 1301, 1309, 1290, 1309,
470 0, 207, 229, 234, 239, 70, 244, 259, 264, 0,
471 139, 145, 142, 76, 136, 156, 157, 31, 1289, 162,
472 164, 192, 48, 172, 268, 175, 173, 221, 212, 1288,
473 276, 278, 138, 186, 72, 279, 277, 280, 289, 249,
474 282, 290, 216, 281, 291, 189, 294, 284, 295, 1287,
475 297, 306, 73, 305, 316, 317, 246, 311, 318, 322,
477 323, 324, 327, 329, 330, 338, 332, 348, 350, 333,
478 337, 334, 362, 336, 364, 1286, 367, 351, 359, 371,
479 374, 379, 375, 381, 405, 386, 389, 403, 396, 378,
480 250, 376, 400, 1285, 0, 436, 440, 1284, 454, 471,
481 0, 1283, 382, 406, 1282, 410, 425, 1281, 415, 1280,
482 422, 430, 440, 456, 1279, 458, 459, 473, 412, 447,
483 460, 1278, 474, 442, 472, 477, 480, 476, 461, 478,
484 416, 488, 490, 491, 494, 495, 496, 492, 499, 506,
485 507, 500, 513, 505, 508, 520, 521, 523, 524, 525,
486 1277, 1276, 526, 1275, 1274, 1273, 1272, 1271, 1270, 527,
488 1269, 1268, 529, 533, 1267, 1266, 561, 538, 537, 542,
489 534, 572, 550, 1265, 1264, 1263, 553, 1262, 535, 575,
490 536, 1261, 1260, 576, 577, 1259, 555, 579, 540, 580,
491 586, 582, 585, 588, 1258, 1257, 1256, 593, 596, 1255,
492 590, 1254, 597, 1253, 600, 1252, 601, 602, 604, 605,
493 619, 609, 612, 618, 622, 611, 214, 1251, 628, 629,
494 1309, 635, 643, 651, 657, 662, 651, 663, 664, 1250,
495 665, 666, 1249, 1248, 1247, 667, 669, 672, 673, 675,
496 676, 677, 678, 683, 679, 686, 685, 691, 690, 693,
497 1246, 1245, 687, 697, 701, 702, 1244, 1243, 703, 707,
499 1242, 708, 709, 711, 713, 714, 719, 715, 721, 1241,
500 1240, 1239, 722, 724, 1238, 727, 729, 735, 0, 737,
501 1237, 741, 738, 742, 747, 748, 749, 1236, 743, 635,
502 750, 755, 1235, 760, 761, 1234, 763, 764, 1233, 767,
503 1232, 773, 1231, 1230, 775, 776, 778, 777, 781, 780,
504 1229, 783, 784, 789, 791, 1228, 792, 1227, 798, 793,
505 1226, 813, 1225, 794, 795, 1224, 801, 807, 816, 817,
506 822, 813, 796, 819, 825, 826, 828, 829, 830, 832,
507 1223, 833, 1222, 1221, 836, 837, 831, 842, 841, 843,
508 846, 853, 854, 855, 1220, 857, 858, 861, 862, 863,
510 866, 865, 1219, 876, 860, 1218, 1217, 1216, 1215, 1214,
511 1213, 1212, 877, 879, 880, 1211, 881, 882, 886, 1210,
512 1209, 884, 1208, 1207, 885, 890, 888, 887, 891, 1206,
513 898, 900, 901, 904, 907, 1205, 909, 911, 1204, 912,
514 916, 716, 917, 914, 915, 919, 1203, 1202, 1201, 935,
515 918, 1200, 1199, 1198, 925, 928, 1197, 938, 942, 943,
516 930, 1196, 945, 1195, 1194, 1193, 1192, 946, 949, 954,
517 1191, 950, 955, 1190, 1189, 1188, 1187, 1186, 956, 958,
518 1185, 1184, 1183, 1182, 957, 960, 968, 961, 962, 1181,
519 963, 1180, 973, 1179, 1178, 964, 975, 977, 978, 980,
521 1177, 981, 983, 984, 987, 988, 992, 994, 995, 1176,
522 997, 998, 1005, 1006, 1004, 1008, 1012, 1014, 920, 1175,
523 1015, 1017, 1020, 1021, 1174, 1023, 1024, 1025, 1026, 1171,
524 1162, 1160, 1029, 1159, 1027, 1044, 1032, 1028, 1158, 1045,
525 1049, 1033, 1157, 1050, 1155, 1154, 1053, 1055, 1056, 1057,
526 1059, 1060, 1061, 1063, 1065, 1066, 1067, 1069, 1071, 1152,
527 1074, 1077, 1080, 1082, 1083, 1085, 1087, 1148, 1090, 1091,
528 1096, 1097, 1098, 1147, 1095, 1101, 1102, 1103, 1145, 1107,
529 1108, 1140, 1106, 1109, 1114, 1118, 1122, 1123, 1126, 1129,
530 1128, 1130, 1131, 1132, 1133, 1070, 1134, 643, 552, 548,
532 1139, 444, 1144, 360, 285, 252, 1142, 133, 1309, 1177,
536 static yyconst short int yy_def[615] =
538 609, 1, 609, 609, 609, 609, 610, 611, 612, 609,
539 611, 611, 611, 611, 613, 611, 611, 611, 611, 611,
540 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
541 611, 611, 611, 611, 611, 611, 610, 609, 611, 609,
542 614, 614, 609, 609, 611, 611, 611, 611, 611, 613,
543 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
544 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
545 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
546 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
547 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
549 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
550 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
551 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
552 611, 611, 611, 609, 614, 614, 609, 611, 611, 611,
553 49, 611, 611, 611, 611, 611, 611, 611, 611, 611,
554 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
555 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
556 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
557 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
558 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
560 611, 611, 611, 611, 611, 611, 49, 611, 611, 611,
561 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
562 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
563 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
564 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
565 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
566 609, 609, 609, 609, 611, 611, 611, 611, 611, 611,
567 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
568 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
569 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
571 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
572 611, 611, 611, 611, 611, 611, 611, 611, 207, 611,
573 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
574 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
575 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
576 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
577 611, 609, 611, 611, 611, 611, 611, 611, 611, 611,
578 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
579 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
580 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
582 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
583 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
584 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
585 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
586 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
587 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
588 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
589 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
590 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
591 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
593 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
594 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
595 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
596 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
597 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
598 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
599 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
600 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
601 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
602 611, 611, 611, 611, 611, 611, 611, 611, 611, 611,
604 611, 611, 611, 611, 611, 611, 611, 611, 0, 609,
608 static yyconst short int yy_nxt[1353] =
610 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
611 14, 14, 14, 4, 15, 8, 8, 8, 16, 17,
612 18, 19, 20, 21, 22, 8, 23, 8, 24, 25,
613 26, 27, 28, 8, 29, 30, 31, 32, 33, 34,
614 35, 8, 36, 42, 40, 43, 43, 43, 43, 44,
615 44, 44, 44, 45, 45, 45, 45, 40, 46, 135,
616 40, 40, 152, 40, 47, 48, 48, 48, 48, 40,
617 47, 48, 48, 48, 48, 40, 40, 69, 138, 40,
618 70, 40, 158, 40, 51, 40, 40, 71, 56, 40,
619 102, 52, 57, 53, 40, 54, 49, 58, 55, 60,
621 59, 61, 40, 172, 40, 40, 194, 64, 146, 40,
622 128, 65, 62, 78, 83, 66, 63, 67, 40, 79,
623 68, 40, 84, 129, 40, 80, 72, 85, 73, 74,
624 40, 86, 40, 130, 81, 82, 75, 87, 40, 90,
625 76, 40, 77, 131, 40, 41, 40, 133, 91, 40,
626 88, 40, 40, 99, 92, 40, 89, 40, 40, 100,
627 142, 147, 132, 145, 101, 148, 93, 170, 94, 40,
628 40, 143, 95, 144, 96, 40, 97, 40, 98, 103,
629 149, 150, 40, 40, 155, 40, 40, 115, 40, 104,
630 153, 105, 106, 151, 107, 108, 109, 154, 110, 40,
632 116, 163, 40, 117, 111, 40, 112, 113, 159, 114,
633 118, 103, 171, 162, 188, 40, 136, 136, 136, 136,
634 156, 119, 157, 120, 121, 40, 122, 40, 123, 40,
635 124, 359, 125, 165, 40, 183, 126, 127, 43, 43,
636 43, 43, 137, 44, 44, 44, 44, 47, 45, 45,
637 45, 45, 40, 139, 139, 139, 139, 40, 164, 40,
638 140, 257, 40, 40, 200, 40, 140, 47, 48, 48,
639 48, 48, 40, 141, 141, 141, 141, 40, 178, 141,
640 141, 40, 141, 141, 141, 141, 141, 141, 160, 40,
641 40, 40, 40, 40, 40, 40, 166, 40, 40, 175,
643 161, 173, 40, 40, 40, 190, 168, 40, 40, 186,
644 40, 184, 167, 169, 179, 174, 176, 185, 40, 40,
645 177, 187, 189, 191, 40, 180, 181, 195, 182, 40,
646 40, 40, 201, 192, 193, 40, 40, 40, 197, 199,
647 40, 196, 40, 40, 202, 40, 40, 40, 203, 40,
648 40, 40, 198, 205, 214, 222, 209, 204, 210, 224,
649 206, 40, 227, 40, 40, 225, 211, 207, 215, 223,
650 208, 220, 40, 40, 212, 40, 216, 40, 213, 217,
651 40, 226, 218, 232, 40, 219, 221, 40, 40, 40,
652 228, 40, 40, 230, 40, 40, 256, 234, 229, 40,
654 233, 236, 40, 240, 231, 238, 267, 235, 249, 40,
655 258, 239, 241, 40, 250, 237, 40, 242, 40, 40,
656 251, 252, 254, 40, 255, 40, 243, 244, 40, 40,
657 279, 245, 269, 253, 259, 40, 246, 268, 40, 247,
658 260, 271, 272, 40, 248, 136, 136, 136, 136, 262,
659 262, 262, 262, 40, 292, 40, 263, 40, 273, 270,
660 40, 284, 263, 139, 139, 139, 139, 40, 274, 40,
661 140, 40, 40, 40, 40, 280, 140, 264, 265, 276,
662 266, 266, 266, 266, 40, 40, 40, 40, 281, 40,
663 40, 40, 275, 40, 277, 278, 282, 290, 285, 286,
665 283, 40, 287, 40, 40, 40, 293, 40, 40, 40,
666 291, 289, 40, 40, 288, 300, 297, 299, 40, 40,
667 40, 40, 295, 298, 301, 296, 40, 302, 303, 304,
668 294, 306, 308, 40, 40, 307, 40, 40, 40, 40,
669 40, 310, 40, 305, 309, 311, 40, 40, 40, 40,
670 40, 40, 313, 40, 315, 40, 323, 312, 330, 317,
671 316, 40, 314, 40, 337, 40, 40, 332, 40, 318,
672 319, 319, 319, 319, 320, 321, 319, 319, 322, 319,
673 319, 319, 319, 319, 319, 40, 328, 329, 40, 40,
674 40, 335, 40, 40, 324, 40, 325, 331, 40, 40,
676 326, 40, 327, 40, 341, 333, 40, 336, 339, 40,
677 40, 334, 338, 40, 40, 40, 340, 40, 40, 347,
678 346, 342, 40, 349, 40, 40, 343, 345, 350, 344,
679 348, 40, 40, 351, 355, 40, 352, 353, 358, 356,
680 357, 40, 40, 354, 262, 262, 262, 262, 40, 264,
681 264, 263, 362, 362, 362, 362, 40, 263, 413, 360,
682 362, 362, 362, 362, 40, 361, 266, 266, 266, 266,
683 40, 266, 266, 266, 266, 40, 40, 40, 40, 40,
684 40, 363, 40, 364, 367, 40, 40, 368, 40, 40,
685 40, 40, 40, 372, 365, 366, 40, 377, 40, 40,
687 40, 371, 373, 40, 40, 369, 40, 375, 370, 380,
688 40, 376, 381, 382, 40, 40, 40, 374, 378, 379,
689 40, 40, 40, 383, 40, 389, 40, 40, 40, 40,
690 390, 388, 40, 384, 40, 40, 385, 40, 386, 387,
691 40, 394, 40, 391, 393, 392, 396, 395, 40, 397,
692 40, 40, 399, 398, 40, 40, 40, 493, 405, 403,
693 40, 40, 40, 40, 400, 401, 402, 404, 40, 407,
694 409, 411, 414, 40, 40, 406, 40, 40, 415, 412,
695 40, 417, 416, 408, 410, 418, 40, 420, 40, 40,
696 40, 40, 419, 40, 40, 421, 40, 40, 422, 426,
698 423, 424, 40, 425, 40, 40, 40, 40, 40, 40,
699 427, 40, 436, 430, 40, 444, 437, 428, 429, 435,
700 40, 433, 362, 362, 362, 362, 40, 439, 432, 40,
701 40, 431, 40, 434, 440, 40, 438, 441, 40, 40,
702 442, 40, 40, 40, 40, 40, 40, 443, 447, 40,
703 40, 445, 451, 452, 40, 40, 40, 446, 448, 40,
704 450, 455, 453, 454, 456, 449, 40, 40, 40, 457,
705 40, 40, 458, 40, 40, 40, 40, 462, 40, 40,
706 464, 465, 459, 460, 466, 467, 461, 463, 468, 40,
707 40, 469, 40, 40, 40, 40, 471, 40, 40, 40,
709 40, 40, 473, 40, 40, 472, 475, 470, 477, 481,
710 480, 40, 474, 40, 40, 483, 478, 40, 476, 486,
711 40, 479, 40, 482, 40, 40, 485, 40, 40, 40,
712 40, 40, 40, 40, 484, 489, 492, 488, 40, 494,
713 487, 40, 491, 40, 543, 501, 496, 490, 40, 495,
714 497, 40, 498, 499, 500, 40, 40, 502, 40, 40,
715 503, 505, 40, 40, 504, 507, 506, 40, 40, 40,
716 40, 40, 511, 40, 40, 40, 40, 40, 512, 509,
717 508, 40, 513, 514, 510, 515, 40, 518, 40, 517,
718 40, 40, 519, 40, 40, 516, 40, 40, 522, 520,
720 40, 40, 526, 527, 521, 40, 525, 40, 40, 523,
721 40, 40, 529, 528, 532, 530, 524, 40, 40, 40,
722 536, 40, 531, 537, 538, 40, 539, 40, 40, 533,
723 40, 534, 541, 40, 40, 535, 40, 40, 40, 40,
724 40, 40, 40, 547, 540, 40, 40, 556, 551, 553,
725 542, 548, 544, 545, 549, 552, 546, 40, 40, 559,
726 555, 550, 40, 40, 554, 557, 40, 558, 40, 40,
727 40, 561, 40, 40, 40, 564, 40, 562, 40, 40,
728 40, 567, 40, 40, 40, 571, 560, 40, 565, 573,
729 40, 569, 563, 40, 570, 40, 40, 572, 40, 568,
731 40, 574, 566, 40, 40, 578, 575, 579, 40, 40,
732 40, 40, 576, 582, 40, 40, 40, 586, 577, 40,
733 40, 40, 40, 580, 583, 584, 585, 40, 588, 593,
734 591, 40, 581, 589, 592, 40, 40, 587, 590, 40,
735 594, 40, 40, 40, 40, 40, 40, 40, 595, 600,
736 601, 602, 40, 40, 597, 40, 596, 40, 40, 606,
737 40, 40, 598, 599, 605, 40, 607, 40, 40, 604,
738 40, 40, 40, 40, 603, 40, 608, 37, 37, 37,
739 37, 39, 39, 50, 40, 50, 50, 40, 40, 40,
740 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
742 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
743 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
744 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
745 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
746 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
747 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
748 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
749 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
750 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
751 40, 40, 40, 40, 40, 40, 40, 40, 261, 40,
753 40, 40, 40, 40, 134, 40, 38, 609, 3, 609,
754 609, 609, 609, 609, 609, 609, 609, 609, 609, 609,
755 609, 609, 609, 609, 609, 609, 609, 609, 609, 609,
756 609, 609, 609, 609, 609, 609, 609, 609, 609, 609,
757 609, 609, 609, 609, 609, 609, 609, 609, 609, 609,
761 static yyconst short int yy_chk[1353] =
763 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
764 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
765 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
766 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
767 1, 1, 1, 9, 58, 9, 9, 9, 9, 10,
768 10, 10, 10, 11, 11, 11, 11, 11, 12, 614,
769 20, 63, 58, 12, 13, 13, 13, 13, 13, 13,
770 14, 14, 14, 14, 14, 14, 16, 20, 46, 17,
771 20, 29, 63, 46, 16, 75, 93, 20, 17, 54,
772 29, 16, 17, 16, 18, 16, 13, 17, 16, 18,
774 17, 18, 19, 75, 22, 33, 93, 19, 54, 24,
775 33, 19, 18, 22, 24, 19, 18, 19, 23, 22,
776 19, 21, 24, 33, 34, 23, 21, 24, 21, 21,
777 26, 24, 25, 34, 23, 23, 21, 25, 36, 26,
778 21, 28, 21, 35, 35, 612, 608, 36, 26, 55,
779 25, 73, 51, 28, 26, 53, 25, 27, 52, 28,
780 51, 55, 35, 53, 28, 55, 27, 73, 27, 56,
781 57, 52, 27, 52, 27, 60, 27, 61, 27, 30,
782 56, 57, 31, 30, 61, 64, 67, 31, 66, 30,
783 60, 30, 30, 57, 30, 30, 30, 60, 30, 74,
785 31, 67, 86, 31, 30, 62, 30, 30, 64, 30,
786 31, 32, 74, 66, 86, 32, 42, 42, 42, 42,
787 62, 32, 62, 32, 32, 69, 32, 257, 32, 83,
788 32, 257, 32, 69, 68, 83, 32, 32, 43, 43,
789 43, 43, 44, 44, 44, 44, 44, 45, 45, 45,
790 45, 45, 45, 47, 47, 47, 47, 47, 68, 97,
791 47, 131, 80, 131, 97, 606, 47, 48, 48, 48,
792 48, 48, 48, 49, 49, 49, 49, 49, 80, 49,
793 49, 65, 49, 49, 49, 49, 49, 49, 65, 71,
794 77, 72, 76, 78, 84, 81, 71, 88, 605, 77,
796 65, 76, 79, 82, 85, 88, 72, 87, 89, 85,
797 91, 84, 71, 72, 81, 76, 78, 84, 94, 92,
798 79, 85, 87, 89, 98, 82, 82, 94, 82, 95,
799 96, 99, 98, 91, 92, 100, 101, 102, 95, 96,
800 103, 94, 104, 105, 99, 107, 110, 112, 100, 114,
801 111, 106, 95, 102, 107, 110, 105, 101, 106, 111,
802 102, 108, 114, 109, 118, 112, 106, 103, 107, 110,
803 104, 109, 119, 604, 106, 113, 108, 115, 106, 108,
804 117, 113, 108, 118, 120, 108, 109, 121, 123, 132,
805 115, 130, 122, 117, 124, 143, 130, 120, 115, 126,
807 119, 122, 127, 124, 117, 123, 143, 121, 126, 129,
808 132, 123, 124, 133, 127, 122, 128, 124, 125, 144,
809 128, 128, 129, 146, 129, 159, 125, 125, 149, 171,
810 159, 125, 146, 128, 133, 151, 125, 144, 147, 125,
811 133, 149, 151, 152, 125, 136, 136, 136, 136, 137,
812 137, 137, 137, 153, 171, 164, 137, 602, 152, 147,
813 160, 164, 137, 139, 139, 139, 139, 139, 153, 154,
814 139, 156, 157, 161, 169, 160, 139, 140, 140, 156,
815 140, 140, 140, 140, 140, 165, 158, 163, 161, 168,
816 166, 170, 154, 167, 157, 158, 163, 169, 165, 166,
818 163, 172, 167, 173, 174, 178, 172, 175, 176, 177,
819 170, 168, 179, 182, 167, 177, 175, 176, 184, 180,
820 181, 185, 174, 175, 178, 174, 183, 179, 180, 181,
821 173, 182, 184, 186, 187, 183, 188, 189, 190, 193,
822 200, 186, 203, 181, 185, 187, 204, 211, 219, 221,
823 209, 208, 189, 229, 193, 210, 211, 188, 219, 203,
824 200, 600, 190, 213, 229, 599, 217, 221, 227, 204,
825 207, 207, 207, 207, 208, 209, 207, 207, 210, 207,
826 207, 207, 207, 207, 207, 212, 213, 217, 220, 224,
827 225, 227, 228, 230, 212, 232, 212, 220, 233, 231,
829 212, 234, 212, 241, 232, 224, 238, 228, 231, 239,
830 243, 225, 230, 245, 247, 248, 231, 249, 250, 243,
831 241, 233, 252, 247, 256, 253, 234, 239, 248, 238,
832 245, 254, 251, 249, 253, 255, 250, 251, 256, 254,
833 255, 259, 260, 252, 262, 262, 262, 262, 330, 263,
834 263, 262, 263, 263, 263, 263, 598, 262, 330, 259,
835 264, 264, 264, 264, 267, 260, 265, 265, 265, 265,
836 265, 266, 266, 266, 266, 266, 268, 269, 271, 272,
837 276, 267, 277, 268, 272, 278, 279, 276, 280, 281,
838 282, 283, 285, 280, 269, 271, 284, 285, 287, 286,
840 293, 279, 281, 289, 288, 277, 290, 283, 278, 288,
841 294, 284, 289, 290, 295, 296, 299, 282, 286, 287,
842 300, 302, 303, 293, 304, 300, 305, 306, 308, 442,
843 302, 299, 307, 294, 309, 313, 295, 314, 295, 296,
844 316, 306, 317, 303, 305, 304, 308, 307, 318, 309,
845 320, 323, 314, 313, 322, 324, 329, 442, 323, 320,
846 325, 326, 327, 331, 316, 317, 318, 322, 332, 325,
847 326, 327, 331, 334, 335, 324, 337, 338, 332, 329,
848 340, 335, 334, 325, 326, 337, 342, 340, 345, 346,
849 348, 347, 338, 350, 349, 342, 352, 353, 345, 349,
851 346, 347, 354, 348, 355, 357, 360, 364, 365, 373,
852 350, 359, 364, 354, 367, 373, 365, 352, 353, 360,
853 368, 359, 362, 362, 362, 362, 372, 368, 357, 369,
854 370, 355, 374, 359, 369, 371, 367, 370, 375, 376,
855 371, 377, 378, 379, 387, 380, 382, 372, 376, 385,
856 386, 374, 380, 382, 389, 388, 390, 375, 377, 391,
857 379, 387, 385, 386, 388, 378, 392, 393, 394, 389,
858 396, 397, 390, 405, 398, 399, 400, 394, 402, 401,
859 397, 398, 391, 392, 399, 400, 393, 396, 401, 404,
860 413, 402, 414, 415, 417, 418, 405, 422, 425, 419,
862 428, 427, 414, 426, 429, 413, 417, 404, 419, 427,
863 426, 431, 415, 432, 433, 429, 422, 434, 418, 433,
864 435, 425, 437, 428, 438, 440, 432, 444, 445, 441,
865 443, 451, 446, 519, 431, 437, 441, 435, 455, 443,
866 434, 456, 440, 461, 519, 455, 445, 438, 450, 444,
867 446, 458, 450, 450, 451, 459, 460, 456, 463, 468,
868 458, 460, 469, 472, 459, 463, 461, 470, 473, 479,
869 485, 480, 472, 486, 488, 489, 491, 496, 473, 469,
870 468, 487, 479, 480, 470, 485, 493, 488, 497, 487,
871 498, 499, 489, 500, 502, 486, 503, 504, 496, 491,
873 505, 506, 500, 502, 493, 507, 499, 508, 509, 497,
874 511, 512, 504, 503, 507, 505, 498, 515, 513, 514,
875 512, 516, 506, 513, 514, 517, 515, 518, 521, 508,
876 522, 509, 517, 523, 524, 511, 526, 527, 528, 529,
877 535, 538, 533, 524, 516, 537, 542, 538, 529, 535,
878 518, 526, 521, 522, 527, 533, 523, 536, 540, 542,
879 537, 528, 541, 544, 536, 540, 547, 541, 548, 549,
880 550, 547, 551, 552, 553, 550, 554, 548, 555, 556,
881 557, 553, 558, 596, 559, 557, 544, 561, 551, 559,
882 562, 555, 549, 563, 556, 564, 565, 558, 566, 554,
884 567, 561, 552, 569, 570, 565, 562, 566, 575, 571,
885 572, 573, 563, 570, 576, 577, 578, 575, 564, 583,
886 580, 581, 584, 567, 571, 572, 573, 585, 577, 584,
887 581, 586, 569, 578, 583, 587, 588, 576, 580, 589,
888 585, 591, 590, 592, 593, 594, 595, 597, 586, 591,
889 592, 593, 601, 582, 588, 607, 587, 603, 579, 601,
890 574, 568, 589, 590, 597, 560, 603, 546, 545, 595,
891 543, 539, 534, 532, 594, 531, 607, 610, 610, 610,
892 610, 611, 611, 613, 530, 613, 613, 525, 520, 510,
893 501, 495, 494, 492, 490, 484, 483, 482, 481, 478,
895 477, 476, 475, 474, 471, 467, 466, 465, 464, 462,
896 457, 454, 453, 452, 449, 448, 447, 439, 436, 430,
897 424, 423, 421, 420, 416, 412, 411, 410, 409, 408,
898 407, 406, 403, 395, 384, 383, 381, 366, 363, 361,
899 358, 356, 351, 344, 343, 341, 339, 336, 333, 328,
900 321, 315, 312, 311, 310, 301, 298, 297, 292, 291,
901 275, 274, 273, 270, 258, 246, 244, 242, 240, 237,
902 236, 235, 226, 223, 222, 218, 216, 215, 214, 206,
903 205, 202, 201, 199, 198, 197, 196, 195, 194, 192,
904 191, 162, 155, 150, 148, 145, 142, 138, 134, 116,
906 90, 70, 59, 39, 37, 8, 7, 3, 609, 609,
907 609, 609, 609, 609, 609, 609, 609, 609, 609, 609,
908 609, 609, 609, 609, 609, 609, 609, 609, 609, 609,
909 609, 609, 609, 609, 609, 609, 609, 609, 609, 609,
910 609, 609, 609, 609, 609, 609, 609, 609, 609, 609,
914 static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
915 static char *yy_full_match;
919 *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
920 yy_cp = yy_full_match; /* restore poss. backed-over text */ \
924 #define yymore() yymore_used_but_not_detected
925 #define YY_MORE_ADJ 0
926 #define YY_RESTORE_YY_MORE_OFFSET
928 #line 1 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
930 /*===-- UpgradeLexer.l - Scanner for 1.9 assembly files --------*- C++ -*--===//
932 // The LLVM Compiler Infrastructure
934 // This file was developed by Reid Spencer and is distributed under the
935 // University of Illinois Open Source License. See LICENSE.TXT for details.
937 //===----------------------------------------------------------------------===//
939 // This file implements the flex scanner for LLVM 1.9 assembly languages files.
941 //===----------------------------------------------------------------------===*/
942 #define YY_NEVER_INTERACTIVE 1
943 #line 28 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
944 #include "UpgradeInternals.h"
945 #include "llvm/Module.h"
947 #include "UpgradeParser.h"
951 #define YY_INPUT(buf,result,max_size) \
953 if (LexInput->good() && !LexInput->eof()) { \
954 LexInput->read(buf,max_size); \
955 result = LexInput->gcount(); \
961 #define YY_NEVER_INTERACTIVE 1
963 // Construct a token value for a non-obsolete token
964 #define RET_TOK(type, Enum, sym) \
965 Upgradelval.type = Enum; \
968 #define RET_TY(sym,NewTY,sign) \
969 Upgradelval.PrimType.T = NewTY; \
970 Upgradelval.PrimType.S = sign; \
975 // TODO: All of the static identifiers are figured out by the lexer,
976 // these should be hashed to reduce the lexer size
978 // UnEscapeLexed - Run through the specified buffer and change \xx codes to the
979 // appropriate character. If AllowNull is set to false, a \00 value will cause
980 // an exception to be thrown.
982 // If AllowNull is set to true, the return value of the function points to the
983 // last character of the string in memory.
985 char *UnEscapeLexed(char *Buffer, bool AllowNull) {
987 for (char *BIn = Buffer; *BIn; ) {
988 if (BIn[0] == '\\' && isxdigit(BIn[1]) && isxdigit(BIn[2])) {
989 char Tmp = BIn[3]; BIn[3] = 0; // Terminate string
990 *BOut = (char)strtol(BIn+1, 0, 16); // Convert to number
991 if (!AllowNull && !*BOut)
992 error("String literal cannot accept \\00 escape!");
994 BIn[3] = Tmp; // Restore character
995 BIn += 3; // Skip over handled chars
1005 // atoull - Convert an ascii string of decimal digits into the unsigned long
1006 // long representation... this does not have to do input error checking,
1007 // because we know that the input will be matched by a suitable regex...
1009 static uint64_t atoull(const char *Buffer) {
1010 uint64_t Result = 0;
1011 for (; *Buffer; Buffer++) {
1012 uint64_t OldRes = Result;
1014 Result += *Buffer-'0';
1015 if (Result < OldRes) // Uh, oh, overflow detected!!!
1016 error("constant bigger than 64 bits detected!");
1021 static uint64_t HexIntToVal(const char *Buffer) {
1022 uint64_t Result = 0;
1023 for (; *Buffer; ++Buffer) {
1024 uint64_t OldRes = Result;
1027 if (C >= '0' && C <= '9')
1029 else if (C >= 'A' && C <= 'F')
1031 else if (C >= 'a' && C <= 'f')
1034 if (Result < OldRes) // Uh, oh, overflow detected!!!
1035 error("constant bigger than 64 bits detected!");
1041 // HexToFP - Convert the ascii string in hexidecimal format to the floating
1042 // point representation of it.
1044 static double HexToFP(const char *Buffer) {
1045 // Behave nicely in the face of C TBAA rules... see:
1046 // http://www.nullstone.com/htmls/category/aliastyp.htm
1051 UIntToFP.UI = HexIntToVal(Buffer);
1053 assert(sizeof(double) == sizeof(uint64_t) &&
1054 "Data sizes incompatible on this target!");
1055 return UIntToFP.FP; // Cast Hex constant to double
1059 } // End llvm namespace
1061 using namespace llvm;
1063 /* Comments start with a ; and go till end of line */
1064 /* Variable(Value) identifiers start with a % sign */
1065 /* Label identifiers end with a colon */
1066 /* Quoted names can contain any character except " and \ */
1067 /* [PN]Integer: match positive and negative literal integer values that
1068 * are preceeded by a '%' character. These represent unnamed variable slots.
1070 /* E[PN]Integer: match positive and negative literal integer values */
1071 /* FPConstant - A Floating point constant.
1073 /* HexFPConstant - Floating point constant represented in IEEE format as a
1074 * hexadecimal number for when exponential notation is not precise enough.
1076 /* HexIntConstant - Hexadecimal constant generated by the CFE to avoid forcing
1077 * it to deal with 64 bit numbers.
1079 #line 1080 "UpgradeLexer.cpp"
1081 /* Macros after this point can all be overridden by user definitions in
1085 #ifndef YY_SKIP_YYWRAP
1087 extern "C" int yywrap YY_PROTO(( void ));
1089 extern int yywrap YY_PROTO(( void ));
1094 static inline void yyunput YY_PROTO(( int c, char *buf_ptr ));
1098 static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
1101 #ifdef YY_NEED_STRLEN
1102 static int yy_flex_strlen YY_PROTO(( yyconst char * ));
1107 static int yyinput YY_PROTO(( void ));
1109 static int input YY_PROTO(( void ));
1114 static int yy_start_stack_ptr = 0;
1115 static int yy_start_stack_depth = 0;
1116 static int *yy_start_stack = 0;
1117 #ifndef YY_NO_PUSH_STATE
1118 static void yy_push_state YY_PROTO(( int new_state ));
1120 #ifndef YY_NO_POP_STATE
1121 static void yy_pop_state YY_PROTO(( void ));
1123 #ifndef YY_NO_TOP_STATE
1124 static int yy_top_state YY_PROTO(( void ));
1128 #define YY_NO_PUSH_STATE 1
1129 #define YY_NO_POP_STATE 1
1130 #define YY_NO_TOP_STATE 1
1133 #ifdef YY_MALLOC_DECL
1141 /* Just try to get by without declaring the routines. This will fail
1142 * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
1143 * or sizeof(void*) != sizeof(int).
1148 /* Amount of stuff to slurp up with each read. */
1149 #ifndef YY_READ_BUF_SIZE
1150 #define YY_READ_BUF_SIZE 8192
1153 /* Copy whatever the last rule matched to the standard output. */
1156 /* This used to be an fputs(), but since the string might contain NUL's,
1157 * we now use fwrite().
1159 #define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
1162 /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
1163 * is returned in "result".
1166 #define YY_INPUT(buf,result,max_size) \
1167 if ( yy_current_buffer->yy_is_interactive ) \
1170 for ( n = 0; n < max_size && \
1171 (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
1172 buf[n] = (char) c; \
1174 buf[n++] = (char) c; \
1175 if ( c == EOF && ferror( yyin ) ) \
1176 YY_FATAL_ERROR( "input in flex scanner failed" ); \
1179 else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
1180 && ferror( yyin ) ) \
1181 YY_FATAL_ERROR( "input in flex scanner failed" );
1184 /* No semi-colon after return; correct usage is to write "yyterminate();" -
1185 * we don't want an extra ';' after the "return" because that will cause
1186 * some compilers to complain about unreachable statements.
1189 #define yyterminate() return YY_NULL
1192 /* Number of entries by which start-condition stack grows. */
1193 #ifndef YY_START_STACK_INCR
1194 #define YY_START_STACK_INCR 25
1197 /* Report a fatal error. */
1198 #ifndef YY_FATAL_ERROR
1199 #define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
1202 /* Default declaration of generated scanner - a define so the user can
1203 * easily add parameters.
1206 #define YY_DECL int yylex YY_PROTO(( void ))
1209 /* Code executed at the beginning of each rule, after yytext and yyleng
1212 #ifndef YY_USER_ACTION
1213 #define YY_USER_ACTION
1216 /* Code executed at the end of each rule. */
1218 #define YY_BREAK break;
1221 #define YY_RULE_SETUP \
1226 register yy_state_type yy_current_state;
1227 register char *yy_cp = NULL, *yy_bp = NULL;
1228 register int yy_act;
1230 #line 189 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1233 #line 1234 "UpgradeLexer.cpp"
1244 yy_start = 1; /* first start state */
1252 if ( ! yy_current_buffer )
1254 yy_create_buffer( yyin, YY_BUF_SIZE );
1256 yy_load_buffer_state();
1259 while ( 1 ) /* loops until end-of-file is reached */
1263 /* Support of yytext. */
1264 *yy_cp = yy_hold_char;
1266 /* yy_bp points to the position in yy_ch_buf of the start of
1271 yy_current_state = yy_start;
1272 yy_state_ptr = yy_state_buf;
1273 *yy_state_ptr++ = yy_current_state;
1277 register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
1278 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
1280 yy_current_state = (int) yy_def[yy_current_state];
1281 if ( yy_current_state >= 610 )
1282 yy_c = yy_meta[(unsigned int) yy_c];
1284 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
1285 *yy_state_ptr++ = yy_current_state;
1288 while ( yy_current_state != 609 );
1291 yy_current_state = *--yy_state_ptr;
1292 yy_lp = yy_accept[yy_current_state];
1293 find_rule: /* we branch to this label when backing up */
1294 for ( ; ; ) /* until we find what rule we matched */
1296 if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
1298 yy_act = yy_acclist[yy_lp];
1300 yy_full_match = yy_cp;
1305 yy_current_state = *--yy_state_ptr;
1306 yy_lp = yy_accept[yy_current_state];
1309 YY_DO_BEFORE_ACTION;
1311 if ( yy_act != YY_END_OF_BUFFER )
1314 for ( yyl = 0; yyl < yyleng; ++yyl )
1315 if ( yytext[yyl] == '\n' )
1319 do_action: /* This label is used only to access EOF actions. */
1323 { /* beginning of action switch */
1326 #line 191 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1327 { /* Ignore comments for now */ }
1331 #line 193 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1332 { return BEGINTOK; }
1336 #line 194 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1341 #line 195 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1346 #line 196 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1347 { return FALSETOK; }
1351 #line 197 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1356 #line 198 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1361 #line 199 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1362 { return CONSTANT; }
1366 #line 200 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1367 { return INTERNAL; }
1371 #line 201 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1372 { return LINKONCE; }
1376 #line 202 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1381 #line 203 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1382 { return APPENDING; }
1386 #line 204 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1387 { return DLLIMPORT; }
1391 #line 205 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1392 { return DLLEXPORT; }
1396 #line 206 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1397 { return EXTERN_WEAK; }
1401 #line 207 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1402 { return EXTERNAL; } /* Deprecated, turn into external */
1406 #line 208 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1407 { return EXTERNAL; }
1411 #line 209 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1412 { return IMPLEMENTATION; }
1416 #line 210 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1417 { return ZEROINITIALIZER; }
1421 #line 211 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1422 { return DOTDOTDOT; }
1426 #line 212 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1431 #line 213 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1432 { return NULL_TOK; }
1436 #line 214 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1441 #line 215 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1446 #line 216 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1447 { return NOT; } /* Deprecated, turned into XOR */
1451 #line 217 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1456 #line 218 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1461 #line 219 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1466 #line 220 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1471 #line 221 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1476 #line 222 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1477 { return POINTERSIZE; }
1481 #line 223 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1482 { return DATALAYOUT; }
1486 #line 224 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1491 #line 225 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1496 #line 226 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1497 { return VOLATILE; }
1501 #line 227 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1506 #line 228 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1511 #line 229 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1516 #line 230 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1521 #line 231 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1522 { return SIDEEFFECT; }
1526 #line 233 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1531 #line 234 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1536 #line 235 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1537 { return CSRETCC_TOK; }
1541 #line 236 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1542 { return FASTCC_TOK; }
1546 #line 237 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1547 { return COLDCC_TOK; }
1551 #line 238 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1552 { return X86_STDCALLCC_TOK; }
1556 #line 239 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1557 { return X86_FASTCALLCC_TOK; }
1561 #line 241 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1562 { RET_TY(SBYTE, Type::Int8Ty, Signed); }
1566 #line 242 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1567 { RET_TY(UBYTE, Type::Int8Ty, Unsigned); }
1571 #line 243 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1572 { RET_TY(SHORT, Type::Int16Ty, Signed); }
1576 #line 244 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1577 { RET_TY(USHORT, Type::Int16Ty, Unsigned); }
1581 #line 245 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1582 { RET_TY(INT, Type::Int32Ty, Signed); }
1586 #line 246 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1587 { RET_TY(UINT, Type::Int32Ty, Unsigned); }
1591 #line 247 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1592 { RET_TY(LONG, Type::Int64Ty, Signed); }
1596 #line 248 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1597 { RET_TY(ULONG, Type::Int64Ty, Unsigned); }
1601 #line 249 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1602 { RET_TY(VOID, Type::VoidTy, Signless ); }
1606 #line 250 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1607 { RET_TY(BOOL, Type::Int1Ty, Unsigned ); }
1611 #line 251 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1612 { RET_TY(FLOAT, Type::FloatTy, Signless ); }
1616 #line 252 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1617 { RET_TY(DOUBLE, Type::DoubleTy,Signless); }
1621 #line 253 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1622 { RET_TY(LABEL, Type::LabelTy, Signless ); }
1626 #line 254 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1631 #line 255 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1636 #line 257 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1637 { RET_TOK(BinaryOpVal, AddOp, ADD); }
1641 #line 258 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1642 { RET_TOK(BinaryOpVal, SubOp, SUB); }
1646 #line 259 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1647 { RET_TOK(BinaryOpVal, MulOp, MUL); }
1651 #line 260 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1652 { RET_TOK(BinaryOpVal, DivOp, DIV); }
1656 #line 261 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1657 { RET_TOK(BinaryOpVal, UDivOp, UDIV); }
1661 #line 262 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1662 { RET_TOK(BinaryOpVal, SDivOp, SDIV); }
1666 #line 263 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1667 { RET_TOK(BinaryOpVal, FDivOp, FDIV); }
1671 #line 264 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1672 { RET_TOK(BinaryOpVal, RemOp, REM); }
1676 #line 265 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1677 { RET_TOK(BinaryOpVal, URemOp, UREM); }
1681 #line 266 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1682 { RET_TOK(BinaryOpVal, SRemOp, SREM); }
1686 #line 267 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1687 { RET_TOK(BinaryOpVal, FRemOp, FREM); }
1691 #line 268 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1692 { RET_TOK(BinaryOpVal, AndOp, AND); }
1696 #line 269 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1697 { RET_TOK(BinaryOpVal, OrOp , OR ); }
1701 #line 270 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1702 { RET_TOK(BinaryOpVal, XorOp, XOR); }
1706 #line 271 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1707 { RET_TOK(BinaryOpVal, SetNE, SETNE); }
1711 #line 272 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1712 { RET_TOK(BinaryOpVal, SetEQ, SETEQ); }
1716 #line 273 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1717 { RET_TOK(BinaryOpVal, SetLT, SETLT); }
1721 #line 274 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1722 { RET_TOK(BinaryOpVal, SetGT, SETGT); }
1726 #line 275 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1727 { RET_TOK(BinaryOpVal, SetLE, SETLE); }
1731 #line 276 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1732 { RET_TOK(BinaryOpVal, SetGE, SETGE); }
1736 #line 277 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1737 { RET_TOK(BinaryOpVal, ShlOp, SHL); }
1741 #line 278 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1742 { RET_TOK(BinaryOpVal, ShrOp, SHR); }
1746 #line 279 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1747 { RET_TOK(BinaryOpVal, LShrOp, LSHR); }
1751 #line 280 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1752 { RET_TOK(BinaryOpVal, AShrOp, ASHR); }
1756 #line 282 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1757 { RET_TOK(OtherOpVal, ICmpOp, ICMP); }
1761 #line 283 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1762 { RET_TOK(OtherOpVal, FCmpOp, FCMP); }
1766 #line 285 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1771 #line 286 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1776 #line 287 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1781 #line 288 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1786 #line 289 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1791 #line 290 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1796 #line 291 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1801 #line 292 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1806 #line 293 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1811 #line 294 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1816 #line 295 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1821 #line 296 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1826 #line 297 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1831 #line 298 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1836 #line 299 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1841 #line 300 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1846 #line 301 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1851 #line 302 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1856 #line 303 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1861 #line 304 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1866 #line 306 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1867 { RET_TOK(OtherOpVal, PHIOp, PHI_TOK); }
1871 #line 307 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1872 { RET_TOK(OtherOpVal, CallOp, CALL); }
1876 #line 308 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1877 { RET_TOK(CastOpVal, CastOp, CAST); }
1881 #line 309 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1882 { RET_TOK(CastOpVal, TruncOp, TRUNC); }
1886 #line 310 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1887 { RET_TOK(CastOpVal, ZExtOp , ZEXT); }
1891 #line 311 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1892 { RET_TOK(CastOpVal, SExtOp, SEXT); }
1896 #line 312 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1897 { RET_TOK(CastOpVal, FPTruncOp, FPTRUNC); }
1901 #line 313 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1902 { RET_TOK(CastOpVal, FPExtOp, FPEXT); }
1906 #line 314 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1907 { RET_TOK(CastOpVal, FPToUIOp, FPTOUI); }
1911 #line 315 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1912 { RET_TOK(CastOpVal, FPToSIOp, FPTOSI); }
1916 #line 316 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1917 { RET_TOK(CastOpVal, UIToFPOp, UITOFP); }
1921 #line 317 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1922 { RET_TOK(CastOpVal, SIToFPOp, SITOFP); }
1926 #line 318 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1927 { RET_TOK(CastOpVal, PtrToIntOp, PTRTOINT); }
1931 #line 319 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1932 { RET_TOK(CastOpVal, IntToPtrOp, INTTOPTR); }
1936 #line 320 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1937 { RET_TOK(CastOpVal, BitCastOp, BITCAST); }
1941 #line 321 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1942 { RET_TOK(OtherOpVal, SelectOp, SELECT); }
1946 #line 322 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1947 { return VANEXT_old; }
1951 #line 323 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1952 { return VAARG_old; }
1956 #line 324 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1957 { RET_TOK(OtherOpVal, VAArg , VAARG); }
1961 #line 325 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1962 { RET_TOK(TermOpVal, RetOp, RET); }
1966 #line 326 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1967 { RET_TOK(TermOpVal, BrOp, BR); }
1971 #line 327 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1972 { RET_TOK(TermOpVal, SwitchOp, SWITCH); }
1976 #line 328 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1977 { RET_TOK(TermOpVal, InvokeOp, INVOKE); }
1981 #line 329 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1986 #line 330 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1987 { RET_TOK(TermOpVal, UnreachableOp, UNREACHABLE); }
1991 #line 332 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1992 { RET_TOK(MemOpVal, MallocOp, MALLOC); }
1996 #line 333 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1997 { RET_TOK(MemOpVal, AllocaOp, ALLOCA); }
2001 #line 334 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2002 { RET_TOK(MemOpVal, FreeOp, FREE); }
2006 #line 335 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2007 { RET_TOK(MemOpVal, LoadOp, LOAD); }
2011 #line 336 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2012 { RET_TOK(MemOpVal, StoreOp, STORE); }
2016 #line 337 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2017 { RET_TOK(MemOpVal, GetElementPtrOp, GETELEMENTPTR); }
2021 #line 339 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2022 { RET_TOK(OtherOpVal, ExtractElementOp, EXTRACTELEMENT); }
2026 #line 340 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2027 { RET_TOK(OtherOpVal, InsertElementOp, INSERTELEMENT); }
2031 #line 341 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2032 { RET_TOK(OtherOpVal, ShuffleVectorOp, SHUFFLEVECTOR); }
2036 #line 344 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2038 UnEscapeLexed(yytext+1);
2039 Upgradelval.StrVal = strdup(yytext+1); // Skip %
2045 #line 349 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2047 yytext[strlen(yytext)-1] = 0; // nuke colon
2048 UnEscapeLexed(yytext);
2049 Upgradelval.StrVal = strdup(yytext);
2055 #line 355 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2057 yytext[strlen(yytext)-2] = 0; // nuke colon, end quote
2058 UnEscapeLexed(yytext+1);
2059 Upgradelval.StrVal = strdup(yytext+1);
2065 #line 362 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2066 { // Note that we cannot unescape a string constant here! The
2067 // string constant might contain a \00 which would not be
2068 // understood by the string stuff. It is valid to make a
2069 // [sbyte] c"Hello World\00" constant, for example.
2071 yytext[strlen(yytext)-1] = 0; // nuke end quote
2072 Upgradelval.StrVal = strdup(yytext+1); // Nuke start quote
2073 return STRINGCONSTANT;
2078 #line 373 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2079 { Upgradelval.UInt64Val = atoull(yytext); return EUINT64VAL; }
2083 #line 374 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2085 uint64_t Val = atoull(yytext+1);
2086 // +1: we have bigger negative range
2087 if (Val > (uint64_t)INT64_MAX+1)
2088 error("Constant too large for signed 64 bits!");
2089 Upgradelval.SInt64Val = -Val;
2095 #line 382 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2097 Upgradelval.UInt64Val = HexIntToVal(yytext+3);
2098 return yytext[0] == 's' ? ESINT64VAL : EUINT64VAL;
2103 #line 387 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2105 uint64_t Val = atoull(yytext+1);
2106 if ((unsigned)Val != Val)
2107 error("Invalid value number (too large)!");
2108 Upgradelval.UIntVal = unsigned(Val);
2114 #line 394 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2116 uint64_t Val = atoull(yytext+2);
2117 // +1: we have bigger negative range
2118 if (Val > (uint64_t)INT32_MAX+1)
2119 error("Constant too large for signed 32 bits!");
2120 Upgradelval.SIntVal = (int)-Val;
2126 #line 403 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2127 { Upgradelval.FPVal = atof(yytext); return FPVAL; }
2131 #line 404 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2132 { Upgradelval.FPVal = HexToFP(yytext); return FPVAL; }
2134 case YY_STATE_EOF(INITIAL):
2135 #line 406 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2137 /* Make sure to free the internal buffers for flex when we are
2138 * done reading our input!
2140 yy_delete_buffer(YY_CURRENT_BUFFER);
2146 #line 414 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2147 { /* Ignore whitespace */ }
2151 #line 415 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2152 { return yytext[0]; }
2156 #line 417 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2157 YY_FATAL_ERROR( "flex scanner jammed" );
2159 #line 2160 "UpgradeLexer.cpp"
2161 case YY_END_OF_BUFFER:
2163 /* Amount of text matched not including the EOB char. */
2164 int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
2166 /* Undo the effects of YY_DO_BEFORE_ACTION. */
2167 *yy_cp = yy_hold_char;
2168 YY_RESTORE_YY_MORE_OFFSET
2170 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
2172 /* We're scanning a new file or input source. It's
2173 * possible that this happened because the user
2174 * just pointed yyin at a new source and called
2175 * yylex(). If so, then we have to assure
2176 * consistency between yy_current_buffer and our
2177 * globals. Here is the right place to do so, because
2178 * this is the first action (other than possibly a
2179 * back-up) that will match for the new input source.
2181 yy_n_chars = yy_current_buffer->yy_n_chars;
2182 yy_current_buffer->yy_input_file = yyin;
2183 yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
2186 /* Note that here we test for yy_c_buf_p "<=" to the position
2187 * of the first EOB in the buffer, since yy_c_buf_p will
2188 * already have been incremented past the NUL character
2189 * (since all states make transitions on EOB to the
2190 * end-of-buffer state). Contrast this with the test
2193 if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
2194 { /* This was really a NUL. */
2195 yy_state_type yy_next_state;
2197 yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
2199 yy_current_state = yy_get_previous_state();
2201 /* Okay, we're now positioned to make the NUL
2202 * transition. We couldn't have
2203 * yy_get_previous_state() go ahead and do it
2204 * for us because it doesn't know how to deal
2205 * with the possibility of jamming (and we don't
2206 * want to build jamming into it because then it
2207 * will run more slowly).
2210 yy_next_state = yy_try_NUL_trans( yy_current_state );
2212 yy_bp = yytext_ptr + YY_MORE_ADJ;
2214 if ( yy_next_state )
2216 /* Consume the NUL. */
2217 yy_cp = ++yy_c_buf_p;
2218 yy_current_state = yy_next_state;
2225 goto yy_find_action;
2229 else switch ( yy_get_next_buffer() )
2231 case EOB_ACT_END_OF_FILE:
2233 yy_did_buffer_switch_on_eof = 0;
2237 /* Note: because we've taken care in
2238 * yy_get_next_buffer() to have set up
2239 * yytext, we can now set up
2240 * yy_c_buf_p so that if some total
2241 * hoser (like flex itself) wants to
2242 * call the scanner after we return the
2243 * YY_NULL, it'll still work - another
2244 * YY_NULL will get returned.
2246 yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
2248 yy_act = YY_STATE_EOF(YY_START);
2254 if ( ! yy_did_buffer_switch_on_eof )
2260 case EOB_ACT_CONTINUE_SCAN:
2262 yytext_ptr + yy_amount_of_matched_text;
2264 yy_current_state = yy_get_previous_state();
2267 yy_bp = yytext_ptr + YY_MORE_ADJ;
2270 case EOB_ACT_LAST_MATCH:
2272 &yy_current_buffer->yy_ch_buf[yy_n_chars];
2274 yy_current_state = yy_get_previous_state();
2277 yy_bp = yytext_ptr + YY_MORE_ADJ;
2278 goto yy_find_action;
2285 "fatal flex scanner internal error--no action found" );
2286 } /* end of action switch */
2287 } /* end of scanning one token */
2288 } /* end of yylex */
2291 /* yy_get_next_buffer - try to read in a new buffer
2293 * Returns a code representing an action:
2294 * EOB_ACT_LAST_MATCH -
2295 * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
2296 * EOB_ACT_END_OF_FILE - end of file
2299 static int yy_get_next_buffer()
2301 register char *dest = yy_current_buffer->yy_ch_buf;
2302 register char *source = yytext_ptr;
2303 register int number_to_move, i;
2306 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
2308 "fatal flex scanner internal error--end of buffer missed" );
2310 if ( yy_current_buffer->yy_fill_buffer == 0 )
2311 { /* Don't try to fill the buffer, so this is an EOF. */
2312 if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
2314 /* We matched a single character, the EOB, so
2315 * treat this as a final EOF.
2317 return EOB_ACT_END_OF_FILE;
2322 /* We matched some text prior to the EOB, first
2325 return EOB_ACT_LAST_MATCH;
2329 /* Try to read more data. */
2331 /* First move last chars to start of buffer. */
2332 number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
2334 for ( i = 0; i < number_to_move; ++i )
2335 *(dest++) = *(source++);
2337 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
2338 /* don't do the read, it's not guaranteed to return an EOF,
2341 yy_current_buffer->yy_n_chars = yy_n_chars = 0;
2346 yy_current_buffer->yy_buf_size - number_to_move - 1;
2348 while ( num_to_read <= 0 )
2349 { /* Not enough room in the buffer - grow it. */
2350 #ifdef YY_USES_REJECT
2352 "input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
2355 /* just a shorter name for the current buffer */
2356 YY_BUFFER_STATE b = yy_current_buffer;
2358 int yy_c_buf_p_offset =
2359 (int) (yy_c_buf_p - b->yy_ch_buf);
2361 if ( b->yy_is_our_buffer )
2363 int new_size = b->yy_buf_size * 2;
2365 if ( new_size <= 0 )
2366 b->yy_buf_size += b->yy_buf_size / 8;
2368 b->yy_buf_size *= 2;
2370 b->yy_ch_buf = (char *)
2371 /* Include room in for 2 EOB chars. */
2372 yy_flex_realloc( (void *) b->yy_ch_buf,
2373 b->yy_buf_size + 2 );
2376 /* Can't grow it, we don't own it. */
2379 if ( ! b->yy_ch_buf )
2381 "fatal error - scanner input buffer overflow" );
2383 yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
2385 num_to_read = yy_current_buffer->yy_buf_size -
2390 if ( num_to_read > YY_READ_BUF_SIZE )
2391 num_to_read = YY_READ_BUF_SIZE;
2393 /* Read in more data. */
2394 YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
2395 yy_n_chars, num_to_read );
2397 yy_current_buffer->yy_n_chars = yy_n_chars;
2400 if ( yy_n_chars == 0 )
2402 if ( number_to_move == YY_MORE_ADJ )
2404 ret_val = EOB_ACT_END_OF_FILE;
2410 ret_val = EOB_ACT_LAST_MATCH;
2411 yy_current_buffer->yy_buffer_status =
2412 YY_BUFFER_EOF_PENDING;
2417 ret_val = EOB_ACT_CONTINUE_SCAN;
2419 yy_n_chars += number_to_move;
2420 yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
2421 yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
2423 yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
2429 /* yy_get_previous_state - get the state just before the EOB char was reached */
2431 static yy_state_type yy_get_previous_state()
2433 register yy_state_type yy_current_state;
2434 register char *yy_cp;
2436 yy_current_state = yy_start;
2437 yy_state_ptr = yy_state_buf;
2438 *yy_state_ptr++ = yy_current_state;
2440 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
2442 register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
2443 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
2445 yy_current_state = (int) yy_def[yy_current_state];
2446 if ( yy_current_state >= 610 )
2447 yy_c = yy_meta[(unsigned int) yy_c];
2449 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
2450 *yy_state_ptr++ = yy_current_state;
2453 return yy_current_state;
2457 /* yy_try_NUL_trans - try to make a transition on the NUL character
2460 * next_state = yy_try_NUL_trans( current_state );
2463 #ifdef YY_USE_PROTOS
2464 static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
2466 static yy_state_type yy_try_NUL_trans( yy_current_state )
2467 yy_state_type yy_current_state;
2470 register int yy_is_jam;
2472 register YY_CHAR yy_c = 1;
2473 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
2475 yy_current_state = (int) yy_def[yy_current_state];
2476 if ( yy_current_state >= 610 )
2477 yy_c = yy_meta[(unsigned int) yy_c];
2479 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
2480 yy_is_jam = (yy_current_state == 609);
2482 *yy_state_ptr++ = yy_current_state;
2484 return yy_is_jam ? 0 : yy_current_state;
2489 #ifdef YY_USE_PROTOS
2490 static inline void yyunput( int c, register char *yy_bp )
2492 static inline void yyunput( c, yy_bp )
2494 register char *yy_bp;
2497 register char *yy_cp = yy_c_buf_p;
2499 /* undo effects of setting up yytext */
2500 *yy_cp = yy_hold_char;
2502 if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
2503 { /* need to shift things up to make room */
2504 /* +2 for EOB chars. */
2505 register int number_to_move = yy_n_chars + 2;
2506 register char *dest = &yy_current_buffer->yy_ch_buf[
2507 yy_current_buffer->yy_buf_size + 2];
2508 register char *source =
2509 &yy_current_buffer->yy_ch_buf[number_to_move];
2511 while ( source > yy_current_buffer->yy_ch_buf )
2512 *--dest = *--source;
2514 yy_cp += (int) (dest - source);
2515 yy_bp += (int) (dest - source);
2516 yy_current_buffer->yy_n_chars =
2517 yy_n_chars = yy_current_buffer->yy_buf_size;
2519 if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
2520 YY_FATAL_ERROR( "flex scanner push-back overflow" );
2523 *--yy_cp = (char) c;
2529 yy_hold_char = *yy_cp;
2532 #endif /* ifndef YY_NO_UNPUT */
2537 static int yyinput()
2544 *yy_c_buf_p = yy_hold_char;
2546 if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
2548 /* yy_c_buf_p now points to the character we want to return.
2549 * If this occurs *before* the EOB characters, then it's a
2550 * valid NUL; if not, then we've hit the end of the buffer.
2552 if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
2553 /* This was really a NUL. */
2557 { /* need more input */
2558 int offset = yy_c_buf_p - yytext_ptr;
2561 switch ( yy_get_next_buffer() )
2563 case EOB_ACT_LAST_MATCH:
2564 /* This happens because yy_g_n_b()
2565 * sees that we've accumulated a
2566 * token and flags that we need to
2567 * try matching the token before
2568 * proceeding. But for input(),
2569 * there's no matching to consider.
2570 * So convert the EOB_ACT_LAST_MATCH
2571 * to EOB_ACT_END_OF_FILE.
2574 /* Reset buffer status. */
2579 case EOB_ACT_END_OF_FILE:
2584 if ( ! yy_did_buffer_switch_on_eof )
2593 case EOB_ACT_CONTINUE_SCAN:
2594 yy_c_buf_p = yytext_ptr + offset;
2600 c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
2601 *yy_c_buf_p = '\0'; /* preserve yytext */
2602 yy_hold_char = *++yy_c_buf_p;
2609 #endif /* YY_NO_INPUT */
2611 #ifdef YY_USE_PROTOS
2612 void yyrestart( FILE *input_file )
2614 void yyrestart( input_file )
2618 if ( ! yy_current_buffer )
2619 yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
2621 yy_init_buffer( yy_current_buffer, input_file );
2622 yy_load_buffer_state();
2626 #ifdef YY_USE_PROTOS
2627 void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
2629 void yy_switch_to_buffer( new_buffer )
2630 YY_BUFFER_STATE new_buffer;
2633 if ( yy_current_buffer == new_buffer )
2636 if ( yy_current_buffer )
2638 /* Flush out information for old buffer. */
2639 *yy_c_buf_p = yy_hold_char;
2640 yy_current_buffer->yy_buf_pos = yy_c_buf_p;
2641 yy_current_buffer->yy_n_chars = yy_n_chars;
2644 yy_current_buffer = new_buffer;
2645 yy_load_buffer_state();
2647 /* We don't actually know whether we did this switch during
2648 * EOF (yywrap()) processing, but the only time this flag
2649 * is looked at is after yywrap() is called, so it's safe
2650 * to go ahead and always set it.
2652 yy_did_buffer_switch_on_eof = 1;
2656 #ifdef YY_USE_PROTOS
2657 void yy_load_buffer_state( void )
2659 void yy_load_buffer_state()
2662 yy_n_chars = yy_current_buffer->yy_n_chars;
2663 yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
2664 yyin = yy_current_buffer->yy_input_file;
2665 yy_hold_char = *yy_c_buf_p;
2669 #ifdef YY_USE_PROTOS
2670 YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
2672 YY_BUFFER_STATE yy_create_buffer( file, size )
2679 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
2681 YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
2683 b->yy_buf_size = size;
2685 /* yy_ch_buf has to be 2 characters longer than the size given because
2686 * we need to put in 2 end-of-buffer characters.
2688 b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
2689 if ( ! b->yy_ch_buf )
2690 YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
2692 b->yy_is_our_buffer = 1;
2694 yy_init_buffer( b, file );
2700 #ifdef YY_USE_PROTOS
2701 void yy_delete_buffer( YY_BUFFER_STATE b )
2703 void yy_delete_buffer( b )
2710 if ( b == yy_current_buffer )
2711 yy_current_buffer = (YY_BUFFER_STATE) 0;
2713 if ( b->yy_is_our_buffer )
2714 yy_flex_free( (void *) b->yy_ch_buf );
2716 yy_flex_free( (void *) b );
2721 #ifdef YY_USE_PROTOS
2722 void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
2724 void yy_init_buffer( b, file )
2731 yy_flush_buffer( b );
2733 b->yy_input_file = file;
2734 b->yy_fill_buffer = 1;
2736 #if YY_ALWAYS_INTERACTIVE
2737 b->yy_is_interactive = 1;
2739 #if YY_NEVER_INTERACTIVE
2740 b->yy_is_interactive = 0;
2742 b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
2748 #ifdef YY_USE_PROTOS
2749 void yy_flush_buffer( YY_BUFFER_STATE b )
2751 void yy_flush_buffer( b )
2761 /* We always need two end-of-buffer characters. The first causes
2762 * a transition to the end-of-buffer state. The second causes
2763 * a jam in that state.
2765 b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
2766 b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
2768 b->yy_buf_pos = &b->yy_ch_buf[0];
2771 b->yy_buffer_status = YY_BUFFER_NEW;
2773 if ( b == yy_current_buffer )
2774 yy_load_buffer_state();
2778 #ifndef YY_NO_SCAN_BUFFER
2779 #ifdef YY_USE_PROTOS
2780 YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
2782 YY_BUFFER_STATE yy_scan_buffer( base, size )
2790 base[size-2] != YY_END_OF_BUFFER_CHAR ||
2791 base[size-1] != YY_END_OF_BUFFER_CHAR )
2792 /* They forgot to leave room for the EOB's. */
2795 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
2797 YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
2799 b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
2800 b->yy_buf_pos = b->yy_ch_buf = base;
2801 b->yy_is_our_buffer = 0;
2802 b->yy_input_file = 0;
2803 b->yy_n_chars = b->yy_buf_size;
2804 b->yy_is_interactive = 0;
2806 b->yy_fill_buffer = 0;
2807 b->yy_buffer_status = YY_BUFFER_NEW;
2809 yy_switch_to_buffer( b );
2816 #ifndef YY_NO_SCAN_STRING
2817 #ifdef YY_USE_PROTOS
2818 YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
2820 YY_BUFFER_STATE yy_scan_string( yy_str )
2821 yyconst char *yy_str;
2825 for ( len = 0; yy_str[len]; ++len )
2828 return yy_scan_bytes( yy_str, len );
2833 #ifndef YY_NO_SCAN_BYTES
2834 #ifdef YY_USE_PROTOS
2835 YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
2837 YY_BUFFER_STATE yy_scan_bytes( bytes, len )
2838 yyconst char *bytes;
2847 /* Get memory for full buffer, including space for trailing EOB's. */
2849 buf = (char *) yy_flex_alloc( n );
2851 YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
2853 for ( i = 0; i < len; ++i )
2856 buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
2858 b = yy_scan_buffer( buf, n );
2860 YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
2862 /* It's okay to grow etc. this buffer, and we should throw it
2863 * away when we're done.
2865 b->yy_is_our_buffer = 1;
2872 #ifndef YY_NO_PUSH_STATE
2873 #ifdef YY_USE_PROTOS
2874 static void yy_push_state( int new_state )
2876 static void yy_push_state( new_state )
2880 if ( yy_start_stack_ptr >= yy_start_stack_depth )
2884 yy_start_stack_depth += YY_START_STACK_INCR;
2885 new_size = yy_start_stack_depth * sizeof( int );
2887 if ( ! yy_start_stack )
2888 yy_start_stack = (int *) yy_flex_alloc( new_size );
2891 yy_start_stack = (int *) yy_flex_realloc(
2892 (void *) yy_start_stack, new_size );
2894 if ( ! yy_start_stack )
2896 "out of memory expanding start-condition stack" );
2899 yy_start_stack[yy_start_stack_ptr++] = YY_START;
2906 #ifndef YY_NO_POP_STATE
2907 static void yy_pop_state()
2909 if ( --yy_start_stack_ptr < 0 )
2910 YY_FATAL_ERROR( "start-condition stack underflow" );
2912 BEGIN(yy_start_stack[yy_start_stack_ptr]);
2917 #ifndef YY_NO_TOP_STATE
2918 static int yy_top_state()
2920 return yy_start_stack[yy_start_stack_ptr - 1];
2924 #ifndef YY_EXIT_FAILURE
2925 #define YY_EXIT_FAILURE 2
2928 #ifdef YY_USE_PROTOS
2929 static void yy_fatal_error( yyconst char msg[] )
2931 static void yy_fatal_error( msg )
2935 (void) fprintf( stderr, "%s\n", msg );
2936 exit( YY_EXIT_FAILURE );
2941 /* Redefine yyless() so it works in section 3 code. */
2947 /* Undo effects of setting up yytext. */ \
2948 yytext[yyleng] = yy_hold_char; \
2949 yy_c_buf_p = yytext + n; \
2950 yy_hold_char = *yy_c_buf_p; \
2951 *yy_c_buf_p = '\0'; \
2957 /* Internal utility routines. */
2960 #ifdef YY_USE_PROTOS
2961 static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
2963 static void yy_flex_strncpy( s1, s2, n )
2970 for ( i = 0; i < n; ++i )
2975 #ifdef YY_NEED_STRLEN
2976 #ifdef YY_USE_PROTOS
2977 static int yy_flex_strlen( yyconst char *s )
2979 static int yy_flex_strlen( s )
2984 for ( n = 0; s[n]; ++n )
2992 #ifdef YY_USE_PROTOS
2993 static void *yy_flex_alloc( yy_size_t size )
2995 static void *yy_flex_alloc( size )
2999 return (void *) malloc( size );
3002 #ifdef YY_USE_PROTOS
3003 static inline void *yy_flex_realloc( void *ptr, yy_size_t size )
3005 static inline void *yy_flex_realloc( ptr, size )
3010 /* The cast to (char *) in the following accommodates both
3011 * implementations that use char* generic pointers, and those
3012 * that use void* generic pointers. It works with the latter
3013 * because both ANSI C and C++ allow castless assignment from
3014 * any pointer type to void*, and deal with argument conversions
3015 * as though doing an assignment.
3017 return (void *) realloc( (char *) ptr, size );
3020 #ifdef YY_USE_PROTOS
3021 static void yy_flex_free( void *ptr )
3023 static void yy_flex_free( ptr )
3037 #line 417 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"