| /external/chromium/chrome/browser/resources/sync_internals/ |
| sync_node_browser.html | 49 <td>Successor</td>
|
| /external/chromium/chrome/browser/sync/syncable/ |
| syncable_id.cc | 54 // The successor of a string is given by appending the least
|
| /dalvik/dx/src/com/android/dx/command/dump/ |
| DotDumper.java | 148 int successor = successors.get(j); local
150 if (successor != bb.getPrimarySuccessor()) {
151 System.out.print(" n" + Hex.u2(successor) + " ");
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 69 /// Predecessors/Successors - Keep track of the predecessor / successor
237 /// getLandingPadSuccessor - If this block has a successor that is a landing
257 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
264 /// removeSuccessor - Remove successor from the successors list of this
269 /// removeSuccessor - Remove specified successor from the successors list of
275 /// replaceSuccessor - Replace successor OLD with NEW and update weight info.
286 /// in transferSuccessors, and update PHI operands in the successor blocks
290 /// isSuccessor - Return true if the specified MBB is a successor of this
297 /// that MBB need not be a successor at all, for example if this block
337 /// given successor block, and return the newly created block, or nul
[all...] |
| LatencyPriorityQueue.h | 89 // successor nodes that have a single unscheduled predecessor. If so, that
|
| /external/llvm/lib/Transforms/Scalar/ |
| BasicBlockPlacement.cpp | 22 // placing the most frequently executed successor until we run out of blocks. I
129 // Scan for the first unplaced successor.
149 // Now that we picked the maximally executed successor, place it.
|
| LoopUnswitch.cpp | 312 // Check to see if the successor is a trivial loop exit.
363 // Check to see if a successor of the branch is guaranteed to
378 // Check to see if a successor of the switch is guaranteed to go to the
650 "Exit block should have been split to have one successor!");
653 // If the successor of the exit block had PHI nodes, add an entry for
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 273 * The block has a "primary successor" and that primary
274 * successor isn't the next block to be output.
281 * secondary successor (the "then") is in fact the
322 * and then pick its first as-yet unordered successor to
324 * (aka default) successor (if any). Keep following successors
336 * block as its primary successor, and so on, until we
400 * Order the current block's preferred successor
619 * successor in the list is the primary (in this case, the
653 * Looks forward to the current block's primary successor, returning
658 * primary successor
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| RopTranslator.java | 280 * The block has a "primary successor" and that primary
281 * successor isn't the next block to be output.
288 * secondary successor (the "then") is in fact the
329 * and then pick its first as-yet unordered successor to
331 * (aka default) successor (if any). Keep following successors
343 * block as its primary successor, and so on, until we
407 * Order the current block's preferred successor
626 * successor in the list is the primary (in this case, the
660 * Looks forward to the current block's primary successor, returning
665 * primary successor
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Ropper.java | 186 * Generates a list of subroutine successors. Note: successor blocks
187 * could be listed more than once. This is ok, because this successor
200 * target is us, add the ret target (subroutine successor)
693 * successor.
769 * tell it at this point that its sole successor is the
900 * so it should only have one successor.
[all...] |
| ByteBlock.java | 131 * @return {@code non-null;} the successor list
|
| /external/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 19 // the predecessor fields (the successor information is filled in however).
186 // the successor set of an interval up to date.
200 } else { // In other interval, add as successor
220 // If we were in the successor list from before... remove from succ list
|
| PathNumbering.h | 81 // Iterator information for successor edges. Includes phony and
93 // Add an edge to the successor list.
96 // Remove an edge from the successor list.
111 // Holds the successor edges of this node.
|
| IntervalPartition.h | 101 // updatePredecessors - Interval generation only sets the successor fields of
103 // run through all of the intervals and propagate successor info as
|
| /external/llvm/lib/CodeGen/ |
| MachineSink.cpp | 10 // This pass moves instructions into successor blocks when possible, so that
158 // BreakPHIEdge is true if all the uses are in the successor MBB being sunken
405 /// instruction out of its current block into a successor.
428 // SuccToSinkTo - This is the successor to sink this instruction to, once we
472 // FIXME: This picks a successor to sink into based on having one
473 // successor that dominates all the uses. However, there are cases where
474 // sinking can happen but where the sink point isn't a successor. For
561 // successor. We could be introducing calculations to new code paths.
596 // BreakPHIEdge is true if all the uses are in the successor MBB being
|
| /external/llvm/test/CodeGen/X86/ |
| shl_undef.ll | 6 ; the successor shl(s) become shl undef, 1. This pattern then matches
|
| /external/e2fsprogs/intl/ |
| loadinfo.h | 76 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
99 furthermore its ->successor[] field contains a list of other lookup
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| EdgeProfiling.cpp | 100 // only have a single successor, insert the counter in this block,
101 // otherwise insert it in the successor block.
|
| /external/tagsoup/src/org/ccil/cowan/tagsoup/ |
| Element.java | 18 An Element has an element type, attributes, and a successor Element
28 private Element theNext; // successor of element
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 160 // Move all definitions in the successor to the predecessor...
238 /// GetSuccessorNumber - Search for the specified successor of basic block BB
241 /// successor.
265 // If the edge isn't critical, then BB has a single successor or Succ has a
269 // If the successor only has a single pred, split the top of the successor
276 // Otherwise, if BB has a single successor, split it at the bottom of the
635 // Successor is in VisitStack, it's a back edge.
641 // Go down one level if there is a unvisited successor.
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 80 /// GetSuccessorNumber - Search for the specified successor of basic block BB
83 /// successor.
100 /// specified successor will be merged into the same critical edge block.
|
| /dalvik/dexgen/src/com/android/dexgen/rop/ |
| ByteBlock.java | 131 * @return {@code non-null;} the successor list
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExprEngine.h | 133 /// processCFGElement - Called by CoreEngine. Used to generate new successor
158 /// ProcessBranch - Called by CoreEngine. Used to generate successor
166 /// processIndirectGoto - Called by CoreEngine. Used to generate successor
170 /// ProcessSwitch - Called by CoreEngine. Used to generate successor
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 68 // (1) 1 predecessor (that has one successor)
69 // (2) 1 successor (that has one predecessor)
116 // (a) changing the predecessors successor to the successor of this node
|
| /external/icu4c/config/ |
| mh-darwin | 2 ## Darwin-specific setup (Darwin is the Mac OS X developer preview, successor
|
