/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 146 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); local 148 F->getBasicBlockList().insert(++FI, NewNode); 152 NewNode->getInstList().push_back(Comp); 153 BranchInst::Create(LBranch, RBranch, Comp, NewNode); 154 return NewNode;
|
H A D | BasicBlockUtils.cpp | 307 DomTreeNode *NewNode = DT->addNewBlock(New,Old); local 310 DT->changeImmediateDominator(*I, NewNode);
|
H A D | CodeExtractor.cpp | 277 DomTreeNode *NewNode = DT->addNewBlock(New, *I); local 281 DT->changeImmediateDominator(*I, NewNode);
|
/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypes.cpp | 41 // Note that it is possible to have nodes marked NewNode in the DAG. This can 46 // into a different node, leaving the original node as a NewNode in the DAG. 56 // The conclusion is that though there may be nodes marked NewNode in the DAG, 57 // all uses of such nodes are also marked NewNode: the result is a fungus of 62 // by nodes marked NewNode (see above). 64 // The final node obtained by mapping by ReplacedValues is not marked NewNode. 69 // also map nodes marked NewNode if the deallocated memory was reallocated as 76 // Remember nodes marked NewNode - they are subject to extra checking below. 77 if (I->getNodeId() == NewNode) 87 // Check that remapped values are only used by nodes marked NewNode [all...] |
H A D | ScheduleDAGRRList.cpp | 235 SUnit *NewNode = newSUnit(N); local 237 if (NewNode->NodeNum >= NumSUnits) 239 return NewNode; 246 SUnit *NewNode = Clone(N); local 248 if (NewNode->NodeNum >= NumSUnits) 250 return NewNode;
|
H A D | LegalizeDAG.cpp | 1266 SDNode *NewNode = Node; 1282 NewNode = DAG.UpdateNodeOperands(Node, Node->getOperand(0), 1297 NewNode = DAG.UpdateNodeOperands(Node, Node->getOperand(0), 1304 if (NewNode != Node) { 1305 DAG.ReplaceAllUsesWith(Node, NewNode); 1307 DAG.TransferDbgValues(SDValue(Node, i), SDValue(NewNode, i)); 1309 Node = NewNode;
|
H A D | LegalizeTypes.h | 46 /// NewNode - This is a new node, not before seen, that was created in the 48 NewNode = -1, enumerator in enum:llvm::DAGTypeLegalizer::NodeIdFlags
|
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/IPA/ |
H A D | CallGraph.cpp | 324 CallSite NewCS, CallGraphNode *NewNode){ 330 I->second = NewNode; 331 NewNode->AddRef(); 323 replaceCallEdge(CallSite CS, CallSite NewCS, CallGraphNode *NewNode) argument
|
/macosx-10.10/WTF-7600.1.24/wtf/ |
H A D | TCPageMap.h | 225 Node* NewNode() { function in class:TCMalloc_PageMap3 238 root_ = NewNode(); 264 Node* n = NewNode();
|
/macosx-10.10/llvmCore-3425.0.34/utils/TableGen/ |
H A D | DAGISelMatcherGen.cpp | 108 void AddMatcher(Matcher *NewNode); 188 void MatcherGen::AddMatcher(Matcher *NewNode) { argument 190 CurPredicate->setNext(NewNode); 192 TheMatcher = NewNode; 193 CurPredicate = NewNode;
|
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Analysis/ |
H A D | CallGraph.h | 293 void replaceCallEdge(CallSite CS, CallSite NewCS, CallGraphNode *NewNode);
|
/macosx-10.10/tidy-15.15/tidy/src/ |
H A D | istack.c | 262 node = TY_(NewNode)(lexer);
|
H A D | lexer.h | 442 Node* TY_(NewNode)( Lexer* lexer );
|
H A D | lexer.c | 1024 Node *TY_(NewNode)(Lexer *lexer) function 1041 Node *node = TY_(NewNode)( lexer ); 1195 Node *node = TY_(NewNode)( lexer ); 1204 Node *node = TY_(NewNode)( lexer ); 1214 Node *node = TY_(NewNode)( lexer ); 1224 Node* node = TY_(NewNode)( lexer ); 1240 Node* node = TY_(NewNode)(lexer); 1526 doctype = TY_(NewNode)( NULL ); 1721 xml = TY_(NewNode)(lexer); 1753 Node *node = TY_(NewNode)( lexe [all...] |
H A D | parser.c | 409 Node *node = NewNode(lexer); 485 node = TY_(NewNode)(lexer);
|
H A D | clean.c | 520 node = TY_(NewNode)( lexer );
|
/macosx-10.10/llvmCore-3425.0.34/include/llvm/ADT/ |
H A D | IntervalMap.h | 1973 unsigned NewNode = 0; 1975 // Insert NewNode at the penultimate position, or after a single node. 1976 NewNode = Nodes == 1 ? 1 : Nodes - 1; 1977 CurSize[Nodes] = CurSize[NewNode]; 1978 Node[Nodes] = Node[NewNode]; 1979 CurSize[NewNode] = 0; 1980 Node[NewNode] = this->map->template newNode<NodeT>(); 1999 if (NewNode && Pos == NewNode) {
|
/macosx-10.10/swig-12/Source/DOH/ |
H A D | hash.c | 86 static HashNode *NewNode(DOH *k, void *obj) { function 237 n = NewNode(k, obj);
|
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/ |
H A D | RegionInfo.cpp | 291 RegionNode *NewNode = new RegionNode(const_cast<Region*>(this), BB); 292 BBNodeMap.insert(std::make_pair(BB, NewNode)); 293 return NewNode;
|
/macosx-10.10/llvmCore-3425.0.34/lib/Target/X86/ |
H A D | X86ISelDAGToDAG.cpp | 2537 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST8ri, dl, MVT::i32, local 2542 SDValue(NewNode, 0)); 2574 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST8ri_NOREX, dl, local 2579 SDValue(NewNode, 0)); 2596 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST16ri, dl, MVT::i32, local 2601 SDValue(NewNode, 0)); 2618 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST32ri, dl, MVT::i32, local 2623 SDValue(NewNode, 0));
|
H A D | X86InstrInfo.cpp | 4251 SDNode *NewNode= DAG.getMachineNode(Opc, dl, VTs, &BeforeOps[0], local 4253 NewNodes.push_back(NewNode); 4258 AddrOps.push_back(SDValue(NewNode, 0));
|
/macosx-10.10/llvmCore-3425.0.34/lib/Target/PowerPC/ |
H A D | PPCISelLowering.cpp | 4797 SDValue NewNode = LowerVAARG(SDValue(N, 1), DAG, PPCSubTarget); local 4799 Results.push_back(NewNode); 4800 Results.push_back(NewNode.getValue(1));
|