| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/adaptivestreaming/ |
| AbstractManifestWriter.java | 111 throw new IOException("Track does not have the same fragment borders as its predecessor.");
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaBasicBlock.java | 53 /** {@code non-null;} predecessor set (by block list index) */
139 * @param parent method of this block predecessor set will be
410 * Inserts a new empty GOTO block as a predecessor to this block.
445 * A as B's predecessor. A and B will no longer be directly connected.
543 * is not an exit predecessor or is the exit block, this block does
555 * This is an exit predecessor.
596 * only us as a predecessor.
890 * because a move-exception block, having only one predecessor
[all...] |
| /external/chromium_org/chrome/common/ |
| content_settings_pattern.h | 54 // - PREDECESSOR:
61 PREDECESSOR = 1,
|
| content_settings_pattern_unittest.cc | 552 EXPECT_EQ(ContentSettingsPattern::PREDECESSOR,
559 EXPECT_EQ(ContentSettingsPattern::PREDECESSOR,
566 EXPECT_EQ(ContentSettingsPattern::PREDECESSOR,
573 EXPECT_EQ(ContentSettingsPattern::PREDECESSOR,
580 EXPECT_EQ(ContentSettingsPattern::PREDECESSOR,
592 EXPECT_EQ(ContentSettingsPattern::PREDECESSOR,
599 EXPECT_EQ(ContentSettingsPattern::PREDECESSOR,
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| __init__.py | 77 * prev_item(key) -> get (k, v) pair, where k is predecessor to key, O(log(n))
78 * prev_key(key) -> k, get the predecessor of key, O(log(n))
|
| /external/chromium_org/third_party/libjingle/source/talk/xmllite/ |
| xmlelement.h | 213 void InsertChildAfter(XmlChild* predecessor, XmlChild* new_child);
214 void RemoveChildAfter(XmlChild* predecessor);
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaBasicBlock.java | 54 /** {@code non-null;} predecessor set (by block list index) */
140 * @param parent method of this block predecessor set will be
411 * Inserts a new empty GOTO block as a predecessor to this block.
446 * A as B's predecessor. A and B will no longer be directly connected.
544 * is not an exit predecessor or is the exit block, this block does
556 * This is an exit predecessor.
597 * only us as a predecessor.
891 * because a move-exception block, having only one predecessor
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| basic-block.h | 546 /* Returns true if BB has precisely one predecessor. */
564 /* Returns the single predecessor edge of basic block BB. Aborts
565 if BB does not have exactly one predecessor. */
583 /* Returns the single predecessor block of basic block BB. Aborts
584 if BB does not have exactly one predecessor.*/
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 546 /* Returns true if BB has precisely one predecessor. */
564 /* Returns the single predecessor edge of basic block BB. Aborts
565 if BB does not have exactly one predecessor. */
583 /* Returns the single predecessor block of basic block BB. Aborts
584 if BB does not have exactly one predecessor.*/
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| basic-block.h | 546 /* Returns true if BB has precisely one predecessor. */
564 /* Returns the single predecessor edge of basic block BB. Aborts
565 if BB does not have exactly one predecessor. */
583 /* Returns the single predecessor block of basic block BB. Aborts
584 if BB does not have exactly one predecessor.*/
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 546 /* Returns true if BB has precisely one predecessor. */
564 /* Returns the single predecessor edge of basic block BB. Aborts
565 if BB does not have exactly one predecessor. */
583 /* Returns the single predecessor block of basic block BB. Aborts
584 if BB does not have exactly one predecessor.*/
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
|
| /external/llvm/lib/CodeGen/ |
| ExecutionDepsFix.cpp | 143 /// True when the current block has a predecessor that hasn't been visited
336 // enterBasicBlock - Set up LiveRegs by merging predecessor live-out values.
381 // Use the most recent predecessor def for each register.
392 // We have a live DomainValue from more than one predecessor.
394 // We are already collapsed, but predecessor is not. Force him.
401 // Currently open, merge in predecessor.
|
| MachineBlockPlacement.cpp | 283 /// having one fewer active predecessor. It also adds any successors of this
284 /// chain which reach the zero-predecessor state to the worklist passed in.
291 // a predecessor placed.
295 // predecessor to the worklist as a viable candidate for CFG-neutral
309 // loop predecessor count of the destination chain.
368 // predecessor.
592 // If no direct predecessor is fine, just use the loop header.
620 // analyzable branches, *and* the predecessor it is merged with is *not* part
[all...] |
| TailDuplication.cpp | 169 dbgs() << " missing input from predecessor BB#"
180 dbgs() << " extra input from predecessor BB#"
448 /// UpdateSuccessorsPHIs - After FromBB is tail duplicated into its predecessor
497 // If we didn't duplicate a bb into a particular predecessor, we
755 // avoids trouble with the predecessor list reallocating.
775 // Don't duplicate into a fall-through predecessor (at least for now).
798 // at the end of predecessor BB, then it should be added to its
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsAsmPrinter.cpp | 290 /// exactly one predecessor and the control transfer mechanism between
291 /// the predecessor and this block is a fall-through.
294 // The predecessor has to be immediately before this block.
297 // If the predecessor is a switch statement, assume a jump table
308 // If there isn't exactly one predecessor, it can't be a fall through.
315 // The predecessor has to be immediately before this block.
|
| /external/llvm/lib/Transforms/Utils/ |
| SSAUpdater.cpp | 93 // predecessor.
97 // We can get our predecessor info by walking the pred_iterator list, but it
99 // of them to get the predecessor list instead.
245 // We can get our predecessor info by walking the pred_iterator list,
247 // block, walk one of them to get the predecessor list instead.
273 /// the specified predecessor block.
|
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| 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...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedTransferQueue.java | 324 * at one time known to be the predecessor of some node s that is
326 * its predecessor if it still points to s (otherwise s must
333 * predecessor node that is matched (including the case of being
334 * cancelled): the predecessor may already be unspliced, in which
339 * or its predecessor are (or can be made to be) at, or fall off
351 * entire list to find an actual predecessor to unlink (which
628 * different mode, else s's predecessor, or s itself if no
629 * predecessor
661 * @param pred the predecessor of s, or s itself if it has no
662 * predecessor, or null if unknown (the null case does not occu
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGFast.cpp | 85 /// AddPred - adds a predecessor edge to SUnit SU.
86 /// This returns true if this is a new predecessor.
91 /// RemovePred - removes a predecessor edge from SUnit SU.
137 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to
168 // clobber the register is scheduled between the predecessor and
180 /// count of its predecessors. If a predecessor pending count is zero, add it to
700 assert(Degree > 0 && "Predecessor over-released!");
|
| /external/chromium_org/chrome/browser/sync/ |
| profile_sync_service_bookmark_unittest.cc | 88 syncer::ReadNode predecessor(trans_);
89 EXPECT_EQ(BaseNode::INIT_OK, predecessor.InitByIdLookup(predecessor_id));
90 EXPECT_EQ(predecessor.GetParentId(), parent.GetId());
91 EXPECT_TRUE(node.InitBookmarkByCreation(parent, &predecessor));
189 // Set a new parent and predecessor value. Return the old parent id.
190 // We could return the old predecessor id, but it turns out not to be
201 syncer::ReadNode predecessor(trans_);
202 EXPECT_EQ(BaseNode::INIT_OK, predecessor.InitByIdLookup(predecessor_id));
203 EXPECT_EQ(predecessor.GetParentId(), parent.GetId());
204 EXPECT_TRUE(node.SetPosition(parent, &predecessor));
460 syncer::ReadNode* predecessor = NULL; local
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| nfrule.cpp | 92 const NFRule *predecessor,
122 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status);
183 rule2->extractSubstitutions(ruleSet, predecessor, rbnf, status);
195 rule1->extractSubstitutions(ruleSet, predecessor, rbnf, status);
369 * @param predecessor The rule preseding this one in "owners" rule list
374 const NFRule* predecessor,
379 sub1 = extractSubstitution(ruleSet, predecessor, rbnf, status);
380 sub2 = extractSubstitution(ruleSet, predecessor, rbnf, status);
389 * @param predecessor The rule preceding this one in the rule set's
398 const NFRule* predecessor,
[all...] |
| /external/icu4c/i18n/ |
| 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...] |
| /external/chromium/chrome/browser/sync/engine/ |
| 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...] |
| /external/chromium_org/sync/syncable/ |
| directory.h | 276 // the same folder. Returns the "root" ID if there is no predecessor
284 // Places |e| as a successor to |predecessor|. If |predecessor| is NULL,
287 // Both |e| and |predecessor| must be valid entries under the same parent.
293 void PutPredecessor(EntryKernel* e, EntryKernel* predecessor);
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 69 /// Predecessors/Successors - Keep track of the predecessor / successor
392 /// isPredecessor - Return true if the specified MBB is a predecessor of this
642 /// addPredecessor - Remove pred as a predecessor of this MachineBasicBlock.
648 /// removePredecessor - Remove pred as a predecessor of this
705 // to be when traversing the predecessor edges of a MBB
|
