HomeSort by relevance Sort by last modified time
    Searched defs:passes (Results 1 - 15 of 15) sorted by null

  /external/llvm/unittests/Bitcode/
BitReaderTest.cpp 59 PassManager passes; local
60 passes.add(createVerifierPass());
61 passes.run(*m);
  /external/icu4c/tools/ctestfw/unicode/
uperf.h 163 int32_t passes; member in class:UPerfTest
  /external/libpng/contrib/gregbook/
readpng2.h 94 int passes; /* not used */ member in struct:_mainprog_info
  /external/llvm/tools/lto/
LTOCodeGenerator.cpp 18 #include "llvm/Analysis/Passes.h"
51 cl::desc("Do not run any optimization passes"));
303 PassManager passes; local
304 passes.add(createVerifierPass());
346 passes.add(createInternalizePass(mustPreserveList));
349 passes.run(*mergedModule);
354 /// Optimize merged modules using various IPO passes
370 // Instantiate the pass manager to organize the passes.
371 PassManager passes; local
374 passes.add(createVerifierPass())
    [all...]
  /external/emma/core/java12/com/vladium/emma/report/
IItemAttribute.java 46 boolean passes (IItem item, int criterion); // ideally, criteria should come from a double-dispatched API method in interface:IItemAttribute
99 public boolean passes (final IItem item, final int criterion) method in class:IItemAttribute.Factory.NameAttribute
164 public boolean passes (final IItem item, final int criterion) method in class:IItemAttribute.Factory.FractionAttribute
  /external/skia/src/gpu/
GrDefaultPathRenderer.cpp 83 // When there are no separate faces we do two passes to setup the winding rule
86 // decrementing passes.
119 // Color passes are the same whether we use the two-sided stencil or two passes
358 const GrStencilSettings* passes[3]; local
366 passes[0] = &gDirectToStencil;
368 passes[0] = NULL;
376 passes[0] = &gDirectToStencil;
378 passes[0] = NULL;
388 passes[0] = &gEOStencilPass
    [all...]
GrClipMaskManager.cpp 653 int passes; local
666 &passes,
696 for (int p = 0; p < passes; ++p) {
    [all...]
  /external/valgrind/main/memcheck/tests/
vcpu_fbench.c 711 long passes; local
749 passes = 0;
767 passes++;
768 if ((passes % 100L) == 0) {
769 printf("Pass %ld.\n", passes);
846 passes, i + 1);
  /external/valgrind/main/perf/
fbench.c 707 long passes; local
745 passes = 0;
763 passes++;
764 if ((passes % 100L) == 0) {
765 printf("Pass %ld.\n", passes);
842 passes, i + 1);
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/
BinaryDictInputOutput.java 51 // Arbitrary limit to how much passes we consider address size compression should
53 // compression in five passes.
54 // If the number of passes exceeds this number, makedict bails with an exception on
647 int passes = 0; local
659 ++passes;
660 if (passes > MAX_PASSES) throw new RuntimeException("Too many passes - probably a bug");
664 MakedictLog.i("Compression complete in " + passes + " passes.");
    [all...]
  /external/libvpx/libvpx/
vpxenc.c 976 static const arg_def_t passes = ARG_DEF("p", "passes", 1, variable
977 "Number of passes (1/2)");
1011 &outputfile, &codecarg, &passes, &pass_arg, &fpf_name, &limit, &deadline,
1506 int passes; member in struct:global_config
    [all...]
  /external/emma/lib/
emma.jar 
  /prebuilts/devtools/tools/lib/
jfreechart-1.0.9.jar 
  /prebuilts/tools/common/jfreechart/
jfreechart-1.0.9.jar 
  /prebuilts/tools/common/m2/repository/jfree/jfreechart/1.0.9/
jfreechart-1.0.9.jar 

Completed in 373 milliseconds