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

/external/compiler-rt/lib/profile/
H A DGCDAProfiling.c159 * where we're also given a pointer to n (predecessor).
161 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor, argument
166 pred = *predecessor;
179 state_table_row, *predecessor);
/external/llvm/runtime/libprofile/
H A DGCDAProfiling.c140 * where we're also given a pointer to n (predecessor).
142 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor, argument
147 pred = *predecessor;
159 state_table_row, *predecessor);
/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.java562 private void addPredecessorSuccessor(AnalyzedInstruction predecessor, AnalyzedInstruction successor, argument
565 addPredecessorSuccessor(predecessor, successor, exceptionHandlers, instructionsToProcess, false);
568 private void addPredecessorSuccessor(AnalyzedInstruction predecessor, AnalyzedInstruction successor, argument
573 throw new ValidationException("Execution can pass from the " + predecessor.instruction.opcode.name +
574 " instruction at code address 0x" + Integer.toHexString(getInstructionAddress(predecessor)) +
579 if (!successor.addPredecessor(predecessor)) {
583 predecessor.addSuccessor(successor);
588 //successors to the predecessor (and then apply this same logic recursively if needed)
599 addPredecessorSuccessor(predecessor, exceptionHandler, exceptionHandlers, instructionsToProcess, true);
/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/icu4c/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.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/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/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 312 milliseconds