Home
last modified time | relevance | path

Searched refs:ListNode (Results 1 – 23 of 23) sorted by relevance

/third_party/node/src/
Dutil-inl.h78 ListNode<T>::ListNode() : prev_(this), next_(this) {} in ListNode() function
81 ListNode<T>::~ListNode() { in ~ListNode()
86 void ListNode<T>::Remove() { in Remove()
94 bool ListNode<T>::IsEmpty() const { in IsEmpty()
98 template <typename T, ListNode<T> (T::*M)>
99 ListHead<T, M>::Iterator::Iterator(ListNode<T>* node) : node_(node) {} in Iterator()
101 template <typename T, ListNode<T> (T::*M)>
106 template <typename T, ListNode<T> (T::*M)>
113 template <typename T, ListNode<T> (T::*M)>
118 template <typename T, ListNode<T> (T::*M)>
[all …]
Dnode_postmortem_metadata.cc30 V(ListNode_HandleWrap, prev_, uintptr_t, ListNode<HandleWrap>::prev_) \
31 V(ListNode_HandleWrap, next_, uintptr_t, ListNode<HandleWrap>::next_) \
34 V(ListNode_ReqWrap, prev_, uintptr_t, ListNode<ReqWrapBase>::prev_) \
35 V(ListNode_ReqWrap, next_, uintptr_t, ListNode<ReqWrapBase>::next_)
59 OffsetOf<ListNode<ReqWrapBase>, ReqWrap<uv_req_t>>( in GenDebugSymbols()
Dutil.h203 class ListNode; variable
206 template <typename T, ListNode<T> (T::*M)>
210 class ListNode {
212 inline ListNode();
213 inline ~ListNode();
217 ListNode(const ListNode&) = delete;
218 ListNode& operator=(const ListNode&) = delete;
221 template <typename U, ListNode<U> (U::*M)> friend class ListHead;
223 ListNode* prev_;
224 ListNode* next_;
[all …]
Dreq_wrap.h27 ListNode<ReqWrapBase> req_wrap_queue_;
Dhandle_wrap.h112 ListNode<HandleWrap> handle_wrap_queue_;
/third_party/gn/src/gn/
Dparse_tree.h28 class ListNode; variable
91 virtual const ListNode* AsList() const;
389 const ListNode* args() const { return args_.get(); } in args()
390 void set_args(std::unique_ptr<ListNode> a) { args_ = std::move(a); } in set_args()
401 std::unique_ptr<ListNode> args_;
441 class ListNode : public ParseNode {
443 ListNode();
444 ~ListNode() override;
446 const ListNode* AsList() const override;
453 static std::unique_ptr<ListNode> NewFromJSON(const base::Value& value);
[all …]
Dparse_tree.cc198 const ListNode* ParseNode::AsList() const { in AsList()
274 RETURN_IF_MATCHES_NAME(ListNode); in BuildFromJSON()
773 ret->args_ = ListNode::NewFromJSON(children[0]); in NewFromJSON()
853 ListNode::ListNode() {} in ListNode() function in ListNode
855 ListNode::~ListNode() = default;
857 const ListNode* ListNode::AsList() const { in AsList()
861 Value ListNode::Execute(Scope* scope, Err* err) const { in Execute()
881 LocationRange ListNode::GetRange() const { in GetRange()
885 Err ListNode::MakeErrorDescribing(const std::string& msg, in MakeErrorDescribing()
890 base::Value ListNode::GetJSONNode() const { in GetJSONNode()
[all …]
Dfunctions.h17 class ListNode; variable
31 const ListNode* args_list,
129 const ListNode* args_list,
170 const ListNode* args_list,
178 const ListNode* args_list,
253 const ListNode* args_list,
354 const ListNode* args_list,
460 const ListNode* args_list,
Dparser.cc535 std::unique_ptr<ListNode> list = std::make_unique<ListNode>(); in IdentifierOrCall()
641 std::unique_ptr<ListNode> Parser::ParseList(const Token& start_token, in ParseList()
644 std::unique_ptr<ListNode> list = std::make_unique<ListNode>(); in ParseList()
653 return std::unique_ptr<ListNode>(); in ParseList()
663 return std::unique_ptr<ListNode>(); in ParseList()
667 return std::unique_ptr<ListNode>(); in ParseList()
679 return std::unique_ptr<ListNode>(); in ParseList()
805 } else if (const ListNode* list = root->AsList()) { in TraverseOrder()
Dparse_tree_unittest.cc194 const ListNode* list = binop->right()->AsList(); in TEST()
220 const ListNode* list = binop->right()->AsList(); in TEST()
242 const ListNode* list = binop->right()->AsList(); in TEST()
264 const ListNode* list = binop->right()->AsList(); in TEST()
Dfunctions_unittest.cc83 ListNode args_list_identifier_undefined; in TEST()
98 ListNode args_list_identifier_defined; in TEST()
112 ListNode args_list_accessor_defined; in TEST()
Dcommand_format.cc406 const ListNode* list = binop->right()->AsList(); in SortIfApplicable()
413 const_cast<ListNode*>(list)->SortAsStringsList(); in SortIfApplicable()
416 const_cast<ListNode*>(list)->SortAsTargetsList(); in SortIfApplicable()
540 } else if (const ListNode* list = node->AsList()) { in SuffixCommentTreeWalk()
777 if (const ListNode* right_as_list = binop->right()->AsList()) { in Expr()
833 const ListNode* rhs_list = binop->right()->AsList(); in Expr()
906 } else if (const ListNode* list = root->AsList()) { in Expr()
Dfunction_foreach.cc49 const ListNode* args_list, in RunForEach()
Dparser.h73 std::unique_ptr<ListNode> ParseList(const Token& start_token,
Dfunctions.cc536 const ListNode* args_list, in RunDefined()
1005 const ListNode* args_list, in RunSplitList()
1427 const ListNode* args_list, in RunFunction()
/third_party/node/deps/v8/src/heap/
Dmemory-chunk.h201 heap::ListNode<MemoryChunk>& list_node() { return list_node_; } in list_node()
202 const heap::ListNode<MemoryChunk>& list_node() const { return list_node_; } in list_node()
277 heap::ListNode<MemoryChunk> list_node_;
Dmemory-chunk-layout.h67 FIELD(heap::ListNode<MemoryChunk>, ListNode),
Dlist.h128 class ListNode {
130 ListNode() { Initialize(); } in ListNode() function
/third_party/node/doc/contributing/
Dnode-postmortem-support.md44 ListNode<ReqWrap> req_wrap_queue_;
60 ListNode<ReqWrap> req_wrap_queue_;
/third_party/rust/crates/serde/test_suite/tests/
Dtest_gen.rs144 struct ListNode<D> { in test_gen() struct
146 next: Box<ListNode<D>>, in test_gen() argument
148 assert::<ListNode<i32>>(); in test_gen()
/third_party/node/test/cctest/
Dtest_util.cc18 struct Item { node::ListNode<Item> node_; }; in TEST()
/third_party/node/doc/changelogs/
DCHANGELOG_V13.md2195 * \[[`8fcc039de9`](https://github.com/nodejs/node/commit/8fcc039de9)] - **src**: expose ListNode\<T…
DCHANGELOG_V12.md4011 * \[[`693bf73b06`](https://github.com/nodejs/node/commit/693bf73b06)] - **src**: expose ListNode\<T…