Home
last modified time | relevance | path

Searched refs:Next (Results 1 – 25 of 1303) sorted by relevance

12345678910>>...53

/external/perfetto/src/base/
Dstring_splitter_unittest.cc34 EXPECT_FALSE(ss.Next()); in TEST()
42 EXPECT_FALSE(ss.Next()); in TEST()
50 EXPECT_TRUE(ss.Next()); in TEST()
53 EXPECT_FALSE(ss.Next()); in TEST()
58 EXPECT_TRUE(ss.Next()); in TEST()
61 EXPECT_FALSE(ss.Next()); in TEST()
65 EXPECT_TRUE(ss.Next()); in TEST()
68 EXPECT_FALSE(ss.Next()); in TEST()
72 EXPECT_TRUE(ss.Next()); in TEST()
75 EXPECT_FALSE(ss.Next()); in TEST()
[all …]
/external/scudo/standalone/
Dlist.h24 Current = Current->Next;
71 for (T *I = First;; I = I->Next) { in checkConsistency()
77 CHECK_EQ(Last->Next, nullptr); in checkConsistency()
88 X->Next = nullptr; in push_back()
92 Last->Next = X; in push_back()
100 X->Next = First; in push_front()
107 First = First->Next; in pop_front()
117 DCHECK_EQ(Prev->Next, X); in extract()
118 Prev->Next = X->Next; in extract()
131 Last->Next = L->First; in append_back()
[all …]
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
Dilist_base.h25 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 …]
Dilist_node_base.h24 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()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
Dilist_base.h23 static void insertBeforeImpl(node_base_type &Next, node_base_type &N) { in insertBeforeImpl() argument
24 node_base_type &Prev = *Next.getPrev(); in insertBeforeImpl()
25 N.setNext(&Next); in insertBeforeImpl()
28 Next.setPrev(&N); in insertBeforeImpl()
33 node_base_type *Next = N.getNext(); in removeImpl() local
34 Next->setPrev(Prev); in removeImpl()
35 Prev->setNext(Next); in removeImpl()
53 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
55 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
59 assert(&Next != &First && in transferBeforeImpl()
[all …]
Dilist_node_base.h24 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()
DSparseMultiSet.h102 unsigned Next; member
104 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {} in SMSNode()
108 return Next == INVALID; in isTail()
160 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue() argument
162 Dense.push_back(SMSNode(V, Prev, Next)); in addValue()
168 unsigned NextFree = Dense[Idx].Next; in addValue()
171 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
180 Dense[Idx].Next = FreelistIdx; in makeTombstone()
245 unsigned Next() const { return SMS->Dense[Idx].Next; } in Next() function
248 void setNext(unsigned N) { SMS->Dense[Idx].Next = N; } in setNext()
[all …]
/external/protobuf/csharp/src/Google.Protobuf.Test/
DJsonTokenizerTest.cs91 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 …]
/external/perfetto/src/trace_processor/
Dtrace_database_integrationtest.cc73 ASSERT_TRUE(it.Next()); in TEST_F()
78 ASSERT_FALSE(it.Next()); in TEST_F()
84 ASSERT_TRUE(it.Next()); in TEST_F()
89 ASSERT_FALSE(it.Next()); in TEST_F()
99 ASSERT_TRUE(it.Next()); in TEST_F()
104 ASSERT_FALSE(it.Next()); in TEST_F()
109 ASSERT_TRUE(it.Next()); in TEST_F()
113 ASSERT_TRUE(it.Next()); in TEST_F()
117 ASSERT_TRUE(it.Next()); in TEST_F()
128 ASSERT_TRUE(it.Next()); in TEST_F()
[all …]
/external/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/
DJsonTokenizerTest.cs91 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 …]
/external/clang/include/clang/AST/
DRedeclarable.h48 mutable llvm::PointerUnion<NotKnownLatest, KnownLatest> Next; variable
55 : Next(NotKnownLatest(reinterpret_cast<UninitializedLatest>(&Ctx))) {} in DeclLink()
57 : Next(NotKnownLatest(Previous(D))) {} in DeclLink()
60 return Next.is<NotKnownLatest>() && in NextIsPrevious()
63 Next.get<NotKnownLatest>().template is<Previous>(); in NextIsPrevious()
69 if (Next.is<NotKnownLatest>()) { in getNext()
70 NotKnownLatest NKL = Next.get<NotKnownLatest>(); in getNext()
75 Next = KnownLatest(*reinterpret_cast<const ASTContext *>( in getNext()
80 return static_cast<decl_type*>(Next.get<KnownLatest>().get(D)); in getNext()
85 Next = Previous(D); in setPrevious()
[all …]
/external/mesa3d/src/gallium/drivers/r300/compiler/
Dradeon_list.c39 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()
Dradeon_program.c57 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 …]
/external/v8/src/date/
Ddateparser-inl.h78 token = scanner.Next()) { in Parse()
92 if (scanner.Peek().IsSymbol('.')) scanner.Next(); in Parse()
97 int n = ReadMilliseconds(scanner.Next()); in Parse()
141 DateToken token = scanner.Next(); in Parse()
209 in_->Next(); in Scan()
216 Next(); in SkipWhiteSpace()
231 Next(); in SkipParentheses()
248 DateToken sign_token = scanner->Next(); in ParseES5DateTime()
251 int year = scanner->Next().number(); in ParseES5DateTime()
255 day->Add(scanner->Next().number()); in ParseES5DateTime()
[all …]
/external/v8/src/ic/
Dhandler-configuration.h56 using DoAccessCheckOnLookupStartObjectBits = KindBits::Next<bool, 1>;
63 DoAccessCheckOnLookupStartObjectBits::Next<bool, 1>;
71 LookupOnLookupStartObjectBits::Next<unsigned, kDescriptorIndexBitCount>;
78 using IsInobjectBits = LookupOnLookupStartObjectBits::Next<bool, 1>;
79 using IsDoubleBits = IsInobjectBits::Next<bool, 1>;
82 IsDoubleBits::Next<unsigned, kDescriptorIndexBitCount + 1>;
83 using CompactElementsKindBits = FieldIndexBits::Next<CompactElementsKind, 3>;
90 using AllowOutOfBoundsBits = LookupOnLookupStartObjectBits::Next<bool, 1>;
95 using IsJsArrayBits = AllowOutOfBoundsBits::Next<bool, 1>;
96 using ConvertHoleBits = IsJsArrayBits::Next<bool, 1>;
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/WebAssembly/
DWebAssemblyCFGSort.cpp176 MachineBasicBlock *Next = nullptr; in SortBlocks() local
178 Next = Preferred.top(); in SortBlocks()
183 !MDT.dominates(Loops.back().Loop->getHeader(), Next)) { in SortBlocks()
184 Loops.back().Deferred.push_back(Next); in SortBlocks()
185 Next = nullptr; in SortBlocks()
190 if (Next->getNumber() < MBB->getNumber() && in SortBlocks()
191 (!L || !L->contains(Next) || in SortBlocks()
192 L->getHeader()->getNumber() < Next->getNumber())) { in SortBlocks()
193 Ready.push(Next); in SortBlocks()
194 Next = nullptr; in SortBlocks()
[all …]
/external/llvm/include/llvm/ADT/
DSparseMultiSet.h94 unsigned Next; member
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } in SMSNode()
100 return Next == INVALID; in isTail()
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue() argument
159 Dense.push_back(SMSNode(V, Prev, Next)); in addValue()
165 unsigned NextFree = Dense[Idx].Next; in addValue()
168 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
177 Dense[Idx].Next = FreelistIdx; in makeTombstone()
241 unsigned Next() const { return SMS->Dense[Idx].Next; } in Next() function
244 void setNext(unsigned N) { SMS->Dense[Idx].Next = N; } in setNext()
[all …]
/external/clang/lib/Format/
DTokenAnnotator.cpp200 if (LookForDecls && CurrentToken->Next) { in parseParens()
204 FormatToken *Next = CurrentToken->Next; in parseParens() local
207 CurrentToken->is(tok::identifier) && Next->isNot(tok::equal)) { in parseParens()
223 if (MightBeFunctionType && ProbablyFunctionType && CurrentToken->Next && in parseParens()
224 (CurrentToken->Next->is(tok::l_paren) || in parseParens()
225 (CurrentToken->Next->is(tok::l_square) && Line.MustBeDeclaration))) in parseParens()
230 if (CurrentToken->Next && CurrentToken->Next->is(tok::l_brace) && in parseParens()
235 for (FormatToken *Tok = Left; Tok != CurrentToken; Tok = Tok->Next) { in parseParens()
272 if (CurrentToken->is(tok::comma) && CurrentToken->Next && in parseParens()
273 !CurrentToken->Next->HasUnescapedNewline && in parseParens()
[all …]
/external/swiftshader/third_party/llvm-subzero/include/llvm/IR/
DValue.h582 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 …]
DUse.h98 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()
/external/llvm/include/llvm/Transforms/Scalar/
DGVN.h120 LeaderTableEntry *Next;
151 Node->Next = Curr.Next;
152 Curr.Next = Node;
163 Curr = Curr->Next;
170 Prev->Next = Curr->Next;
172 if (!Curr->Next) {
176 LeaderTableEntry *Next = Curr->Next;
177 Curr->Val = Next->Val;
178 Curr->BB = Next->BB;
179 Curr->Next = Next->Next;
/external/llvm/include/llvm/IR/
DValue.h572 Use **Next = &Merged; in mergeUseLists() local
576 *Next = R; in mergeUseLists()
580 *Next = L; in mergeUseLists()
584 *Next = R; in mergeUseLists()
585 Next = &R->Next; in mergeUseLists()
586 R = R->Next; in mergeUseLists()
588 *Next = L; in mergeUseLists()
589 Next = &L->Next; in mergeUseLists()
590 L = L->Next; in mergeUseLists()
601 static void mergeUseListsImpl(Use *L, Use *R, Use **Next, Compare Cmp);
[all …]
DUse.h108 Use *getNext() const { return Next; } in getNext()
127 Use *Next; variable
132 Next = *List; in addToList()
133 if (Next) in addToList()
134 Next->setPrev(&Next); in addToList()
140 *StrippedPrev = Next; in removeFromList()
141 if (Next) in removeFromList()
142 Next->setPrev(StrippedPrev); in removeFromList()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DUse.h124 Use *getNext() const { return Next; } in getNext()
143 Use *Next; variable
149 Next = *List; in addToList()
150 if (Next) in addToList()
151 Next->setPrev(&Next); in addToList()
158 *StrippedPrev = Next; in removeFromList()
159 if (Next) in removeFromList()
160 Next->setPrev(StrippedPrev); in removeFromList()
DValue.h628 Use **Next = &Merged; in mergeUseLists() local
632 *Next = R; in mergeUseLists()
636 *Next = L; in mergeUseLists()
640 *Next = R; in mergeUseLists()
641 Next = &R->Next; in mergeUseLists()
642 R = R->Next; in mergeUseLists()
644 *Next = L; in mergeUseLists()
645 Next = &L->Next; in mergeUseLists()
646 L = L->Next; in mergeUseLists()
687 if (!UseList || !UseList->Next) in sortUseList()
[all …]

12345678910>>...53