Searched refs:Branch (Results 1 - 25 of 81) sorted by relevance

1234

/external/chromium_org/third_party/skia/src/core/
H A DSkRTree.h100 struct Branch { struct in class:SkRTree
117 Branch* child(size_t index) {
118 return reinterpret_cast<Branch*>(this + 1) + index;
127 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) const {
135 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) {
142 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) {
154 Branch* inser
[all...]
H A DSkRTree.cpp32 , fNodeSize(sizeof(Node) + sizeof(Branch) * maxChildren)
53 Branch newBranch;
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
131 SkRTree::Branch* SkRTree::insert(Node* root, Branch* branch, uint16_t level) {
132 Branch* toInsert = branch;
145 Branch* toDivide = SkNEW_ARRAY(Branch, fMaxChildren + 1);
176 int SkRTree::chooseSubtree(Node* root, Branch* branch) {
237 int SkRTree::distributeChildren(Branch* childre
[all...]
/external/skia/src/core/
H A DSkRTree.h100 struct Branch { struct in class:SkRTree
117 Branch* child(size_t index) {
118 return reinterpret_cast<Branch*>(this + 1) + index;
127 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) const {
135 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) {
142 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) {
154 Branch* inser
[all...]
H A DSkRTree.cpp32 , fNodeSize(sizeof(Node) + sizeof(Branch) * maxChildren)
53 Branch newBranch;
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
131 SkRTree::Branch* SkRTree::insert(Node* root, Branch* branch, uint16_t level) {
132 Branch* toInsert = branch;
145 Branch* toDivide = SkNEW_ARRAY(Branch, fMaxChildren + 1);
176 int SkRTree::chooseSubtree(Node* root, Branch* branch) {
237 int SkRTree::distributeChildren(Branch* childre
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DUninitializedValues.h32 struct Branch { struct in class:clang::UninitUse
46 SmallVector<Branch, 2> UninitBranches;
52 void addUninitBranch(Branch B) {
75 typedef SmallVectorImpl<Branch>::const_iterator branch_iterator;
/external/llvm/lib/Target/SystemZ/
H A DSystemZElimCompare.cpp183 MachineInstr *Branch = CCUsers[0];
184 if (Branch->getOpcode() != SystemZ::BRC ||
185 Branch->getOperand(0).getImm() != SystemZ::CCMASK_ICMP ||
186 Branch->getOperand(1).getImm() != SystemZ::CCMASK_CMP_NE)
191 // Compare and Branch.
193 MachineBasicBlock::iterator MBBI = Compare, MBBE = Branch;
198 // The transformation is OK. Rebuild Branch as a BRCT(G).
199 MachineOperand Target(Branch->getOperand(2));
200 Branch->RemoveOperand(2);
201 Branch
[all...]
H A DSystemZLongBranch.cpp1 //===-- SystemZLongBranch.cpp - Branch lengthening for SystemZ ------------===//
98 MachineInstr *Branch; member in struct:__anon22441::TerminatorInfo
106 // If Branch is nonnull, this is the number of the target block,
110 // If Branch is nonnull, this is the length of the longest relaxed form,
114 TerminatorInfo() : Branch(0), Size(0), TargetBlock(0), ExtraRelaxSize(0) {}
137 return "SystemZ Long Branch";
243 Terminator.Branch = MI;
299 if (!Terminator.Branch)
378 MachineInstr *Branch = Terminator.Branch; local
[all...]
H A DSystemZInstrInfo.cpp164 SystemZII::Branch Branch(getBranchInfo(I));
165 if (!Branch.Target->isMBB())
169 if (Branch.Type != SystemZII::BranchNormal)
172 if (Branch.CCMask == SystemZ::CCMASK_ANY) {
175 TBB = Branch.Target->getMBB();
187 if (MBB.isLayoutSuccessor(Branch.Target->getMBB())) {
195 TBB = Branch.Target->getMBB();
203 TBB = Branch.Target->getMBB();
204 Cond.push_back(MachineOperand::CreateImm(Branch
[all...]
H A DSystemZInstrInfo.h86 struct Branch { struct in namespace:llvm::SystemZII
99 Branch(BranchType type, unsigned ccValid, unsigned ccMask, function in struct:llvm::SystemZII::Branch
194 SystemZII::Branch getBranchInfo(const MachineInstr *MI) const;
/external/v8/src/mips/
H A Dic-mips.cc56 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_OBJECT_TYPE));
57 __ Branch(global_object, eq, type, Operand(JS_BUILTINS_OBJECT_TYPE));
58 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_PROXY_TYPE));
83 __ Branch(miss, lt, scratch1, Operand(FIRST_SPEC_OBJECT_TYPE));
94 __ Branch(miss, ne, scratch1, Operand(zero_reg));
99 __ Branch(miss, ne, scratch1, Operand(scratch0));
150 __ Branch(miss, ne, at, Operand(zero_reg));
204 __ Branch(miss, ne, at, Operand(zero_reg));
280 __ Branch(slow, ne, at, Operand(zero_reg));
287 __ Branch(slo
[all...]
H A Dbuiltins-mips.cc187 __ Branch(&entry);
192 __ Branch(&loop, lt, scratch1, Operand(scratch2));
297 __ Branch(&entry);
303 __ Branch(&loop, lt, elements_array_storage, Operand(elements_array_end));
329 __ Branch(&argc_one_or_more, ne, a0, Operand(zero_reg));
348 __ Branch(&argc_two_or_more, ne, a0, Operand(1));
352 __ Branch(&not_empty_array, ne, a2, Operand(zero_reg));
355 __ Branch(&empty_array);
359 __ Branch(call_generic_code, eq, a3, Operand(zero_reg));
364 __ Branch(call_generic_cod
[all...]
H A Dcodegen-mips.cc117 __ Branch(&only_change_map, eq, at, Operand(t0));
171 __ Branch(&entry);
183 __ Branch(&done);
188 __ Branch(fail);
217 __ Branch(&entry);
233 __ Branch(&loop, lt, t3, Operand(t2));
257 __ Branch(&only_change_map, eq, at, Operand(t0));
290 __ Branch(&entry);
296 __ Branch(fail);
303 __ Branch(
[all...]
H A Dcode-stubs-mips.cc65 __ Branch(not_a_heap_number, ne, scratch1, Operand(scratch2));
317 __ Branch(&slow_case, eq, a3, Operand(t1));
325 __ Branch(&check_fast_elements, ne, v0, Operand(t1));
333 __ Branch(&double_elements, ne, v0, Operand(t1));
394 __ Branch(&slow_case, eq, a3, Operand(t0));
401 __ Branch(&slow_case, ne, a0, Operand(size >> kPointerSizeLog2));
481 __ Branch(&not_special, gt, source_, Operand(1));
608 __ Branch(&done);
654 __ Branch(not_number, ne, scratch1, Operand(heap_number_map));
706 __ Branch(
[all...]
H A Dfull-codegen-mips.cc87 __ Branch(target, eq, at, Operand(zero_reg));
98 __ Branch(target, ne, at, Operand(zero_reg));
166 __ Branch(&ok, eq, t1, Operand(zero_reg));
298 __ Branch(&ok, hs, sp, Operand(t0));
357 // to make sure it is constant. Branch may emit a skip-or-jump sequence
358 // instead of the normal Branch. It seems that the "skip" part of that
359 // sequence is about as long as this Branch would be so it is safe to ignore
406 __ Branch(&return_label_);
427 __ Branch(&ok, ge, a3, Operand(zero_reg));
522 if (false_label_ != fall_through_) __ Branch(false_label
[all...]
/external/chromium_org/v8/src/mips/
H A Dic-mips.cc56 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_OBJECT_TYPE));
57 __ Branch(global_object, eq, type, Operand(JS_BUILTINS_OBJECT_TYPE));
58 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_PROXY_TYPE));
83 __ Branch(miss, lt, scratch1, Operand(FIRST_SPEC_OBJECT_TYPE));
94 __ Branch(miss, ne, scratch1, Operand(zero_reg));
99 __ Branch(miss, ne, scratch1, Operand(scratch0));
150 __ Branch(miss, ne, at, Operand(zero_reg));
204 __ Branch(miss, ne, at, Operand(zero_reg));
233 __ Branch(slow, ne, at, Operand(zero_reg));
240 __ Branch(slo
[all...]
H A Dcode-stubs-mips.cc546 __ Branch(&not_special, gt, source_, Operand(1));
625 __ Branch(&done, eq, scratch, Operand(zero_reg));
645 __ Branch(&done, eq, scratch, Operand(zero_reg));
654 __ Branch(&normal_exponent, le, result_reg, Operand(zero_reg));
656 __ Branch(&done);
671 __ Branch(&high_shift_needed, lt, scratch, Operand(32));
673 __ Branch(&high_shift_done);
691 __ Branch(&pos_shift, ge, scratch, Operand(zero_reg));
696 __ Branch(&shift_done);
734 __ Branch(
[all...]
H A Dbuiltins-mips.cc193 __ Branch(&no_arguments, eq, a0, Operand(zero_reg));
262 __ Branch(&convert_argument, ne, t0, Operand(zero_reg));
265 __ Branch(&argument_is_string);
278 __ Branch(&argument_is_string);
285 __ Branch(&argument_is_string);
329 __ Branch(&ok, hs, sp, Operand(t0));
390 __ Branch(&rt_call, ne, a2, Operand(zero_reg));
398 __ Branch(&rt_call, ne, t4, Operand(MAP_TYPE));
406 __ Branch(&rt_call, eq, a3, Operand(JS_FUNCTION_TYPE));
417 __ Branch(
[all...]
H A Dregexp-macro-assembler-mips.cc241 __ Branch(&backtrack_non_equal, ne, current_input_offset(), Operand(a0));
260 __ Branch(&fallthrough, eq, a1, Operand(zero_reg));
288 __ Branch(&loop_check, eq, t0, Operand(a3));
293 __ Branch(&fail, ne, t0, Operand(a3));
295 __ Branch(&loop_check, ls, a3, Operand('z' - 'a'));
299 __ Branch(&fail, hi, a3, Operand(254 - 224));
301 __ Branch(&fail, eq, a3, Operand(247 - 224));
304 __ Branch(&loop, lt, a0, Operand(a1));
377 __ Branch(&fallthrough, eq, a1, Operand(zero_reg));
403 __ Branch(
[all...]
H A Dcodegen-mips.cc197 __ Branch(&only_change_map, eq, at, Operand(t0));
250 __ Branch(&entry);
262 __ Branch(&done);
267 __ Branch(fail);
282 __ Branch(&entry);
298 __ Branch(&loop, lt, t3, Operand(t2));
325 __ Branch(&only_change_map, eq, at, Operand(t0));
358 __ Branch(&entry);
364 __ Branch(fail);
371 __ Branch(
[all...]
H A Dlithium-codegen-mips.cc155 __ Branch(&ok, eq, t1, Operand(zero_reg));
184 __ Branch(&loop, ne, a0, Operand(sp));
324 __ Branch(&needs_frame);
794 __ Branch(&no_deopt, ne, a1, Operand(zero_reg));
808 __ Branch(&skip, NegateCondition(condition), src1, src2);
832 __ Branch(&deopt_jump_table_.last().label, condition, src1, src2);
1079 __ Branch(left_reg.is(result_reg) ? PROTECT : USE_DELAY_SLOT,
1086 __ Branch(USE_DELAY_SLOT, &done);
1113 __ Branch(&left_not_min_int, ne, left_reg, Operand(kMinInt));
1120 __ Branch(USE_DELAY_SLO
[all...]
H A Dfull-codegen-mips.cc87 __ Branch(target, eq, at, Operand(zero_reg));
98 __ Branch(target, ne, at, Operand(zero_reg));
161 __ Branch(&ok, eq, t1, Operand(zero_reg));
192 __ Branch(&loop, gt, a2, Operand(zero_reg));
307 __ Branch(&ok, hs, sp, Operand(t0));
361 // to make sure it is constant. Branch may emit a skip-or-jump sequence
362 // instead of the normal Branch. It seems that the "skip" part of that
363 // sequence is about as long as this Branch would be so it is safe to ignore
398 __ Branch(&return_label_);
419 __ Branch(
[all...]
/external/lzma/CPP/7zip/Compress/
H A DBranchRegister.cpp30 REGISTER_CODECS(Branch)
/external/chromium_org/third_party/skia/src/animator/
H A DSkScript2.h187 struct Branch { struct in class:SkScriptEngine2
188 Branch() { function in struct:SkScriptEngine2::Branch
191 Branch(Op op, int depth, unsigned offset) : fOffset(offset), fOpStackDepth(depth), fOperator(op), function in struct:SkScriptEngine2::Branch
249 void resolveBranch(Branch& );
254 SkTDStack<Branch> fBranchStack; // logical operators, slot to store forward branch
/external/javassist/src/main/javassist/bytecode/
H A DCodeIterator.java303 * Branch offsets and the exception table are also updated.
325 * Branch offsets and the exception table are also updated.
350 * Branch offsets and the exception table are also updated.
376 * Branch offsets and the exception table are also updated.
398 * Branch offsets and the exception table are also updated.
423 * Branch offsets and the exception table are also updated.
470 * Branch offsets and the exception table are also updated.
487 * Branch offsets and the exception table are also updated.
509 * Branch offsets and the exception table are also updated.
526 * Branch offset
1267 static abstract class Branch { class in class:CodeIterator
1269 Branch(int p) { pos = orgPos = p; } method in class:CodeIterator.Branch
[all...]
/external/skia/src/animator/
H A DSkScript2.h187 struct Branch { struct in class:SkScriptEngine2
188 Branch() { function in struct:SkScriptEngine2::Branch
191 Branch(Op op, int depth, unsigned offset) : fOffset(offset), fOpStackDepth(depth), fOperator(op), function in struct:SkScriptEngine2::Branch
249 void resolveBranch(Branch& );
254 SkTDStack<Branch> fBranchStack; // logical operators, slot to store forward branch

Completed in 750 milliseconds

1234