/external/chromium_org/third_party/WebKit/Source/core/html/imports/ |
HTMLImportStateResolver.cpp | 54 for (HTMLImport* predecessor = ancestor->previous(); predecessor; predecessor = predecessor->previous()) { 55 if (isBlockingFollowers(predecessor))
|
/external/chromium_org/v8/src/ |
hydrogen-mark-unreachable.cc | 23 HBasicBlock* predecessor = it.Current(); local 28 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) { 31 predecessor->end()->KnownSuccessorBlock(&pred_succ);
|
/external/chromium_org/sync/internal_api/ |
write_node.cc | 331 const BaseNode* predecessor) { 333 // |predecessor| must be a child of |parent| or NULL. 334 if (predecessor && predecessor->GetParentId() != parent.GetId()) { 355 // Now set the predecessor, which sets IS_UNSYNCED as necessary. 356 return PutPredecessor(predecessor); 434 // Now set the predecessor, which sets IS_UNSYNCED as necessary. 443 const BaseNode* predecessor) { 444 // |predecessor| must be a child of |new_parent| or NULL. 445 if (predecessor && predecessor->GetParentId() != new_parent.GetId()) [all...] |
/external/bison/src/ |
AnnotationList.c | 230 state **predecessor; local 231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor) 252 Sbitset__new_on_obstack ((*predecessor)->nitems, 272 then check all of the predecessor's goto follows for the 284 *predecessor, 299 items, (*predecessor)->nitems); 304 predecessor item's lookahead set. */ 307 /* We don't have to start the predecessor item search a [all...] |
ielr.c | 296 * - <tt>result[i]</tt> is an array of pointers to the predecessor 426 state **predecessor; local 428 for (predecessor = predecessors[s->number]; 429 *predecessor; 430 ++predecessor) 433 goto_follows[map_goto ((*predecessor)->number, 437 predecessor items' lookahead sets. */ 440 state **predecessor; local 441 for (predecessor = predecessors[s->number]; 442 *predecessor; [all...] |
/external/chromium_org/sync/internal_api/public/ |
write_node.h | 53 // Setting the predecessor failed 70 // Create a new bookmark node with the specified parent and predecessor. Use 71 // a NULL |predecessor| to indicate that this is to be the first child. 72 // |predecessor| must be a child of |new_parent| or NULL. Returns false on 75 const BaseNode* predecessor); 109 // Set a new parent and position. Position is specified by |predecessor|; if 110 // it is NULL, the node is moved to the first position. |predecessor| must 112 bool SetPosition(const BaseNode& new_parent, const BaseNode* predecessor); 193 bool PutPredecessor(const BaseNode* predecessor) WARN_UNUSED_RESULT;
|
/external/chromium_org/third_party/icu/source/i18n/ |
nfrule.h | 45 const NFRule* predecessor, 79 void extractSubstitutions(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status); 80 NFSubstitution* extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status);
|
nfsubs.h | 59 const NFRule* predecessor,
|
nfrule.cpp | 92 const NFRule *predecessor, 122 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status); 183 rule2->extractSubstitutions(ruleSet, predecessor, rbnf, status); 195 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status); 369 * @param predecessor The rule preseding this one in "owners" rule list 374 const NFRule* predecessor, 379 sub1 = extractSubstitution(ruleSet, predecessor, rbnf, status); 380 sub2 = extractSubstitution(ruleSet, predecessor, rbnf, status); 389 * @param predecessor The rule preceding this one in the rule set's 398 const NFRule* predecessor, [all...] |
/external/icu/icu4c/source/i18n/ |
nfrule.h | 45 const NFRule* predecessor, 79 void extractSubstitutions(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status); 80 NFSubstitution* extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status);
|
nfsubs.h | 59 const NFRule* predecessor,
|
nfrule.cpp | 91 const NFRule *predecessor, 121 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status); 182 rule2->extractSubstitutions(ruleSet, predecessor, rbnf, status); 194 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status); 368 * @param predecessor The rule preseding this one in "owners" rule list 373 const NFRule* predecessor, 378 sub1 = extractSubstitution(ruleSet, predecessor, rbnf, status); 379 sub2 = extractSubstitution(ruleSet, predecessor, rbnf, status); 388 * @param predecessor The rule preceding this one in the rule set's 397 const NFRule* predecessor, [all...] |
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/ |
AnalyzedInstruction.java | 104 protected boolean addPredecessor(AnalyzedInstruction predecessor) { 105 return predecessors.add(predecessor); 146 * To determine this, we simply check if the first predecessor is the fake "StartOfMethod" instruction, which has 196 * given register. Any dead, unreachable, or odexed predecessor is ignored 202 for (AnalyzedInstruction predecessor: predecessors) { 203 RegisterType predecessorRegisterType = predecessor.postRegisterMap[registerNumber];
|
/external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/ |
PreInstructionRegisterInfoMethodItem.java | 149 //in the common case of an instruction that only has a single predecessor which is the previous 158 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) { 159 RegisterType predecessorRegisterType = predecessor.getPostInstructionRegisterType(registerNum); 181 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) { 182 RegisterType predecessorRegisterType = predecessor.getPostInstructionRegisterType(registerNum); 188 if (predecessor.getInstructionIndex() == -1) { 193 writer.printUnsignedLongAsHex(methodAnalyzer.getInstructionAddress(predecessor));
|
/external/chromium_org/third_party/libjingle/source/talk/xmllite/ |
xmlelement.cc | 348 void XmlElement::InsertChildAfter(XmlChild* predecessor, XmlChild* next) { 349 if (predecessor == NULL) { 354 next->next_child_ = predecessor->next_child_; 355 predecessor->next_child_ = next; 359 void XmlElement::RemoveChildAfter(XmlChild* predecessor) { 362 if (predecessor == NULL) { 367 next = predecessor->next_child_; 368 predecessor->next_child_ = next->next_child_; 372 last_child_ = predecessor;
|
xmlelement.h | 213 void InsertChildAfter(XmlChild* predecessor, XmlChild* new_child); 214 void RemoveChildAfter(XmlChild* predecessor);
|
/frameworks/base/core/java/android/database/sqlite/ |
SQLiteConnectionPool.java | 624 ConnectionWaiter predecessor = null; local 631 predecessor = successor; 634 if (predecessor != null) { 635 predecessor.mNext = waiter; 715 ConnectionWaiter predecessor = null; local 719 predecessor = current; 722 if (predecessor != null) { 723 predecessor.mNext = waiter.mNext; 784 ConnectionWaiter predecessor = null; local [all...] |
/art/compiler/sea_ir/ir/ |
sea.h | 91 // have multiple predecessor regions; this is why RenameToSSA has 118 // Returns the instruction that defines the phi register from predecessor 212 // Sets the phi-function uses to be as defined in @scoped_table for predecessor @@predecessor. 214 Region* predecessor); 226 void AddPredecessor(Region* predecessor) { 227 DCHECK(predecessor) << "Tried to add NULL predecessor to SEA node."; 228 predecessors_.push_back(predecessor); 240 std::vector<sea_ir::Region*> predecessors_; // CFG predecessor nodes (instructions/regions [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
RenderQuote.cpp | 313 for (RenderObject* predecessor = previousInPreOrder(); predecessor; predecessor = predecessor->previousInPreOrder()) { 316 if (!predecessor->isQuote() || !toRenderQuote(predecessor)->isAttached()) 318 m_previous = toRenderQuote(predecessor);
|
/external/chromium_org/sync/internal_api/public/base/ |
unique_position_unittest.cc | 253 const UniquePosition& predecessor = kSortedPositionArray[i]; local 255 if (IsSuffixInUse(predecessor, suffix)) 266 UniquePosition::Between(predecessor, successor, suffix); 268 EXPECT_PRED_FORMAT2(LessThan, predecessor, midpoint); 291 const UniquePosition& predecessor = kSortedPositionArray[i]; local 293 if (IsSuffixInUse(predecessor, suffix)) 296 UniquePosition after = UniquePosition::After(predecessor, suffix); 298 EXPECT_PRED_FORMAT2(LessThan, predecessor, after);
|
/external/chromium_org/v8/test/webkit/ |
dfg-cfg-simplify-phantom-get-local-on-same-block-set-local.js | 25 "Tests that attempts by the DFG simplification to short-circuit a Phantom to a GetLocal on a variable that is SetLocal'd in the same block, and where the predecessor block(s) make no mention of that variable, do not result in crashes." 55 // the predecessor block making no mention of x.
|
/art/compiler/optimizing/ |
nodes.cc | 114 HBasicBlock* predecessor, 117 block->SetDominator(predecessor); 119 block->SetDominator(FindCommonDominator(block->GetDominator(), predecessor)); 189 HBasicBlock* predecessor = header->GetPredecessors().Get(pred); local 190 if (predecessor != back_edge) { 191 predecessor->ReplaceSuccessor(header, pre_header);
|
/external/chromium_org/sync/syncable/ |
mutable_entry.cc | 228 MutableEntry predecessor(write_transaction(), GET_BY_ID, predecessor_id); 229 if (!predecessor.good()) 231 dir()->PutPredecessor(kernel_, predecessor.kernel_);
|
/frameworks/base/core/java/android/view/ |
Choreographer.java | 822 CallbackRecord predecessor = null; local [all...] |
/dalvik/dx/src/com/android/dx/ssa/ |
SsaConverter.java | 123 * unique successor or unique predecessor.<p> 128 * predecessor. This ensures move statements can always be 163 * predecessor created for it 168 * predecessors needs a new predecessor node. 182 * unique move-exception block for each predecessor. 198 * one predecessor... 208 SsaBasicBlock predecessor = blocks.get(j); local 210 = predecessor.insertNewSuccessor(block); 259 * successor block has more than one predecessor. 261 * @param block predecessor nod [all...] |