/external/clang/lib/Format/ |
H A D | UnwrappedLineParser.cpp | 717 FormatToken *Next = FormatTok; local 721 ? Next->NewlinesBefore == 0 734 if (Next->is(tok::exclaim) && PreviousMustBeValue) 736 bool NextMustBeValue = mustBeJSIdentOrValue(Keywords, Next); 741 if (PreviousMustBeValue && isJSDeclOrStmt(Keywords, Next)) 1045 FormatToken *Next = Tokens->getNextToken(); local 1047 if (Next && !mustBeJSIdent(Keywords, Next)) {
|
/external/clang/lib/Frontend/ |
H A D | VerifyDiagnosticConsumer.cpp | 207 bool Next(StringRef S) { function in class:__anon1349::ParseHelper 217 bool Next(unsigned &N) { function in class:__anon1349::ParseHelper 321 // Next token: - 322 if (!PH.Next("-")) 326 // Next token: { error | warning | note } 328 if (PH.Next("error")) 330 else if (PH.Next("warning")) 332 else if (PH.Next("remark")) 334 else if (PH.Next("note")) 336 else if (PH.Next("n [all...] |
/external/clang/lib/Parse/ |
H A D | ParseExpr.cpp | 490 CastExpressionIdValidator(Token Next, bool AllowTypes, bool AllowNonTypes) argument 491 : NextToken(Next), AllowNonTypes(AllowNonTypes) { 784 const Token &Next = NextToken(); local 789 if (Next.is(tok::l_paren) && 866 if ((!ColonIsSacred && Next.is(tok::colon)) || 867 Next.isOneOf(tok::coloncolon, tok::less, tok::l_paren, 925 const Token& Next = NextToken(); local 927 Next.is(tok::colon) || Next.is(tok::r_square)) 1226 Token Next [all...] |
H A D | ParseStmt.cpp | 181 Token Next = NextToken(); local 182 if (Next.is(tok::colon)) { // C99 6.8.1: labeled-statement 189 if (Next.isNot(tok::coloncolon)) { 193 llvm::make_unique<StatementFilterCCC>(Next)) == 1477 const Token &Next = NextToken(); local 1478 if (Next.is(tok::colon)) 1481 if (Next.isOneOf(tok::l_square, tok::kw_alignas)) {
|
/external/flatbuffers/tests/ |
H A D | py_test.py | 206 choice = int(l.Next()) % testValuesMax 258 choice = int(l.Next()) % testValuesMax 1234 def Next(self): member in class:LCG
|
/external/llvm/include/llvm/ADT/ |
H A D | ilist.h | 32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize 63 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); } argument 506 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next); local 508 this->setNext(Prev, Next); 510 L2.Head = Next; 511 this->setPrev(Next, Prev); 600 iterator Next = First2; local 601 transfer(First1, Right, First2, ++Next); 653 auto Next = std::next(N.getIterator()); local [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | DIE.h | 415 PointerIntPair<IntrusiveBackListNode *, 1> Next; member in struct:llvm::IntrusiveBackListNode 416 IntrusiveBackListNode() : Next(this, true) {} 419 return Next.getInt() ? nullptr : Next.getPointer(); 429 assert(N.Next.getPointer() == &N && "Expected unlinked node"); 430 assert(N.Next.getInt() == true && "Expected unlinked node"); 433 N.Next = Last->Next; 434 Last->Next.setPointerAndInt(&N, false); 493 return Last ? iterator(static_cast<T *>(Last->Next [all...] |
/external/llvm/include/llvm/DebugInfo/CodeView/ |
H A D | SymbolRecord.h | 90 ulittle32_t Next; member in struct:llvm::codeview::Thunk32Sym::Hdr 289 Data = Next; 290 Next = ArrayRef<uint8_t>(); 359 Next = Data; 360 uint32_t Op = GetCompressedAnnotation(Next); 366 Next = ArrayRef<uint8_t>(); 370 Result.U1 = GetCompressedAnnotation(Next); 374 Result.U1 = GetCompressedAnnotation(Next); 378 Result.U1 = GetCompressedAnnotation(Next); 382 Result.U1 = GetCompressedAnnotation(Next); 432 ArrayRef<uint8_t> Next; member in struct:llvm::codeview::BinaryAnnotationIterator [all...] |
/external/llvm/include/llvm/Support/ |
H A D | TargetRegistry.h | 159 /// Next - The next registered target in the linked list, maintained by the 161 Target *Next; member in class:llvm::Target 261 const Target *getNext() const { return Next; }
|
/external/llvm/lib/MC/ |
H A D | MachObjectWriter.cpp | 109 unsigned Next = Sec->getLayoutOrder() + 1; local 110 if (Next >= Layout.getSectionOrder().size()) 113 const MCSection &NextSec = *Layout.getSectionOrder()[Next];
|
/external/llvm/lib/Target/Lanai/AsmParser/ |
H A D | LanaiAsmParser.cpp | 1014 size_t Next = Name.find('.'); local 1031 LPCC::suffixToLanaiCondCode(Mnemonic.substr(1, Next)); 1052 size_t Next = Mnemonic.rfind('.', Name.size()); local 1059 Mnemonic = Mnemonic.substr(0, Next + 1); 1061 Mnemonic = Mnemonic.substr(0, Next);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 804 BasicBlock *Next = needPostfix(Flow, ExitUseAllowed); local 807 Conditions.push_back(BranchInst::Create(Entry, Next, BoolUndef, Flow)); 817 changeExit(PrevNode, Next, false); 818 setPrevNode(Next); 857 BasicBlock *Next = needPostfix(LoopEnd, ExitUseAllowed); local 858 LoopConds.push_back(BranchInst::Create(Next, LoopStart, 861 setPrevNode(Next);
|
/external/llvm/lib/Transforms/Utils/ |
H A D | MemorySSA.cpp | 285 auto Next = std::next(AI); local 292 AI = Next;
|
/external/llvm/utils/TableGen/ |
H A D | AsmWriterEmitter.cpp | 627 StringRef::iterator Next; local 633 Next = I; 635 if (Next != End) 636 ++Next; 643 Next = I; 646 return std::make_pair(StringRef(Start, I - Start), Next);
|
/external/mesa3d/src/mesa/drivers/x11/ |
H A D | xmesaP.h | 242 struct xmesa_buffer *Next; /* Linked list pointer: */ member in struct:xmesa_buffer
|
/external/pdfium/third_party/lcms2-2.6/include/ |
H A D | lcms2_plugin.h | 212 struct _cmsPluginBaseStruct* Next; // For multiple plugin definition. NULL for end of list. member in struct:_cmsPluginBaseStruct
|
/external/pdfium/third_party/lcms2-2.6/src/ |
H A D | cmscnvrt.c | 89 struct _cms_intents_list* Next; member in struct:_cms_intents_list 126 entry = entry ->Next) { 134 newEntry -> Next = NULL; 136 Anterior -> Next = newEntry; 169 for (pt = ctx -> Intents; pt != NULL; pt = pt -> Next) 172 for (pt = DefaultIntents; pt != NULL; pt = pt -> Next) 1080 for (nIntents=0, pt = ctx->Intents; pt != NULL; pt = pt -> Next) 1093 for (nIntents=0, pt = DefaultIntents; pt != NULL; pt = pt -> Next) 1137 fl ->Next = ctx ->Intents;
|
H A D | cmsgamma.c | 53 struct _cmsParametricCurvesCollection_st* Next; // Next in list member in struct:_cmsParametricCurvesCollection_st 66 NULL // Next in chain 84 entry = entry ->Next) { 92 newEntry -> Next = NULL; 94 Anterior -> Next = newEntry; 155 fl ->Next = ctx->ParametricCurves; 184 for (c = ctx->ParametricCurves; c != NULL; c = c ->Next) { 195 for (c = &DefaultCurves; c != NULL; c = c ->Next) {
|
H A D | cmsxform.c | 464 struct _cmsTransformCollection_st *Next; member in struct:_cmsTransformCollection_st 485 entry = entry ->Next) { 493 newEntry -> Next = NULL; 495 Anterior -> Next = newEntry; 547 fl ->Next = ctx->TransformCollection; 607 Plugin = Plugin ->Next) {
|
/external/sfntly/cpp/src/sfntly/table/core/ |
H A D | cmap_table.cc | 96 cmap.Attach(cmap_iterator.Next()); 176 CALLER_ATTACH CMapTable::CMap* CMapTable::CMapIterator::Next() { function in class:sfntly::CMapTable::CMapIterator 379 int32_t CMapTable::CMapFormat0::CharacterIterator::Next() { function in class:sfntly::CMapTable::CMapFormat0::CharacterIterator 824 int32_t CMapTable::CMapFormat4::CharacterIterator::Next() { function in class:sfntly::CMapTable::CMapFormat4::CharacterIterator
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | ilist.h | 32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize 62 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); } argument 485 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next); local 487 this->setNext(Prev, Next); 489 L2.Head = Next; 490 this->setPrev(Next, Prev); 591 for (iterator I = begin(), E = end(), Next = begin(); ++Next ! [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
H A D | MachineOperand.h | 139 MachineOperand *Next; member in struct:llvm::MachineOperand::__anon18338::__anon18339 284 return Contents.Reg.Next; 505 Op.Contents.Reg.Next = 0;
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | TargetRegistry.h | 125 /// Next - The next registered target in the linked list, maintained by the 127 Target *Next; member in class:llvm::Target 213 const Target *getNext() const { return Next; }
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/AsmPrinter/ |
H A D | DwarfDebug.h | 106 void Merge(DotDebugLocEntry *Next) { argument 107 if (!(Begin && Loc == Next->Loc && End == Next->Begin)) 109 Next->Begin = Begin;
|
/external/swiftshader/third_party/LLVM/lib/ExecutionEngine/JIT/ |
H A D | JITMemoryManager.cpp | 91 FreeRangeHeader *Next; member in struct:__anon18633::FreeRangeHeader 107 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!"); 108 Next->Prev = Prev; 109 return Prev->Next = Next; 113 Next = FreeList; 115 Prev->Next = this; 116 Next->Prev = this; 160 FreeList = FollowingFreeBlock.Next; [all...] |