Home
last modified time | relevance | path

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

12345678910>>...42

/external/skia/src/core/
DSkRTree.cpp23 SkTDArray<Branch> branches; in insert() local
24 branches.setReserve(N); in insert()
32 Branch* b = branches.push(); in insert()
37 fCount = branches.count(); in insert()
43 n->fChildren[0] = branches[0]; in insert()
45 fRoot.fBounds = branches[0].fBounds; in insert()
48 fRoot = this->bulkLoad(&branches); in insert()
63 int SkRTree::CountNodes(int branches, SkScalar aspectRatio) { in CountNodes() argument
64 if (branches == 1) { in CountNodes()
67 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 …]
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/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/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.core/src/org/jacoco/core/internal/flow/
DInstruction.java22 private int branches; field in Instruction
36 this.branches = 0; in Instruction()
44 branches++; in addBranch()
82 * Returns the total number of branches starting from this instruction.
84 * @return total number of branches
87 return branches; in getBranches()
91 * Returns the number of covered branches starting from this instruction.
93 * @return number of covered branches
/external/v8/tools/release/
Dmergeinfo.py53 branches = git_execute(git_working_dir, ['branch',
57 branches = branches.splitlines()
58 return map(str.strip, branches)
61 branches = get_branches_for_commit(git_working_dir, hash_to_search)
62 return 'remotes/origin/lkgr' in branches
65 branches = get_branches_for_commit(git_working_dir, hash_to_search)
66 canaries = ([currentBranch for currentBranch in branches if
Dreleases.py6 # This script retrieves the history of all V8 branches and
61 r"A \/tags\/([^\s]+) \(from \/branches\/bleeding_edge\:(\d+)\)")
65 def SortBranches(branches): argument
66 """Sort branches with version number names."""
67 return sorted(branches, key=SortingKey, reverse=True)
243 # Follow branches only until their creation point.
266 branches = map(
271 for b in branches:
394 # Filter out irrelevant branches.
395 branches = filter(lambda r: re.match(r"branch-heads/\d+", r),
[all …]
/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/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 …]
DSystemZInstrInfo.h69 // An instruction that branches on the current value of CC.
72 // An instruction that peforms a 32-bit signed comparison and branches
76 // An instruction that peforms a 32-bit unsigned comparison and branches
80 // An instruction that peforms a 64-bit signed comparison and branches
84 // An instruction that peforms a 64-bit unsigned comparison and branches
88 // An instruction that decrements a 32-bit register and branches if
92 // An instruction that decrements a 64-bit register and branches if
/external/llvm/test/MC/ARM/
Dthumb2-branches.s4 @ 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/mesa3d/src/gallium/drivers/r300/compiler/
Dradeon_emulate_branches.c52 struct branch_info * Branches; member
64 s->Branches, s->BranchCount, s->BranchReserved, 1); in handle_if()
68 branch = &s->Branches[s->BranchCount++]; in handle_if()
73 * it at ENDIF time and it might be overwritten in both branches. */ in handle_if()
93 rc_error(s->C, "Encountered ELSE outside of branches"); in handle_else()
99 branch = &s->Branches[s->BranchCount - 1]; in handle_else()
204 rc_error(s->C, "Encountered ENDIF outside of branches"); in handle_endif()
210 branch = &s->Branches[s->BranchCount - 1]; in handle_endif()
305 * Remove branch instructions; instead, execute both branches
/external/clang/lib/Format/
DUnwrappedLineParser.h184 // of preprocessor branches that can be taken.
186 // branches) for each nesting level of preprocessor branches.
188 // branches during one pass over the code.
191 // Contains the current branch (#if, #else or one of the #elif branches)
195 // Contains the maximum number of branches at each nesting level.
198 // Contains the number of branches per nesting level we are currently
/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/valgrind/docs/internals/
Drelease-HOWTO.txt155 branches too. Useful examples (X.Y.0 major release):
159 svn copy trunk branches/VALGRIND_3_3_BRANCH
163 svn copy trunk branches/VEX_3_3_BRANCH
169 cd branches/VALGRIND_3_3_BRANCH
171 "VEX svn://svn.valgrind.org/vex/branches/VEX_3_3_BRANCH" .
176 svn copy branches/VEX_3_6_BRANCH tags/VEX_3_6_1
179 svn copy branches/VALGRIND_3_6_BRANCH tags/VALGRIND_3_6_1
/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/valgrind/none/tests/mips32/
DMakefile.am8 branches.stdout.exp branches.stderr.exp branches.vgtest \
42 branches \ program
/external/llvm/utils/release/
Dtag.sh11 # Create branches and release candidates for the LLVM release.
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/llvm/test/CodeGen/SystemZ/Large/
Dbranch-range-01.py1 # Test normal conditional branches in cases where the sheer number of
2 # instructions causes some branches to be out of range.
22 # length into account -- which is 4 bytes for short branches -- so the final
23 # (0x28 - 4) / 8 == 4 blocks can use short branches. The ones after "main:"
24 # do not, so the first 0x28 / 8 == 5 can use short branches. However,
/external/webrtc/tools/autoroller/
Droll_chromium_revision.py119 """Returns a tuple of active,branches.
121 The 'active' is the name of the currently active branch and 'branches' is a
122 list of all branches.
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:
/external/valgrind/none/tests/mips64/
DMakefile.am12 branches.stdout.exp branches.stderr.exp branches.vgtest \
67 branches \ program
/external/llvm/lib/Target/Mips/
DMipsInstrInfo.cpp77 // for both int and fp branches, the last explicit operand is the in AnalyzeCondBr()
124 // Unconditional branches: 0 in InsertBranch()
125 // Floating point branches: 1 (opc) in InsertBranch()
158 // Up to 2 branches are removed. in RemoveBranch()
159 // Note that indirect branches are not removed. in RemoveBranch()
191 // This block ends with no branches (it just falls through to its succ). in analyzeBranch()
231 // If we reached here, there are two branches. in analyzeBranch()
272 // microMIPS has NE,EQ branches that do not have delay slots provided one in getEquivalentCompactForm()
401 // Certain branches have two forms: e.g beq $1, $zero, dst vs beqz $1, dest in genInstrWithNewOpc()
449 // For MIPSR6 and microMIPS branches with an explicit zero operand, copy in genInstrWithNewOpc()
/external/clang/test/Driver/
Dmips-features.c119 // -mcompact-branches=never
121 // RUN: -mcompact-branches=never 2>&1 \
123 // CHECK-CBNEVER: "-mllvm" "-mips-compact-branches=never"
125 // -mcompact-branches=optimal
127 // RUN: -mcompact-branches=optimal 2>&1 \
129 // CHECK-CBOPTIMAL: "-mllvm" "-mips-compact-branches=optimal"
131 // -mcompact-branches=always
133 // RUN: -mcompact-branches=always 2>&1 \
135 // CHECK-CBALWAYS: "-mllvm" "-mips-compact-branches=always"

12345678910>>...42