| /third_party/skia/src/core/ |
| H A D | SkRTree.cpp | 15 std::vector<Branch> branches; in insert() local
16 branches.reserve(N); in insert()
27 branches.push_back(b); in insert()
30 fCount = (int)branches.size(); in insert()
36 n->fChildren[0] = branches[0]; in insert()
38 fRoot.fBounds = branches[0].fBounds; in insert()
41 fRoot = this->bulkLoad(&branches); in insert()
57 int SkRTree::CountNodes(int branches) { in CountNodes() argument
58 if (branches == 1) { in CountNodes()
61 int numBranches = branches / kMaxChildre in CountNodes()
93 bulkLoad(std::vector<Branch>* branches, int level) bulkLoad() argument
[all...] |
| H A D | SkRTree.h | 69 Branch bulkLoad(std::vector<Branch>* branches, int level = 0);
72 static int CountNodes(int branches);
|
| /third_party/node/deps/v8/tools/release/ |
| H A D | mergeinfo.py | 56 branches = git_execute(git_working_dir, ['branch',
60 branches = branches.splitlines()
61 return map(str.strip, branches)
63 def is_lkgr(branches):
64 return 'remotes/origin/lkgr' in branches
66 def get_first_canary(branches):
67 canaries = ([currentBranch for currentBranch in branches if
74 def get_first_v8_version(branches):
76 versions = filter(lambda branch: version_re.match(branch), branches)
[all...] |
| H A D | test_mergeinfo.py | 172 branches = self._get_branches(hash_of_first_commit);
173 self.assertTrue(mergeinfo.is_lkgr(branches))
174 branches = self._get_branches(hash_of_not_lkgr);
175 self.assertFalse(mergeinfo.is_lkgr(branches))
181 branches = self._get_branches(hash_of_first_commit);
182 self.assertEqual(mergeinfo.get_first_canary(branches), 'No Canary coverage')
187 branches = self._get_branches(hash_of_first_commit);
188 self.assertEqual(mergeinfo.get_first_canary(branches), '2345')
196 branches = self._get_branches(hash_of_first_commit);
197 self.assertEqual(mergeinfo.get_first_v8_version(branches), '
[all...] |
| H A D | common_includes.py | 244 # Get relevant remote branches, e.g. "branch-heads/3.25".
245 branches = filter(
249 return [b[13:] for b in branches]
|
| /third_party/skia/third_party/externals/tint/tools/src/cmd/roll-release/ |
| H A D | main.go | 15 // roll-release is a tool to roll changes in Tint release branches into Dawn,
16 // and create new Tint release branches.
55 type branches = map[string]plumbing.Hash type
66 %[1]v is a tool to synchronize Dawn's release branches with Tint.
68 %[1]v will scan the release branches of both Dawn and Tint, and will:
71 * Find and create missing Tint release branches, using the git hash of Tint in
94 // To create new release branches in Tint, we use 'go-git', so we need to
103 // Using in-memory repos, find all the tint and dawn release branches
104 log.Println("Inspecting dawn and tint release branches...")
106 var tintBranches, dawnBranches branches
[all...] |
| /third_party/littlefs/scripts/ |
| H A D | cov.py | 25 # TODO use explode_asserts to avoid counting assert branches?
180 'calls', 'hits', 'funcs', 'lines', 'branches'])):
182 _fields = ['calls', 'hits', 'funcs', 'lines', 'branches']
183 _sort = ['funcs', 'lines', 'branches', 'hits', 'calls']
186 'funcs': Frac, 'lines': Frac, 'branches': Frac}
190 calls=0, hits=0, funcs=0, lines=0, branches=0):
192 Int(calls), Int(hits), Frac(funcs), Frac(lines), Frac(branches))
200 self.branches + other.branches)
294 for branch in line['branches']),
[all...] |
| H A D | perf.py | 34 PERF_EVENTS = 'cycles,branch-misses,branches,cache-misses,cache-references'
121 'cycles', 'bmisses', 'branches', 'cmisses', 'caches',
124 _fields = ['cycles', 'bmisses', 'branches', 'cmisses', 'caches']
125 _sort = ['cycles', 'bmisses', 'cmisses', 'branches', 'caches']
128 'bmisses': Int, 'branches': Int,
133 cycles=0, bmisses=0, branches=0, cmisses=0, caches=0,
136 Int(cycles), Int(bmisses), Int(branches), Int(cmisses), Int(caches),
143 self.branches + other.branches,
407 'branches'
[all...] |
| /third_party/skia/third_party/externals/angle2/scripts/ |
| H A D | roll_chromium_deps.py | 214 """Returns a tuple of active,branches.
216 The 'active' is the name of the currently active branch and 'branches' is a
217 list of all branches.
220 branches = []
226 branches.append(active)
230 branches.append(branch)
231 return active, branches
583 active_branch, branches = _GetBranches()
586 if ROLL_BRANCH_NAME in branches:
|
| /third_party/mesa3d/src/amd/compiler/ |
| H A D | aco_assembler.cpp | 46 std::vector<std::pair<int, SOPP_instruction*>> branches; member
173 ctx.branches.emplace_back(out.size(), &sopp); in emit_instruction()
849 auto branch_it = std::find_if(ctx.branches.begin(), ctx.branches.end(), in insert_code()
853 /* Update the locations of branches */ in insert_code()
854 for (; branch_it != ctx.branches.end(); ++branch_it) in insert_code()
877 ctx.branches.begin(), ctx.branches.end(), in fix_branches_gfx10()
883 gfx10_3f_bug = buggy_branch_it != ctx.branches.end(); in fix_branches_gfx10()
907 /* for conditional branches, ski in emit_long_jump()
[all...] |
| /third_party/lz4/tests/ |
| H A D | test-lz4-speed.py | 108 branches = execute('git branch -rl', verbose)
110 for line in branches:
330 branches = git_get_branches() variable
331 for branch in branches:
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| H A D | transformation_flatten_conditional_branch.cpp | 224 std::vector<uint32_t> branches = {2, 1}; in Apply() local
228 branches = {1, 2}; in Apply()
233 // Get the ids of the starting blocks of the first and last branches to be in Apply()
238 branch_instruction->GetSingleWordInOperand(branches[1]); in Apply()
240 branch_instruction->GetSingleWordInOperand(branches[0]); in Apply()
245 // If the OpBranchConditional instruction in the header branches to the same in Apply()
269 // Adjust the conditional branches by enclosing problematic instructions in Apply()
271 for (uint32_t branch : branches) { in Apply()
361 if (next_block_id == convergence_block_id && branch == branches[1]) { in Apply()
388 // that the last block in such branch unconditionally branches t in Apply()
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| H A D | transformation_flatten_conditional_branch.cpp | 224 std::vector<uint32_t> branches = {2, 1}; in Apply() local
228 branches = {1, 2}; in Apply()
233 // Get the ids of the starting blocks of the first and last branches to be in Apply()
238 branch_instruction->GetSingleWordInOperand(branches[1]); in Apply()
240 branch_instruction->GetSingleWordInOperand(branches[0]); in Apply()
245 // If the OpBranchConditional instruction in the header branches to the same in Apply()
269 // Adjust the conditional branches by enclosing problematic instructions in Apply()
271 for (uint32_t branch : branches) { in Apply()
361 if (next_block_id == convergence_block_id && branch == branches[1]) { in Apply()
388 // that the last block in such branch unconditionally branches t in Apply()
[all...] |
| /third_party/spirv-tools/source/fuzz/ |
| H A D | transformation_flatten_conditional_branch.cpp | 224 std::vector<uint32_t> branches = {2, 1}; in Apply() local
228 branches = {1, 2}; in Apply()
233 // Get the ids of the starting blocks of the first and last branches to be in Apply()
238 branch_instruction->GetSingleWordInOperand(branches[1]); in Apply()
240 branch_instruction->GetSingleWordInOperand(branches[0]); in Apply()
245 // If the OpBranchConditional instruction in the header branches to the same in Apply()
269 // Adjust the conditional branches by enclosing problematic instructions in Apply()
271 for (uint32_t branch : branches) { in Apply()
361 if (next_block_id == convergence_block_id && branch == branches[1]) { in Apply()
388 // that the last block in such branch unconditionally branches t in Apply()
[all...] |
| /third_party/lzma/CPP/7zip/ |
| H A D | warn_gcc.mak | 26 -Wduplicated-branches \
|
| /third_party/littlefs/runners/ |
| H A D | test_runner.c | 607 struct test_seen_branch *branches; member
636 if (seen->branches[i].define == define) { in test_seen_insert()
637 branch = &seen->branches[i]; in test_seen_insert()
646 (void**)&seen->branches, in test_seen_insert()
662 test_seen_cleanup(&seen->branches[i].branch); in test_seen_cleanup()
664 free(seen->branches); in test_seen_cleanup()
1676 lfs_emubd_t *branches; member
1689 // append to branches in powerloss_exhaustive_branch()
1691 (void**)&state->branches, in powerloss_exhaustive_branch()
1722 .branches in run_powerloss_exhaustive_layer()
[all...] |
| H A D | bench_runner.c | 627 struct bench_seen_branch *branches; member
656 if (seen->branches[i].define == define) { in bench_seen_insert()
657 branch = &seen->branches[i]; in bench_seen_insert()
666 (void**)&seen->branches, in bench_seen_insert()
682 bench_seen_cleanup(&seen->branches[i].branch); in bench_seen_cleanup()
684 free(seen->branches); in bench_seen_cleanup()
|
| /third_party/node/test/fixtures/wpt/streams/resources/ |
| H A D | rs-test-templates.js | 646 'the cancel reason should be an array containing those from the branches');
658 }, `${label}: canceling both branches should aggregate the cancel reasons into an array`);
670 'the cancel reason should be an array containing those from the branches');
682 }, `${label}: canceling both branches in reverse order should aggregate the cancel reasons into an array`);
699 }, `${label}: failing to cancel the original stream should cause cancel() to reject on branches`);
719 }, `${label}: erroring a teed stream should properly handle canceled branches`);
|
| /third_party/lzma/C/ |
| H A D | warn_gcc.mak | 32 -Wduplicated-branches \
|
| /third_party/ffmpeg/libavcodec/x86/ |
| H A D | lossless_audiodsp.asm | 154 ; linear is faster than branch tree or jump table, because the branches taken are cyclic (i.e. predictable)
|
| /third_party/ffmpeg/libavcodec/ |
| H A D | wavpackenc.c | 725 int term, branches = s->num_branches - depth; in recurse_mono() local
729 if (branches < 1 || depth + 1 == info->nterms) in recurse_mono()
730 branches = 1; in recurse_mono()
737 if (term == 17 && branches == 1 && depth + 1 < info->nterms) in recurse_mono()
762 while (depth + 1 < info->nterms && branches--) { in recurse_mono()
1670 int term, branches = s->num_branches - depth; in recurse_stereo() local
1674 if (branches < 1 || depth + 1 == info->nterms) in recurse_stereo()
1675 branches = 1; in recurse_stereo()
1687 if (term == 17 && branches == 1 && depth + 1 < info->nterms) in recurse_stereo()
1716 while (depth + 1 < info->nterms && branches in recurse_stereo()
[all...] |
| /third_party/mesa3d/src/freedreno/.gitlab-ci/traces/ |
| H A D | afuc_test.asm | 112 ; Demonstrates/tests comparisons and conditional branches. This also
|
| /third_party/tzdata/ |
| H A D | Makefile | 318 -Wduplicated-branches -Wduplicated-cond \
|