| /external/toolchain-utils/binary_search_tool/ |
| D | README.bisect | 2 bisect.py is a wrapper around the general purpose binary_search_state.py. It
16 This method will bisect across all packages in a ChromeOS repository and find
20 board: The board to bisect on. For example: daisy, falco, etc.
34 bisect.py does most cleanup for you, the only thing required by the user is
53 ./bisect.py package daisy 172.17.211.184
56 ./bisect.py package daisy 172.17.211.184 -t cros_pkg/boot_test.sh
59 This method will bisect across all objects in a ChromeOS package and find
63 board: The board to bisect on. For example: daisy, falco, etc.
65 package: The package to bisect with. For example: chromeos-chrome
111 ./bisect.py object daisy 172.17.211.184 cryptohome
[all …]
|
| D | MAINTENANCE | 24 specifically test binary_search_state.py, binary_search_perforce.py, bisect.py.
36 the majority of it isn't even used to bisect object files. The file was
37 originally intended to bisect CLs, and binary_search_state.py just reused
47 bisect, you have to run scripts/edit sources in this repo. Ideally these
48 scripts would be static, and if you wanted to bisect/make changes you would
65 binary_search_state.py and bisect.py both have to have near identical
66 arguments in order to support argument overriding in bisect.py. However
67 they do have to be slightly different. Mainly, bisect.py needs to have no
|
| /external/llvm/test/Other/ |
| D | opt-bisect-legacy-pass-manager.ll | 18 ; RUN: opt -O3 -opt-bisect-limit=0 < %s | llc -O3 -opt-bisect-limit=0
21 ; Verify that no skippable passes are run with -opt-bisect-limit=0.
23 ; RUN: opt -disable-output -disable-verify -O3 -opt-bisect-limit=0 %s 2>&1 \
30 ; RUN: opt -opt-bisect-limit=0 < %s 2>&1 | FileCheck %s --check-prefix=OPTBISECT-O0
36 ; Verify that we can use the opt-bisect-helper.py script (derived from
37 ; utils/bisect) to locate the optimization that inlines the call to
40 ; RUN: %python %S/opt-bisect-helper.py --start=0 --end=256 --optcmd=opt \
53 ; RUN: opt -disable-output -disable-verify -deadargelim -opt-bisect-limit=-1 %s \
57 ; RUN: opt -disable-output -disable-verify -deadargelim -opt-bisect-limit=0 %s \
64 ; RUN: opt -disable-output -disable-verify -inline -opt-bisect-limit=-1 %s \
[all …]
|
| /external/libyuv/files/tools/ |
| D | OWNERS | 19 per-file bisect*.py=anantha@chromium.org
20 per-file bisect*.py=prasadv@chromium.org
21 per-file bisect*.py=robertocn@chromium.org
22 per-file run-bisect*.py=prasadv@chromium.org
23 per-file run-bisect*.py=robertocn@chromium.org
24 per-file prepare-bisect*.py=prasadv@chromium.org
25 per-file prepare-bisect*.py=robertocn@chromium.org
|
| /external/python/cpython2/Doc/library/ |
| D | bisect.rst | 1 :mod:`bisect` --- Array bisection algorithm
4 .. module:: bisect
12 **Source code:** :source:`Lib/bisect.py`
19 approach. The module is called :mod:`bisect` because it uses a basic bisection
40 bisect(a, x, lo=0, hi=len(a))
52 ``a.insert(bisect.bisect_left(a, x, lo, hi), x)`` assuming that *a* is
66 bisect to build a full-featured collection class with straight-forward search
74 The above :func:`bisect` functions are useful for finding insertion points but
120 The :func:`bisect` function can be useful for numeric table lookups. This
121 example uses :func:`bisect` to look up a letter grade for an exam score (say)
[all …]
|
| D | datatypes.rst | 27 bisect.rst
|
| /external/tremolo/Tremolo/ |
| D | vorbisfile.c | 219 ogg_int64_t bisect; in _bisect_forward_serialno() local
222 bisect=searched; in _bisect_forward_serialno()
224 bisect=(searched+endsearched)/2; in _bisect_forward_serialno()
227 _seek_helper(vf,bisect); in _bisect_forward_serialno()
231 endsearched=bisect; in _bisect_forward_serialno()
1196 ogg_int64_t bisect; in ov_pcm_seek_page() local
1199 bisect=begin; in ov_pcm_seek_page()
1202 bisect=begin + in ov_pcm_seek_page()
1204 if(bisect<=begin) in ov_pcm_seek_page()
1205 bisect=begin+1; in ov_pcm_seek_page()
[all …]
|
| /external/r8/src/test/java/com/android/tools/r8/bisect/ |
| D | BisectTest.java | 4 package com.android.tools.r8.bisect;
9 import com.android.tools.r8.bisect.BisectOptions.Result;
40 public void bisect() throws Exception { in bisect() method in BisectTest
|
| /external/llvm/test/Other/X86/ |
| D | opt-bisect-isel.ll | 2 ; when the -opt-bisect-limit=0 option is used. In particular, the X86
6 ; RUN: llc -O3 -opt-bisect-limit=0 -o - %s | FileCheck %s
|
| /external/autotest/site_utils/autoupdate/ |
| D | release.py | 9 import bisect
160 i = bisect.bisect_left(self._sorted_shifted_branchpoint_rel_key_list,
|
| /external/python/cpython2/Lib/multiprocessing/ |
| D | heap.py | 35 import bisect
115 i = bisect.bisect_left(self._lengths, size)
160 bisect.insort(self._lengths, length)
|
| /external/ImageMagick/MagickCore/ |
| D | quantize.c | 769 bisect; in ClassifyImageColors() local
835 bisect=((double) QuantumRange+1.0)/2.0; in ClassifyImageColors()
843 bisect*=0.5; in ClassifyImageColors()
845 mid.red+=(id & 1) != 0 ? bisect : -bisect; in ClassifyImageColors()
846 mid.green+=(id & 2) != 0 ? bisect : -bisect; in ClassifyImageColors()
847 mid.blue+=(id & 4) != 0 ? bisect : -bisect; in ClassifyImageColors()
848 mid.alpha+=(id & 8) != 0 ? bisect : -bisect; in ClassifyImageColors()
942 bisect=((double) QuantumRange+1.0)/2.0; in ClassifyImageColors()
950 bisect*=0.5; in ClassifyImageColors()
952 mid.red+=(id & 1) != 0 ? bisect : -bisect; in ClassifyImageColors()
[all …]
|
| D | splay-tree.c | 253 bisect; in LinkSplayTreeNodes() local
255 bisect=low+(high-low)/2; in LinkSplayTreeNodes()
256 node=nodes[bisect]; in LinkSplayTreeNodes()
257 if ((low+1) > bisect) in LinkSplayTreeNodes()
260 node->left=LinkSplayTreeNodes(nodes,low,bisect-1); in LinkSplayTreeNodes()
261 if ((bisect+1) > high) in LinkSplayTreeNodes()
264 node->right=LinkSplayTreeNodes(nodes,bisect+1,high); in LinkSplayTreeNodes()
|
| D | resize.c | 2452 bisect, in HorizontalFilter() local
2474 bisect=(double) (x+0.5)/x_factor+MagickEpsilon; in HorizontalFilter()
2475 start=(ssize_t) MagickMax(bisect-support+0.5,0.0); in HorizontalFilter()
2476 stop=(ssize_t) MagickMin(bisect+support+0.5,(double) image->columns); in HorizontalFilter()
2483 ((double) (start+n)-bisect+0.5)); in HorizontalFilter()
2543 j=(ssize_t) (MagickMin(MagickMax(bisect,(double) start),(double) in HorizontalFilter()
2667 bisect, in VerticalFilter() local
2689 bisect=(double) (y+0.5)/y_factor+MagickEpsilon; in VerticalFilter()
2690 start=(ssize_t) MagickMax(bisect-support+0.5,0.0); in VerticalFilter()
2691 stop=(ssize_t) MagickMin(bisect+support+0.5,(double) image->rows); in VerticalFilter()
[all …]
|
| /external/r8/src/main/java/com/android/tools/r8/bisect/ |
| D | Bisect.java | 4 package com.android.tools.r8.bisect;
6 import com.android.tools.r8.bisect.BisectOptions.Result;
74 DexApplication app = state.bisect(); in run()
|
| D | BisectState.java | 4 package com.android.tools.r8.bisect;
6 import com.android.tools.r8.bisect.BisectOptions.Result;
237 public DexApplication bisect() { in bisect() method in BisectState
|
| /external/python/cpython2/Lib/ |
| D | mhlib.py | 85 from bisect import bisect
395 i = bisect(all, anchor)
398 i = bisect(all, anchor-1)
405 i = bisect(all, begin-1)
406 j = bisect(all, end)
445 i = bisect(all, n)
452 i = bisect(all, n-1)
|
| D | bisect.py | 45 bisect = bisect_right # backward compatibility variable
|
| /external/compiler-rt/lib/sanitizer_common/scripts/ |
| D | sancov.py | 7 import bisect
160 map_idx = bisect.bisect(mem_map_keys, pc) - 1
|
| /external/toolchain-utils/binary_search_tool/ndk/ |
| D | README | 5 required to bisect a compiler problem in an arbitrary NDK app build system.
37 flavor for arm7, our compiler wrapper won't try to bisect object files meant
47 If we want to bisect for an x86-64 device we first need to provide a arch
|
| /external/python/cpython2/Lib/test/ |
| D | test_bisect.py | 16 import bisect as py_bisect
23 import bisect as c_bisect
212 self.assertEqual(self.module.bisect, self.module.bisect_right)
218 self.assertEqual(self.module.bisect(a=data, x=25, lo=1, hi=3), 2)
|
| /external/toolchain-utils/binary_search_tool/test/ |
| D | binary_search_tool_tester.py | 17 from binary_search_tool import bisect
58 class FullBisector(bisect.Bisector):
81 ret = bisect.Run(self.FullBisector({}, {}))
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| D | MullerSolver.java | 254 boolean bisect = (x < x1 && (x1 - x0) > 0.95 * (x2 - x0)) || in solve()
258 if (!bisect) { in solve()
|
| /external/clang/utils/perf-training/ |
| D | perf-helper.py | 17 import bisect
172 start_index = bisect.bisect_left(all_symbols, symbol)
|
| /external/mesa3d/src/compiler/glsl/ |
| D | lower_variable_index_to_cond_assign.cpp | 296 void bisect(unsigned begin, unsigned end, exec_list *list) in bisect() function
328 return bisect(begin, end, list); in generate()
|