| /external/clang/lib/Parse/ |
| ParseExpr.cpp | 706 const Token &Next = NextToken();
708 // If this identifier was reverted from a token ID, and the next token
711 if (Next.is(tok::l_paren) && Tok.is(tok::identifier) &&
717 if (Next.is(tok::coloncolon) ||
718 (!ColonIsSacred && Next.is(tok::colon)) ||
719 Next.is(tok::less) ||
720 Next.is(tok::l_paren) ||
721 Next.is(tok::l_brace)) {
778 const Token& Next = NextToken();
780 Next.is(tok::colon) || Next.is(tok::r_square)
[all...] |
| ParseStmt.cpp | 177 Token Next = NextToken();
178 if (Next.is(tok::colon)) { // C99 6.8.1: labeled-statement
185 if (Next.isNot(tok::coloncolon)) {
187 // correction based on what the next token is.
188 StatementFilterCCC Validator(Next);
191 // Handle errors here by skipping up to the next semicolon or '}', and
386 // If the expression is invalid, skip ahead to the next semicolon or '}'.
[all...] |
| Parser.cpp | 226 /// token will ever occur, this skips to the next token, or to some likely
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 11 // (i.e. each node of the list must contain a next and previous field for the
14 // The ilist_traits trait class is used to gain access to the next and previous
17 // to get the next and previous pointers.
20 // that the nodes contain next/prev pointers. This list replacement does not
27 // of this, users of the direct next/prev links will see an extra link on the
32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize
33 // ilist_traits to provide an alternate way of getting and setting next and
53 /// that provides default next/prev implementations for common operations.
63 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); }
594 iterator next = I; ++next; local
601 iterator next = I; ++next; local
624 iterator next = first2; local
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 737 BasicBlock *Next = needPostfix(Flow, ExitUseAllowed);
739 // let it point to entry and next block
740 Conditions.push_back(BranchInst::Create(Entry, Next, BoolUndef, Flow));
750 changeExit(PrevNode, Next, false);
751 setPrevNode(Next);
790 BasicBlock *Next = needPostfix(LoopEnd, ExitUseAllowed);
791 LoopConds.push_back(BranchInst::Create(Next, LoopStart,
794 setPrevNode(Next);
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_pair_schedule.c | 15 * next paragraph) shall be included in all copies or substantial
47 /** Next instruction in the linked list of ready instructions. */
90 struct reg_value_reader *Next;
111 * of the instruction writing \ref Next is decremented.
115 struct reg_value *Next; /**< Pointer to the next value to be written to the same register */
129 struct remap_reg * Next;
289 for (r = v->Readers; r; r = r->Next) {
365 * This function decreases the dependencies of the next instruction that
376 if (v->Next) {
[all...] |
| /external/mesa3d/src/mesa/drivers/x11/ |
| glxapi.c | 50 struct display_dispatch *Next;
106 d = d->Next;
123 d->Next = DispatchList;
[all...] |
| xmesaP.h | 242 struct xmesa_buffer *Next; /* Linked list pointer: */
|
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/include/ |
| lcms2_plugin.h | 212 struct _cmsPluginBaseStruct* Next; // For multiple plugin definition. NULL for end of list.
|
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/ |
| cmslut.c | 134 mpe = mpe ->Next;
145 mpe = mpe ->Next;
[all...] |
| /external/sfntly/cpp/src/sfntly/table/core/ |
| cmap_table.cc | 96 cmap.Attach(cmap_iterator.Next());
176 CALLER_ATTACH CMapTable::CMap* CMapTable::CMapIterator::Next() {
379 int32_t CMapTable::CMapFormat0::CharacterIterator::Next() {
824 int32_t CMapTable::CMapFormat4::CharacterIterator::Next() {
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| confpriv.h | 155 virtual HRESULT WINAPI Next(ULONG celt,ITParticipant **ppElements,ULONG *pceltFetched) = 0;
166 HRESULT (WINAPI *Next)(IEnumParticipant *This,ULONG celt,ITParticipant **ppElements,ULONG *pceltFetched);
179 #define IEnumParticipant_Next(This,celt,ppElements,pceltFetched) (This)->lpVtbl->Next(This,celt,ppElements,pceltFetched)
|
| shappmgr.h | 234 virtual HRESULT WINAPI Next(IPublishedApp **pia) = 0;
243 HRESULT (WINAPI *Next)(IEnumPublishedApps *This,IPublishedApp **pia);
254 #define IEnumPublishedApps_Next(This,pia) (This)->lpVtbl->Next(This,pia)
|
| /system/core/libziparchive/ |
| zip_archive.cc | 372 * Round up to the next highest power of 2.
938 int32_t Next(void* cookie, ZipEntry* data, ZipEntryName* name) {
[all...] |
| /art/compiler/dex/ |
| mir_graph.cc | 163 insn = insn->next;
206 SuccessorBlockInfo* successor_block_info = iterator.Next();
217 prev->next = nullptr;
239 p = p->next;
323 for (; iterator.HasNext(); iterator.Next()) {
351 check_insn = check_insn->Next();
394 check_insn = check_insn->Next();
560 for (; iterator.HasNext(); iterator.Next()) {
1107 MIR* next = current->next; local
[all...] |
| /art/compiler/utils/arm/ |
| constants_arm.h | 439 Instr* Next() { return this + kInstrSize; }
|
| /art/runtime/ |
| dex_instruction.h | 122 kContinue = 0x000002, // flow can continue to next statement
197 // Returns a pointer to the next instruction in the stream.
198 const Instruction* Next() const {
|
| /art/runtime/verifier/ |
| method_verifier.cc | 140 it.Next();
151 it.Next();
187 it.Next();
195 it.Next();
231 it.Next();
570 inst = inst->Next();
617 for (; iterator.HasNext(); iterator.Next()) {
664 inst = inst->Next();
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| db_test.cc | 225 // Switch to a fresh database with the next option configuration to
315 for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
367 iter->Next();
681 iter->Next();
690 iter->Next();
699 iter->Next();
704 iter->Next();
721 iter->Next();
723 iter->Next();
725 iter->Next();
[all...] |
| /external/chromium_org/third_party/sfntly/cpp/src/test/tinyxml/ |
| tinyxml.h | 363 // Return true if the next characters in the stream are any of the endTag sequences.
559 the next one. If the previous child is null, it returns the
631 const TiXmlNode* NextSibling() const { return next; }
632 TiXmlNode* NextSibling() { return next; }
764 TiXmlNode* next; member in class:TiXmlNode
788 prev = next = 0;
798 prev = next = 0;
808 prev = next = 0;
848 /// Get the next sibling attribute in the DOM. Returns null at end.
849 const TiXmlAttribute* Next() const
887 TiXmlAttribute* next; member in class:TiXmlAttribute
[all...] |
| /external/chromium_org/v8/src/ |
| spaces.cc | 80 // We have hit the end of the page and should advance to the next block of
232 // This block is used up, get the next one.
971 heap()->isolate()->memory_allocator()->Free(iterator.next());
1001 Address next = cur + obj->Size(); local
2030 FreeListNode* FreeListNode::next() { function in class:v8::FreeListNode
[all...] |
| /external/clang/include/clang/AST/ |
| DeclBase.h | 158 /// ObjCDeclQualifier - 'Qualifiers' written next to the return and
195 /// \brief The next declaration within the same lexical
714 /// \brief Returns the next redeclaration or itself if this is the only decl.
751 Decl *Next = Current->getNextRedeclarationImpl();
752 assert(Next && "Should return next redeclaration or itself, never null!");
753 Current = (Next != Starter) ? Next : nullptr;
[all...] |
| /external/clang/include/clang/Lex/ |
| Preprocessor.h | 133 unsigned CounterValue; // Next __COUNTER__ value.
237 /// \brief Whether the module import expects an identifier next. Otherwise,
420 /// "lex" next.
435 MacroInfoChain *Next;
451 DeserializedMacroInfoChain *Next;
774 /// \brief Lex the next token for this preprocessor.
843 /// LookAhead(0) returns the next token that would be returned by Lex(),
[all...] |
| /external/clang/lib/AST/ |
| ASTDumper.cpp | [all...] |
