| /third_party/boost/boost/graph/detail/ |
| D | list_base.hpp | 31 template < class Node, class Next >
32 inline Node slist_insert_after(Node pos, Node x, Next next) in slist_insert_after()
40 template < class Node, class Next >
41 inline Node slist_remove_after(Node pos, Next next) in slist_remove_after()
48 template < class Node, class Next >
49 inline Node slist_remove_range(Node before_first, Node last, Next next) in slist_remove_range()
55 template < class Node, class Next >
56 inline Node slist_previous(Node head, Node x, Node empty, Next next) in slist_previous()
63 template < class Node, class Next >
65 Node pos, Node before_first, Node before_last, Next next) in slist_splice_after()
[all …]
|
| /third_party/boost/boost/xpressive/detail/core/matcher/ |
| D | optional_matcher.hpp | 37 template<typename BidiIter, typename Next>
38 bool match(match_state<BidiIter> &state, Next const &next) const in match()
44 template<typename BidiIter, typename Next>
45 bool match_(match_state<BidiIter> &state, Next const &next, mpl::true_) const // Greedy in match_()
47 return this->xpr_.BOOST_NESTED_TEMPLATE push_match<Next>(state) in match_()
51 template<typename BidiIter, typename Next>
52 bool match_(match_state<BidiIter> &state, Next const &next, mpl::false_) const // Non-greedy in match_()
55 || this->xpr_.BOOST_NESTED_TEMPLATE push_match<Next>(state); in match_()
63 template<typename BidiIter, typename Next>
64 inline bool match_next(match_state<BidiIter> &state, Next const &next, int mark_number) in match_next()
[all …]
|
| D | regex_byref_matcher.hpp | 51 template<typename Next>
52 bool match(match_state<BidiIter> &state, Next const &next) const in match()
57 … return push_context_match(*this->pimpl_, state, this->wrap_(next, is_static_xpression<Next>())); in match()
61 template<typename Next>
62 …static xpression_adaptor<reference_wrapper<Next const>, matchable<BidiIter> > wrap_(Next const &ne… in wrap_()
65 … return xpression_adaptor<reference_wrapper<Next const>, matchable<BidiIter> >(boost::cref(next)); in wrap_()
68 template<typename Next>
69 static Next const &wrap_(Next const &next, mpl::false_) in wrap_()
|
| D | alternate_matcher.hpp | 40 template<typename BidiIter, typename Next>
51 return xpr.BOOST_NESTED_TEMPLATE push_match<Next>(*this->state_); in operator ()()
61 template<typename BidiIter, typename Next>
64 alternates_vector<BidiIter> const &alts, match_state<BidiIter> &state, Next const & in alt_match()
67 return detail::any(alts.begin(), alts.end(), alt_match_pred<BidiIter, Next>(state)); in alt_match()
70 template<typename Head, typename Tail, typename BidiIter, typename Next>
73 alternates_list<Head, Tail> const &alts, match_state<BidiIter> &state, Next const & in alt_match()
76 return fusion::any(alts, alt_match_pred<BidiIter, Next>(state)); in alt_match()
101 template<typename BidiIter, typename Next>
102 bool match(match_state<BidiIter> &state, Next const &next) const in match()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | ilist_base.h | 25 static void insertBeforeImpl(node_base_type &Next, node_base_type &N) { in insertBeforeImpl() argument
26 node_base_type &Prev = *Next.getPrev(); in insertBeforeImpl()
27 N.setNext(&Next); in insertBeforeImpl()
30 Next.setPrev(&N); in insertBeforeImpl()
35 node_base_type *Next = N.getNext(); in removeImpl() local
36 Next->setPrev(Prev); in removeImpl()
37 Prev->setNext(Next); in removeImpl()
55 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
57 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
61 assert(&Next != &First && in transferBeforeImpl()
[all …]
|
| D | ilist_node_base.h | 24 ilist_node_base *Next = nullptr; variable
28 void setNext(ilist_node_base *Next) { this->Next = Next; } in setNext() argument
30 ilist_node_base *getNext() const { return Next; } in getNext()
38 ilist_node_base *Next = nullptr; variable
42 void setNext(ilist_node_base *Next) { this->Next = Next; } in setNext() argument
44 ilist_node_base *getNext() const { return Next; } in getNext()
|
| /third_party/boost/boost/xpressive/detail/static/ |
| D | static.hpp | 38 template<typename Top, typename Next>
40 : Next
47 return static_cast<Next const *>(this)-> in match()
79 return Top::skip_impl(*static_cast<Next const *>(this), state); in skip_match()
96 template<typename Top, typename Next>
97 inline stacked_xpression<Top, Next> const &stacked_xpression_cast(Next const &next) in stacked_xpression_cast()
103 BOOST_MPL_ASSERT_RELATION(sizeof(stacked_xpression<Top, Next>), ==, sizeof(Next)); in stacked_xpression_cast()
104 return *static_cast<stacked_xpression<Top, Next> const *>(&next); in stacked_xpression_cast()
110 template<typename Matcher, typename Next>
114 Next next_;
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | ilist_base.h | 22 static void insertBeforeImpl(node_base_type &Next, node_base_type &N) { in insertBeforeImpl() argument
23 node_base_type &Prev = *Next.getPrev(); in insertBeforeImpl()
24 N.setNext(&Next); in insertBeforeImpl()
27 Next.setPrev(&N); in insertBeforeImpl()
32 node_base_type *Next = N.getNext(); in removeImpl() local
33 Next->setPrev(Prev); in removeImpl()
34 Prev->setNext(Next); in removeImpl()
52 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
54 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
58 assert(&Next != &First && in transferBeforeImpl()
[all …]
|
| D | ilist_node_base.h | 23 ilist_node_base *Next = nullptr; variable
27 void setNext(ilist_node_base *Next) { this->Next = Next; } in setNext() argument
29 ilist_node_base *getNext() const { return Next; } in getNext()
37 ilist_node_base *Next = nullptr; variable
41 void setNext(ilist_node_base *Next) { this->Next = Next; } in setNext() argument
43 ilist_node_base *getNext() const { return Next; } in getNext()
|
| D | SparseMultiSet.h | 101 unsigned Next; member
103 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {} in SMSNode()
107 return Next == INVALID; in isTail()
159 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue() argument
161 Dense.push_back(SMSNode(V, Prev, Next)); in addValue()
167 unsigned NextFree = Dense[Idx].Next; in addValue()
170 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
179 Dense[Idx].Next = FreelistIdx; in makeTombstone()
244 unsigned Next() const { return SMS->Dense[Idx].Next; } in Next() function
247 void setNext(unsigned N) { SMS->Dense[Idx].Next = N; } in setNext()
[all …]
|
| /third_party/protobuf/csharp/src/Google.Protobuf.Test/ |
| D | JsonTokenizerTest.cs | 91 Assert.AreEqual(JsonToken.StartObject, tokenizer.Next()); in ObjectDepth()
93 Assert.AreEqual(JsonToken.Name("foo"), tokenizer.Next()); in ObjectDepth()
95 Assert.AreEqual(JsonToken.StartObject, tokenizer.Next()); in ObjectDepth()
97 Assert.AreEqual(JsonToken.Name("x"), tokenizer.Next()); in ObjectDepth()
99 Assert.AreEqual(JsonToken.Value(1), tokenizer.Next()); in ObjectDepth()
101 Assert.AreEqual(JsonToken.Name("y"), tokenizer.Next()); in ObjectDepth()
103 Assert.AreEqual(JsonToken.StartArray, tokenizer.Next()); in ObjectDepth()
105 Assert.AreEqual(JsonToken.Value(0), tokenizer.Next()); in ObjectDepth()
107 Assert.AreEqual(JsonToken.EndArray, tokenizer.Next()); in ObjectDepth()
109 Assert.AreEqual(JsonToken.EndObject, tokenizer.Next()); in ObjectDepth()
[all …]
|
| /third_party/boost/boost/spirit/home/x3/support/ |
| D | context.hpp | 16 template <typename ID, typename T, typename Next = unused_type>
19 context(T& val, Next const& next) in context()
34 Next const& next;
66 template <typename ID, typename T, typename Next>
67 inline context<ID, T, Next> make_context(T& val, Next const& next) in make_context()
80 template <typename ID, typename T, typename Next, typename FoundVal>
81 inline Next const&
82 make_unique_context(T& /* val */, Next const& next, FoundVal&) in make_unique_context()
87 template <typename ID, typename T, typename Next>
88 inline context<ID, T, Next>
[all …]
|
| /third_party/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/ |
| D | JsonTokenizerTest.cs | 91 Assert.AreEqual(JsonToken.StartObject, tokenizer.Next()); in ObjectDepth()
93 Assert.AreEqual(JsonToken.Name("foo"), tokenizer.Next()); in ObjectDepth()
95 Assert.AreEqual(JsonToken.StartObject, tokenizer.Next()); in ObjectDepth()
97 Assert.AreEqual(JsonToken.Name("x"), tokenizer.Next()); in ObjectDepth()
99 Assert.AreEqual(JsonToken.Value(1), tokenizer.Next()); in ObjectDepth()
101 Assert.AreEqual(JsonToken.Name("y"), tokenizer.Next()); in ObjectDepth()
103 Assert.AreEqual(JsonToken.StartArray, tokenizer.Next()); in ObjectDepth()
105 Assert.AreEqual(JsonToken.Value(0), tokenizer.Next()); in ObjectDepth()
107 Assert.AreEqual(JsonToken.EndArray, tokenizer.Next()); in ObjectDepth()
109 Assert.AreEqual(JsonToken.EndObject, tokenizer.Next()); in ObjectDepth()
[all …]
|
| /third_party/jerryscript/jerry-core/ext/ |
| D | heapdump.c | 66 static void Next(void) in Next() function
112 Next(); in Type()
119 Next(); in Addr()
131 Next(); in DumpInfoLexEnv()
136 Next(); in DumpInfoLexEnv()
152 Next(); in DumpInfoFunction()
160 Next(); in DumpInfoFunction()
164 Next(); in DumpInfoFunction()
169 Next(); in DumpInfoFunction()
191 Next(); in DumpPropertyPair()
[all …]
|
| /third_party/mesa3d/src/gallium/drivers/r300/compiler/ |
| D | radeon_list.c | 39 new->Next = NULL; in rc_list()
54 for (temp = *list; temp->Next; temp = temp->Next); in rc_list_add()
56 temp->Next = new_value; in rc_list_add()
63 *list = rm_value->Next; in rc_list_remove()
67 rm_value->Prev->Next = rm_value->Next; in rc_list_remove()
68 if (rm_value->Next) { in rc_list_remove()
69 rm_value->Next->Prev = rm_value->Prev; in rc_list_remove()
78 list = list->Next; in rc_list_count()
87 list = list->Next; in rc_list_print()
|
| D | radeon_program.c | 57 struct rc_instruction * inst = c->Program.Instructions.Next; in rc_local_transform()
63 inst = inst->Next; in rc_local_transform()
114 for(inst = c->Program.Instructions.Next; in rc_get_used_temporaries()
115 inst != &c->Program.Instructions; inst = inst->Next) { in rc_get_used_temporaries()
187 inst->Next = after->Next; in rc_insert_instruction()
189 inst->Prev->Next = inst; in rc_insert_instruction()
190 inst->Next->Prev = inst; in rc_insert_instruction()
204 inst->Prev->Next = inst->Next; in rc_remove_instruction()
205 inst->Next->Prev = inst->Prev; in rc_remove_instruction()
216 for(inst = c->Program.Instructions.Next; in rc_recompute_ips()
[all …]
|
| /third_party/boost/boost/fusion/iterator/detail/ |
| D | segmented_next_impl.hpp | 79 typename Next = typename pop_front_car<Stack>::type,
80 bool IsInvalid = is_invalid<Next>::value,
181 template <typename Stack, typename Next, bool IsInvalid, int StackSize>
195 template <typename Stack, typename Next>
196 struct segmented_next_impl_recurse<Stack, Next, true, 1>
198 typedef Next type;
207 template <typename Stack, typename Next, int StackSize>
208 struct segmented_next_impl_recurse<Stack, Next, false, StackSize>
210 typedef segmented_next_impl_recurse2<Next> impl;
232 typename Next = typename pop_front_car<Stack>::type,
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/IR/ |
| D | Value.h | 582 Use **Next = &Merged; in mergeUseLists() local
586 *Next = R; in mergeUseLists()
590 *Next = L; in mergeUseLists()
594 *Next = R; in mergeUseLists()
595 Next = &R->Next; in mergeUseLists()
596 R = R->Next; in mergeUseLists()
598 *Next = L; in mergeUseLists()
599 Next = &L->Next; in mergeUseLists()
600 L = L->Next; in mergeUseLists()
611 static void mergeUseListsImpl(Use *L, Use *R, Use **Next, Compare Cmp);
[all …]
|
| D | Use.h | 98 Use *getNext() const { return Next; } in getNext()
117 Use *Next; variable
123 Next = *List; in addToList()
124 if (Next) in addToList()
125 Next->setPrev(&Next); in addToList()
132 *StrippedPrev = Next; in removeFromList()
133 if (Next) in removeFromList()
134 Next->setPrev(StrippedPrev); in removeFromList()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
| D | Use.h | 123 Use *getNext() const { return Next; } in getNext()
142 Use *Next = nullptr; variable
148 Next = *List; in addToList()
149 if (Next) in addToList()
150 Next->setPrev(&Next); in addToList()
157 *StrippedPrev = Next; in removeFromList()
158 if (Next) in removeFromList()
159 Next->setPrev(StrippedPrev); in removeFromList()
|
| D | Value.h | 688 Use **Next = &Merged; in mergeUseLists() local
692 *Next = R; in mergeUseLists()
696 *Next = L; in mergeUseLists()
700 *Next = R; in mergeUseLists()
701 Next = &R->Next; in mergeUseLists()
702 R = R->Next; in mergeUseLists()
704 *Next = L; in mergeUseLists()
705 Next = &L->Next; in mergeUseLists()
706 L = L->Next; in mergeUseLists()
747 if (!UseList || !UseList->Next) in sortUseList()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyCFGSort.cpp | 305 MachineBasicBlock *Next = nullptr; in sortBlocks() local
307 Next = Preferred.top(); in sortBlocks()
312 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
313 Entries.back().Deferred.push_back(Next); in sortBlocks()
314 Next = nullptr; in sortBlocks()
319 if (Next->getNumber() < MBB->getNumber() && in sortBlocks()
320 (WasmDisableEHPadSort || !Next->isEHPad()) && in sortBlocks()
321 (!R || !R->contains(Next) || in sortBlocks()
322 R->getHeader()->getNumber() < Next->getNumber())) { in sortBlocks()
323 Ready.push(Next); in sortBlocks()
[all …]
|
| /third_party/boost/boost/units/detail/ |
| D | heterogeneous_conversion.hpp | 36 template<class X1, class X2, class Next>
46 typename Next::template apply<next, Y>::type
51 template<class Next>
57 typename Next::template apply<typename Begin::next>::type
68 template<class Next>
72 typedef typename Next::template apply<
79 template<class Next>
85 typename Next::template apply<typename Begin::next, Y>::type
92 template<class Next, class X>
94 typedef solve_normal<T, X, Next> type;
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Scalar/ |
| D | GVN.h | 174 LeaderTableEntry *Next;
215 Node->Next = Curr.Next;
216 Curr.Next = Node;
227 Curr = Curr->Next;
234 Prev->Next = Curr->Next;
236 if (!Curr->Next) {
240 LeaderTableEntry *Next = Curr->Next;
241 Curr->Val = Next->Val;
242 Curr->BB = Next->BB;
243 Curr->Next = Next->Next;
|
| /third_party/boost/boost/fusion/view/detail/ |
| D | strictest_traversal.hpp | 47 template<typename StrictestSoFar, typename Next>
48 struct result<strictest_traversal_impl(StrictestSoFar, Next)>
50 typedef typename remove_reference<Next>::type next_value;
61 template<typename StrictestSoFar, typename Next>
63 typename result<strictest_traversal_impl(StrictestSoFar, Next)>::type
64 operator()(StrictestSoFar&&, Next&&) const;
|