blob: a3a7c66416762de4d00658a18dbb6c63848a463e [file] [log] [blame]
Reid Spencere7c3c602006-11-30 06:36:44 +00001#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
18
19#line 20 "UpgradeLexer.cpp"
20/* A lexical scanner generated by flex*/
21
22/* Scanner skeleton version:
23 * $Header$
24 */
25
26#define FLEX_SCANNER
27#define YY_FLEX_MAJOR_VERSION 2
28#define YY_FLEX_MINOR_VERSION 5
29
30#include <stdio.h>
31#include <unistd.h>
32
33
34/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
35#ifdef c_plusplus
36#ifndef __cplusplus
37#define __cplusplus
38#endif
39#endif
40
41
42#ifdef __cplusplus
43
44#include <stdlib.h>
45
46/* Use prototypes in function declarations. */
47#define YY_USE_PROTOS
48
49/* The "const" storage-class-modifier is valid. */
50#define YY_USE_CONST
51
52#else /* ! __cplusplus */
53
54#if __STDC__
55
56#define YY_USE_PROTOS
57#define YY_USE_CONST
58
59#endif /* __STDC__ */
60#endif /* ! __cplusplus */
61
62#ifdef __TURBOC__
63 #pragma warn -rch
64 #pragma warn -use
65#include <io.h>
66#include <stdlib.h>
67#define YY_USE_CONST
68#define YY_USE_PROTOS
69#endif
70
71#ifdef YY_USE_CONST
72#define yyconst const
73#else
74#define yyconst
75#endif
76
77
78#ifdef YY_USE_PROTOS
79#define YY_PROTO(proto) proto
80#else
81#define YY_PROTO(proto) ()
82#endif
83
84/* Returned upon end-of-file. */
85#define YY_NULL 0
86
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
90 * double cast.
91 */
92#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
93
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.
97 */
98#define BEGIN yy_start = 1 + 2 *
99
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
102 * compatibility.
103 */
104#define YY_START ((yy_start - 1) / 2)
105#define YYSTATE YY_START
106
107/* Action number for EOF rule of a given start state. */
108#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
109
110/* Special action meaning "start processing a new file". */
111#define YY_NEW_FILE yyrestart( yyin )
112
113#define YY_END_OF_BUFFER_CHAR 0
114
115/* Size of default input buffer. */
116#define YY_BUF_SIZE (16384*64)
117
118typedef struct yy_buffer_state *YY_BUFFER_STATE;
119
120extern int yyleng;
121extern FILE *yyin, *yyout;
122
123#define EOB_ACT_CONTINUE_SCAN 0
124#define EOB_ACT_END_OF_FILE 1
125#define EOB_ACT_LAST_MATCH 2
126
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:
130 *
131 * if ( condition_holds )
132 * yyless( 5 );
133 * else
134 * do_something_else();
135 *
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.
139 */
140
141/* Return all but the first 'n' matched characters back to the input stream. */
142
143#define yyless(n) \
144 do \
145 { \
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 */ \
151 } \
152 while ( 0 )
153
154#define unput(c) yyunput( c, yytext_ptr )
155
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. */
159#ifdef __GNUC__
160#define YY_MAY_BE_UNUSED __attribute__((unused))
161#else
162#define YY_MAY_BE_UNUSED
163#endif
164
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).
168 */
169typedef unsigned int yy_size_t;
170
171
172struct yy_buffer_state
173 {
174 FILE *yy_input_file;
175
176 char *yy_ch_buf; /* input buffer */
177 char *yy_buf_pos; /* current position in input buffer */
178
179 /* Size of input buffer in bytes, not including room for EOB
180 * characters.
181 */
182 yy_size_t yy_buf_size;
183
184 /* Number of characters read into yy_ch_buf, not including EOB
185 * characters.
186 */
187 int yy_n_chars;
188
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
191 * delete it.
192 */
193 int yy_is_our_buffer;
194
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
198 * each newline.
199 */
200 int yy_is_interactive;
201
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
204 * not.
205 */
206 int yy_at_bol;
207
208 /* Whether to try to fill the input buffer when we reach the
209 * end of it.
210 */
211 int yy_fill_buffer;
212
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.
221 *
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.
225 */
226#define YY_BUFFER_EOF_PENDING 2
227 };
228
229static YY_BUFFER_STATE yy_current_buffer = 0;
230
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
233 * "scanner state".
234 */
235#define YY_CURRENT_BUFFER yy_current_buffer
236
237
238/* yy_hold_char holds the character lost when yytext is formed. */
239static char yy_hold_char;
240
241static int yy_n_chars; /* number of characters read into yy_ch_buf */
242
243
244int yyleng;
245
246/* Points to current character in buffer. */
247static char *yy_c_buf_p = (char *) 0;
248static int yy_init = 1; /* whether we need to initialize */
249static int yy_start = 0; /* start state number */
250
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 ...
253 */
254static int yy_did_buffer_switch_on_eof;
255
256void yyrestart YY_PROTO(( FILE *input_file ));
257
258void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
259void yy_load_buffer_state YY_PROTO(( void ));
260YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
261void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
262void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
263void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
264#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
265
266YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
267YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
268YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
269
270static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
271static inline void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )) YY_MAY_BE_UNUSED;
272static void yy_flex_free YY_PROTO(( void * ));
273
274#define yy_new_buffer yy_create_buffer
275
276#define yy_set_interactive(is_interactive) \
277 { \
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; \
281 }
282
283#define yy_set_bol(at_bol) \
284 { \
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; \
288 }
289
290#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
291
292
293#define YY_USES_REJECT
294
295#define yywrap() 1
296#define YY_SKIP_YYWRAP
297typedef unsigned char YY_CHAR;
298FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
299typedef int yy_state_type;
300extern int yylineno;
301int yylineno = 1;
302extern char *yytext;
303#define yytext_ptr yytext
304
305static yy_state_type yy_get_previous_state YY_PROTO(( void ));
306static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
307static int yy_get_next_buffer YY_PROTO(( void ));
308static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
309
310/* Done after the current pattern has been matched and before the
311 * corresponding action - sets up yytext.
312 */
313#define YY_DO_BEFORE_ACTION \
314 yytext_ptr = yy_bp; \
315 yyleng = (int) (yy_cp - yy_bp); \
316 yy_hold_char = *yy_cp; \
317 *yy_cp = '\0'; \
318 yy_c_buf_p = yy_cp;
319
320#define YY_NUM_RULES 116
321#define YY_END_OF_BUFFER 117
322static yyconst short int yy_acclist[194] =
323 { 0,
324 117, 115, 116, 114, 115, 116, 114, 116, 115, 116,
325 115, 116, 115, 116, 115, 116, 115, 116, 115, 116,
326 107, 115, 116, 107, 115, 116, 1, 115, 116, 115,
327 116, 115, 116, 115, 116, 115, 116, 115, 116, 115,
328 116, 115, 116, 115, 116, 115, 116, 115, 116, 115,
329 116, 115, 116, 115, 116, 115, 116, 115, 116, 115,
330 116, 115, 116, 115, 116, 115, 116, 115, 116, 115,
331 116, 106, 104, 103, 103, 110, 108, 112, 107, 1,
332 89, 38, 72, 22, 106, 103, 103, 111, 112, 19,
333 112, 113, 60, 71, 36, 31, 39, 63, 3, 51,
334
335 62, 80, 67, 88, 84, 61, 73, 105, 112, 112,
336 86, 46, 81, 82, 66, 96, 70, 97, 53, 85,
337 21, 109, 65, 69, 23, 4, 58, 64, 52, 68,
338 45, 11, 112, 33, 2, 5, 55, 57, 47, 75,
339 79, 77, 78, 76, 74, 49, 98, 48, 54, 20,
340 95, 42, 56, 27, 41, 7, 91, 30, 94, 35,
341 59, 83, 90, 24, 25, 92, 50, 87, 40, 6,
342 26, 34, 8, 16, 9, 10, 32, 12, 14, 13,
343 29, 37, 15, 28, 93, 99, 101, 102, 43, 100,
344 17, 44, 18
345
346 } ;
347
348static yyconst short int yy_accept[507] =
349 { 0,
350 1, 1, 1, 2, 4, 7, 9, 11, 13, 15,
351 17, 19, 21, 24, 27, 30, 32, 34, 36, 38,
352 40, 42, 44, 46, 48, 50, 52, 54, 56, 58,
353 60, 62, 64, 66, 68, 70, 72, 72, 73, 73,
354 74, 75, 76, 77, 77, 78, 78, 79, 80, 80,
355 81, 81, 81, 81, 81, 81, 81, 81, 81, 82,
356 82, 83, 83, 83, 83, 83, 83, 83, 83, 83,
357 83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
358 83, 83, 83, 83, 83, 83, 83, 83, 84, 84,
359 84, 84, 84, 84, 84, 84, 84, 84, 84, 84,
360
361 84, 84, 84, 85, 85, 85, 85, 85, 85, 85,
362 85, 85, 85, 85, 85, 85, 85, 85, 85, 86,
363 87, 89, 90, 91, 92, 92, 93, 94, 94, 94,
364 95, 95, 95, 96, 96, 97, 97, 97, 97, 98,
365 98, 98, 98, 98, 98, 98, 99, 99, 99, 100,
366 100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
367 101, 101, 101, 101, 101, 101, 101, 101, 101, 101,
368 102, 102, 102, 103, 103, 104, 105, 105, 105, 105,
369 105, 105, 105, 106, 106, 106, 106, 106, 106, 107,
370 107, 107, 107, 107, 107, 107, 107, 107, 107, 107,
371
372 107, 107, 107, 107, 107, 107, 107, 107, 107, 107,
373 108, 108, 109, 110, 110, 110, 110, 111, 111, 111,
374 111, 112, 112, 113, 114, 115, 115, 115, 115, 115,
375 115, 115, 115, 115, 115, 115, 115, 115, 115, 115,
376 116, 116, 117, 118, 118, 118, 118, 118, 118, 118,
377 118, 118, 118, 119, 120, 121, 121, 121, 122, 122,
378 122, 123, 123, 124, 124, 124, 124, 124, 124, 124,
379 124, 124, 124, 125, 125, 125, 126, 126, 126, 127,
380 128, 128, 129, 130, 130, 130, 130, 130, 131, 131,
381 131, 132, 132, 133, 133, 133, 134, 135, 135, 135,
382
383 136, 136, 136, 136, 136, 136, 136, 136, 136, 136,
384 136, 136, 136, 137, 137, 138, 138, 138, 138, 138,
385 138, 138, 139, 139, 139, 139, 139, 139, 139, 140,
386 140, 140, 141, 142, 143, 144, 145, 146, 147, 147,
387 147, 148, 148, 148, 148, 149, 150, 151, 151, 151,
388 151, 151, 151, 151, 151, 151, 152, 152, 153, 153,
389 153, 153, 153, 153, 153, 153, 154, 155, 155, 155,
390 156, 156, 157, 157, 157, 157, 158, 158, 159, 160,
391 161, 162, 162, 162, 163, 163, 163, 164, 165, 166,
392 166, 167, 168, 169, 169, 169, 169, 169, 169, 169,
393
394 170, 170, 171, 172, 172, 172, 172, 172, 172, 172,
395 172, 172, 172, 172, 172, 173, 173, 173, 173, 173,
396 173, 173, 173, 173, 174, 174, 174, 174, 174, 175,
397 175, 175, 175, 175, 176, 177, 177, 177, 177, 177,
398 178, 178, 178, 178, 179, 179, 180, 181, 181, 181,
399 181, 181, 181, 181, 181, 181, 181, 181, 181, 181,
400 182, 182, 182, 182, 182, 182, 182, 182, 183, 183,
401 183, 183, 183, 184, 184, 184, 184, 184, 185, 185,
402 186, 186, 186, 186, 186, 186, 186, 186, 186, 186,
403 186, 186, 186, 187, 187, 188, 189, 189, 190, 190,
404
405 191, 192, 193, 193, 194, 194
406 } ;
407
408static yyconst int yy_ec[256] =
409 { 0,
410 1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
411 1, 1, 2, 1, 1, 1, 1, 1, 1, 1,
412 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
413 1, 2, 1, 4, 1, 5, 6, 1, 1, 1,
414 1, 1, 7, 1, 8, 9, 1, 10, 11, 11,
415 11, 11, 11, 12, 11, 13, 11, 14, 15, 1,
416 1, 1, 1, 1, 16, 16, 16, 16, 17, 16,
417 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
418 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
419 1, 1, 1, 1, 18, 1, 19, 20, 21, 22,
420
421 23, 24, 25, 26, 27, 5, 28, 29, 30, 31,
422 32, 33, 34, 35, 36, 37, 38, 39, 40, 41,
423 42, 43, 1, 1, 1, 1, 1, 1, 1, 1,
424 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
425 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
426 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
427 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
428 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
429 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
430 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
431
432 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
433 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
434 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
435 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
436 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
437 1, 1, 1, 1, 1
438 } ;
439
440static yyconst int yy_meta[44] =
441 { 0,
442 1, 1, 2, 1, 3, 1, 1, 3, 3, 3,
443 3, 3, 3, 4, 1, 3, 3, 3, 3, 3,
444 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
445 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
446 3, 3, 3
447 } ;
448
449static yyconst short int yy_base[511] =
450 { 0,
451 0, 0, 1100, 1101, 1101, 1101, 1095, 1084, 36, 40,
452 44, 50, 56, 62, 0, 63, 66, 81, 89, 47,
453 100, 97, 76, 96, 111, 46, 48, 110, 68, 140,
454 126, 171, 119, 123, 73, 125, 1093, 1101, 1082, 1101,
455 0, 159, 176, 199, 204, 95, 209, 224, 229, 0,
456 130, 165, 133, 120, 169, 151, 159, 31, 1081, 168,
457 143, 230, 189, 191, 233, 117, 145, 187, 241, 242,
458 244, 243, 246, 248, 250, 251, 253, 254, 176, 258,
459 263, 255, 270, 274, 271, 278, 283, 1080, 284, 287,
460 289, 290, 291, 294, 295, 296, 298, 292, 303, 309,
461
462 313, 316, 1079, 322, 304, 299, 325, 324, 330, 328,
463 331, 332, 213, 342, 334, 262, 343, 345, 1078, 0,
464 354, 362, 1077, 376, 393, 0, 1076, 356, 362, 1075,
465 368, 363, 1074, 369, 1073, 381, 383, 347, 1072, 394,
466 378, 388, 399, 395, 401, 1071, 405, 403, 406, 408,
467 411, 407, 308, 415, 412, 413, 425, 423, 426, 427,
468 424, 432, 113, 434, 437, 439, 440, 443, 444, 1070,
469 447, 446, 1069, 448, 1068, 1067, 473, 451, 452, 463,
470 455, 484, 1066, 467, 449, 485, 473, 487, 1065, 490,
471 491, 492, 496, 498, 500, 497, 502, 505, 504, 510,
472
473 514, 511, 516, 512, 517, 518, 529, 525, 456, 1064,
474 531, 1101, 539, 547, 554, 558, 563, 547, 565, 566,
475 1063, 567, 1062, 1061, 1060, 568, 569, 570, 571, 573,
476 574, 576, 579, 581, 577, 580, 585, 588, 591, 1059,
477 589, 1058, 1057, 594, 599, 602, 600, 605, 606, 607,
478 610, 608, 1056, 1055, 1054, 613, 614, 1053, 615, 617,
479 0, 616, 1052, 619, 627, 618, 624, 635, 636, 630,
480 641, 637, 1051, 643, 642, 1050, 648, 650, 1049, 1048,
481 654, 1047, 1046, 655, 659, 656, 660, 1045, 662, 664,
482 1044, 667, 1043, 670, 668, 675, 1042, 679, 678, 1041,
483
484 675, 688, 687, 691, 676, 689, 698, 699, 700, 702,
485 703, 701, 1040, 704, 1039, 705, 706, 707, 710, 712,
486 713, 1038, 715, 716, 724, 726, 727, 728, 1037, 730,
487 734, 1036, 1035, 1034, 1033, 1032, 1031, 1030, 738, 739,
488 1029, 740, 741, 742, 1028, 1027, 1026, 743, 746, 744,
489 745, 747, 758, 755, 759, 1025, 761, 1024, 762, 765,
490 766, 768, 769, 770, 771, 1023, 1022, 780, 773, 1021,
491 781, 1020, 783, 786, 782, 1019, 793, 1018, 1017, 1016,
492 1015, 790, 798, 1014, 799, 802, 1013, 1012, 1011, 801,
493 1010, 1009, 1008, 803, 804, 806, 807, 805, 809, 1007,
494
495 810, 1006, 1005, 816, 817, 819, 821, 824, 825, 823,
496 827, 829, 830, 831, 1004, 835, 841, 843, 846, 847,
497 849, 851, 852, 1003, 854, 857, 858, 859, 1002, 861,
498 862, 864, 866, 1001, 998, 869, 877, 865, 867, 988,
499 883, 884, 885, 987, 871, 986, 984, 888, 891, 892,
500 896, 895, 897, 899, 902, 903, 904, 905, 907, 983,
501 908, 913, 914, 916, 910, 921, 917, 982, 923, 927,
502 928, 931, 981, 935, 924, 936, 934, 977, 937, 976,
503 938, 941, 945, 950, 952, 954, 956, 957, 959, 961,
504 960, 962, 975, 963, 970, 775, 964, 533, 965, 454,
505
506 453, 261, 969, 216, 1101, 1004, 1006, 226, 1010, 76
507 } ;
508
509static yyconst short int yy_def[511] =
510 { 0,
511 505, 1, 505, 505, 505, 505, 506, 507, 508, 505,
512 507, 507, 507, 507, 509, 507, 507, 507, 507, 507,
513 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
514 507, 507, 507, 507, 507, 507, 506, 505, 507, 505,
515 510, 510, 505, 505, 507, 507, 507, 507, 507, 509,
516 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
517 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
518 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
519 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
520 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
521
522 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
523 507, 507, 507, 507, 507, 507, 507, 507, 505, 510,
524 510, 505, 507, 507, 507, 49, 507, 507, 507, 507,
525 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
526 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
527 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
528 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
529 507, 507, 507, 507, 507, 507, 49, 507, 507, 507,
530 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
531 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
532
533 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
534 507, 505, 505, 505, 505, 507, 507, 507, 507, 507,
535 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
536 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
537 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
538 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
539 177, 507, 507, 507, 507, 507, 507, 507, 507, 507,
540 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
541 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
542 507, 507, 507, 507, 507, 505, 507, 507, 507, 507,
543
544 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
545 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
546 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
547 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
548 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
549 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
550 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
551 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
552 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
553 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
554
555 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
556 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
557 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
558 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
559 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
560 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
561 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
562 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
563 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
564 507, 507, 507, 507, 507, 507, 507, 507, 507, 507,
565
566 507, 507, 507, 507, 0, 505, 505, 505, 505, 505
567 } ;
568
569static yyconst short int yy_nxt[1145] =
570 { 0,
571 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
572 14, 14, 14, 4, 15, 8, 8, 8, 16, 17,
573 18, 19, 20, 21, 22, 8, 23, 8, 24, 25,
574 26, 27, 28, 8, 29, 30, 31, 32, 33, 34,
575 35, 8, 36, 42, 40, 43, 43, 43, 43, 44,
576 44, 44, 44, 45, 45, 45, 45, 40, 46, 40,
577 40, 40, 136, 40, 47, 48, 48, 48, 48, 40,
578 47, 48, 48, 48, 48, 40, 40, 69, 120, 40,
579 87, 40, 88, 86, 51, 116, 40, 70, 56, 40,
580 91, 52, 57, 53, 40, 54, 49, 58, 55, 60,
581
582 59, 61, 40, 123, 117, 77, 78, 64, 40, 40,
583 40, 65, 62, 40, 79, 66, 63, 67, 71, 75,
584 68, 72, 80, 40, 40, 76, 40, 81, 73, 83,
585 40, 82, 40, 40, 74, 89, 40, 113, 40, 40,
586 251, 90, 84, 40, 102, 115, 40, 118, 85, 92,
587 114, 127, 131, 40, 130, 146, 40, 103, 40, 93,
588 104, 94, 95, 139, 40, 96, 97, 105, 121, 121,
589 121, 121, 40, 147, 98, 134, 99, 100, 40, 101,
590 92, 40, 40, 135, 40, 43, 43, 43, 43, 40,
591 106, 128, 107, 129, 132, 162, 137, 108, 133, 109,
592
593 40, 110, 40, 138, 40, 111, 112, 122, 44, 44,
594 44, 44, 47, 45, 45, 45, 45, 40, 124, 124,
595 124, 124, 40, 142, 148, 125, 40, 143, 41, 40,
596 205, 125, 47, 48, 48, 48, 48, 40, 126, 126,
597 126, 126, 40, 40, 126, 126, 40, 126, 126, 126,
598 126, 126, 126, 144, 40, 40, 40, 40, 140, 40,
599 141, 40, 149, 40, 40, 145, 40, 40, 40, 153,
600 155, 40, 151, 209, 40, 40, 40, 154, 150, 152,
601 167, 165, 157, 40, 40, 158, 156, 40, 163, 159,
602 160, 40, 161, 166, 164, 169, 40, 40, 168, 170,
603
604 40, 172, 40, 40, 40, 40, 171, 40, 40, 40,
605 173, 40, 40, 174, 187, 180, 40, 40, 175, 186,
606 179, 40, 40, 181, 183, 176, 40, 184, 189, 40,
607 177, 182, 178, 185, 188, 40, 195, 40, 40, 190,
608 196, 40, 191, 40, 40, 40, 240, 40, 193, 200,
609 192, 197, 208, 203, 198, 40, 40, 204, 40, 194,
610 40, 199, 201, 121, 121, 121, 121, 202, 206, 40,
611 207, 213, 213, 213, 213, 40, 40, 210, 214, 211,
612 218, 40, 40, 225, 214, 124, 124, 124, 124, 40,
613 220, 40, 125, 219, 40, 222, 40, 221, 125, 215,
614
615 216, 40, 217, 217, 217, 217, 40, 40, 40, 223,
616 228, 224, 40, 227, 40, 226, 40, 229, 40, 40,
617 40, 40, 234, 230, 40, 40, 40, 232, 40, 231,
618 236, 233, 235, 241, 242, 244, 40, 40, 40, 40,
619 40, 243, 237, 239, 245, 40, 238, 40, 247, 248,
620 40, 246, 40, 40, 250, 249, 40, 40, 253, 40,
621 40, 40, 40, 254, 40, 40, 40, 40, 40, 40,
622 252, 256, 271, 294, 255, 258, 40, 265, 260, 259,
623 40, 257, 261, 261, 261, 261, 40, 262, 261, 261,
624 263, 261, 261, 261, 261, 261, 261, 40, 40, 264,
625
626 40, 270, 273, 40, 40, 40, 266, 272, 267, 40,
627 40, 40, 268, 40, 269, 40, 277, 40, 40, 276,
628 279, 274, 280, 40, 40, 40, 275, 40, 278, 40,
629 40, 40, 285, 281, 284, 290, 286, 287, 40, 291,
630 282, 283, 40, 289, 40, 288, 40, 292, 213, 213,
631 213, 213, 293, 215, 215, 214, 296, 296, 296, 296,
632 40, 214, 295, 296, 296, 296, 296, 217, 217, 217,
633 217, 40, 217, 217, 217, 217, 40, 297, 40, 40,
634 40, 40, 40, 40, 40, 298, 40, 40, 301, 40,
635 40, 305, 40, 40, 40, 310, 299, 300, 40, 304,
636
637 306, 40, 40, 312, 40, 302, 303, 40, 308, 309,
638 313, 314, 40, 40, 311, 40, 307, 317, 40, 40,
639 40, 40, 316, 40, 318, 315, 40, 40, 40, 40,
640 40, 40, 40, 321, 319, 322, 324, 40, 329, 320,
641 40, 323, 326, 40, 325, 330, 333, 331, 40, 40,
642 40, 332, 327, 328, 40, 40, 40, 335, 337, 340,
643 334, 40, 342, 40, 339, 341, 338, 40, 40, 40,
644 343, 336, 40, 40, 348, 40, 345, 40, 344, 346,
645 40, 40, 347, 40, 296, 296, 296, 296, 40, 40,
646 349, 40, 40, 353, 355, 358, 350, 356, 351, 357,
647
648 40, 40, 40, 352, 40, 354, 359, 360, 363, 361,
649 362, 40, 40, 40, 40, 40, 40, 40, 40, 40,
650 40, 369, 366, 40, 370, 40, 40, 371, 40, 40,
651 364, 365, 367, 368, 372, 376, 373, 40, 378, 40,
652 40, 40, 375, 40, 379, 377, 374, 40, 380, 381,
653 382, 40, 40, 40, 40, 40, 40, 40, 40, 40,
654 40, 383, 386, 390, 389, 387, 385, 391, 40, 393,
655 384, 40, 40, 394, 40, 40, 395, 388, 40, 40,
656 392, 40, 40, 40, 40, 400, 40, 398, 40, 397,
657 402, 396, 399, 40, 40, 40, 40, 406, 407, 40,
658
659 412, 404, 405, 40, 403, 410, 40, 401, 411, 408,
660 409, 40, 40, 413, 40, 40, 40, 40, 40, 40,
661 40, 416, 40, 40, 414, 417, 418, 421, 415, 40,
662 40, 419, 40, 422, 40, 423, 40, 40, 40, 420,
663 40, 425, 40, 40, 40, 424, 430, 431, 40, 429,
664 426, 427, 435, 432, 40, 433, 40, 434, 428, 40,
665 40, 439, 40, 438, 40, 40, 436, 40, 440, 442,
666 40, 40, 40, 437, 40, 40, 444, 40, 40, 40,
667 40, 448, 40, 441, 40, 455, 456, 443, 452, 449,
668 40, 445, 450, 446, 447, 453, 40, 40, 40, 454,
669
670 451, 40, 458, 457, 40, 40, 461, 460, 40, 40,
671 40, 459, 40, 462, 464, 40, 40, 40, 40, 467,
672 40, 40, 470, 40, 465, 472, 40, 40, 463, 40,
673 40, 469, 477, 471, 40, 473, 40, 40, 468, 466,
674 40, 40, 474, 478, 40, 480, 475, 40, 40, 40,
675 40, 40, 476, 479, 40, 481, 482, 484, 40, 483,
676 485, 490, 486, 40, 487, 40, 489, 40, 488, 40,
677 40, 491, 40, 40, 40, 40, 40, 40, 40, 497,
678 492, 498, 40, 40, 502, 494, 493, 503, 40, 40,
679 40, 496, 495, 501, 40, 40, 40, 40, 500, 40,
680
681 40, 40, 499, 504, 37, 37, 37, 37, 39, 39,
682 50, 40, 50, 50, 40, 40, 40, 40, 40, 40,
683 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
684 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
685 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
686 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
687 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
688 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
689 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
690 40, 212, 40, 40, 40, 40, 119, 40, 38, 505,
691
692 3, 505, 505, 505, 505, 505, 505, 505, 505, 505,
693 505, 505, 505, 505, 505, 505, 505, 505, 505, 505,
694 505, 505, 505, 505, 505, 505, 505, 505, 505, 505,
695 505, 505, 505, 505, 505, 505, 505, 505, 505, 505,
696 505, 505, 505, 505
697 } ;
698
699static yyconst short int yy_chk[1145] =
700 { 0,
701 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
702 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
703 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
704 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
705 1, 1, 1, 9, 58, 9, 9, 9, 9, 10,
706 10, 10, 10, 11, 11, 11, 11, 11, 12, 26,
707 20, 27, 58, 12, 13, 13, 13, 13, 13, 13,
708 14, 14, 14, 14, 14, 14, 16, 20, 510, 17,
709 27, 29, 27, 26, 16, 35, 35, 20, 17, 23,
710 29, 16, 17, 16, 18, 16, 13, 17, 16, 18,
711
712 17, 18, 19, 46, 35, 23, 23, 19, 46, 24,
713 22, 19, 18, 21, 24, 19, 18, 19, 21, 22,
714 19, 21, 24, 28, 25, 22, 163, 24, 21, 25,
715 66, 24, 33, 54, 21, 28, 34, 33, 36, 31,
716 163, 28, 25, 51, 31, 34, 53, 36, 25, 30,
717 33, 51, 54, 30, 53, 66, 61, 31, 67, 30,
718 31, 30, 30, 61, 56, 30, 30, 31, 42, 42,
719 42, 42, 57, 67, 30, 56, 30, 30, 52, 30,
720 32, 60, 55, 57, 32, 43, 43, 43, 43, 79,
721 32, 52, 32, 52, 55, 79, 60, 32, 55, 32,
722
723 68, 32, 63, 60, 64, 32, 32, 44, 44, 44,
724 44, 44, 45, 45, 45, 45, 45, 45, 47, 47,
725 47, 47, 47, 63, 68, 47, 113, 64, 508, 504,
726 113, 47, 48, 48, 48, 48, 48, 48, 49, 49,
727 49, 49, 49, 62, 49, 49, 65, 49, 49, 49,
728 49, 49, 49, 65, 69, 70, 72, 71, 62, 73,
729 62, 74, 69, 75, 76, 65, 77, 78, 82, 72,
730 74, 80, 71, 116, 502, 116, 81, 73, 70, 71,
731 82, 81, 76, 83, 85, 77, 75, 84, 80, 78,
732 78, 86, 78, 81, 80, 84, 87, 89, 83, 85,
733
734 90, 87, 91, 92, 93, 98, 86, 94, 95, 96,
735 89, 97, 106, 90, 98, 95, 99, 105, 91, 97,
736 94, 153, 100, 95, 96, 91, 101, 96, 100, 102,
737 92, 95, 93, 96, 99, 104, 105, 108, 107, 101,
738 106, 110, 102, 109, 111, 112, 153, 115, 104, 110,
739 102, 107, 115, 111, 108, 114, 117, 112, 118, 104,
740 138, 109, 110, 121, 121, 121, 121, 110, 114, 128,
741 114, 122, 122, 122, 122, 129, 132, 117, 122, 118,
742 128, 131, 134, 138, 122, 124, 124, 124, 124, 124,
743 131, 141, 124, 129, 136, 134, 137, 132, 124, 125,
744
745 125, 142, 125, 125, 125, 125, 125, 140, 144, 136,
746 142, 137, 143, 141, 145, 140, 148, 143, 147, 149,
747 152, 150, 148, 144, 151, 155, 156, 147, 154, 145,
748 150, 147, 149, 154, 155, 156, 158, 161, 157, 159,
749 160, 155, 150, 152, 157, 162, 151, 164, 159, 160,
750 165, 158, 166, 167, 162, 161, 168, 169, 165, 172,
751 171, 174, 185, 166, 178, 179, 501, 500, 181, 209,
752 164, 168, 185, 209, 167, 171, 180, 181, 174, 172,
753 184, 169, 177, 177, 177, 177, 187, 178, 177, 177,
754 179, 177, 177, 177, 177, 177, 177, 182, 186, 180,
755
756 188, 184, 187, 190, 191, 192, 182, 186, 182, 193,
757 196, 194, 182, 195, 182, 197, 192, 199, 198, 191,
758 194, 188, 195, 200, 202, 204, 190, 201, 193, 203,
759 205, 206, 200, 196, 199, 205, 201, 202, 208, 206,
760 197, 198, 207, 204, 211, 203, 498, 207, 213, 213,
761 213, 213, 208, 214, 214, 213, 214, 214, 214, 214,
762 218, 213, 211, 215, 215, 215, 215, 216, 216, 216,
763 216, 216, 217, 217, 217, 217, 217, 218, 219, 220,
764 222, 226, 227, 228, 229, 219, 230, 231, 226, 232,
765 235, 230, 233, 236, 234, 235, 220, 222, 237, 229,
766
767 231, 238, 241, 237, 239, 227, 228, 244, 233, 234,
768 238, 239, 245, 247, 236, 246, 232, 245, 248, 249,
769 250, 252, 244, 251, 246, 241, 256, 257, 259, 262,
770 260, 266, 264, 249, 247, 250, 252, 267, 262, 248,
771 265, 251, 257, 270, 256, 264, 267, 265, 268, 269,
772 272, 266, 259, 260, 271, 275, 274, 268, 269, 272,
773 267, 277, 275, 278, 271, 274, 270, 281, 284, 286,
774 277, 268, 285, 287, 286, 289, 281, 290, 278, 284,
775 292, 295, 285, 294, 296, 296, 296, 296, 301, 305,
776 287, 299, 298, 294, 295, 301, 289, 298, 290, 299,
777
778 303, 302, 306, 292, 304, 294, 302, 303, 306, 304,
779 305, 307, 308, 309, 312, 310, 311, 314, 316, 317,
780 318, 312, 309, 319, 314, 320, 321, 316, 323, 324,
781 307, 308, 310, 311, 317, 321, 318, 325, 324, 326,
782 327, 328, 320, 330, 325, 323, 319, 331, 326, 327,
783 328, 339, 340, 342, 343, 344, 348, 350, 351, 349,
784 352, 330, 340, 348, 344, 342, 339, 349, 354, 351,
785 331, 353, 355, 352, 357, 359, 353, 343, 360, 361,
786 350, 362, 363, 364, 365, 360, 369, 357, 496, 355,
787 362, 354, 359, 368, 371, 375, 373, 368, 368, 374,
788
789 375, 364, 365, 382, 363, 373, 377, 361, 374, 369,
790 371, 383, 385, 377, 390, 386, 394, 395, 398, 396,
791 397, 385, 399, 401, 382, 386, 390, 396, 383, 404,
792 405, 394, 406, 397, 407, 398, 410, 408, 409, 395,
793 411, 401, 412, 413, 414, 399, 408, 409, 416, 407,
794 404, 405, 413, 410, 417, 411, 418, 412, 406, 419,
795 420, 418, 421, 417, 422, 423, 414, 425, 419, 421,
796 426, 427, 428, 416, 430, 431, 423, 432, 438, 433,
797 439, 428, 436, 420, 445, 438, 439, 422, 433, 430,
798 437, 425, 431, 426, 427, 436, 441, 442, 443, 437,
799
800 432, 448, 442, 441, 449, 450, 448, 445, 452, 451,
801 453, 443, 454, 449, 451, 455, 456, 457, 458, 454,
802 459, 461, 457, 465, 452, 459, 462, 463, 450, 464,
803 467, 456, 465, 458, 466, 461, 469, 475, 455, 453,
804 470, 471, 462, 466, 472, 469, 463, 477, 474, 476,
805 479, 481, 464, 467, 482, 470, 471, 474, 483, 472,
806 475, 482, 476, 484, 477, 485, 481, 486, 479, 487,
807 488, 483, 489, 491, 490, 492, 494, 497, 499, 489,
808 484, 490, 503, 495, 497, 486, 485, 499, 493, 480,
809 478, 488, 487, 494, 473, 468, 460, 447, 492, 446,
810
811 444, 440, 491, 503, 506, 506, 506, 506, 507, 507,
812 509, 435, 509, 509, 434, 429, 424, 415, 403, 402,
813 400, 393, 392, 391, 389, 388, 387, 384, 381, 380,
814 379, 378, 376, 372, 370, 367, 366, 358, 356, 347,
815 346, 345, 341, 338, 337, 336, 335, 334, 333, 332,
816 329, 322, 315, 313, 300, 297, 293, 291, 288, 283,
817 282, 280, 279, 276, 273, 263, 258, 255, 254, 253,
818 243, 242, 240, 225, 224, 223, 221, 210, 189, 183,
819 176, 175, 173, 170, 146, 139, 135, 133, 130, 127,
820 123, 119, 103, 88, 59, 39, 37, 8, 7, 3,
821
822 505, 505, 505, 505, 505, 505, 505, 505, 505, 505,
823 505, 505, 505, 505, 505, 505, 505, 505, 505, 505,
824 505, 505, 505, 505, 505, 505, 505, 505, 505, 505,
825 505, 505, 505, 505, 505, 505, 505, 505, 505, 505,
826 505, 505, 505, 505
827 } ;
828
829static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
830static char *yy_full_match;
831static int yy_lp;
832#define REJECT \
833{ \
834*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
835yy_cp = yy_full_match; /* restore poss. backed-over text */ \
836++yy_lp; \
837goto find_rule; \
838}
839#define yymore() yymore_used_but_not_detected
840#define YY_MORE_ADJ 0
841#define YY_RESTORE_YY_MORE_OFFSET
842char *yytext;
843#line 1 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
844#define INITIAL 0
845/*===-- Lexer.l - Scanner for llvm assembly files --------------*- C++ -*--===//
846//
847// The LLVM Compiler Infrastructure
848//
849// This file was developed by the LLVM research group and is distributed under
850// the University of Illinois Open Source License. See LICENSE.TXT for details.
851//
852//===----------------------------------------------------------------------===//
853//
854// This file implements the flex scanner for LLVM assembly languages files.
855//
856//===----------------------------------------------------------------------===*/
857#define YY_NEVER_INTERACTIVE 1
858#line 28 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
859
860#include "ParserInternals.h"
861#define YYSTYPE std::string*
862#include "UpgradeParser.h"
863#include <cctype>
864#include <cstdlib>
865
866void set_scan_bytes (const char * str, size_t len) {
867 Upgrade_scan_bytes (str, len);
868}
869
870static void trim(std::string& str) {
871 size_t startpos = str.find_first_not_of(" \t\n\r",0);
872 if (startpos != std::string::npos)
873 str.erase(0,startpos);
874}
875
876// Construct a token value for a non-obsolete token
877#define RET_TOK(sym) \
878 Upgradelval = new std::string(yytext); \
879 trim(*Upgradelval); \
880 return sym
881
882#define YY_NEVER_INTERACTIVE 1
883/* Comments start with a ; and go till end of line */
884/* Variable(Value) identifiers start with a % sign */
885/* Label identifiers end with a colon */
886/* Quoted names can contain any character except " and \ */
887/* [PN]Integer: match positive and negative literal integer values that
888 * are preceeded by a '%' character. These represent unnamed variable slots.
889 */
890/* E[PN]Integer: match positive and negative literal integer values */
891/* FPConstant - A Floating point constant.
892 */
893/* HexFPConstant - Floating point constant represented in IEEE format as a
894 * hexadecimal number for when exponential notation is not precise enough.
895 */
896/* HexIntConstant - Hexadecimal constant generated by the CFE to avoid forcing
897 * it to deal with 64 bit numbers.
898 */
899#line 900 "UpgradeLexer.cpp"
900
901/* Macros after this point can all be overridden by user definitions in
902 * section 1.
903 */
904
905#ifndef YY_SKIP_YYWRAP
906#ifdef __cplusplus
907extern "C" int yywrap YY_PROTO(( void ));
908#else
909extern int yywrap YY_PROTO(( void ));
910#endif
911#endif
912
913#ifndef YY_NO_UNPUT
914static inline void yyunput YY_PROTO(( int c, char *buf_ptr ));
915#endif
916
917#ifndef yytext_ptr
918static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
919#endif
920
921#ifdef YY_NEED_STRLEN
922static int yy_flex_strlen YY_PROTO(( yyconst char * ));
923#endif
924
925#ifndef YY_NO_INPUT
926#ifdef __cplusplus
927static int yyinput YY_PROTO(( void ));
928#else
929static int input YY_PROTO(( void ));
930#endif
931#endif
932
933#if YY_STACK_USED
934static int yy_start_stack_ptr = 0;
935static int yy_start_stack_depth = 0;
936static int *yy_start_stack = 0;
937#ifndef YY_NO_PUSH_STATE
938static void yy_push_state YY_PROTO(( int new_state ));
939#endif
940#ifndef YY_NO_POP_STATE
941static void yy_pop_state YY_PROTO(( void ));
942#endif
943#ifndef YY_NO_TOP_STATE
944static int yy_top_state YY_PROTO(( void ));
945#endif
946
947#else
948#define YY_NO_PUSH_STATE 1
949#define YY_NO_POP_STATE 1
950#define YY_NO_TOP_STATE 1
951#endif
952
953#ifdef YY_MALLOC_DECL
954YY_MALLOC_DECL
955#else
956#if __STDC__
957#ifndef __cplusplus
958#include <stdlib.h>
959#endif
960#else
961/* Just try to get by without declaring the routines. This will fail
962 * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
963 * or sizeof(void*) != sizeof(int).
964 */
965#endif
966#endif
967
968/* Amount of stuff to slurp up with each read. */
969#ifndef YY_READ_BUF_SIZE
970#define YY_READ_BUF_SIZE 8192
971#endif
972
973/* Copy whatever the last rule matched to the standard output. */
974
975#ifndef ECHO
976/* This used to be an fputs(), but since the string might contain NUL's,
977 * we now use fwrite().
978 */
979#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
980#endif
981
982/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
983 * is returned in "result".
984 */
985#ifndef YY_INPUT
986#define YY_INPUT(buf,result,max_size) \
987 if ( yy_current_buffer->yy_is_interactive ) \
988 { \
989 int c = '*', n; \
990 for ( n = 0; n < max_size && \
991 (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
992 buf[n] = (char) c; \
993 if ( c == '\n' ) \
994 buf[n++] = (char) c; \
995 if ( c == EOF && ferror( yyin ) ) \
996 YY_FATAL_ERROR( "input in flex scanner failed" ); \
997 result = n; \
998 } \
999 else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
1000 && ferror( yyin ) ) \
1001 YY_FATAL_ERROR( "input in flex scanner failed" );
1002#endif
1003
1004/* No semi-colon after return; correct usage is to write "yyterminate();" -
1005 * we don't want an extra ';' after the "return" because that will cause
1006 * some compilers to complain about unreachable statements.
1007 */
1008#ifndef yyterminate
1009#define yyterminate() return YY_NULL
1010#endif
1011
1012/* Number of entries by which start-condition stack grows. */
1013#ifndef YY_START_STACK_INCR
1014#define YY_START_STACK_INCR 25
1015#endif
1016
1017/* Report a fatal error. */
1018#ifndef YY_FATAL_ERROR
1019#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
1020#endif
1021
1022/* Default declaration of generated scanner - a define so the user can
1023 * easily add parameters.
1024 */
1025#ifndef YY_DECL
1026#define YY_DECL int yylex YY_PROTO(( void ))
1027#endif
1028
1029/* Code executed at the beginning of each rule, after yytext and yyleng
1030 * have been set up.
1031 */
1032#ifndef YY_USER_ACTION
1033#define YY_USER_ACTION
1034#endif
1035
1036/* Code executed at the end of each rule. */
1037#ifndef YY_BREAK
1038#define YY_BREAK break;
1039#endif
1040
1041#define YY_RULE_SETUP \
1042 YY_USER_ACTION
1043
1044YY_DECL
1045 {
1046 register yy_state_type yy_current_state;
1047 register char *yy_cp = NULL, *yy_bp = NULL;
1048 register int yy_act;
1049
1050#line 94 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1051
1052
1053#line 1054 "UpgradeLexer.cpp"
1054
1055 if ( yy_init )
1056 {
1057 yy_init = 0;
1058
1059#ifdef YY_USER_INIT
1060 YY_USER_INIT;
1061#endif
1062
1063 if ( ! yy_start )
1064 yy_start = 1; /* first start state */
1065
1066 if ( ! yyin )
1067 yyin = stdin;
1068
1069 if ( ! yyout )
1070 yyout = stdout;
1071
1072 if ( ! yy_current_buffer )
1073 yy_current_buffer =
1074 yy_create_buffer( yyin, YY_BUF_SIZE );
1075
1076 yy_load_buffer_state();
1077 }
1078
1079 while ( 1 ) /* loops until end-of-file is reached */
1080 {
1081 yy_cp = yy_c_buf_p;
1082
1083 /* Support of yytext. */
1084 *yy_cp = yy_hold_char;
1085
1086 /* yy_bp points to the position in yy_ch_buf of the start of
1087 * the current run.
1088 */
1089 yy_bp = yy_cp;
1090
1091 yy_current_state = yy_start;
1092 yy_state_ptr = yy_state_buf;
1093 *yy_state_ptr++ = yy_current_state;
1094yy_match:
1095 do
1096 {
1097 register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
1098 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
1099 {
1100 yy_current_state = (int) yy_def[yy_current_state];
1101 if ( yy_current_state >= 506 )
1102 yy_c = yy_meta[(unsigned int) yy_c];
1103 }
1104 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
1105 *yy_state_ptr++ = yy_current_state;
1106 ++yy_cp;
1107 }
1108 while ( yy_current_state != 505 );
1109
1110yy_find_action:
1111 yy_current_state = *--yy_state_ptr;
1112 yy_lp = yy_accept[yy_current_state];
1113find_rule: /* we branch to this label when backing up */
1114 for ( ; ; ) /* until we find what rule we matched */
1115 {
1116 if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
1117 {
1118 yy_act = yy_acclist[yy_lp];
1119 {
1120 yy_full_match = yy_cp;
1121 break;
1122 }
1123 }
1124 --yy_cp;
1125 yy_current_state = *--yy_state_ptr;
1126 yy_lp = yy_accept[yy_current_state];
1127 }
1128
1129 YY_DO_BEFORE_ACTION;
1130
1131 if ( yy_act != YY_END_OF_BUFFER )
1132 {
1133 int yyl;
1134 for ( yyl = 0; yyl < yyleng; ++yyl )
1135 if ( yytext[yyl] == '\n' )
1136 ++yylineno;
1137 }
1138
1139do_action: /* This label is used only to access EOF actions. */
1140
1141
1142 switch ( yy_act )
1143 { /* beginning of action switch */
1144case 1:
1145YY_RULE_SETUP
1146#line 96 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1147{ /* Ignore comments for now */ }
1148 YY_BREAK
1149case 2:
1150YY_RULE_SETUP
1151#line 98 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1152{ RET_TOK( BEGINTOK); }
1153 YY_BREAK
1154case 3:
1155YY_RULE_SETUP
1156#line 99 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1157{ RET_TOK( ENDTOK); }
1158 YY_BREAK
1159case 4:
1160YY_RULE_SETUP
1161#line 100 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1162{ RET_TOK( TRUETOK); }
1163 YY_BREAK
1164case 5:
1165YY_RULE_SETUP
1166#line 101 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1167{ RET_TOK( FALSETOK); }
1168 YY_BREAK
1169case 6:
1170YY_RULE_SETUP
1171#line 102 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1172{ RET_TOK( DECLARE); }
1173 YY_BREAK
1174case 7:
1175YY_RULE_SETUP
1176#line 103 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1177{ RET_TOK( GLOBAL); }
1178 YY_BREAK
1179case 8:
1180YY_RULE_SETUP
1181#line 104 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1182{ RET_TOK( CONSTANT); }
1183 YY_BREAK
1184case 9:
1185YY_RULE_SETUP
1186#line 105 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1187{ RET_TOK( INTERNAL); }
1188 YY_BREAK
1189case 10:
1190YY_RULE_SETUP
1191#line 106 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1192{ RET_TOK( LINKONCE); }
1193 YY_BREAK
1194case 11:
1195YY_RULE_SETUP
1196#line 107 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1197{ RET_TOK( WEAK); }
1198 YY_BREAK
1199case 12:
1200YY_RULE_SETUP
1201#line 108 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1202{ RET_TOK( APPENDING); }
1203 YY_BREAK
1204case 13:
1205YY_RULE_SETUP
1206#line 109 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1207{ RET_TOK( DLLIMPORT); }
1208 YY_BREAK
1209case 14:
1210YY_RULE_SETUP
1211#line 110 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1212{ RET_TOK( DLLEXPORT); }
1213 YY_BREAK
1214case 15:
1215YY_RULE_SETUP
1216#line 111 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1217{ RET_TOK( EXTERN_WEAK); }
1218 YY_BREAK
1219case 16:
1220YY_RULE_SETUP
1221#line 112 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1222{ RET_TOK( EXTERNAL); }
1223 YY_BREAK
1224case 17:
1225YY_RULE_SETUP
1226#line 113 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1227{ RET_TOK( IMPLEMENTATION); }
1228 YY_BREAK
1229case 18:
1230YY_RULE_SETUP
1231#line 114 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1232{ RET_TOK( ZEROINITIALIZER); }
1233 YY_BREAK
1234case 19:
1235YY_RULE_SETUP
1236#line 115 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1237{ RET_TOK( DOTDOTDOT); }
1238 YY_BREAK
1239case 20:
1240YY_RULE_SETUP
1241#line 116 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1242{ RET_TOK( UNDEF); }
1243 YY_BREAK
1244case 21:
1245YY_RULE_SETUP
1246#line 117 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1247{ RET_TOK( NULL_TOK); }
1248 YY_BREAK
1249case 22:
1250YY_RULE_SETUP
1251#line 118 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1252{ RET_TOK( TO); }
1253 YY_BREAK
1254case 23:
1255YY_RULE_SETUP
1256#line 119 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1257{ RET_TOK( TAIL); }
1258 YY_BREAK
1259case 24:
1260YY_RULE_SETUP
1261#line 120 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1262{ RET_TOK( TARGET); }
1263 YY_BREAK
1264case 25:
1265YY_RULE_SETUP
1266#line 121 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1267{ RET_TOK( TRIPLE); }
1268 YY_BREAK
1269case 26:
1270YY_RULE_SETUP
1271#line 122 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1272{ RET_TOK( DEPLIBS); }
1273 YY_BREAK
1274case 27:
1275YY_RULE_SETUP
1276#line 123 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1277{ RET_TOK( ENDIAN); }
1278 YY_BREAK
1279case 28:
1280YY_RULE_SETUP
1281#line 124 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1282{ RET_TOK( POINTERSIZE); }
1283 YY_BREAK
1284case 29:
1285YY_RULE_SETUP
1286#line 125 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1287{ RET_TOK( DATALAYOUT); }
1288 YY_BREAK
1289case 30:
1290YY_RULE_SETUP
1291#line 126 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1292{ RET_TOK( LITTLE); }
1293 YY_BREAK
1294case 31:
1295YY_RULE_SETUP
1296#line 127 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1297{ RET_TOK( BIG); }
1298 YY_BREAK
1299case 32:
1300YY_RULE_SETUP
1301#line 128 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1302{ RET_TOK( VOLATILE); }
1303 YY_BREAK
1304case 33:
1305YY_RULE_SETUP
1306#line 129 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1307{ RET_TOK( ALIGN); }
1308 YY_BREAK
1309case 34:
1310YY_RULE_SETUP
1311#line 130 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1312{ RET_TOK( SECTION); }
1313 YY_BREAK
1314case 35:
1315YY_RULE_SETUP
1316#line 131 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1317{ RET_TOK( MODULE); }
1318 YY_BREAK
1319case 36:
1320YY_RULE_SETUP
1321#line 132 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1322{ RET_TOK( ASM_TOK); }
1323 YY_BREAK
1324case 37:
1325YY_RULE_SETUP
1326#line 133 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1327{ RET_TOK( SIDEEFFECT); }
1328 YY_BREAK
1329case 38:
1330YY_RULE_SETUP
1331#line 135 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1332{ RET_TOK( CC_TOK); }
1333 YY_BREAK
1334case 39:
1335YY_RULE_SETUP
1336#line 136 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1337{ RET_TOK( CCC_TOK); }
1338 YY_BREAK
1339case 40:
1340YY_RULE_SETUP
1341#line 137 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1342{ RET_TOK( CSRETCC_TOK); }
1343 YY_BREAK
1344case 41:
1345YY_RULE_SETUP
1346#line 138 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1347{ RET_TOK( FASTCC_TOK); }
1348 YY_BREAK
1349case 42:
1350YY_RULE_SETUP
1351#line 139 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1352{ RET_TOK( COLDCC_TOK); }
1353 YY_BREAK
1354case 43:
1355YY_RULE_SETUP
1356#line 140 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1357{ RET_TOK( X86_STDCALLCC_TOK); }
1358 YY_BREAK
1359case 44:
1360YY_RULE_SETUP
1361#line 141 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1362{ RET_TOK( X86_FASTCALLCC_TOK); }
1363 YY_BREAK
1364case 45:
1365YY_RULE_SETUP
1366#line 143 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1367{ RET_TOK( VOID); }
1368 YY_BREAK
1369case 46:
1370YY_RULE_SETUP
1371#line 144 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1372{ RET_TOK( BOOL); }
1373 YY_BREAK
1374case 47:
1375YY_RULE_SETUP
1376#line 145 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1377{ RET_TOK( SBYTE); }
1378 YY_BREAK
1379case 48:
1380YY_RULE_SETUP
1381#line 146 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1382{ RET_TOK( UBYTE); }
1383 YY_BREAK
1384case 49:
1385YY_RULE_SETUP
1386#line 147 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1387{ RET_TOK( SHORT); }
1388 YY_BREAK
1389case 50:
1390YY_RULE_SETUP
1391#line 148 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1392{ RET_TOK( USHORT); }
1393 YY_BREAK
1394case 51:
1395YY_RULE_SETUP
1396#line 149 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1397{ RET_TOK( INT); }
1398 YY_BREAK
1399case 52:
1400YY_RULE_SETUP
1401#line 150 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1402{ RET_TOK( UINT); }
1403 YY_BREAK
1404case 53:
1405YY_RULE_SETUP
1406#line 151 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1407{ RET_TOK( LONG); }
1408 YY_BREAK
1409case 54:
1410YY_RULE_SETUP
1411#line 152 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1412{ RET_TOK( ULONG); }
1413 YY_BREAK
1414case 55:
1415YY_RULE_SETUP
1416#line 153 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1417{ RET_TOK( FLOAT); }
1418 YY_BREAK
1419case 56:
1420YY_RULE_SETUP
1421#line 154 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1422{ RET_TOK( DOUBLE); }
1423 YY_BREAK
1424case 57:
1425YY_RULE_SETUP
1426#line 155 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1427{ RET_TOK( LABEL); }
1428 YY_BREAK
1429case 58:
1430YY_RULE_SETUP
1431#line 156 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1432{ RET_TOK( TYPE); }
1433 YY_BREAK
1434case 59:
1435YY_RULE_SETUP
1436#line 157 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1437{ RET_TOK( OPAQUE); }
1438 YY_BREAK
1439case 60:
1440YY_RULE_SETUP
1441#line 159 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1442{ RET_TOK( ADD); }
1443 YY_BREAK
1444case 61:
1445YY_RULE_SETUP
1446#line 160 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1447{ RET_TOK( SUB); }
1448 YY_BREAK
1449case 62:
1450YY_RULE_SETUP
1451#line 161 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1452{ RET_TOK( MUL); }
1453 YY_BREAK
1454case 63:
1455YY_RULE_SETUP
1456#line 162 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1457{ RET_TOK( UDIV); }
1458 YY_BREAK
1459case 64:
1460YY_RULE_SETUP
1461#line 163 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1462{ RET_TOK( UDIV); }
1463 YY_BREAK
1464case 65:
1465YY_RULE_SETUP
1466#line 164 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1467{ RET_TOK( SDIV); }
1468 YY_BREAK
1469case 66:
1470YY_RULE_SETUP
1471#line 165 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1472{ RET_TOK( FDIV); }
1473 YY_BREAK
1474case 67:
1475YY_RULE_SETUP
1476#line 166 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1477{ RET_TOK( UREM); }
1478 YY_BREAK
1479case 68:
1480YY_RULE_SETUP
1481#line 167 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1482{ RET_TOK( UREM); }
1483 YY_BREAK
1484case 69:
1485YY_RULE_SETUP
1486#line 168 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1487{ RET_TOK( SREM); }
1488 YY_BREAK
1489case 70:
1490YY_RULE_SETUP
1491#line 169 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1492{ RET_TOK( FREM); }
1493 YY_BREAK
1494case 71:
1495YY_RULE_SETUP
1496#line 170 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1497{ RET_TOK( AND); }
1498 YY_BREAK
1499case 72:
1500YY_RULE_SETUP
1501#line 171 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1502{ RET_TOK( OR); }
1503 YY_BREAK
1504case 73:
1505YY_RULE_SETUP
1506#line 172 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1507{ RET_TOK( XOR); }
1508 YY_BREAK
1509case 74:
1510YY_RULE_SETUP
1511#line 173 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1512{ RET_TOK( SETNE); }
1513 YY_BREAK
1514case 75:
1515YY_RULE_SETUP
1516#line 174 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1517{ RET_TOK( SETEQ); }
1518 YY_BREAK
1519case 76:
1520YY_RULE_SETUP
1521#line 175 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1522{ RET_TOK( SETLT); }
1523 YY_BREAK
1524case 77:
1525YY_RULE_SETUP
1526#line 176 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1527{ RET_TOK( SETGT); }
1528 YY_BREAK
1529case 78:
1530YY_RULE_SETUP
1531#line 177 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1532{ RET_TOK( SETLE); }
1533 YY_BREAK
1534case 79:
1535YY_RULE_SETUP
1536#line 178 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1537{ RET_TOK( SETGE); }
1538 YY_BREAK
1539case 80:
1540YY_RULE_SETUP
1541#line 180 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1542{ RET_TOK( PHI_TOK); }
1543 YY_BREAK
1544case 81:
1545YY_RULE_SETUP
1546#line 181 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1547{ RET_TOK( CALL); }
1548 YY_BREAK
1549case 82:
1550YY_RULE_SETUP
1551#line 182 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1552{ RET_TOK( TRUNC); }
1553 YY_BREAK
1554case 83:
1555YY_RULE_SETUP
1556#line 183 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1557{ RET_TOK( SELECT); }
1558 YY_BREAK
1559case 84:
1560YY_RULE_SETUP
1561#line 184 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1562{ RET_TOK( SHL); }
1563 YY_BREAK
1564case 85:
1565YY_RULE_SETUP
1566#line 185 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1567{ RET_TOK( LSHR); }
1568 YY_BREAK
1569case 86:
1570YY_RULE_SETUP
1571#line 186 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1572{ RET_TOK( ASHR); }
1573 YY_BREAK
1574case 87:
1575YY_RULE_SETUP
1576#line 187 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1577{ RET_TOK( VAARG); }
1578 YY_BREAK
1579case 88:
1580YY_RULE_SETUP
1581#line 188 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1582{ RET_TOK( RET); }
1583 YY_BREAK
1584case 89:
1585YY_RULE_SETUP
1586#line 189 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1587{ RET_TOK( BR); }
1588 YY_BREAK
1589case 90:
1590YY_RULE_SETUP
1591#line 190 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1592{ RET_TOK( SWITCH); }
1593 YY_BREAK
1594case 91:
1595YY_RULE_SETUP
1596#line 191 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1597{ RET_TOK( INVOKE); }
1598 YY_BREAK
1599case 92:
1600YY_RULE_SETUP
1601#line 192 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1602{ RET_TOK( UNWIND); }
1603 YY_BREAK
1604case 93:
1605YY_RULE_SETUP
1606#line 193 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1607{ RET_TOK( UNREACHABLE); }
1608 YY_BREAK
1609case 94:
1610YY_RULE_SETUP
1611#line 195 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1612{ RET_TOK( MALLOC); }
1613 YY_BREAK
1614case 95:
1615YY_RULE_SETUP
1616#line 196 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1617{ RET_TOK( ALLOCA); }
1618 YY_BREAK
1619case 96:
1620YY_RULE_SETUP
1621#line 197 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1622{ RET_TOK( FREE); }
1623 YY_BREAK
1624case 97:
1625YY_RULE_SETUP
1626#line 198 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1627{ RET_TOK( LOAD); }
1628 YY_BREAK
1629case 98:
1630YY_RULE_SETUP
1631#line 199 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1632{ RET_TOK( STORE); }
1633 YY_BREAK
1634case 99:
1635YY_RULE_SETUP
1636#line 200 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1637{ RET_TOK( GETELEMENTPTR); }
1638 YY_BREAK
1639case 100:
1640YY_RULE_SETUP
1641#line 202 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1642{ RET_TOK( EXTRACTELEMENT); }
1643 YY_BREAK
1644case 101:
1645YY_RULE_SETUP
1646#line 203 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1647{ RET_TOK( INSERTELEMENT); }
1648 YY_BREAK
1649case 102:
1650YY_RULE_SETUP
1651#line 204 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1652{ RET_TOK( SHUFFLEVECTOR); }
1653 YY_BREAK
1654case 103:
1655YY_RULE_SETUP
1656#line 207 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1657{ RET_TOK( VAR_ID); }
1658 YY_BREAK
1659case 104:
1660YY_RULE_SETUP
1661#line 208 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1662{ RET_TOK( LABELSTR); }
1663 YY_BREAK
1664case 105:
1665YY_RULE_SETUP
1666#line 209 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1667{ RET_TOK( LABELSTR); }
1668 YY_BREAK
1669case 106:
1670YY_RULE_SETUP
1671#line 210 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1672{ RET_TOK( STRINGCONSTANT ); }
1673 YY_BREAK
1674case 107:
1675YY_RULE_SETUP
1676#line 211 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1677{ RET_TOK( EUINT64VAL ); }
1678 YY_BREAK
1679case 108:
1680YY_RULE_SETUP
1681#line 212 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1682{ RET_TOK( ESINT64VAL ); }
1683 YY_BREAK
1684case 109:
1685YY_RULE_SETUP
1686#line 213 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1687{ RET_TOK( yytext[0] == 's' ? ESINT64VAL : EUINT64VAL ); }
1688 YY_BREAK
1689case 110:
1690YY_RULE_SETUP
1691#line 214 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1692{ RET_TOK( UINTVAL); }
1693 YY_BREAK
1694case 111:
1695YY_RULE_SETUP
1696#line 215 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1697{ RET_TOK( SINTVAL); }
1698 YY_BREAK
1699case 112:
1700YY_RULE_SETUP
1701#line 216 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1702{ RET_TOK( FPVAL); }
1703 YY_BREAK
1704case 113:
1705YY_RULE_SETUP
1706#line 217 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1707{ RET_TOK( FPVAL); }
1708 YY_BREAK
1709case YY_STATE_EOF(INITIAL):
1710#line 218 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1711{
1712 /* Make sure to free the internal buffers for flex when we are
1713 * done reading our input!
1714 */
1715 yy_delete_buffer(YY_CURRENT_BUFFER);
1716 return EOF;
1717 }
1718 YY_BREAK
1719case 114:
1720YY_RULE_SETUP
1721#line 226 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1722{ /* Ignore whitespace */ }
1723 YY_BREAK
1724case 115:
1725YY_RULE_SETUP
1726#line 227 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1727{ return yytext[0]; }
1728 YY_BREAK
1729case 116:
1730YY_RULE_SETUP
1731#line 229 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
1732YY_FATAL_ERROR( "flex scanner jammed" );
1733 YY_BREAK
1734#line 1735 "UpgradeLexer.cpp"
1735
1736 case YY_END_OF_BUFFER:
1737 {
1738 /* Amount of text matched not including the EOB char. */
1739 int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
1740
1741 /* Undo the effects of YY_DO_BEFORE_ACTION. */
1742 *yy_cp = yy_hold_char;
1743 YY_RESTORE_YY_MORE_OFFSET
1744
1745 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
1746 {
1747 /* We're scanning a new file or input source. It's
1748 * possible that this happened because the user
1749 * just pointed yyin at a new source and called
1750 * yylex(). If so, then we have to assure
1751 * consistency between yy_current_buffer and our
1752 * globals. Here is the right place to do so, because
1753 * this is the first action (other than possibly a
1754 * back-up) that will match for the new input source.
1755 */
1756 yy_n_chars = yy_current_buffer->yy_n_chars;
1757 yy_current_buffer->yy_input_file = yyin;
1758 yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
1759 }
1760
1761 /* Note that here we test for yy_c_buf_p "<=" to the position
1762 * of the first EOB in the buffer, since yy_c_buf_p will
1763 * already have been incremented past the NUL character
1764 * (since all states make transitions on EOB to the
1765 * end-of-buffer state). Contrast this with the test
1766 * in input().
1767 */
1768 if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
1769 { /* This was really a NUL. */
1770 yy_state_type yy_next_state;
1771
1772 yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
1773
1774 yy_current_state = yy_get_previous_state();
1775
1776 /* Okay, we're now positioned to make the NUL
1777 * transition. We couldn't have
1778 * yy_get_previous_state() go ahead and do it
1779 * for us because it doesn't know how to deal
1780 * with the possibility of jamming (and we don't
1781 * want to build jamming into it because then it
1782 * will run more slowly).
1783 */
1784
1785 yy_next_state = yy_try_NUL_trans( yy_current_state );
1786
1787 yy_bp = yytext_ptr + YY_MORE_ADJ;
1788
1789 if ( yy_next_state )
1790 {
1791 /* Consume the NUL. */
1792 yy_cp = ++yy_c_buf_p;
1793 yy_current_state = yy_next_state;
1794 goto yy_match;
1795 }
1796
1797 else
1798 {
1799 yy_cp = yy_c_buf_p;
1800 goto yy_find_action;
1801 }
1802 }
1803
1804 else switch ( yy_get_next_buffer() )
1805 {
1806 case EOB_ACT_END_OF_FILE:
1807 {
1808 yy_did_buffer_switch_on_eof = 0;
1809
1810 if ( yywrap() )
1811 {
1812 /* Note: because we've taken care in
1813 * yy_get_next_buffer() to have set up
1814 * yytext, we can now set up
1815 * yy_c_buf_p so that if some total
1816 * hoser (like flex itself) wants to
1817 * call the scanner after we return the
1818 * YY_NULL, it'll still work - another
1819 * YY_NULL will get returned.
1820 */
1821 yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
1822
1823 yy_act = YY_STATE_EOF(YY_START);
1824 goto do_action;
1825 }
1826
1827 else
1828 {
1829 if ( ! yy_did_buffer_switch_on_eof )
1830 YY_NEW_FILE;
1831 }
1832 break;
1833 }
1834
1835 case EOB_ACT_CONTINUE_SCAN:
1836 yy_c_buf_p =
1837 yytext_ptr + yy_amount_of_matched_text;
1838
1839 yy_current_state = yy_get_previous_state();
1840
1841 yy_cp = yy_c_buf_p;
1842 yy_bp = yytext_ptr + YY_MORE_ADJ;
1843 goto yy_match;
1844
1845 case EOB_ACT_LAST_MATCH:
1846 yy_c_buf_p =
1847 &yy_current_buffer->yy_ch_buf[yy_n_chars];
1848
1849 yy_current_state = yy_get_previous_state();
1850
1851 yy_cp = yy_c_buf_p;
1852 yy_bp = yytext_ptr + YY_MORE_ADJ;
1853 goto yy_find_action;
1854 }
1855 break;
1856 }
1857
1858 default:
1859 YY_FATAL_ERROR(
1860 "fatal flex scanner internal error--no action found" );
1861 } /* end of action switch */
1862 } /* end of scanning one token */
1863 } /* end of yylex */
1864
1865
1866/* yy_get_next_buffer - try to read in a new buffer
1867 *
1868 * Returns a code representing an action:
1869 * EOB_ACT_LAST_MATCH -
1870 * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
1871 * EOB_ACT_END_OF_FILE - end of file
1872 */
1873
1874static int yy_get_next_buffer()
1875 {
1876 register char *dest = yy_current_buffer->yy_ch_buf;
1877 register char *source = yytext_ptr;
1878 register int number_to_move, i;
1879 int ret_val;
1880
1881 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
1882 YY_FATAL_ERROR(
1883 "fatal flex scanner internal error--end of buffer missed" );
1884
1885 if ( yy_current_buffer->yy_fill_buffer == 0 )
1886 { /* Don't try to fill the buffer, so this is an EOF. */
1887 if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
1888 {
1889 /* We matched a single character, the EOB, so
1890 * treat this as a final EOF.
1891 */
1892 return EOB_ACT_END_OF_FILE;
1893 }
1894
1895 else
1896 {
1897 /* We matched some text prior to the EOB, first
1898 * process it.
1899 */
1900 return EOB_ACT_LAST_MATCH;
1901 }
1902 }
1903
1904 /* Try to read more data. */
1905
1906 /* First move last chars to start of buffer. */
1907 number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
1908
1909 for ( i = 0; i < number_to_move; ++i )
1910 *(dest++) = *(source++);
1911
1912 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
1913 /* don't do the read, it's not guaranteed to return an EOF,
1914 * just force an EOF
1915 */
1916 yy_current_buffer->yy_n_chars = yy_n_chars = 0;
1917
1918 else
1919 {
1920 int num_to_read =
1921 yy_current_buffer->yy_buf_size - number_to_move - 1;
1922
1923 while ( num_to_read <= 0 )
1924 { /* Not enough room in the buffer - grow it. */
1925#ifdef YY_USES_REJECT
1926 YY_FATAL_ERROR(
1927"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
1928#else
1929
1930 /* just a shorter name for the current buffer */
1931 YY_BUFFER_STATE b = yy_current_buffer;
1932
1933 int yy_c_buf_p_offset =
1934 (int) (yy_c_buf_p - b->yy_ch_buf);
1935
1936 if ( b->yy_is_our_buffer )
1937 {
1938 int new_size = b->yy_buf_size * 2;
1939
1940 if ( new_size <= 0 )
1941 b->yy_buf_size += b->yy_buf_size / 8;
1942 else
1943 b->yy_buf_size *= 2;
1944
1945 b->yy_ch_buf = (char *)
1946 /* Include room in for 2 EOB chars. */
1947 yy_flex_realloc( (void *) b->yy_ch_buf,
1948 b->yy_buf_size + 2 );
1949 }
1950 else
1951 /* Can't grow it, we don't own it. */
1952 b->yy_ch_buf = 0;
1953
1954 if ( ! b->yy_ch_buf )
1955 YY_FATAL_ERROR(
1956 "fatal error - scanner input buffer overflow" );
1957
1958 yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
1959
1960 num_to_read = yy_current_buffer->yy_buf_size -
1961 number_to_move - 1;
1962#endif
1963 }
1964
1965 if ( num_to_read > YY_READ_BUF_SIZE )
1966 num_to_read = YY_READ_BUF_SIZE;
1967
1968 /* Read in more data. */
1969 YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
1970 yy_n_chars, num_to_read );
1971
1972 yy_current_buffer->yy_n_chars = yy_n_chars;
1973 }
1974
1975 if ( yy_n_chars == 0 )
1976 {
1977 if ( number_to_move == YY_MORE_ADJ )
1978 {
1979 ret_val = EOB_ACT_END_OF_FILE;
1980 yyrestart( yyin );
1981 }
1982
1983 else
1984 {
1985 ret_val = EOB_ACT_LAST_MATCH;
1986 yy_current_buffer->yy_buffer_status =
1987 YY_BUFFER_EOF_PENDING;
1988 }
1989 }
1990
1991 else
1992 ret_val = EOB_ACT_CONTINUE_SCAN;
1993
1994 yy_n_chars += number_to_move;
1995 yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
1996 yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
1997
1998 yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
1999
2000 return ret_val;
2001 }
2002
2003
2004/* yy_get_previous_state - get the state just before the EOB char was reached */
2005
2006static yy_state_type yy_get_previous_state()
2007 {
2008 register yy_state_type yy_current_state;
2009 register char *yy_cp;
2010
2011 yy_current_state = yy_start;
2012 yy_state_ptr = yy_state_buf;
2013 *yy_state_ptr++ = yy_current_state;
2014
2015 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
2016 {
2017 register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
2018 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
2019 {
2020 yy_current_state = (int) yy_def[yy_current_state];
2021 if ( yy_current_state >= 506 )
2022 yy_c = yy_meta[(unsigned int) yy_c];
2023 }
2024 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
2025 *yy_state_ptr++ = yy_current_state;
2026 }
2027
2028 return yy_current_state;
2029 }
2030
2031
2032/* yy_try_NUL_trans - try to make a transition on the NUL character
2033 *
2034 * synopsis
2035 * next_state = yy_try_NUL_trans( current_state );
2036 */
2037
2038#ifdef YY_USE_PROTOS
2039static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
2040#else
2041static yy_state_type yy_try_NUL_trans( yy_current_state )
2042yy_state_type yy_current_state;
2043#endif
2044 {
2045 register int yy_is_jam;
2046
2047 register YY_CHAR yy_c = 1;
2048 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
2049 {
2050 yy_current_state = (int) yy_def[yy_current_state];
2051 if ( yy_current_state >= 506 )
2052 yy_c = yy_meta[(unsigned int) yy_c];
2053 }
2054 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
2055 yy_is_jam = (yy_current_state == 505);
2056 if ( ! yy_is_jam )
2057 *yy_state_ptr++ = yy_current_state;
2058
2059 return yy_is_jam ? 0 : yy_current_state;
2060 }
2061
2062
2063#ifndef YY_NO_UNPUT
2064#ifdef YY_USE_PROTOS
2065static inline void yyunput( int c, register char *yy_bp )
2066#else
2067static inline void yyunput( c, yy_bp )
2068int c;
2069register char *yy_bp;
2070#endif
2071 {
2072 register char *yy_cp = yy_c_buf_p;
2073
2074 /* undo effects of setting up yytext */
2075 *yy_cp = yy_hold_char;
2076
2077 if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
2078 { /* need to shift things up to make room */
2079 /* +2 for EOB chars. */
2080 register int number_to_move = yy_n_chars + 2;
2081 register char *dest = &yy_current_buffer->yy_ch_buf[
2082 yy_current_buffer->yy_buf_size + 2];
2083 register char *source =
2084 &yy_current_buffer->yy_ch_buf[number_to_move];
2085
2086 while ( source > yy_current_buffer->yy_ch_buf )
2087 *--dest = *--source;
2088
2089 yy_cp += (int) (dest - source);
2090 yy_bp += (int) (dest - source);
2091 yy_current_buffer->yy_n_chars =
2092 yy_n_chars = yy_current_buffer->yy_buf_size;
2093
2094 if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
2095 YY_FATAL_ERROR( "flex scanner push-back overflow" );
2096 }
2097
2098 *--yy_cp = (char) c;
2099
2100 if ( c == '\n' )
2101 --yylineno;
2102
2103 yytext_ptr = yy_bp;
2104 yy_hold_char = *yy_cp;
2105 yy_c_buf_p = yy_cp;
2106 }
2107#endif /* ifndef YY_NO_UNPUT */
2108
2109
2110#ifndef YY_NO_INPUT
2111#ifdef __cplusplus
2112static int yyinput()
2113#else
2114static int input()
2115#endif
2116 {
2117 int c;
2118
2119 *yy_c_buf_p = yy_hold_char;
2120
2121 if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
2122 {
2123 /* yy_c_buf_p now points to the character we want to return.
2124 * If this occurs *before* the EOB characters, then it's a
2125 * valid NUL; if not, then we've hit the end of the buffer.
2126 */
2127 if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
2128 /* This was really a NUL. */
2129 *yy_c_buf_p = '\0';
2130
2131 else
2132 { /* need more input */
2133 int offset = yy_c_buf_p - yytext_ptr;
2134 ++yy_c_buf_p;
2135
2136 switch ( yy_get_next_buffer() )
2137 {
2138 case EOB_ACT_LAST_MATCH:
2139 /* This happens because yy_g_n_b()
2140 * sees that we've accumulated a
2141 * token and flags that we need to
2142 * try matching the token before
2143 * proceeding. But for input(),
2144 * there's no matching to consider.
2145 * So convert the EOB_ACT_LAST_MATCH
2146 * to EOB_ACT_END_OF_FILE.
2147 */
2148
2149 /* Reset buffer status. */
2150 yyrestart( yyin );
2151
2152 /* fall through */
2153
2154 case EOB_ACT_END_OF_FILE:
2155 {
2156 if ( yywrap() )
2157 return EOF;
2158
2159 if ( ! yy_did_buffer_switch_on_eof )
2160 YY_NEW_FILE;
2161#ifdef __cplusplus
2162 return yyinput();
2163#else
2164 return input();
2165#endif
2166 }
2167
2168 case EOB_ACT_CONTINUE_SCAN:
2169 yy_c_buf_p = yytext_ptr + offset;
2170 break;
2171 }
2172 }
2173 }
2174
2175 c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
2176 *yy_c_buf_p = '\0'; /* preserve yytext */
2177 yy_hold_char = *++yy_c_buf_p;
2178
2179 if ( c == '\n' )
2180 ++yylineno;
2181
2182 return c;
2183 }
2184#endif /* YY_NO_INPUT */
2185
2186#ifdef YY_USE_PROTOS
2187void yyrestart( FILE *input_file )
2188#else
2189void yyrestart( input_file )
2190FILE *input_file;
2191#endif
2192 {
2193 if ( ! yy_current_buffer )
2194 yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
2195
2196 yy_init_buffer( yy_current_buffer, input_file );
2197 yy_load_buffer_state();
2198 }
2199
2200
2201#ifdef YY_USE_PROTOS
2202void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
2203#else
2204void yy_switch_to_buffer( new_buffer )
2205YY_BUFFER_STATE new_buffer;
2206#endif
2207 {
2208 if ( yy_current_buffer == new_buffer )
2209 return;
2210
2211 if ( yy_current_buffer )
2212 {
2213 /* Flush out information for old buffer. */
2214 *yy_c_buf_p = yy_hold_char;
2215 yy_current_buffer->yy_buf_pos = yy_c_buf_p;
2216 yy_current_buffer->yy_n_chars = yy_n_chars;
2217 }
2218
2219 yy_current_buffer = new_buffer;
2220 yy_load_buffer_state();
2221
2222 /* We don't actually know whether we did this switch during
2223 * EOF (yywrap()) processing, but the only time this flag
2224 * is looked at is after yywrap() is called, so it's safe
2225 * to go ahead and always set it.
2226 */
2227 yy_did_buffer_switch_on_eof = 1;
2228 }
2229
2230
2231#ifdef YY_USE_PROTOS
2232void yy_load_buffer_state( void )
2233#else
2234void yy_load_buffer_state()
2235#endif
2236 {
2237 yy_n_chars = yy_current_buffer->yy_n_chars;
2238 yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
2239 yyin = yy_current_buffer->yy_input_file;
2240 yy_hold_char = *yy_c_buf_p;
2241 }
2242
2243
2244#ifdef YY_USE_PROTOS
2245YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
2246#else
2247YY_BUFFER_STATE yy_create_buffer( file, size )
2248FILE *file;
2249int size;
2250#endif
2251 {
2252 YY_BUFFER_STATE b;
2253
2254 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
2255 if ( ! b )
2256 YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
2257
2258 b->yy_buf_size = size;
2259
2260 /* yy_ch_buf has to be 2 characters longer than the size given because
2261 * we need to put in 2 end-of-buffer characters.
2262 */
2263 b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
2264 if ( ! b->yy_ch_buf )
2265 YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
2266
2267 b->yy_is_our_buffer = 1;
2268
2269 yy_init_buffer( b, file );
2270
2271 return b;
2272 }
2273
2274
2275#ifdef YY_USE_PROTOS
2276void yy_delete_buffer( YY_BUFFER_STATE b )
2277#else
2278void yy_delete_buffer( b )
2279YY_BUFFER_STATE b;
2280#endif
2281 {
2282 if ( ! b )
2283 return;
2284
2285 if ( b == yy_current_buffer )
2286 yy_current_buffer = (YY_BUFFER_STATE) 0;
2287
2288 if ( b->yy_is_our_buffer )
2289 yy_flex_free( (void *) b->yy_ch_buf );
2290
2291 yy_flex_free( (void *) b );
2292 }
2293
2294
2295
2296#ifdef YY_USE_PROTOS
2297void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
2298#else
2299void yy_init_buffer( b, file )
2300YY_BUFFER_STATE b;
2301FILE *file;
2302#endif
2303
2304
2305 {
2306 yy_flush_buffer( b );
2307
2308 b->yy_input_file = file;
2309 b->yy_fill_buffer = 1;
2310
2311#if YY_ALWAYS_INTERACTIVE
2312 b->yy_is_interactive = 1;
2313#else
2314#if YY_NEVER_INTERACTIVE
2315 b->yy_is_interactive = 0;
2316#else
2317 b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
2318#endif
2319#endif
2320 }
2321
2322
2323#ifdef YY_USE_PROTOS
2324void yy_flush_buffer( YY_BUFFER_STATE b )
2325#else
2326void yy_flush_buffer( b )
2327YY_BUFFER_STATE b;
2328#endif
2329
2330 {
2331 if ( ! b )
2332 return;
2333
2334 b->yy_n_chars = 0;
2335
2336 /* We always need two end-of-buffer characters. The first causes
2337 * a transition to the end-of-buffer state. The second causes
2338 * a jam in that state.
2339 */
2340 b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
2341 b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
2342
2343 b->yy_buf_pos = &b->yy_ch_buf[0];
2344
2345 b->yy_at_bol = 1;
2346 b->yy_buffer_status = YY_BUFFER_NEW;
2347
2348 if ( b == yy_current_buffer )
2349 yy_load_buffer_state();
2350 }
2351
2352
2353#ifndef YY_NO_SCAN_BUFFER
2354#ifdef YY_USE_PROTOS
2355YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
2356#else
2357YY_BUFFER_STATE yy_scan_buffer( base, size )
2358char *base;
2359yy_size_t size;
2360#endif
2361 {
2362 YY_BUFFER_STATE b;
2363
2364 if ( size < 2 ||
2365 base[size-2] != YY_END_OF_BUFFER_CHAR ||
2366 base[size-1] != YY_END_OF_BUFFER_CHAR )
2367 /* They forgot to leave room for the EOB's. */
2368 return 0;
2369
2370 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
2371 if ( ! b )
2372 YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
2373
2374 b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
2375 b->yy_buf_pos = b->yy_ch_buf = base;
2376 b->yy_is_our_buffer = 0;
2377 b->yy_input_file = 0;
2378 b->yy_n_chars = b->yy_buf_size;
2379 b->yy_is_interactive = 0;
2380 b->yy_at_bol = 1;
2381 b->yy_fill_buffer = 0;
2382 b->yy_buffer_status = YY_BUFFER_NEW;
2383
2384 yy_switch_to_buffer( b );
2385
2386 return b;
2387 }
2388#endif
2389
2390
2391#ifndef YY_NO_SCAN_STRING
2392#ifdef YY_USE_PROTOS
2393YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
2394#else
2395YY_BUFFER_STATE yy_scan_string( yy_str )
2396yyconst char *yy_str;
2397#endif
2398 {
2399 int len;
2400 for ( len = 0; yy_str[len]; ++len )
2401 ;
2402
2403 return yy_scan_bytes( yy_str, len );
2404 }
2405#endif
2406
2407
2408#ifndef YY_NO_SCAN_BYTES
2409#ifdef YY_USE_PROTOS
2410YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
2411#else
2412YY_BUFFER_STATE yy_scan_bytes( bytes, len )
2413yyconst char *bytes;
2414int len;
2415#endif
2416 {
2417 YY_BUFFER_STATE b;
2418 char *buf;
2419 yy_size_t n;
2420 int i;
2421
2422 /* Get memory for full buffer, including space for trailing EOB's. */
2423 n = len + 2;
2424 buf = (char *) yy_flex_alloc( n );
2425 if ( ! buf )
2426 YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
2427
2428 for ( i = 0; i < len; ++i )
2429 buf[i] = bytes[i];
2430
2431 buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
2432
2433 b = yy_scan_buffer( buf, n );
2434 if ( ! b )
2435 YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
2436
2437 /* It's okay to grow etc. this buffer, and we should throw it
2438 * away when we're done.
2439 */
2440 b->yy_is_our_buffer = 1;
2441
2442 return b;
2443 }
2444#endif
2445
2446
2447#ifndef YY_NO_PUSH_STATE
2448#ifdef YY_USE_PROTOS
2449static void yy_push_state( int new_state )
2450#else
2451static void yy_push_state( new_state )
2452int new_state;
2453#endif
2454 {
2455 if ( yy_start_stack_ptr >= yy_start_stack_depth )
2456 {
2457 yy_size_t new_size;
2458
2459 yy_start_stack_depth += YY_START_STACK_INCR;
2460 new_size = yy_start_stack_depth * sizeof( int );
2461
2462 if ( ! yy_start_stack )
2463 yy_start_stack = (int *) yy_flex_alloc( new_size );
2464
2465 else
2466 yy_start_stack = (int *) yy_flex_realloc(
2467 (void *) yy_start_stack, new_size );
2468
2469 if ( ! yy_start_stack )
2470 YY_FATAL_ERROR(
2471 "out of memory expanding start-condition stack" );
2472 }
2473
2474 yy_start_stack[yy_start_stack_ptr++] = YY_START;
2475
2476 BEGIN(new_state);
2477 }
2478#endif
2479
2480
2481#ifndef YY_NO_POP_STATE
2482static void yy_pop_state()
2483 {
2484 if ( --yy_start_stack_ptr < 0 )
2485 YY_FATAL_ERROR( "start-condition stack underflow" );
2486
2487 BEGIN(yy_start_stack[yy_start_stack_ptr]);
2488 }
2489#endif
2490
2491
2492#ifndef YY_NO_TOP_STATE
2493static int yy_top_state()
2494 {
2495 return yy_start_stack[yy_start_stack_ptr - 1];
2496 }
2497#endif
2498
2499#ifndef YY_EXIT_FAILURE
2500#define YY_EXIT_FAILURE 2
2501#endif
2502
2503#ifdef YY_USE_PROTOS
2504static void yy_fatal_error( yyconst char msg[] )
2505#else
2506static void yy_fatal_error( msg )
2507char msg[];
2508#endif
2509 {
2510 (void) fprintf( stderr, "%s\n", msg );
2511 exit( YY_EXIT_FAILURE );
2512 }
2513
2514
2515
2516/* Redefine yyless() so it works in section 3 code. */
2517
2518#undef yyless
2519#define yyless(n) \
2520 do \
2521 { \
2522 /* Undo effects of setting up yytext. */ \
2523 yytext[yyleng] = yy_hold_char; \
2524 yy_c_buf_p = yytext + n; \
2525 yy_hold_char = *yy_c_buf_p; \
2526 *yy_c_buf_p = '\0'; \
2527 yyleng = n; \
2528 } \
2529 while ( 0 )
2530
2531
2532/* Internal utility routines. */
2533
2534#ifndef yytext_ptr
2535#ifdef YY_USE_PROTOS
2536static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
2537#else
2538static void yy_flex_strncpy( s1, s2, n )
2539char *s1;
2540yyconst char *s2;
2541int n;
2542#endif
2543 {
2544 register int i;
2545 for ( i = 0; i < n; ++i )
2546 s1[i] = s2[i];
2547 }
2548#endif
2549
2550#ifdef YY_NEED_STRLEN
2551#ifdef YY_USE_PROTOS
2552static int yy_flex_strlen( yyconst char *s )
2553#else
2554static int yy_flex_strlen( s )
2555yyconst char *s;
2556#endif
2557 {
2558 register int n;
2559 for ( n = 0; s[n]; ++n )
2560 ;
2561
2562 return n;
2563 }
2564#endif
2565
2566
2567#ifdef YY_USE_PROTOS
2568static void *yy_flex_alloc( yy_size_t size )
2569#else
2570static void *yy_flex_alloc( size )
2571yy_size_t size;
2572#endif
2573 {
2574 return (void *) malloc( size );
2575 }
2576
2577#ifdef YY_USE_PROTOS
2578static inline void *yy_flex_realloc( void *ptr, yy_size_t size )
2579#else
2580static inline void *yy_flex_realloc( ptr, size )
2581void *ptr;
2582yy_size_t size;
2583#endif
2584 {
2585 /* The cast to (char *) in the following accommodates both
2586 * implementations that use char* generic pointers, and those
2587 * that use void* generic pointers. It works with the latter
2588 * because both ANSI C and C++ allow castless assignment from
2589 * any pointer type to void*, and deal with argument conversions
2590 * as though doing an assignment.
2591 */
2592 return (void *) realloc( (char *) ptr, size );
2593 }
2594
2595#ifdef YY_USE_PROTOS
2596static void yy_flex_free( void *ptr )
2597#else
2598static void yy_flex_free( ptr )
2599void *ptr;
2600#endif
2601 {
2602 free( ptr );
2603 }
2604
2605#if YY_MAIN
2606int main()
2607 {
2608 yylex();
2609 return 0;
2610 }
2611#endif
2612#line 229 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
2613