| /external/llvm/lib/CodeGen/ |
| UnreachableBlockElim.cpp | 152 MachineBasicBlock* succ = *BB->succ_begin(); local
154 MachineBasicBlock::iterator start = succ->begin();
155 while (start != succ->end() && start->isPHI()) {
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| BasicBlock.java | 186 int succ = successors.get(0); local
187 if (succ == primarySuccessor) {
188 succ = successors.get(1);
191 return succ;
|
| LocalVariableExtractor.java | 182 int succ = successors.get(i); local
183 RegisterSpecSet state = (succ == primarySuccessor) ?
186 if (resultInfo.mergeStarts(succ, state)) {
187 Bits.set(workSet, succ);
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| BasicBlock.java | 186 int succ = successors.get(0); local
187 if (succ == primarySuccessor) {
188 succ = successors.get(1);
191 return succ;
|
| LocalVariableExtractor.java | 182 int succ = successors.get(i); local
183 RegisterSpecSet state = (succ == primarySuccessor) ?
186 if (resultInfo.mergeStarts(succ, state)) {
187 Bits.set(workSet, succ);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| LocalVariableExtractor.java | 199 int succ = successors.get(i); local
200 RegisterSpecSet state = (succ == primarySuccessor) ?
203 if (resultInfo.mergeStarts(succ, state)) {
204 workSet.set(succ);
|
| SsaConverter.java | 247 SsaBasicBlock succ = blocks.get(j); local
249 if (needsNewSuccessor(block, succ)) {
250 block.insertNewSuccessor(succ);
263 * @param succ successor node
267 SsaBasicBlock succ) {
273 && succ.getPredecessors().cardinality() > 1;
|
| SsaBasicBlock.java | 604 SsaBasicBlock succ; local
606 succ = parent.getBlocks().get(i);
607 succ.addMoveToBeginning(result, source);
[all...] |
| SCCP.java | 483 SsaBasicBlock succ = insn.getBlock().getPrimarySuccessor(); local
484 result = succ.getInsns().get(0).getResult();
|
| EscapeAnalysis.java | 157 int succ = insn.getBlock().getSuccessors().nextSetBit(0); local
158 ArrayList<SsaInsn> succInsns = ssaMeth.getBlocks().get(succ).getInsns();
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 88 ExplodedNode *succ = *(node->succ_begin()); local
89 if (succ->pred_size() != 1)
119 pred->replaceSuccessor(succ);
120 succ->replacePredecessor(pred);
|
| /external/llvm/include/llvm/Analysis/ |
| RegionIterator.h | 70 RegionNode *succ; local
71 succ = getNode()->getParent()->getNode(BB);
72 assert(succ && "BB not in Region or entered subregion!");
73 return succ;
|
| /dalvik/dx/src/com/android/dx/command/dump/ |
| BlockDumper.java | 251 int succ = successors.get(j); local
252 parsed(bytes, end, 0, "next " + Hex.u2(succ));
335 int succ = successors.get(i); local
337 sb.append(Hex.u2(succ));
339 if ((ssz != 1) && (succ == primary)) {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 180 * - all live nodes are reachable from head via succ()
194 * - the last node is always reachable from tail via succ()
255 * as sentinel for succ(), below.
267 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
403 for (Node<E> p = first(); p != null; p = succ(p))
421 for (Node<E> p = first(); p != null; p = succ(p)) {
443 for (Node<E> p = first(); p != null; p = succ(p)) {
448 Node<E> next = succ(p);
537 for (Node<E> p = first(); p != null; p = succ(p)) {
586 for (p = first(); p != null && k < a.length; p = succ(p))
[all...] |
| LinkedBlockingDeque.java | 1052 private Node<E> succ(Node<E> n) { method in class:LinkedBlockingDeque.AbstractItr
[all...] |
| ConcurrentLinkedDeque.java | 222 * - all live nodes are reachable from the first node via succ()
684 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedDeque
783 for (Node<E> p = first(); p != null; p = succ(p)) {
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 263 int succ = block.getPrimarySuccessor(); local
271 if ((succ >= 0) && (succ != nextLabel)) {
286 output.reverseBranch(1, addresses.getStart(succ));
295 addresses.getStart(succ));
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| RopTranslator.java | 270 int succ = block.getPrimarySuccessor(); local
278 if ((succ >= 0) && (succ != nextLabel)) {
293 output.reverseBranch(1, addresses.getStart(succ));
302 addresses.getStart(succ));
|
| /external/safe-iop/src/ |
| safe_iop.c | 1091 int tests = 0, succ = 0, fail = 0; local
[all...] |
| /external/wpa_supplicant_8/wpa_supplicant/dbus/ |
| dbus_new.c | 124 dbus_bool_t succ; local
138 succ = success ? TRUE : FALSE;
139 if (dbus_message_append_args(msg, DBUS_TYPE_BOOLEAN, &succ,
[all...] |
| /external/libpcap/ |
| gencode.h | 225 struct block *succ; member in struct:edge
329 #define JT(b) ((b)->et.succ)
330 #define JF(b) ((b)->ef.succ)
|
| /external/v8/test/cctest/ |
| test-regexp.cc | 1068 Label fail, succ; local
1481 unibrow::uchar succ[unibrow::Ecma262UnCanonicalize::kMaxWidth]; local
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Ropper.java | 755 int succ = successors.get(i); local
757 mergeAndWorkAsNecessary(succ, block.getLabel(),
760 ex.addContext("...while merging to block " + Hex.u2(succ));
1654 int succ = successors.get(i); local
[all...] |
| /external/dbus/test/ |
| decode-gcov.c | 628 Arc *succ; member in struct:Block
689 arc->succ_next = function->block_graph[source].succ;
690 function->block_graph[source].succ = arc;
727 /* Must reverse the order of all succ arcs, to ensure that they match
733 if (func->block_graph[i].succ)
734 func->block_graph[i].succ = reverse_arcs (func->block_graph[i].succ);
933 current_arc = current_func->block_graph[current_block].succ;
981 current_arc = current_func->block_graph[current_block].succ;
1051 current_arc = current_func->block_graph[current_block].succ;
[all...] |
