| /external/chromium_org/v8/src/ |
| hydrogen-mark-unreachable.cc | 23 HBasicBlock* predecessor = it.Current(); local
28 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) {
31 predecessor->end()->KnownSuccessorBlock(&pred_succ);
|
| hydrogen.cc | 265 HBasicBlock* predecessor = predecessors_[i]; local
266 ASSERT(predecessor->end()->IsGoto());
267 HSimulate* simulate = HSimulate::cast(predecessor->end()->previous());
269 (predecessor->last_environment()->closure().is_null() ||
270 predecessor->last_environment()->closure()->shared()
273 predecessor->last_environment()->set_ast_id(ast_id);
334 // Only loop header blocks can have a predecessor added after
359 // succeeding block in this list, the predecessor is before the successor.
401 // exceed the number of previously encountered predecessor edges, there is no
414 HBasicBlock* predecessor = it.Current() local
606 HBasicBlock* predecessor = block->predecessors()->at(k); local
[all...] |
| /art/compiler/optimizing/ |
| graph_visualizer.cc | 88 HBasicBlock* predecessor = block->GetPredecessors().Get(i); local
89 output_ << " \"B" << predecessor->GetBlockId() << "\" ";
|
| nodes.cc | 114 HBasicBlock* predecessor,
117 block->SetDominator(predecessor);
119 block->SetDominator(FindCommonDominator(block->GetDominator(), predecessor));
189 HBasicBlock* predecessor = header->GetPredecessors().Get(pred); local
190 if (predecessor != back_edge) {
191 predecessor->ReplaceSuccessor(header, pre_header);
|
| register_allocator.cc | 970 HBasicBlock* predecessor = current->GetPredecessors().Get(i); local
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 123 * unique successor or unique predecessor.<p>
128 * predecessor. This ensures move statements can always be
163 * predecessor created for it
168 * predecessors needs a new predecessor node.
182 * unique move-exception block for each predecessor.
198 * one predecessor...
208 SsaBasicBlock predecessor = blocks.get(j); local
210 = predecessor.insertNewSuccessor(block);
259 * successor block has more than one predecessor.
261 * @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/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...] |
| /external/chromium_org/sync/internal_api/public/base/ |
| 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);
|
| /frameworks/base/core/java/android/view/ |
| Choreographer.java | 822 CallbackRecord predecessor = null; local
[all...] |
| ViewGroup.java | 794 // Cannot click on a view with an invisible predecessor.
1851 HoverTarget predecessor = null; local
2163 TouchTarget predecessor = null; local
2301 TouchTarget predecessor = null; local
2324 TouchTarget predecessor = null; local
[all...] |
| ViewRootImpl.java | 6845 View predecessor = getCommonPredecessor(mSource, source); local
[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 | 57 * information about a thread in the predecessor of its node. A
59 * should block. A node is signalled when its predecessor
87 * predecessor. For explanation of similar mechanics in the case
93 * predecessor signals the next node to wake up by traversing
107 * a new predecessor, unless we can identify an uncancelled
108 * predecessor who will carry this responsibility.
184 * Link to predecessor node that current node/thread relies on
187 * cancellation of a predecessor, we short-circuit while
201 * assign next field of a predecessor until after attachment,
238 * Use when predecessor cannot be null. The null check coul
243 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedLongSynchronizer.Node
[all...] |
| AbstractQueuedSynchronizer.java | 287 * information about a thread in the predecessor of its node. A
289 * should block. A node is signalled when its predecessor
317 * predecessor. For explanation of similar mechanics in the case
323 * predecessor signals the next node to wake up by traversing
337 * a new predecessor, unless we can identify an uncancelled
338 * predecessor who will carry this responsibility.
414 * Link to predecessor node that current node/thread relies on
417 * cancellation of a predecessor, we short-circuit while
431 * assign next field of a predecessor until after attachment,
468 * Use when predecessor cannot be null. The null check coul
473 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedSynchronizer.Node
[all...] |
| /external/chromium_org/chrome/browser/sync/ |
| 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));
458 syncer::ReadNode* predecessor = NULL; 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/repository/com/android/tools/external/lombok/lombok-ast/0.2.1/ |
| lombok-ast-0.2.1.jar | |
| /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/2.6.1/ |
| icu4j-2.6.1.jar | |
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| bcel.jar | |
| /prebuilts/tools/common/m2/repository/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 | |
