/external/chromium_org/v8/src/ |
H A D | hydrogen-mark-unreachable.cc | 23 HBasicBlock* predecessor = it.Current(); local 28 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) { 31 predecessor->end()->KnownSuccessorBlock(&pred_succ);
|
H A D | hydrogen.cc | 271 HBasicBlock* predecessor = predecessors_[i]; local 272 DCHECK(predecessor->end()->IsGoto()); 273 HSimulate* simulate = HSimulate::cast(predecessor->end()->previous()); 275 (predecessor->last_environment()->closure().is_null() || 276 predecessor->last_environment()->closure()->shared() 279 predecessor->last_environment()->set_ast_id(ast_id); 340 // Only loop header blocks can have a predecessor added after 365 // succeeding block in this list, the predecessor is before the successor. 407 // exceed the number of previously encountered predecessor edges, there is no 420 HBasicBlock* predecessor local 612 HBasicBlock* predecessor = block->predecessors()->at(k); local [all...] |
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/ |
H A D | AnalyzedInstruction.java | 104 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 D | MethodAnalyzer.java | 490 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/bison/src/ |
H A D | 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 ite [all...] |
H A D | 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/ |
H A D | 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); 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...] |
H A D | sync_manager_impl_unittest.cc | 119 BaseNode* predecessor) { 124 EXPECT_TRUE(node.InitBookmarkByCreation(parent_node, predecessor)); 131 BaseNode* predecessor) { 136 EXPECT_TRUE(node.InitBookmarkByCreation(parent_node, predecessor)); 116 MakeFolderWithParent(UserShare* share, ModelType model_type, int64 parent_id, BaseNode* predecessor) argument 129 MakeBookmarkWithParent(UserShare* share, int64 parent_id, BaseNode* predecessor) argument
|
/external/chromium_org/third_party/libjingle/source/talk/xmllite/ |
H A D | xmlelement.cc | 348 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/chromium_org/third_party/webrtc/libjingle/xmllite/ |
H A D | xmlelement.cc | 331 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;
|
/external/chromium_org/sync/internal_api/public/base/ |
H A D | 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/third_party/icu/source/i18n/ |
H A D | nfsubs.cpp | 356 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 D | nfrule.cpp | 90 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_org/v8/src/compiler/ |
H A D | schedule.h | 112 int PredecessorIndexOf(BasicBlock* predecessor) { argument 116 if (*i == predecessor) return i.index();
|
/external/compiler-rt/lib/profile/ |
H A D | GCDAProfiling.c | 329 * 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/icu/icu4c/source/i18n/ |
H A D | nfsubs.cpp | 356 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 D | 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, 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_org/chrome/browser/sync/ |
H A D | profile_sync_service_bookmark_unittest.cc | 90 syncer::ReadNode predecessor(trans_); 91 EXPECT_EQ(BaseNode::INIT_OK, predecessor.InitByIdLookup(predecessor_id)); 92 EXPECT_EQ(predecessor.GetParentId(), parent.GetId()); 93 EXPECT_TRUE(node.InitBookmarkByCreation(parent, &predecessor)); 191 // Set a new parent and predecessor value. Return the old parent id. 192 // We could return the old predecessor id, but it turns out not to be 203 syncer::ReadNode predecessor(trans_); 204 EXPECT_EQ(BaseNode::INIT_OK, predecessor.InitByIdLookup(predecessor_id)); 205 EXPECT_EQ(predecessor.GetParentId(), parent.GetId()); 206 EXPECT_TRUE(node.SetPosition(parent, &predecessor)); 469 syncer::ReadNode* predecessor = NULL; local [all...] |
/external/chromium_org/sync/syncable/ |
H A D | directory.cc | 1378 void Directory::PutPredecessor(EntryKernel* e, EntryKernel* predecessor) { argument 1398 DCHECK(predecessor->ref(ID).IsRoot()); 1404 if (predecessor->ref(ID).IsRoot()) { 1428 DCHECK(predecessor->ref(UNIQUE_POSITION).IsValid()); 1430 OrderedChildSet::const_iterator neighbour = siblings->find(predecessor); 1437 predecessor->ref(UNIQUE_POSITION), 1452 predecessor->ref(UNIQUE_POSITION),
|
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | bcel.jar | META-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/bcel/ org/apache/bcel/classfile/ ... |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | com.ibm.icu_4.2.1.v20100412.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.1.R36x_v20100806.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.2.R36x_v20101103.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/chromium_org/third_party/android_platform/webview/ |
H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |