| /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 remainder = branches % kMaxChildren; in CountNodes()
[all …]
|
| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/analysis/ |
| D | LineImpl.java | 48 * Empty line without instructions or branches.
53 final CounterImpl branches) { in getInstance() argument
56 final int bm = branches.getMissedCount(); in getInstance()
57 final int bc = branches.getCoveredCount(); in getInstance()
62 return new Var(instructions, branches); in getInstance()
69 Var(final CounterImpl instructions, final CounterImpl branches) { in Var() argument
70 super(instructions, branches); in Var()
75 final ICounter branches) { in increment() argument
77 this.branches = this.branches.increment(branches); in increment()
93 final ICounter branches) { in increment() argument
[all …]
|
| D | Instruction.java | 60 private int branches; field in Instruction
76 this.branches = 0; in Instruction()
95 branches++; in addBranch()
117 branches++; in addBranch()
146 * Merges information about covered branches of this instruction with
151 * @return new instance with merged branches
155 result.branches = this.branches; in merge()
162 * Creates a copy of this instruction where all outgoing branches are
167 * new branches to consider
168 * @return new instance with replaced branches
[all …]
|
| D | SourceNodeImpl.java | 104 * Increments instructions and branches by the given counter values. If a
105 * optional line number is specified the instructions and branches are added
110 * @param branches
111 * branches to add
115 public void increment(final ICounter instructions, final ICounter branches, in increment() argument
118 incrementLine(instructions, branches, line); in increment()
121 branchCounter = branchCounter.increment(branches); in increment()
125 final ICounter branches, final int line) { in incrementLine() argument
130 lines[line - offset] = l.increment(instructions, branches); in incrementLine()
|
| D | MethodCoverageImpl.java | 46 public void increment(final ICounter instructions, final ICounter branches, in increment() argument
48 super.increment(instructions, branches, line); in increment()
50 if (branches.getTotalCount() > 1) { in increment()
51 final int c = Math.max(0, branches.getCoveredCount() - 1); in increment()
52 final int m = Math.max(0, branches.getTotalCount() - c - 1); in increment()
59 * 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/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 | 106 final ICounter branches = line.getBranchCounter(); in highlight() local
107 switch (branches.getStatus()) { in highlight()
110 "All %2$d branches missed.", branches); in highlight()
113 "All %2$d branches covered.", branches); in highlight()
116 "%1$d of %2$d branches missed.", branches); in highlight()
124 final ICounter branches) throws IOException { in span() argument
126 final Integer missed = Integer.valueOf(branches.getMissedCount()); in span()
127 final Integer total = Integer.valueOf(branches.getTotalCount()); in span()
|
| /external/openthread/third_party/mbedtls/repo/ |
| D | CONTRIBUTING.md | 28 …n development branch and in LTS (Long Term Support) branches, as described in [BRANCHES.md](BRANCH…
40 Long Term Support Branches
42 …branches, which are maintained continuously for a given period. The LTS branches are provided to a…
44 When backporting to these branches please observe the following rules:
50 It would be highly appreciated if contributions are backported to LTS branches in addition to the […
52 The list of maintained branches can be found in the [Current Branches section
53 of BRANCHES.md](BRANCHES.md#current-branches).
55 Currently maintained LTS branches are:
|
| D | BRANCHES.md | 1 # Maintained branches
3 At any point in time, we have a number of maintained branches consisting of:
11 - One or more long-time support (LTS) branches:
16 also maintain ABI compatibility within LTS branches; see the next section for
33 For the LTS branches, additionally we try very hard to also maintain ABI
45 ## Current Branches
47 The following branches are currently maintained:
|
| /external/mbedtls/ |
| D | CONTRIBUTING.md | 13 - [Backports](#long-term-support-branches): provide a backport if needed (it's fine to wait until t…
33 …n development branch and in LTS (Long Term Support) branches, as described in [BRANCHES.md](BRANCH…
45 Long Term Support Branches
47 …branches, which are maintained continuously for a given period. The LTS branches are provided to a…
49 When backporting to these branches please observe the following rules:
55 It would be highly appreciated if contributions are backported to LTS branches in addition to the […
57 The list of maintained branches can be found in the [Current Branches section
58 of BRANCHES.md](BRANCHES.md#current-branches).
|
| D | BRANCHES.md | 1 # Maintained branches
3 At any point in time, we have a number of maintained branches, currently consisting of:
12 - One or more long-time support (LTS) branches: these only get bug fixes and
16 We retain a number of historical branches, whose names are prefixed by `archive/`,
18 These branches will not receive any changes or updates.
24 ABI compatibility within LTS branches; see the next section for details.
82 ## Long-time support branches
84 For the LTS branches, additionally we try very hard to also maintain ABI
96 ## Current Branches
98 The following branches are currently maintained:
|
| D | SECURITY.md | 16 ## Maintained branches
18 Only the maintained branches, as listed in [`BRANCHES.md`](BRANCHES.md),
|
| /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):
144 ## Working with Release Branches
146 To see available release branches, run:
161 sync will break on sufficiently old branches. In that case, you can try using
181 For more details, read Chromium's [Working with Branches][chromium-work-branches] and
182 [Working with Release Branches][chromium-work-release-branches] pages.
184 [Chromium Dashboard][https://chromiumdash.appspot.com/branches].
283 [chromium-work-branches]: https://www.chromium.org/developers/how-tos/get-the-code/working-with-bra…
284 [chromium-work-release-branches]: https://www.chromium.org/developers/how-tos/get-the-code/working-…
|
| /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/webrtc/tools_webrtc/version_updater/ |
| D | update_version.py | 37 active_branch, branches = _GetBranches()
40 if UPDATE_BRANCH_NAME in branches:
56 """Returns a tuple (active, branches).
59 'branches' is the list of all branches.
63 branches = []
69 branches.append(active)
73 branches.append(branch)
74 return active, branches
|
| /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/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/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/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/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 …]
|
| /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/libaom/av1/encoder/ |
| D | cnn.h | 48 // Times when input tensor may be copied to branches given in input_to_branches.
50 // BRANCH_INPUT: copies the input tensor to branches.
51 // BRANCH_OUTPUT: copies the convolved tensor to branches.
62 // Types of combining branches with output of current layer:
87 // layer and store for future use in branches
91 // branches 1 and 2 (where 0 represents the primary
97 // tensor to branches given in input_to_branches.
98 int branches_to_combine; // mask of branches to combine with output of
|
| /external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
| D | case_op.cc | 32 OP_REQUIRES_OK(ctx, ctx->GetAttr("branches", &unpruned_branches_)); in XlaCaseOp()
83 // We opportunistically prune out branches if the branch index is a in Compile()
86 // trivially unselected branches that cannot be compiled into HLO. in Compile()
87 std::vector<NameAttrList> branches; in Compile() local
89 std::tie(branches, branch_index) = GetPrunedBranchesAndIndex(ctx); in Compile()
91 int num_branches = branches.size(); in Compile()
132 ctx, branches[branch_idx], in Compile()
163 compiler->CompileFunction(options, branches[j], arguments, in Compile()
204 compiler->CompileFunction(options, branches[j], arguments, in Compile()
212 // Check that all branches have identical input shapes. in Compile()
[all …]
|