| /external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/ |
| PreInstructionRegisterInfoMethodItem.java | 140 //in the common case of an instruction that only has a single predecessor which is the previous
149 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) {
150 if (predecessor.getPostInstructionRegisterType(registerNum) != mergedRegisterType) {
182 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) {
183 RegisterType predecessorRegisterType = predecessor.getPostInstructionRegisterType(registerNum);
210 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) {
211 RegisterType predecessorRegisterType = predecessor.getPostInstructionRegisterType(registerNum);
217 if (predecessor.getInstructionIndex() == -1) {
222 writer.printUnsignedLongAsHex(methodAnalyzer.getInstructionAddress(predecessor));
|
| /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/icu4c/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 | 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,
[all...] |
| nfsubs.cpp | 356 const NFRule* predecessor,
425 return new ModulusSubstitution(pos, rule->getDivisor(), predecessor,
[all...] |
| /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...] |
| /external/webkit/Source/WebCore/rendering/ |
| RenderQuote.cpp | 86 for (RenderObject* predecessor = head->previousInPreOrder(); predecessor; predecessor = predecessor->previousInPreOrder()) {
87 if (!predecessor->isQuote())
89 head->m_previous = toRenderQuote(predecessor);
|
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/ |
| AnalyzedInstruction.java | 108 protected boolean addPredecessor(AnalyzedInstruction predecessor) {
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];
|
| MethodAnalyzer.java | 589 private void addPredecessorSuccessor(AnalyzedInstruction predecessor, AnalyzedInstruction successor,
592 addPredecessorSuccessor(predecessor, successor, exceptionHandlers, instructionsToProcess, false);
595 private void addPredecessorSuccessor(AnalyzedInstruction predecessor, AnalyzedInstruction successor,
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);
[all...] |
| /external/compiler-rt/lib/profile/ |
| GCDAProfiling.c | 198 * where we're also given a pointer to n (predecessor).
200 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor,
205 pred = *predecessor;
218 *counter, *predecessor);
|
| /frameworks/base/core/java/android/view/ |
| Choreographer.java | 804 CallbackRecord predecessor = null; local
809 if (predecessor != null) {
810 predecessor.next = next;
816 predecessor = callback;
[all...] |
| ViewGroup.java | 1641 HoverTarget predecessor = null; local
1945 TouchTarget predecessor = null; local
2082 TouchTarget predecessor = null; local
2105 TouchTarget predecessor = null; local
[all...] |
| /external/chromium/chrome/browser/sync/ |
| profile_sync_service_bookmark_unittest.cc | 104 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...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 124 * 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); local
211 = predecessor.insertNewSuccessor(block);
260 * successor block has more than one predecessor.
262 * @param block predecessor nod
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaConverter.java | 124 * 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); local
211 = predecessor.insertNewSuccessor(block);
260 * successor block has more than one predecessor.
262 * @param block predecessor nod
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 55 * information about a thread in the predecessor of its node. A
57 * should block. A node is signalled when its predecessor
85 * predecessor. For explanation of similar mechanics in the case
91 * predecessor signals the next node to wake up by traversing
105 * a new predecessor, unless we can identify an uncancelled
106 * predecessor who will carry this responsibility.
182 * Link to predecessor node that current node/thread relies on
185 * cancellation of a predecessor, we short-circuit while
199 * assign next field of a predecessor until after attachment,
236 * Use when predecessor cannot be null. The null check coul
241 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedLongSynchronizer.Node
[all...] |
| AbstractQueuedSynchronizer.java | 284 * information about a thread in the predecessor of its node. A
286 * should block. A node is signalled when its predecessor
314 * predecessor. For explanation of similar mechanics in the case
320 * predecessor signals the next node to wake up by traversing
334 * a new predecessor, unless we can identify an uncancelled
335 * predecessor who will carry this responsibility.
411 * Link to predecessor node that current node/thread relies on
414 * cancellation of a predecessor, we short-circuit while
428 * assign next field of a predecessor until after attachment,
465 * Use when predecessor cannot be null. The null check coul
470 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedSynchronizer.Node
[all...] |
| /external/chromium/chrome/browser/sync/engine/ |
| syncapi.h | 318 // Create a new node with the specified parent and predecessor. |model_type|
320 // extension can be used with this item. Use a NULL |predecessor|
322 // |predecessor| must be a child of |new_parent| or NULL. Returns false on
326 const BaseNode* predecessor);
354 // Set a new parent and position. Position is specified by |predecessor|; if
355 // it is NULL, the node is moved to the first position. |predecessor| must
357 bool SetPosition(const BaseNode& new_parent, const BaseNode* predecessor);
424 void PutPredecessor(const BaseNode* predecessor);
[all...] |
| syncapi.cc | 760 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 && predecessor->GetParentId() != new_parent.GetId())
[all...] |
| syncapi_unittest.cc | 126 BaseNode* predecessor) {
131 EXPECT_TRUE(node.InitByCreation(model_type, parent_node, predecessor));
[all...] |
| /external/chromium/chrome/browser/sync/glue/ |
| bookmark_change_processor.cc | 215 // This node's index should be one more than the predecessor's index.
304 // Find the bookmark model predecessor, and insert after it.
308 LOG(WARNING) << "Predecessor lookup failed";
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);
[all...] |
| /external/chromium/chrome/browser/sync/syncable/ |
| syncable.cc | [all...] |
| /external/v8/src/ |
| hydrogen.cc | 204 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) const
525 HBasicBlock* predecessor = block->predecessors()->at(k); local
[all...] |
