Home
last modified time | relevance | path

Searched full:branches (Results 1 – 25 of 1876) sorted by relevance

12345678910>>...76

/external/skia/src/core/
DSkRTree.cpp15 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/
DSkRTree.cpp24 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/
DLineImpl.java46 * 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 …]
DInstruction.java59 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 …]
DSourceNodeImpl.java103 * 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()
DMethodCoverageImpl.java45 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/swiftshader/third_party/llvm-7.0/llvm/test/tools/llvm-cov/Inputs/
Dtest_-b_-f.output3 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/test/tools/llvm-cov/Inputs/
Dtest_-b_-f.output3 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/
DChoosingANGLEBranch.md11 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/
DSourceHighlighter.java105 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/jacoco/org.jacoco.doc/docroot/doc/
Dcounters.html46 <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/llvm-7.0/llvm/test/MC/Hexagon/PacketRules/
Dendloop_branches.s5 # 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/tensorflow/tensorflow/core/api_def/base_api/
Dapi_def_Case.pbtxt18 name: "branches"
30 output = branches[0](input);
33 output = branches[1](input);
38 output = branches[nbranches-1](input);
/external/libaom/libaom/av1/encoder/
Dcnn.h47 // Times when input tensor may be copied to branches given in input_to_branches.
49 // BRANCH_INPUT: copies the input tensor to branches.
50 // BRANCH_OUTPUT: copies the convolved tensor to branches.
61 // Types of combining branches with output of current layer:
86 // layer and store for future use in branches
90 // branches 1 and 2 (where 0 represents the primary
96 // tensor to branches given in input_to_branches.
97 int branches_to_combine; // mask of branches to combine with output of
/external/llvm/lib/Target/SystemZ/
DSystemZLongBranch.cpp10 // 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-7.0/llvm/lib/Target/SystemZ/
DSystemZLongBranch.cpp10 // 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/llvm/test/CodeGen/Mips/compactbranches/
Dcompact-branch-policy.ll1 ; 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/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Mips/compactbranches/
Dcompact-branch-policy.ll1 ; 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/deqp-deps/SPIRV-Tools/test/tools/opt/
Dflags.py62 '--eliminate-dead-branches',
86 'eliminate-dead-branches',
139 'eliminate-dead-branches',
161 'eliminate-dead-branches',
169 'eliminate-dead-branches',
187 'eliminate-dead-branches',
196 'eliminate-dead-branches',
203 'eliminate-dead-branches',
235 'eliminate-dead-branches',
252 'eliminate-dead-branches',
/external/swiftshader/third_party/SPIRV-Tools/test/tools/opt/
Dflags.py62 '--eliminate-dead-branches',
86 'eliminate-dead-branches',
139 'eliminate-dead-branches',
161 'eliminate-dead-branches',
169 'eliminate-dead-branches',
187 'eliminate-dead-branches',
196 'eliminate-dead-branches',
203 'eliminate-dead-branches',
235 'eliminate-dead-branches',
252 'eliminate-dead-branches',
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/PowerPC/MCTargetDesc/
DPPCFixupKinds.h20 // 24-bit PC relative relocation for direct branches like 'b' and 'bl'.
23 /// 14-bit PC relative relocation for conditional branches.
26 /// 24-bit absolute relocation for direct branches like 'ba' and 'bla'.
29 /// 14-bit absolute relocation for conditional branches.
/external/llvm/lib/Target/PowerPC/MCTargetDesc/
DPPCFixupKinds.h20 // fixup_ppc_br24 - 24-bit PC relative relocation for direct branches like 'b'
25 /// branches.
28 /// fixup_ppc_br24abs - 24-bit absolute relocation for direct branches
33 /// branches.
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Scalar/
DSimpleLoopUnswitch.h20 /// This pass transforms loops that contain branches or switches on loop-
53 /// This pass always does trivial, full unswitching for both branches and
54 /// switches. For branches, it also always does trivial, partial unswitching.
57 /// additionally do non-trivial, full unswitching for branches and switches, and
58 /// will do non-trivial, partial unswitching for branches.
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/ARC/
DARCBranchFinalize.cpp1 //===- ARCBranchFinalize.cpp - ARC conditional branches ---------*- C++ -*-===//
10 // This pass takes existing conditional branches and expands them into longer
11 // range conditional branches.
63 "ARC finalize branches", false, false)
66 "ARC finalize branches", false, false) in INITIALIZE_PASS_DEPENDENCY()
146 std::vector<MachineInstr *> Branches; in runOnMachineFunction() local
164 Branches.push_back(&MI); in runOnMachineFunction()
/external/angle/third_party/spirv-tools/src/test/tools/opt/
Dflags.py62 '--eliminate-dead-branches',
89 'eliminate-dead-branches',
149 'eliminate-dead-branches',
171 'eliminate-dead-branches',
179 'eliminate-dead-branches',
197 'eliminate-dead-branches',
206 'eliminate-dead-branches',
213 'eliminate-dead-branches',
245 'eliminate-dead-branches',
262 'eliminate-dead-branches',

12345678910>>...76