Searched refs:predecessor (Results 1 - 25 of 42) sorted by relevance

12

/external/chromium_org/third_party/WebKit/Source/core/html/imports/
H A DHTMLImportStateResolver.cpp54 for (HTMLImport* predecessor = ancestor->previous(); predecessor; predecessor = predecessor->previous()) {
55 if (isBlockingFollowers(predecessor))
/external/chromium_org/v8/src/
H A Dhydrogen-mark-unreachable.cc23 HBasicBlock* predecessor = it.Current(); local
28 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) {
31 predecessor->end()->KnownSuccessorBlock(&pred_succ);
/external/chromium_org/sync/internal_api/
H A Dwrite_node.cc331 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);
443 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
452 const BaseNode* predecessor) {
453 // |predecessor| must be a child of |new_parent| or NULL.
454 if (predecessor
330 InitBookmarkByCreation(const BaseNode& parent, const BaseNode* predecessor) argument
451 SetPosition(const BaseNode& new_parent, const BaseNode* predecessor) argument
507 PutPredecessor(const BaseNode* predecessor) argument
[all...]
/external/bison/src/
H A DAnnotationList.c230 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 ite
[all...]
H A Dielr.c296 * - <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/
H A Dwrite_node.h53 // 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/
H A Dnfrule.h45 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);
H A Dnfsubs.h59 const NFRule* predecessor,
H A Dnfrule.cpp90 const NFRule *predecessor,
120 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status);
181 rule2->extractSubstitutions(ruleSet, predecessor, rbnf, status);
193 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status);
367 * @param predecessor The rule preseding this one in "owners" rule list
372 const NFRule* predecessor,
377 sub1 = extractSubstitution(ruleSet, predecessor, rbnf, status);
378 sub2 = extractSubstitution(ruleSet, predecessor, rbnf, status);
387 * @param predecessor The rule preceding this one in the rule set's
396 const NFRule* predecessor,
88 makeRules(UnicodeString& description, const NFRuleSet *ruleSet, const NFRule *predecessor, const RuleBasedNumberFormat *rbnf, NFRuleList& rules, UErrorCode& status) argument
371 extractSubstitutions(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status) argument
395 extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status) argument
[all...]
/external/icu/icu4c/source/i18n/
H A Dnfrule.h45 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);
H A Dnfsubs.h59 const NFRule* predecessor,
H A Dnfrule.cpp91 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,
89 makeRules(UnicodeString& description, const NFRuleSet *ruleSet, const NFRule *predecessor, const RuleBasedNumberFormat *rbnf, NFRuleList& rules, UErrorCode& status) argument
372 extractSubstitutions(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status) argument
396 extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status) argument
[all...]
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
H A DAnalyzedInstruction.java104 protected boolean addPredecessor(AnalyzedInstruction predecessor) { argument
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];
H A DMethodAnalyzer.java490 private void addPredecessorSuccessor(@Nonnull AnalyzedInstruction predecessor, argument
494 addPredecessorSuccessor(predecessor, successor, exceptionHandlers, instructionsToProcess, false);
497 private void addPredecessorSuccessor(@Nonnull AnalyzedInstruction predecessor, argument
503 throw new AnalysisException("Execution can pass from the " + predecessor.instruction.getOpcode().name +
504 " instruction at code address 0x" + Integer.toHexString(getInstructionAddress(predecessor)) +
509 if (!successor.addPredecessor(predecessor)) {
513 predecessor.addSuccessor(successor);
518 //successors to the predecessor (and then apply this same logic recursively if needed)
529 addPredecessorSuccessor(predecessor, exceptionHandler, exceptionHandlers, instructionsToProcess, true);
/external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/
H A DPreInstructionRegisterInfoMethodItem.java149 //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/
H A Dxmlelement.cc348 void XmlElement::InsertChildAfter(XmlChild* predecessor, XmlChild* next) { argument
349 if (predecessor == NULL) {
354 next->next_child_ = predecessor->next_child_;
355 predecessor->next_child_ = next;
359 void XmlElement::RemoveChildAfter(XmlChild* predecessor) { argument
362 if (predecessor == NULL) {
367 next = predecessor->next_child_;
368 predecessor->next_child_ = next->next_child_;
372 last_child_ = predecessor;
H A Dxmlelement.h213 void InsertChildAfter(XmlChild* predecessor, XmlChild* new_child);
214 void RemoveChildAfter(XmlChild* predecessor);
/external/chromium_org/third_party/webrtc/libjingle/xmllite/
H A Dxmlelement.cc331 void XmlElement::InsertChildAfter(XmlChild* predecessor, XmlChild* next) { argument
332 if (predecessor == NULL) {
337 next->next_child_ = predecessor->next_child_;
338 predecessor->next_child_ = next;
342 void XmlElement::RemoveChildAfter(XmlChild* predecessor) { argument
345 if (predecessor == NULL) {
350 next = predecessor->next_child_;
351 predecessor->next_child_ = next->next_child_;
355 last_child_ = predecessor;
H A Dxmlelement.h196 void InsertChildAfter(XmlChild* predecessor, XmlChild* new_child);
197 void RemoveChildAfter(XmlChild* predecessor);
/external/chromium_org/sync/internal_api/public/base/
H A Dunique_position_unittest.cc253 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/third_party/WebKit/Source/core/rendering/
H A DRenderQuote.cpp320 for (RenderObject* predecessor = previousInPreOrder(); predecessor; predecessor = predecessor->previousInPreOrder()) {
323 if (!predecessor->isQuote() || !toRenderQuote(predecessor)->isAttached())
325 m_previous = toRenderQuote(predecessor);
/external/chromium_org/sync/syncable/
H A Dmutable_entry.cc228 MutableEntry predecessor(write_transaction(), GET_BY_ID, predecessor_id);
229 if (!predecessor.good())
231 dir()->PutPredecessor(kernel_, predecessor.kernel_);
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DSsaConverter.java124 * unique successor or unique predecessor.<p>
129 * predecessor. This ensures move statements can always be
164 * predecessor created for it
169 * predecessors needs a new predecessor node.
183 * unique move-exception block for each predecessor.
199 * one predecessor...
209 SsaBasicBlock predecessor = blocks.get(j);
211 = predecessor.insertNewSuccessor(block);
260 * successor block has more than one predecessor.
262 * @param block predecessor nod
[all...]
/external/compiler-rt/lib/profile/
H A DGCDAProfiling.c329 * where we're also given a pointer to n (predecessor).
331 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor, argument
336 pred = *predecessor;
349 *counter, *predecessor);
/external/chromium_org/v8/src/compiler/
H A Dschedule.h112 int PredecessorIndexOf(BasicBlock* predecessor) { argument
116 if (*i == predecessor) return i.index();

Completed in 1345 milliseconds

12