| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/analysis/ |
| D | LineImpl.java | 51 final CounterImpl branches) { in getInstance() argument
54 final int bm = branches.getMissedCount(); in getInstance()
55 final int bc = branches.getCoveredCount(); in getInstance()
60 return new Var(instructions, branches); in getInstance()
67 Var(final CounterImpl instructions, final CounterImpl branches) { in Var() argument
68 super(instructions, branches); in Var()
73 final ICounter branches) { in increment() argument
75 this.branches = this.branches.increment(branches); in increment()
91 final ICounter branches) { in increment() argument
93 this.branches.increment(branches)); in increment()
[all …]
|
| D | MethodCoverageImpl.java | 45 public void increment(final ICounter instructions, final ICounter branches, in increment() argument
47 super.increment(instructions, branches, line); in increment()
49 if (branches.getTotalCount() > 1) { in increment()
50 final int c = Math.max(0, branches.getCoveredCount() - 1); in increment()
51 final int m = Math.max(0, branches.getTotalCount() - c - 1); in increment()
|
| D | SourceNodeImpl.java | 114 public void increment(final ICounter instructions, final ICounter branches, in increment() argument
117 incrementLine(instructions, branches, line); in increment()
120 branchCounter = branchCounter.increment(branches); in increment()
124 final ICounter branches, final int line) { in incrementLine() argument
129 lines[line - offset] = l.increment(instructions, branches); in incrementLine()
|
| /external/skqp/src/core/ |
| D | SkRTree.cpp | 24 SkTDArray<Branch> branches; in insert() local
25 branches.setReserve(N); in insert()
33 Branch* b = branches.push(); in insert()
38 fCount = branches.count(); in insert()
44 n->fChildren[0] = branches[0]; in insert()
46 fRoot.fBounds = branches[0].fBounds; in insert()
49 fRoot = this->bulkLoad(&branches); in insert()
64 int SkRTree::CountNodes(int branches, SkScalar aspectRatio) { in CountNodes() argument
65 if (branches == 1) { in CountNodes()
68 int numBranches = branches / kMaxChildren; in CountNodes()
[all …]
|
| /external/skia/src/core/ |
| D | SkRTree.cpp | 24 SkTDArray<Branch> branches; in insert() local
25 branches.setReserve(N); in insert()
33 Branch* b = branches.push(); in insert()
38 fCount = branches.count(); in insert()
44 n->fChildren[0] = branches[0]; in insert()
46 fRoot.fBounds = branches[0].fBounds; in insert()
49 fRoot = this->bulkLoad(&branches); in insert()
64 int SkRTree::CountNodes(int branches, SkScalar aspectRatio) { in CountNodes() argument
65 if (branches == 1) { in CountNodes()
68 int numBranches = branches / kMaxChildren; in CountNodes()
[all …]
|
| /external/v8/tools/release/ |
| D | mergeinfo.py | 53 branches = git_execute(git_working_dir, ['branch',
57 branches = branches.splitlines()
58 return map(str.strip, branches)
60 def is_lkgr(branches): argument
61 return 'remotes/origin/lkgr' in branches
63 def get_first_canary(branches): argument
64 canaries = ([currentBranch for currentBranch in branches if
71 def get_first_v8_version(branches): argument
73 versions = filter(lambda branch: version_re.match(branch), branches)
85 branches = get_branches_for_commit(git_working_dir, hash_to_search)
[all …]
|
| 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 …]
|
| /external/llvm/test/tools/llvm-cov/Inputs/ |
| D | test_-b_-f.output | 3 No branches
8 No branches
13 No branches
18 No branches
23 No branches
28 No branches
45 No branches
50 No branches
62 No branches
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/tools/llvm-cov/Inputs/ |
| D | test_-b_-f.output | 3 No branches
8 No branches
13 No branches
18 No branches
23 No branches
28 No branches
45 No branches
50 No branches
62 No branches
|
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/page/ |
| D | SourceHighlighter.java | 105 final ICounter branches = line.getBranchCounter(); in highlight() local
106 switch (branches.getStatus()) { in highlight()
109 "All %2$d branches missed.", branches); in highlight()
112 "All %2$d branches covered.", branches); in highlight()
115 "%1$d of %2$d branches missed.", branches); in highlight()
123 final ICounter branches) throws IOException { in span() argument
125 final Integer missed = Integer.valueOf(branches.getMissedCount()); in span()
126 final Integer total = Integer.valueOf(branches.getTotalCount()); in span()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/MC/ARM/ |
| D | thumb2-branches.s | 4 @ unconditional branches accept narrow suffix and encode to short encodings
14 @ unconditional branches accept wide suffix and encode to wide encodings
28 @ unconditional branches without width suffix encode depending of offset size
46 @ unconditional branches with width narrow suffix in IT block
60 @ unconditional branches with wide suffix in IT block
82 @ conditional branches accept narrow suffix and encode to short encodings
92 @ unconditional branches accept wide suffix and encode to wide encodings
106 @ unconditional branches without width suffix encode depending of offset size
147 @ unconditional branches accept narrow suffix and encode to short encodings
157 @ unconditional branches accept wide suffix and encode to wide encodings
[all …]
|
| /external/llvm/test/MC/ARM/ |
| D | thumb2-branches.s | 4 @ unconditional branches accept narrow suffix and encode to short encodings
14 @ unconditional branches accept wide suffix and encode to wide encodings
28 @ unconditional branches without width suffix encode depending of offset size
46 @ unconditional branches with width narrow suffix in IT block
60 @ unconditional branches with wide suffix in IT block
82 @ conditional branches accept narrow suffix and encode to short encodings
92 @ unconditional branches accept wide suffix and encode to wide encodings
106 @ unconditional branches without width suffix encode depending of offset size
147 @ unconditional branches accept narrow suffix and encode to short encodings
157 @ unconditional branches accept wide suffix and encode to wide encodings
[all …]
|
| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
| D | Instruction.java | 28 private int branches; field in Instruction
47 this.branches = 0; in Instruction()
62 branches++; in addBranch()
121 return branches; in getBranches()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/release/ |
| D | tag.sh | 41 if svn ls $base_url/$proj/branches/release_$branch_release > /dev/null 2>&1 ; then
46 $base_url/$proj/branches/release_$branch_release
51 $base_url/$proj/branches/release_$branch_release
64 $base_url/$proj/branches/release_$branch_release \
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Case.pbtxt | 18 name: "branches"
30 output = branches[0](input);
33 output = branches[1](input);
38 output = branches[nbranches-1](input);
|
| /external/llvm/utils/release/ |
| D | tag.sh | 41 if svn ls $base_url/$proj/branches/release_$branch_release > /dev/null 2>&1 ; then
46 $base_url/$proj/branches/release_$branch_release
51 $base_url/$proj/branches/release_$branch_release
64 $base_url/$proj/branches/release_$branch_release \
|
| /external/tensorflow/tensorflow/lite/experimental/kernels/ |
| D | ctc_beam_search.h | 185 std::unique_ptr<std::vector<BeamEntry*>> branches(leaves_.Extract()); in Decode()
187 for (int i = 0; i < branches->size(); ++i) { in Decode()
188 BeamEntry* entry = (*branches)[i]; in Decode()
277 std::unique_ptr<std::vector<BeamEntry*>> branches(leaves_.Extract()); in Step()
280 for (BeamEntry* b : *branches) { in Step()
285 for (BeamEntry* b : *branches) { in Step()
319 for (BeamEntry* b : *branches) { in Step()
418 std::unique_ptr<std::vector<BeamEntry*>> branches(top_branches.Extract()); in TopPaths()
421 BeamEntry* e((*branches)[i]); in TopPaths()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Mips/compactbranches/ |
| D | compact-branch-policy.ll | 1 ; Check that -mips-compact-branches={never,optimal,always} is accepted and honoured.
2 ; RUN: llc -march=mips -mcpu=mips32r6 -mips-compact-branches=never < %s | FileCheck %s -check-prefi…
3 ; RUN: llc -march=mips -mcpu=mips32r6 -mips-compact-branches=optimal < %s | FileCheck %s -check-pre…
4 ; RUN: llc -march=mips -mcpu=mips32r6 -mips-compact-branches=always < %s | FileCheck %s -check-pref…
|
| /external/llvm/test/CodeGen/Mips/compactbranches/ |
| D | compact-branch-policy.ll | 1 ; Check that -mips-compact-branches={never,optimal,always} is accepted and honoured.
2 ; RUN: llc -march=mips -mcpu=mips32r6 -mips-compact-branches=never < %s | FileCheck %s -check-prefi…
3 ; RUN: llc -march=mips -mcpu=mips32r6 -mips-compact-branches=optimal < %s | FileCheck %s -check-pre…
4 ; RUN: llc -march=mips -mcpu=mips32r6 -mips-compact-branches=always < %s | FileCheck %s -check-pref…
|
| /external/tensorflow/tensorflow/core/util/ctc/ |
| D | ctc_beam_search.h | 188 std::unique_ptr<std::vector<BeamEntry*>> branches(leaves_.Extract()); in Decode()
190 for (int i = 0; i < branches->size(); ++i) { in Decode()
191 BeamEntry* entry = (*branches)[i]; in Decode()
280 std::unique_ptr<std::vector<BeamEntry*>> branches(leaves_.Extract()); in Step()
283 for (BeamEntry* b : *branches) { in Step()
288 for (BeamEntry* b : *branches) { in Step()
322 for (BeamEntry* b : *branches) { in Step()
420 std::unique_ptr<std::vector<BeamEntry*>> branches(top_branches.Extract()); in TopPaths()
423 BeamEntry* e((*branches)[i]); in TopPaths()
|
| /external/llvm/test/CodeGen/ARM/ |
| D | indirectbr-3.ll | 4 ; for blocks with indirect branches, the IfConverter could end up deleting
5 ; blocks that were the destinations of indirect branches, leaving branches to
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/ |
| D | indirectbr-3.ll | 5 ; for blocks with indirect branches, the IfConverter could end up deleting
6 ; blocks that were the destinations of indirect branches, leaving branches to
|
| /external/toolchain-utils/deprecated/repo_to_repo_files/ |
| D | gcc-branches_google_main.json.rtr | 6 "branches/google/main"
14 "branch": "gcc.gnu.org/branches/google/main",
|
| D | gcc-branches_google_4_7.json.rtr | 6 "branches/google/gcc-4_7-mobile"
18 "branch": "gcc.gnu.org/branches/google/gcc-4_7-mobile",
|
| /external/webrtc/tools/autoroller/ |
| D | roll_chromium_revision.py | 125 branches = []
131 branches.append(active)
135 branches.append(branch)
136 return active, branches
331 active_branch, branches = _GetBranches()
334 if ROLL_BRANCH_NAME in branches:
|