Searched refs:newNode (Results 1 - 7 of 7) sorted by relevance

/freebsd-current/contrib/bmake/
H A Dlst.c78 ListNode *newNode; local
82 newNode = LstNodeNew(ln->prev, ln, datum);
85 ln->prev->next = newNode;
86 ln->prev = newNode;
89 list->first = newNode;
/freebsd-current/contrib/llvm-project/lld/MachO/
H A DExportTrie.cpp247 TrieNode *newNode = makeNode(); local
249 newNode);
250 node = newNode;
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_deadlock_detector1.cpp99 m->id = dd.newNode(reinterpret_cast<uptr>(m));
H A Dsanitizer_deadlock_detector.h154 uptr newNode(uptr data) { function in class:__sanitizer::DeadlockDetector
181 // Get data associated with the node created by newNode().
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DRDFGraph.cpp775 Node DataFlowGraph::newNode(uint16_t Attrs) {
785 Node NA = newNode(0);
804 Use UA = newNode(NodeAttrs::Ref | NodeAttrs::Use | Flags);
811 PhiUse PUA = newNode(NodeAttrs::Ref | NodeAttrs::Use | Flags);
819 Def DA = newNode(NodeAttrs::Ref | NodeAttrs::Def | Flags);
825 Def DA = newNode(NodeAttrs::Ref | NodeAttrs::Def | Flags);
832 Phi PA = newNode(NodeAttrs::Code | NodeAttrs::Phi);
838 Stmt SA = newNode(NodeAttrs::Code | NodeAttrs::Stmt);
845 Block BA = newNode(NodeAttrs::Code | NodeAttrs::Block);
852 Func FA = newNode(NodeAttr
[all...]
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h1009 template <typename NodeT> NodeT *newNode() {
1235 Leaf *L = newNode<Leaf>();
1276 Branch *B = newNode<Branch>();
2052 Node[NewNode] = this->map->template newNode<NodeT>();
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFGraph.h850 Node newNode(uint16_t Attrs);

Completed in 268 milliseconds