blob: c826cad3722718b324566759e7f578237c03e94a [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
Reid Spencer96839be2006-11-30 16:50:26 +0000845/*===-- UpgradeLexer.l - Scanner for 1.9 assembly files --------*- C++ -*--===//
Reid Spencere7c3c602006-11-30 06:36:44 +0000846//
847// The LLVM Compiler Infrastructure
848//
Reid Spencer96839be2006-11-30 16:50:26 +0000849// This file was developed by Reid Spencer and is distributed under the
850// University of Illinois Open Source License. See LICENSE.TXT for details.
Reid Spencere7c3c602006-11-30 06:36:44 +0000851//
852//===----------------------------------------------------------------------===//
853//
Reid Spencer96839be2006-11-30 16:50:26 +0000854// This file implements the flex scanner for LLVM 1.9 assembly languages files.
Reid Spencere7c3c602006-11-30 06:36:44 +0000855//
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
Reid Spencere7c3c602006-11-30 06:36:44 +0000866static void trim(std::string& str) {
867 size_t startpos = str.find_first_not_of(" \t\n\r",0);
868 if (startpos != std::string::npos)
869 str.erase(0,startpos);
870}
871
Reid Spencer96839be2006-11-30 16:50:26 +0000872#define YY_INPUT(buf,result,max_size) \
873{ \
874 if (LexInput->good() && !LexInput->eof()) { \
875 LexInput->read(buf,max_size); \
876 result = LexInput->gcount(); \
877 } else {\
878 result = YY_NULL; \
879 } \
880}
881
882
Reid Spencere7c3c602006-11-30 06:36:44 +0000883// Construct a token value for a non-obsolete token
884#define RET_TOK(sym) \
885 Upgradelval = new std::string(yytext); \
886 trim(*Upgradelval); \
887 return sym
888
889#define YY_NEVER_INTERACTIVE 1
890/* Comments start with a ; and go till end of line */
891/* Variable(Value) identifiers start with a % sign */
892/* Label identifiers end with a colon */
893/* Quoted names can contain any character except " and \ */
894/* [PN]Integer: match positive and negative literal integer values that
895 * are preceeded by a '%' character. These represent unnamed variable slots.
896 */
897/* E[PN]Integer: match positive and negative literal integer values */
898/* FPConstant - A Floating point constant.
899 */
900/* HexFPConstant - Floating point constant represented in IEEE format as a
901 * hexadecimal number for when exponential notation is not precise enough.
902 */
903/* HexIntConstant - Hexadecimal constant generated by the CFE to avoid forcing
904 * it to deal with 64 bit numbers.
905 */
Reid Spencer96839be2006-11-30 16:50:26 +0000906#line 907 "UpgradeLexer.cpp"
Reid Spencere7c3c602006-11-30 06:36:44 +0000907
908/* Macros after this point can all be overridden by user definitions in
909 * section 1.
910 */
911
912#ifndef YY_SKIP_YYWRAP
913#ifdef __cplusplus
914extern "C" int yywrap YY_PROTO(( void ));
915#else
916extern int yywrap YY_PROTO(( void ));
917#endif
918#endif
919
920#ifndef YY_NO_UNPUT
921static inline void yyunput YY_PROTO(( int c, char *buf_ptr ));
922#endif
923
924#ifndef yytext_ptr
925static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
926#endif
927
928#ifdef YY_NEED_STRLEN
929static int yy_flex_strlen YY_PROTO(( yyconst char * ));
930#endif
931
932#ifndef YY_NO_INPUT
933#ifdef __cplusplus
934static int yyinput YY_PROTO(( void ));
935#else
936static int input YY_PROTO(( void ));
937#endif
938#endif
939
940#if YY_STACK_USED
941static int yy_start_stack_ptr = 0;
942static int yy_start_stack_depth = 0;
943static int *yy_start_stack = 0;
944#ifndef YY_NO_PUSH_STATE
945static void yy_push_state YY_PROTO(( int new_state ));
946#endif
947#ifndef YY_NO_POP_STATE
948static void yy_pop_state YY_PROTO(( void ));
949#endif
950#ifndef YY_NO_TOP_STATE
951static int yy_top_state YY_PROTO(( void ));
952#endif
953
954#else
955#define YY_NO_PUSH_STATE 1
956#define YY_NO_POP_STATE 1
957#define YY_NO_TOP_STATE 1
958#endif
959
960#ifdef YY_MALLOC_DECL
961YY_MALLOC_DECL
962#else
963#if __STDC__
964#ifndef __cplusplus
965#include <stdlib.h>
966#endif
967#else
968/* Just try to get by without declaring the routines. This will fail
969 * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
970 * or sizeof(void*) != sizeof(int).
971 */
972#endif
973#endif
974
975/* Amount of stuff to slurp up with each read. */
976#ifndef YY_READ_BUF_SIZE
977#define YY_READ_BUF_SIZE 8192
978#endif
979
980/* Copy whatever the last rule matched to the standard output. */
981
982#ifndef ECHO
983/* This used to be an fputs(), but since the string might contain NUL's,
984 * we now use fwrite().
985 */
986#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
987#endif
988
989/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
990 * is returned in "result".
991 */
992#ifndef YY_INPUT
993#define YY_INPUT(buf,result,max_size) \
994 if ( yy_current_buffer->yy_is_interactive ) \
995 { \
996 int c = '*', n; \
997 for ( n = 0; n < max_size && \
998 (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
999 buf[n] = (char) c; \
1000 if ( c == '\n' ) \
1001 buf[n++] = (char) c; \
1002 if ( c == EOF && ferror( yyin ) ) \
1003 YY_FATAL_ERROR( "input in flex scanner failed" ); \
1004 result = n; \
1005 } \
1006 else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
1007 && ferror( yyin ) ) \
1008 YY_FATAL_ERROR( "input in flex scanner failed" );
1009#endif
1010
1011/* No semi-colon after return; correct usage is to write "yyterminate();" -
1012 * we don't want an extra ';' after the "return" because that will cause
1013 * some compilers to complain about unreachable statements.
1014 */
1015#ifndef yyterminate
1016#define yyterminate() return YY_NULL
1017#endif
1018
1019/* Number of entries by which start-condition stack grows. */
1020#ifndef YY_START_STACK_INCR
1021#define YY_START_STACK_INCR 25
1022#endif
1023
1024/* Report a fatal error. */
1025#ifndef YY_FATAL_ERROR
1026#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
1027#endif
1028
1029/* Default declaration of generated scanner - a define so the user can
1030 * easily add parameters.
1031 */
1032#ifndef YY_DECL
1033#define YY_DECL int yylex YY_PROTO(( void ))
1034#endif
1035
1036/* Code executed at the beginning of each rule, after yytext and yyleng
1037 * have been set up.
1038 */
1039#ifndef YY_USER_ACTION
1040#define YY_USER_ACTION
1041#endif
1042
1043/* Code executed at the end of each rule. */
1044#ifndef YY_BREAK
1045#define YY_BREAK break;
1046#endif
1047
1048#define YY_RULE_SETUP \
1049 YY_USER_ACTION
1050
1051YY_DECL
1052 {
1053 register yy_state_type yy_current_state;
1054 register char *yy_cp = NULL, *yy_bp = NULL;
1055 register int yy_act;
1056
Reid Spencer96839be2006-11-30 16:50:26 +00001057#line 101 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001058
1059
Reid Spencer96839be2006-11-30 16:50:26 +00001060#line 1061 "UpgradeLexer.cpp"
Reid Spencere7c3c602006-11-30 06:36:44 +00001061
1062 if ( yy_init )
1063 {
1064 yy_init = 0;
1065
1066#ifdef YY_USER_INIT
1067 YY_USER_INIT;
1068#endif
1069
1070 if ( ! yy_start )
1071 yy_start = 1; /* first start state */
1072
1073 if ( ! yyin )
1074 yyin = stdin;
1075
1076 if ( ! yyout )
1077 yyout = stdout;
1078
1079 if ( ! yy_current_buffer )
1080 yy_current_buffer =
1081 yy_create_buffer( yyin, YY_BUF_SIZE );
1082
1083 yy_load_buffer_state();
1084 }
1085
1086 while ( 1 ) /* loops until end-of-file is reached */
1087 {
1088 yy_cp = yy_c_buf_p;
1089
1090 /* Support of yytext. */
1091 *yy_cp = yy_hold_char;
1092
1093 /* yy_bp points to the position in yy_ch_buf of the start of
1094 * the current run.
1095 */
1096 yy_bp = yy_cp;
1097
1098 yy_current_state = yy_start;
1099 yy_state_ptr = yy_state_buf;
1100 *yy_state_ptr++ = yy_current_state;
1101yy_match:
1102 do
1103 {
1104 register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
1105 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
1106 {
1107 yy_current_state = (int) yy_def[yy_current_state];
1108 if ( yy_current_state >= 506 )
1109 yy_c = yy_meta[(unsigned int) yy_c];
1110 }
1111 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
1112 *yy_state_ptr++ = yy_current_state;
1113 ++yy_cp;
1114 }
1115 while ( yy_current_state != 505 );
1116
1117yy_find_action:
1118 yy_current_state = *--yy_state_ptr;
1119 yy_lp = yy_accept[yy_current_state];
1120find_rule: /* we branch to this label when backing up */
1121 for ( ; ; ) /* until we find what rule we matched */
1122 {
1123 if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
1124 {
1125 yy_act = yy_acclist[yy_lp];
1126 {
1127 yy_full_match = yy_cp;
1128 break;
1129 }
1130 }
1131 --yy_cp;
1132 yy_current_state = *--yy_state_ptr;
1133 yy_lp = yy_accept[yy_current_state];
1134 }
1135
1136 YY_DO_BEFORE_ACTION;
1137
1138 if ( yy_act != YY_END_OF_BUFFER )
1139 {
1140 int yyl;
1141 for ( yyl = 0; yyl < yyleng; ++yyl )
1142 if ( yytext[yyl] == '\n' )
1143 ++yylineno;
1144 }
1145
1146do_action: /* This label is used only to access EOF actions. */
1147
1148
1149 switch ( yy_act )
1150 { /* beginning of action switch */
1151case 1:
1152YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001153#line 103 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001154{ /* Ignore comments for now */ }
1155 YY_BREAK
1156case 2:
1157YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001158#line 105 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001159{ RET_TOK( BEGINTOK); }
1160 YY_BREAK
1161case 3:
1162YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001163#line 106 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001164{ RET_TOK( ENDTOK); }
1165 YY_BREAK
1166case 4:
1167YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001168#line 107 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001169{ RET_TOK( TRUETOK); }
1170 YY_BREAK
1171case 5:
1172YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001173#line 108 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001174{ RET_TOK( FALSETOK); }
1175 YY_BREAK
1176case 6:
1177YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001178#line 109 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001179{ RET_TOK( DECLARE); }
1180 YY_BREAK
1181case 7:
1182YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001183#line 110 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001184{ RET_TOK( GLOBAL); }
1185 YY_BREAK
1186case 8:
1187YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001188#line 111 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001189{ RET_TOK( CONSTANT); }
1190 YY_BREAK
1191case 9:
1192YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001193#line 112 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001194{ RET_TOK( INTERNAL); }
1195 YY_BREAK
1196case 10:
1197YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001198#line 113 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001199{ RET_TOK( LINKONCE); }
1200 YY_BREAK
1201case 11:
1202YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001203#line 114 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001204{ RET_TOK( WEAK); }
1205 YY_BREAK
1206case 12:
1207YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001208#line 115 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001209{ RET_TOK( APPENDING); }
1210 YY_BREAK
1211case 13:
1212YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001213#line 116 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001214{ RET_TOK( DLLIMPORT); }
1215 YY_BREAK
1216case 14:
1217YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001218#line 117 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001219{ RET_TOK( DLLEXPORT); }
1220 YY_BREAK
1221case 15:
1222YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001223#line 118 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001224{ RET_TOK( EXTERN_WEAK); }
1225 YY_BREAK
1226case 16:
1227YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001228#line 119 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001229{ RET_TOK( EXTERNAL); }
1230 YY_BREAK
1231case 17:
1232YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001233#line 120 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001234{ RET_TOK( IMPLEMENTATION); }
1235 YY_BREAK
1236case 18:
1237YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001238#line 121 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001239{ RET_TOK( ZEROINITIALIZER); }
1240 YY_BREAK
1241case 19:
1242YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001243#line 122 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001244{ RET_TOK( DOTDOTDOT); }
1245 YY_BREAK
1246case 20:
1247YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001248#line 123 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001249{ RET_TOK( UNDEF); }
1250 YY_BREAK
1251case 21:
1252YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001253#line 124 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001254{ RET_TOK( NULL_TOK); }
1255 YY_BREAK
1256case 22:
1257YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001258#line 125 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001259{ RET_TOK( TO); }
1260 YY_BREAK
1261case 23:
1262YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001263#line 126 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001264{ RET_TOK( TAIL); }
1265 YY_BREAK
1266case 24:
1267YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001268#line 127 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001269{ RET_TOK( TARGET); }
1270 YY_BREAK
1271case 25:
1272YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001273#line 128 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001274{ RET_TOK( TRIPLE); }
1275 YY_BREAK
1276case 26:
1277YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001278#line 129 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001279{ RET_TOK( DEPLIBS); }
1280 YY_BREAK
1281case 27:
1282YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001283#line 130 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001284{ RET_TOK( ENDIAN); }
1285 YY_BREAK
1286case 28:
1287YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001288#line 131 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001289{ RET_TOK( POINTERSIZE); }
1290 YY_BREAK
1291case 29:
1292YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001293#line 132 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001294{ RET_TOK( DATALAYOUT); }
1295 YY_BREAK
1296case 30:
1297YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001298#line 133 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001299{ RET_TOK( LITTLE); }
1300 YY_BREAK
1301case 31:
1302YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001303#line 134 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001304{ RET_TOK( BIG); }
1305 YY_BREAK
1306case 32:
1307YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001308#line 135 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001309{ RET_TOK( VOLATILE); }
1310 YY_BREAK
1311case 33:
1312YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001313#line 136 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001314{ RET_TOK( ALIGN); }
1315 YY_BREAK
1316case 34:
1317YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001318#line 137 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001319{ RET_TOK( SECTION); }
1320 YY_BREAK
1321case 35:
1322YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001323#line 138 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001324{ RET_TOK( MODULE); }
1325 YY_BREAK
1326case 36:
1327YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001328#line 139 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001329{ RET_TOK( ASM_TOK); }
1330 YY_BREAK
1331case 37:
1332YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001333#line 140 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001334{ RET_TOK( SIDEEFFECT); }
1335 YY_BREAK
1336case 38:
1337YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001338#line 142 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001339{ RET_TOK( CC_TOK); }
1340 YY_BREAK
1341case 39:
1342YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001343#line 143 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001344{ RET_TOK( CCC_TOK); }
1345 YY_BREAK
1346case 40:
1347YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001348#line 144 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001349{ RET_TOK( CSRETCC_TOK); }
1350 YY_BREAK
1351case 41:
1352YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001353#line 145 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001354{ RET_TOK( FASTCC_TOK); }
1355 YY_BREAK
1356case 42:
1357YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001358#line 146 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001359{ RET_TOK( COLDCC_TOK); }
1360 YY_BREAK
1361case 43:
1362YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001363#line 147 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001364{ RET_TOK( X86_STDCALLCC_TOK); }
1365 YY_BREAK
1366case 44:
1367YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001368#line 148 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001369{ RET_TOK( X86_FASTCALLCC_TOK); }
1370 YY_BREAK
1371case 45:
1372YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001373#line 150 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001374{ RET_TOK( VOID); }
1375 YY_BREAK
1376case 46:
1377YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001378#line 151 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001379{ RET_TOK( BOOL); }
1380 YY_BREAK
1381case 47:
1382YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001383#line 152 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001384{ RET_TOK( SBYTE); }
1385 YY_BREAK
1386case 48:
1387YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001388#line 153 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001389{ RET_TOK( UBYTE); }
1390 YY_BREAK
1391case 49:
1392YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001393#line 154 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001394{ RET_TOK( SHORT); }
1395 YY_BREAK
1396case 50:
1397YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001398#line 155 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001399{ RET_TOK( USHORT); }
1400 YY_BREAK
1401case 51:
1402YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001403#line 156 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001404{ RET_TOK( INT); }
1405 YY_BREAK
1406case 52:
1407YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001408#line 157 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001409{ RET_TOK( UINT); }
1410 YY_BREAK
1411case 53:
1412YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001413#line 158 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001414{ RET_TOK( LONG); }
1415 YY_BREAK
1416case 54:
1417YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001418#line 159 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001419{ RET_TOK( ULONG); }
1420 YY_BREAK
1421case 55:
1422YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001423#line 160 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001424{ RET_TOK( FLOAT); }
1425 YY_BREAK
1426case 56:
1427YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001428#line 161 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001429{ RET_TOK( DOUBLE); }
1430 YY_BREAK
1431case 57:
1432YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001433#line 162 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001434{ RET_TOK( LABEL); }
1435 YY_BREAK
1436case 58:
1437YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001438#line 163 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001439{ RET_TOK( TYPE); }
1440 YY_BREAK
1441case 59:
1442YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001443#line 164 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001444{ RET_TOK( OPAQUE); }
1445 YY_BREAK
1446case 60:
1447YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001448#line 166 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001449{ RET_TOK( ADD); }
1450 YY_BREAK
1451case 61:
1452YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001453#line 167 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001454{ RET_TOK( SUB); }
1455 YY_BREAK
1456case 62:
1457YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001458#line 168 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001459{ RET_TOK( MUL); }
1460 YY_BREAK
1461case 63:
1462YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001463#line 169 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001464{ RET_TOK( UDIV); }
1465 YY_BREAK
1466case 64:
1467YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001468#line 170 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001469{ RET_TOK( UDIV); }
1470 YY_BREAK
1471case 65:
1472YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001473#line 171 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001474{ RET_TOK( SDIV); }
1475 YY_BREAK
1476case 66:
1477YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001478#line 172 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001479{ RET_TOK( FDIV); }
1480 YY_BREAK
1481case 67:
1482YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001483#line 173 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001484{ RET_TOK( UREM); }
1485 YY_BREAK
1486case 68:
1487YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001488#line 174 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001489{ RET_TOK( UREM); }
1490 YY_BREAK
1491case 69:
1492YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001493#line 175 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001494{ RET_TOK( SREM); }
1495 YY_BREAK
1496case 70:
1497YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001498#line 176 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001499{ RET_TOK( FREM); }
1500 YY_BREAK
1501case 71:
1502YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001503#line 177 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001504{ RET_TOK( AND); }
1505 YY_BREAK
1506case 72:
1507YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001508#line 178 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001509{ RET_TOK( OR); }
1510 YY_BREAK
1511case 73:
1512YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001513#line 179 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001514{ RET_TOK( XOR); }
1515 YY_BREAK
1516case 74:
1517YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001518#line 180 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001519{ RET_TOK( SETNE); }
1520 YY_BREAK
1521case 75:
1522YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001523#line 181 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001524{ RET_TOK( SETEQ); }
1525 YY_BREAK
1526case 76:
1527YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001528#line 182 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001529{ RET_TOK( SETLT); }
1530 YY_BREAK
1531case 77:
1532YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001533#line 183 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001534{ RET_TOK( SETGT); }
1535 YY_BREAK
1536case 78:
1537YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001538#line 184 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001539{ RET_TOK( SETLE); }
1540 YY_BREAK
1541case 79:
1542YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001543#line 185 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001544{ RET_TOK( SETGE); }
1545 YY_BREAK
1546case 80:
1547YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001548#line 187 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001549{ RET_TOK( PHI_TOK); }
1550 YY_BREAK
1551case 81:
1552YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001553#line 188 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001554{ RET_TOK( CALL); }
1555 YY_BREAK
1556case 82:
1557YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001558#line 189 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001559{ RET_TOK( TRUNC); }
1560 YY_BREAK
1561case 83:
1562YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001563#line 190 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001564{ RET_TOK( SELECT); }
1565 YY_BREAK
1566case 84:
1567YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001568#line 191 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001569{ RET_TOK( SHL); }
1570 YY_BREAK
1571case 85:
1572YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001573#line 192 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001574{ RET_TOK( LSHR); }
1575 YY_BREAK
1576case 86:
1577YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001578#line 193 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001579{ RET_TOK( ASHR); }
1580 YY_BREAK
1581case 87:
1582YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001583#line 194 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001584{ RET_TOK( VAARG); }
1585 YY_BREAK
1586case 88:
1587YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001588#line 195 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001589{ RET_TOK( RET); }
1590 YY_BREAK
1591case 89:
1592YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001593#line 196 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001594{ RET_TOK( BR); }
1595 YY_BREAK
1596case 90:
1597YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001598#line 197 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001599{ RET_TOK( SWITCH); }
1600 YY_BREAK
1601case 91:
1602YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001603#line 198 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001604{ RET_TOK( INVOKE); }
1605 YY_BREAK
1606case 92:
1607YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001608#line 199 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001609{ RET_TOK( UNWIND); }
1610 YY_BREAK
1611case 93:
1612YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001613#line 200 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001614{ RET_TOK( UNREACHABLE); }
1615 YY_BREAK
1616case 94:
1617YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001618#line 202 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001619{ RET_TOK( MALLOC); }
1620 YY_BREAK
1621case 95:
1622YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001623#line 203 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001624{ RET_TOK( ALLOCA); }
1625 YY_BREAK
1626case 96:
1627YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001628#line 204 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001629{ RET_TOK( FREE); }
1630 YY_BREAK
1631case 97:
1632YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001633#line 205 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001634{ RET_TOK( LOAD); }
1635 YY_BREAK
1636case 98:
1637YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001638#line 206 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001639{ RET_TOK( STORE); }
1640 YY_BREAK
1641case 99:
1642YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001643#line 207 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001644{ RET_TOK( GETELEMENTPTR); }
1645 YY_BREAK
1646case 100:
1647YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001648#line 209 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001649{ RET_TOK( EXTRACTELEMENT); }
1650 YY_BREAK
1651case 101:
1652YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001653#line 210 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001654{ RET_TOK( INSERTELEMENT); }
1655 YY_BREAK
1656case 102:
1657YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001658#line 211 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001659{ RET_TOK( SHUFFLEVECTOR); }
1660 YY_BREAK
1661case 103:
1662YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001663#line 214 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001664{ RET_TOK( VAR_ID); }
1665 YY_BREAK
1666case 104:
1667YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001668#line 215 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001669{ RET_TOK( LABELSTR); }
1670 YY_BREAK
1671case 105:
1672YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001673#line 216 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001674{ RET_TOK( LABELSTR); }
1675 YY_BREAK
1676case 106:
1677YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001678#line 217 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001679{ RET_TOK( STRINGCONSTANT ); }
1680 YY_BREAK
1681case 107:
1682YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001683#line 218 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001684{ RET_TOK( EUINT64VAL ); }
1685 YY_BREAK
1686case 108:
1687YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001688#line 219 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001689{ RET_TOK( ESINT64VAL ); }
1690 YY_BREAK
1691case 109:
1692YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001693#line 220 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001694{ RET_TOK( yytext[0] == 's' ? ESINT64VAL : EUINT64VAL ); }
1695 YY_BREAK
1696case 110:
1697YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001698#line 221 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001699{ RET_TOK( UINTVAL); }
1700 YY_BREAK
1701case 111:
1702YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001703#line 222 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001704{ RET_TOK( SINTVAL); }
1705 YY_BREAK
1706case 112:
1707YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001708#line 223 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001709{ RET_TOK( FPVAL); }
1710 YY_BREAK
1711case 113:
1712YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001713#line 224 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001714{ RET_TOK( FPVAL); }
1715 YY_BREAK
1716case YY_STATE_EOF(INITIAL):
Reid Spencer96839be2006-11-30 16:50:26 +00001717#line 225 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001718{
1719 /* Make sure to free the internal buffers for flex when we are
1720 * done reading our input!
1721 */
1722 yy_delete_buffer(YY_CURRENT_BUFFER);
1723 return EOF;
1724 }
1725 YY_BREAK
1726case 114:
1727YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001728#line 233 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001729{ /* Ignore whitespace */ }
1730 YY_BREAK
1731case 115:
1732YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001733#line 234 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001734{ return yytext[0]; }
1735 YY_BREAK
1736case 116:
1737YY_RULE_SETUP
Reid Spencer96839be2006-11-30 16:50:26 +00001738#line 236 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00001739YY_FATAL_ERROR( "flex scanner jammed" );
1740 YY_BREAK
Reid Spencer96839be2006-11-30 16:50:26 +00001741#line 1742 "UpgradeLexer.cpp"
Reid Spencere7c3c602006-11-30 06:36:44 +00001742
1743 case YY_END_OF_BUFFER:
1744 {
1745 /* Amount of text matched not including the EOB char. */
1746 int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
1747
1748 /* Undo the effects of YY_DO_BEFORE_ACTION. */
1749 *yy_cp = yy_hold_char;
1750 YY_RESTORE_YY_MORE_OFFSET
1751
1752 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
1753 {
1754 /* We're scanning a new file or input source. It's
1755 * possible that this happened because the user
1756 * just pointed yyin at a new source and called
1757 * yylex(). If so, then we have to assure
1758 * consistency between yy_current_buffer and our
1759 * globals. Here is the right place to do so, because
1760 * this is the first action (other than possibly a
1761 * back-up) that will match for the new input source.
1762 */
1763 yy_n_chars = yy_current_buffer->yy_n_chars;
1764 yy_current_buffer->yy_input_file = yyin;
1765 yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
1766 }
1767
1768 /* Note that here we test for yy_c_buf_p "<=" to the position
1769 * of the first EOB in the buffer, since yy_c_buf_p will
1770 * already have been incremented past the NUL character
1771 * (since all states make transitions on EOB to the
1772 * end-of-buffer state). Contrast this with the test
1773 * in input().
1774 */
1775 if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
1776 { /* This was really a NUL. */
1777 yy_state_type yy_next_state;
1778
1779 yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
1780
1781 yy_current_state = yy_get_previous_state();
1782
1783 /* Okay, we're now positioned to make the NUL
1784 * transition. We couldn't have
1785 * yy_get_previous_state() go ahead and do it
1786 * for us because it doesn't know how to deal
1787 * with the possibility of jamming (and we don't
1788 * want to build jamming into it because then it
1789 * will run more slowly).
1790 */
1791
1792 yy_next_state = yy_try_NUL_trans( yy_current_state );
1793
1794 yy_bp = yytext_ptr + YY_MORE_ADJ;
1795
1796 if ( yy_next_state )
1797 {
1798 /* Consume the NUL. */
1799 yy_cp = ++yy_c_buf_p;
1800 yy_current_state = yy_next_state;
1801 goto yy_match;
1802 }
1803
1804 else
1805 {
1806 yy_cp = yy_c_buf_p;
1807 goto yy_find_action;
1808 }
1809 }
1810
1811 else switch ( yy_get_next_buffer() )
1812 {
1813 case EOB_ACT_END_OF_FILE:
1814 {
1815 yy_did_buffer_switch_on_eof = 0;
1816
1817 if ( yywrap() )
1818 {
1819 /* Note: because we've taken care in
1820 * yy_get_next_buffer() to have set up
1821 * yytext, we can now set up
1822 * yy_c_buf_p so that if some total
1823 * hoser (like flex itself) wants to
1824 * call the scanner after we return the
1825 * YY_NULL, it'll still work - another
1826 * YY_NULL will get returned.
1827 */
1828 yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
1829
1830 yy_act = YY_STATE_EOF(YY_START);
1831 goto do_action;
1832 }
1833
1834 else
1835 {
1836 if ( ! yy_did_buffer_switch_on_eof )
1837 YY_NEW_FILE;
1838 }
1839 break;
1840 }
1841
1842 case EOB_ACT_CONTINUE_SCAN:
1843 yy_c_buf_p =
1844 yytext_ptr + yy_amount_of_matched_text;
1845
1846 yy_current_state = yy_get_previous_state();
1847
1848 yy_cp = yy_c_buf_p;
1849 yy_bp = yytext_ptr + YY_MORE_ADJ;
1850 goto yy_match;
1851
1852 case EOB_ACT_LAST_MATCH:
1853 yy_c_buf_p =
1854 &yy_current_buffer->yy_ch_buf[yy_n_chars];
1855
1856 yy_current_state = yy_get_previous_state();
1857
1858 yy_cp = yy_c_buf_p;
1859 yy_bp = yytext_ptr + YY_MORE_ADJ;
1860 goto yy_find_action;
1861 }
1862 break;
1863 }
1864
1865 default:
1866 YY_FATAL_ERROR(
1867 "fatal flex scanner internal error--no action found" );
1868 } /* end of action switch */
1869 } /* end of scanning one token */
1870 } /* end of yylex */
1871
1872
1873/* yy_get_next_buffer - try to read in a new buffer
1874 *
1875 * Returns a code representing an action:
1876 * EOB_ACT_LAST_MATCH -
1877 * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
1878 * EOB_ACT_END_OF_FILE - end of file
1879 */
1880
1881static int yy_get_next_buffer()
1882 {
1883 register char *dest = yy_current_buffer->yy_ch_buf;
1884 register char *source = yytext_ptr;
1885 register int number_to_move, i;
1886 int ret_val;
1887
1888 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
1889 YY_FATAL_ERROR(
1890 "fatal flex scanner internal error--end of buffer missed" );
1891
1892 if ( yy_current_buffer->yy_fill_buffer == 0 )
1893 { /* Don't try to fill the buffer, so this is an EOF. */
1894 if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
1895 {
1896 /* We matched a single character, the EOB, so
1897 * treat this as a final EOF.
1898 */
1899 return EOB_ACT_END_OF_FILE;
1900 }
1901
1902 else
1903 {
1904 /* We matched some text prior to the EOB, first
1905 * process it.
1906 */
1907 return EOB_ACT_LAST_MATCH;
1908 }
1909 }
1910
1911 /* Try to read more data. */
1912
1913 /* First move last chars to start of buffer. */
1914 number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
1915
1916 for ( i = 0; i < number_to_move; ++i )
1917 *(dest++) = *(source++);
1918
1919 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
1920 /* don't do the read, it's not guaranteed to return an EOF,
1921 * just force an EOF
1922 */
1923 yy_current_buffer->yy_n_chars = yy_n_chars = 0;
1924
1925 else
1926 {
1927 int num_to_read =
1928 yy_current_buffer->yy_buf_size - number_to_move - 1;
1929
1930 while ( num_to_read <= 0 )
1931 { /* Not enough room in the buffer - grow it. */
1932#ifdef YY_USES_REJECT
1933 YY_FATAL_ERROR(
1934"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
1935#else
1936
1937 /* just a shorter name for the current buffer */
1938 YY_BUFFER_STATE b = yy_current_buffer;
1939
1940 int yy_c_buf_p_offset =
1941 (int) (yy_c_buf_p - b->yy_ch_buf);
1942
1943 if ( b->yy_is_our_buffer )
1944 {
1945 int new_size = b->yy_buf_size * 2;
1946
1947 if ( new_size <= 0 )
1948 b->yy_buf_size += b->yy_buf_size / 8;
1949 else
1950 b->yy_buf_size *= 2;
1951
1952 b->yy_ch_buf = (char *)
1953 /* Include room in for 2 EOB chars. */
1954 yy_flex_realloc( (void *) b->yy_ch_buf,
1955 b->yy_buf_size + 2 );
1956 }
1957 else
1958 /* Can't grow it, we don't own it. */
1959 b->yy_ch_buf = 0;
1960
1961 if ( ! b->yy_ch_buf )
1962 YY_FATAL_ERROR(
1963 "fatal error - scanner input buffer overflow" );
1964
1965 yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
1966
1967 num_to_read = yy_current_buffer->yy_buf_size -
1968 number_to_move - 1;
1969#endif
1970 }
1971
1972 if ( num_to_read > YY_READ_BUF_SIZE )
1973 num_to_read = YY_READ_BUF_SIZE;
1974
1975 /* Read in more data. */
1976 YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
1977 yy_n_chars, num_to_read );
1978
1979 yy_current_buffer->yy_n_chars = yy_n_chars;
1980 }
1981
1982 if ( yy_n_chars == 0 )
1983 {
1984 if ( number_to_move == YY_MORE_ADJ )
1985 {
1986 ret_val = EOB_ACT_END_OF_FILE;
1987 yyrestart( yyin );
1988 }
1989
1990 else
1991 {
1992 ret_val = EOB_ACT_LAST_MATCH;
1993 yy_current_buffer->yy_buffer_status =
1994 YY_BUFFER_EOF_PENDING;
1995 }
1996 }
1997
1998 else
1999 ret_val = EOB_ACT_CONTINUE_SCAN;
2000
2001 yy_n_chars += number_to_move;
2002 yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
2003 yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
2004
2005 yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
2006
2007 return ret_val;
2008 }
2009
2010
2011/* yy_get_previous_state - get the state just before the EOB char was reached */
2012
2013static yy_state_type yy_get_previous_state()
2014 {
2015 register yy_state_type yy_current_state;
2016 register char *yy_cp;
2017
2018 yy_current_state = yy_start;
2019 yy_state_ptr = yy_state_buf;
2020 *yy_state_ptr++ = yy_current_state;
2021
2022 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
2023 {
2024 register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
2025 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
2026 {
2027 yy_current_state = (int) yy_def[yy_current_state];
2028 if ( yy_current_state >= 506 )
2029 yy_c = yy_meta[(unsigned int) yy_c];
2030 }
2031 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
2032 *yy_state_ptr++ = yy_current_state;
2033 }
2034
2035 return yy_current_state;
2036 }
2037
2038
2039/* yy_try_NUL_trans - try to make a transition on the NUL character
2040 *
2041 * synopsis
2042 * next_state = yy_try_NUL_trans( current_state );
2043 */
2044
2045#ifdef YY_USE_PROTOS
2046static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
2047#else
2048static yy_state_type yy_try_NUL_trans( yy_current_state )
2049yy_state_type yy_current_state;
2050#endif
2051 {
2052 register int yy_is_jam;
2053
2054 register YY_CHAR yy_c = 1;
2055 while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
2056 {
2057 yy_current_state = (int) yy_def[yy_current_state];
2058 if ( yy_current_state >= 506 )
2059 yy_c = yy_meta[(unsigned int) yy_c];
2060 }
2061 yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
2062 yy_is_jam = (yy_current_state == 505);
2063 if ( ! yy_is_jam )
2064 *yy_state_ptr++ = yy_current_state;
2065
2066 return yy_is_jam ? 0 : yy_current_state;
2067 }
2068
2069
2070#ifndef YY_NO_UNPUT
2071#ifdef YY_USE_PROTOS
2072static inline void yyunput( int c, register char *yy_bp )
2073#else
2074static inline void yyunput( c, yy_bp )
2075int c;
2076register char *yy_bp;
2077#endif
2078 {
2079 register char *yy_cp = yy_c_buf_p;
2080
2081 /* undo effects of setting up yytext */
2082 *yy_cp = yy_hold_char;
2083
2084 if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
2085 { /* need to shift things up to make room */
2086 /* +2 for EOB chars. */
2087 register int number_to_move = yy_n_chars + 2;
2088 register char *dest = &yy_current_buffer->yy_ch_buf[
2089 yy_current_buffer->yy_buf_size + 2];
2090 register char *source =
2091 &yy_current_buffer->yy_ch_buf[number_to_move];
2092
2093 while ( source > yy_current_buffer->yy_ch_buf )
2094 *--dest = *--source;
2095
2096 yy_cp += (int) (dest - source);
2097 yy_bp += (int) (dest - source);
2098 yy_current_buffer->yy_n_chars =
2099 yy_n_chars = yy_current_buffer->yy_buf_size;
2100
2101 if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
2102 YY_FATAL_ERROR( "flex scanner push-back overflow" );
2103 }
2104
2105 *--yy_cp = (char) c;
2106
2107 if ( c == '\n' )
2108 --yylineno;
2109
2110 yytext_ptr = yy_bp;
2111 yy_hold_char = *yy_cp;
2112 yy_c_buf_p = yy_cp;
2113 }
2114#endif /* ifndef YY_NO_UNPUT */
2115
2116
2117#ifndef YY_NO_INPUT
2118#ifdef __cplusplus
2119static int yyinput()
2120#else
2121static int input()
2122#endif
2123 {
2124 int c;
2125
2126 *yy_c_buf_p = yy_hold_char;
2127
2128 if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
2129 {
2130 /* yy_c_buf_p now points to the character we want to return.
2131 * If this occurs *before* the EOB characters, then it's a
2132 * valid NUL; if not, then we've hit the end of the buffer.
2133 */
2134 if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
2135 /* This was really a NUL. */
2136 *yy_c_buf_p = '\0';
2137
2138 else
2139 { /* need more input */
2140 int offset = yy_c_buf_p - yytext_ptr;
2141 ++yy_c_buf_p;
2142
2143 switch ( yy_get_next_buffer() )
2144 {
2145 case EOB_ACT_LAST_MATCH:
2146 /* This happens because yy_g_n_b()
2147 * sees that we've accumulated a
2148 * token and flags that we need to
2149 * try matching the token before
2150 * proceeding. But for input(),
2151 * there's no matching to consider.
2152 * So convert the EOB_ACT_LAST_MATCH
2153 * to EOB_ACT_END_OF_FILE.
2154 */
2155
2156 /* Reset buffer status. */
2157 yyrestart( yyin );
2158
2159 /* fall through */
2160
2161 case EOB_ACT_END_OF_FILE:
2162 {
2163 if ( yywrap() )
2164 return EOF;
2165
2166 if ( ! yy_did_buffer_switch_on_eof )
2167 YY_NEW_FILE;
2168#ifdef __cplusplus
2169 return yyinput();
2170#else
2171 return input();
2172#endif
2173 }
2174
2175 case EOB_ACT_CONTINUE_SCAN:
2176 yy_c_buf_p = yytext_ptr + offset;
2177 break;
2178 }
2179 }
2180 }
2181
2182 c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
2183 *yy_c_buf_p = '\0'; /* preserve yytext */
2184 yy_hold_char = *++yy_c_buf_p;
2185
2186 if ( c == '\n' )
2187 ++yylineno;
2188
2189 return c;
2190 }
2191#endif /* YY_NO_INPUT */
2192
2193#ifdef YY_USE_PROTOS
2194void yyrestart( FILE *input_file )
2195#else
2196void yyrestart( input_file )
2197FILE *input_file;
2198#endif
2199 {
2200 if ( ! yy_current_buffer )
2201 yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
2202
2203 yy_init_buffer( yy_current_buffer, input_file );
2204 yy_load_buffer_state();
2205 }
2206
2207
2208#ifdef YY_USE_PROTOS
2209void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
2210#else
2211void yy_switch_to_buffer( new_buffer )
2212YY_BUFFER_STATE new_buffer;
2213#endif
2214 {
2215 if ( yy_current_buffer == new_buffer )
2216 return;
2217
2218 if ( yy_current_buffer )
2219 {
2220 /* Flush out information for old buffer. */
2221 *yy_c_buf_p = yy_hold_char;
2222 yy_current_buffer->yy_buf_pos = yy_c_buf_p;
2223 yy_current_buffer->yy_n_chars = yy_n_chars;
2224 }
2225
2226 yy_current_buffer = new_buffer;
2227 yy_load_buffer_state();
2228
2229 /* We don't actually know whether we did this switch during
2230 * EOF (yywrap()) processing, but the only time this flag
2231 * is looked at is after yywrap() is called, so it's safe
2232 * to go ahead and always set it.
2233 */
2234 yy_did_buffer_switch_on_eof = 1;
2235 }
2236
2237
2238#ifdef YY_USE_PROTOS
2239void yy_load_buffer_state( void )
2240#else
2241void yy_load_buffer_state()
2242#endif
2243 {
2244 yy_n_chars = yy_current_buffer->yy_n_chars;
2245 yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
2246 yyin = yy_current_buffer->yy_input_file;
2247 yy_hold_char = *yy_c_buf_p;
2248 }
2249
2250
2251#ifdef YY_USE_PROTOS
2252YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
2253#else
2254YY_BUFFER_STATE yy_create_buffer( file, size )
2255FILE *file;
2256int size;
2257#endif
2258 {
2259 YY_BUFFER_STATE b;
2260
2261 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
2262 if ( ! b )
2263 YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
2264
2265 b->yy_buf_size = size;
2266
2267 /* yy_ch_buf has to be 2 characters longer than the size given because
2268 * we need to put in 2 end-of-buffer characters.
2269 */
2270 b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
2271 if ( ! b->yy_ch_buf )
2272 YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
2273
2274 b->yy_is_our_buffer = 1;
2275
2276 yy_init_buffer( b, file );
2277
2278 return b;
2279 }
2280
2281
2282#ifdef YY_USE_PROTOS
2283void yy_delete_buffer( YY_BUFFER_STATE b )
2284#else
2285void yy_delete_buffer( b )
2286YY_BUFFER_STATE b;
2287#endif
2288 {
2289 if ( ! b )
2290 return;
2291
2292 if ( b == yy_current_buffer )
2293 yy_current_buffer = (YY_BUFFER_STATE) 0;
2294
2295 if ( b->yy_is_our_buffer )
2296 yy_flex_free( (void *) b->yy_ch_buf );
2297
2298 yy_flex_free( (void *) b );
2299 }
2300
2301
2302
2303#ifdef YY_USE_PROTOS
2304void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
2305#else
2306void yy_init_buffer( b, file )
2307YY_BUFFER_STATE b;
2308FILE *file;
2309#endif
2310
2311
2312 {
2313 yy_flush_buffer( b );
2314
2315 b->yy_input_file = file;
2316 b->yy_fill_buffer = 1;
2317
2318#if YY_ALWAYS_INTERACTIVE
2319 b->yy_is_interactive = 1;
2320#else
2321#if YY_NEVER_INTERACTIVE
2322 b->yy_is_interactive = 0;
2323#else
2324 b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
2325#endif
2326#endif
2327 }
2328
2329
2330#ifdef YY_USE_PROTOS
2331void yy_flush_buffer( YY_BUFFER_STATE b )
2332#else
2333void yy_flush_buffer( b )
2334YY_BUFFER_STATE b;
2335#endif
2336
2337 {
2338 if ( ! b )
2339 return;
2340
2341 b->yy_n_chars = 0;
2342
2343 /* We always need two end-of-buffer characters. The first causes
2344 * a transition to the end-of-buffer state. The second causes
2345 * a jam in that state.
2346 */
2347 b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
2348 b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
2349
2350 b->yy_buf_pos = &b->yy_ch_buf[0];
2351
2352 b->yy_at_bol = 1;
2353 b->yy_buffer_status = YY_BUFFER_NEW;
2354
2355 if ( b == yy_current_buffer )
2356 yy_load_buffer_state();
2357 }
2358
2359
2360#ifndef YY_NO_SCAN_BUFFER
2361#ifdef YY_USE_PROTOS
2362YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
2363#else
2364YY_BUFFER_STATE yy_scan_buffer( base, size )
2365char *base;
2366yy_size_t size;
2367#endif
2368 {
2369 YY_BUFFER_STATE b;
2370
2371 if ( size < 2 ||
2372 base[size-2] != YY_END_OF_BUFFER_CHAR ||
2373 base[size-1] != YY_END_OF_BUFFER_CHAR )
2374 /* They forgot to leave room for the EOB's. */
2375 return 0;
2376
2377 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
2378 if ( ! b )
2379 YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
2380
2381 b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
2382 b->yy_buf_pos = b->yy_ch_buf = base;
2383 b->yy_is_our_buffer = 0;
2384 b->yy_input_file = 0;
2385 b->yy_n_chars = b->yy_buf_size;
2386 b->yy_is_interactive = 0;
2387 b->yy_at_bol = 1;
2388 b->yy_fill_buffer = 0;
2389 b->yy_buffer_status = YY_BUFFER_NEW;
2390
2391 yy_switch_to_buffer( b );
2392
2393 return b;
2394 }
2395#endif
2396
2397
2398#ifndef YY_NO_SCAN_STRING
2399#ifdef YY_USE_PROTOS
2400YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
2401#else
2402YY_BUFFER_STATE yy_scan_string( yy_str )
2403yyconst char *yy_str;
2404#endif
2405 {
2406 int len;
2407 for ( len = 0; yy_str[len]; ++len )
2408 ;
2409
2410 return yy_scan_bytes( yy_str, len );
2411 }
2412#endif
2413
2414
2415#ifndef YY_NO_SCAN_BYTES
2416#ifdef YY_USE_PROTOS
2417YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
2418#else
2419YY_BUFFER_STATE yy_scan_bytes( bytes, len )
2420yyconst char *bytes;
2421int len;
2422#endif
2423 {
2424 YY_BUFFER_STATE b;
2425 char *buf;
2426 yy_size_t n;
2427 int i;
2428
2429 /* Get memory for full buffer, including space for trailing EOB's. */
2430 n = len + 2;
2431 buf = (char *) yy_flex_alloc( n );
2432 if ( ! buf )
2433 YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
2434
2435 for ( i = 0; i < len; ++i )
2436 buf[i] = bytes[i];
2437
2438 buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
2439
2440 b = yy_scan_buffer( buf, n );
2441 if ( ! b )
2442 YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
2443
2444 /* It's okay to grow etc. this buffer, and we should throw it
2445 * away when we're done.
2446 */
2447 b->yy_is_our_buffer = 1;
2448
2449 return b;
2450 }
2451#endif
2452
2453
2454#ifndef YY_NO_PUSH_STATE
2455#ifdef YY_USE_PROTOS
2456static void yy_push_state( int new_state )
2457#else
2458static void yy_push_state( new_state )
2459int new_state;
2460#endif
2461 {
2462 if ( yy_start_stack_ptr >= yy_start_stack_depth )
2463 {
2464 yy_size_t new_size;
2465
2466 yy_start_stack_depth += YY_START_STACK_INCR;
2467 new_size = yy_start_stack_depth * sizeof( int );
2468
2469 if ( ! yy_start_stack )
2470 yy_start_stack = (int *) yy_flex_alloc( new_size );
2471
2472 else
2473 yy_start_stack = (int *) yy_flex_realloc(
2474 (void *) yy_start_stack, new_size );
2475
2476 if ( ! yy_start_stack )
2477 YY_FATAL_ERROR(
2478 "out of memory expanding start-condition stack" );
2479 }
2480
2481 yy_start_stack[yy_start_stack_ptr++] = YY_START;
2482
2483 BEGIN(new_state);
2484 }
2485#endif
2486
2487
2488#ifndef YY_NO_POP_STATE
2489static void yy_pop_state()
2490 {
2491 if ( --yy_start_stack_ptr < 0 )
2492 YY_FATAL_ERROR( "start-condition stack underflow" );
2493
2494 BEGIN(yy_start_stack[yy_start_stack_ptr]);
2495 }
2496#endif
2497
2498
2499#ifndef YY_NO_TOP_STATE
2500static int yy_top_state()
2501 {
2502 return yy_start_stack[yy_start_stack_ptr - 1];
2503 }
2504#endif
2505
2506#ifndef YY_EXIT_FAILURE
2507#define YY_EXIT_FAILURE 2
2508#endif
2509
2510#ifdef YY_USE_PROTOS
2511static void yy_fatal_error( yyconst char msg[] )
2512#else
2513static void yy_fatal_error( msg )
2514char msg[];
2515#endif
2516 {
2517 (void) fprintf( stderr, "%s\n", msg );
2518 exit( YY_EXIT_FAILURE );
2519 }
2520
2521
2522
2523/* Redefine yyless() so it works in section 3 code. */
2524
2525#undef yyless
2526#define yyless(n) \
2527 do \
2528 { \
2529 /* Undo effects of setting up yytext. */ \
2530 yytext[yyleng] = yy_hold_char; \
2531 yy_c_buf_p = yytext + n; \
2532 yy_hold_char = *yy_c_buf_p; \
2533 *yy_c_buf_p = '\0'; \
2534 yyleng = n; \
2535 } \
2536 while ( 0 )
2537
2538
2539/* Internal utility routines. */
2540
2541#ifndef yytext_ptr
2542#ifdef YY_USE_PROTOS
2543static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
2544#else
2545static void yy_flex_strncpy( s1, s2, n )
2546char *s1;
2547yyconst char *s2;
2548int n;
2549#endif
2550 {
2551 register int i;
2552 for ( i = 0; i < n; ++i )
2553 s1[i] = s2[i];
2554 }
2555#endif
2556
2557#ifdef YY_NEED_STRLEN
2558#ifdef YY_USE_PROTOS
2559static int yy_flex_strlen( yyconst char *s )
2560#else
2561static int yy_flex_strlen( s )
2562yyconst char *s;
2563#endif
2564 {
2565 register int n;
2566 for ( n = 0; s[n]; ++n )
2567 ;
2568
2569 return n;
2570 }
2571#endif
2572
2573
2574#ifdef YY_USE_PROTOS
2575static void *yy_flex_alloc( yy_size_t size )
2576#else
2577static void *yy_flex_alloc( size )
2578yy_size_t size;
2579#endif
2580 {
2581 return (void *) malloc( size );
2582 }
2583
2584#ifdef YY_USE_PROTOS
2585static inline void *yy_flex_realloc( void *ptr, yy_size_t size )
2586#else
2587static inline void *yy_flex_realloc( ptr, size )
2588void *ptr;
2589yy_size_t size;
2590#endif
2591 {
2592 /* The cast to (char *) in the following accommodates both
2593 * implementations that use char* generic pointers, and those
2594 * that use void* generic pointers. It works with the latter
2595 * because both ANSI C and C++ allow castless assignment from
2596 * any pointer type to void*, and deal with argument conversions
2597 * as though doing an assignment.
2598 */
2599 return (void *) realloc( (char *) ptr, size );
2600 }
2601
2602#ifdef YY_USE_PROTOS
2603static void yy_flex_free( void *ptr )
2604#else
2605static void yy_flex_free( ptr )
2606void *ptr;
2607#endif
2608 {
2609 free( ptr );
2610 }
2611
2612#if YY_MAIN
2613int main()
2614 {
2615 yylex();
2616 return 0;
2617 }
2618#endif
Reid Spencer96839be2006-11-30 16:50:26 +00002619#line 236 "/proj/llvm/llvm-4/tools/llvm-upgrade/UpgradeLexer.l"
Reid Spencere7c3c602006-11-30 06:36:44 +00002620