/macosx-10.10/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
|
/macosx-10.10/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGCriticalEdgeBreakingPhase.cpp | 55 // An edge A->B is critical if A has multiple successor and B has multiple 62 BasicBlock** successor = &block->successor(i); local 63 if ((*successor)->predecessors.size() <= 1) 66 breakCriticalEdge(block, successor); 74 void breakCriticalEdge(BasicBlock* predecessor, BasicBlock** successor) argument 78 BasicBlock* pad = m_insertionSet.insertBefore(*successor, PNaN); 80 m_graph, SpecNone, Jump, (*successor)->at(0)->origin, OpInfo(*successor)); 82 (*successor) [all...] |
H A D | DFGLoopPreHeaderCreationPhase.cpp | 54 BasicBlock*& successor = predecessor->successor(successorIndex); local 55 if (successor != block) 57 successor = preHeader;
|
H A D | DFGCFGSimplificationPhase.cpp | 65 if (block->successor(0)->predecessors.size() == 1) { 66 ASSERT(block->successor(0)->predecessors[0] == block); 70 mergeBlocks(block, block->successor(0), noBlocks()); 78 // Idea: what if I slam the ghosties into my successor? Nope, that's 79 // suboptimal, because if my successor has multiple predecessors then we'll 118 if (block->successor(0) == block->successor(1)) { 119 convertToJump(block, block->successor(0)); 170 BasicBlock* jettisonedBlock = block->successor(i); 353 BasicBlock* successor local [all...] |
H A D | DFGOSRAvailabilityAnalysisPhase.cpp | 128 BasicBlock* successor = block->successor(successorIndex); local 130 successor->ssa->availabilityAtHead[i] = availability[i].merge( 131 successor->ssa->availabilityAtHead[i]);
|
H A D | DFGNaturalLoops.cpp | 75 BasicBlock* successor = block->successor(i); local 76 if (!graph.m_dominators.dominates(successor, block)) 80 if (m_loops[j].header() == successor) { 88 NaturalLoop loop(successor, m_loops.size());
|
H A D | DFGInvalidationPointInjectionPhase.cpp | 66 blocksThatNeedInvalidationPoints.set(block->successor(i)->index);
|
H A D | DFGBasicBlock.h | 88 BasicBlock*& successor(unsigned index) function in struct:JSC::DFG::BasicBlock 90 return last()->successor(index);
|
H A D | DFGGraph.cpp | 519 void Graph::handleSuccessor(Vector<BasicBlock*, 16>& worklist, BasicBlock* block, BasicBlock* successor) argument 521 if (!successor->isReachable) { 522 successor->isReachable = true; 523 worklist.append(successor); 526 successor->predecessors.append(block); 537 handleSuccessor(worklist, block, block->successor(i)); 647 addForDepthFirstSort(result, worklist, seen, block->successor(i));
|
/macosx-10.10/bash-94.1.2/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;
|
/macosx-10.10/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;
|
/macosx-10.10/bind9-45.101/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.10/JavaScriptCore-7600.1.17/bytecode/ |
H A D | BytecodeBasicBlock.cpp | 109 static void linkBlocks(BytecodeBasicBlock* predecessor, BytecodeBasicBlock* successor) argument 111 predecessor->addSuccessor(successor); 112 successor->addPredecessor(predecessor);
|
H A D | BytecodeLivenessAnalysis.cpp | 318 BytecodeBasicBlock* successor = block->successors()[j]; local 319 dataLogF("%p ", successor);
|
/macosx-10.10/WTF-7600.1.24/wtf/ |
H A D | RedBlackTree.h | 58 const NodeType* successor() const function in class:WTF::RedBlackTree::Node 84 NodeType* successor() function in class:WTF::RedBlackTree::Node 86 return const_cast<NodeType*>(const_cast<const Node*>(this)->successor()); 221 y = z->successor(); 346 for (NodeType* current = first(); current; current = current->successor())
|
H A D | MetaAllocator.cpp | 41 FreeSpaceNode* next = node->successor(); 292 for (FreeSpaceNode* node = m_freeSpaceSizeMap.first(); node; node = node->successor())
|
/macosx-10.10/emacs-93/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.10/llvmCore-3425.0.34/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.10/xnu-2782.1.97/osfmk/kern/ |
H A D | queue.h | 237 queue_entry_t successor; local 240 successor = pred->next; 241 entry->next = successor; 243 successor->prev = entry;
|
/macosx-10.10/emacs-93/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.10/CPANInternal-159.1/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
|