HomeSort by relevance Sort by last modified time
    Searched refs:scc (Results 1 - 8 of 8) sorted by null

  /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/openfst/src/include/fst/script/
info-impl.h 135 vector<StateId> scc; local
138 SccVisitor<Arc> scc_visitor(&scc, &access, &coaccess, &props);
152 for (StateId s = 0; s < scc.size(); ++s) {
159 if (scc[s] >= nscc_)
160 nscc_ = scc[s] + 1;
  /external/openfst/src/include/fst/
rmepsilon.h 276 vector<StateId> scc; local
277 SccVisitor<Arc> scc_visitor(&scc, 0, 0, &props);
279 vector<StateId> first(scc.size(), kNoStateId);
280 vector<StateId> next(scc.size(), kNoStateId);
281 for (StateId i = 0; i < scc.size(); i++) {
282 if (first[scc[i]] != kNoStateId)
283 next[i] = first[scc[i]];
284 first[scc[i]] = i;
queue.h 435 // SCC topological-order meta-queue discipline, templated on the StateId S
436 // and a queue Q, which is used inside each SCC. It visits the SCC's
438 // to use within an SCC.
445 // Constructor takes a vector specifying the SCC number per state
446 // and a vector giving the queue to use per SCC number.
447 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue)
448 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
490 if (front_ < back_) // Queue scc # back_ not empty unless back_==front_
573 // Find the queue type to use per SCC
    [all...]
connect.h 118 // DFS SCC algorithm (see Aho, et al, "Design and Analysis of Computer
127 // scc[i]: strongly-connected component number for state i.
128 // SCC numbers will be in topological order for acyclic input.
134 SccVisitor(vector<StateId> *scc, vector<bool> *access,
136 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {}
174 // Numbers SCC's in topological order when acyclic.
187 vector<StateId> *scc_; // State's scc number
194 StateId nscc_; // SCC count
197 vector<StateId> *lowlink_; // lowlink[s] == dfnumber[s] => SCC root
198 vector<bool> *onstack_; // is a state on the SCC stac
    [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...]

Completed in 687 milliseconds