_secondary_reloadscratch_reload_class3PEe( v{\, `"_#W#  _#_#  #  %%#%$$$$$$C%$,-....../.../...//....Q,/..////.//.).--..h..//.Q,z*Q,-+..Q,..Q,Q,Q,Q,Q,Q,-Q,Q,Q,Q,Q,....////C-C-Q,Q,Q,Q,Q,Q,Q,Q,Q,Q,........---------....-------- J+J+JJJ#JJJIIIyK>L7LHK KKKJKKKpxxx|xxxxgxxxxUk߮-K~ei_nextei_containerclear_reload_reg_in_useeliminate_regs_1reloadeliminate_regs_in_insncount_pseudofind_regreloads_conflictspill_failurefinish_spillschoose_reload_regsreload_reg_free_pfailed_reloadmerge_assigned_reloadsemit_input_reload_insnsinc_for_reloadgen_reloaddelete_output_reloaddo_output_reloademit_output_reload_insnsreload_reg_reaches_end_preplace_pseudos_incompute_use_by_pseudos/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/reload1.c Register %d now on stack. Register %d now in %d. could not find a spill register% operand constraint incompatible with operand sizeFailure trying to reload:VOIDmode on an outputoutput operand is constant in % Reloads for insn # %d % operand requires impossible reloadinit_insns for %u: Spilling for insn %d. Using reg %d for reload %d reload failure for reload %d can't find a register in class %qs while reloading %unable to find a register to spill in class %qsthis is the insn:% operand has impossible constraintsframe size too large for reliable stack checkingtry reducing the number of local variablesfoodbrmachunrecognizable insn:insn does not satisfy its constraints:;; Pattern sequences Pattern sequence at insn %d matches sequences at insn %d (length %d);; Iteration %d Best pattern sequence with %d gain is at insn %d (length %d). Matching sequences are atUsing reg %d as link register. seqabstr/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/rtl.cUnKnownexpr_listinsn_listsequencejump_insncall_insncode_labelnotecond_execasm_inputasm_operandsunspec_volatileaddr_vecaddr_diff_vectrap_ifresxconst_intconst_fixedconst_doubleconst_vectorconst_stringscratchstrict_low_partconcatnlabel_refsymbol_refcc0if_then_elsess_multus_multss_divus_divrotateashiftrtlshiftrtrotatertsminsmaxpre_decpre_incpost_decpost_incpre_modifypost_modifysign_extendzero_extendfloat_extendfloat_truncateunsigned_floatunsigned_fixunsigned_fract_convertunsigned_sat_fractbswapsign_extractzero_extractlo_sumvec_mergevec_selectvec_concatvec_duplicatess_plusus_plusss_minusss_negus_negss_absss_ashiftus_ashiftus_minusss_truncateus_truncatevar_locationiuuBieieiuuBieie0iuuBieieeiuu00000iuuB00isiuuB0nissiEEieEee0eeewwwwwwi00s00teiNOTE_INSN_DELETEDNOTE_INSN_DELETED_LABELNOTE_INSN_BLOCK_BEGNOTE_INSN_BLOCK_ENDNOTE_INSN_FUNCTION_BEGNOTE_INSN_PROLOGUE_ENDNOTE_INSN_EPILOGUE_BEGNOTE_INSN_EH_REGION_BEGNOTE_INSN_EH_REGION_ENDNOTE_INSN_VAR_LOCATIONNOTE_INSN_BASIC_BLOCKNOTE_INSN_SWITCH_TEXT_SECTIONSREG_DEP_TRUEREG_DEADREG_INCREG_EQUIVREG_EQUALREG_RETVALREG_LIBCALLREG_NONNEGREG_NO_CONFLICTREG_UNUSEDREG_CC_SETTERREG_CC_USERREG_LABEL_TARGETREG_LABEL_OPERANDREG_DEP_OUTPUTREG_DEP_ANTIREG_BR_PROBREG_VALUE_PROFILEREG_NOALIASREG_BR_PREDREG_FRAME_RELATED_EXPRREG_EH_CONTEXTREG_EH_REGIONREG_SAVE_NOTEREG_NORETURNREG_NON_LOCAL_GOTOREG_CROSSING_JUMPREG_SETJMPjjjjjYjjjjjYY EEEE4 C(DEE)E EEEID$E.EJ;EKETE%"MfG8GDE%CEbEjEoEyEEEEFCR[FDEFEDEJEEEE'DBBCEEECE EC߀DD0EֲCCDuEEE E)E2E7EDD><-<>->sxtzxtsxnzxnfxntrnftrfloat_truncfltufluns_floatufxuns_fixpre post argc:{()?<0x%lx,0x%lx>`L%dconst(high(r%d %4d %scall <...>L%d:i%4d: barrieri%4d %s: %s ݄Yp`IBB&͆V)8ʇ܇$6NdzJVbtxĈ&ֈ{ȉ݉,HXh<Qooĕϕprint_patterntWxW|WWW/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/see.cProperty found for register %d u%i insn %i reg %i NOT RELEVANT RELEVANT USE d%i insn %i reg %i RELEVANT - SIGN_EXTENDED_DEF, source_mode = %s ZERO_EXTENDED_DEF, source_mode = %s EXTENDED_DEF, positive const, source_mode_signed = %s, source_mode_unsigned = %s source_mode_signed = %s Redundant extension deleted: Index %d for: Handling ref: The hashes of the current reference: unmerged_def_se_hash: use_se_hash: Locally redundant extension: Use merge skipped! Original instructions: Use extension not necessary before: Use merge failed! Use merge succeeded! Merged instruction: Following def merge failure a move insn was added after the ref. Original ref: Move insn that was added: Following merge failure the ref was transformed! Transformed ref: Def merge skipped! Def merge failed! Def merge succeeded! Move instruction that was added: Replacing orig reference: With merged reference: Deleting merged def extension: Deleting unmerged def extension: Inserting use extension: * Phase 1: Propagate extensions to uses. * * Phase 2: Merge and eliminate locally redundant extensions. * Handling references for bb %d * Phase 3: Eliminate globally redundant extensions. * * Phase 4: Commit changes to the insn stream. * PRE: end of bb %d, insn %d, inserting expression %d PRE: edge (%d,%d), see_pre_extension_hash: Searching register properties in bb %d /`eq_descriptor_pre_extensionhash_descriptor_pre_extensionsee_analyze_one_defsee_update_defs_relevancysee_handle_relevant_usessee_store_reference_and_extensioneq_descriptor_extensionhash_descriptor_extensionsee_handle_relevant_defssee_update_leader_extra_infosee_set_prop_merged_defsee_seek_pre_extension_exprsee_set_prop_unmerged_defsee_set_prop_unmerged_usesee_print_one_extensionsee_merge_one_use_extensionsee_copy_insnsee_merge_one_def_extensionsee_def_extension_not_mergedsee_analyze_merged_def_local_propsee_analyze_unmerged_def_local_propsee_analyze_use_local_propsee_pre_insert_extensionssee_print_register_propertiessee_print_pre_extension_expr/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/simplify-rtx.cassuming signed overflow does not occur when assuming abs (x) < 0 is falseassuming signed overflow does not occur when assuming abs (x) >= 0 is true !&-92 a>)pp** **" 2jjjx`~****s&Hj7Y  22)):  C'+',\',,u',,'''''',7(7(7(7(7('( ((cBcB B BAEC3D3DC3DBBsimplify_subregsimplify_immed_subregsimplify_ternary_operationsimplify_const_relational_operationcomparison_resultsimplify_const_binary_operationsimplify_binary_operationsimplify_binary_operation_1simplify_plus_minussimplify_const_unary_operation/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/sreal.c((%lu * 2^16 + %lu) * 2^%d)sreal_divsreal_subshift_right/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/stmt.c%Hvalue computed is not usedmissing close brace for named operandundefined named operand %qsduplicate asm operand name %qsinput operand constraint contains %qc%<%%%> constraint used with last operandmatching constraint references invalid operand numberinvalid punctuation %qc in constraintmatching constraint does not allow a registeroutput operand constraint lacks %<=%>output constraint %qc for operand %d is not at the beginningoperand constraint contains incorrectly positioned %<+%> or %<=%>matching constraint not valid in output operandtoo many alternatives in %operand constraints for % differ in number of alternativesunknown register name %qs in %PIC register %qs clobbered in %more than %d operands in %output number %d not directly addressableasm-specifier for variable %qs conflicts with asm clobber listasm operand %d probably doesn%'t match constraintsuse of memory input without lvalue in asm operand %d is deprecatedasm clobber conflict with output operandasm clobber conflict with input operandstruct case_node poolexpand_caseadd_case_nodeemit_case_bit_testsexpand_anon_union_declexpand_declexpand_returnresolve_operand_name_1expand_asm_operandsforce_label_rtxlabel_rtx/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/stor-layout.c offset bitpos aligns: rec = %u, unpack = %u, off = %u remaining in alignment = %u packed may be necessary pending statics: type size can%'t be explicitly evaluatedvariable-size type declared outside of any functionsize of %q+D is %d bytessize of %q+D is larger than %wd bytespadding struct size to alignment boundarypacked attribute is unnecessary for %qspacked attribute is unnecessarypacked attribute is unnecessary for %q+Dpadding struct to align %q+Dalignment of array elements is greater than element sizebit_size_type-jVjȧ/ȧD-AWget_mode_boundsset_sizetypelayout_typeplace_fieldlayout_declint_mode_for_modesmallest_mode_for_sizeput_pending_sizes0123456789W Function call in loop.Computed branch in the loop./usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/targhooks.c__stack_chk_guard__stack_chk_fail__stack_chk_fail_local__builtin_saveregs not supported by this targetWWdefault_secondary_reloaddefault_scalar_mode_supported_pdefault_unwind_emittime in %s: %ld.%06ld (%ld%%) Execution times (seconds) %-22s:%7.2f (%2.0f%%) usr%7.2f (%2.0f%%) sys%7.2f (%2.0f%%) wall%8u kB (%2.0f%%) ggc TOTAL :%7.2f %7.2f %8u kB /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/timevar.ctotal timegarbage collectiondump filescallgraph constructioncallgraph optimizationipa cpipa referenceipa pure constipa type escapeipa points-tocfg constructioncfg cleanupCFG verifiertrivially dead codelife analysislife info updatedf scan insnsdf reaching usesdf reaching defsdf live regsdf live&initialized regsdf uninitialized regs 2df use-def / def-use chainsdf reg dead/unused notesregister scanrebuild jump labelsparsername lookupinline heuristicsintegrationtree gimplifytree ehtree CFG constructiontree CFG cleanuptree VRPtree copy propagationtree store copy proptree find ref. varstree PTAtree alias analysistree call clobberingtree flow sensitive aliastree flow insensitive aliastree memory partitioningtree PHI insertiontree SSA rewritetree SSA othertree SSA incrementaltree operand scandominator optimizationtree SRAtree STORE-CCPtree CCPtree PHI const/copy proptree split crit edgestree reassociationtree PREtree redundant PHIstree FREtree code sinkingtree linearize phistree forward propagatetree conservative DCEtree aggressive DCEtree DSEPHI mergetree loop optimizationtree loop boundstree canonical ivscev constant proptree loop unswitchingcomplete unrollingtree parallelize loopstree vectorizationtree loop lineartree check data dependencestree prefetchingtree iv optimizationpredictive commoningtree loop inittree loop finitree copy headerstree SSA uncproptree SSA to normaltree NRV optimizationtree rename SSA copiestree SSA verifiertree STMT verifiercallgraph verifierdominance frontiersdominance computationcontrol dependencesoverload resolutionvarconstlower subregforward propdead code eliminationdead store elim1dead store elim2loop analysisglobal CSECPROP 1code hoistingCPROP 2LSMbypass jumpsauto inc decCSE 2branch predictionvalue profile optscombinermode switchingsms modulo schedulinglocal allocglobal allocreload CSE regssequence abstractionload CSE after reloadthread pro- & epilogueif-conversion 2peephole 2rename registersscheduling 2machine dep reorgdelay branch schedreorder blocksshorten branchesreg stackfinalsymouttree if-combinerest of compilationtimevar_stoptimevar_starttimevar_pop_1timevar_push_1{Gzt?unrecoverable erroroptions passed: options enabled: created and used with different settings of -fpiccreated and used with different settings of -fpiecreated and used with differing settings of '%s'out of memory4.3.53.0.0-p85.0.1GMPMPFRgetting core file size maximum limit: %msetting core file size limit to maximum: %munrecognized gcc debugging option: %c/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/toplev.cGCC supports only %d input file changes%qD is deprecated (declared at %s:%d)%qs is deprecated (declared at %s:%d)type is deprecated (declared at %s:%d)%qs is deprecatedtype is deprecated%q+F declared % but never defined .file this target does not support %qsgccauxthis target machine does not have delayed branchestarget system does not support the "%s" debug formatvariable tracking requested, but useless unless producing debug infovariable tracking requested, but not supported by this debug formatcan%'t open %s: %m-ffunction-sections not supported for this target-fdata-sections not supported for this target-ffunction-sections disabled; it makes profiling impossible-fprefetch-loop-arrays not supported for this target (try -march switches)-fprefetch-loop-arrays is not supported with -Os-fassociative-math disabled; other options take precedenceunwind tables currently require a frame pointer for correctnessgccdump.scan%'t open %s for writing: %m-frecord-gcc-switches is not supported by the current target(GCC) (GNU) %s"GCC: %s%s" error writing to %s: %merror closing %s: %minvalid option argument %qssalias-max-implicit-fieldsThe maximum number of fields in a structure variable without direct structure accesses that GCC will attempt to track separatelysalias-max-array-elementsThe maximum number of elements in an array for wich we track its elements separatelysra-max-structure-sizeThe maximum structure size (in bytes) for which GCC will use by-element copiessra-max-structure-countThe maximum number of structure fields for which GCC will use by-element copiessra-field-structure-ratioThe threshold ratio between instantiated fields and the total structure sizestruct-reorg-cold-struct-ratioThe threshold ratio between current and hottest structure countsThe maximum number of instructions in a single function eligible for inliningThe maximum number of instructions when automatically inliningmax-inline-insns-recursiveThe maximum number of instructions inline function can grow to via recursive inliningmax-inline-insns-recursive-autoThe maximum number of instructions non-inline function can grow to via recursive inliningmax-inline-recursive-depthThe maximum depth of recursive inlining for inline functionsmax-inline-recursive-depth-autoThe maximum depth of recursive inlining for non-inline functionsmin-inline-recursive-probabilityInline recursively only when the probability of call being executed exceeds the parametermax-variable-expansions-in-unrollerIf -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrollingmin-vect-loop-boundIf -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorizationmax-delay-slot-insn-searchThe maximum number of instructions to consider to fill a delay slotmax-delay-slot-live-searchThe maximum number of instructions to consider to find accurate live register informationmax-pending-list-lengthThe maximum length of scheduling's pending operations listlarge-function-insnsThe size of function body to be considered largelarge-function-growthMaximal growth due to inlining of large function (in percent)large-unit-insnsThe size of translation unit to be considered largeinline-unit-growthhow much can given compilation unit grow because of the inlining (in percent)inline-call-costexpense of call operation relative to ordinary arithmetic operationslarge-stack-frameThe size of stack frame to be considered largelarge-stack-frame-growthMaximal stack frame growth due to inlining (in percent)max-gcse-memoryThe maximum amount of memory to be allocated by GCSEmax-gcse-passesThe maximum number of passes to make when doing GCSEgcse-after-reload-partial-fractionThe threshold ratio for performing partial redundancy elimination after reloadgcse-after-reload-critical-fractionThe threshold ratio of critical edges execution count that permit performing redundancy elimination after reloadmax-unrolled-insnsThe maximum number of instructions to consider to unroll in a loopmax-average-unrolled-insnsThe maximum number of instructions to consider to unroll in a loop on averagemax-unroll-timesThe maximum number of unrollings of a single loopmax-peeled-insnsThe maximum number of insns of a peeled loopmax-peel-timesThe maximum number of peelings of a single loopmax-completely-peeled-insnsThe maximum number of insns of a completely peeled loopmax-completely-peel-timesThe maximum number of peelings of a single loop that is peeled completelymax-once-peeled-insnsThe maximum number of insns of a peeled loop that rolls only oncemax-unswitch-insnsThe maximum number of insns of an unswitched loopmax-unswitch-levelThe maximum number of unswitchings in a single loopmax-iterations-to-trackBound on the number of iterations the brute force # of iterations analysis algorithm evaluatesmax-iterations-computation-costBound on the cost of an expression to compute the number of iterationssms-max-ii-factorA factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loopsms-dfa-historyThe number of cycles the swing modulo scheduler considers when checking conflicts using DFAsms-loop-average-count-thresholdA threshold on the average loop count considered by the swing modulo schedulerhot-bb-count-fractionSelect fraction of the maximal count of repetitions of basic block in program given basic block needs to have to be considered hothot-bb-frequency-fractionSelect fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hotalign-thresholdSelect fraction of the maximal frequency of executions of basic block in function given basic block get alignmentalign-loop-iterationsLoops iterating at least selected number of iterations will get loop alignement.max-predicted-iterationsThe maximum number of loop iterations we predict staticallytracer-dynamic-coverage-feedbackThe percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is availabletracer-dynamic-coverageThe percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not availabletracer-max-code-growthMaximal code growth caused by tail duplication (in percent)tracer-min-branch-ratioStop reverse growth if the reverse probability of best edge is less than this threshold (in percent)tracer-min-branch-probability-feedbackStop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is availabletracer-min-branch-probabilityStop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not availablemax-crossjump-edgesThe maximum number of incoming edges to consider for crossjumpingThe minimum number of matching instructions to consider for crossjumpingmax-grow-copy-bb-insnsThe maximum expansion factor when copying basic blocksmax-goto-duplication-insnsThe maximum number of insns to duplicate when unfactoring computed gotosmax-cse-path-lengthThe maximum length of path considered in csemax-cse-insnsThe maximum instructions CSE process before flushinglim-expensiveThe minimum cost of an expensive expression in the loop invariant motioniv-consider-all-candidates-boundBound on number of candidates below that all candidates are considered in iv optimizationsiv-max-considered-usesBound on number of iv uses in loop optimized in iv optimizationsiv-always-prune-cand-set-boundIf number of candidates in the set is smaller, we always try to remove unused ivs during its optimizationscev-max-expr-sizeBound on size of expressions used in the scalar evolutions analyzeromega-max-varsBound on the number of variables in Omega constraint systemsomega-max-geqsBound on the number of inequalities in Omega constraint systemsomega-max-eqsBound on the number of equalities in Omega constraint systemsomega-max-wild-cardsBound on the number of wild cards in Omega constraint systemsomega-hash-table-sizeBound on the size of the hash table in Omega constraint systemsomega-max-keysBound on the number of keys in Omega constraint systemsomega-eliminate-redundant-constraintsWhen set to 1, use expensive methods to eliminate all redundant constraintsvect-max-version-for-alignment-checksBound on number of runtime checks inserted by the vectorizer's loop versioning for alignment checkvect-max-version-for-alias-checksBound on number of runtime checks inserted by the vectorizer's loop versioning for alias checkmax-cselib-memory-locationsThe maximum memory locations recorded by cselibmax-flow-memory-locationsThe maximum memory locations recorded by flowMinimum heap expansion to trigger garbage collection, as a percentage of the total size of the heapMinimum heap size before we start collecting garbage, in kilobytesmax-reload-search-insnsThe maximum number of instructions to search backward when looking for equivalent reloadThe maximum number of virtual operators that a function is allowed to have before triggering memory partitioning heuristicsThe average number of virtual operators that memory statements are allowed to have before triggering memory partitioning heuristicsmax-sched-region-blocksThe maximum number of blocks in a region to be considered for interblock schedulingmax-sched-region-insnsThe maximum number of insns in a region to be considered for interblock schedulingmin-spec-probThe minimum probability of reaching a source block for interblock speculative schedulingmax-sched-extend-regions-itersThe maximum number of iterations through CFG to extend regionsmax-sched-insn-conflict-delayThe maximum conflict delay for an insn to be considered for speculative motionsched-spec-prob-cutoffThe minimal probability of speculation success (in percents), so that speculative insn will be scheduled.max-last-value-rtlThe maximum number of RTL nodes that can be recorded as combiner's last valueinteger-share-limitThe upper bound for sharing integer constantsmin-virtual-mappingsMinimum number of virtual mappings to consider switching to full virtual renamesvirtual-mappings-ratioRatio between virtual mappings and virtual symbols to do full virtual renamesssp-buffer-sizeThe lower bound for a buffer to be considered for stack smashing protectionmax-jump-thread-duplication-stmtsMaximum number of statements allowed in a block that needs to be duplicated when threading jumpsMaximum number of fields in a structure before pointer analysis treats the structure as a single variablemax-sched-ready-insnsThe maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling passprefetch-latencyThe number of insns executed before prefetch is completedsimultaneous-prefetchesThe number of prefetches that can run at the same timel1-cache-sizeThe size of L1 cachel1-cache-line-sizeThe size of L1 cache linel2-cache-sizeThe size of L2 cacheuse-canonical-typesWhether to use canonical typesmax-partial-antic-lengthMaximum length of partial antic set when performing tree pre optimizationsccvn-max-scc-sizeMaximum size of a SCC before SCCVN stops processing a functiondf-double-queue-threshold-factorMultiplier used for determining the double-queueing thresholdtx{CjEdEE EE\#Fw#F#F$Fg$F~$F$F$F5%FKdO%F%F d%FF >F`>Fn>F>F>F>F&?FU?Fd?F?F?F@F4@F@F @FAF4AFdAFd~AFeGDAFtGDBFSBFdkBFɖEdBFE@CFCF CF0DFdGDFDF(DFEF EF_EF }EFEF(dEFMFF'`FFFFFFFFdGFVGFmGFGFGFHF9HFږEHFIFdIFIFIFIFIF-JF@;JFPJF cJF}JFJFJFJFJFdJF6KF' IKFKFKF%s%sGGC heuristics: --param ggc-min-expand=%d --param ggc-min-heapsize=%d %s%swarning: %s header version %s differs from library version %s. GMP version %s, MPFR version %s. %s%s%s %sversion %s (%s) %s compiled by GNU C version %s, pop_srclocpush_srcloc/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tracer.cTrace seed %i [%i],%i [%i] forward %i [%i]Duplicated %i as %i [%i] covered now %.1f Duplicated %i insns (%i%%) tracertail_duplicatebb_stmt_listei_nextei_container%Jfunction might be possible candidate for attribute %%H% function does return%Hcontrol reaches end of non-void function/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-cfg.c%Hwill never be executed CFG Statistics for %s --------------------------------------------------------- Memory Number of %-30s%-13s%12s used instances Basic blocks%-30s%13d%11lu%c Edges%-30s%13ld%11lu%c Total memory used by CFG data%-43s%11lu%c Coalesced label blocks: %ld (Max so far: %ld) %s bb_%d (preds = {bb_%d }, succs = {}) %s { %s } %sloop_%d (header = %d, latch = %d, niter = , upper_bound = , estimate = %s{ %s (unexpected non-tuplebb_for_stmt (phi) is set to a wrong basic blockmissing PHI defPHI def is not a GIMPLE valueincorrect sharing of tree nodesbb_for_stmt (stmt) is set to a wrong basic blockis not a valid GIMPLE statementstatement marked for throw, but doesn%'tstatement marked for throw in middle of blockverify_stmts failedDead STMT in EH tableSSA name in freelist but still referencedASSERT_EXPR with an always-false conditionGIMPLE register modified with BIT_FIELD_REFinvariant not recomputed when ADDR_EXPR changedconstant not recomputed when ADDR_EXPR changedside effects not recomputed when ADDR_EXPR changedaddress taken, but ADDRESSABLE bit not setnon-integral used in conditioninvalid conditional operandinvalid operand to unary operatorinvalid COMPONENT_REF offset operatorinvalid array indexinvalid array lower boundinvalid array strideinvalid operand to BIT_FIELD_REFinvalid reference prefixinvalid operand to plus/minus, type is a pointerinvalid operand to binary operatorinvalid operand to pointer plus, first operand is not a pointerinvalid operand to pointer plus, second operand is not an integer with type of sizetype.invalid operands to array referencetype mismatch in array referencetype mismatch in array range referencetype mismatch in real/imagpart referencetype mismatch in component referenceinvalid expression for min lvalueinvalid operand in indirect referencetype mismatch in indirect referenceinvalid operand in conversioninvalid types in nop conversioninvalid operand in int to float conversioninvalid types in conversion to floating pointinvalid operand in float to int conversioninvalid types in conversion to integerinvalid operands in complex expressiontype mismatch in complex expressionconstructor not allowed for non-vector typesinvalid operands in shift expressiontype mismatch in shift expressioninvalid (pointer) operands to plus/minusinvalid operands in pointer plus expressiontype mismatch in pointer plus expressioninvalid operands in conditional expressioninvalid operand in unary expressiontype mismatch in address expressioninvalid operands in truth expressiontype mismatch in binary truth expressioninvalid operand in unary nottype mismatch in not expressiontype mismatch in unary expressioninvalid operands in binary expressiontype mismatch in binary expressioninvalid operands in comparison expressiontype mismatch in comparison expressionnon-trivial conversion at assignmentinvalid operand to switch statementtype error in return expressionverify_gimple failedRemoving basic block %d ENTRY_BLOCK has IL associated with itEXIT_BLOCK has IL associated with itfallthru to exit from bb %dnonlocal label is not first in a sequence of labels in bb %d to block does not match in bb %d has incorrect context in bb %dcontrol flow in the middle of basic block %dfallthru edge after a control statement in bb %dtrue/false edge after a non-COND_EXPR in bb %dCOND_EXPR with code in branches at the end of bb %dwrong outgoing edge flags at end of bb %dexplicit goto at end of bb %dreturn edge does not point to exit in bb %dfound default case not at end of case vectorcase labels not sorted: is greater than but comes before it. no default case found at end of case vectorextra outgoing edge %d->%dmissing edge %i->%i;; Function %s ;; %d basic blocks, %d edges, last basic block %d. Merging blocks %d and %d gotovargraph: { title: "%s" node: { title: "ENTRY" label: "ENTRY" } node: { title: "EXIT" label: "EXIT" } edge: { sourcename: "ENTRY" targetname: "%d" linestyle: dotted priority: 10 linestyle: solid priority: 100no-statementnode: { title: "%d" label: "#%d\n%s (%d)\n%s (%d)"} edge: { sourcename: "%d" targetname: "EXIT"edge: { sourcename: "%d" targetname: "%d" priority: 10 linestyle: dotted priority: 100 linestyle: solid} uselesscritedei_nextei_containertree_lv_adjust_loop_header_phiphi_nodesbb_stmt_listsingle_succ_edgeset_phi_nodestree_split_edgereinstall_phi_argsstmt_anntree_merge_blocksfirst_imm_use_stmtop_iter_init_phiuseop_iter_init_usemove_use_after_headset_bb_stmt_listtree_redirect_edge_and_branch_forcetree_redirect_edge_and_branchcreate_bbtree_verify_flow_inforemove_useless_stmts_1make_edgesmake_cond_expr_edgesmove_sese_region_to_fnfind_outermost_region_in_blockmove_block_to_fnreplace_ssa_namereplace_by_duplicate_declnew_label_mappertree_duplicate_sese_tailtree_duplicate_sese_regionadd_phi_args_after_copy_edgeverify_gimple_tuples_1verify_exprverify_gimple_stmtverify_gimple_modify_stmtverify_gimple_exprbsi_insert_on_edge_immediatetree_find_edge_insert_locsingle_pred_edgebsi_for_stmtset_bb_for_stmtis_ctrl_altering_stmtfind_taken_edgefind_taken_edge_cond_exprfind_taken_edge_switch_exprfind_taken_edge_computed_gotoreplace_uses_byphi_arg_index_from_usegroup_case_labelsstart_recording_case_labels/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-cfgcleanup.cmergephibb_stmt_listei_nextei_containersingle_succ_edgephi_nodesstmt_annremove_forwarder_block_with_phiphi_alternatives_equalcleanup_tree_cfg_noloopcleanup_omp_returnsingle_pred_edgecleanup_control_expr_graphremove_forwarder_blockCICR/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-complex.ccplxlowercplxlower01N  ___œ__2ǟpǟp9|ǟbb_stmt_listexpand_complex_operations_1expand_complex_moveei_nextei_containerset_component_ssa_namestmt_annextract_componentfind_lattice_valueexpand_complex_additionexpand_complex_multiplicationexpand_complex_libcallexpand_complex_divisionexpand_complex_comparisonphi_nodesvar_annsingle_succ_edgecomplex_visit_phicomplex_visit_stmt/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-data-ref.c/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/omega.h(dependence classified: (Dependence relation cannot be represented by distance vector.) %3d no dependence * x_%u + - = += +- -= *indepDISTANCE_V (DIRECTION_V (/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-chrec.hsiv test failed: chrec is not positive. siv test failed: chrec not positive. overlap steps test failed: no iteration counts. (analyze_subscript_affine_affine affine-affine test failed: too many variables. affine-affine test failed: unimplemented. (overlaps_a = ) (overlaps_b = (analyze_overlapping_iterations (chrec_a = ) (chrec_b = (analyze_ziv_subscript ziv test failed: difference is non-integer. (analyze_siv_subscript can_use_subscript_aff_aff_for_symbolic siv test failed: unimplemented. (analyze_miv_subscript analyze_miv_subscript test failed: unimplemented. (overlap_iterations_a = ) (overlap_iterations_b = (subscript_dependence_tester (build_classic_dist_vector dist_vector = ( ) analyze_innermost: failed: bit offset alignment. failed: evolution of base is not affine. failed: evolution of offset is not affine. success. Creating dr for base_address: offset from base address: constant offset from base address: step: aligned to: base_object: symbol tag: (subscript iterations_that_access_an_element_twice_in_A: last_conflict: iterations_that_access_an_element_twice_in_B: (Subscript distance: (Data Dep: (don't know) (no dependence) access_fn_A: access_fn_B: inner loop index: %d loop nest: ( distance_vector: direction_vector: (Data Ref: stmt: ref: base_object: Access function %d: (compute_affine_dependence (stmt_a = ) (stmt_b = Banerjee Analyzer Omega Analyzer (Number of distance vectors differ: Banerjee has %d, Omega has %d. Banerjee dist vectors: data dependence relation: (Number of direction vectors differ: Banerjee has %d, Omega has %d.) (Dist vectors from the first dependence analyzer: not found in Omega dist vectors: (Dir vectors from the first dependence analyzer: not found in Omega dir vectors: Data ref a: Data ref b: affine dependence test not usable: access function not affine or constant. FAILED as dr address is invariant Dependence tester statistics: Number of dependence tests: %d Number of dependence tests classified dependent: %d Number of dependence tests classified independent: %d Number of undetermined dependence tests: %d Number of subscript tests: %d Number of undetermined subscript tests: %d Number of same subscript function: %d Number of ziv tests: %d Number of ziv tests returning dependent: %d Number of ziv tests returning independent: %d Number of ziv tests unimplemented: %d Number of siv tests: %d Number of siv tests returning dependent: %d Number of siv tests returning independent: %d Number of siv tests unimplemented: %d Number of miv tests: %d Number of miv tests returning dependent: %d Number of miv tests returning independent: %d Number of miv tests unimplemented: %d )=3GQphi_nodesbb_stmt_listfind_vertex_for_stmtstmt_annfirst_readonly_imm_usefree_dependence_relationsfind_data_references_in_stmtinitialize_data_dependence_relationdr_may_alias_pcompute_affine_dependenceomega_add_zero_eqomega_add_zero_geqconflict_fntree_fold_divides_pbuild_polynomial_chrecinitialize_matrix_Aaffine_fn_univarvar_annget_subvars_for_varlookup_subvars_for_vardr_analyze_innermost/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-dfa.c DFA Statistics for %s Referenced variables%-30s%13lu%11lu%c Statements annotatedVariables annotatedVUSE operandsVDEF operandsPHI nodesTotal memory used by DFA/SSA dataAverage number of arguments per PHI node: %.1f (max: %d) [B]@%lu, UID D.%u, symbol memory tag: , is addressable, is global, is volatile, call clobbered%sstored in global%sgoes through ASM%spassed to call%sbad cast%sreturned from func%spassed to pure/const%sis global var%sis incoming pointer%sunknown escape, NO_ALIAS (does not alias other NO_ALIAS symbols), NO_ALIAS_GLOBAL (does not alias other NO_ALIAS symbols and global vars), NO_ALIAS_ANYTHING (does not alias any other symbols), default def: , may aliases: , sub-vars: , belongs to partition: , partition symbols: , offset: %luYES, base for components: %s, partitionable: %s Referenced variables in %s: %u Variable: bb_stmt_liststmt_annget_ref_base_and_extentvar_annget_virtual_varremove_referenced_varget_subvars_for_varlookup_subvars_for_vargimple_call_clobbered_varsadd_referenced_varset_default_defgimple_default_defreferenced_var_check_and_insertreferenced_var_lookupphi_nodesmemory_partitioncreate_tree_common_anncreate_stmt_anncreate_function_anncreate_var_annignoring unknown option %q.*s in %<-fdump-%s%>.%03d%ccould not open dump file %qs: %s %*s%-4s: %-7s %-13s %-4s: %-7d %-4s: %-8lx %-4s: @%-6u %-16s virtbasesprotpriv/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-dump.cpubaccsbinfop 0op 1mnglorigscpesrcp: %s:%-6d qual: %c%c%c unqlalgnstrglngtpurpvaluchanpreccstsnon-saturatingptdrefdclasretnprmseltsdomnfldsfncscnstargtbposstrg: %-7s %-4s: %s op 2op 3clnplow labl.cgraphipa-cgraph.tutranslation-unit.classclass-hierarchy.originaltree-original.gimpletree-gimple.nestedtree-nested.vcgtree-vcgtree-allrtl-allipa-allslimdetailslinenouidstmtaddrmemsyms4 CcF/DhFwFYF EB@pFwF{FF@_FyAdequeue_and_dump/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-eh.crettmpEH edge %i->%i is missingEH edge %i->%i miss EH flagEH edge %i->%i has duplicated regionsBB %i can not throw but has EH edgesBB %i last statement has incorrectly set regionunnecessary EH edge %i->%ifinally_tmpsave_eptrsave_filtehoptrecord_in_finally_treemaybe_record_in_goto_queuedo_return_redirectionreplace_goto_queue_1find_goto_replacementlower_try_finally_switchverify_eh_edgesstmt_annei_nextei_containeradd_stmt_to_eh_region_fn/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-gimple.crecalculate_side_effectsget_call_expr_in_ifc_not inner most loop less than 2 basic blocks multiple exits /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-if-conv.cIrreducible loop ----------[%d]------------- basic block after exit bb but before latch non empty basic block after exit bb latch is not dominated by exit_block Difficult to handle edges stmt not suitable for ifcvt tree could trap... CALL_EXPR LHS is not var don't know what to do More than two phi node args. Virtual phi not on loop header. Difficult to handle this virtual phi. Applying if-conversion ------if-convert stmt new phi replacement stmt ifcvtget_loop_body_in_if_conv_orderstmt_annphi_nodesei_nextei_containerfirst_readonly_imm_usebb_stmt_listtree_if_convert_stmtcombine_blocksfind_phi_replacement_conditionreplace_phi_with_cond_gimple_modify_stmtset_phi_nodesset_bb_stmt_list/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-into-ssa.cUpdating SSA information for statement Renaming statement Registering new PHI nodes in block #%d Renaming block #%d -> { Current reaching definitions Renaming stack (up to %d levels)Level %d (current level) Level %d Previous CURRDEF (NIL SSA replacement table N_i -> { O_1 ... O_j } means that N_i replaces O_1, ..., O_j Number of virtual NEW -> OLD mappings: %7u Number of real NEW -> OLD mappings: %7u Number of total NEW -> OLD mappings: %7u Number of virtual symbols: %u Symbols to be put in SSA form SSA names to release after updating the SSA web Definition and live-in blocks: VAR: , DEF_BLOCKS: { , LIVEIN_BLOCKS: { , PHI_BLOCKS: { Hash table statistics: def_blocks: repl_tbl: Enabled virtual name mapping heuristic. Number of virtual mappings: %7u Number of unique virtual symbols: %7u Updating FUD-chains from top of CFG will be faster than processing the name mappings. Incremental SSA update started at block: %d Number of blocks in CFG: %d Number of blocks to update: %d (%3.0f%%) Affected blocks: SSA renaming information for %s init_ssa_renamermark_def_sitesstmt_annop_iter_init_usevar_anncompute_idfinsert_phi_nodes_forprune_unused_phi_nodesmark_block_for_updateinitialize_flags_in_bbphi_nodesbb_stmt_listadd_new_name_mappingei_nextei_containerrewrite_blocksrewrite_update_phi_argumentsrewrite_update_stmtop_iter_init_defrewrite_stmtrewrite_initialize_blockupdate_ssamemory_partitionprepare_def_site_formark_def_interestingfirst_readonly_imm_usephi_arg_index_from_useinsert_updated_phi_nodes_forrelease_ssa_name_after_update_ssaget_subvars_for_varlookup_subvars_for_var/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-iterator.cȬWtsi_split_statement_list_beforetsi_split_statement_list_aftertsi_link_aftertsi_link_beforefree_stmt_listalloc_stmt_list/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-nested.cFRAME.FRAME__chainCHAIN__data__builtin_trampoline__nl_goto_bufOOIWconvert_all_function_callscreate_tmp_var_forwalk_omp_forconvert_local_omp_clausesconvert_nonlocal_omp_clauses/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-nrv.cNRV Replaced: with: nrvretslotbb_stmt_listget_subvars_for_varlookup_subvars_for_varvar_anngimple_call_clobbered_varstree_nrvSimplified /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-object-size.cto Found a dependency loop at Visiting use-def links for Need to reexamine maximumminimumComputing %s %sobject size for Reexamining : %s %sobject size %lu objszcompute_object_sizesbb_stmt_liststmt_anncompute_builtin_object_sizeaddr_object_sizealloc_object_sizecheck_for_plus_in_loopscheck_for_plus_in_loops_1collect_object_sizes_forexpr_object_size/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-optimize.csize of return value of %q+D is %u bytessize of return value of %q+D is larger than %wd bytesearly_local_cleanupsearly_optimizationscleanup_cfgfinal_cleanuptree_rest_of_compilationbb_stmt_liststmt_annRemoving Dead PHI definition: /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-outof-ssa.cInserting a copy on edge BB%d->BB%d : Cleaned-up latch block of loop with single BB: %d Opportunities in BB %d for stmt/block reduction: Splitting BB %d for Common stmt list. Original block is now BB%d. Edge (%d->%d) lands here. After Coalescing: partition %d already has variable assigned to it. Partition %d is assigned to var After Base variable replacement: Analyzing Edge Insertions. optimizedphi_nodesbb_stmt_listassign_varscreate_tempgimple_call_clobbered_varsvar_annrewrite_treesstmt_annop_iter_init_defeliminate_phiei_nextei_containeranalyze_edges_for_bbidentical_stmt_lists_p/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-parloops.c%s.$loopfn.paral_data_param.paral_data.paral_data_store.paral_data_load Considering loop %d FAILED: number of iterations not known Detected reduction. reduction stmt is: phi is arg of phi to exit: value used outside loop checking if it a part of reduction pattern: FAILED: it is not a part of reduction. reduction phi is reduction stmt is FAILED: scalar dependency between iterations FAILED: cannot be duplicated SUCCESS: may be parallelized FAILED: data dependencies exist across iterations =<>r<<r>>v<<v>>r+w+w*/[cl]/[fl]/[rd]/[ex]%[cl]%[fl]%[rd] -- ++-- ++ <<< ??? >>>NIL# LOADS: # STORES: # VUSE <# = VDEF <<&%p> <<< error >>>vector {ref-all}::MEM[base: index: offset: __complex__ (\b\f\n\r\t\v\1\2\3\4\5\6\7class {off: BIT_FIELD_REF <{lb: sz: {nt}{v}TARGET_EXPR <if ( else ) ? __builtin_va_arg_pack () [static-chain: [return slot optimization] [tail call]<>><<>><<>>while (1)) breakswitch ( goto case ???: goto ???;resx __volatile__case default OBJ_TYPE_REF( = PHI <(ab)(D)WITH_SIZE_EXPR <VH.%dASSERT_EXPR <, +, }_REALIGN_LOAD < VEC_COND_EXPR < > DOT_PROD_EXPR < [child fn: ???)]for (OMP_SECTIONS_SWITCH#pragma omp section#pragma omp master#pragma omp ordered#pragma omp critical#pragma omp atomic#pragma omp atomic_load#pragma omp atomic_store (OMP_RETURN [nowait]OMP_CONTINUE < <- REDUC_MAX_EXPR < REDUC_MIN_EXPR < REDUC_PLUS_EXPR < VEC_WIDEN_MULT_HI_EXPR < VEC_WIDEN_MULT_LO_EXPR < VEC_UNPACK_HI_EXPR < VEC_UNPACK_LO_EXPR < VEC_UNPACK_FLOAT_HI_EXPR < VEC_UNPACK_FLOAT_LO_EXPR < VEC_PACK_TRUNC_EXPR < VEC_PACK_SAT_EXPR < VEC_PACK_FIX_TRUNC_EXPR < [abstract] [written]SUPERCONTEXT: BLOCK %pSUBBLOCKS: %p VARS: ABSTRACT_ORIGIN: VEC_EXTRACT_EVEN_EXPR < VEC_EXTRACT_ODD_EXPR < VEC_INTERLEAVE_HIGH_EXPR < VEC_INTERLEAVE_LOW_EXPR < goto :# SUCC:typedef __asm__ [value-expr: reduction(if(num_threads(default(/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-pretty-print.cschedule(<<< Unknown tree: >>>        O         IqIǴδմܴ  q  !+cmw{YEYEmdz۳ѳ       w                                                  S ]g5?O'MUʽʽʽʽxʽxʽʽ555ʽOt-444%<uA4W44[4744[#50t~p]9Pg4R;s mmwV$c e0 %.@ei_nextei_containerphi_nodesbb_stmt_liststmt_anndump_omp_clausePROF/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-profile.cPROF_edge_counter__gcov_interval_profiler__gcov_pow2_profiler__gcov_one_value_profiler__gcov_indirect_call_callee__gcov_indirect_call_counters__gcov_indirect_call_profiler__gcov_average_profiler__gcov_ior_profilertree_profileWWWWWWWWWWWtree_gen_const_delta_profilerbb_stmt_listei_nextei_container(classify_chrec affine_univariate affine_multivariate higher_degree_polynomial undetermined ( %d affine univariate chrecs %d affine multivariate chrecs %d degree greater than 2 polynomials %d chrec_dont_know chrecs %d total chrecs %d with undetermined coefficients %d chrecs in the scev database %d sets in the scev database %d gets in the scev database (number_of_iterations_in_loop (set_nb_iterations_in_loop = /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-scalar-evolution.c(add_to_evolution (loop_nb = %d) (chrec_before = ) (to_add = (analyze_initial_condition (loop_phi_node = (init_cond = (analyze_evolution_in_loop (loop_phi_node = (evolution_function = (set_scalar_evolution (scalar = ) (scalar_evolution = (analyze_scalar_evolution (get_scalar_evolution (instantiate_parameters (get_loop_exit_condition %d nb_chrec_dont_know_loops %d nb_static_loops %d nb_total_loops ̭W scev_const_propbb_stmt_listphi_nodesstmt_anninstantiate_parameters_1build_polynomial_chrecadd_to_evolution_1__imag__ __real__ $B%ldF%ld[%ld..%ld][%ld]: n_uses=%u n_copies=%u B%ldD%u/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-sra.cSRInitial instantiation for Scalarization disabled for element-copyblock-copyUsing %s for Cannot scalarize variable because it must live in memory because it is declared volatile because its type cannot be decomposed Scan results: esrasG~GGGbb_stmt_liststmt_anngimple_aliases_computed_pgenerate_one_element_refnext_child_for_groupdecide_block_copytype_can_instantiate_all_elementsinstantiate_missing_elementstry_instantiate_multiple_fields5scalarize_ldstsra_build_elt_assignmentscalarize_initgenerate_element_zeroscalarize_copygenerate_element_copybitfield_overlaps_psra_elt_eqsra_hash_treeei_nextei_containertest_symbol/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-address.cW Wcreate_mem_ref/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-alias.c, name memory tag: , is dereferenced, its value escapes, points-to anything, points-to NULL, points-to vars: Pointed-to sets for pointers in %s Memory partitions #%u: : %lu elements: %u memory partitions holding %lu symbols Alias information for %s Flow-insensitive alias information for %s Aliased symbols Dereferenced pointers Symbol memory tags Flow-sensitive alias information for %s SSA_NAME pointers Name memory tags Variable has no explicit uses in this function, and is > SALIAS_MAX_IMPLICIT_FIELDS, so skipping SFTstructure field tag %s created for var %sSMTNMT number of overlapping subvars = %u MPTread frequency: %6ld, write frequency: %6ld, direct reads: %3ld, direct writes: %3ld, indirect reads: %4ld, indirect writes: %4ld, symbol: , tags: , score: %ld, direct reads: %ld, direct writes: %ld, indirect reads: %ld, indirect writes: %ld Memory partitioning NOT NEEDED for %s Memory partitioning NEEDED for %s Memory symbol references before partitioning: Memory symbol references after partitioning: Memory reference statistics for %s Number of memory statements: %ld Number of call sites: %ld Number of pure/const call sites: %ld Number of asm sites: %ld Estimated number of loads: %ld (%ld/stmt) Actual number of loads: %ld (%ld/stmt) (warning: estimation is lower by more than 25%%) Estimated number of stores: %ld (%ld/stmt) Actual number of stores: %ld (%ld/stmt) NO Partitioning thresholds: MAX = %d AVG = %d (%sNEED TO PARTITION) Number of partitioned symbols: %ld Number of unpartitioned symbols: %ld Mem sym stats.GLOBAL_VAR Alias statistics for %s Total alias queries: %u Total alias mayalias results: %u Total alias noalias results: %u Total simple queries: %u Total simple resolved: %u Total TBAA queries: %u Total TBAA resolved: %u Total non-addressable structure type queries: %u Total non-addressable structure type resolved: %u build_aliasvar_annphi_nodeslookup_subvars_for_vargimple_call_clobbered_varsbb_stmt_liststmt_annget_subvars_for_varnew_type_aliasadd_may_aliasget_ptr_infocount_uses_and_derefsgimple_aliases_computed_pgimple_addressable_varsmemory_partitionget_smt_forcompute_flow_insensitive_aliasingmay_alias_pgimple_global_varcompute_memory_partitionsget_mem_sym_stats_forget_mpt_forestimate_vop_reductionupdate_mem_sym_stats_from_stmt/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-alias-warnings.c{unknown}ref_table_alloc_pool%Hlikely type-punning may break strict-aliasing rules: object %<%s%s%> of main type %qT is referenced at or around %s:%d and may be aliased to object %<%s%s%> of main type %qT which is referenced at or around %s:%d.processed_func_pget_otypevar_annbb_stmt_list/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-ccp.c%sUNINITIALIZED%sUNDEFINED%sVARYING%sCONSTANT Lattice value changed to . Adding SSA edges to worklist. Visiting PHI node: Argument #%d (%d -> %d %sexecutable) PHI node value: Visiting statement: No interesting values produced. Marked VARYING. store_ccpfabexecute_fold_all_builtinsbb_stmt_listccp_fold_builtinoptimize_stack_restoreoptimize_stdarg_builtinstmt_annphi_nodesccp_visit_phi_nodedump_lattice_valueset_lattice_valuefold_stmt_inplacemaybe_fold_stmt_additionwiden_bitfield Corrupt SSA across abnormal edge BB%d->BB%d Argument %d () is not an SSA_NAME. /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-coalesce.c) does not have the same base variable as the result SSA corruption/usr/local/home/bellard/cpux86/r