Home | History | Annotate | Download | only in bin

Lines Matching refs:conditional

3927 macro "%s" is not used"??? ??? ?? ??:??:?? ????"invalid built-in macro "%s""%s %2d %4d""%02d:%02d:%02d""??? ?? ????""??:??:??"parameter name missing!"#%&'()*+,-./:;<=>?[\]^{|}~"%s" redefined__STDC___STDC_FORMAT_MACROS__STDC_LIMIT_MACROS__STDC_CONSTANT_MACROSJanFebMarAprMayJunJulAugSepOctNovDecunterminated commentpoisoning existing macro "%s"assertion without predicatemissing '(' after predicatepredicate's answer is emptyinvalid #%s directive"%s" re-assertedpragma dependencyempty filename in #%s#include nested too deeplycannot find source file %scurrent file is older than %sundefining "%s"#pragma once in main file#else without #if#else after #elsethe conditional began here#elif without #if#elif after #else#endif without #if#%s is a GCC extension"%s" is not a valid filenameline number out of rangepush_macropop_macropoisonsystem_headerdependencyunterminated #%s( 
4023 trip countprefetch-min-insn-to-mem-ratioMin. ratio of insns to mem ops to enable prefetching in a loopMax. size of var tracking hash tablesMax. recursion depth for expanding var tracking expressionsMax. size of loc list for which reverse ops should be addedThe minimum UID to be used for a nondebug insnMaximum allowed growth of size of new parameters ipa-sra replaces a pointer to an aggregate withSize in bytes after which thread-local aggregates should be instrumented with the logging functions instead of save/restore pairsMaximum size of a list of values associated with each parameter for interprocedural constant propagationThreshold ipa-cp opportunity evaluation that is still considered beneficial to clone.Maximum number of aggregate content items for a parameter in jump functions and latticesCompile-time bonus IPA-CP assigns to candidates which make loop bounds or strides known.Compile-time bonus IPA-CP assigns to candidates which make an array index known.Number of partitions the program should be split toMinimal size of a partition for LTO (in estimated instructions)the minimum number of iterations of negative cycle cancellation in MCFcxx-max-namespaces-for-diagnostic-helpMaximum number of namespaces to search for alternatives when name lookup failsgnu-cgraph-section-edge-thresholdminimum call graph edge count for inclusion in .gnu.callgraph.text sectionMaximum number of conditional store pairs that can be sunkThe smallest number of different values for which it is best to use a jump-table instead of a tree of conditional branches, if 0, use the default for the machineAllow new data races on loads to be introducedAllow new data races on stores to be introducedAllow new data races on packed data loads to be introducedAllow new data races on packed data stores to be introducedSet the maximum number of instructions executed in parallel in reassociated tree. If 0, use the target dependent heuristic.Maximum amount of similar bbs to compare a bb withMaximum amount of iterations of the pass over a functionMaximum number of strings for which strlen optimization pass will track string lengthsWhich -fsched-pressure algorithm to applyMaximum length of candidate scans for straight-line strength reductionEnable asan globals protectionEnable asan store operations protectionEnable asan load operations protectionEnable asan builtin functions protectionEnable asan detection of use-after-return bugsasan-instrumentation-with-call-thresholdUse callbacks instead of inline code if number of accesses in function becomes greater or equal to this numberMaximum number of nested calls to search for control dependencies during uninitialized variable analysisMaximum number of instructions to copy when duplicating blocks on a finite state automaton jump thread pathMaximum number of basic blocks on a finite state automaton jump thread pathMaximum number of new jump thread paths to create for a finite state automatonAdjust the estimation of fp setting insn cost with this fraction inframepointer shrinkwrappingAdjust the estimation of fpset promotion cost with this fraction inframepointer shrinkwrapping/buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/opts.cThe following options are specific to just the language The following options are supported by the language The following options are target specificThe following options control compiler warning messagesThe following options control optimizationsThe following options are language-independentThe --param option recognizes the following as parametersThe following options are language-relatedThe following options take separate argumentsThe following options take joined argumentsunrecognized include_flags 0x%x passed to print_specific_help No options with the desired characteristics were found None found. Use --help=%s to show *all* the options supported by the %s front-end
4024 conditional move instructionsAssume normal C execution environmentPerform conversion of conditional jumps to branchless equivalentsPerform conversion of conditional jumps to conditionalations-fno-threadsafe-statics Do not generate thread-safe code for initializing local staticsReport the time taken by each compiler pass-ftls-model=[global-dynamic|local-dynamic|initial-exec|local-exec] Set the default thread-local storage code generation modelReorder top level functions, variables, and asmsPerform superblock formation via tail duplication-ftrack-macro-expansion=<0|1|2> Track locations of tokens coming from macro expansion and display them in error messagesAssume floating-point operations can trapTrap for signed overflow in addition, subtraction and multiplicationEnable SSA-BIT-CCP optimization on treesEnable conditional dead code elimination for builtin callsEnable SSA-CCP optimization on treesEnable loop header copying on treesEnable coalescing of copy-related user variables that are inlinedEnable coalescing of all copy-related user variablesEnable copy propagation on treesReplace SSA temporaries with better names in copiesTransform condition stores into unconditional onesEnable SSA dead code elimination optimization on treesEnable dominator optimizationsEnable forward propagation on treesEnable Full Redundancy Elimination (FRE) on trees-ftree-loop-distribute-patternsEnable loop distribution for patterns transformed into a library callEnable loop distribution on treesConvert conditional jumps in innermost loops to branchless equivalentsAlso if-convert conditional jumps containing memory writesEnable loop invariant motion on treesCreate canonical induction variables in loopsEnable loop interchange transforms. Same as -floop-interchangeEnable loop optimizations on tree levelEnable loop vectorization on treesPerform live range splitting during the SSA->normal passEnable automatic parallelization of loopsIn SSA-PRE optimization on trees, enable partial-partial redundancy eliminationEnable hoisting loads from conditional