| /external/deqp/framework/common/ |
| D | tcuEither.hpp | 39 template<typename First, typename Second>
43 Either (const First& first);
47 Either (const Either<First, Second>& other);
48 Either& operator= (const Either<First, Second>& other);
50 Either& operator= (const First& first);
56 const First& getFirst (void) const;
72 First* m_first;
78 deUint8 m_data[sizeof(First) > sizeof(Second) ? sizeof(First) : sizeof(Second)];
86 template<typename Type, typename First, typename Second>
89 template<typename First, typename Second>
[all …]
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | tst_bitmaps_exp | 41 First unmarked block is 11
45 First unmarked block is 17
51 First marked block is 12
57 First marked block is 12
61 First marked block is 12
65 First unmarked block is 13
67 First marked block is 14
107 First unmarked inode is 1
111 First unmarked inode is 6
117 First marked inode is 2
[all …]
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | ilist_base.h | 44 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument
45 node_base_type *Prev = First.getPrev(); in removeRangeImpl()
51 First.setPrev(nullptr); in removeRangeImpl()
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()
68 First.getPrev()->setNext(&Last); in transferBeforeImpl()
69 Last.setPrev(First.getPrev()); in transferBeforeImpl()
74 First.setPrev(&Prev); in transferBeforeImpl()
75 Prev.setNext(&First); in transferBeforeImpl()
[all …]
|
| D | simple_ilist.h | 162 void insert(iterator I, Iterator First, Iterator Last) { in insert() argument
163 for (; First != Last; ++First) in insert()
164 insert(I, *First); in insert()
201 iterator erase(iterator First, iterator Last) { in erase() argument
202 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase()
217 iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose) { in eraseAndDispose() argument
218 while (First != Last) in eraseAndDispose()
219 First = eraseAndDispose(First, dispose); in eraseAndDispose()
244 void splice(iterator I, simple_ilist &, iterator First, iterator Last) { in splice() argument
245 list_base_type::transferBefore(*I.getNodePtr(), *First.getNodePtr(), in splice()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | SelectorExtras.h | 20 const char *First, in getKeywordSelectorImpl() argument
23 II.push_back(&Ctx.Idents.get(First)); in getKeywordSelectorImpl()
32 const char *First = va_arg(argp, const char *); in getKeywordSelector() local
33 assert(First && "keyword selectors must have at least one argument"); in getKeywordSelector()
34 return getKeywordSelectorImpl(Ctx, First, argp); in getKeywordSelector()
39 const char *First, ...) { in getKeywordSelector() argument
41 va_start(argp, First); in getKeywordSelector()
42 Selector result = getKeywordSelectorImpl(Ctx, First, argp); in getKeywordSelector()
49 const char *First, ...) { in lazyInitKeywordSelector() argument
53 va_start(argp, First); in lazyInitKeywordSelector()
[all …]
|
| /external/clang/lib/Format/ |
| D | UnwrappedLineFormatter.cpp | 22 const FormatToken *Next = Line.First->getNextNonComment(); in startsExternCBlock()
53 Offset = getIndentOffset(*Line.First); in nextLine()
74 unsigned LevelIndent = Line.First->OriginalColumn; in adjustToUnmodifiedLine()
77 if ((!Line.First->is(tok::comment) || IndentForLevel[Line.Level] == -1) && in adjustToUnmodifiedLine()
149 if (Next[i + 1]->First->NewlinesBefore > 0) in getNextMergedLine()
171 if (I[1]->Type == LT_Invalid || I[1]->First->MustBreakBefore) in tryFitMultipleLinesInOne()
174 (!I[1]->InPPDirective || I[1]->First->HasUnescapedNewline)) in tryFitMultipleLinesInOne()
193 I[1]->First->is(tok::r_brace)) || in tryFitMultipleLinesInOne()
198 TheLine->First != TheLine->Last) { in tryFitMultipleLinesInOne()
206 if (I[1]->First->is(TT_FunctionLBrace) && in tryFitMultipleLinesInOne()
[all …]
|
| D | AffectedRangeManager.cpp | 30 Line->LeadingEmptyLinesAffected = affectsLeadingEmptyLines(*Line->First); in computeAffectedLines()
37 while (PPEnd != E && !(*PPEnd)->First->HasUnescapedNewline) { in computeAffectedLines()
42 if (affectsTokenRange(*Line->First, *Last, in computeAffectedLines()
72 bool AffectedRangeManager::affectsTokenRange(const FormatToken &First, in affectsTokenRange() argument
75 SourceLocation Start = First.WhitespaceRange.getBegin(); in affectsTokenRange()
77 Start = Start.getLocWithOffset(First.LastNewlineOffset); in affectsTokenRange()
119 for (FormatToken *Tok = Line->First; Tok; Tok = Tok->Next) { in nonPPLineAffected()
134 Line->First->NewlinesBefore == 0; in nonPPLineAffected()
137 Line->First->is(tok::comment) && Line->First->Next == nullptr && in nonPPLineAffected()
138 Line->First->NewlinesBefore < 2 && PreviousLine && in nonPPLineAffected()
|
| D | TokenAnnotator.h | 42 : First(Line.Tokens.front().Tok), Level(Line.Level), in AnnotatedLine()
52 First->Previous = nullptr; in AnnotatedLine()
53 FormatToken *Current = First; in AnnotatedLine()
75 FormatToken *Current = First; in ~AnnotatedLine()
86 return First && First->startsSequence(Tokens...); in startsWith()
106 FormatToken *First; variable
|
| D | FormatTokenLexer.cpp | 97 auto First = Tokens.end() - 3; in tryMergeLessLess() local
98 if (First[2]->is(tok::less) || First[1]->isNot(tok::less) || in tryMergeLessLess()
99 First[0]->isNot(tok::less) || FourthTokenIsLess) in tryMergeLessLess()
103 if (First[1]->WhitespaceRange.getBegin() != in tryMergeLessLess()
104 First[1]->WhitespaceRange.getEnd()) in tryMergeLessLess()
107 First[0]->Tok.setKind(tok::lessless); in tryMergeLessLess()
108 First[0]->TokenText = "<<"; in tryMergeLessLess()
109 First[0]->ColumnWidth += 1; in tryMergeLessLess()
119 SmallVectorImpl<FormatToken *>::const_iterator First = in tryMergeTokens() local
121 if (!First[0]->is(Kinds[0])) in tryMergeTokens()
[all …]
|
| /external/clang/include/clang/Lex/ |
| D | PPCallbacks.h | 326 std::unique_ptr<PPCallbacks> First, Second; variable
331 : First(std::move(_First)), Second(std::move(_Second)) {} in PPChainedCallbacks()
336 First->FileChanged(Loc, Reason, FileType, PrevFID); in FileChanged()
343 First->FileSkipped(SkippedFile, FilenameTok, FileType); in FileSkipped()
349 return First->FileNotFound(FileName, RecoveryPath) || in FileNotFound()
358 First->InclusionDirective(HashLoc, IncludeTok, FileName, IsAngled, in InclusionDirective()
368 First->moduleImport(ImportLoc, Path, Imported); in moduleImport()
373 First->EndOfMainFile(); in EndOfMainFile()
378 First->Ident(Loc, str); in Ident()
384 First->PragmaComment(Loc, Kind, Str); in PragmaComment()
[all …]
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceRangeSpec.cpp | 49 void getRange(const std::string &Token, uint32_t *First, uint32_t *Last) { in getRange() argument
53 *First = std::stoul(Tokens[0]); in getRange()
54 *Last = *First + 1; in getRange()
56 *First = Tokens[0].empty() ? 0 : std::stoul(Tokens[0]); in getRange()
61 if (*First >= *Last) { in getRange()
80 uint32_t First, Last; in record() local
81 getRange(Token, &First, &Last); in record()
83 D->AllFrom = std::min(D->AllFrom, First); in record()
87 D->Numbers.set(First, Last); in record()
|
| D | IceRNG.h | 78 void RandomShuffle(RandomIt First, RandomIt Last, RandomFunc &&RNG) { in RandomShuffle() argument
79 for (auto i = Last - First - 1; i > 0; --i) in RandomShuffle()
80 std::swap(First[i], First[RNG(i + 1)]); in RandomShuffle()
|
| /external/zlib/src/contrib/ada/ |
| D | zlib.adb | 218 Filter.Offset := Simple_GZip_Header'First;
277 In_First := In_Buffer'First;
286 Flush => Flush_Finish (Last < In_Buffer'First));
288 if Out_Buffer'First <= Out_Last then
289 Data_Out (Out_Buffer (Out_Buffer'First .. Out_Last));
403 Item_First : Ada.Streams.Stream_Element_Offset := Item'First;
407 pragma Assert (Rest_First in Buffer'First .. Buffer'Last + 1);
408 pragma Assert (Rest_Last in Buffer'First - 1 .. Buffer'Last);
411 if Rest_Last = Buffer'First - 1 then
416 Rest_First := Buffer'First;
[all …]
|
| D | read.adb | 87 Item'First + File_Size - Offset);
89 for J in Item'First .. Last loop
90 if J < Item'First + Period then
141 Pack_Size := Pack_Size + Last - Buffer'First + 1;
|
| /external/skia/src/core/ |
| D | SkRecordPattern.h | 85 template <typename First, typename... Rest>
88 bool operator()(T* ptr) { return First()(ptr) || Or<Rest...>()(ptr); } in operator()
90 template <typename First>
91 struct Or<First> {
93 bool operator()(T* ptr) { return First()(ptr); }
118 template <typename First, typename... Rest>
119 class Pattern<First, Rest...> {
170 First fFirst;
|
| /external/llvm/lib/CodeGen/ |
| D | InterferenceCache.cpp | 154 BI->First = BI->Last = SlotIndex(); in update()
164 if (!BI->First.isValid() || StartI < BI->First) in update()
165 BI->First = StartI; in update()
177 if (!BI->First.isValid() || StartI < BI->First) in update()
178 BI->First = StartI; in update()
184 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
189 BI->First = RegMaskSlots[i]; in update()
194 if (BI->First.isValid()) in update()
|
| /external/clang/test/SemaCXX/ |
| D | warn-infinite-recursion.cpp | 117 template<int First, int Last>
119 if (First + 1 == Last) { in DoStuff()
124 DoStuff<First, (First + Last)/2>(); in DoStuff()
125 DoStuff<(First + Last)/2, Last>(); in DoStuff()
|
| /external/clang/utils/TableGen/ |
| D | ClangASTNodesEmitter.cpp | 80 Record *First = nullptr, *Last = nullptr; in EmitNode() local
84 First = Last = Base; in EmitNode()
106 if (!First && Result.first) in EmitNode()
107 First = Result.first; in EmitNode()
114 if (!First) in EmitNode()
115 First = R; in EmitNode()
122 if (First) { in EmitNode()
128 OS << Base->getName() << ", " << First->getName() << ", " in EmitNode()
132 return std::make_pair(First, Last); in EmitNode()
|
| /external/llvm/lib/Target/Lanai/ |
| D | LanaiMemAluCombiner.cpp | 336 MbbIterator First = MemInstr; in findClosestSuitableAluInstr() local
339 while (First != Last) { in findClosestSuitableAluInstr()
340 Decrement ? --First : ++First; in findClosestSuitableAluInstr()
343 if (First->isDebugValue()) in findClosestSuitableAluInstr()
346 if (isSuitableAluInstr(IsSpls, First, *Base, *Offset)) { in findClosestSuitableAluInstr()
347 return First; in findClosestSuitableAluInstr()
351 if (First != Last) { in findClosestSuitableAluInstr()
352 if (InstrUsesReg(First, Base)) in findClosestSuitableAluInstr()
354 if (Offset->isReg() && InstrUsesReg(First, Offset)) in findClosestSuitableAluInstr()
|
| /external/parameter-framework/upstream/test/xml-generator/testVector/ |
| D | first.pfw | 5 domain: First
11 # Inherits from "EddGroup" domainGroup, "First" domain
21 # Inherits from "EddGroup" domainGroup, "First" domain
30 # Inherits from "EddGroup" domainGroup and "First" domain
|
| /external/llvm/lib/Target/X86/ |
| D | X86OptimizeLEAs.cpp | 236 int calcInstrDist(const MachineInstr &First, const MachineInstr &Last);
256 bool isReplaceable(const MachineInstr &First, const MachineInstr &Last,
283 int OptimizeLEAPass::calcInstrDist(const MachineInstr &First, in calcInstrDist() argument
287 assert(Last.getParent() == First.getParent() && in calcInstrDist()
289 assert(InstrPos.find(&First) != InstrPos.end() && in calcInstrDist()
293 return InstrPos[&Last] - InstrPos[&First]; in calcInstrDist()
388 bool OptimizeLEAPass::isReplaceable(const MachineInstr &First, in isReplaceable() argument
391 assert(isLEA(First) && isLEA(Last) && in isReplaceable()
395 AddrDispShift = getAddrDispShift(Last, 1, First, 1); in isReplaceable()
401 if (MRI->getRegClass(First.getOperand(0).getReg()) != in isReplaceable()
[all …]
|
| /external/markdown/tests/markdown-test/ |
| D | ordered-and-unordered-list.txt | 58 1. First
71 1. First
106 1. First
115 1. First
|
| /external/markdown/MarkdownTest/Tests_2004/ |
| D | Ordered and unordered lists.text | 58 1. First
71 1. First
106 1. First
115 1. First
|
| /external/markdown/MarkdownTest/Tests_2007/ |
| D | Ordered and unordered lists.text | 58 1. First
71 1. First
106 1. First
115 1. First
|
| /external/mesa3d/src/gallium/auxiliary/tgsi/ |
| D | tgsi_two_side.c | 80 ts->front_color_input[decl->Semantic.Index] = decl->Range.First; in xform_decl()
84 ts->face_input = decl->Range.First; in xform_decl()
114 decl.Range.First = decl.Range.Last = ts->num_inputs++; in emit_prolog()
117 ts->back_color_input[i] = decl.Range.First; in emit_prolog()
126 decl.Range.First = ts->num_temps; in emit_prolog()
139 decl.Range.First = decl.Range.Last = ts->num_inputs++; in emit_prolog()
141 ts->face_input = decl.Range.First; in emit_prolog()
|