/dalvik/dx/src/com/android/dx/rop/ |
package-info.java | 75 * successor.<p> 84 * primary successor} which distinguishes a particular control flow path. 88 * {@link Rops#IF_EQZ_INT}, the primary successor represents the path taken 90 * instructions}, the primary successor is the default case.<p> 92 * A basic block's successor list is ordered and may refer to unique labels 95 * appear in the successor list multiple times. In general, the 96 * significance of the successor list's order (like the significance of 97 * the primary successor) is a property of the final instruction of the basic 99 * its successor list in an order identical to the 101 * primary successor (the no-exception case) listed at the end [all...] |
/external/e2fsprogs/intl/ |
finddomain.c | 102 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) 104 if (retval->successor[cnt]->decided == 0) 105 _nl_load_domain (retval->successor[cnt], domainbinding); 107 if (retval->successor[cnt]->data != NULL) 156 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) 158 if (retval->successor[cnt]->decided == 0) 159 _nl_load_domain (retval->successor[cnt], domainbinding); 160 if (retval->successor[cnt]->data != NULL)
|
loadinfo.h | 76 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile 99 furthermore its ->successor[] field contains a list of other lookup
|
l10nflist.c | 346 retval->successor[entries++] 353 retval->successor[entries++] 359 retval->successor[entries] = NULL;
|
/external/webkit/WebKitTools/android/flex-2.5.4a/MISC/ |
NeXT | 4 See KBNS.32.2.029 from the successor of: 6 Otherwise (that successor not yet having been published), ask me for a copy
|
/dalvik/dx/src/com/android/dx/ssa/ |
SsaBasicBlock.java | 59 /** {@code non-null;} successor set (by block list index) */ 63 * {@code non-null;} ordered successor list 69 * block list index of primary successor, or {@code -1} for no primary 70 * successor 351 * @return {@code non-null;} ordered successor list, containing block 359 * @return {@code >= -1;} block index of primary successor or 360 * {@code -1} if no primary successor 367 * @return rop label of primary successor 374 * @return {@code null-ok;} the primary successor block or {@code null} 386 * @return successor list of rop label [all...] |
SsaConverter.java | 111 * unique successor or unique predecessor.<p> 115 * value to have a primary successor that has no other 215 * successor. 244 * Returns {@code true} if block and successor need a Z-node 247 * successor block has more than one predecessor. 250 * @param succ successor node
|
/dalvik/dx/src/com/android/dx/rop/code/ |
BasicBlock.java | 41 * {@code >= -1;} the primary / standard-flow / "default" successor, or 55 * "default" successor, or {@code -1} if this block has no 165 * Gets the primary successor of this block. 167 * @return {@code >= -1;} the primary successor, or {@code -1} if this 175 * Gets the secondary successor of this block. It is only valid to call 178 * @return {@code >= 0;} the secondary successor
|
BasicBlockList.java | 221 * Gets the preferred successor for the given block. If the block 222 * only has one successor, then that is the preferred successor. 223 * Otherwise, if the block has a primay successor, then that is 224 * the preferred successor. If the block has no successors, then 228 * @return {@code null-ok;} the preferred successor, if any
|
LocalVariableExtractor.java | 172 * Merge this state into the start state for each successor,
|
/dalvik/dx/src/com/android/dx/ssa/back/ |
IdenticalBlockCombiner.java | 32 * Searches for basic blocks that all have the same successor and insns 134 * all of the successor links that point to the beta blocks to point 161 * @param oldLabel label of successor to replace 162 * @param newLabel label of new successor
|
/dalvik/dx/tests/083-ssa-phi-placement/ |
Blort.java | 45 * This method requires an ordered successor list with
|
/dalvik/dx/tests/086-ssa-edge-split/ |
Blort.java | 57 * a result needs to have a unique successor. This appies
|
/dalvik/vm/compiler/codegen/arm/ |
GlobalOptimizations.c | 22 * Identify unconditional branches that jump to the immediate successor of the
|
/external/webkit/WebKitTools/android/flex-2.5.4a/ |
sym.c | 61 register struct hash_entry *successor; local 80 if ( (successor = table[hash_val]) != 0 ) 82 new_entry->next = successor; 83 successor->prev = new_entry;
|
/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) + " ");
|
/dalvik/dx/src/com/android/dx/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/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
|
RopperMachine.java | 88 /** primary successor index */ 221 * Gets the primary successor index. This is the index into the 224 * successor. This may return something other than 228 * @return {@code >= -1;} the primary successor index 589 * primary successor. [all...] |
/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/icu4c/config/ |
mh-darwin | 2 ## Darwin-specific setup (Darwin is the Mac OS X developer preview, successor
|
/external/e2fsprogs/e2fsck/ |
dict.c | 150 * dict_next() successor function, verifying that the key of each node is 151 * strictly lower than that of its successor, if duplicates are not allowed, 670 * successor (i.e. the leftmost node in the right subtree.) By doing this, 671 * we avoid the traditional algorithm under which the successor's key and 672 * value *only* move to the deleted node and the successor is spliced out 674 * pointers to the successor, or nodes may be inextricably tied to some 690 * First, splice out the successor from the tree completely, by 705 * Now that the successor has been extricated from the tree, install it 887 * Return the given node's successor node---the node which has the 889 * no successor, a null pointer is returned rather than a pointer t [all...] |
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
basic-block.h | 638 /* Returns true if BB has precisely one successor. */ 654 /* Returns the single successor edge of basic block BB. Aborts if 655 BB does not have exactly one successor. */ 674 /* Returns the single successor block of basic block BB. Aborts 675 if BB does not have exactly one successor. */ 801 vector of predecessor or successor edges. It must not be used when [all...] |
/external/opencore/oscl/oscl/osclbase/src/ |
oscl_tree.cpp | 126 y = y->right; // z's successor. x might be null. 132 if (y != z) // relink y in place of z. y is z's successor
|