| /external/openfst/src/include/fst/ |
| state-map.h | 56 // // Specifies state's final weight in result
57 // B::Weight Final(B::StateId s) const;
92 typedef typename A::Weight Weight;
132 typedef typename A::Weight Weight;
205 typedef typename B::Weight Weight;
245 Weight Final(StateId s) {
334 typedef typename B::Weight Weight
[all...] |
| synchronize.h | 66 typedef typename A::Weight Weight;
128 Weight Final(StateId s) {
131 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state);
132 if ((w != Weight::Zero()) && (e.istring)->empty() && (e.ostring)->empty())
135 SetFinal(s, Weight::Zero());
252 Car(e.ostring, arc.olabel), arc.weight, d));
257 PushArc(s, Arc(0 , 0, arc.weight, d));
261 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state)
[all...] |
| compose-filter.h | 86 // Filter state that is a weight (class).
191 // void FilterFinal(Weight *final1, Weight *final2) const;
218 typedef typename Arc::Weight Weight;
253 bool fin1 = internal::Final(fst1_, s1) != Weight::Zero();
268 void FilterFinal(Weight *, Weight *) const {}
303 typedef typename Arc::Weight Weight;
[all...] |
| const-fst.h | 54 typedef typename A::Weight Weight;
80 Weight Final(StateId s) const { return states_[s].final; }
113 Weight final; // Final weight
118 State() : final(Weight::Zero()), niepsilons(0), noepsilons(0) {}
|
| encode.h | 52 // encoding and decoding of label/weight tuples used for encoding
59 typedef typename A::Weight Weight;
61 // Encoded data consists of arc input/output labels and arc weight
64 Tuple(Label ilabel_, Label olabel_, Weight weight_)
65 : ilabel(ilabel_), olabel(olabel_), weight(weight_) {}
67 : ilabel(tuple.ilabel), olabel(tuple.olabel), weight(tuple.weight) {}
71 Weight weight; member in struct:fst::EncodeTable::Tuple
[all...] |
| factor-weight.h | 1 // factor-weight.h
68 // A factor iterator takes as argument a weight w and returns a
170 typedef typename A::Weight Weight;
177 Element(StateId s, Weight w) : state(s), weight(w) {}
180 Weight weight; // Residual weight member in struct:fst::FactorWeightFstImpl::Element
224 StateId start = FindState(Element(fst_->Start(), Weight::One()))
[all...] |
| label-reachable.h | 138 // position and accumulated arc weight of the matches can be
149 typedef typename A::Weight Weight;
312 reach_weight_ = Weight::Zero();
336 // If the 'arc.weight' wasn't computed by the call
339 // flags to compute the arc weight value.
343 reach_weight_ = accumulator_->Sum(reach_weight_, arcb.weight);
350 reach_weight_ = accumulator_->Sum(reach_weight_, arc.weight);
390 Weight ReachWeight() const { return reach_weight_; }
435 Weight final = fst_->Final(s)
[all...] |
| lookahead-filter.h | 209 typedef typename Arc::Weight Weight;
259 void FilterFinal(Weight *weight1, Weight *weight2) const {
321 // This filter adds weight-pushing to a lookahead composition filter
324 // lookahead filter. Weight-pushing in composition brings weights
338 typedef WeightFilterState<typename Arc::Weight> FilterState2;
343 typedef typename Arc::Weight Weight;
357 return FilterState(filter_.Start(), FilterState2(Weight::One()))
[all...] |
| minimize.h | 37 #include <fst/factor-weight.h>
51 // - final weight
53 // - (input label, output label, weight, destination_block)
58 typedef typename A::Weight Weight;
134 typedef typename A::Weight Weight;
179 // same final weight
316 typedef typename A::Weight Weight;
[all...] |
| replace-util.h | 58 typedef typename Arc::Weight Weight;
272 depfst_.SetFinal(i, Weight::One());
288 if (ifst->Final(s) != Weight::Zero())
301 depfst_.AddArc(i, Arc(arc.olabel, arc.olabel, Weight::One(), j));
|
| rmepsilon.h | 38 #include <fst/factor-weight.h>
53 typedef typename Arc::Weight Weight;
56 Weight weight_threshold; // Pruning weight threshold.
60 Weight w = Weight::Zero(),
75 typedef typename Arc::Weight Weight;
78 vector<Weight> *distance
[all...] |
| accumulator.h | 19 // Classes to accumulate arc weights. Useful for weight lookahead.
46 typedef typename A::Weight Weight;
56 Weight Sum(Weight w, Weight v) {
61 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
63 Weight sum = w;
66 sum = Plus(sum, aiter->Value().weight);
[all...] |
| compose.h | 119 typedef typename A::Weight Weight;
160 Weight Final(StateId s) {
162 Weight final = ComputeFinal(s);
196 virtual Weight ComputeFinal(StateId s) = 0;
210 typedef typename Arc::Weight Weight;
299 Weight::One(), sb);
334 Arc oarc(arc1.ilabel, arc2.olabel, Times(arc1.weight, arc2.weight),
[all...] |
| edit-fst.h | 72 typedef typename A::Weight Weight;
76 typedef typename unordered_map<StateId, Weight>::const_iterator
125 Weight Final(StateId s, const WrappedFstT *wrapped) const {
169 Weight SetFinal(StateId s, Weight w, const WrappedFstT *wrapped) {
170 Weight old_weight = Final(s, wrapped);
300 // copy the final weight
322 // those states. The states in this map are *only* those whose final weight
325 unordered_map<StateId, Weight> edited_final_weights_
[all...] |
| lookahead-matcher.h | 47 // typedef typename Arc::Weight Weight;
74 // // Gives an estimate of the combined weight of the paths P in the
76 // // A trivial implementation returns Weight::One(). Non-trivial
77 // // implementations are useful for weight-pushing in composition.
78 // Weight LookAheadWeight() const;
138 typedef typename A::Weight Weight;
141 : weight_(Weight::One()),
142 prefix_arc_(kNoLabel, kNoLabel, Weight::One(), kNoStateId) {
[all...] |
| matcher.h | 46 // typedef typename Arc::Weight Weight;
109 typedef typename A::Weight Weight;
134 // Arc(kNoLabel, 0, Weight::One(), current_state) as well as any
136 // Arc(0, kNoLabel, Weight::One(), current_state) is instead matched.
144 typedef typename Arc::Weight Weight;
157 loop_(kNoLabel, 0, Weight::One(), kNoStateId),
401 typedef typename Arc::Weight Weight
[all...] |
| /external/openfst/src/test/ |
| fst_test.h | 45 typedef typename Arc::Weight Weight;
83 CHECK_EQ(arc.weight, NthWeight(na));
309 // (3) weight = NthWeight(i)
328 Weight NthWeight(int n) const {
329 Weight w = Weight::Zero();
331 w = Plus(w, Weight::One());
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 48 // | | (Weight = 124)
52 // | (Weight = 4)
61 /// \brief Unreachable-terminating branch taken weight.
63 /// This is the weight for a branch being taken to a block that terminates
67 /// \brief Unreachable-terminating branch not-taken weight.
69 /// This is the weight for a branch not being taken toward a block that
71 /// taken. Set the weight to an absurdly high value so that nested loops don't
75 /// \brief Weight for a branch taken going into a cold block.
77 /// This is the weight for a branch taken toward a block marked
83 /// \brief Weight for a branch not-taken into a cold block
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegisterPressure.cpp | 28 unsigned Weight = PSetI.getWeight();
30 CurrSetPressure[*PSetI] += Weight;
36 unsigned Weight = PSetI.getWeight();
38 assert(CurrSetPressure[*PSetI] >= Weight && "register pressure underflow");
39 CurrSetPressure[*PSetI] -= Weight;
85 unsigned Weight = PSetI.getWeight();
87 CurrSetPressure[*PSetI] += Weight;
389 int Weight = IsDec ? -PSetI.getWeight() : PSetI.getWeight();
407 I->setUnitInc(I->getUnitInc() + Weight);
[all...] |
| MachineBasicBlock.cpp | 479 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) {
481 // If we see non-zero value for the first time it means we actually use Weight
483 if (weight != 0 && Weights.empty())
486 if (weight != 0 || !Weights.empty())
487 Weights.push_back(weight);
498 // If Weight list is empty it means we don't use it (disabled optimization).
511 // If Weight list is empty it means we don't use it (disabled optimization).
552 // Update its weight instead of adding a duplicate edge.
577 uint32_t Weight = 0;
579 // If Weight list is empty it means we don't use it (disabled optimization)
[all...] |
| TailDuplication.cpp | 734 uint32_t Weight = MBPI->getEdgeWeight(PredBB, TailBB);
739 PredBB->addSuccessor(NewTarget, Weight);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SampleProfile.cpp | 15 // This pass generates branch weight annotations on the IR:
19 // The weight of each edge is the weight of the target block for
20 // that edge. The weight of a block B is computed as the maximum
127 /// The weight of a basic block is defined to be the maximum
179 /// \brief Print the weight of edge \p E on stream \p OS.
184 OS << "weight[" << E.first->getName() << "->" << E.second->getName()
199 /// \brief Print the weight of block \p BB on stream \p OS.
204 OS << "weight[" << BB->getName() << "]: " << BlockWeights[BB] << "\n";
207 /// \brief Get the weight for an instruction
[all...] |
| /external/openfst/src/include/fst/script/ |
| info-impl.h | 49 typedef typename A::Weight Weight;
95 if (fst.Final(s) != Weight::Zero())
|
| /external/skia/src/sfnt/ |
| SkPanose.h | 54 struct Weight {
234 struct Weight {
382 struct Weight {
543 struct Weight {
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| compose.h | 48 typedef typename Arc::Weight Weight;
62 loop_.weight = Weight::One();
284 typedef typename Arc::Weight Weight;
377 void FilterFinal(Weight *w1, Weight *w2) const {
379 *w1 = Weight::Zero();
|
