Home | History | Annotate | Download | only in bin

Lines Matching refs:Those

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 renamingMinimal distance between possibly conflicting store and loadThe maximum number of RTL nodes that can be recorded as combiner's last valueThe upper bound for sharing integer constantsThe lower bound for a buffer to be considered for stack smashing protectionThe minimum size of variables taking part in stack slot sharing when not optimizingmax-jump-thread-duplication-stmtsMaximum number of statements allowed in a block that needs to be duplicated when threading jumpsmax-fields-for-field-sensitiveMaximum number of fields in a structure before pointer analysis treats the structure as a single variableThe maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling passMaximum number of active local stores in RTL dead store eliminationThe number of insns executed before prefetch is completedThe number of prefetches that can run at the same timeWhether to use canonical typesMaximum length of partial antic set when performing tree pre optimizationMaximum size of a SCC before SCCVN stops processing a functionsccvn-max-alias-queries-per-accessMaximum number of disambiguations to perform per memory accessMax loops number for regional RAMax size of conflict table in MBThe number of registers in each class kept unused by loop invariant motionlra-max-considered-reload-pseudosThe max number of reload pseudos which are considered during spilling a non-reload pseudoswitch-conversion-max-branch-ratioThe maximum ratio between array size and switch branches for a switch conversion to take placesize of tiles for loop blockingmaximum number of parameters in a SCoPmaximum number of basic blocks per function to be analyzed by Graphiteloop-max-datarefs-for-datadepsMaximum number of datarefs in loop for building loop data dependenciesloop-invariant-max-bbs-in-loopMax basic blocks number in loop for loop invariant motionicall-promote-target-percent-thresholdpercentage threshold for direct call promotion of a callee targeticall-promote-target_count-thresholdcall count threshold for direct call promotion of a callee targetforce inline indirect call target when promoteduse internal function id in profile lookupuse hotness based heuristics to match inlinerdon't import aux files if memory consumption exceeds this valueThe cutoff value of cumulative profile count. The value is between0-99. 100 is reserved as a special value indicating default cutoffwhich is set at runtime. When the parameter is used and if its valueis not 100, it overrides the dafault as well as the value set by the enviornment variableIn LIPO profile gen compilation, do not generate direct call profiling to functions marked with __attribute__((section(...))Those
3991 those paths from the main control flow and turn the statement with erroneous or undefined behaviour into a trap. -fisolate-erroneous-paths-dereferenceDetect paths which trigger erroneous or undefined behaviour due to dereferencing a NULL pointer. Isolate thoserolling when iteration count is knownAllow loop optimizations to assume that the loops behave in normal wayAllow math optimizations that may violate IEEE or ISO standardsWhen "signed" or "unsigned" is not given make the bitfield unsignedMake "char" unsigned by defaultJust generate unwind tables for exception handlingGenerate code for built-in atomic operationsGenerate code for the Boehm GCUse __cxa_atexit to register destructorsUse __cxa_get_exception_ptr in exception handlingCall a library routine to do integer divisionsUse the bfd linker instead of the default linkerUse the gold linker instead of the default linkerUse the mcld linker instead of the default linkerPerform variable tracking by annotating assignments-fvar-tracking-assignments-toggleToggle -fvar-tracking-assignmentsPerform variable tracking and also tag variables that are uninitialized-fvariable-expansion-in-unrollerApply variable expansion when loops are unrolledEnables the dynamic vectorizer cost model. Preserved for backward compatibility.Specifies the cost model for vectorizationAdd extra commentary to assembler outputMarks all inlined functions and methods as having hidden visibilityChanges visibility to match Microsoft Visual Studio by default-fvisibility=[default|internal|hidden|protected] Set the default symbol visibilityUse expression value profiles in optimizationsValidate vtable pointers before using them.Output vtable verification counters.Output vtable verification pointer sets information.Emit common-like symbols as weak symbolsConstruct webs and split unrelated uses of single variablePerform whole program optimizations-fwide-exec-charset=<cset> Convert all wide strings and character constants to character set <cset>Generate a #line directive pointing at the current working directoryRun the link-time optimizer in whole program analysis (WPA) mode.Whole program analysis (WPA) mode with number of parallel jobs specified.Assume signed arithmetic overflow wraps aroundPut zero initialized data in the bss sectionGenerate lazy class lookup (via objc_getClass()) for use in Zero-Link modeGenerate debug information in default formatGenerate debug information in COFF formatGenerate debug information in default version of DWARF formatGenerate debug information in DWARF v2 (or later) formatDump declarations to a .decl fileGenerate debug information in default extended formatGenerate DWARF pubnames and pubtypes sections with GNU extensions.Generate DWARF line number tables and no other debug sectionsGenerate debug information at level 1 with minimal line table-gnat<options> Specify options to GNATSet name of output ALI file (internal switch)Don't generate DWARF pubnames and pubtypes sections.Don't record gcc command line switches in DWARF DW_AT_producer.Don't generate debug information in separate .dwo filesEmit DWARF additions beyond selected versionGenerate DWARF pubnames and pubtypes sections.Record gcc command line switches in DWARF DW_AT_producer.Generate debug information in separate .dwo filesGenerate debug information in STABS formatGenerate debug information in extended STABS formatDon't emit DWARF additions beyond selected versionToggle debug information generationGenerate debug information in VMS formatGenerate debug information in XCOFF formatGenerate debug information in extended XCOFF format-idirafter <dir> Add <dir> to the end of the system include path-imacros <file> Accept definition of macros in <file>-imultiarch <dir> Set <dir> to be the multiarch include subdirectory-imultilib <dir> Set <dir> to be the multilib include subdirectory-include <file> Include the contents of <file> before other files-iplugindir=<dir> Set <dir> to be the default plugin directory-iprefix <path> Specify <path> as a prefix for next two options-iquote <dir> Add <dir> to the end of the quote include path-isysroot <dir> Set <dir> to be the system root directory-isystem <dir> Add <dir> to the start of the system include path-iwithprefix <dir> Add <dir> to the end of the system include path-iwithprefixbefore <dir> Add <dir> to the end of the main include path-mabi=ABI Generate code that conforms to the given ABIGenerate code that can be used in SVR4-style dynamic objects-mabs=MODE Select the IEEE 754 ABS/NEG instruction execution modeGenerate code for the Android platform.-march=ISA Generate code for the given ISA-mbranch-cost=COST Set the cost of branches to roughly COST instructionsUse Branch Likely instructions, overriding the architecture defaultTrap on integer divide by zero-mcode-readable=SETTING Specify when instructions are allowed to access codeSpecify the compact branch usage policy never Only use delay slot branches optimal Use compact branches where beneficial always Only use compact branchesUse branch-and-break sequences to check for integer divide by zeroUse trap instructions to check for integer divide by zeroAllow the use of MDMX instructionsAllow hardware floating-point instructions to cover both 32-bit and 64-bit operationsUse MIPS-DSP REV 2 instructionsUse MIPS-DSP Rev 3 instructionsUse Enhanced Virtual Addressing instructionsUse NewABI-style %reloc() assembly operatorsUse -G for data that is not defined by the current objectWork around certain 24K errataWork around certain R10000 errataWork around certain R4000 errataWork around certain R4400 errataWork around certain RM7000 errataWork around errata for early SB-1 revision 2 coresWork around certain VR4120 errataWork around VR4130 mflo/mfhi errataWork around an early 4300 hardware bugSwitch on/off MIPS16 ASE on alternating functions for compiler testing-mflush-func=FUNC Use FUNC to flush the cache before calling stack trampolinesUse 32-bit floating-point registersUse 64-bit floating-point registersGenerate floating-point multiply-add instructionsUse GP-relative addressing to access small dataAllow the use of hardware floating-point ABI and instructionsUse integer madd/msub instructionsGenerate code that is link-compatible with MIPS16 and microMIPS code.An alias for minterlink-compressed provided for backward-compatibility.-mipsN Generate code for ISA level NUse ldc1/ldxc1 and sdc1/sdxc1 instructionUse ll, sc and sync instructionsUse PMC-style 'mad' instructionsPass the address of the ra save location to _mcount in $12Use MIPS MSA Extension instructionsAllow the use of MT instructionsAllow the use of MXU instructions-mnan=ENCODING Select the IEEE 754 NaN data encodingPrevent the use of all floating-point operationsDo not use a cache-flushing function before calling stack trampolinesDo not use MIPS-3D instructionsEnable use of odd-numbered single-precision registersUse paired-single floating-point instructionsWhen generating -mabicalls code, allow executables to use PLTs and copy relocations-mr10k-cache-barrier=SETTING Specify when r10k cache barriers should be insertedTry to allow the linker to turn PIC calls into direct callsWhen generating -mabicalls code, make the code suitable for use in shared 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,