/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRTree.h | 106 struct Branch { struct in class:SkRTree 123 Branch* child(size_t index) { 124 return reinterpret_cast<Branch*>(this + 1) + index; 133 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) const { 141 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) { 148 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) { 160 Branch* inser [all...] |
H A D | SkRTree.cpp | 32 , fNodeSize(sizeof(Node) + sizeof(Branch) * maxChildren) 60 Branch newBranch; 75 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch); 138 SkRTree::Branch* SkRTree::insert(Node* root, Branch* branch, uint16_t level) { 139 Branch* toInsert = branch; 152 Branch* toDivide = SkNEW_ARRAY(Branch, fMaxChildren + 1); 183 int SkRTree::chooseSubtree(Node* root, Branch* branch) { 244 int SkRTree::distributeChildren(Branch* childre [all...] |
/external/skia/src/core/ |
H A D | SkRTree.h | 106 struct Branch { struct in class:SkRTree 123 Branch* child(size_t index) { 124 return reinterpret_cast<Branch*>(this + 1) + index; 133 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) const { 141 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) { 148 bool operator()(const SkRTree::Branch lhs, const SkRTree::Branch rhs) { 160 Branch* inser [all...] |
H A D | SkRTree.cpp | 32 , 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 D | UninitializedValues.h | 32 struct Branch { struct in class:clang::UninitUse 52 SmallVector<Branch, 2> UninitBranches; 59 void addUninitBranch(Branch B) { 93 typedef SmallVectorImpl<Branch>::const_iterator branch_iterator;
|
/external/llvm/lib/Target/SystemZ/ |
H A D | SystemZLongBranch.cpp | 1 //===-- SystemZLongBranch.cpp - Branch lengthening for SystemZ ------------===// 98 MachineInstr *Branch; member in struct:__anon26159::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(nullptr), Size(0), TargetBlock(0), 138 return "SystemZ Long Branch"; 251 Terminator.Branch = MI; 307 if (!Terminator.Branch) 384 MachineInstr *Branch = Terminator.Branch; local [all...] |
H A D | SystemZElimCompare.cpp | 182 MachineInstr *Branch = CCUsers[0]; 183 if (Branch->getOpcode() != SystemZ::BRC || 184 Branch->getOperand(0).getImm() != SystemZ::CCMASK_ICMP || 185 Branch->getOperand(1).getImm() != SystemZ::CCMASK_CMP_NE) 190 // Compare and Branch. 192 MachineBasicBlock::iterator MBBI = Compare, MBBE = Branch; 197 // The transformation is OK. Rebuild Branch as a BRCT(G). 198 MachineOperand Target(Branch->getOperand(2)); 199 Branch->RemoveOperand(2); 200 Branch [all...] |
H A D | SystemZInstrInfo.cpp | 267 SystemZII::Branch Branch(getBranchInfo(I)); 268 if (!Branch.Target->isMBB()) 272 if (Branch.Type != SystemZII::BranchNormal) 275 if (Branch.CCMask == SystemZ::CCMASK_ANY) { 278 TBB = Branch.Target->getMBB(); 290 if (MBB.isLayoutSuccessor(Branch.Target->getMBB())) { 298 TBB = Branch.Target->getMBB(); 306 TBB = Branch.Target->getMBB(); 307 Cond.push_back(MachineOperand::CreateImm(Branch [all...] |
/external/chromium_org/v8/src/ic/mips/ |
H A D | ic-mips.cc | 30 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_OBJECT_TYPE)); 31 __ Branch(global_object, eq, type, Operand(JS_BUILTINS_OBJECT_TYPE)); 32 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_PROXY_TYPE)); 75 __ Branch(miss, ne, at, Operand(zero_reg)); 123 __ Branch(miss, ne, at, Operand(zero_reg)); 151 __ Branch(slow, ne, at, Operand(zero_reg)); 158 __ Branch(slow, lt, scratch, Operand(JS_OBJECT_TYPE)); 196 __ Branch(not_fast_array, ne, scratch1, Operand(at)); 203 __ Branch(out_of_range, hs, key, Operand(scratch1)); 217 __ Branch(out_of_rang [all...] |
/external/chromium_org/v8/src/ic/mips64/ |
H A D | ic-mips64.cc | 30 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_OBJECT_TYPE)); 31 __ Branch(global_object, eq, type, Operand(JS_BUILTINS_OBJECT_TYPE)); 32 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_PROXY_TYPE)); 75 __ Branch(miss, ne, at, Operand(zero_reg)); 122 __ Branch(miss, ne, at, Operand(zero_reg)); 150 __ Branch(slow, ne, at, Operand(zero_reg)); 157 __ Branch(slow, lt, scratch, Operand(JS_OBJECT_TYPE)); 195 __ Branch(not_fast_array, ne, scratch1, Operand(at)); 202 __ Branch(out_of_range, hs, key, Operand(scratch1)); 216 __ Branch(out_of_rang [all...] |
/external/chromium_org/v8/src/mips/ |
H A D | builtins-mips.cc | 168 __ Branch(&no_arguments, eq, a0, Operand(zero_reg)); 237 __ Branch(&convert_argument, ne, t0, Operand(zero_reg)); 240 __ Branch(&argument_is_string); 253 __ Branch(&argument_is_string); 260 __ Branch(&argument_is_string); 310 __ Branch(&ok, hs, sp, Operand(t0)); 365 __ Branch(&rt_call, ne, a2, Operand(zero_reg)); 372 __ Branch(&rt_call, ne, t4, Operand(MAP_TYPE)); 380 __ Branch(&rt_call, eq, a3, Operand(JS_FUNCTION_TYPE)); 388 __ Branch( [all...] |
H A D | code-stubs-mips.cc | 178 __ Branch(&error, ne, scratch, Operand(zero_reg)); 180 __ Branch(&done); 203 __ Branch(&done, eq, scratch, Operand(zero_reg)); 212 __ Branch(&normal_exponent, le, result_reg, Operand(zero_reg)); 214 __ Branch(&done); 229 __ Branch(&high_shift_needed, lt, scratch, Operand(32)); 231 __ Branch(&high_shift_done); 249 __ Branch(&pos_shift, ge, scratch, Operand(zero_reg)); 254 __ Branch(&shift_done); 292 __ Branch( [all...] |
H A D | regexp-macro-assembler-mips.cc | 219 __ Branch(&backtrack_non_equal, ne, current_input_offset(), Operand(a0)); 238 __ Branch(&fallthrough, eq, a1, Operand(zero_reg)); 266 __ Branch(&loop_check, eq, t0, Operand(a3)); 271 __ Branch(&fail, ne, t0, Operand(a3)); 273 __ Branch(&loop_check, ls, a3, Operand('z' - 'a')); 277 __ Branch(&fail, hi, a3, Operand(254 - 224)); 279 __ Branch(&fail, eq, a3, Operand(247 - 224)); 282 __ Branch(&loop, lt, a0, Operand(a1)); 355 __ Branch(&fallthrough, eq, a1, Operand(zero_reg)); 381 __ Branch( [all...] |
H A D | lithium-codegen-mips.cc | 153 __ Branch(&ok, ne, a2, Operand(at)); 187 __ Branch(&loop, ne, a0, Operand(sp)); 352 __ Branch(&needs_frame); 377 if (need_branch) __ Branch(&call_deopt_entry); 841 __ Branch(&no_deopt, ne, a1, Operand(zero_reg)); 855 __ Branch(&skip, NegateCondition(condition), src1, src2); 879 __ Branch(&jump_table_.last().label, condition, src1, src2); 1115 __ Branch(÷nd_is_not_negative, ge, dividend, Operand(zero_reg)); 1122 __ Branch(USE_DELAY_SLOT, &done); 1151 __ Branch( [all...] |
H A D | macro-assembler-mips.cc | 81 Branch(2, NegateCondition(cond), src1, src2); 96 Branch(2, NegateCondition(cond), src1, src2); 160 Branch(branch, cc, scratch, 193 Branch(&ok, eq, t8, Operand(zero_reg)); 262 Branch(&ok, eq, at, Operand(zero_reg)); 394 Branch(&done, eq, t8, Operand(zero_reg)); 450 Branch(&same_contexts, eq, scratch, Operand(at)); 478 Branch(miss, ne, scratch, Operand(at)); 586 Branch(&done, eq, key, Operand(at)); 588 Branch(mis [all...] |
H A D | full-codegen-mips.cc | 142 __ Branch(&ok, ne, a2, Operand(at)); 170 __ Branch(&ok, hs, t5, Operand(a2)); 188 __ Branch(&loop_header, ne, a2, Operand(zero_reg)); 317 __ Branch(&ok, hs, sp, Operand(at)); 370 // to make sure it is constant. Branch may emit a skip-or-jump sequence 371 // instead of the normal Branch. It seems that the "skip" part of that 372 // sequence is about as long as this Branch would be so it is safe to ignore 404 __ Branch(&return_label_); 424 __ Branch(&ok, ge, a3, Operand(zero_reg)); 514 if (false_label_ != fall_through_) __ Branch(false_label [all...] |
/external/chromium_org/v8/src/mips64/ |
H A D | builtins-mips64.cc | 167 __ Branch(&no_arguments, eq, a0, Operand(zero_reg)); 236 __ Branch(&convert_argument, ne, a4, Operand(zero_reg)); 239 __ Branch(&argument_is_string); 252 __ Branch(&argument_is_string); 259 __ Branch(&argument_is_string); 309 __ Branch(&ok, hs, sp, Operand(a4)); 365 __ Branch(&rt_call, ne, a2, Operand(zero_reg)); 372 __ Branch(&rt_call, ne, t0, Operand(MAP_TYPE)); 380 __ Branch(&rt_call, eq, a3, Operand(JS_FUNCTION_TYPE)); 388 __ Branch( [all...] |
H A D | code-stubs-mips64.cc | 176 __ Branch(&error, ne, scratch, Operand(zero_reg)); 178 __ Branch(&done); 199 __ Branch(&done, eq, scratch, Operand(zero_reg)); 208 __ Branch(&normal_exponent, le, result_reg, Operand(zero_reg)); 210 __ Branch(&done); 225 __ Branch(&high_shift_needed, lt, scratch, Operand(32)); 227 __ Branch(&high_shift_done); 245 __ Branch(&pos_shift, ge, scratch, Operand(zero_reg)); 250 __ Branch(&shift_done); 288 __ Branch( [all...] |
H A D | regexp-macro-assembler-mips64.cc | 255 __ Branch(&backtrack_non_equal, ne, current_input_offset(), Operand(a0)); 274 __ Branch(&fallthrough, eq, a1, Operand(zero_reg)); 302 __ Branch(&loop_check, eq, a4, Operand(a3)); 307 __ Branch(&fail, ne, a4, Operand(a3)); 309 __ Branch(&loop_check, ls, a3, Operand('z' - 'a')); 313 __ Branch(&fail, hi, a3, Operand(254 - 224)); 315 __ Branch(&fail, eq, a3, Operand(247 - 224)); 318 __ Branch(&loop, lt, a0, Operand(a1)); 391 __ Branch(&fallthrough, eq, a1, Operand(zero_reg)); 417 __ Branch( [all...] |
H A D | full-codegen-mips64.cc | 142 __ Branch(&ok, ne, a2, Operand(at)); 167 __ Branch(&ok, hs, t1, Operand(a2)); 185 __ Branch(&loop_header, ne, a2, Operand(zero_reg)); 311 __ Branch(&ok, hs, sp, Operand(at)); 366 // to make sure it is constant. Branch may emit a skip-or-jump sequence 367 // instead of the normal Branch. It seems that the "skip" part of that 368 // sequence is about as long as this Branch would be so it is safe to ignore 400 __ Branch(&return_label_); 420 __ Branch(&ok, ge, a3, Operand(zero_reg)); 510 if (false_label_ != fall_through_) __ Branch(false_label [all...] |
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-branch-combine.cc | 32 m.Branch(m.Word32Equal(p0, m.Int32Constant(0)), &blocka, &blockb); 59 m.Branch(cond, &blocka, &blockb); 83 m.Branch(m.Int32LessThan(p0, m.Int32Constant(0)), &blocka, &blockb); 105 m.Branch(m.Uint32LessThan(p0, m.Int32Constant(100)), &blocka, &blockb); 127 m.Branch(m.Uint32LessThanOrEqual(p0, m.Int32Constant(100)), &blocka, &blockb); 149 m.Branch(m.Int32LessThan(m.Int32Constant(0), p0), &blocka, &blockb); 171 m.Branch(m.Int32GreaterThan(p0, m.Int32Constant(0)), &blocka, &blockb); 194 m.Branch(m.Word32Equal(p0, p1), &blocka, &blockb); 224 if (left == 1) m.Branch(m.Word32Equal(p0, p1), &blocka, &blockb); 225 if (left == 0) m.Branch( [all...] |
/external/lzma/CPP/7zip/Compress/ |
H A D | BranchRegister.cpp | 30 REGISTER_CODECS(Branch)
|
/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkScript2.h | 187 struct Branch { struct in class:SkScriptEngine2 188 Branch() { function in struct:SkScriptEngine2::Branch 191 Branch(Op op, int depth, size_t offset) function in struct:SkScriptEngine2::Branch 250 void resolveBranch(Branch& ); 255 SkTDStack<Branch> fBranchStack; // logical operators, slot to store forward branch
|
/external/javassist/src/main/javassist/bytecode/ |
H A D | CodeIterator.java | 303 * 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 D | SkScript2.h | 187 struct Branch { struct in class:SkScriptEngine2 188 Branch() { function in struct:SkScriptEngine2::Branch 191 Branch(Op op, int depth, size_t offset) function in struct:SkScriptEngine2::Branch 250 void resolveBranch(Branch& ); 255 SkTDStack<Branch> fBranchStack; // logical operators, slot to store forward branch
|