Searched refs:dsp (Results 1 - 15 of 15) sorted by relevance

/prebuilts/gdb/darwin-x86/lib/python2.7/test/
H A Dtest_ossaudiodev.py46 dsp = ossaudiodev.open('w')
54 dsp.bufsize()
55 dsp.obufcount()
56 dsp.obuffree()
57 dsp.getptr()
58 dsp.fileno()
61 self.assertFalse(dsp.closed)
62 self.assertEqual(dsp.name, "/dev/dsp")
63 self.assertEqual(dsp
[all...]
H A Dtest_linuxaudiodev.py90 dsp = linuxaudiodev.open('w')
95 dsp.close()
/prebuilts/gdb/linux-x86/lib/python2.7/test/
H A Dtest_ossaudiodev.py46 dsp = ossaudiodev.open('w')
54 dsp.bufsize()
55 dsp.obufcount()
56 dsp.obuffree()
57 dsp.getptr()
58 dsp.fileno()
61 self.assertFalse(dsp.closed)
62 self.assertEqual(dsp.name, "/dev/dsp")
63 self.assertEqual(dsp
[all...]
H A Dtest_linuxaudiodev.py90 dsp = linuxaudiodev.open('w')
95 dsp.close()
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
H A Dtest_ossaudiodev.py46 dsp = ossaudiodev.open('w')
54 dsp.bufsize()
55 dsp.obufcount()
56 dsp.obuffree()
57 dsp.getptr()
58 dsp.fileno()
61 self.assertFalse(dsp.closed)
62 self.assertEqual(dsp.name, "/dev/dsp")
63 self.assertEqual(dsp
[all...]
H A Dtest_linuxaudiodev.py90 dsp = linuxaudiodev.open('w')
95 dsp.close()
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
H A Dtest_ossaudiodev.py46 dsp = ossaudiodev.open('w')
54 dsp.bufsize()
55 dsp.obufcount()
56 dsp.obuffree()
57 dsp.getptr()
58 dsp.fileno()
61 self.assertFalse(dsp.closed)
62 self.assertEqual(dsp.name, "/dev/dsp")
63 self.assertEqual(dsp
[all...]
H A Dtest_linuxaudiodev.py90 dsp = linuxaudiodev.open('w')
95 dsp.close()
/prebuilts/jdk/jdk8/darwin-x86/sample/nio/server/
H A DAcceptHandler.java55 private Dispatcher dsp; field in class:AcceptHandler
59 AcceptHandler(ServerSocketChannel ssc, Dispatcher dsp, argument
62 this.dsp = dsp;
83 dsp.register(cio.getSocketChannel(), SelectionKey.OP_READ, rh);
/prebuilts/jdk/jdk8/linux-x86/sample/nio/server/
H A DAcceptHandler.java55 private Dispatcher dsp; field in class:AcceptHandler
59 AcceptHandler(ServerSocketChannel ssc, Dispatcher dsp, argument
62 this.dsp = dsp;
83 dsp.register(cio.getSocketChannel(), SelectionKey.OP_READ, rh);
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/
H A Dtelephony.h77 dsp enumerator in enum:__anon9934
/prebuilts/gcc/linux-x86/mips/mips64el-linux-android-4.9/bin/
H A Dmips64el-linux-android-gcc-4.9.x3987 } cc1plus %{save-temps*|no-integrated-cpp:-fpreprocessed %{save-temps*:%b.ii} %{!save-temps*:%g.ii}} %{!save-temps*:%{!no-integrated-cpp:%(cpp_unique_options)}} %(cc1_options) %2 %{!fsyntax-only:%(invoke_as)}}}}%{!M:%{!MM:%{!E: cc1plus -fpreprocessed %i %(cc1_options) %2 %{!fsyntax-only:%(invoke_as)}}}}lto1 %(cc1_options) %i %{!fsyntax-only:%(invoke_as)}%{mips1|mips2|mips3|mips4|mips32*|mips64*|march=*:;: -march=%(VALUE)}%{mabi=32|mgp32:%{mips1|mips2|mips3|mips4|mips32*|mips64*|march=*:;: -march=%(VALUE)}}%{mabi=32|mgp32:;:%{mips1|mips2|mips3|mips4|mips32*|mips64*|march=*:;: -march=%(VALUE)}}%{mabi=32|mgp32:%{!mtune=*:-mtune=%(VALUE)}}%{mabi=32|mgp32:;:%{!mtune=*:-mtune=%(VALUE)}}%{!msoft-float:%{!mhard-float:-m%(VALUE)-float}}%{!msoft-float:%{!msingle-float:%{!mdouble-float:-m%(VALUE)-float}}}%{mabi=32|mgp32:%{!msoft-float:%{!msingle-float:%{!mfp*:%{!mmsa:-mfp%(VALUE)}}}}}%{mabi=32|mgp32:%{!msoft-float:%{!msingle-float:%{!modd-spreg:%{!mno-odd-spreg:-m%(VALUE)}}}}}%{!mdivide-traps:%{!mdivide-breaks:-mdivide-%(VALUE)}}%{!mllsc:%{!mno-llsc:-m%(VALUE)}}%{!mplt:%{!mno-plt:-m%(VALUE)}}%{!msynci:%{!mno-synci:-m%(VALUE)}}%{fdump-final-insns:-fdump-final-insns=.} %<fdump-final-insns%{mips1|mips2|mips3|mips4|mips32*|mips64*:;: %{march=mips1|march=r2000|march=r3000|march=r3900:-mips1} %{march=mips2|march=r6000:-mips2} %{march=mips3|march=r4*|march=vr4*|march=orion|march=loongson2*:-mips3} %{march=mips4|march=r8000|march=vr5*|march=rm7000|march=rm9000 |march=r10000|march=r12000|march=r14000|march=r16000:-mips4} %{march=mips32|march=4kc|march=4km|march=4kp|march=4ksc:-mips32} %{march=mips32r2|march=m4k|march=4ke*|march=4ksd|march=24k* |march=34k*|march=74k*|march=m14k*|march=1004k*: -mips32r2} %{march=mips32r3: -mips32r3} %{march=mips32r5|march=p5600: -mips32r5} %{march=mips32r6: -mips32r6} %{march=mips64|march=5k*|march=20k*|march=sb1*|march=sr71000 |march=xlr: -mips64} %{march=mips64r2|march=loongson3a|march=octeon|march=xlp: -mips64r2} %{march=mips64r3: -mips64r3} %{march=mips64r5: -mips64r5} %{march=mips64r6|march=i6400: -mips64r6} %{!march=*: -mips64r6}}%{mhard-float|msoft-float|mno-float|march=mips*:; march=vr41*|march=m4k|march=4k*|march=24kc|march=24kec |march=34kc|march=34kn|march=74kc|march=1004kc|march=5kc |march=m14k*|march=octeon|march=xlr: -msoft-float; march=*: -mhard-float}%{msynci|mno-synci:;:%{mips32r2|mips32r3|mips32r5|mips32r6|mips64r2 |mips64r3|mips64r5|mips64r6:-msynci;:-mno-synci}}%{!mabi=*: %{mips1|mips2|mips32*|mgp32: -mabi=32;: -mabi=64}}%{!msoft-float: %{!msingle-float: %{!mfp*: %{!mmsa: %{mabi=32: %{mips2|mips3|mips4|mips5|mips32|mips32r2|mips32r3|mips32r5| mips64|mips64r2|mips64r3|mips64r5: -mfpxx}}}}}}%{!modd-spreg: %{mabi=32: %{mips32r6: -mno-odd-spreg}}}%{mnan*:;mips32r6|mips64r6:-mnan=2008}%{!mno-dsp: %{march=24ke*|march=34kc*|march=34kf*|march=34kx*|march=1004k*: -mdsp} %{march=74k*|march=m14ke*: %{!mno-dspr2: -mdspr2 -mdsp}}}%{mno-android|tno-android-cc: %{mshared|mno-shared|fpic|fPIC|fpie|fPIE:;:-mno-shared};:}%{fopenmp|ftree-parallelize-loops=*: -pthread}mips64-r6:../lib64 !mabi=32 !mips32 !mips32r2 !mips32r6 mips64r6;32/mips-r1:../lib/../lib mabi=32 mips32 !mips32r2 !mips32r6 !mips64r6;32/mips-r2:../lib/../libr2 mabi=32 !mips32 mips32r2 !mips32r6 !mips64r6;32/mips-r6:../lib/../libr6 mabi=32 !mips32 !mips32r2 mips32r6 !mips64r6;func_reorder_linker_plugin_filefunc_reorder_linker_plugin_opt%{!fwpa*: %{fcompare-debug=*|fdump-final-insns=*:%:compare-debug-dump-opt()} %{!S:-o %|.s |
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 functions can not be inlined so there is no point trackingthem.random seed value used in random group testingIn LIPO random group testing, this parameter is used to set max group size. The default value is 0 which is treated specially and specifies no random grouping.The scale factor to propagate callee module group's weight to the caller.Algorithm 0 uses the eager propagation algorithm.Algorithm 1 uses the inclusion_based priority algorithm.The default algorithm is 1.Default is 0 which not merge.If the value is 1, merge the edges.0: force strict inclusion; 1: weak inclusion.Default is 0.Algorithm 0 performs no fixup.Algorithm 1 fixes up only indirect call profile targets.Algorithm 2 fixes up only missing counters.Algorithm 3 (1|2) fixes up both.The default algorithm is 3.Default is 1. If the value is 0, dumping is disabled.Default is 0. If the value is 1, text dump is used. If the value is 2, .dot dump is enabled. profile-generate-sampling-periodsampling rate with -fprofile-generate-samplingsampling rate for lipo direct call and indirect call profileEnable time profiling when value profilingcallback a user-define function when for arc counter increments.Stop incrementing arc counts once they become 1.Looking for gcda file in current dir.Maximum number of instructions in basic block to be considered for SLP vectorizationMin. ratio of insns to prefetches to enable prefetching for a loop with an unknown 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 reductionfunction-patch-min-instructionsMinimum number of instructions in the function without loop before the function is qualified for patching for instrumentation (for use with -mpatch-functions-for-instrumentation)Enable 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/usr/local/google/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
/prebuilts/devtools/tools/lib/
H A Djython-standalone-2.5.3.jarMETA-INF/MANIFEST.MF META-INF/LICENSE META-INF/NOTICE META-INF/maven/jline/ ...
/prebuilts/tools/common/m2/repository/org/python/jython/2.5.3/
H A Djython-2.5.3.jarMETA-INF/MANIFEST.MF META-INF/services/javax.script.ScriptEngineFactory com/xhaus/modjy/ModjyJServlet ...
/prebuilts/tools/common/m2/repository/org/python/jython-standalone/2.5.3/
H A Djython-standalone-2.5.3.jarMETA-INF/MANIFEST.MF META-INF/LICENSE META-INF/NOTICE META-INF/maven/jline/ ...

Completed in 623 milliseconds