| /external/llvm/lib/MC/ |
| StringTableBuilder.cpp | 39 StringRef Previous;
41 if (Previous.endswith(s)) {
49 Previous = s;
|
| /external/llvm/include/llvm/ADT/ |
| edit_distance.h | 61 unsigned *Previous = SmallBuffer;
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/llvm/lib/CodeGen/AsmPrinter/ |
| EHStreamer.h | 57 unsigned Previous;
|
| /external/webrtc/src/system_wrappers/source/ |
| map.cc | 112 MapItem* MapWrapper::Previous(MapItem* item) const
|
| list_no_stl.cc | 140 ListItem* ListWrapper::Previous(ListItem* item) const
|
| list_stl.cc | 163 ListItem* ListWrapper::Previous(ListItem* item) const
|
| map_no_stl.cc | 136 MapNoStlItem* MapNoStl::Previous(MapNoStlItem* item) const
|
| list_unittest.cc | 62 ListItem* Previous(ListItem* item) const {
63 return list_.Previous(item);
355 // Reverse the list using PushBack and Previous.
357 item = ascending_list->Previous(item)) {
|
| /external/clang/include/clang/AST/ |
| DeclContextInternals.h | 250 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);
107 /// If NextIsPrevious() is true, this is a link to the previous declaratio
[all...] |
| /external/clang/lib/Frontend/ |
| FrontendAction.cpp | 38 ASTDeserializationListener *Previous;
43 ASTDeserializationListener *Previous, bool DeletePrevious)
44 : Previous(Previous), DeletePrevious(DeletePrevious) {}
47 delete Previous;
51 if (Previous)
52 Previous->ReaderInitialized(Reader);
56 if (Previous)
57 Previous->IdentifierRead(ID, II);
60 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.Type != TT_CtorInitializerComma ||
93 const FormatToken &Previous = *Current.Previous;
94 assert(&Previous == Current.Previous);
[all...] |
| FormatToken.h | 114 MatchingParen(nullptr), Previous(nullptr), Next(nullptr),
360 /// \brief Returns the previous token ignoring comments.
362 FormatToken *Tok = Previous;
364 Tok = Tok->Previous;
392 FormatToken *Previous;
|
| Format.cpp | [all...] |
| /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 | 211 // (assembler and preprocessor), or bypass a previous driver ('collect2').
[all...] |
| /external/chromium_org/third_party/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 | 477 // A previous decl with a different name is because of
546 // The previous declaration was not a class decl. Check if we have a
635 // Look for previous declaration of alias name
722 // Create a new protocol that is completely distinct from previous
752 // Merge attributes from previous declarations.
836 return; // Possibly due to previous error
[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...] |
