| /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);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 185 * - all live nodes are reachable from head via succ()
199 * - the last node is always reachable from tail via succ()
249 * as sentinel for succ(), below.
261 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
280 Node<E> next = succ(p);
290 p = succ(p);
309 Node<E> next = succ(p);
327 Node<E> next = succ(p);
355 Node<E> next = succ(p);
389 for (Node<E> p = first(); p != null; p = succ(p))
[all...] |
| ConcurrentLinkedDeque.java | 165 * - all live nodes are reachable from the first node via succ()
589 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedDeque
692 for (Node<E> p = first(); p != null; p = succ(p)) {
767 for (Node<E> p = first(); p != null; p = succ(p)) {
799 for (Node<E> p = first(); p != null; p = succ(p)) {
874 for (Node<E> p = first(); p != null; p = succ(p)) {
914 for (Node<E> p = first(); p != null; p = succ(p)) {
949 for (Node<E> p = first(); p != null; p = succ(p))
[all...] |
| ConcurrentSkipListMap.java | 561 * @param succ the expected current successor
565 final boolean link(Index<K,V> succ, Index<K,V> newSucc) {
567 newSucc.right = succ;
568 return n.value != null && casRight(succ, newSucc);
573 * succ. Fails (forcing a retraversal by caller) if this node
575 * @param succ the expected current successor
578 final boolean unlink(Index<K,V> succ) {
579 return !indexesDeletedNode() && casRight(succ, succ.right);
[all...] |
| /external/safe-iop/src/ |
| safe_iop.c | 1091 int tests = 0, succ = 0, fail = 0; local
[all...] |
| /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...] |
| EscapeAnalysis.java | 157 int succ = insn.getBlock().getSuccessors().nextSetBit(0); local
158 ArrayList<SsaInsn> succInsns = ssaMeth.getBlocks().get(succ).getInsns();
[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)
|
| optimize.c | 294 if (ep->succ) {
295 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords);
296 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);
1288 * Return true if any register that is used on exit from 'succ', has
1293 use_conflict(b, succ)
1294 struct block *b, *succ;
1297 atomset use = succ->out_use;
1304 if (b->val[atom] != succ->val[atom])
1371 if (JT(ep->succ) == 0)
1374 if (JT(ep->succ) == JF(ep->succ))
[all...] |
| /dalvik/dx/src/com/android/dx/command/dump/ |
| BlockDumper.java | 248 int succ = successors.get(j); local
249 parsed(bytes, end, 0, "next " + Hex.u2(succ));
337 int succ = successors.get(j); local
339 sb.append(Hex.u2(succ));
341 if ((ssz != 1) && (succ == primary)) {
|
| /dalvik/dx/src/com/android/dx/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));
|
| /external/dbus/test/ |
| decode-gcov.c | 627 Arc *succ; member in struct:Block
688 arc->succ_next = function->block_graph[source].succ;
689 function->block_graph[source].succ = arc;
726 /* Must reverse the order of all succ arcs, to ensure that they match
732 if (func->block_graph[i].succ)
733 func->block_graph[i].succ = reverse_arcs (func->block_graph[i].succ);
932 current_arc = current_func->block_graph[current_block].succ;
980 current_arc = current_func->block_graph[current_block].succ;
1050 current_arc = current_func->block_graph[current_block].succ;
[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/v8/test/cctest/ |
| test-regexp.cc | 1038 Label fail, succ; local
1461 unibrow::uchar succ[unibrow::Ecma262UnCanonicalize::kMaxWidth]; local
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| basic-block.h | 602 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
605 block which is either the pred or succ end of the indexed edge. */
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| basic-block.h | 602 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
605 block which is either the pred or succ end of the indexed edge. */
[all...] |
| /prebuilt/sdk/tools/lib/ |
| dx.jar | |
| /external/webkit/SunSpider/tests/parse-only/ |
| prototype-1.6.0.3.js | 443 succ: function() {
971 succ: function() {
1105 value = value.succ();
[all...] |
| concat-jquery-mootools-prototype.js | [all...] |
| /external/webkit/SunSpider/tests/sunspider-0.9/ |
| string-unpack-code.js | [all...] |
| /external/webkit/SunSpider/tests/sunspider-0.9.1/ |
| string-unpack-code.js | [all...] |
