/macosx-10.9.5/BerkeleyDB-21/db/java/src/com/sleepycat/asm/ |
H A D | Edge.java | 48 * The successor block of the basic block from which this edge originates. 50 Label successor; field in class:Edge
|
H A D | MethodWriter.java | 629 // if opcode == ATHROW or xRETURN, ends current block (no successor) 665 // no stack change, but end of current block (no successor) 812 // successor) 867 // ends current block (with one new successor) 1098 l = b.successor; 1099 // if this successor has not already been pushed onto the 1103 // successor block 1105 // pushes this successor onto the stack 1166 * Adds a successor to the {@link #currentBlock currentBlock} block. 1169 * @param successor th 1171 addSuccessor(final int stackSize, final Label successor) argument [all...] |
/macosx-10.9.5/bash-92/bash-3.2/lib/intl/ |
H A D | finddomain.c | 105 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) 107 if (retval->successor[cnt]->decided == 0) 108 _nl_load_domain (retval->successor[cnt], domainbinding); 110 if (retval->successor[cnt]->data != NULL) 159 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) 161 if (retval->successor[cnt]->decided == 0) 162 _nl_load_domain (retval->successor[cnt], domainbinding); 163 if (retval->successor[cnt]->data != NULL)
|
H A D | loadinfo.h | 84 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile 107 furthermore its ->successor[] field contains a list of other lookup
|
H A D | l10nflist.c | 374 retval->successor[entries++] 381 retval->successor[entries++] 387 retval->successor[entries] = NULL;
|
H A D | dcigettext.c | 639 for (cnt = 0; domain->successor[cnt] != NULL; ++cnt) 641 retval = _nl_find_msg (domain->successor[cnt], binding, 646 domain = domain->successor[cnt];
|
/macosx-10.9.5/cxxfilt-11/cxxfilt/intl/ |
H A D | finddomain.c | 105 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) 107 if (retval->successor[cnt]->decided == 0) 108 _nl_load_domain (retval->successor[cnt], domainbinding); 110 if (retval->successor[cnt]->data != NULL) 159 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) 161 if (retval->successor[cnt]->decided == 0) 162 _nl_load_domain (retval->successor[cnt], domainbinding); 163 if (retval->successor[cnt]->data != NULL)
|
H A D | loadinfo.h | 84 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile 107 furthermore its ->successor[] field contains a list of other lookup
|
H A D | l10nflist.c | 374 retval->successor[entries++] 381 retval->successor[entries++] 387 retval->successor[entries] = NULL;
|
H A D | dcigettext.c | 631 for (cnt = 0; domain->successor[cnt] != NULL; ++cnt) 633 retval = _nl_find_msg (domain->successor[cnt], binding, 638 domain = domain->successor[cnt];
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/ |
H A D | DFGCFGSimplificationPhase.cpp | 66 if (m_graph.m_blocks[m_graph.successor(block, 0)]->m_predecessors.size() == 1) { 67 ASSERT(m_graph.m_blocks[m_graph.successor(block, 0)]->m_predecessors[0] 71 blockIndex, m_graph.successor(block, 0)); 76 mergeBlocks(blockIndex, m_graph.successor(block, 0), NoBlock); 82 blockIndex, m_graph.successor(block, 0)); 83 for (unsigned i = 0; i < m_graph.m_blocks[m_graph.successor(block, 0)]->m_predecessors.size(); ++i) { 86 dataLogF("#%u", m_graph.m_blocks[m_graph.successor(block, 0)]->m_predecessors[i]); 95 // Idea: what if I slam the ghosties into my successor? Nope, that's 96 // suboptimal, because if my successor has multiple predecessors then we'll 150 if (m_graph.successor(bloc 352 BasicBlock* successor = m_graph.m_blocks[m_graph.successor(firstBlock, i)].get(); local [all...] |
H A D | DFGGraph.cpp | 390 BasicBlock* successor = m_blocks[successorIndex].get(); local 391 if (!successor->isReachable) { 392 successor->isReachable = true; 396 successor->m_predecessors.append(blockIndex);
|
H A D | DFGGraph.h | 477 BlockIndex successor(BasicBlock* block, unsigned index) function in class:JSC::DFG::Graph 479 return block->last()->successor(index);
|
H A D | DFGNode.h | 734 BlockIndex successor(unsigned index) function in struct:JSC::DFG::Node
|
/macosx-10.9.5/bind9-45.100/bind9/lib/dns/ |
H A D | rbt.c | 1120 * the successor. All the logic for finding 1772 dns_rbtnode_t *successor; local 1811 * deleted. Find its immediate in-order successor and 1813 * old site of the successor. 1815 successor = RIGHT(delete); 1816 while (LEFT(successor) != NULL) 1817 successor = LEFT(successor); 1820 * The successor cannot possibly have a left child; 1823 if (RIGHT(successor) ! 2385 dns_rbtnode_t *current, *successor; local 2447 dns_rbtnode_t *current, *previous, *successor; local 2492 dns_rbtnode_t *current, *previous, *successor; local [all...] |
/macosx-10.9.5/emacs-92/emacs/src/ |
H A D | intervals.c | 1490 /* Merge interval I with its lexicographic successor. The resulting 1492 successor. The properties of I are lost. I is removed from the 1504 register INTERVAL successor; 1514 successor = i->right; 1515 while (! NULL_LEFT_CHILD (successor)) 1517 successor->total_length += absorb; 1518 CHECK_TOTAL_LENGTH (successor); 1519 successor = successor->left; 1522 successor 1491 register INTERVAL successor; local [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
H A D | PathNumbering.cpp | 97 // Returns an iterator over successor edges. Includes phony and 103 // Returns the end sentinel for the successor iterator. 108 // Returns the number of successor edges. Includes phony and 124 // Add an edge to the successor list. 129 // Remove an edge from the successor list. 290 // Iterate through each successor edge, adding phony edges 400 for(succ_iterator successor = succ_begin(currentBlock), 401 succEnd = succ_end(currentBlock); successor != succEnd; 402 oldSuccessor = *successor, ++successor ) { [all...] |
/macosx-10.9.5/emacs-92/emacs/lisp/mh-e/ |
H A D | mh-thread.el | 444 (defun mh-thread-ancestor-p (ancestor successor) 449 (while successor 450 (when (eq ancestor successor) (return t)) 451 (setq successor (mh-container-parent successor)))
|
/macosx-10.9.5/CPANInternal-140/Graph/lib/Graph/ |
H A D | Traversal.pm | 63 if (exists $attr{ successor }) { # Graph 0.201 compatibility. 64 $self->{ tree_edge } = $self->{ non_tree_edge } = $attr{ successor }; 143 successor unseen_successor seen_successor 675 =item successor
|
/macosx-10.9.5/CPANInternal-140/Graph-0.94/lib/Graph/ |
H A D | Traversal.pm | 63 if (exists $attr{ successor }) { # Graph 0.201 compatibility. 64 $self->{ tree_edge } = $self->{ non_tree_edge } = $attr{ successor }; 143 successor unseen_successor seen_successor 682 =item successor
|
/macosx-10.9.5/vim-53/runtime/autoload/ |
H A D | netrw.vim | 2149 echo "Sorry, no successor directory exists yet"
|