/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
H A D | arc.h | 37 struct arc { struct 55 void arc_init(struct arc *arc, 62 void arc_add_to_polygon(struct arc *arc, 67 void arc_to_path(struct arc *arc, 71 void arc_stroke_cb(struct arc *arc, 75 void arc_stroker_emit(struct arc *ar [all...] |
H A D | arc.c | 27 #include "arc.h" 165 try_to_fix_radii(struct arc *arc) argument 171 rot = DEGREES_TO_RADIANS(arc->theta); 178 x0p = (arc->x1*COS + arc->y1*SIN)/arc->a; 179 y0p = (-arc->x1*SIN + arc->y1*COS)/arc 226 find_angles(struct arc *arc) argument 320 check_endpoints(struct arc *arc) argument 346 arc_init(struct arc *arc, VGPathSegment type, VGfloat x1, VGfloat y1, VGfloat x2, VGfloat y2, VGfloat rh, VGfloat rv, VGfloat rot) argument 419 estimate_error(struct arc *arc, double etaA, double etaB) argument 525 num_beziers_needed(struct arc *arc) argument 553 arc_to_beziers(struct arc *arc, struct arc_cb cb, struct matrix *matrix) argument 655 arc_add_to_polygon(struct arc *arc, struct polygon *poly, struct matrix *matrix) argument 669 arc_stroke_cb(struct arc *arc, struct stroker *stroke, struct matrix *matrix) argument 683 arc_stroker_emit(struct arc *arc, struct stroker *stroker, struct matrix *matrix) argument 697 arc_to_path(struct arc *arc, struct path *path, struct matrix *matrix) argument [all...] |
/external/mesa3d/src/gallium/state_trackers/vega/ |
H A D | arc.h | 37 struct arc { struct 55 void arc_init(struct arc *arc, 62 void arc_add_to_polygon(struct arc *arc, 67 void arc_to_path(struct arc *arc, 71 void arc_stroke_cb(struct arc *arc, 75 void arc_stroker_emit(struct arc *ar [all...] |
H A D | arc.c | 27 #include "arc.h" 165 try_to_fix_radii(struct arc *arc) argument 171 rot = DEGREES_TO_RADIANS(arc->theta); 178 x0p = (arc->x1*COS + arc->y1*SIN)/arc->a; 179 y0p = (-arc->x1*SIN + arc->y1*COS)/arc 226 find_angles(struct arc *arc) argument 320 check_endpoints(struct arc *arc) argument 346 arc_init(struct arc *arc, VGPathSegment type, VGfloat x1, VGfloat y1, VGfloat x2, VGfloat y2, VGfloat rh, VGfloat rv, VGfloat rot) argument 419 estimate_error(struct arc *arc, double etaA, double etaB) argument 525 num_beziers_needed(struct arc *arc) argument 553 arc_to_beziers(struct arc *arc, struct arc_cb cb, struct matrix *matrix) argument 655 arc_add_to_polygon(struct arc *arc, struct polygon *poly, struct matrix *matrix) argument 669 arc_stroke_cb(struct arc *arc, struct stroker *stroke, struct matrix *matrix) argument 683 arc_stroker_emit(struct arc *arc, struct stroker *stroker, struct matrix *matrix) argument 697 arc_to_path(struct arc *arc, struct path *path, struct matrix *matrix) argument [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | arcfilter.h | 28 bool operator()(const A &arc) const { return true; } 36 bool operator()(const A &arc) const { 37 return arc.ilabel == 0 && arc.olabel == 0;
|
H A D | reweight.h | 34 // An arc of weight w, with an origin state of potential p and 65 Arc arc = ait.Value(); local 67 (potential[arc.nextstate] == Weight::Zero())) 71 arc.weight = Divide(Times(arc.weight, potential[arc.nextstate]), 74 && (potential[arc.nextstate] != Weight::Zero())) 75 arc.weight = Divide(Times(potential[state], arc.weight), 76 potential[arc 94 Arc arc = ait.Value(); local [all...] |
H A D | verify.h | 61 const Arc &arc =aiter.Value(); local 62 if (arc.ilabel < 0) { 63 LOG(ERROR) << "Verify: Fst input label ID of arc at position " 66 } else if (isyms && isyms->Find(arc.ilabel) == "") { 67 LOG(ERROR) << "Verify: Fst input label ID " << arc.ilabel 68 << " of arc at position " << na << " of state " << s 72 } else if (arc.olabel < 0) { 73 LOG(ERROR) << "Verify: Fst output label ID of arc at position " 76 } else if (osyms && osyms->Find(arc.olabel) == "") { 77 LOG(ERROR) << "Verify: Fst output label ID " << arc [all...] |
H A D | rmfinalepsilon.h | 50 const A& arc = aiter.Value(); local 51 if (coaccess[arc.nextstate]) { 70 const A& arc = aiter.Value(); local 72 if (finals.find(arc.nextstate) != finals.end()) { 74 if (arc.ilabel == 0 && arc.olabel == 0) { 75 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); 77 arcs.push_back(arc); 80 arcs.push_back(arc); [all...] |
H A D | prune.h | 100 Arc arc = it.Value(); local 101 if (!opts.filter(arc)) continue; 102 Weight weight = Times(Times((*idistance)[state], arc.weight), 103 (*fdistance)[arc.nextstate]); 105 arc.nextstate = dead[0]; 106 it.SetValue(arc); 199 Arc arc = ait.Value(); local 201 if (!opts.filter(arc)) continue; 203 while (idistance->size() <= arc.nextstate) 205 while (fdistance->size() <= arc [all...] |
H A D | test-properties.h | 134 const Arc &arc =aiter.Value(); local 136 if (ilabels && ilabels->find(arc.ilabel) != ilabels->end()) { 140 if (olabels && olabels->find(arc.olabel) != olabels->end()) { 144 if (arc.ilabel != arc.olabel) { 148 if (arc.ilabel == 0 && arc.olabel == 0) { 152 if (arc.ilabel == 0) { 156 if (arc.olabel == 0) { 160 if (prev_arc.ilabel != kNoLabel && arc [all...] |
H A D | shortest-distance.h | 144 const Arc &arc = aiter.Value(); local 145 if (!arc_filter_(arc) || arc.weight == Weight::Zero()) 147 while ((StateId)distance_->size() <= arc.nextstate) { 153 while ((StateId)sources_.size() <= arc.nextstate) 155 if (sources_[arc.nextstate] != source) { 156 (*distance_)[arc.nextstate] = Weight::Zero(); 157 rdistance_[arc.nextstate] = Weight::Zero(); 158 enqueued_[arc.nextstate] = false; 159 sources_[arc [all...] |
/external/srec/tools/grxmlcompile/ |
H A D | sub_min.cpp | 28 #define SYMBOL_COMPARE(x,y) (arc[x]->CompareSymbol(arc[y])) 29 #define COMPARE(x,y) (arc[x]->Compare(arc[y])) 55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) { 56 arc[forwardList[rix]]->Print(); 77 while (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId 78 && arc[forwardList[fix]]->GetToId() == DISCARD_LABEL) 80 if (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId) 81 fnxt= arc[forwardLis [all...] |
H A D | netw_dump.cpp | 37 origIndex= arc[ii]->GetInput(); 39 arc[ii]->AssignInput (sortedIndex); 61 switch ( arc[loc]->inputLabel ) { 63 outfile << arc[loc]->fromId << std::endl; 66 outfile << arc[loc]->fromId << separator << arc[loc]->toId << separator << Eps << std::endl; 78 // if (!p_Doc.findLabel( arc[loc]->inputLabel, inLabel ) ) { 79 if (!p_Doc.findSortedLabel( arc[loc]->inputLabel, inLabel ) ) { 81 ss << arc[loc]->inputLabel; 84 outfile << arc[lo [all...] |
H A D | sub_base.cpp | 35 arc= new NUANArc * [BLKSIZE]; 60 arc= new NUANArc * [BLKSIZE]; 65 new_arc[ii]= arc[ii]; 66 delete [] arc; 67 arc= new_arc; 76 arc[numArc]= arc_one; 86 arc[numArc]= arc_one; 96 arc[numArc]= arc_one; 107 arc[numArc]= arc_one; 117 arc[numAr [all...] |
H A D | sub_phon.cpp | 54 wordId= arc[ii]->GetInput(); 60 arcOne= CreateArc (NONE_LABEL, NONE_LABEL, arc[ii]->GetFromId(), newId); 66 // (void) CreateArc (-wordId, NONE_LABEL, arc[ii]->GetFromId(), newId); 67 arcOne= CreateArc (WB_LABEL, NONE_LABEL, nextId, arc[ii]->GetToId()); 69 // (void) CreateArc (WB_LABEL, wordId, newId, arc[ii]->GetToId()); 76 currId= arc[ii]->GetFromId(); 90 arcOne= CreateArc (WB_LABEL, wordId, currId, arc[ii]->GetToId()); 95 arc[ii]->AssignInput (DISCARD_LABEL); // Delete original arc 101 arc[i [all...] |
/external/openfst/src/include/fst/ |
H A D | arcfilter.h | 35 bool operator()(const A &arc) const { return true; } 43 bool operator()(const A &arc) const { 44 return arc.ilabel == 0 && arc.olabel == 0; 53 bool operator()(const A &arc) const { 54 return arc.ilabel == 0; 63 bool operator()(const A &arc) const { 64 return arc.olabel == 0; 81 bool operator()(const A &arc) const { 82 Label label = match_input_ ? arc [all...] |
H A D | reweight.h | 39 // An arc of weight w, with an origin state of potential p and 78 Arc arc = ait.Value(); local 79 if (arc.nextstate >= potential.size()) 81 typename Arc::Weight nextweight = potential[arc.nextstate]; 85 arc.weight = Divide(Times(arc.weight, nextweight), weight, 88 arc.weight = Divide(Times(weight, arc.weight), nextweight, 90 ait.SetValue(arc); 114 Arc arc local [all...] |
H A D | verify.h | 64 const Arc &arc =aiter.Value(); local 65 if (!allow_negative_labels && arc.ilabel < 0) { 66 LOG(ERROR) << "Verify: Fst input label ID of arc at position " 69 } else if (isyms && isyms->Find(arc.ilabel) == "") { 70 LOG(ERROR) << "Verify: Fst input label ID " << arc.ilabel 71 << " of arc at position " << na << " of state " << s 75 } else if (!allow_negative_labels && arc.olabel < 0) { 76 LOG(ERROR) << "Verify: Fst output label ID of arc at position " 79 } else if (osyms && osyms->Find(arc.olabel) == "") { 80 LOG(ERROR) << "Verify: Fst output label ID " << arc [all...] |
H A D | prune.h | 156 Arc arc = ait.Value(); local 157 if (!opts.filter(arc)) continue; 158 Weight weight = Times(Times(idistance[s], arc.weight), 159 arc.nextstate < fdistance->size() 160 ? (*fdistance)[arc.nextstate] 163 arc.nextstate = dead[0]; 164 ait.SetValue(arc); 167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate])) 168 idistance[arc 282 const Arc &arc = ait.Value(); local [all...] |
H A D | rmfinalepsilon.h | 57 const A& arc = aiter.Value(); local 58 if (coaccess[arc.nextstate]) { 77 const A& arc = aiter.Value(); local 79 if (finals.find(arc.nextstate) != finals.end()) { 81 if (arc.ilabel == 0 && arc.olabel == 0) { 82 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); 84 arcs.push_back(arc); 87 arcs.push_back(arc); [all...] |
H A D | visit.h | 50 // // Invoked when arc to white/undiscovered state examined 52 // // Invoked when arc to grey/unfinished state examined 54 // // Invoked when arc to black/finished state examined 119 // Creates arc iterator if needed. 122 // Deletes arc iterator if done. 137 const Arc &arc = aiter->Value(); local 138 if (arc.nextstate >= state_status.size()) { 139 nstates = arc.nextstate + 1; 143 // Visits respective arc types 144 if (filter(arc)) { 214 WhiteArc(StateId s, const Arc &arc) argument 219 GreyArc(StateId s, const Arc &arc) argument 224 BlackArc(StateId s, const Arc &arc) argument 267 WhiteArc(StateId s, const Arc &arc) argument 268 GreyArc(StateId s, const Arc &arc) argument 269 BlackArc(StateId s, const Arc &arc) argument [all...] |
H A D | test-properties.h | 139 const Arc &arc =aiter.Value(); local 141 if (ilabels && ilabels->find(arc.ilabel) != ilabels->end()) { 145 if (olabels && olabels->find(arc.olabel) != olabels->end()) { 149 if (arc.ilabel != arc.olabel) { 153 if (arc.ilabel == 0 && arc.olabel == 0) { 157 if (arc.ilabel == 0) { 161 if (arc.olabel == 0) { 166 if (arc [all...] |
H A D | dfs-visit.h | 54 // // Invoked when tree arc examined (to white/undiscovered state) 56 // // Invoked when back arc examined (to grey/unfinished state) 58 // // Invoked when forward or cross arc examined (to black/finished state) 147 const Arc &arc = aiter.Value(); local 148 if (arc.nextstate >= state_color.size()) { 149 nstates = arc.nextstate + 1; 152 if (!filter(arc)) { 156 int next_color = state_color[arc.nextstate]; 160 dfs = visitor->TreeArc(s, arc); 162 state_color[arc [all...] |
/external/lzma/CPP/7zip/Archive/ |
H A D | ArchiveExports.cpp | 68 const CArcInfo &arc = *g_Arcs[formatIndex];
local 71 *outObject = arc.CreateInArchive();
76 if (!arc.CreateOutArchive)
78 *outObject = arc.CreateOutArchive();
91 const CArcInfo &arc = *g_Arcs[formatIndex];
local 96 prop = arc.Name;
101 CLS_ARC_ID_ITEM(clsId) = arc.ClassId;
105 if (arc.Ext != 0)
106 prop = arc.Ext;
109 if (arc [all...] |
/external/openfst/src/include/fst/script/ |
H A D | compile-impl.h | 86 Arc arc; local 96 arc.nextstate = d = StrToStateId(col[1]); 97 arc.ilabel = StrToILabel(col[2]); 98 arc.olabel = arc.ilabel; 99 arc.weight = Weight::One(); 100 fst_.AddArc(s, arc); 103 arc.nextstate = d = StrToStateId(col[1]); 104 arc.ilabel = StrToILabel(col[2]); 106 arc [all...] |