| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| symbol-table.h | 354 void Next(void) {
|
| cache.h | 415 virtual void Next() { ++s_; }
446 void Next() { ++i_; }
|
| /external/webrtc/src/system_wrappers/source/ |
| list_unittest.cc | 59 ListItem* Next(ListItem* item) const {
60 return list_.Next(item);
304 list_item = list->Next(list_item);
331 lhs_item = lhs->Next(lhs_item);
332 rhs_item = rhs->Next(rhs_item);
366 // Reverse the reversed list using PushFront and Next.
368 item = list_to_reverse->Next(item)) {
420 item = interleave_list->Next(item);
466 item = interleave_list->Next(item);
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/test/ |
| encode_test_driver.h | 55 const vpx_codec_cx_pkt_t *Next() {
|
| resize_test.cc | 108 virtual void Next() {
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| wsdxmldom.h | 47 WSDXML_NODE *Next;
57 WSDXML_ATTRIBUTE *Next;
64 WSDXML_PREFIX_MAPPING *Next;
78 WSDXML_ELEMENT_LIST *Next;
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| thread_unittest.cc | 47 int Next(int prev) {
87 uint32 result = Next(prev);
111 int result = Next(msg->value);
|
| /external/chromium_org/third_party/mesa/src/src/egl/main/ |
| egldisplay.h | 17 * next paragraph) shall be included in all copies or substantial portions
79 _EGLResource *Next;
123 _EGLDisplay *Next;
|
| /external/chromium_org/third_party/protobuf/src/google/protobuf/io/ |
| tokenizer.cc | 48 // The next approach that any good software engineer should look at is to
231 // Advance to the next character.
256 if (!input_->Next(&data, &buffer_size_)) {
551 bool Tokenizer::Next() {
700 // connected to the next token.
767 // Oops, the next token is on the same line. If we recorded a comment
770 return Next();
781 // The next token is on the same line. There are no comments.
782 return Next();
800 // blank line the next time around the loop
[all...] |
| /external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/core/ |
| name_table.cc | 261 CALLER_ATTACH NameTable::NameEntry* NameTable::NameEntryIterator::Next() {
420 name_entry.Attach(name_iter->Next());
532 result = name_entry_iter->Next();
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
78 AllocList *next[kMaxLevel]; // actually has levels elements. member in struct:low_level_alloc_internal::AllocList
121 // level<kMaxLevel and next[level-1] will fit in the node.
127 int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *);
143 for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
160 e->next[i] = prev[i]->next[i];
161 prev[i]->next[i] = e;
172 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++)
363 AllocList *next = prev->next[i]; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
78 AllocList *next[kMaxLevel]; // actually has levels elements. member in struct:low_level_alloc_internal::AllocList
121 // level<kMaxLevel and next[level-1] will fit in the node.
127 int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *);
143 for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
160 e->next[i] = prev[i]->next[i];
161 prev[i]->next[i] = e;
172 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++)
363 AllocList *next = prev->next[i]; local
[all...] |
| /external/chromium_org/third_party/webrtc/base/ |
| thread_unittest.cc | 30 int Next(int prev) {
70 uint32 result = Next(prev);
94 int result = Next(msg->value);
|
| /external/clang/lib/Format/ |
| ContinuationIndenter.cpp | 35 while (End->Next && !End->Next->CanBreakBefore) {
36 End = End->Next;
41 // Returns \c true if \c Tok is the "." or "->" of a call and starts the next
335 const FormatToken *Next = Previous.MatchingParen->getNextNonComment();
336 HasTrailingCall = Next && Next->isMemberAccess();
400 // Thus, we set LastSpace of the next higher NestingLevel, to which we move
499 if (Current.is(tok::identifier) && Current.Next &&
500 Current.Next->Type == TT_DictLiteral
[all...] |
| /external/clang/lib/Sema/ |
| JumpDiagnostics.cpp | 357 Stmt *Next;
359 Next = CS->getSubStmt();
361 Next = DS->getSubStmt();
363 Next = LS->getSubStmt();
368 SubStmt = Next;
|
| /external/clang/test/CXX/class.access/class.friend/ |
| p1.cpp | 130 X *Next;
131 X *getNext() { return Next; } // expected-note {{declared private here}}
|
| /external/llvm/include/llvm/IR/ |
| Constants.h | 530 /// Next - This forms a link list of ConstantDataSequential nodes that have
534 ConstantDataSequential *Next;
539 : Constant(ty, VT, nullptr, 0), DataElements(Data), Next(nullptr) {}
540 ~ConstantDataSequential() { delete Next; }
[all...] |
| /external/llvm/include/llvm/Support/ |
| OnDiskHashTable.h | 64 Item *Next;
69 : Key(Key), Data(Data), Next(nullptr), Hash(InfoObj.ComputeHash(Key)) {}
93 E->Next = B.Head;
104 Item *N = E->Next;
105 E->Next = nullptr;
163 for (Item *I = B.Head; I; I = I->Next) {
|
| /external/llvm/lib/CodeGen/ |
| ExecutionDepsFix.cpp | 62 // Pointer to the next DomainValue in a chain. When two DomainValues are
63 // merged, Victim.Next is set to point to Victor, so old DomainValue
65 DomainValue *Next;
101 // Clear this DomainValue and point to next which has all its data.
104 Next = nullptr;
217 assert(!dv->Next && "Chained DomainValue shouldn't have been recycled");
233 DomainValue *Next = DV->Next;
236 // Also release the next DomainValue in the chain.
237 DV = Next;
[all...] |
| ShadowStackGC.cpp | 102 IRBuilder<> *Next() {
286 // ShadowStackEntry *Next; // Caller's stack entry.
426 StackEntry,0,0,"gc_frame.next");
434 while (IRBuilder<> *AtExit = EE.Next()) {
438 "gc_frame.next");
|
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 532 if (!NextInst) // Next instruction deleted.
684 Instruction *Next = std::next(BasicBlock::iterator(Dependency));
691 // Inst's old Dependency is now deleted. Compute the next dependency,
696 Dep = MD->getPointerDependencyFrom(Loc, false, Next, BB);
765 if (std::next(I) != E)
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 498 DiffEntry *Next = Paths2.data();
515 Next[0] = Cur[0];
516 Next[0].Cost += RightCost;
517 Next[0].Path.push_back(DC_right);
522 Next[Index] = Cur[Index-1];
523 Next[Index].Cost += MatchCost;
524 Next[Index].Path.push_back(DC_match);
526 } else if (Next[Index-1].Cost <= Cur[Index].Cost) {
527 Next[Index] = Next[Index-1]
[all...] |
| /external/mesa3d/src/egl/main/ |
| egldisplay.h | 17 * next paragraph) shall be included in all copies or substantial portions
79 _EGLResource *Next;
123 _EGLDisplay *Next;
|
| /external/pdfium/fpdfsdk/src/ |
| fsdk_annothandler.cpp | 847 CPDFSDK_Annot*CPDFSDK_AnnotIterator::Next(const CPDFSDK_Annot* pCurrent)
860 CPDFSDK_Annot*CPDFSDK_AnnotIterator::Next(int& index )
|
| /external/sfntly/cpp/src/sfntly/table/core/ |
| name_table.cc | 261 CALLER_ATTACH NameTable::NameEntry* NameTable::NameEntryIterator::Next() {
420 name_entry.Attach(name_iter->Next());
532 result = name_entry_iter->Next();
|
