| /external/toolchain-utils/bestflags/ |
| D | testing_batch.py | 277 def _TestAlgorithm(cost_func, specs, generations, best_result): argument
299 args=(set(), generations, output_queue, input_queue))
363 generations = [HillClimbingBestBranch(generation_tasks, set([]), specs)]
368 _TestAlgorithm('sum(values[0:len(values)])', specs, generations, 0)
379 generations = [HillClimbingBestBranch(generation_tasks, set([]), specs)]
384 _TestAlgorithm(cost_function, specs, generations, cost)
403 generations = [GAGeneration(generation_tasks, set([]), 0)]
406 _TestAlgorithm('sum(values[0:len(values)])', specs, generations, -1)
408 _TestAlgorithm(cost_func, specs, generations, -1)
425 generations = _GenerateAllIterativeEliminationTasks(specs)
[all …]
|
| D | steering_test.py | 79 generations = []
97 generations.insert(0, current_generation)
118 while generations:
119 generation = generations.pop(0)
|
| D | steering.py | 14 def Steering(cache, generations, input_queue, result_queue): argument
45 waiting = generations
53 for generation in generations:
|
| D | example_algorithms.py | 123 generations = [GAGeneration(generation_tasks, set([]), 0)]
126 _StartExperiment(num_builders, num_testers, generations)
147 def _StartExperiment(num_builders, num_testers, generations): argument
176 args=(set([]), generations, test_steering, steering_build))
|
| /external/python/cpython2/Modules/ |
| D | gcmodule.c | 40 #define GEN_HEAD(n) (&generations[n].head)
43 static struct gc_generation generations[NUM_GENERATIONS] = { variable
903 generations[generation+1].count += 1; in collect()
905 generations[i].count = 0; in collect()
1042 if (generations[i].count > generations[i].threshold) { in collect_generations()
1176 &generations[0].threshold, in gc_set_thresh()
1177 &generations[1].threshold, in gc_set_thresh()
1178 &generations[2].threshold)) in gc_set_thresh()
1182 generations[i].threshold = generations[2].threshold; in gc_set_thresh()
1198 generations[0].threshold, in gc_get_thresh()
[all …]
|
| /external/v8/src/ |
| D | compilation-cache.h | 24 CompilationSubCache(Isolate* isolate, int generations) in CompilationSubCache() argument
26 generations_(generations) { in CompilationSubCache()
27 tables_ = NewArray<Object*>(generations); in CompilationSubCache()
62 inline int generations() { return generations_; } in generations() function
133 CompilationCacheRegExp(Isolate* isolate, int generations) in CompilationCacheRegExp() argument
134 : CompilationSubCache(isolate, generations) { } in CompilationCacheRegExp()
|
| D | compilation-cache.cc | 98 for (int generation = 0; generation < generations(); generation++) { in Remove()
150 DCHECK(generations() == 1); in Lookup()
204 DCHECK(generations() == 1); in Lookup()
239 for (generation = 0; generation < generations(); generation++) { in Lookup()
|
| /external/clang/test/CodeGen/ |
| D | 2008-08-07-AlignPadding1.c | 21 #define GEN_HEAD(n) (&generations[n].head)
27 struct gc_generation generations[3] = { variable
|
| D | union-init.c | 23 #define GEN_HEAD(n) (&generations[n].head)
26 struct gc_generation generations[NUM_GENERATIONS] = { variable
|
| /external/ImageMagick/MagickCore/ |
| D | log.c | 122 generations, member
799 (void) FormatLocaleFile(file,"%9g ",(double) log_info[i]->generations); in ListLogInfo()
1076 if (log_info->generations == 0) in TranslateEvent()
1083 log_info->generations)); in TranslateEvent()
1213 if (log_info->generations == 0) in TranslateFilename()
1220 log_info->generations)); in TranslateFilename()
1597 log_info->generations=(~0UL); in LoadLogCache()
1600 log_info->generations=StringToUnsignedLong(token); in LoadLogCache()
|
| /external/ImageMagick/Magick++/ |
| D | README | 15 trivial to support multiple generations of an image in memory at one time.
|
| /external/swiftshader/third_party/LLVM/docs/HistoricalNotes/ |
| D | 2001-04-16-DynamicCompilation.txt | 38 body of legacy code that was compiled for previous generations and will
|
| D | 2001-02-09-AdveComments.txt | 46 255 positions seems adequate for several generations of machines
|
| D | 2001-02-09-AdveCommentsResponse.txt | 80 > 255 positions seems adequate for several generations of machines
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2001-04-16-DynamicCompilation.txt | 38 body of legacy code that was compiled for previous generations and will
|
| D | 2001-02-09-AdveComments.txt | 46 255 positions seems adequate for several generations of machines
|
| D | 2001-02-09-AdveCommentsResponse.txt | 80 > 255 positions seems adequate for several generations of machines
|
| /external/mesa3d/docs/ |
| D | libGL.txt | 76 with many generations of hardware drivers to come.
|
| /external/python/cpython2/Doc/library/ |
| D | gc.rst | 82 The GC classifies objects into three generations depending on how many
|
| /external/llvm/docs/tutorial/ |
| D | BuildingAJIT1.rst | 49 Finally, a word on API generations: ORC is the 3rd generation of LLVM JIT API.
|
| /external/python/cpython2/Doc/whatsnew/ |
| D | 2.5.rst | 1354 containing the current collection counts for the three GC generations. This is
|
| /external/jline/src/src/test/resources/jline/example/ |
| D | english.gz | |
| /external/brotli/tests/testdata/ |
| D | plrabn12.txt | 9473 All generations; and had hither come
|