/hardware/intel/img/libdrm/libdrm/nouveau/ |
nouveau_grobj.c | 117 struct nouveau_subchannel *scc = &grobj->channel->subc[i]; local 119 if (scc->gr && scc->gr->bound == NOUVEAU_GROBJ_BOUND_EXPLICIT) 122 if (!subc || scc->sequence < subc->sequence) 123 subc = scc;
|
/frameworks/base/tools/aapt/tests/ |
CrunchCache_test.cpp | 94 CrunchCache scc(source2,dest2,sff); 96 scc.crunch(scu);
|
/art/runtime/gc/space/ |
space.cc | 91 SweepCallbackContext scc(swap_bitmaps, this); 98 reinterpret_cast<uintptr_t>(End()), GetSweepCallback(), reinterpret_cast<void*>(&scc)); 99 return scc.freed;
|
large_object_space.cc | 517 AllocSpace::SweepCallbackContext scc(swap_bitmaps, this); 520 reinterpret_cast<uintptr_t>(End()), SweepCallback, &scc); 521 return scc.freed;
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
rmepsilon.h | 226 vector<StateId> scc; local 227 SccVisitor<Arc> scc_visitor(&scc, 0, 0, &props); 229 vector<StateId> first(scc.size(), kNoStateId); 230 vector<StateId> next(scc.size(), kNoStateId); 231 for (StateId i = 0; i < (StateId)scc.size(); i++) { 232 if (first[scc[i]] != kNoStateId) 233 next[i] = first[scc[i]]; 234 first[scc[i]] = i;
|
queue.h | 398 // SCC topological-order meta-queue discipline, templated on the StateId S 399 // and a queue Q, which is used inside each SCC. It visits the SCC's 401 // to use within an SCC. 408 // Constructor takes a vector specifying the SCC number per state 409 // and a vector giving the queue to use per SCC number. 410 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue) 411 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0), 457 if (front_ < back_) // Queue scc # back_ not empty unless back_==front_ 535 // Find the queue type to use per SCC [all...] |
connect.h | 28 // DFS SCC algorithm (see Aho, et al, "Design and Analysis of Computer 37 // scc[i]: strongly-connected component number for state i. 38 // SCC numbers will be in topological order for acyclic input. 44 SccVisitor(vector<StateId> *scc, vector<bool> *access, 46 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {} 132 if ((*dfnumber_)[s] == (*lowlink_)[s]) { // root of new SCC 165 // Numbers SCC's in topological order when acyclic. 178 vector<StateId> *scc_; // State's scc number 185 StateId nscc_; // SCC count 188 vector<StateId> *lowlink_; // lowlink[s] == dfnumber[s] => SCC roo [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
code.c | 636 typedef struct SCC { 638 } SCC; 640 static void SCC_init(SCC*, unsigned int); 641 static SCC *SCC_new(unsigned int); 642 static void SCC_destroy(SCC*); 643 static void SCC_delete(SCC*); 644 static void SCC_traverse(SCC*, State*); 647 SCC_init(SCC *s, unsigned int size) 652 static SCC * 654 SCC *s = malloc(sizeof(SCC)) 729 SCC scc; local [all...] |
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_platform_limits_posix.cc | 139 #include <linux/scc.h> [all...] |
/prebuilts/tools/common/m2/repository/biz/aQute/bndlib/1.50.0/ |
bndlib-1.50.0.jar | |
/prebuilts/tools/common/m2/repository/biz/aQute/bnd/1.50.0/ |
bnd-1.50.0.jar | |