| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/ |
| text_file.py | 61 predecessor; only matters if (join_lines and not lstrip_ws)
|
| /external/chromium_org/chrome/browser/extensions/ |
| chrome_app_sorting.cc | 266 // Only a predecessor.
271 // Both a successor and predecessor
|
| /external/chromium_org/chrome/browser/sync/glue/ |
| generic_change_processor.cc | 397 error.Reset(FROM_HERE, error_prefix + "failed to set predecessor",
401 LOG(ERROR) << "Create: Bad predecessor.";
|
| /external/chromium_org/chrome/browser/ui/website_settings/ |
| website_settings.cc | 242 if (r1 == ContentSettingsPattern::PREDECESSOR) {
249 if (r2 == ContentSettingsPattern::PREDECESSOR)
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 409 Coalesce(prev[0]); // maybe coalesce with predecessor
446 AllocList *before = &arena->freelist; // predecessor of s
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 409 Coalesce(prev[0]); // maybe coalesce with predecessor
446 AllocList *before = &arena->freelist; // predecessor of s
|
| /external/llvm/include/llvm/CodeGen/ |
| AsmPrinter.h | 282 /// exactly one predecessor and the control transfer mechanism between
283 /// the predecessor and this block is a fall-through.
|
| /external/llvm/lib/CodeGen/ |
| MachineSink.cpp | 205 // PHI nodes use the operand in the predecessor block, not the block with
376 // sources are only defined on the specific predecessor edges.
|
| IfConversion.cpp | 459 /// predecessor) forms a valid simple shape for ifcvt. It also returns the
483 /// with their common predecessor) forms a valid triangle shape for ifcvt.
528 /// with their common predecessor) forms a valid diamond shape for ifcvt.
[all...] |
| ScheduleDAGInstrs.cpp | [all...] |
| /external/llvm/lib/IR/ |
| Instruction.cpp | 399 /// operands in the corresponding predecessor block.
402 // PHI nodes uses values in the corresponding predecessor block. For other
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 421 /// getSingleUnscheduledPred - If there is exactly one unscheduled predecessor
429 // We found an available, but not scheduled, predecessor. If it's the
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| EarlyCSE.cpp | 412 // If this block has a single predecessor, then the predecessor is the parent
|
| LoopRotation.cpp | 338 // This code assumes that the new header has exactly one predecessor.
462 // one predecessor.
|
| ScalarReplAggregates.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LowerInvoke.cpp | 209 // If there are any phi nodes left, they must have a single predecessor.
361 // Uses for a PHI node occur in their predecessor block.
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedBlockingQueue.java | 74 * keep all Nodes GC-reachable from a predecessor dequeued Node.
489 * Unlinks interior Node p with predecessor trail.
|
| /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...] |
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/ |
| 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/bison/ |
| COPYING | 458 licenses to the work the party's predecessor in interest had or could
460 Corresponding Source of the work from the predecessor in interest, if
461 the predecessor has it or can get it with reasonable efforts.
[all...] |
| NOTICE | 458 licenses to the work the party's predecessor in interest had or could
460 Corresponding Source of the work from the predecessor in interest, if
461 the predecessor has it or can get it with reasonable efforts.
[all...] |
| /external/bison/doc/ |
| gpl-3.0.texi | 491 licenses to the work the party's predecessor in interest had or could
493 Corresponding Source of the work from the predecessor in interest, if
494 the predecessor has it or can get it with reasonable efforts.
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCleanup.cpp | 444 // predecessor.
451 // Replace all uses of the entry with the predecessor, in case there
845 // Check whether we can merge NormalEntry into a single predecessor.
[all...] |
