| /external/clang/lib/Format/ |
| D | ContinuationIndenter.cpp | 44 return Tok.isMemberAccess() && Tok.Previous && Tok.Previous->closesScope(); in startsSegmentOfBuilderTypeCall()
50 const FormatToken &Previous = *Current.Previous; in startsNextParameter() local
54 return Previous.is(tok::comma) && !Current.isTrailingComment() && in startsNextParameter()
55 (Previous.isNot(TT_CtorInitializerComma) || in startsNextParameter()
94 const FormatToken &Previous = *Current.Previous; in canBreak() local
95 assert(&Previous == Current.Previous); in canBreak()
102 if (!Current.MustBreakBefore && Previous.is(tok::l_brace) && in canBreak()
103 Previous.isNot(TT_DictLiteral) && Previous.BlockKind == BK_BracedInit && in canBreak()
104 Previous.Previous && in canBreak()
105 Previous.Previous->isOneOf(tok::l_brace, tok::l_paren, tok::comma)) in canBreak()
[all …]
|
| D | TokenAnnotator.cpp | 47 FormatToken *Left = CurrentToken->Previous; in parseAngle()
52 Left->Previous && Left->Previous->Tok.isNot(tok::kw_template); in parseAngle()
80 if (CurrentToken->Previous->isOneOf(tok::pipepipe, tok::ampamp) && in parseAngle()
81 CurrentToken->Previous->is(TT_BinaryOperator) && in parseAngle()
102 FormatToken *Left = CurrentToken->Previous; in parseParens()
106 } else if (FormatToken *MaybeSel = Left->Previous) { in parseParens()
108 if (MaybeSel->isObjCAtKeyword(tok::objc_selector) && MaybeSel->Previous && in parseParens()
109 MaybeSel->Previous->is(tok::at)) { in parseParens()
114 if (Left->Previous && in parseParens()
115 (Left->Previous->isOneOf(tok::kw_static_assert, tok::kw_if, in parseParens()
[all …]
|
| D | FormatToken.cpp | 62 if (State.NextToken == nullptr || !State.NextToken->Previous || in formatAfterToken()
63 !State.NextToken->Previous->Previous) in formatAfterToken()
67 const FormatToken *LBrace = State.NextToken->Previous->Previous; in formatAfterToken()
76 Style.ColumnLimit - State.Column + State.NextToken->Previous->ColumnWidth; in formatAfterToken()
95 if (Item < Commas.size() && State.NextToken->Previous == Commas[Item]) { in formatAfterToken()
176 ItemEnd = Token->MatchingParen->Previous; in precomputeFormattingInfos()
|
| D | UnwrappedLineFormatter.cpp | 543 assert(!B.First->Previous); in join()
547 B.First->Previous = A.Last; in join()
631 while (Current->Previous) { in reconstructPath()
633 Current = Current->Previous; in reconstructPath()
642 printLineState((*I)->Previous->State); in reconstructPath()
645 << (*I)->Previous->State.NextToken->Tok.getName() << ": " in reconstructPath()
675 FormatToken &Previous = *State.NextToken->Previous; in formatChildren() local
677 Previous.Children.size() == 0) in formatChildren()
684 Previous.Children[0]->Level * Style.IndentWidth; in formatChildren()
686 Penalty += format(Previous.Children, DryRun, AdditionalIndent, in formatChildren()
[all …]
|
| D | UnwrappedLineFormatter.h | 53 StateNode(const LineState &State, bool NewLine, StateNode *Previous) in StateNode()
54 : State(State), NewLine(NewLine), Previous(Previous) {} in StateNode()
57 StateNode *Previous; member
|
| D | TokenAnnotator.h | 52 First->Previous = nullptr; in AnnotatedLine()
59 I->Tok->Previous = Current; in AnnotatedLine()
|
| D | FormatToken.h | 121 MatchingParen(nullptr), Previous(nullptr), Next(nullptr), in FormatToken()
381 FormatToken *Tok = Previous; in getPreviousNonComment()
383 Tok = Tok->Previous; in getPreviousNonComment()
411 FormatToken *Previous; member
|
| /external/llvm/include/llvm/ADT/ |
| D | edit_distance.h | 61 unsigned *Previous = SmallBuffer; variable
63 Previous = new unsigned [2*(n+1)];
64 Allocated.reset(Previous);
66 unsigned *Current = Previous + (n + 1);
69 Previous[i] = i;
78 Previous[x-1] + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
79 std::min(Current[x-1], Previous[x])+1);
82 if (FromArray[y-1] == ToArray[x-1]) Current[x] = Previous[x-1];
83 else Current[x] = std::min(Current[x-1], Previous[x]) + 1;
92 Current = Previous;
[all …]
|
| /external/clang/lib/Frontend/ |
| D | FrontendAction.cpp | 40 ASTDeserializationListener *Previous; member in __anonf0c414a90111::DelegatingDeserializationListener
45 ASTDeserializationListener *Previous, bool DeletePrevious) in DelegatingDeserializationListener() argument
46 : Previous(Previous), DeletePrevious(DeletePrevious) {} in DelegatingDeserializationListener()
49 delete Previous; in ~DelegatingDeserializationListener()
53 if (Previous) in ReaderInitialized()
54 Previous->ReaderInitialized(Reader); in ReaderInitialized()
58 if (Previous) in IdentifierRead()
59 Previous->IdentifierRead(ID, II); in IdentifierRead()
62 if (Previous) in TypeRead()
63 Previous->TypeRead(Idx, T); in TypeRead()
[all …]
|
| /external/libnfc-nxp/src/ |
| D | phFriNfc_NdefReg.c | 133 NdefCb->Previous =NULL; in phFriNfc_NdefReg_AddCb()
142 NdefCb->Previous = NULL; in phFriNfc_NdefReg_AddCb()
143 NdefReg->NdefTypeList->Previous = NdefCb; in phFriNfc_NdefReg_AddCb()
144 NdefReg->NdefTypeList = NdefReg->NdefTypeList->Previous; in phFriNfc_NdefReg_AddCb()
191 if(tempNode->Previous==NULL && tempNode->Next!=NULL) in phFriNfc_NdefReg_RmCb()
194 NdefReg->NdefTypeList->Previous = NULL; in phFriNfc_NdefReg_RmCb()
198 if(tempNode->Next==NULL && tempNode->Previous==NULL) in phFriNfc_NdefReg_RmCb()
203 if (tempNode->Previous != NULL) in phFriNfc_NdefReg_RmCb()
205 tempNode->Previous->Next = tempNode->Next; in phFriNfc_NdefReg_RmCb()
209 tempNode->Next->Previous = tempNode->Previous; in phFriNfc_NdefReg_RmCb()
[all …]
|
| /external/clang/include/clang/AST/ |
| D | Redeclarable.h | 36 typedef Decl *Previous; typedef
41 typedef llvm::PointerUnion<Previous, UninitializedLatest> NotKnownLatest;
52 : Next(NotKnownLatest(Previous(D))) {} in DeclLink()
58 Next.get<NotKnownLatest>().template is<Previous>(); in NextIsPrevious()
66 if (NKL.is<Previous>()) in getNext()
67 return static_cast<decl_type*>(NKL.get<Previous>()); in getNext()
79 Next = Previous(D); in setPrevious()
|
| /external/llvm/lib/MC/ |
| D | StringTableBuilder.cpp | 51 StringRef Previous; in finalize() local
56 if (Previous.endswith(s)) { in finalize()
64 Previous = s; in finalize()
|
| /external/webrtc/src/system_wrappers/test/list/ |
| D | list.cc | 116 ListItem* second_to_last_item = test_list.Previous(last_item); in main()
118 FailTest(test_list.Previous(first_item) != NULL); in main()
119 FailTest(test_list.Previous(NULL) != NULL); in main()
162 FailTest(test_list.Previous(NULL) != NULL); in main()
|
| /external/clang/lib/Sema/ |
| D | SemaDecl.cpp | 1174 static bool AllowOverloadingOfFunction(LookupResult &Previous, in AllowOverloadingOfFunction() argument
1179 if (Previous.getResultKind() == LookupResult::FoundOverloaded) in AllowOverloadingOfFunction()
1182 return (Previous.getResultKind() == LookupResult::Found in AllowOverloadingOfFunction()
1183 && Previous.getFoundDecl()->hasAttr<OverloadableAttr>()); in AllowOverloadingOfFunction()
1820 LookupResult &Previous) { in filterNonConflictingPreviousTypedefDecls() argument
1826 if (Previous.empty()) in filterNonConflictingPreviousTypedefDecls()
1829 LookupResult::Filter Filter = Previous.makeFilter(); in filterNonConflictingPreviousTypedefDecls()
3218 LookupResult &Previous) { in mergeTypeWithPrevious() argument
3227 if (Previous.isShadowed()) in mergeTypeWithPrevious()
3254 void Sema::MergeVarDecl(VarDecl *New, LookupResult &Previous) { in MergeVarDecl() argument
[all …]
|
| D | SemaTemplate.cpp | 864 LookupResult Previous(*this, Name, NameLoc, in CheckClassTemplate() local
894 LookupQualifiedName(Previous, SemanticContext); in CheckClassTemplate()
897 LookupName(Previous, S); in CheckClassTemplate()
900 if (Previous.isAmbiguous()) in CheckClassTemplate()
904 if (Previous.begin() != Previous.end()) in CheckClassTemplate()
905 PrevDecl = (*Previous.begin())->getUnderlyingDecl(); in CheckClassTemplate()
951 LookupResult Previous(*this, Name, NameLoc, LookupOrdinaryName, in CheckClassTemplate() local
956 LookupQualifiedName(Previous, LookupContext); in CheckClassTemplate()
958 if (Previous.isAmbiguous()) in CheckClassTemplate()
961 if (Previous.begin() != Previous.end()) in CheckClassTemplate()
[all …]
|
| /external/clang/include/clang/Lex/ |
| D | MacroInfo.h | 324 MacroDirective *Previous;
363 : Previous(nullptr), Loc(Loc), MDKind(K), IsFromPCH(false), in Previous() function
383 Previous = Prev; in setPrevious()
387 const MacroDirective *getPrevious() const { return Previous; } in getPrevious()
390 MacroDirective *getPrevious() { return Previous; } in getPrevious()
|
| /external/webrtc/src/system_wrappers/test/map/ |
| D | map.cc | 94 MapItem* second_to_last_item = test_map.Previous(last_item); in main()
97 FailTest(test_map.Previous(first_item) != NULL); in main()
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 143 NodeSubset Previous(Reachable); in NodesReachableFrom() local
147 if (Previous.count(i)) in NodesReachableFrom()
151 if (Reachable == Previous) in NodesReachableFrom()
|
| /external/webrtc/src/system_wrappers/interface/ |
| D | map_wrapper.h | 65 MapItem* Previous(MapItem* item) const;
|
| D | list_wrapper.h | 77 ListItem* Previous(ListItem* item) const;
|
| /external/webrtc/src/system_wrappers/source/ |
| D | map_no_stl.h | 55 MapNoStlItem* Previous(MapNoStlItem* item) const;
|
| D | list_stl.h | 55 ListItem* Previous(ListItem* item) const;
|
| D | list_unittest.cc | 62 ListItem* Previous(ListItem* item) const { in Previous() function in ListWrapperSimple
63 return list_.Previous(item); in Previous()
357 item = ascending_list->Previous(item)) { in TEST()
|
| D | list_no_stl.h | 59 ListNoStlItem* Previous(ListNoStlItem* item) const;
|
| /external/clang/lib/Serialization/ |
| D | ASTReaderDecl.cpp | 231 Redeclarable<DeclT> *D, Decl *Previous,
234 static void attachPreviousDecl(ASTReader &Reader, Decl *D, Decl *Previous,
2685 auto &Previous = Reader.AnonymousDeclarationsForMerging[DC]; in getAnonymousDeclForMerging() local
2686 if (Index < Previous.size() && Previous[Index]) in getAnonymousDeclForMerging()
2687 return Previous[Index]; in getAnonymousDeclForMerging()
2693 if (Previous.size() == Number) in getAnonymousDeclForMerging()
2694 Previous.push_back(cast<NamedDecl>(ND->getCanonicalDecl())); in getAnonymousDeclForMerging()
2696 Previous[Number] = cast<NamedDecl>(ND->getCanonicalDecl()); in getAnonymousDeclForMerging()
2700 return Index < Previous.size() ? Previous[Index] : nullptr; in getAnonymousDeclForMerging()
2709 auto &Previous = Reader.AnonymousDeclarationsForMerging[DC]; in setAnonymousDeclForMerging() local
[all …]
|