| /external/llvm/include/llvm/ADT/ |
| edit_distance.h | 57 // iteration, and the top-left entry is stored in Previous.
77 unsigned Previous = y - 1;
82 Previous + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u),
86 if (FromArray[y-1] == ToArray[x-1]) Row[x] = Previous;
89 Previous = OldRow;
|
| /external/llvm/lib/MC/ |
| StringTableBuilder.cpp | 87 StringRef Previous;
93 if (Previous.endswith(S)) {
102 Previous = S;
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| EHStreamer.h | 59 unsigned Previous;
|
| /external/clang/include/clang/AST/ |
| DeclContextInternals.h | 248 llvm::PointerIntPair<StoredDeclsMap*, 1> Previous;
|
| Redeclarable.h | 36 typedef Decl *Previous;
39 /// we've not yet set the previous decl or there isn't one), or to a known
40 /// previous declaration.
41 typedef llvm::PointerUnion<Previous, UninitializedLatest> NotKnownLatest;
52 : Next(NotKnownLatest(Previous(D))) {}
58 Next.get<NotKnownLatest>().template is<Previous>();
66 if (NKL.is<Previous>())
67 return static_cast<decl_type*>(NKL.get<Previous>());
79 Next = Previous(D);
114 /// If NextIsPrevious() is true, this is a link to the previous declaratio
[all...] |
| /external/clang/lib/Frontend/ |
| FrontendAction.cpp | 40 ASTDeserializationListener *Previous;
45 ASTDeserializationListener *Previous, bool DeletePrevious)
46 : Previous(Previous), DeletePrevious(DeletePrevious) {}
49 delete Previous;
53 if (Previous)
54 Previous->ReaderInitialized(Reader);
58 if (Previous)
59 Previous->IdentifierRead(ID, II);
62 if (Previous)
[all...] |
| /external/libnfc-nxp/src/ |
| phFriNfc_NdefReg.h | 215 * This member is required by the library to link to the previous registered item. In case of the
218 struct phFriNfc_NdefReg_Cb *Previous;
|
| /external/clang/lib/Format/ |
| ContinuationIndenter.cpp | 44 return Tok.isMemberAccess() && Tok.Previous && Tok.Previous->closesScope();
50 const FormatToken &Previous = *Current.Previous;
54 return Previous.is(tok::comma) && !Current.isTrailingComment() &&
55 (Previous.isNot(TT_CtorInitializerComma) ||
94 const FormatToken &Previous = *Current.Previous;
95 assert(&Previous == Current.Previous);
[all...] |
| UnwrappedLineFormatter.cpp | 433 assert(!B.First->Previous);
437 B.First->Previous = A.Last;
512 FormatToken &Previous = *State.NextToken->Previous;
514 LBrace->BlockKind != BK_Block || Previous.Children.size() == 0)
515 // The previous token does not open a block. Nothing to do. We don't
521 Previous.Children[0]->Level * Style.IndentWidth;
524 BlockFormatter->format(Previous.Children, DryRun, AdditionalIndent,
529 if (Previous.Children[0]->First->MustBreakBefore)
533 if (Previous.Children.size() > 1
[all...] |
| FormatToken.h | 263 /// \brief The previous token in the unwrapped line.
264 FormatToken *Previous = nullptr;
397 /// \brief Returns the previous token ignoring comments.
399 FormatToken *Tok = Previous;
401 Tok = Tok->Previous;
|
| TokenAnnotator.cpp | 47 FormatToken *Left = CurrentToken->Previous;
59 Left->Previous && Left->Previous->Tok.isNot(tok::kw_template);
87 if (CurrentToken->Previous->isOneOf(tok::pipepipe, tok::ampamp) &&
88 CurrentToken->Previous->is(TT_BinaryOperator) &&
102 FormatToken *Left = CurrentToken->Previous;
114 } else if (FormatToken *MaybeSel = Left->Previous) {
116 if (MaybeSel->isObjCAtKeyword(tok::objc_selector) && MaybeSel->Previous &&
117 MaybeSel->Previous->is(tok::at)) {
122 if (Left->Previous &
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExprEngineCXX.cpp | 205 // Go backward in the CFG to see if the previous element (ignoring
217 CFGElement Previous = (*B)[PreviousStmtIdx];
219 while (Previous.getAs<CFGImplicitDtor>() && PreviousStmtIdx > 0) {
221 Previous = (*B)[PreviousStmtIdx];
224 if (Optional<CFGStmt> PrevStmtElem = Previous.getAs<CFGStmt>()) {
|
| /external/tinyxml/ |
| tinyxml.cpp | 368 const TiXmlNode* TiXmlNode::IterateChildren( const TiXmlNode* previous ) const
370 if ( !previous )
376 assert( previous->parent == this );
377 return previous->NextSibling();
381 TiXmlNode* TiXmlNode::IterateChildren( TiXmlNode* previous )
383 if ( !previous )
389 assert( previous->parent == this );
390 return previous->NextSibling();
394 const TiXmlNode* TiXmlNode::IterateChildren( const char * val, const TiXmlNode* previous ) const
396 if ( !previous )
[all...] |
| /external/clang/lib/Driver/ |
| Driver.cpp | 216 // (assembler and preprocessor), or bypass a previous driver ('collect2').
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | [all...] |
| /external/sfntly/cpp/src/test/tinyxml/ |
| tinyxml.h | 558 IterateChildren takes the previous child as input and finds
559 the next one. If the previous child is null, it returns the
562 const TiXmlNode* IterateChildren( const TiXmlNode* previous ) const;
563 TiXmlNode* IterateChildren( const TiXmlNode* previous ) {
564 return const_cast< TiXmlNode* >( (const_cast< const TiXmlNode* >(this))->IterateChildren( previous ) );
568 const TiXmlNode* IterateChildren( const char * value, const TiXmlNode* previous ) const;
569 TiXmlNode* IterateChildren( const char * _value, const TiXmlNode* previous ) {
570 return const_cast< TiXmlNode* >( (const_cast< const TiXmlNode* >(this))->IterateChildren( _value, previous ) );
574 const TiXmlNode* IterateChildren( const std::string& _value, const TiXmlNode* previous ) const { return IterateChildren (_value.c_str (), previous); } ///< STL std::string form
[all...] |
| /external/clang/lib/Sema/ |
| SemaDeclObjC.cpp | 509 // The previous declaration was not a class decl. Check if we have a
[all...] |
| /external/v8/src/interpreter/ |
| bytecode-generator.cc | 61 ContextScope* Previous(int depth) {
66 ContextScope* previous = this; local
68 previous = previous->outer_;
70 return previous;
[all...] |
| /external/clang/lib/Serialization/ |
| ASTReaderDecl.cpp | 212 Redeclarable<DeclT> *D, Decl *Previous,
215 static void attachPreviousDecl(ASTReader &Reader, Decl *D, Decl *Previous,
[all...] |
| /external/clang/include/clang/Sema/ |
| Sema.h | 279 // will not link it. Since it has no previous decls, it will remain
593 /// Undo a previous pushUndelayed().
[all...] |
