Searched defs:predecessor (Results 1 - 25 of 26) sorted by relevance

12

/external/chromium/chrome/browser/sync/glue/
H A Dbookmark_change_processor.cc215 // This node's index should be one more than the predecessor's index.
304 // Find the bookmark model predecessor, and insert after it.
324 // predecessor of the node (in the bookmark model) matches the predecessor of
326 // As a precondition, this assumes that the predecessor of |source| has been
334 // A return ID of kInvalidId indicates no predecessor.
338 // Otherwise, insert after the predecessor bookmark node.
339 const BookmarkNode* predecessor = local
341 DCHECK(predecessor);
342 DCHECK_EQ(predecessor
[all...]
/external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/
H A DAnalyzedInstruction.java108 protected boolean addPredecessor(AnalyzedInstruction predecessor) { argument
109 return predecessors.add(predecessor);
154 * To determine this, we simply check if the first predecessor is the fake "StartOfMethod" instruction, which has
204 * given register. Any dead, unreachable, or odexed predecessor is ignored
210 for (AnalyzedInstruction predecessor: predecessors) {
211 RegisterType predecessorRegisterType = predecessor.postRegisterMap[registerNumber];
H A DMethodAnalyzer.java589 private void addPredecessorSuccessor(AnalyzedInstruction predecessor, AnalyzedInstruction successor, argument
592 addPredecessorSuccessor(predecessor, successor, exceptionHandlers, instructionsToProcess, false);
595 private void addPredecessorSuccessor(AnalyzedInstruction predecessor, AnalyzedInstruction successor, argument
600 throw new ValidationException("Execution can pass from the " + predecessor.instruction.opcode.name +
601 " instruction at code address 0x" + Integer.toHexString(getInstructionAddress(predecessor)) +
606 if (!successor.addPredecessor(predecessor)) {
610 predecessor.addSuccessor(successor);
615 //successors to the predecessor (and then apply this same logic recursively if needed)
626 addPredecessorSuccessor(predecessor, exceptionHandler, exceptionHandlers, instructionsToProcess, true);
/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/
H A Dwrite_node.cc345 const BaseNode* predecessor) {
347 // |predecessor| must be a child of |parent| or NULL.
348 if (predecessor && predecessor->GetParentId() != parent.GetId()) {
369 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
370 return PutPredecessor(predecessor);
448 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
457 const BaseNode* predecessor) {
458 // |predecessor| must be a child of |new_parent| or NULL.
459 if (predecessor
344 InitBookmarkByCreation(const BaseNode& parent, const BaseNode* predecessor) argument
456 SetPosition(const BaseNode& new_parent, const BaseNode* predecessor) argument
510 PutPredecessor(const BaseNode* predecessor) argument
[all...]
H A Dsync_manager_impl_unittest.cc139 BaseNode* predecessor) {
144 EXPECT_TRUE(node.InitBookmarkByCreation(parent_node, predecessor));
151 BaseNode* predecessor) {
156 EXPECT_TRUE(node.InitBookmarkByCreation(parent_node, predecessor));
136 MakeFolderWithParent(UserShare* share, ModelType model_type, int64 parent_id, BaseNode* predecessor) argument
149 MakeBookmarkWithParent(UserShare* share, int64 parent_id, BaseNode* predecessor) argument
/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;
/external/compiler-rt/lib/profile/
H A DGCDAProfiling.c302 * where we're also given a pointer to n (predecessor).
304 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor, argument
309 pred = *predecessor;
322 *counter, *predecessor);
/external/chromium/chrome/browser/sync/engine/
H A Dsyncapi_unittest.cc126 BaseNode* predecessor) {
131 EXPECT_TRUE(node.InitByCreation(model_type, parent_node, predecessor));
123 MakeFolderWithParent(UserShare* share, ModelType model_type, int64 parent_id, BaseNode* predecessor) argument
H A Dsyncapi.cc760 const BaseNode* predecessor) {
762 // |predecessor| must be a child of |parent| or NULL.
763 if (predecessor && predecessor->GetParentId() != parent.GetId()) {
785 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
786 PutPredecessor(predecessor);
863 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
870 const BaseNode* predecessor) {
871 // |predecessor| must be a child of |new_parent| or NULL.
872 if (predecessor
758 InitByCreation(syncable::ModelType model_type, const BaseNode& parent, const BaseNode* predecessor) argument
869 SetPosition(const BaseNode& new_parent, const BaseNode* predecessor) argument
912 PutPredecessor(const BaseNode* predecessor) argument
[all...]
/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/icu/source/i18n/
H A Dnfsubs.cpp330 const NFRule* predecessor,
399 return new ModulusSubstitution(pos, rule->getDivisor(), predecessor,
819 const NFRule* predecessor,
844 ruleToUse = predecessor;
328 makeSubstitution(int32_t pos, const NFRule* rule, const NFRule* predecessor, const NFRuleSet* ruleSet, const RuleBasedNumberFormat* formatter, const UnicodeString& description, UErrorCode& status) argument
817 ModulusSubstitution(int32_t _pos, double _divisor, const NFRule* predecessor, const NFRuleSet* _ruleSet, const RuleBasedNumberFormat* formatter, const UnicodeString& description, UErrorCode& status) argument
H A Dnfrule.cpp92 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,
90 makeRules(UnicodeString& description, const NFRuleSet *ruleSet, const NFRule *predecessor, const RuleBasedNumberFormat *rbnf, NFRuleList& rules, UErrorCode& status) argument
373 extractSubstitutions(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status) argument
397 extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status) argument
[all...]
/external/icu4c/i18n/
H A Dnfsubs.cpp356 const NFRule* predecessor,
425 return new ModulusSubstitution(pos, rule->getDivisor(), predecessor,
845 const NFRule* predecessor,
870 ruleToUse = predecessor;
354 makeSubstitution(int32_t pos, const NFRule* rule, const NFRule* predecessor, const NFRuleSet* ruleSet, const RuleBasedNumberFormat* formatter, const UnicodeString& description, UErrorCode& status) argument
843 ModulusSubstitution(int32_t _pos, double _divisor, const NFRule* predecessor, const NFRuleSet* _ruleSet, const RuleBasedNumberFormat* formatter, const UnicodeString& description, UErrorCode& status) argument
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/chromium/chrome/browser/sync/
H A Dprofile_sync_service_bookmark_unittest.cc104 sync_api::ReadNode* predecessor = NULL; local
107 predecessor = &predecessor_node;
111 node.InitByCreation(type, root, predecessor);
147 sync_api::ReadNode predecessor(trans_);
148 EXPECT_TRUE(predecessor.InitByIdLookup(predecessor_id));
149 EXPECT_EQ(predecessor.GetParentId(), parent.GetId());
151 &predecessor));
217 // Set a new parent and predecessor value. Return the old parent id.
218 // We could return the old predecessor id, but it turns out not to be
229 sync_api::ReadNode predecessor(trans
[all...]
/external/chromium_org/sync/syncable/
H A Ddirectory.cc1209 void Directory::PutPredecessor(EntryKernel* e, EntryKernel* predecessor) { argument
1229 DCHECK(predecessor->ref(ID).IsRoot());
1235 if (predecessor->ref(ID).IsRoot()) {
1259 DCHECK(predecessor->ref(UNIQUE_POSITION).IsValid());
1261 OrderedChildSet::const_iterator neighbour = siblings->find(predecessor);
1268 predecessor->ref(UNIQUE_POSITION),
1283 predecessor->ref(UNIQUE_POSITION),
/external/chromium_org/chrome/browser/sync/
H A Dprofile_sync_service_bookmark_unittest.cc87 syncer::ReadNode predecessor(trans_);
88 EXPECT_EQ(BaseNode::INIT_OK, predecessor.InitByIdLookup(predecessor_id));
89 EXPECT_EQ(predecessor.GetParentId(), parent.GetId());
90 EXPECT_TRUE(node.InitBookmarkByCreation(parent, &predecessor));
162 // Set a new parent and predecessor value. Return the old parent id.
163 // We could return the old predecessor id, but it turns out not to be
174 syncer::ReadNode predecessor(trans_);
175 EXPECT_EQ(BaseNode::INIT_OK, predecessor.InitByIdLookup(predecessor_id));
176 EXPECT_EQ(predecessor.GetParentId(), parent.GetId());
177 EXPECT_TRUE(node.SetPosition(parent, &predecessor));
411 syncer::ReadNode* predecessor = NULL; local
[all...]
/external/chromium_org/v8/src/
H A Dhydrogen.cc255 HBasicBlock* predecessor = predecessors_[i]; local
256 ASSERT(predecessor->end()->IsGoto());
257 HSimulate* simulate = HSimulate::cast(predecessor->end()->previous());
259 (predecessor->last_environment()->closure().is_null() ||
260 predecessor->last_environment()->closure()->shared()
263 predecessor->last_environment()->set_ast_id(ast_id);
309 // Only loop header blocks can have a predecessor added after
334 // succeeding block in this list, the predecessor is before the successor.
376 // exceed the number of previously encountered predecessor edges, there is no
389 HBasicBlock* predecessor local
581 HBasicBlock* predecessor = block->predecessors()->at(k); local
[all...]
/external/v8/src/
H A Dhydrogen.cc204 HBasicBlock* predecessor = predecessors_[i]; local
205 ASSERT(predecessor->end()->IsGoto());
206 HSimulate* simulate = HSimulate::cast(predecessor->end()->previous());
209 predecessor->last_environment()->closure()->shared()
257 // Only loop header blocks can have a predecessor added after
282 // succeeding block in this list, the predecessor is before the successor.
324 // exceed the number of previously encountered predecessor edges, there is no
337 HBasicBlock* predecessor = it.Current(); local
339 if (predecessor->block_id() < dominator_candidate->block_id()) {
375 int HBasicBlock::PredecessorIndexOf(HBasicBlock* predecessor) cons
525 HBasicBlock* predecessor = block->predecessors()->at(k); local
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.osgi_3.6.1.R36x_v20100806.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.osgi_3.6.2.R36x_v20101103.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 200 milliseconds

12