HomeSort by: relevance | last modified time | path
    Searched refs:newNode (Results 1 - 17 of 17) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_deadlock_detector_test.cc 53 uptr node = d.newNode(0);
61 uptr node = d.newNode(0);
69 uptr node = d.newNode(0);
77 uptr n1 = d.newNode(1);
78 uptr n2 = d.newNode(2);
101 uptr n1 = d.newNode(1);
102 uptr n2 = d.newNode(2);
103 uptr n3 = d.newNode(3);
143 uptr l0 = d.newNode(0);
144 uptr l1 = d.newNode(1)
    [all...]
  /src/usr.bin/make/
lst.c 78 ListNode *newNode;
82 newNode = LstNodeNew(ln->prev, ln, datum);
85 ln->prev->next = newNode;
86 ln->prev = newNode;
89 list->first = newNode;
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/
aligned_block_list.d 106 auto newNode = cast(AlignedBlockNode*) buf;
111 newNode.bAlloc = Allocator(payload);
113 newNode.next = localRoot;
114 newNode.prev = null;
116 localRoot.prev = newNode;
117 root = cast(typeof(root)) newNode;
kernighan_ritchie.d 155 auto newNode = cast(Node*) ((cast(ubyte*) &this) + bytes);
156 newNode.size = leftover;
157 newNode.next = next == &this ? newNode : next;
159 return tuple(payload, newNode);
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/
ob.d 348 ObNode* newNode()
362 return nextNodeIs(newNode());
376 return gotoNextNodeIs(newNode());
419 mystate.breakBlock = newNode();
427 mystate.contBlock = newNode();
457 mystate.breakBlock = newNode();
458 mystate.contBlock = newNode();
462 auto ob = newNode();
482 mystate.breakBlock = newNode();
483 mystate.contBlock = newNode();
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/container/
rbtree.d 140 * escaped through `newNode.parent`. It's marked `@trusted` only for backwards compatibility.)
142 * Returns newNode
144 @property Node left(return scope Node newNode) @trusted
146 _left = newNode;
147 if (newNode !is null)
148 newNode._parent = &this;
149 return newNode;
157 * escaped through `newNode.parent`. It's marked `@trusted` only for backwards compatibility.)
159 * Returns newNode
161 @property Node right(return scope Node newNode) @truste
    [all...]
slist.d 161 auto newNode = new Node(null, item);
162 (ch.first ? ch.last._next : ch.first) = newNode;
163 ch.last = newNode;
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_deadlock_detector1.cc 100 m->id = dd.newNode(reinterpret_cast<uptr>(m));
sanitizer_deadlock_detector.h 157 uptr newNode(uptr data) {
185 // Get data associated with the node created by newNode().
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_deadlock_detector1.cpp 99 m->id = dd.newNode(reinterpret_cast<uptr>(m));
sanitizer_deadlock_detector.h 154 uptr newNode(uptr data) {
181 // Get data associated with the node created by newNode().
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_deadlock_detector1.cpp 99 m->id = dd.newNode(reinterpret_cast<uptr>(m));
sanitizer_deadlock_detector.h 154 uptr newNode(uptr data) {
181 // Get data associated with the node created by newNode().
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RDFGraph.cpp 780 NodeAddr<NodeBase*> DataFlowGraph::newNode(uint16_t Attrs) {
790 NodeAddr<NodeBase*> NA = newNode(0);
810 NodeAddr<UseNode*> UA = newNode(NodeAttrs::Ref | NodeAttrs::Use | Flags);
817 NodeAddr<PhiUseNode*> PUA = newNode(NodeAttrs::Ref | NodeAttrs::Use | Flags);
826 NodeAddr<DefNode*> DA = newNode(NodeAttrs::Ref | NodeAttrs::Def | Flags);
833 NodeAddr<DefNode*> DA = newNode(NodeAttrs::Ref | NodeAttrs::Def | Flags);
840 NodeAddr<PhiNode*> PA = newNode(NodeAttrs::Code | NodeAttrs::Phi);
847 NodeAddr<StmtNode*> SA = newNode(NodeAttrs::Code | NodeAttrs::Stmt);
855 NodeAddr<BlockNode*> BA = newNode(NodeAttrs::Code | NodeAttrs::Block);
862 NodeAddr<FuncNode*> FA = newNode(NodeAttrs::Code | NodeAttrs::Func)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
IntervalMap.h 1011 template <typename NodeT> NodeT *newNode() {
1189 Leaf *L = newNode<Leaf>();
1230 Branch *B = newNode<Branch>();
1999 unsigned NewNode = 0;
2001 // Insert NewNode at the penultimate position, or after a single node.
2002 NewNode = Nodes == 1 ? 1 : Nodes - 1;
2003 CurSize[Nodes] = CurSize[NewNode];
2004 Node[Nodes] = Node[NewNode];
2005 CurSize[NewNode] = 0;
2006 Node[NewNode] = this->map->template newNode<NodeT>()
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
RDFGraph.h 818 NodeAddr<NodeBase*> newNode(uint16_t Attrs);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
concurrency.d 2466 put(newNode(val));
2546 Node* newNode(T v)

Completed in 37 milliseconds