Home | History | Annotate | Download | only in bin

Lines Matching refs:renaming

3990        objcopy --strip-dwo 	 %{c:%{o*:%*}%{!o*:%b%O}}%{!c:%U%O}     }%{G*} %(endian_spec) %{mips1} %{mips2} %{mips3} %{mips4} %{mips32*} %{mips64*} %{mips16} %{mno-mips16:-no-mips16} %{mmicromips} %{mno-micromips} %{mips3d} %{mno-mips3d:-no-mips3d} %{mdmx} %{mno-mdmx:-no-mdmx} %{mdsp} %{mno-dsp} %{mdspr2} %{mno-dspr2} %{mdspr3} %{mno-dspr3} %{mmcu} %{mno-mcu} %{meva} %{mno-eva} %{mvirt} %{mno-virt} %{mxpa} %{mno-xpa} %{mmsa} %{mno-msa} %{msmartmips} %{mno-smartmips} %{mmt} %{mno-mt} %{mmxu} %{mno-mxu} %{mfix-rm7000} %{mno-fix-rm7000} %{mfix-vr4120} %{mfix-vr4130} %{mfix-24k} %{noasmopt:-O0; O0|fno-delayed-branch:-O1; O*:-O2; :-O1} %(subtarget_asm_debugging_spec) %{mabi=*} %{!mabi=*: %(asm_abi_default_spec)} %{mgp32} %{mgp64} %{march=*} %{mxgot:-xgot} %{mfp32} %{mfpxx} %{mfp64} %{mnan=*} %{modd-spreg} %{mno-odd-spreg} %{mshared} %{mno-shared} %{msym32} %{mno-sym32} %{mtune=*} %{mhard-float} %{msoft-float} %{msingle-float} %{mdouble-float} %(subtarget_asm_spec)%{static:--start-group} %G %L %{static:--end-group}%{!static:%G}%{mno-android|tno-android-cc:;:%{!fexceptions:%{!fno-exceptions: -fexceptions}} %{!frtti:%{!fno-rtti: -frtti}}}%{G*} %{EB:-meb} %{EL:-mel} %{EB:%{EL:%emay not use both -EB and -EL}} %(subtarget_cc1_spec)%{!g0:%{gstabs*:--gstabs}%{!gstabs*:%{g*:--gdwarf2}}} %{fdebug-prefix-map=*:--debug-prefix-map %*}/tmp/4caf2245b7f513cbd9fbe060a482b8e8/sysrootmabi=32 mips32/mips32r2/mips32r6/mips64r6/tmp/4caf2245b7f513cbd9fbe060a482b8e8/usr/local/google/buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/params.cminimum value of parameter %qs is %umaximum value of parameter %qs is %uMaximal estimated outcome of branch considered predictableThe minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-isnsns-autoThe maximum number of instructions in a single function eligible for inliningThe maximum number of instructions when automatically inliningThe maximum size growth when inlining functions without inline declared in plain modeThe 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 inliningThe 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 parameterSize estimate of function overhead (prologue/epilogue) for inlining purposesConsider cold callsites for inlining if caller contains hot codeMaximum profile-based code size footprint estimate for hot caller heuristic  Only consider cold callsites for inlining if analysis estimates downstream optimization opportunitiesThe maximum number of nested indirect inlining performed by early inlinerProbability that COMDAT function will be shared with different compilation unitpartial-inlining-entry-probabilityMaximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happenmax-variable-expansions-in-unrollerIf -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrollingIf -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorizationThe maximum number of instructions to consider to fill a delay slotThe maximum number of instructions to consider to find accurate live register informationThe maximum length of scheduling's pending operations listThe maximum number of backtrack attempts the scheduler should make when modulo scheduling a loopThe size of function body to be considered largeMaximal growth due to inlining of large function (in percent)The size of translation unit to be considered largeHow much can given compilation unit grow because of the inlining (in percent)How much can given compilation unit grow because of the interprocedural constant propagation (in percent)Maximal estimated growth of function body caused by early inlining of single callEarly inline calls if growth does not exceed this limitEarly inline calls to comdate functions if growth does not exceed this limitThe size of stack frame to be considered largeMaximal stack frame growth due to inlining (in percent)The maximum amount of memory to be allocated by GCSEThe maximum ratio of insertions to deletions of expressions in 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 reloadScaling factor in calculation of maximum distance an expression can be moved by GCSE optimizationsCost at which GCSE optimizations will not constraint the distance an expression can travelMaximum depth of search in the dominator tree for expressions to hoistThe maximum number of instructions to consider to unroll in a loopThe maximum number of instructions to consider to unroll in a loop on averageThe maximum number of unrollings of a single loopThe maximum number of insns of a peeled loopThe maximum number of peelings of a single loopThe maximum number of branches on the path through the peeled sequenceThe maximum number of insns of a completely peeled loopmax-default-completely-peeled-insnsThe maximum number of peelings of a single loop that is peeled completelyThe maximum number of insns of a peeled loop that rolls only oncemax-completely-peel-loop-nest-depthThe maximum depth of a loop nest we completely peelMaximum profile-based code size footprint estimate for loop unrolling and peelingMaximum ratio of total profiled execution count to loop entry block count under which most codesize limits for unrolling and peeling will be ignoredMinimum iteration count to ignore branch effects when unrollingunroll-outer-loop-branch-budgetMaximum number of branches allowed in hot outer loop region after unrollThe maximum number of insns of an unswitched loopThe maximum number of unswitchings in a single loopBound 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 iterationsA factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loopThe minimum value of stage count that swing modulo scheduler will generate.The 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 schedulerA basic block profile count is considered hot if it contributes to the given permillage of the entire profiled executionSelect fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hotThe minimum fraction of profile runs a given basic block execution count must be not to be considered unlikelySelect fraction of the maximal frequency of executions of basic block in function given basic block get alignmentLoops iterating at least selected number of iterations will get loop alignement.For loop small enough, try to align them more strictly.The maximum number of loop iterations we predict staticallymax-autofdo-max-propagate-iterationsThe maximum number of AutoFDO profile propagation iterationsSet the estimated probability in percentage for builtin expect. The default value is 90% probability.tracer-dynamic-coverage-feedbackThe percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is availableThe percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not availableMaximal code growth caused by tail duplication (in percent)Stop 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 availableStop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not availableThe maximum number of incoming edges to consider for crossjumpingThe minimum number of matching instructions to consider for crossjumpingThe maximum expansion factor when copying basic blocksThe maximum number of insns to duplicate when unfactoring computed gotosThe maximum length of path considered in cseThe maximum instructions CSE process before flushingThe 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 optimizationsBound 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 optimizationBound on size of expressions used in the scalar evolutions analyzerBound on the complexity of the expressions in the scalar evolutions analyzerBound on the number of variables in Omega constraint systemsBound on the number of inequalities in Omega constraint systemsBound on the number of equalities in Omega constraint systemsBound on the number of wild cards in Omega constraint systemsBound on the size of the hash table in Omega constraint systemsBound 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 checkvect-max-peeling-for-alignmentMax number of loop peels to enhancement alignment of data references in a loopThe maximum memory locations recorded by cselibMinimum heap expansion to trigger garbage collection, as a percentage of the total size of the heapMinimum heap size before we start collecting garbage, in kilobytesThe maximum number of instructions to search backward when looking for equivalent reloadTarget block's relative execution frequency (as a percentage) required to sink a statementThe maximum number of blocks in a region to be considered for interblock schedulingThe maximum number of insns in a region to be considered for interblock schedulingThe minimum probability of reaching a source block for interblock speculative schedulingmax-sched-extend-regions-itersThe maximum number of iterations through CFG to extend regionsThe maximum conflict delay for an insn to be considered for speculative motionThe minimal probability of speculation success (in percents), so that speculative insn will be scheduled.The minimum probability an edge must have for the scheduler to save its state across it.The maximum size of the lookahead window of selective schedulingMaximum number of times that an insn could be scheduledMaximum number of instructions in the ready list that are considered eligible for renaming
3991 Partition functions and vars at linktime into approximately same sized bucketsPut every symbol into separate partitionDisable partioning and streamingReport various link-time optimization statisticsReport various link-time optimization statistics for WPA onlyLink-time optimization with number of parallel jobs or jobserver.Run the link-time optimizer in local transformation (LTRANS) mode.Specify a file to which a list of files output by LTRANS is written.Set errno after built-in math functions-fmax-array-constructor=<n> Maximum number of objects in an array constructor-fmax-errors=<number> Maximum number of errors to report-fmax-identifier-length=<n> Maximum identifier length-fmax-stack-var-size=<n> Size in bytes of the largest array that will be put on the stack-fmax-subrecord-length=<n> Maximum length for subrecordsReport on permanent memory allocationReport on permanent memory allocation in WPA onlyAttempt to merge identical constants and constant variablesAttempt to merge identical constants across compilation unitsAttempt to merge identical debug strings across compilation units-fmessage-length=<number> Limit diagnostics to <number> characters per line. 0 suppresses line-wrappingSet default accessibility of module entities to PRIVATE.Perform SMS based modulo scheduling before the first scheduling passPerform SMS based modulo scheduling with register moves allowedMove loop invariant computations out of loopsDon't warn about uses of Microsoft extensionsGenerate code for NeXT (Apple Mac OS X) runtime environmentAssume that receivers of Objective-C messages may be nilEnables the unlimited vectorizer cost model. Preserved for backward compatibility.Support synchronous non-call exceptionsTreat a throw() exception specification as noexcept to improve code sizeSpecify which ABI to use for Objective-C family code and meta-data generation.Generate special Objective-C methods to initialize/destroy non-POD C++ ivars, if neededAllow fast jumps to the message dispatcherEnable Objective-C exception and synchronization syntaxEnable garbage collection (GC) in Objective-C/Objective-C++ programsEnable inline checks for nil receivers with the NeXT runtime and ABI version 2.Enable Objective-C setjmp exception handling runtimeConform to the Objective-C 1.0 language as implemented in GCC 4.0When possible do not generate stack framesEnable OpenMP (implies -frecursive in Fortran)Enable OpenMP's SIMD directivesRecognize C++ keywords like "compl" and "xor"Enable all optimization info dumps on stderr-fopt-info[-<type>=filename] Dump compiler optimization detailsOptimize sibling and tail recursive calls-foptimize-static-class-initializationEnable optimization of static class initialization codeEnable string length optimizations on treesTry to lay out derived types as compactly as possiblePack structure members together without holes-fpack-struct=<number> Set initial maximum structure member alignmentReturn small aggregates in memory, not registersLook for and use PCH files even when preprocessingLimit non-const non-FP loop peeling under profile estimates of large code footprintEnable machine specific peephole optimizationsEnable an RTL peephole pass before sched2Downgrade conformance errors to warningsGenerate position-independent code if possible (small mode)Generate position-independent code for executables if possible (small mode)Enable Plan 9 language extensionsUse PLT for PIC calls (-fno-plt: load the address from GOT at call site)-fplugin-arg-<name>-<key>[=<value>] Specify argument <key>=<value> for plugin <name>Report on memory allocation before interprocedural optimizationRun predictive commoning optimization.Generate prefetch instructions, if available, for arrays in loopsTreat the input file as already preprocessed-fno-pretty-templates Do not pretty-print template specializations as the template signature followed by the argumentsEnable basic program profiling codeInsert arc-based program profiling codeEnable correction of flow inconsistent profile data inputSet the top-level directory for storing the profile data. The default is 'pwd'.Dump CFG profile for comparison.Enable common options for generating profile info for profile feedback directed optimizationsfprofile-generate-atomic=[0..3] Atomically increments for profile counters.-fprofile-generate-buildinfo=filename Read build info to include in gcda file from filenameTurn on instrumentation sampling with -fprofile-generate with rate set by --param profile-generate-sampling-rate or environment variable GCOV_SAMPLING_RATEEnable common options for generating profile info for profile feedback directed optimizations, and set -fprofile-dir=Enable function reordering that improves code placementReport on consistency of profileSpecify a substring to be stripped from the profile base file nameEnable common options for performing profile feedback directed optimizationsEnable common options for performing profile feedback directed optimizations, and set -fprofile-dir=Insert code to profile values of expressionsProtect parentheses in expressions-frandom-seed=<string> Make compile reproducible using <string>Enable range checking during compilationInterpret any REAL(4) as a REAL(10)Interpret any REAL(4) as a REAL(16)Interpret any REAL(4) as a REAL(8)Interpret any REAL(8) as a REAL(10)Interpret any REAL(8) as a REAL(16)Interpret any REAL(8) as a REAL(4)Reallocate the LHS in assignmentsSame as -fassociative-math for expressions which include division.-frecord-compilation-info-in-elfRecord the compiler optimizations in a .gnu.switches.text section.Record gcc command line switches in the object file.Use a 4-byte record marker for unformatted filesUse an 8-byte record marker for unformatted filesAllocate local variables on the stack to allow indirect recursionReduce the amount of reflection meta-data generatedTurn on Redundant Extensions Elimination pass.Return small aggregates in registersPerform a register renamingshared librariesRestrict the use of hardware floating-point instructions to 32-bit operationsPrevent the use of all hardware floating-point instructionsOptimize lui/addiu address loadsAssume all symbols have 32-bit valuesUse synci instruction to invalidate i-cache-mtune=PROCESSOR Optimize the output for PROCESSORPut uninitialized constants in ROM (needs -membedded-data)Use Virtualization Application Specific instructionsPerform VR4130-specific alignment optimizationsUse eXtended Physical Address (XPA) instructionsCreate a position dependent executableDo not search standard system include directories (those specified with -isystem will still be used)Do not search standard system include directories for C++Do not look for object files in standard path-o <file> Place output into <file>Like -pedantic but issue them as errorsCreate a position independent executableGenerate C header of platform-specific featuresDo not display functions compiled or elapsed timeRemap file names when including filesStatically link the GNU Fortran helper library (libgfortran)Conform to the ISO 1998 C++ standard revised by the 2003 technical corrigendumDeprecated in favor of -std=c++11Conform to the ISO 2011 C++ standardConform to the ISO 2014(?) C++ draft standard (experimental and incomplete support)Conform to the ISO 2011 C standard (experimental and incomplete support)Deprecated in favor of -std=c11Conform to the ISO 1990 C standardConform to the ISO 1999 C standardDeprecated in favor of -std=c99Conform to the ISO Fortran 2003 standardConform to the ISO Fortran 2008 standardConform to the ISO Fortran 2008 standard including TS 29113Conform to the ISO Fortran 95 standardConform to nothing in particularConform to the ISO 1998 C++ standard revised by the 2003 technical corrigendum with GNU extensionsDeprecated in favor of -std=gnu++11Conform to the ISO 2011 C++ standard with GNU extensions (experimental and incomplete support)Conform to the ISO 201y(7?) C++ draft standard with GNU extensions (experimental and incomplete support)Conform to the ISO 2011 C standard with GNU extensions (experimental and incomplete support)Deprecated in favor of -std=gnu11Conform to the ISO 1990 C standard with GNU extensionsConform to the ISO 1999 C standard with GNU extensionsDeprecated in favor of -std=gnu99Conform to the ISO 1990 C standard as amended in 1994Deprecated in favor of -std=iso9899:1999Accept extensions to support legacy codeEnable traditional preprocessing-trigraphs Support ISO C trigraphsDo not predefine system-specific and GCC-specific macrosDisplay the compiler's versionunknown excess precision style %qsunknown floating point contraction style %qsunrecognized function reorder value %qsKnown MIPS ABIs (for use with the -mabi= option):Known MIPS CPUs (for use with the -march= and -mtune= options):Policies available for use with -mcompact-branches=Valid arguments to -mcode-readable=:Known MIPS IEEE 754 settings (for use with the -mabs= and -mnan= options):Known MIPS ISA levels (for use with the -mips option):Valid arguments to -mr10k-cache-barrier=:unrecognized visibility value %qsunknown vectorizer cost model %qsunknown vtable verify initialization priority %qs/usr/local/google/buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/vec.c/usr/local/google/buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/hooks.c%s: all warnings being treated as errors%s: some warnings being treated as errorsIn file included from %r%s:%d:%d%RIn file included from %r%s:%d%R,