ootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-live.h & (%d): Already Coalesced. [map: %d, %d] : Unable to perform partition union. : Success -> %d : Fail due to conflict Conflict graph: After sorting: Coalesce List: <-> (%1d), Sorted Coalesce list: Must coalesce with the root variable Abnormal coalesce: Unable to coalesce ssa_names %d and %d which are marked as MUST COALESCE. and Coalesce list: coalesce_ssa_namecreate_outofssa_var_mapphi_nodesabnormal_corruptbb_stmt_liststmt_annadd_coalescefind_coalesce_pairnew_live_tracklive_on_exitbasevar_indexsort_coalesce_listvar_anncoalesce_partitionsei_nextei_containerssa_conflicts_mergedelete_coalesce_list copy-of chain: [UNDEFINED][COPY][NOT A COPY] Argument #%d: PHI node Telling the propagator to add SSA edges out of this PHI and continue.add SSA edges out of this PHI and never visit again.do nothing with SSA edges and keep iterating./usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-copy.cTrying to determine truth value of Conditional will always take edge %d->%d No interesting values produced. copypropbb_stmt_liststmt_annphi_nodesmerge_alias_infovar_ann/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-copyrename.cTry : (P%d) & (P%d) : Already coalesced. : Abnormal PHI barrier. No coalesce. : Same root, coalesced --> P%d. : 2 different PARM_DECLS. No coalesce. : One root a RESULT_DECL. No coalesce. : 2 different USER vars. No coalesce. : 2 memory tags. No coalesce. : 2 default defs. No coalesce. : Incompatible types. No coalesce. : 2 different aliasing sets. No coalesce. --> P%d Coalesced bb_stmt_listphi_nodescopy_rename_partition_coalescevar_ann/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-dce.cMarking useful stmt: Processing worklist: processing: Eliminating unnecessary statements: Deleting : Deleting LHS of call: Removed %d of %d statements (%d%%) Removed %d of %d PHI nodes (%d%%) dceloopcddcefind_control_dependencesingle_succ_edgefind_pdomphi_nodesbb_stmt_listmark_stmt_if_obviously_necessarystmt_annmark_stmt_necessarymark_control_dependent_edges_necessaryei_nextei_containermark_operand_necessaryremove_dead_stmt/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-dom.c Replacing '' with %s '' Original statement: Updated statement: Flagged to clear EH edges. Optimizing statement Replaced ' Folded to: Replaced redundant expr '' with ' Optimizing block #%d Total number of statements: %6ld Exprs considered for dominator optimizations: %6ld Redundant expressions eliminated: %6ld (%.0f%%) Constants propagated: %6ld Copies propagated: %6ld avail_exprs: domphicprop |  |  e  e  e  e   phi_nodesget_lhs_or_phi_resultget_rhs_or_phi_argpropagate_rhs_into_lhsfirst_imm_use_stmtop_iter_init_phiuseop_iter_init_usestmt_annmove_use_after_headei_nextei_containerbb_stmt_listsingle_succ_edgeavail_expr_eqDeleted LHS of call: Deleted dead store '/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-dse.csdsebb_stmt_liststmt_annphi_nodesdse_optimize_stmtdse_possible_dead_store_pget_kill_of_stmt_lhsop_iter_init_vdef/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-forwprop.cforwpropphipropphi_nodesop_iter_init_phiusefirst_imm_use_stmtop_iter_init_usestmt_annmove_use_after_headei_nextei_containerbb_stmt_listforward_propagate_addr_expr_1combine_cond_expr_condoptimizing double bit test to & T == T with temporary T = (1 << ) | (1 << optimizing bits or bits test to & T != 0 with temporary T = | optimizing two comparisons to ifcombinestmt_annphi_nodesbb_stmt_list Live on entry to BB%d : Live on exit from BB%d : Partition map Partition %d (/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-live.cvar_annfirst_readonly_imm_usestmt_annloe_visit_blocklive_on_entryei_nextei_containerphi_nodesbb_stmt_listremove_unused_scope_block_pchange_partition_varpartition_view_bitmappartition_view_finivar_union/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-loop-ch.cDuplicating header of the loop %d up to edge %d->%d. Duplication failed. copy_loop_headersshould_duplicate_loop_header_psingle_pred_edgebb_stmt_list/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-loop-im.cMoving statement (cost %u) out of loop %d. _RE_IM_I_lsmExecuting store motion of from loop %d Basic block %d (loop %d -- depth %d): reciptmpshifttmp invariant up to level %d, cost %d. bb_stmt_listei_nextstmt_annset_levelgen_lsm_tmp_namefor_each_indexRemoving empty loop %d Loop %d iterates Loop size: %d Estimated size after unrolling: %d Not unrolling loop %d: /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-loop-ivcanon.cUnrolled loop %d completely. Added canonical iv to loop %d, iterations. phi_nodesbb_stmt_liststmt_anntry_unroll_loop_completelyssa name type base step invariant base object is a biv /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-loop-ivopts.c cost %d (complexity %d) candidates invariants (important)candidate %d%s depends on final value replacement incremented before exit test incremented at end original biv Candidate %d is important Candidate %d is related to use %d generic address compare at position related candidates Addition in %s costs %d allowed multipliers:Multiplication by %d in %s costs %d test_varforce_expr_to_var_cost: integer %d symbol %d address %d other %d get_address_cost: min offset %s %d max offset %s %d Address costs: sym + var + cst + rat * index costs %d Use-candidate costs: Use %d: cand cost compl. depends on %d %d %d number of iterations Induction variables: single exit %d -> %d, exit condition Uses: , eliminable is invariant (%d)%s Candidate costs: cand cost %d %d Global costs: target_avail_regs %d target_reg_cost %d target_spill_cost %d regs_used %d cost for size: ivs cost Unable to substitute for ivs, failed. Initial set of candidates: Improved to: Final cost %d (complexity %d) tree_ssa_iv_optimize_loopphi_nodesstmt_annset_ivalloc_ivdetermine_base_objectbb_stmt_listfind_interesting_uses_opei_nextei_containerfind_interesting_uses_addressop_iter_init_phiuseop_iter_init_useadd_derived_ivs_candidatesdetermine_use_iv_costforce_expr_to_var_costproduce_memory_decl_rtlptr_difference_coststmt_after_incrementstmt_after_ip_normal_posset_use_iv_costdetermine_use_iv_cost_conditioniv_periodiv_ca_add_useiv_ca_delta_committry_improve_iv_setrewrite_usesrewrite_userewrite_use_nonlinear_exprrewrite_use_addressget_ref_tagget_subvars_for_varlookup_subvars_for_varvar_annrewrite_use_comparecontains_abnormal_ssa_name_pdump_use/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-loop-manip.cunrinittmptree_transform_and_unroll_loopdetermine_exit_conditionsphi_nodessingle_pred_edgebb_stmt_liststmt_annsingle_succ_edgecheck_loop_closed_ssa_useei_nextei_container(exit)Statement %sprobably is %sexecuted at most (bounded by ) + 1 times in loop %d. Induction variable ( * iteration does not wrap in statement /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-loop-niter.cProved that loop %d iterates %d times using brute force. , + , (no_overflow)]%sAnalyzing # of iterations of loop %d exit condition bounds on difference of bases: result: under assumptions zero if # of iterations , bounded by failed n_of_executions_at_moststmt_annbb_stmt_listarray_at_struct_end_pget_val_fornumber_of_iterations_condsingle_pred_edgeinverseloopinitpcomvectltransckddsccpcunrollparloopsaprefetchloopdonesincostmp/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-math-opts.cdominators for recipbb_stmt_liststmt_annexecute_cse_sincos_1first_imm_use_stmtop_iter_init_phiuseop_iter_init_usemove_use_after_headphi_nodesexecute_cse_reciprocals_1first_readonly_imm_useinsert_bb/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-operands.c : --> no uses. single use. %d uses. ***end of stmt iterator marker*** Immediate_uses: STMT MODIFIED. - <%p> IMM ERROR : (use_p : tree - %p:%p)NOTE: no flow-sensitive alias info for Original clobbered vars: %d Static write clobbers avoided: %d Static read clobbers avoided: %d Unescapable clobbers avoided: %d Original read-only clobbers: %d Static read-only clobbers avoided: %d stmt_anndiscard_stmt_changespop_stmt_changesdump_immediate_uses_forfirst_readonly_imm_useverify_imm_linksadd_to_addressable_setget_subvars_for_varlookup_subvars_for_varvar_annstart_ssa_stmt_operandsget_asm_expr_operandsgimple_call_clobbered_varsgimple_addressable_varsadd_stmt_operandadd_virtual_operandgimple_aliases_computed_pgimple_global_varmemory_partitionget_expr_operandsadd_call_clobber_opsget_addr_dereference_operandsfinalize_ssa_defsfinalize_ssa_vdefsvop_free_bucket_indexfinalize_ssa_vuse_opsupdate_stmt_operandsfini_ssa_operandsinit_ssa_operandsCOND_EXPR in block %d and PHI in block %d converted to straightline code. /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-phiopt.ccstorephiopttree_ssa_phiopt_workerbb_stmt_listsingle_pred_edgevar_annphi_nodesconditional_replacementstmt_annsingle_succ_edgeminmax_replacementblocks_in_phiopt_order/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-pre.c%s[%d] := { SCCVN says value numbers to Starting iteration %d ANTIC_OUTANTIC_INBlock %d was deferred for a future iteration. compute_antic required %d iterations PA_OUTPA_INcompute_partial_antic required %d iterations pretmpInserted in predecessor %d Found partial redundancy for expression Skipping insertion of phi for partial redundancy: Looks like an induction variable prephitmpCreated phi in block %d Found fully redundant value Removing unnecessary insertion:Bitmap setsBinary tree nodesUnary tree nodesReference tree nodesComparison tree nodesGIMPLE_MODIFY_STMT nodesstoretmpexp_gentmp_genavail_outinsert required %d iterations Replaced Removed EH side effects. Insertions: %d PA inserted: %d New PHIs: %d Eliminated: %d Constified: %d VH.%04du"u"u"u"Ct"r"Ds"r"u"zs"v"g""""o";"";""U"""ș""ș""ޘ"bb_stmt_liststmt_annvar_annpoolify_treebitmap_insert_into_setget_value_handlealloc_expression_idget_expression_idphi_nodesget_sccvn_valuecreate_value_expr_fromei_nextei_containersingle_succ_edgephi_translate_1valid_in_setsbitmap_remove_from_setdo_regular_insertioninsert_into_preds_of_blockcreate_expression_by_piecescreate_component_ref_by_piecesfind_or_generate_expressiondo_partial_partial_insertioneliminatemark_operand_necessary/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-propagate.cAdding Destination of edge (%d -> %d) to worklist Simulating statement (from ssa_edges): Simulating block %d Substituing values and folding statements Folded PHI node: Folding predicate Folded statement: into: Constants propagated: %6ld Copies propagated: %6ld Predicates folded: %6ld a"l"h""h"4","4"h"[""`Wq\Wqphi_nodesbb_stmt_listop_iter_init_usestmt_annfirst_vdefcfg_blocks_addei_nextei_containercfg_blocks_getfirst_readonly_imm_use/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-reassoc.cBreaking up subtract Linearized: Op %d -> rank: %d, tree: Rank for is %ld swapping operands of is now Merging constants Found & 0, removing all other ops Found & -1, removing Found | -1, removing all other ops Found | 0, removing Found * 0, removing all other ops Found * 1, removing Found [|^+] 0, removing Equivalence: & ~ | ~ -> 0 -> -1 [&|minmax] ^ -> nothing + -Transforming into operand entry poolReassociation stats: Linearized: %d Constants eliminated: %d Ops eliminated: %d Statements rewritten: %d insert_operand_rankbb_stmt_liststmt_annlinearize_expr_treelinearize_exprrewrite_expr_treeVN unary operationsVN binary operationsVN phisVN references/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-sccvn.cSetting value number of Value numbering stmt = RHS simplified to has constants %d No store match Value numbering store Store matched earlier value,value numbering store vdefs to matching vuses. vn_topWARNING: Giving up with SCCVN due to SCC size %u exceeding %u SCC consists of: Processing SCC required %d iterations Value numbers: # # # # #####N####bb_stmt_liststmt_annvisit_useop_iter_init_vdefset_ssa_val_tovn_binary_op_insertvn_unary_op_insertcopy_reference_ops_from_ref/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-sink.cNot moving store, common dominator post-dominates from block. Common dominator of all uses is %d Sinking from bb %d to bb %d Sunk statements:%d ei_nextei_containerfirst_readonly_imm_usestmt_annbb_stmt_listis_hidden_global_storevar_ann/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-structalias.cType safety: Collapsing var %s into %s %s_%u%s.arg%d%s.resultFound location equivalence for node %s Indirect nodeDirect nodeEquivalence classes for %s node id %d:%s are pointer: %d, location:%d %s is a non-pointer variable, eliminating edges. Unifying %s to %s Points to sets created:%d %s = same as %s %s = { no-tbaa-pruning Points-to sets Stats: Total vars: %d Non-pointer vars: %d Statically unified vars: %d Dynamically unified vars: %d Iterations: %d Number of edges: %d Number of implicit edges: %d %s is a non-pointer variable,ignoring constraint:%s.%s%s.%lddoubledereftmpderefaddrtmpConstraint poolVariable info poolANYTHINGREADONLYINTEGERHEAPAccess to zero-sized part of variable,ignoring Access to past the end of variable, ignoring structcopydereftmpGenerating constraints for %s Points-to analysis Constraints: Collapsing static cycles and doing variable substitution: Solving graph PARM_NOALIAS Collapsing static cycles and doing variable substitution Building predecessor graph Detecting pointer and location equivalences Rewriting constraints and unifying variables Uniting pointer but not location equivalent variables Finding indirect cycles P###j#G##с###V~#V~#W1%W<zinsert_vi_for_treeprocess_constraint_1get_constraint_exp_from_ssa_varphi_nodesbb_stmt_listfind_func_aliasesdo_derefdo_structure_copycollapse_rest_of_varvar_annget_constraint_for_component_refref_contains_array_refstmt_anncondense_visitequiv_class_addrewrite_constraintsfindfind_equivalent_nodeuniteunify_nodesmerge_node_constraintsbuild_succ_graphscc_visitdo_complex_constraintintra_create_variable_infosupdate_alias_infogimple_call_clobbered_varsgimple_addressable_varsget_subvars_for_varlookup_subvars_for_varset_uids_in_ptsetshared_bitmap_add Replacing Expressions /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-ter.c replace with --> dump_replaceable_exprsstmt_annfind_replaceable_exprsvar_annbb_stmt_listbb_stmt_listop_iter_init_usestmt_annphi_nodesfirst_readonly_imm_use Threaded jump %d --> %d to %d /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa-threadupdate.c Jumps threaded: %lu thread_through_all_blocksbb_stmt_listei_nextei_containerredirect_edgessingle_succ_edgephi_nodesthread_through_loop_headerbb_stmt_listei_nextei_containerphi_nodesNo longer having address taken %J%qD was declared here%H%qD may be used uninitialized in this function%H%qD is used uninitialized in this function/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssa.cexpected an SSA_NAME objecttype mismatch between an SSA_NAME and its symbolfound an SSA_NAME that had been released into the free poolfound a virtual definition for a GIMPLE registerfound a real definition for a non-registerfound real variable when subvariables should have appearedfound a default name with a non-empty defining statementmissing definitiondefinition in block %i does not dominate use in block %idefinition in block %i follows the useSSA_NAME_OCCURS_IN_ABNORMAL_PHI should be setno immediate_use listwrong immediate use listfor SSA_NAME: in statement: SSA_NAME created in two different blocks %i and %iSSA_NAME_DEF_STMT is wrongExpected definition statement: Actual definition statement: while verifying SSA_NAME in statement AUX pointer initialized for edge %d->%dincoming edge count does not match number of PHI argumentsPHI argument is missing for edge %d->%dPHI argument is not SSA_NAME, or invariantwrong edge %d->%d for PHI argumentPHI argument stmt (%p) marked modified after optimization pass: statement makes a memory store, but has no VDEFSin statementdereferenced pointers should have a name or a symbol tagpointers with a memory tag, should have points-to setspointer escapes but its name tag is not call-clobberedverify_flow_sensitive_alias_info failedvariable in call_clobbered_vars but not marked call_clobberedvariable marked call_clobbered but not in call_clobbered_vars bitmap.verify_call_clobbering failednon-addressable variable inside an alias setverify_flow_insensitive_alias_info failedMemory partitions should have at least one symbolPartitioned symbols should belong to exactly one partitionverify_memory_partitions failedverify_ssa failedfor PHI node addressablesphi_nodesbb_stmt_liststmt_annsingle_succ_edgewalk_use_def_chainsdelete_tree_ssaset_phi_nodesvar_anngimple_aliases_computed_pverify_ssaei_nextei_containerget_subvars_for_varlookup_subvars_for_varmemory_partitiongimple_call_clobbered_varsReleased %i names, %.2f%% /usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-ssanames.crelease_ssarelease_defsstmt_annduplicate_ssa_name_ptr_infomake_ssa_name/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-stdarg.cbb%d will %sbe executed at most once for each va_start in bb%d va_list escapes in %s: va_list escapes %d, needs to save GPR units and FPR units. stdargexecute_optimize_stdargphi_nodesbb_stmt_listreachable_at_most_onceei_nextei_containerstmt_ann/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-tailcall.cadd_accmult_accEliminated tail recursion in bb %d : acc_tmpFound tail call in bb %i tailrtailcgimple_aliases_computed_pvar_annbb_stmt_liststmt_annindependent_of_stmt_psingle_succ_edgesingle_pred_edgephi_nodesset_phi_nodeseliminate_tail_calldecrease_profileadjust_return_valueei_nextei_container/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-vect-analyze.cSetting misalignment to -1.mark for run-time aliasing test between versioning not supported when optimizing for size.versioning not yet supported for outer-loops.=== vect_analyze_scalar_cycles ===Analyze phi: Access function of PHI: Detected induction.Detected reduction.Unknown def-use cycle pattern.vec_stmt_relevant_p: stmt has vdefs.vec_stmt_relevant_p: used out of loop.mark relevant %d, live %d.last stmt in pattern. don't mark relevant/live.already marked relevant/live.=== vect_determine_vectorization_factor =====> examining phi: get vectype for scalar type: not vectorized: unsupported data-type vectype: ==> examining statement: not vectorized: stmt has volatile operandsnot vectorized: irregular stmt.not vectorized: vector stmt in loop:vectorization factor = %dnot vectorized: unsupported data-type=== vect_mark_stmts_to_be_vectorized ===init: phi relevant? init: stmt relevant? worklist: examine stmt: unsupported use of reduction.not vectorized: unsupported use in stmt.def_stmt is out of loop.reduc-stmt defining reduc-phi in the same nest.outer-loop def-stmt defining inner-loop stmt.inner-loop def-stmt defining outer-loop stmt.Detected interleaving versioning for alias required: can't determine dependence between versioning for alias required: bad dist vector for dependence distance = %d.accesses have the same alignment.dependence distance modulo vf == 0 between dependence distance >= VF or negative.not vectorized, possible dependence between data-refs zero step in outer loop.strided access in outer loop.Detected single element interleaving %d not consecutive accessTwo store stmts share the same dr.READ_WRITE dependence in interleaving.not consecutive access in interleavinginterleaved store with gapsinterleaving size is greater than step for step is not a multiple of type size: step size interleaving is not a power of 2Detected interleaving of size %dnot vectorized: unsupported unaligned load.not vectorized: unsupported unaligned store.Vectorizing an unaligned access.Build SLP failed: can't find def for Build SLP failed: two constant oprnds in stmtBuild SLP failed: different types Build SLP failed: illegal type of def Build SLP for Build SLP failed: not MODIFY_STMT Build SLP failed: unsupported data-type SLP failed - multiple types Build SLP failed: no optab.Build SLP failed: op not supported by target.Build SLP failed: different operation in stmt Build SLP failed: different shift arguments in Build SLP failed: strided loads need permutation or have gaps Build SLP failed: unsupported unaligned load Build SLP failed: not strided load Build SLP failed: operation unsupported stmt %d vect_can_advance_ivs_p:virtual phi. skip.reduc phi. skip.No Access function.No evolution.=== vect_enhance_data_refs_alignment ===data size =%ld. misalignment = %d. data size does not divide the misalignment. Unknown misalignment, is_packed = %dvector alignment may not be reachableTry peeling by %dAlignment of access forced using peeling.Peeling for alignment will be applied.Alignment of access forced using versioning.Versioning for alignment will be applied.=== vect_analyze_operations ===/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-vectorizer.hUnsupported loop-closed phi in outer-loop.not vectorized: value used after loop.not vectorized: scalar dependence cycle.not vectorized: relevant phi not supported: irrelevant.not vectorized: relevant stmt not not vectorized: live stmt not not vectorized: the size of group of strided accesses is not a power of 2All the computation can be taken out of the loop.not vectorized: redundant loop. no profit to vectorize.vectorization_factor = %d, niters = %ldnot vectorized: iteration count too small.not vectorized: iteration count smaller than vectorization factor.=== vect_update_slp_costs_according_to_vf ===not vectorized: vectorization not profitable.not vectorized: vector version will never be profitable.not vectorized: iteration count smaller than user specified loop bound parameter or minimum profitable iterations (whichever is more conservative).epilog loop required.not vectorized: can't create epilog loop 1.not vectorized: can't create epilog loop 2.=== vect_analyze_loop_form ===not vectorized: too many BBs in loop.not vectorized: empty loop.not vectorized: multiple nested loops.===== analyze_loop_nest_1 =====bad inner-loop form.not vectorized: Bad inner loop.not vectorized: inner-loop count not invariant.not vectorized: unsupported outerloop form.Considering outer-loop vectorization.not vectorized: multiple exits.not vectorized: too many incoming edges.not vectorized: unexpected loop form.split exit edge.not vectorized: abnormal loop exit edge.=== get_loop_niters =====> get_loop_niters:not vectorized: complicated exit condition.not vectorized: number of iterations cannot be computed.Infinite number of iterations.Symbolic number of iterations is ===== analyze_loop_nest =====outer-loop already vectorized.bad loop form.=== vect_analyze_data_refs === not vectorized: unhandled data-ref not vectorized: data ref analysis failed not vectorized: base addr of dr is a constantnot vectorized: no memory tag for analyze in outer-loop: outer base_address: outer offset from base address: outer constant offset from base address: outer step: outer aligned to: not vectorized: more than one data ref in stmt: not vectorized: no vectype for stmt: scalar_type: bad data references.unexpected pattern.=== vect_analyze_data_refs_alignment ===vect_compute_data_ref_alignment:inner step divides the vector-size.inner step doesn't divide the vector-size.Unknown alignment for access: can't force alignment of ref: force alignmentunexpected misalign valuemisalign = %d bytes of ref not vectorized: can't calculate alignment for data ref.bad data alignment.can't determine vectorization factor.=== vect_analyze_dependences ===bad data dependence.=== vect_analyze_data_ref_accesses ===not vectorized: complicated access pattern.bad data access.=== vect_prune_runtime_alias_test_list ===found equal ranges disable versioning for alias - max number of generated checks exceeded.too long list of versioning for alias run-time tests.=== vect_analyze_slp ===SLP failed.=== vect_make_slp_decision ===Decided to SLP %d instances. Unrolling factor %d=== vect_detect_hybrid_slp ===bad operation or unsupported loop bound.9$R:$9$Y:$Y:$(:$Y:$Y:$:$9:$vect_analyze_data_refsstmt_annvect_analyze_scalar_cycles_1phi_nodesvect_mark_stmts_to_be_vectorizedbb_stmt_listvect_stmt_relevant_pfirst_readonly_imm_usevect_mark_relevantop_iter_init_phiuseop_iter_init_useprocess_usevect_compute_data_ref_alignmentvect_determine_vectorization_factorvect_build_slp_treevect_get_and_check_slp_defsmove_use_after_headvect_enhance_data_refs_alignmentvect_update_misalignment_for_peelvect_analyze_operationsis_loop_header_bb_pvect_analyze_loop_form/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-vect-generic.cveclowerveclower2HWDWLWbb_stmt_listexpand_vector_operations_1build_word_mode_vector_typebuild_replicated_conststmt_ann/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-vect-patterns.cvect_recog_dot_prod_pattern: detected: vect_recog_dot_prod_pattern: not allowed.vect_recog_widen_sum_pattern: detected: vect_recog_widen_sum_pattern: not allowed.vect_recog_widen_mult_pattern: detected: === vect_pattern_recog ===pattern recognized: patt$3$J$$vect_recog_dot_prod_patternstmt_annbb_stmt_listVectorization may not be profitable./usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-vect-transform.cstmp_vect_pvect_batmpbase_offcreated var_vect_model_simple_cost: inside_cost = %d, outside_cost = %d .cost model disabled.cost model: Adding cost of checks for loop versioning to treat misalignment. cost model: Adding cost of checks for loop versioning aliasing. cost model: prologue peel iters set to vf/2.cost model: epilogue peel iters set to vf/2 because peeling for alignment is unknown .cost model: epilogue peel iters set to vf/2 because loop iterations are unknown .cost model: vector iteration cost = %d is divisible by scalar iteration cost = %d by a factor greater than or equal to the vectorization factor = %d .Cost model analysis: Vector inside of loop cost: %d Vector outside of loop cost: %d Scalar iteration cost: %d Scalar outside cost: %d prologue iterations: %d epilogue iterations: %d Calculated minimum iters for profitability: %d Profitability threshold = %d vect_model_load_cost: strided group_size = %d .vect_model_load_cost: aligned.vect_model_load_cost: unaligned supported by hardware.vect_model_load_cost: unaligned software pipelined.vect_model_load_cost: inside_cost = %d, outside_cost = %d .vect_model_store_cost: strided group_size = %d .vect_model_store_cost: inside_cost = %d, outside_cost = %d .=== vect_do_peeling_for_loop_bound ===bndratio_mult_vfvect_update_ivs_after_vectorizer: phi: use not simple.add new stmt: cst_created new init_stmt: vect_get_vec_def_for_operand: def = def_stmt = Create vector_cst. nunits = %dCreate vector_inv.no optab for perm_even.perm_even op not supported by target.no optab for perm_odd.perm_odd op not supported by target.no optab for interleave.interleave op not supported by target.create vector-pointer variable to type: vectorizing a one dimensional array ref: vectorizing a multidimensional array ref: vectorizing a record based array ref: vectorizing a pointer ref: multiple types in nested loop.Aligned load, but unsupported type.vector type does not alias scalar typetransform load.vect_perm_evenvect_perm_oddoperands of different typestransform store. ncopies = %dvect_inter_highvect_inter_lownum. args = %d (not unary/binary op).proceeding using word mode.not worthwhile without SIMD support.operand mode requires invariant argument.=== vectorizable_operation ===transform binary/unary operation.operand 1 using scalar mode.=== vectorizable_assignment ===transform assignment.=== vectorizable_promotion ===transform type promotion operation. ncopies = %d.=== vectorizable_demotion ===transform type demotion operation. ncopies = %d.transform conversion.=== vectorizable_induction ===vect_model_induction_cost: inside_cost = %d, outside_cost = %d .transform induction phi.vec_iv_vector of inductions after inner-loop:transform induction: created def-use cycle:argument types differ.function is not vectorizable.=== vectorizable_call ===transform operation.no optab for reduction.reduc op not supported by target.vect_model_reduction_cost: inside_cost = %d, outside_cost = %d .transform reduction.transform reduction: created def-use cycle:Reduce using direct vector reduction.Reduce using vector shiftsReduce using scalar code. extract scalar resultstmt not supported.Record the vdef for outer-loop vectorization.------>vectorizing SLP node starting from: === vec_transform_loop ===addr2intorptrsandmaskcreate runtime check for data references created %u versioning for alias checks. === vect_do_peeling_for_alignment ===known alignment = %d.niters for prolog loop: prolog_loop_niters=== vect_update_inits_of_dr ===------>vectorizing phi: multiple-types.transform phi.------>vectorizing statement: === scheduling SLP instances ===vectorizing stmts using SLP.transform statement.OUTER LOOP VECTORIZED.$u$ $$D$%%%%%`%%s%%%P%vect_transform_loopvect_loop_versioningvect_create_cond_for_align_checksvect_create_addr_base_for_vector_refvect_get_new_vect_varbb_stmt_listvect_do_peeling_for_alignmentvect_build_loop_nitersvect_gen_niters_for_prolog_loopvect_do_peeling_for_loop_boundvect_generate_tmps_on_preheadervect_update_ivs_after_vectorizerphi_nodesvect_schedule_slp_instancevect_transform_stmtfirst_readonly_imm_usestmt_annvectorizable_conditionvect_create_destination_varvect_get_vec_def_for_operandvect_init_vectorget_initial_def_for_reductionvect_finish_stmt_generationvectorizable_live_operationvectorizable_loadvect_create_data_ref_ptrvar_annvect_setup_realignmentbump_vector_ptrop_iter_init_usevectorizable_storevect_get_slp_vect_defsvect_get_constant_vectorsvect_get_vec_def_for_stmt_copyvectorizable_type_promotionvect_gen_widened_results_halfvectorizable_type_demotionvectorizable_operationvectorizable_inductionget_initial_def_for_inductionvectorizable_assignmentvectorizable_conversionvectorizable_callvectorizable_reductionvect_create_epilog_for_reductionfirst_imm_use_stmtop_iter_init_phiusemove_use_after_headvect_model_load_costcost_for_stmt/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-vectorizer.c %s:%d: note: , init: step unknown.reduction used in loop.reduction: not ssa_name: reduction: no def_stmt.reduction: not commutative/associative: reduction: not binary operation: reduction: uses not ssa_names: reduction: multiple types: operation type: , operands types: reduction: unsafe fp math optimization: reduction: unsafe int math optimization: reduction: unsafe fixed-point math optimization: reduction: no defs for operands: detected reduction:detected reduction: need to swap operands:reduction: unknown pattern.vect_is_simple_use: operand not ssa-name.def_stmt: Unexpected empty stmt.Unsupported pattern.type of def: %d.unsupported defining stmt: get vectype with %d units of type mode not supported by target.Increasing alignment of decl: Unordered widening operation detected.vectorized %u loops in function. prologue_after_cost_adjust loop at %s:%d: tree_duplicate_loop_to_edge_cfg failed. increase_alignmentvect_is_simple_reductionfirst_readonly_imm_usestmt_annis_loop_header_bb_psupportable_narrowing_operationsupportable_widening_operationphi_nodesbb_stmt_listnew_loop_vec_infoslpeel_update_phis_for_duplicate_loopei_nextslpeel_update_phi_nodes_for_guard1set_phi_nodesslpeel_update_phi_nodes_for_guard2single_pred_edgeslpeel_make_loop_iterate_ntimes/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-vn.cCreated value vuses: (!^%y^%y^%!^%,^%^%`^%^%y^%!^%!^%z`%`%`%z`%`%a`%l`%a`%`%z`%z`%vn_lookupvn_addset_value_handlevar_ann/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/tree-vrp.c%Harray subscript is outside array bounds%Harray subscript is above array bounds%Harray subscript is below array bounds%s[-INF(OVF)-INF+INF(OVF)+INF EQUIVALENCES: { } (%u elements)INVALID RANGE: loop information indicates does not overflow Value: Found new range for Visiting conditional with predicate: With known ranges Ignoring predicate evaluation because it assumes that signed overflow is undefined Predicate evaluates to: DON'T KNOW assuming signed overflow does not occur when simplifying conditionalassuming signed overflow does not occur when simplifying conditional to constant%Hassuming signed overflow does not occur when simplifying / or %% to >> or &%Hassuming signed overflow does not occur when simplifying abs (X) to X or -XSimplified relational Assertions to be inserted for BB #%d EDGE %d->%d PREDICATE: ASSERT_EXPRs to be inserted Number of ASSERT_EXPR expressions inserted: %d SSA form after inserting ASSERT_EXPRs Value ranges after VRP: find_assert_locationsphi_nodesop_iter_init_phiusebb_stmt_liststmt_anncompare_values_warnvei_nextei_containerprocess_assert_insertionsprocess_assert_insertions_forbuild_assert_expr_fornonnull_arg_premove_range_assertionsfirst_imm_use_stmtop_iter_init_usemove_use_after_headvrp_meetrange_includes_zero_pextract_range_from_assertextract_range_from_binary_exprextract_range_from_unary_exprvrp_evaluate_conditional_warnvcompare_rangesusable_range_pcompare_range_with_valueset_value_range_to_valueS%S%S%>%%%>%>%>%>%>%>%>%>%>% %Q%%%%$%$%>%>%>%%%?%?%?%%%%%?%%%|%|%|%%%|%%|%|%|%%%%%|%|%|%%%%%%%%%%@%,%%%%%%"%%6%6%6%6%%% %*%y%y%y%y%y%e%y%%Q%%=%G%%z%%%e%[%[%o%J%,%,%,%,%3%,%3%%,%%,%,%,%,%%%T&T&T&T&?&T&?&>&?&&&&&>&?&?&&&K&/&/&/&/&+&/& &"&.&/&.&.&.&g.&.&g.&0&0&0&0&0&0&0&0&D&E&4E&E&4E&4E&4E&D&4E&4E&4E&4E&D&G&F&F&F&F&1H&G&1H&1H&F&G&G&G&G&1H&G&G&Z&Z&Z&Z&[&Z&0[&Z&[&z[&f&7d&jd&d&Je&j&h&Vh&h&;i&k&Tl&k&k&k&k&k&k&k&k&k&*sGMCBؿApF`-D6sG direct call Trying transformations on stmt Mod subtract transformation on insn Div/mod by constant Mod power of 2 transformation on insn xy&y&z&z&z&$z&Vz&~&&&&&&"&tree_register_value_prof_hooksbb_stmt_listtree_stringops_transforminteresting_stringop_to_profile_pei_containerstmt_anntree_find_values_to_profile/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/var-tracking.cStack adjustment: %ld Reg %d:Variables: name: %s D.%u offset %ld attrs_def poolvariable_def poollocation_chain_def poolIN: OUT: vartrack&&&,&&&&&D&s& &&b&m&&&&&<&&stack_adjust_offset_pre_postvariable_htab_freevt_add_function_parametersset_variable_partvariable_was_changedcount_usesei_containerei_nextvariable_uniondataflow_set_different_2vt_emit_notesemit_note_insn_var_location&&&&&&&&&&&&&&&&btnfr"\?&&&&&&&&&&&&&&&!&'''''h''''' '''.'5'E'L'h%'6%'6%'6%'6%'#'#'#'#'#'#'#'#'*$'X$'X$'%'%',',',',',',',',',',',',',',','-'W8&&WWW&k&WWWW&&WKWyW+44Y (Y W1%W<zWWoutput_constant_pool_1output_constant_pool_2place_block_symbolswitch_to_sectiondefault_unique_sectiondefault_elf_select_sectiondefault_no_named_sectiondecode_addr_constmake_decl_one_onlyA1EJultimate_transparent_alias_targetoutput_constantoutput_constructorforce_const_memconst_hash_1build_constant_desccopy_constantassemble_integerassemble_nameassemble_externalassemble_variableinitialize_cold_section_namemake_decl_rtlchange_symbol_block҇GևGڇGއGGGGGGGGG,KKGGFSBAF G G EGget_named_sectionget_section .section %s,"%s" same_sizediscard .linkonce %s .section %s .section %s,"%s"progbitsnobits,@%s,%d,%s,comdat/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/varasm.cLANCHOR.rodata..sdata2..data..data.rel..data.rel.local..data.rel.ro..data.rel.ro.local..sdata..bss..sbss..tdata..tbss..text..gnu.linkonce.b..sbss.gnu.linkonce.sb..tdata.gnu.linkonce.td..tbss.gnu.linkonce.tb..init_array.fini_array.preinit_array .text .data .section .rodata .bssthread-local COMMON data not implemented%q+D aliased to undefined symbol %qs%q+D aliased to external symbol %qs__emutls_v.%+D causes a section type conflict .zero %s%lu .note.GNU-stack.rodata.str%d.%d.dtors.ctors%s.%.5u.rodata.cst%d.data.rel.ro.local.data.rel.ro.data.rel.data.rel.local.sdata.sdata2LCinitializer for integer/fixed-point value is too complicatedinitializer for floating value is not a floating constant%s %s: invalid initial value for member %qs%U%s.globl *. + %ld .set .comm ,%lu,%u .local .%s __emutls_t._unlikely, .-___CTOR_LIST_____DTOR_LIST__alignment of %q+D is greater than maximum object file alignment. Using %dregister name not specified for %q+Dinvalid register name for %q+Ddata type of %q+D isn%'t suitable for a registerregister specified for %q+D isn%'t suitable for data typeglobal register variable has initial valueoptimization may eliminate reads and/or writes to register variablesweak declaration of %q+D must be publicweak declaration of %q+D must precede definitionweak declaration of %q+D after first use results in unspecified behaviorLHOTBLCOLDBLHOTELCOLDE__emutls_object__templ__offset__align__size .weakref weakref %q+D ultimately targets itselfweakref %q+D must have static linkagerequested alignment for %q+D is greater than implemented alignment of %wueaxedxecxebxesiediebpespraxrdxrcxrbxrbprspahdhbh/usr/local/home/bellard/cpux86/rootdisk/buildroot-2011.02/output/toolchain/gcc-4.3.5/gcc/vec.ccalculate_allocation4.3.5(Buildroot 2011.02) Web oldreg=%i newreg=%i Updating insn %i (%i->%i) o'o'o'o'o'o'o'o'o'o'o'o'o'o'o'o'''G'7'P'W'.'.'*'"']']'' 'H'H'H'H']']']'2':']']']''''؊''''''$''''''''' ''޴'''''ƴ'''''''ִ'δ''H'P'X'`'h'p'x'''#'+'3';'C'K'''''#'+'3';'C'K'3';'C'K'#'+'''''''''''''' 'x'~'='a''=''='=''''n'.'g'''''''C'''''s'i'i''}'!'!'!'!'s''}'H'l'\'>'2'k'''''l's'k'I' ']'?'i't''''' ''''W'1''';';'''''1';';''''''''~'~'~'~''''!(!("("(!("(!("(%(%(%(%(%(%(%(%(m.(m.(.(.(d.(.(.(.(H2(H2(2(2(2(X2(c2(2(A(A(A(A(A(A(A(A(A(A(A(A(A(A(A(A(A(A(`W(W(qW(W(`W(ZW(qW(W(`W(ZW(K(g(߬((߬((Ŭ(((((((()((((A(Y((((Y((((Y(((((,(6(J(c(m(w((((@((e(e(e(((e(e(e(e(e(e(e(e(e(e(e(e(e(e(e(T(e(e(e(e(e(C((((e((e(w(e(e(e((e(e( (u((e(((e(e((u(9(e(e(e(e(e(e(e(e(u(#(e(e(W(e(u(e(e(u(e(e(e(e(e(u(e((e(e(e(u(e(u((D(P((b((((((((s((((s(R(a(( (((((((((a(( (((R(R(a(p((((p(((((((( (($(0(((((((((((((((((((((X((((((u(((((X((( ) )))))))))))B)9))X) )X)-)X)!)X)?)))))))#)#)     !"#$!"#$%&'()*+,-./0     !"#$WWWXW1%XW<zforce_align_arg_pointertype_natural_modeix86_setup_incoming_varargsix86_dwarf_handle_frame_unspecei_nextei_containerix86_cc_modes_compatibleix86_address_costMHN HO"HP:HQRHRfH4zHTHVHWHtuHHH#H8HMHbHwH HO H S H R H S H R HX H N 1H[ IH\ aH[ yH\ HYHOHSHRHXHN H[8H\PH[hH\HYH5H3H6H4HHH+H.@H9#UH:$lH;%H&HHJHKHL HMHRHS1HT FHU[HNqHOHVHWHPHQHXHYHm%Hl;HkRHZfH[{H\H]H^H_H`HaHbHc(Hd?HeVHhlHgHjHiHHHHH+HGHI*,j-pxqyrzu}v~ws{t|nf DH YH nH H aH cH eH gH sHO sHS sHR s1HS sHHR s_HX syHN sH[ sH\ sH[ sH\ sHY u HO u HS u7HR uNHX uhHN uH[ uH\ uHY H H oH lH H y1H GH [H pH H H H H  H   H   H  2 H J H b H z H H H H H H!H*!HD!H ^!H/ w!H. #!H !H '!H +!H !H "H "H  6"H! P"H" j"H# "H$ "H% "H( "H' "H* #H) #HG 8#HH T#HI p#HJ #HK #HL #HM #HN #H $H 4$H  O$H- 0 + , 5 6 7 ; < = 8 9 & $j  @ i$HR@p$HW@ $HS@q$HX@ $HT@r$HY%$Hm& %H]' %Hn(9%H^)O%Ho*i%H_+%Hp,%H`-%Hq.%Ha/%Hr0%Hb1&Hs2+&Hc3D&Ht4_&Hd5w&Hu6&He7&Hv:&Hf8&Hw;&Hg9'Hx<'HhU3'HN'H e'H ~'H 'H 'H'H'H'H(H-(HF(HBA+.j/01j2   h          $j$j !  "@'](HU@(u(HV?(HzB(Hj@(H{C(HkA(H|D(HlY[]_acegikmoX)Hrs1)HZG)H^])H ]s)H!Q)H"P)H#_)H$Z)H%^)H&])H'Q*H(P)*H)_ vA*HZ vY*H^ vq*H] v*HQ v*HP v*H_ w*HZ w*H^ w+H] w+HQ w6+HP wO+H_qi+HOq+HWq+HUtuvjv+Hv+Hv+Hv ,Hv(,HvE,H vb,H z,Hz,Hz,Hz,Hz,Hz-H z+-H H-H_-Hv-H-H-H-H-H-H.H.H0.HH.H`.Hx.H.H.H.H.H.H /H#/H>/HX/Hr/H/H /H /H~/H/H/H0H)0H@0HY0Hr0H0H0H0H0H  0H 0H 1H '1H=1HS1Hi1H1H 1H1H1H1H 1H1H2H'2H =2H S2H!i2H"2H-2H.2H,2H+2H*2H) 3H("3H'93H,Q3H+i3H*3H)3H(3H'3H,3H)3H '_4H O_%4H!N_<4H!N_T4H"S_k4H#R_4H$Q_4H%P_4H&Z_4H'__4H'__4H(^_5H)]_+5H*\_D5H+[_]5H,Y_u5H-X`5H0O`5H1N`5H1N`5H2S`5H3R`6H4Q`6H5P`16H6Z`I6H7_`a6H7_`z6H8^`6H9]`6H:\`6H;[`6H<Y`6H=X7H@O'7HAN>7HANV7HBSm7HCR7HDQ7HEP7HFZ7HG_7HG_7HH^8HI]-8HJ\F8HK[_8HLYw8HMX8HPO8HQN8HQN8HRS8HSR9HTQ9HUP39HVZK9HW_c9HW_|9HX^9HY]9HZ\9H[[9H\Y9H]X:HO):HN@:HNX:HSo:HR:HQ:HP:HO:HN:HN:HS;HR(;HQ?;HPV;HOm;HN;HN;HS;HR;HQ;HP;HOHqN>HqN5>HrWM>HsVe>HtU}>HuT>HxO>HyN>HyN>HzW>H{V?H|U&?H}T>?H.X?H/q?HN?HO?H> ?H? ?H^ ?H_  @H$@H>@HX@Hr@Hf@Hn@Hv@H~@H@HAH)AHBAHg\AHovAHwAHix86_expand_builtinix86_expand_vec_init_builtinix86_expand_vec_ext_builtinix86_expand_vec_set_builtinix86_expand_sse_pcmpestrix86_expand_sse_pcmpistrix86_expand_multi_arg_builtinix86_init_mmx_sse_builtinsix86_agi_dependentix86_expand_sse5_multiple_memoryix86_sse5_valid_op_ppredict_jumpoutput_387_reg_moveix86_expand_vector_extractix86_expand_vector_setix86_expand_vector_init_duplicateix86_expand_vector_init_one_nonzeroix86_expand_vector_init_generalx86_emit_floatunsinline_secondary_memory_neededix86_force_to_memoryix86_attr_length_address_defaultix86_attr_length_immediate_defaultmemory_address_lengthassign_386_stack_localconstruct_plt_addressix86_expand_setmemdecide_algdecide_alignmentpromote_duplicated_regexpand_setmem_prologueexpand_set_or_movmem_via_loopscale_counterexpand_setmem_epilogueix86_expand_movmemexpand_movmem_prologueexpand_movmem_epilogueix86_split_long_moveix86_split_to_partsix86_expand_int_addccix86_expand_carry_flag_compareix86_expand_fp_compareix86_fp_comparison_arithmetics_costix86_expand_sse5_packix86_expand_sse5_unpackix86_expand_sse4_unpackix86_expand_sse_unpackix86_expand_int_vcondix86_prepare_sse_fp_compare_argsix86_expand_fp_movccix86_expand_int_movccix86_expand_setccix86_expand_branchix86_expand_compareix86_fp_comparison_codesix86_cc_modeix86_match_ccmodeix86_split_copysign_varix86_build_signbit_maskix86_build_const_vectorix86_expand_unary_operatorix86_expand_binary_operatorix86_fixup_binary_operands_no_copyix86_expand_vector_move_misalignlegitimize_tls_addresslegitimize_pic_addressix86_expand_clearAHAHAHAH BH"BH;BHHSBHHoutput_fp_compareoutput_fix_truncemit_i387_cw_initializationix86_mode_neededoutput_387_binary_opprint_operand_addres