| /external/skia/src/core/ |
| 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 / kMaxChildren; in CountNodes()
[all …]
|
| /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/jacoco/org.jacoco.core/src/org/jacoco/core/internal/analysis/ |
| D | LineImpl.java | 46 * Empty line without instructions or branches.
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
[all …]
|
| D | Instruction.java | 59 private int branches; field in Instruction
75 this.branches = 0; in Instruction()
94 branches++; in addBranch()
116 branches++; in addBranch()
145 * Merges information about covered branches of this instruction with
150 * @return new instance with merged branches
154 result.branches = this.branches; in merge()
161 * Creates a copy of this instruction where all outgoing branches are
166 * new branches to consider
167 * @return new instance with replaced branches
[all …]
|
| D | SourceNodeImpl.java | 103 * Increments instructions and branches by the given counter values. If a
104 * optional line number is specified the instructions and branches are added
109 * @param branches
110 * branches to add
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()
|
| 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()
58 * branches have been incremented for this method coverage node.
|
| /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
33 Branches executed:100.00% of 4
39 Branches executed:100.00% of 11
45 No branches
50 No branches
[all …]
|
| /external/llvm-project/clang-tools-extra/clang-tidy/bugprone/ |
| D | BranchCloneCheck.cpp | 35 /// Determines if the bodies of two branches in a switch statements are Type I
86 diag(IS->getBeginLoc(), "if with identical then and else branches"); in check()
93 // To find all the duplicates, we collect all the branches into a vector. in check()
94 llvm::SmallVector<const Stmt *, 4> Branches; in check() local
98 Branches.push_back(Cur->getThen()); in check()
109 Branches.push_back(Else); in check()
114 size_t N = Branches.size(); in check()
118 // We have already seen Branches[i] as a clone of an earlier branch. in check()
126 !areStatementsIdentical(Branches[i]->IgnoreContainers(), in check()
127 Branches[j]->IgnoreContainers(), Context)) in check()
[all …]
|
| /external/llvm-project/clang-tools-extra/docs/clang-tidy/checks/ |
| D | bugprone-branch-clone.rst | 6 Checks for repeated branches in ``if/else if/else`` chains, consecutive
7 repeated branches in ``switch`` statements and identical true and false
8 branches in conditional operators.
21 ``then`` and ``else`` branches are identical and the code is equivalent the
35 The check also detects repeated branches in longer ``if/else if/else`` chains
38 In ``switch`` statements the check only reports repeated branches when they are
58 Here the check reports that the ``'a'`` and ``'A'`` branches are identical
59 (and that the ``'b'`` and ``'B'`` branches are also identical), but does not
60 report that the ``default:`` branch is also identical to the first two branches.
89 Note: This check also reports situations where branches become identical only
|
| /external/llvm-project/clang-tools-extra/test/clang-tidy/checkers/ |
| D | bugprone-branch-clone.cpp | 5 // CHECK-MESSAGES: :[[@LINE-1]]:3: warning: if with identical then and else branches [bugprone-bran… in test_basic1()
16 // CHECK-MESSAGES: :[[@LINE-1]]:3: warning: if with identical then and else branches [bugprone-bran… in test_basic2()
29 // CHECK-MESSAGES: :[[@LINE-1]]:3: warning: if with identical then and else branches [bugprone-bran… in test_basic3()
80 // CHECK-MESSAGES: :[[@LINE-1]]:3: warning: if with identical then and else branches [bugprone-bran… in test_basic8()
95 // CHECK-MESSAGES: :[[@LINE-1]]:3: warning: if with identical then and else branches [bugprone-bran… in test_basic9()
127 // CHECK-MESSAGES: :[[@LINE-1]]:3: warning: if with identical then and else branches [bugprone-bran… in test_basic11()
151 // CHECK-MESSAGES: :[[@LINE-1]]:3: warning: if with identical then and else branches [bugprone-bran… in test_basic12()
201 // CHECK-MESSAGES: :[[@LINE-1]]:5: warning: if with identical then and else branches [bugprone-bran… in test_macro1()
214 // CHECK-MESSAGES: :[[@LINE-1]]:5: warning: if with identical then and else branches [bugprone-bran… in test_macro2()
224 // CHECK-MESSAGES: :[[@LINE-1]]:3: warning: if with identical then and else branches [bugprone-bran… in test_macro3()
[all …]
|
| /external/rust/crates/tokio-macros/src/ |
| D | select.rs | 8 let branches = match input.into_iter().next() { in declare_output_enum() localVariable
13 let variants = (0..branches) in declare_output_enum()
19 if branches <= 8 { in declare_output_enum()
21 } else if branches <= 16 { in declare_output_enum()
23 } else if branches <= 32 { in declare_output_enum()
25 } else if branches <= 64 { in declare_output_enum()
28 panic!("up to 64 branches supported"); in declare_output_enum()
36 // Include a `Disabled` variant signifying that all select branches in declare_output_enum()
|
| /external/angle/doc/ |
| D | ChoosingANGLEBranch.md | 11 Branches are created automatically in ANGLE to correspond to branches created in
12 Chromium. These branches are named `chromium/####`, where the number is the
13 matching Chromium branch. These branches will be created from the revision which
17 (http://src.chromium.org/viewvc/chrome/branches/2013/src/DEPS?revision=272741)
23 stable Chromium release channel build, as those branches will be deployed with
26 branches will be short-lived.
33 In order to determine which branches are used by Chromium releases, please use
40 ## Updates to release branches
44 fixes for those bugs will be applied to the ANGLE branches for uptake by
|
| /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/webrtc/docs/native-code/development/ |
| D | index.md | 36 2. Optionally you can specify how new branches should be tracked:
43 3. Alternatively, you can create new local branches like this (recommended):
128 ## Working with Release Branches
130 To see available release branches, run:
145 sync will break on sufficiently old branches. In that case, you can try using
165 For more details, read Chromium's [Working with Branches][chromium-work-branches] and
166 [Working with Release Branches][chromium-work-release-branches] pages.
261 [chromium-work-branches]: https://www.chromium.org/developers/how-tos/get-the-code/working-with-bra…
262 [chromium-work-release-branches]: https://www.chromium.org/developers/how-tos/get-the-code/working-…
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_StatelessCase.pbtxt | 19 name: "branches"
31 output = branches[0](input);
34 output = branches[1](input);
39 output = branches[nbranches-1](input);
44 This should only be used when the none of branches has stateful ops.
|
| /external/jacoco/org.jacoco.doc/docroot/doc/ |
| D | counters.html | 46 <h2>Branches (C1 Coverage)</h2>
51 branches in a method and determines the number of executed or missed branches.
53 the class files. Note that exception handling is not considered as branches
63 <li>No coverage: No branches in the line has been executed (red diamond)</li>
64 <li>Partial coverage: Only a part of the branches in the line have been
66 <li>Full coverage: All branches in the line have been executed (green diamond)</li>
97 on the number of branches (B) and the number of decision points (D):
110 JaCoCo does not consider exception handling as branches try/catch blocks will
|
| /external/swiftshader/third_party/SPIRV-Tools/test/tools/opt/ |
| D | flags.py | 62 '--eliminate-dead-branches',
86 'eliminate-dead-branches',
142 'eliminate-dead-branches',
161 'eliminate-dead-branches',
174 'eliminate-dead-branches',
182 'eliminate-dead-branches',
200 'eliminate-dead-branches',
209 'eliminate-dead-branches',
216 'eliminate-dead-branches',
248 'eliminate-dead-branches',
[all …]
|
| /external/deqp-deps/SPIRV-Tools/test/tools/opt/ |
| D | flags.py | 62 '--eliminate-dead-branches',
86 'eliminate-dead-branches',
142 'eliminate-dead-branches',
161 'eliminate-dead-branches',
174 'eliminate-dead-branches',
182 'eliminate-dead-branches',
200 'eliminate-dead-branches',
209 'eliminate-dead-branches',
216 'eliminate-dead-branches',
248 'eliminate-dead-branches',
[all …]
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/test/tools/opt/ |
| D | flags.py | 62 '--eliminate-dead-branches',
86 'eliminate-dead-branches',
142 'eliminate-dead-branches',
161 'eliminate-dead-branches',
174 'eliminate-dead-branches',
182 'eliminate-dead-branches',
200 'eliminate-dead-branches',
209 'eliminate-dead-branches',
216 'eliminate-dead-branches',
248 'eliminate-dead-branches',
[all …]
|
| /external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
| D | case_op.cc | 31 OP_REQUIRES_OK(ctx, ctx->GetAttr("branches", &unpruned_branches_)); in XlaCaseOp()
78 // We opportunistically prune out branches if the branch index is a in Compile()
81 // trivially unselected branches that cannot be compiled into HLO. in Compile()
82 std::vector<NameAttrList> branches; in Compile() local
84 std::tie(branches, branch_index) = GetPrunedBranchesAndIndex(ctx); in Compile()
86 int num_branches = branches.size(); in Compile()
127 ctx, branches[branch_idx], in Compile()
165 compiler->CompileFunction(options, branches[j], arguments, in Compile()
202 compiler->CompileFunction(options, branches[j], arguments, in Compile()
210 // Check that all branches have identical input shapes. in Compile()
[all …]
|
| /external/llvm-project/llvm/test/MC/Hexagon/PacketRules/ |
| D | endloop_branches.s | 5 # CHECK: 4:1: error: Branches cannot be in a packet with hardware loops
9 # CHECK: 8:1: error: Branches cannot be in a packet with hardware loops
13 # CHECK: 12:1: error: Branches cannot be in a packet with hardware loops
17 # CHECK: 16:1: error: Branches cannot be in a packet with hardware loops
|
| /external/llvm-project/llvm/lib/Target/PowerPC/MCTargetDesc/ |
| D | PPCFixupKinds.h | 19 // 24-bit PC relative relocation for direct branches like 'b' and 'bl'.
22 // 24-bit PC relative relocation for direct branches like 'b' and 'bl' where
26 /// 14-bit PC relative relocation for conditional branches.
29 /// 24-bit absolute relocation for direct branches like 'ba' and 'bla'.
32 /// 14-bit absolute relocation for conditional branches.
|
| /external/llvm-project/llvm/lib/Target/SystemZ/ |
| D | SystemZLongBranch.cpp | 9 // This pass makes sure that all branches are in range. There are several ways
11 // branches are in range and successively replace those that turn out not
14 // branches until no more changes are needed and a fixed point is reached.
20 // An alternative approach is to assume that all branches must be
22 // branches that, even under this pessimistic assumption, turn out to be
34 // On SystemZ, long branches are only needed for functions bigger than 64k,
39 // (1) Work out the address that each block would have if no branches
40 // need relaxing. Exit the pass early if all branches are in range
43 // (2) Work out the address that each block would have if all branches
47 // and relaxing those that need to be relaxed. For backward branches,
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/ |
| D | SystemZLongBranch.cpp | 9 // This pass makes sure that all branches are in range. There are several ways
11 // branches are in range and successively replace those that turn out not
14 // branches until no more changes are needed and a fixed point is reached.
20 // An alternative approach is to assume that all branches must be
22 // branches that, even under this pessimistic assumption, turn out to be
34 // On SystemZ, long branches are only needed for functions bigger than 64k,
39 // (1) Work out the address that each block would have if no branches
40 // need relaxing. Exit the pass early if all branches are in range
43 // (2) Work out the address that each block would have if all branches
47 // and relaxing those that need to be relaxed. For backward branches,
[all …]
|
| /external/llvm/lib/Target/SystemZ/ |
| D | SystemZLongBranch.cpp | 10 // This pass makes sure that all branches are in range. There are several ways
12 // branches are in range and successively replace those that turn out not
15 // branches until no more changes are needed and a fixed point is reached.
21 // An alternative approach is to assume that all branches must be
23 // branches that, even under this pessimistic assumption, turn out to be
35 // On SystemZ, long branches are only needed for functions bigger than 64k,
40 // (1) Work out the address that each block would have if no branches
41 // need relaxing. Exit the pass early if all branches are in range
44 // (2) Work out the address that each block would have if all branches
48 // and relaxing those that need to be relaxed. For backward branches,
[all …]
|