/external/openfst/src/include/fst/ |
H A D | sparse-tuple-weight.h | 91 for (SparseTupleWeightIterator<W, K> it(w); !it.Done(); it.Next()) { 126 for (SparseTupleWeightIterator<W, K> it(w); !it.Done(); it.Next()) { 134 for (SparseTupleWeightIterator<W, K> it(*this); !it.Done(); it.Next()) { 144 for (SparseTupleWeightIterator<W, K> it(*this); !it.Done(); it.Next()) { 153 for (SparseTupleWeightIterator<W, K> it(*this); !it.Done(); it.Next()) { 161 for (SparseTupleWeightIterator<W, K> it(*this); !it.Done(); it.Next()) { 245 void Next() { function in class:fst::SparseTupleWeightIterator 284 if (!w1_it.Done()) w1_it.Next(); 285 if (!w2_it.Done()) w2_it.Next(); 288 w1_it.Next(); [all...] |
H A D | state-map.h | 68 // void Next(); 110 for (; !mapper->Done(); mapper->Next()) 156 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next()) 161 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next()) { 164 for (; !mapper->Done(); mapper->Next()) 291 for (mapper_->SetState(s); !mapper_->Done(); mapper_->Next()) 428 void Next() { aiter_->Next(); } function in class:fst::IdentityStateMapper 463 for (ArcIterator<Fst<A> > aiter(fst_, s); !aiter.Done(); aiter.Next()) 484 void Next() { function in class:fst::ArcSumMapper 560 void Next() { ++i_; } function in class:fst::ArcUniqueMapper [all...] |
H A D | string-weight.h | 178 void Next() { function in class:fst::StringWeightIterator 210 void Next() { function in class:fst::StringWeightReverseIterator 250 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next()) { 269 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next()) 277 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next()) 289 // for (StringWeightIterator<L, S> iter(w); !iter.Done(); iter.Next()) 304 for (; !iter1.Done() ; iter1.Next(), iter2.Next()) 334 for (size_t i = 0; !iter.Done(); ++i, iter.Next()) { 406 iter1.Next(), iter [all...] |
H A D | symbol-table.h | 457 void Next(void) { function in class:fst::SymbolTableIterator
|
H A D | vector-fst.h | 304 siter.Next()) { 311 aiter.Next()) { 519 void Next() { ++s_; } function in class:fst::StateIterator 551 for (StateIterator<F> siter(fst); !siter.Done(); siter.Next()) { 556 for (ArcIterator<F> aiter(fst, s); !aiter.Done(); aiter.Next()) { 598 void Next() { ++i_; } function in class:fst::ArcIterator 639 void Next() { ++i_; } function in class:fst::MutableArcIterator 704 virtual void Next_() { Next(); }
|
/external/mesa3d/src/egl/main/ |
H A D | egldisplay.h | 79 _EGLResource *Next; member in struct:_egl_resource 123 _EGLDisplay *Next; member in struct:_egl_display
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_list.h | 36 struct rc_list * Next; member in struct:rc_list
|
H A D | radeon_pair_schedule.c | 47 /** Next instruction in the linked list of ready instructions. */ 90 struct reg_value_reader *Next; member in struct:reg_value_reader 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 */ member in struct:reg_value 129 struct remap_reg * Next; member in struct:remap_reg 289 for (r = v->Readers; r; r = r->Next) { 376 if (v->Next) { 377 decrease_dependencies(s, v->Next->Writer); 392 for(struct reg_value_reader * r = v->Readers; r; r = r->Next) { 402 if (v->Next) [all...] |
H A D | radeon_program.h | 135 struct rc_instruction * Next; member in struct:rc_instruction 153 * Instructions.Next points to the first instruction,
|
/external/mesa3d/src/gallium/state_trackers/glx/xlib/ |
H A D | xm_api.h | 349 struct xmesa_buffer *Next; /* Linked list pointer: */ member in struct:xmesa_buffer
|
/external/mesa3d/src/mesa/drivers/x11/ |
H A D | glxapi.c | 50 struct display_dispatch *Next; member in struct:display_dispatch 106 d = d->Next; 123 d->Next = DispatchList;
|
H A D | xmesaP.h | 242 struct xmesa_buffer *Next; /* Linked list pointer: */ member in struct:xmesa_buffer
|
/external/mesa3d/src/mesa/main/ |
H A D | hash.c | 55 struct HashEntry *Next; /**< pointer to next entry */ member in struct:HashEntry 106 struct HashEntry *next = entry->Next; 141 entry = entry->Next; 193 for (entry = table->Table[pos]; entry; entry = entry->Next) { 212 entry->Next = table->Table[pos]; 255 prev->Next = entry->Next; 258 table->Table[pos] = entry->Next; 265 entry = entry->Next; 296 next = entry->Next; [all...] |
/external/llvm/utils/TableGen/ |
H A D | DAGISelMatcher.h | 43 std::unique_ptr<Matcher> Next; member in class:llvm::Matcher 97 Matcher *getNext() { return Next.get(); } 98 const Matcher *getNext() const { return Next.get(); } 99 void setNext(Matcher *C) { Next.reset(C); } 100 Matcher *takeNext() { return Next.release(); } 102 std::unique_ptr<Matcher> &getNextPtr() { return Next; }
|
/external/lzma/C/ |
H A D | Ppmd7.c | 48 CPpmd7_Node_Ref Next; /* must be at offset >= 4 */
member in struct:CPpmd7_Node_ 166 node->Next = n;
174 NODE(head)->Next = n;
190 NODE(node2->Prev)->Next = node2->Next;
191 NODE(node2->Next)->Prev = node2->Prev;
194 n = node->Next;
198 for (n = NODE(head)->Next; n != head;)
202 CPpmd7_Node_Ref next = node->Next;
|
/external/lzma/CPP/Windows/ |
H A D | FileFind.cpp | 292 bool CEnumerator::Next(CFileInfo &fi)
function in class:NWindows::NFile::NFind::CEnumerator 303 bool CEnumerator::Next(CFileInfo &fi, bool &found)
function in class:NWindows::NFile::NFind::CEnumerator 305 if (Next(fi))
323 bool CEnumeratorW::Next(CFileInfoW &fi)
function in class:NWindows::NFile::NFind::CEnumeratorW 334 bool CEnumeratorW::Next(CFileInfoW &fi, bool &found)
function in class:NWindows::NFile::NFind::CEnumeratorW 336 if (Next(fi))
|
/external/mdnsresponder/mDNSPosix/ |
H A D | mDNSPosix.c | 84 struct PosixEventSource *Next; member in struct:PosixEventSource 1527 for (iSource=(PosixEventSource*)gEventSources.Head; iSource; iSource = iSource->Next) 1538 InitLinkedList(&gEventSources, offsetof(PosixEventSource, Next)); 1566 for (iSource=(PosixEventSource*)gEventSources.Head; iSource; iSource = iSource->Next) 1639 for (iSource=(PosixEventSource*)gEventSources.Head; iSource; iSource = iSource->Next)
|
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 498 DiffEntry *Next = Paths2.data(); local 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[Inde [all...] |
/external/llvm/tools/llvm-stress/ |
H A D | llvm-stress.cpp | 676 BasicBlock *Next = Curr->splitBasicBlock(Loc, "CF"); local 679 BranchInst::Create(Curr, Next, Instr, Curr->getTerminator());
|
/external/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 10 // stores that can be put together into vector-stores. Next, it attempts to 2704 BinaryOperator *Next = dyn_cast<BinaryOperator>(NextV); local 2705 if (Next) 2706 Stack.push_back(std::make_pair(Next, 0));
|
/external/llvm/bindings/ocaml/llvm/ |
H A D | llvm_ocaml.c | 97 cty Next = LLVMGetNext##cname(Kid); \ 98 if (Next) \ 99 return alloc_variant(1, Next); \ 932 LLVMUseRef Next; local 933 if ((Next = LLVMGetNextUse(U))) { 935 Field(Option, 0) = (value) Next;
|
/external/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 114 NodeType *Next = *It++; local 116 if (Next && !this->Visited.count(Next)) { 118 this->Visited.insert(Next); 119 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0), 120 GT::child_begin(Next)));
|
H A D | EquivalenceClasses.h | 60 /// value itself, which provides the ordering that the set queries. Next, it 70 mutable const ECValue *Leader, *Next; member in class:llvm::EquivalenceClasses::ECValue 72 // ECValue ctor - Start out with EndOfList pointing to this node, Next is 75 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {} 90 Next = (const ECValue*)((intptr_t)NewNext | (intptr_t)isLeader()); 93 ECValue(const ECValue &RHS) : Leader(this), Next((ECValue*)(intptr_t)1), 101 bool isLeader() const { return (intptr_t)Next & 1; } 105 return (ECValue*)((intptr_t)Next & ~(intptr_t)1); 232 L2LV.Next = L2LV.getNext();
|
H A D | SparseMultiSet.h | 85 /// circular in Prev indices, and INVALID-terminated in Next indices. This 94 unsigned Next; member in struct:llvm::SparseMultiSet::SMSNode 96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } 100 return Next == INVALID; 157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { argument 159 Dense.push_back(SMSNode(V, Prev, Next)); 165 unsigned NextFree = Dense[Idx].Next; 168 Dense[Idx] = SMSNode(V, Prev, Next); 177 Dense[Idx].Next = FreelistIdx; 241 unsigned Next() cons function in class:llvm::SparseMultiSet::iterator_base [all...] |
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 503 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next); local 505 this->setNext(Prev, Next); 507 L2.Head = Next; 508 this->setPrev(Next, Prev); 609 for (iterator I = begin(), E = end(), Next = begin(); ++Next ! [all...] |