| /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/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/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/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...] |
| /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...] |
| /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...] |
| /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/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...] |
| /prebuilts/sdk/tools/lib/ |
| lombok-ast-0.2.jar | |
| /prebuilts/tools/common/lombok-ast/ |
| lombok-ast-0.2.1.jar | |
| lombok-ast-0.2.jar | |
| /prebuilts/tools/common/m2/internal/com/ibm/icu/icu4j/2.6.1/ |
| icu4j-2.6.1.jar | |
| /prebuilts/tools/common/m2/internal/com/google/code/findbugs/bcel/2.0.1/ |
| bcel-2.0.1.jar | |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| com.ibm.icu_4.2.1.v20100412.jar | |
| org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | |
| org.eclipse.osgi_3.6.1.R36x_v20100806.jar | |
| org.eclipse.osgi_3.6.2.R36x_v20101103.jar | |
| /prebuilts/tools/common/eclipse/ |
| org.eclipse.osgi_3.6.2.R36x_v20110210.jar | |
| /prebuilts/tools/common/m2/internal/xalan/xalan/2.6.0/ |
| xalan-2.6.0.jar | |
