Home
last modified time | relevance | path

Searched refs:scc (Results 1 – 10 of 10) sorted by relevance

/external/srec/tools/thirdparty/OpenFst/fst/lib/
Drmepsilon.h228 vector<StateId> scc; in RmEpsilon() local
229 SccVisitor<Arc> scc_visitor(&scc, 0, 0, &props); in RmEpsilon()
231 vector<StateId> first(scc.size(), kNoStateId); in RmEpsilon()
232 vector<StateId> next(scc.size(), kNoStateId); in RmEpsilon()
233 for (StateId i = 0; i < (StateId)scc.size(); i++) { in RmEpsilon()
234 if (first[scc[i]] != kNoStateId) in RmEpsilon()
235 next[i] = first[scc[i]]; in RmEpsilon()
236 first[scc[i]] = i; in RmEpsilon()
Dqueue.h410 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue) in SccQueue() argument
411 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0), in SccQueue()
617 const vector<StateId> &scc,
647 const vector<StateId> &scc, in SccQueueType() argument
668 if (scc[state] == scc[arc.nextstate]) { in SccQueueType()
669 QueueType &type = (*queue_type)[scc[state]]; in SccQueueType()
Dconnect.h44 SccVisitor(vector<StateId> *scc, vector<bool> *access, in SccVisitor() argument
46 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {} in SccVisitor()
/external/openfst/src/include/fst/script/
Dinfo-impl.h135 vector<StateId> scc; variable
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/
Drmepsilon.h277 vector<StateId> scc; in RmEpsilon() local
278 SccVisitor<Arc> scc_visitor(&scc, 0, 0, &props); in RmEpsilon()
280 vector<StateId> first(scc.size(), kNoStateId); in RmEpsilon()
281 vector<StateId> next(scc.size(), kNoStateId); in RmEpsilon()
282 for (StateId i = 0; i < scc.size(); i++) { in RmEpsilon()
283 if (first[scc[i]] != kNoStateId) in RmEpsilon()
284 next[i] = first[scc[i]]; in RmEpsilon()
285 first[scc[i]] = i; in RmEpsilon()
Dqueue.h446 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue) in SccQueue() argument
447 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0), in SccQueue()
653 const vector<StateId> &scc,
688 const vector<StateId> &scc, in SccQueueType() argument
709 if (scc[state] == scc[arc.nextstate]) { in SccQueueType()
710 QueueType &type = (*queue_type)[scc[state]]; in SccQueueType()
Dconnect.h134 SccVisitor(vector<StateId> *scc, vector<bool> *access, in SccVisitor() argument
136 : scc_(scc), access_(access), coaccess_(coaccess), props_(props) {} in SccVisitor()
/external/llvm/test/Transforms/Inline/
Dgvn-inline-iteration.ll1 ; RUN: opt -basicaa -inline -gvn %s -S -max-cg-scc-iterations=1 | FileCheck %s
Dcrash2.ll1 ; RUN: opt -inline -scalarrepl -max-cg-scc-iterations=1 %s -disable-output
/external/webkit/PerformanceTests/Parser/resources/
Dfinal-url-en13133 http://ol.scc.spokane.edu/jstrever/models/essays/c&c/c&c&&002.htm
26126 http://www.attorneygeneral.jus.gov.on.ca/english/courts/scc/sccbook-ch6.asp
30116 http://www.canlaw.com/scc/smallclaims.htm
30117 http://www.canlii.org/ca/cas/scc/1992/1992scc78.html
30118 http://www.canlii.org/ca/cas/scc/2004/2004scc23.html
33840 http://www.componentsoftware.com/csrcs/Integration/scc.htm
35082 http://www.csc-scc.gc.ca/text/pblct/longterm/long-08_e.shtml
35083 http://www.csc-scc.gc.ca/text/pblct/methadone/a_e.shtml
35084 http://www.csc-scc.gc.ca/text/prgrm/corcan/eep_final1_e.shtml
35085 http://www.csc-scc.gc.ca/text/rsrch/reports/r29/r29e_e.shtml
[all …]