diff options
Diffstat (limited to 'lib')
50 files changed, 11430 insertions, 0 deletions
diff --git a/lib/Analysis/Makefile b/lib/Analysis/Makefile new file mode 100644 index 0000000000..4b672cd6ff --- /dev/null +++ b/lib/Analysis/Makefile @@ -0,0 +1,7 @@ + +LEVEL = ../.. + +LIBRARYNAME = analysis + +include $(LEVEL)/Makefile.common + diff --git a/lib/Analysis/ModuleAnalyzer.cpp b/lib/Analysis/ModuleAnalyzer.cpp new file mode 100644 index 0000000000..1c3464e48c --- /dev/null +++ b/lib/Analysis/ModuleAnalyzer.cpp @@ -0,0 +1,150 @@ +//===-- llvm/Analysis/ModuleAnalyzer.cpp - Module analysis driver ----------==// +// +// This class provides a nice interface to traverse a module in a predictable +// way. This is used by the AssemblyWriter, BytecodeWriter, and SlotCalculator +// to do analysis of a module. +// +//===----------------------------------------------------------------------===// + +#include "llvm/Analysis/ModuleAnalyzer.h" +#include "llvm/ConstantPool.h" +#include "llvm/Method.h" +#include "llvm/Module.h" +#include "llvm/BasicBlock.h" +#include "llvm/DerivedTypes.h" +#include "llvm/ConstPoolVals.h" +#include <map> + +// processModule - Driver function to call all of my subclasses virtual methods. +// +bool ModuleAnalyzer::processModule(const Module *M) { + // Loop over the constant pool, process all of the constants... + if (processConstPool(M->getConstantPool(), false)) + return true; + + return processMethods(M); +} + +inline bool ModuleAnalyzer::handleType(set<const Type *> &TypeSet, + const Type *T) { + if (!T->isDerivedType()) return false; // Boring boring types... + if (TypeSet.count(T) != 0) return false; // Already found this type... + TypeSet.insert(T); // Add it to the set + + // Recursively process interesting types... + switch (T->getPrimitiveID()) { + case Type::MethodTyID: { + const MethodType *MT = (const MethodType *)T; + if (handleType(TypeSet, MT->getReturnType())) return true; + const MethodType::ParamTypes &Params = MT->getParamTypes(); + + for (MethodType::ParamTypes::const_iterator I = Params.begin(); + I != Params.end(); ++I) + if (handleType(TypeSet, *I)) return true; + break; + } + + case Type::ArrayTyID: + if (handleType(TypeSet, ((const ArrayType *)T)->getElementType())) + return true; + break; + + case Type::StructTyID: { + const StructType *ST = (const StructType*)T; + const StructType::ElementTypes &Elements = ST->getElementTypes(); + for (StructType::ElementTypes::const_iterator I = Elements.begin(); + I != Elements.end(); ++I) + if (handleType(TypeSet, *I)) return true; + break; + } + + case Type::PointerTyID: + if (handleType(TypeSet, ((const PointerType *)T)->getValueType())) + return true; + break; + + default: + cerr << "ModuleAnalyzer::handleType, type unknown: '" + << T->getName() << "'\n"; + break; + } + + return processType(T); +} + + +bool ModuleAnalyzer::processConstPool(const ConstantPool &CP, bool isMethod) { + // TypeSet - Keep track of which types have already been processType'ed. We + // don't want to reprocess the same type more than once. + // + set<const Type *> TypeSet; + + for (ConstantPool::plane_const_iterator PI = CP.begin(); + PI != CP.end(); ++PI) { + const ConstantPool::PlaneType &Plane = **PI; + if (Plane.empty()) continue; // Skip empty type planes... + + if (processConstPoolPlane(CP, Plane, isMethod)) return true; + + for (ConstantPool::PlaneType::const_iterator CI = Plane.begin(); + CI != Plane.end(); CI++) { + if ((*CI)->getType() == Type::TypeTy) + if (handleType(TypeSet, ((const ConstPoolType*)(*CI))->getValue())) + return true; + if (handleType(TypeSet, (*CI)->getType())) return true; + + if (processConstant(*CI)) return true; + } + } + + if (!isMethod) { + assert(CP.getParent()->getValueType() == Value::ModuleVal); + const Module *M = (const Module*)CP.getParent(); + // Process the method types after the constant pool... + for (Module::MethodListType::const_iterator I = M->getMethodList().begin(); + I != M->getMethodList().end(); I++) { + if (handleType(TypeSet, (*I)->getType())) return true; + if (visitMethod(*I)) return true; + } + } + return false; +} + +bool ModuleAnalyzer::processMethods(const Module *M) { + for (Module::MethodListType::const_iterator I = M->getMethodList().begin(); + I != M->getMethodList().end(); I++) + if (processMethod(*I)) return true; + + return false; +} + +bool ModuleAnalyzer::processMethod(const Method *M) { + // Loop over the arguments, processing them... + const Method::ArgumentListType &ArgList = M->getArgumentList(); + for (Method::ArgumentListType::const_iterator AI = ArgList.begin(); + AI != ArgList.end(); AI++) + if (processMethodArgument(*AI)) return true; + + // Loop over the constant pool, adding the constants to the table... + processConstPool(M->getConstantPool(), true); + + // Loop over all the basic blocks, in order... + Method::BasicBlocksType::const_iterator BBI = M->getBasicBlocks().begin(); + for (; BBI != M->getBasicBlocks().end(); BBI++) + if (processBasicBlock(*BBI)) return true; + return false; +} + +bool ModuleAnalyzer::processBasicBlock(const BasicBlock *BB) { + // Process all of the instructions in the basic block + BasicBlock::InstListType::const_iterator Inst = BB->getInstList().begin(); + for (; Inst != BB->getInstList().end(); Inst++) { + if (preProcessInstruction(*Inst) || processInstruction(*Inst)) return true; + } + return false; +} + +bool ModuleAnalyzer::preProcessInstruction(const Instruction *I) { + + return false; +} diff --git a/lib/AsmParser/Lexer.cpp b/lib/AsmParser/Lexer.cpp new file mode 100644 index 0000000000..9edd3bf5b1 --- /dev/null +++ b/lib/AsmParser/Lexer.cpp @@ -0,0 +1,2058 @@ +#define yy_create_buffer llvmAsm_create_buffer +#define yy_delete_buffer llvmAsm_delete_buffer +#define yy_scan_buffer llvmAsm_scan_buffer +#define yy_scan_string llvmAsm_scan_string +#define yy_scan_bytes llvmAsm_scan_bytes +#define yy_flex_debug llvmAsm_flex_debug +#define yy_init_buffer llvmAsm_init_buffer +#define yy_flush_buffer llvmAsm_flush_buffer +#define yy_load_buffer_state llvmAsm_load_buffer_state +#define yy_switch_to_buffer llvmAsm_switch_to_buffer +#define yyin llvmAsmin +#define yyleng llvmAsmleng +#define yylex llvmAsmlex +#define yyout llvmAsmout +#define yyrestart llvmAsmrestart +#define yytext llvmAsmtext +#define yylineno llvmAsmlineno + +#line 20 "Lexer.cpp" +/* A lexical scanner generated by flex */ + +/* Scanner skeleton version: + * $Header$ + */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 + +#include <stdio.h> + + +/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ +#ifdef c_plusplus +#ifndef __cplusplus +#define __cplusplus +#endif +#endif + + +#ifdef __cplusplus + +#include <stdlib.h> +#include <unistd.h> + +/* Use prototypes in function declarations. */ +#define YY_USE_PROTOS + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +#if __STDC__ + +#define YY_USE_PROTOS +#define YY_USE_CONST + +#endif /* __STDC__ */ +#endif /* ! __cplusplus */ + +#ifdef __TURBOC__ + #pragma warn -rch + #pragma warn -use +#include <io.h> +#include <stdlib.h> +#define YY_USE_CONST +#define YY_USE_PROTOS +#endif + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#endif + + +#ifdef YY_USE_PROTOS +#define YY_PROTO(proto) proto +#else +#define YY_PROTO(proto) () +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an unsigned + * integer for use as an array index. If the signed char is negative, + * we want to instead treat it as an 8-bit unsigned char, hence the + * double cast. + */ +#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN yy_start = 1 + 2 * + +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START ((yy_start - 1) / 2) +#define YYSTATE YY_START + +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) + +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE yyrestart( yyin ) + +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#define YY_BUF_SIZE 16384 + +typedef struct yy_buffer_state *YY_BUFFER_STATE; + +extern int yyleng; +extern FILE *yyin, *yyout; + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + +/* The funky do-while in the following #define is used to turn the definition + * int a single C statement (which needs a semi-colon terminator). This + * avoids problems with code like: + * + * if ( condition_holds ) + * yyless( 5 ); + * else + * do_something_else(); + * + * Prior to using the do-while the compiler would get upset at the + * "else" because it interpreted the "if" statement as being all + * done when it reached the ';' after the yyless() call. + */ + +/* Return all but the first 'n' matched characters back to the input stream. */ + +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + *yy_cp = yy_hold_char; \ + YY_RESTORE_YY_MORE_OFFSET \ + yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) + +#define unput(c) yyunput( c, yytext_ptr ) + +/* The following is because we cannot portably get our hands on size_t + * (without autoconf's help, which isn't available because we want + * flex-generated scanners to compile on their own). + */ +typedef unsigned int yy_size_t; + + +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + yy_size_t yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + int yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via yyrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + }; + +static YY_BUFFER_STATE yy_current_buffer = 0; + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + */ +#define YY_CURRENT_BUFFER yy_current_buffer + + +/* yy_hold_char holds the character lost when yytext is formed. */ +static char yy_hold_char; + +static int yy_n_chars; /* number of characters read into yy_ch_buf */ + + +int yyleng; + +/* Points to current character in buffer. */ +static char *yy_c_buf_p = (char *) 0; +static int yy_init = 1; /* whether we need to initialize */ +static int yy_start = 0; /* start state number */ + +/* Flag which is used to allow yywrap()'s to do buffer switches + * instead of setting up a fresh yyin. A bit of a hack ... + */ +static int yy_did_buffer_switch_on_eof; + +void yyrestart YY_PROTO(( FILE *input_file )); + +void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); +void yy_load_buffer_state YY_PROTO(( void )); +YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); +void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); +void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); +void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); +#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer ) + +YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size )); +YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str )); +YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len )); + +static void *yy_flex_alloc YY_PROTO(( yy_size_t )); +static inline void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )); +static void yy_flex_free YY_PROTO(( void * )); + +#define yy_new_buffer yy_create_buffer + +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! yy_current_buffer ) \ + yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ + yy_current_buffer->yy_is_interactive = is_interactive; \ + } + +#define yy_set_bol(at_bol) \ + { \ + if ( ! yy_current_buffer ) \ + yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ + yy_current_buffer->yy_at_bol = at_bol; \ + } + +#define YY_AT_BOL() (yy_current_buffer->yy_at_bol) + + +#define YY_USES_REJECT + +#define yywrap() 1 +#define YY_SKIP_YYWRAP +typedef unsigned char YY_CHAR; +FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; +typedef int yy_state_type; +extern int yylineno; +int yylineno = 1; +extern char *yytext; +#define yytext_ptr yytext + +static yy_state_type yy_get_previous_state YY_PROTO(( void )); +static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); +static int yy_get_next_buffer YY_PROTO(( void )); +static void yy_fatal_error YY_PROTO(( yyconst char msg[] )); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + yytext_ptr = yy_bp; \ + yyleng = (int) (yy_cp - yy_bp); \ + yy_hold_char = *yy_cp; \ + *yy_cp = '\0'; \ + yy_c_buf_p = yy_cp; + +#define YY_NUM_RULES 58 +#define YY_END_OF_BUFFER 59 +static yyconst short int yy_acclist[113] = + { 0, + 59, 57, 58, 56, 57, 58, 56, 58, 57, 58, + 57, 58, 57, 58, 8, 57, 58, 52, 57, 58, + 1, 57, 58, 57, 58, 57, 58, 57, 58, 57, + 58, 57, 58, 57, 58, 57, 58, 57, 58, 57, + 58, 57, 58, 57, 58, 57, 58, 57, 58, 57, + 58, 57, 58, 57, 58, 57, 58, 50, 49, 54, + 53, 52, 1, 9, 40, 51, 49, 55, 28, 31, + 3, 16, 30, 24, 25, 26, 32, 39, 29, 11, + 27, 44, 45, 18, 4, 22, 17, 10, 2, 5, + 20, 23, 12, 34, 38, 36, 37, 35, 33, 14, + + 46, 13, 19, 43, 21, 42, 41, 15, 6, 47, + 48, 7 + } ; + +static yyconst short int yy_accept[199] = + { 0, + 1, 1, 1, 2, 4, 7, 9, 11, 13, 15, + 18, 21, 24, 26, 28, 30, 32, 34, 36, 38, + 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, + 58, 58, 59, 60, 60, 61, 62, 63, 64, 64, + 64, 65, 65, 65, 66, 66, 66, 66, 66, 66, + 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, + 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, + 66, 66, 66, 66, 66, 66, 66, 66, 67, 68, + 69, 70, 70, 70, 70, 70, 70, 71, 71, 72, + 72, 72, 72, 72, 72, 73, 73, 73, 73, 73, + + 74, 75, 76, 77, 77, 78, 79, 79, 79, 79, + 79, 80, 80, 80, 80, 80, 80, 80, 80, 80, + 80, 80, 81, 82, 82, 82, 82, 82, 83, 83, + 83, 83, 84, 85, 85, 85, 85, 85, 85, 85, + 85, 85, 85, 85, 86, 87, 87, 88, 88, 88, + 89, 89, 90, 90, 90, 91, 92, 92, 92, 93, + 93, 93, 94, 95, 96, 97, 98, 99, 100, 101, + 102, 102, 103, 104, 104, 105, 105, 106, 106, 106, + 107, 107, 108, 109, 110, 110, 110, 110, 111, 111, + 112, 112, 112, 112, 112, 112, 113, 113 + + } ; + +static yyconst int yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 1, 4, 1, 5, 6, 1, 1, 1, + 1, 1, 1, 1, 7, 5, 1, 8, 8, 8, + 8, 8, 8, 8, 8, 8, 8, 9, 10, 1, + 1, 1, 1, 1, 5, 5, 5, 5, 5, 5, + 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, + 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, + 1, 1, 1, 1, 5, 1, 11, 12, 13, 14, + + 15, 16, 17, 18, 19, 5, 5, 20, 21, 22, + 23, 24, 25, 26, 27, 28, 29, 30, 31, 5, + 32, 5, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static yyconst int yy_meta[33] = + { 0, + 1, 1, 2, 3, 4, 1, 5, 4, 6, 1, + 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, + 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, + 4, 4 + } ; + +static yyconst short int yy_base[203] = + { 0, + 0, 0, 389, 390, 390, 390, 0, 379, 26, 379, + 27, 0, 28, 40, 29, 35, 34, 42, 30, 38, + 56, 60, 55, 63, 65, 84, 68, 107, 52, 382, + 376, 390, 0, 376, 375, 374, 74, 0, 32, 64, + 372, 78, 67, 371, 77, 92, 76, 79, 89, 98, + 100, 95, 102, 105, 108, 112, 111, 119, 122, 123, + 116, 126, 128, 129, 132, 134, 137, 138, 139, 140, + 143, 144, 145, 149, 146, 156, 154, 390, 0, 371, + 369, 157, 166, 158, 161, 167, 368, 170, 367, 174, + 175, 179, 180, 182, 366, 183, 181, 188, 184, 365, + + 364, 363, 362, 190, 361, 360, 191, 211, 198, 199, + 359, 194, 200, 201, 202, 204, 205, 212, 203, 225, + 214, 358, 357, 228, 209, 231, 232, 356, 233, 234, + 235, 355, 354, 236, 238, 239, 241, 247, 249, 252, + 242, 254, 259, 353, 352, 256, 351, 264, 265, 350, + 267, 349, 270, 271, 348, 347, 273, 274, 346, 276, + 275, 345, 344, 343, 342, 341, 340, 335, 330, 325, + 283, 320, 319, 278, 317, 284, 316, 285, 288, 315, + 289, 313, 311, 310, 293, 291, 301, 308, 295, 244, + 303, 299, 302, 307, 309, 82, 390, 331, 334, 337, + + 342, 53 + } ; + +static yyconst short int yy_def[203] = + { 0, + 197, 1, 197, 197, 197, 197, 198, 199, 200, 197, + 199, 201, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 198, + 199, 197, 202, 197, 197, 197, 199, 201, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 197, 202, 197, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, + 199, 199, 199, 199, 199, 199, 0, 197, 197, 197, + + 197, 197 + } ; + +static yyconst short int yy_nxt[423] = + { 0, + 4, 5, 6, 7, 8, 9, 10, 11, 4, 12, + 13, 14, 15, 16, 17, 18, 19, 8, 20, 21, + 22, 23, 8, 24, 8, 25, 26, 27, 28, 29, + 8, 8, 34, 35, 37, 32, 32, 32, 32, 45, + 32, 39, 32, 32, 53, 81, 32, 40, 32, 46, + 32, 41, 50, 47, 42, 49, 79, 48, 54, 55, + 32, 51, 43, 32, 32, 44, 56, 52, 32, 60, + 58, 32, 32, 32, 77, 32, 32, 61, 57, 64, + 62, 37, 32, 82, 32, 32, 32, 32, 59, 84, + 32, 63, 32, 71, 83, 65, 85, 32, 66, 72, + + 32, 67, 89, 32, 86, 87, 32, 88, 32, 92, + 32, 68, 69, 32, 70, 32, 32, 90, 73, 32, + 32, 97, 91, 96, 32, 74, 75, 32, 94, 93, + 32, 32, 98, 76, 32, 95, 32, 32, 99, 101, + 32, 100, 32, 102, 103, 32, 32, 32, 32, 105, + 111, 32, 32, 32, 32, 104, 106, 32, 112, 109, + 110, 108, 32, 107, 32, 32, 32, 114, 117, 32, + 116, 113, 119, 118, 32, 32, 115, 122, 32, 120, + 123, 125, 32, 32, 121, 127, 124, 32, 32, 32, + 32, 32, 32, 128, 132, 129, 32, 131, 32, 32, + + 126, 130, 32, 134, 133, 135, 32, 32, 32, 32, + 32, 32, 32, 32, 144, 145, 150, 32, 136, 32, + 32, 143, 32, 141, 142, 137, 148, 138, 154, 146, + 139, 147, 140, 32, 149, 152, 32, 151, 153, 32, |