| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| factor-weight.h | 58 // void Next();
70 void Next() {}
85 void Next() { done_ = true; }
91 for (iter.Next(); !iter.Done(); iter.Next())
113 void Next() { done_ = true; }
258 ait.Next()) {
266 for (; !fit.Done(); fit.Next()) {
282 fit.Next()) {
|
| /external/tinyxml/ |
| tinyxml.cpp | 151 next = 0;
163 node = node->next;
184 node = node->next;
198 node->next = 0;
201 lastChild->next = node;
230 node->next = beforeThis;
234 beforeThis->prev->next = node;
257 node->next = afterThis->next;
258 if ( afterThis->next )
[all...] |
| /hardware/ti/omap3/dspbridge/inc/ |
| qosregistry.h | 121 struct QOSDATA *Next;
|
| /hardware/ti/omap3/dspbridge/libbridge/inc/ |
| qosregistry.h | 115 struct QOSDATA *Next;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| chanmgr.h | 154 virtual HRESULT WINAPI Next(ULONG celt,CHANNELENUMINFO *rgChanInf,ULONG *pceltFetched) = 0;
165 HRESULT (WINAPI *Next)(IEnumChannels *This,ULONG celt,CHANNELENUMINFO *rgChanInf,ULONG *pceltFetched);
178 #define IEnumChannels_Next(This,celt,rgChanInf,pceltFetched) (This)->lpVtbl->Next(This,celt,rgChanInf,pceltFetched)
|
| tlogstg.h | 99 virtual HRESULT WINAPI Next(ULONG cElt,ITravelLogEntry **rgElt,ULONG *pcEltFetched) = 0;
110 HRESULT (WINAPI *Next)(IEnumTravelLogEntry *This,ULONG cElt,ITravelLogEntry **rgElt,ULONG *pcEltFetched);
123 #define IEnumTravelLogEntry_Next(This,cElt,rgElt,pcEltFetched) (This)->lpVtbl->Next(This,cElt,rgElt,pcEltFetched)
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| afilter.h | 52 struct _ARC_BUFFER_LIST *Next;
74 struct _ARC_PACKET *Next;
|
| /external/chromium_org/third_party/libjingle/source/talk/xmpp/ |
| chatroommoduleimpl.cc | 135 virtual bool Next();
720 XmppChatroomMemberEnumeratorImpl::Next() {
|
| /external/chromium_org/third_party/libphonenumber/src/phonenumbers/ |
| phonenumbermatcher.cc | 623 bool PhoneNumberMatcher::Next(PhoneNumberMatch* match) {
625 // Check the state and find the next match as a side-effect if necessary.
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| sysinfo.cc | 334 // Move the next line to the beginning of the buffer
658 bool ProcMapsIterator::Next(uint64 *start, uint64 *end, char **flags,
675 // Advance to the start of the next line
[all...] |
| /external/chromium_org/v8/src/ |
| d8.h | 79 void Next() { entry_ = map_->Next(entry_); }
|
| dateparser.h | 55 Next();
60 // Advance to the next character of the string.
61 void Next() {
75 Next();
85 for (len = 0; IsAsciiAlphaOrAbove(); Next(), len++) {
95 Next();
103 Next();
115 Next();
239 DateToken Next() {
370 // Tries to parse an ES5 Date Time String. Returns the next toke
[all...] |
| scanner.cc | 208 Token::Value Scanner::Next() {
342 // Remember the position of the next token
580 // the "next" token. The "current" token will be invalid.
[all...] |
| /external/clang/lib/AST/ |
| DeclPrinter.cpp | 241 // The next bits of code handles stuff like "struct {int x;} a,b"; we're
301 DeclContext::decl_iterator Next = D;
302 ++Next;
303 if (Next != DEnd)
[all...] |
| /external/clang/lib/Format/ |
| TokenAnnotator.cpp | 59 next();
149 if (LookForDecls && CurrentToken->Next) {
153 FormatToken *Next = CurrentToken->Next;
156 CurrentToken->is(tok::identifier) && Next->isNot(tok::equal)) {
170 if (MightBeFunctionType && CurrentToken->Next &&
171 (CurrentToken->Next->is(tok::l_paren) ||
172 (CurrentToken->Next->is(tok::l_square) &&
196 next();
203 if (CurrentToken->is(tok::comma) && CurrentToken->Next &
636 void next() { function in class:clang::format::__anon21711::AnnotatingParser
1149 void next() { function in class:clang::format::__anon21711::ExpressionParser
[all...] |
| /external/clang/lib/Frontend/ |
| VerifyDiagnosticConsumer.cpp | 211 // Return true if string literal is next.
212 bool Next(StringRef S) {
220 // Return true if number is next.
221 // Output N only if number is next.
222 bool Next(unsigned &N) {
280 // Advance 1-past previous next/search.
281 // Behavior is undefined if previous next/search failed.
300 const char *C; // position of next char in content
304 const char *PEnd; // previous next/search subject end (1-past)
326 // Next token:
[all...] |
| /external/clang/lib/Parse/ |
| ParseTemplate.cpp | 411 Token Next = NextToken();
414 if (Next.getKind() == tok::identifier)
415 Next = GetLookAheadToken(2);
417 switch (Next.getKind()) {
552 const Token &Next = Tok.is(tok::kw_struct) ? NextToken() : Tok;
561 } else if (Next.is(tok::identifier) || Next.is(tok::comma) ||
562 Next.is(tok::greater) || Next.is(tok::greatergreater) ||
563 Next.is(tok::ellipsis))
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 380 /// is the SCEV to be divided in the next step of the recursion. The
425 /// b. Divide Quotient: {{{0,+,2}_i, +, n}_j, +, n}_k by next outer size n
428 /// The Remainder is the subscript of the next array dimension: [2i].
497 /// Next - The next pointer in the linked list of all
499 SCEVUnknown *Next;
502 ScalarEvolution *se, SCEVUnknown *next) :
503 SCEV(ID, scUnknown), CallbackVH(V), SE(se), Next(next) {}
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineOperand.h | 166 MachineOperand *Next;
597 Op.Contents.Reg.Next = nullptr;
|
| SelectionDAG.h | 215 DAGUpdateListener *const Next;
219 : Next(D.UpdateListeners), DAG(D) {
226 DAG.UpdateListeners = Next;
[all...] |
| /external/llvm/include/llvm/Support/ |
| TargetRegistry.h | 154 /// Next - The next registered target in the linked list, maintained by the
156 Target *Next;
250 // getNext - Return the next registered target.
251 const Target *getNext() const { return Next; }
[all...] |
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JITMemoryManager.cpp | 104 /// keeps track of the current block and has a pointer to the next free block.
108 FreeRangeHeader *Next;
124 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!");
125 Next->Prev = Prev;
126 return Prev->Next = Next;
130 Next = FreeList;
132 Prev->Next = this;
133 Next->Prev = this
[all...] |
| /external/llvm/lib/MC/ |
| MachObjectWriter.cpp | 116 unsigned Next = SD->getLayoutOrder() + 1;
117 if (Next >= Layout.getSectionOrder().size())
120 const MCSectionData &NextSD = *Layout.getSectionOrder()[Next];
[all...] |
| /external/llvm/tools/llvm-stress/ |
| llvm-stress.cpp | 676 BasicBlock *Next = Curr->splitBasicBlock(Loc, "CF");
679 BranchInst::Create(Curr, Next, Instr, Curr->getTerminator());
|
| /external/lzma/C/ |
| Ppmd7.c | 48 CPpmd7_Node_Ref Next; /* must be at offset >= 4 */
161 CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i];
local
163 while (next != 0)
165 CPpmd7_Node *node = NODE(next);
166 node->Next = n;
167 n = NODE(n)->Prev = next;
168 next = *(const CPpmd7_Node_Ref *)node;
174 NODE(head)->Next = n;
190 NODE(node2->Prev)->Next = node2->Next;
202 CPpmd7_Node_Ref next = node->Next; local
[all...] |
