Searched refs:hasT (Results 1 – 10 of 10) sorted by relevance
112 Bool hasT; // True --> translations have (or MAY have) member
291 if (fIntersections->hasT(quadT)) { in addNearEndPoints()317 if (fIntersections->hasT(quadT)) { in addNearHorizontalEndPoints()343 if (fIntersections->hasT(quadT)) { in addNearVerticalEndPoints()
285 if (fIntersections->hasT(cubicT)) { in addNearEndPoints()310 if (fIntersections->hasT(cubicT)) { in addNearHorizontalEndPoints()336 if (fIntersections->hasT(cubicT)) { in addNearVerticalEndPoints()
186 if (fIntersections->hasT(conicT)) { in addNearEndPoints()212 if (fIntersections->hasT(conicT)) { in addNearHorizontalEndPoints()238 if (fIntersections->hasT(conicT)) { in addNearVerticalEndPoints()
105 bool hasT(double t) const { in hasT() function
450 seg->hasX ? 'x' : '-', seg->hasT ? 'T' : '-', in show_nsegment_full()485 seg->hasX ? 'x' : '-', seg->hasT ? 'T' : '-', in show_nsegment()498 seg->hasX ? 'x' : '-', seg->hasT ? 'T' : '-', in show_nsegment()512 seg->hasX ? 'x' : '-', seg->hasT ? 'T' : '-', in show_nsegment()624 && !s->hasR && !s->hasW && !s->hasX && !s->hasT in sane_NSegment()642 && !s->hasR && !s->hasW && !s->hasX && !s->hasT in sane_NSegment()677 s1->hasT |= s2->hasT; in maybe_merge_nsegments()689 s1->hasT |= s2->hasT; in maybe_merge_nsegments()1298 if (nsegments[i].hasT) in any_Ts_in_range()1483 seg->hasR = seg->hasW = seg->hasX = seg->hasT = seg->isCH = False; in init_nsegment()[all …]
907 return seg && seg->hasX && seg->hasT;
666 || !seg->hasT) in aligned_ptr_above_page0_is_vtable_addr()
1275 if (seg->hasT) in do_brk()
2037 if (seg->hasT) in PRE()2069 if (seg->hasT) in PRE()