Searched refs:hasT (Results 1 – 11 of 11) sorted by relevance
238 if (fIntersections->hasT(quadT)) { in addNearEndPoints()264 if (fIntersections->hasT(quadT)) { in addNearHorizontalEndPoints()290 if (fIntersections->hasT(quadT)) { in addNearVerticalEndPoints()
261 if (fIntersections->hasT(cubicT)) { in addNearEndPoints()286 if (fIntersections->hasT(cubicT)) { in addNearHorizontalEndPoints()312 if (fIntersections->hasT(cubicT)) { in addNearVerticalEndPoints()
95 bool hasT(double t) const { in hasT() function
112 Bool hasT; // True --> translations have (or MAY have) member
523 seg->hasX ? 'x' : '-', seg->hasT ? 'T' : '-', in show_nsegment_full()557 seg->hasX ? 'x' : '-', seg->hasT ? 'T' : '-', in show_nsegment()570 seg->hasX ? 'x' : '-', seg->hasT ? 'T' : '-', in show_nsegment()583 seg->hasX ? 'x' : '-', seg->hasT ? 'T' : '-', in show_nsegment()712 && !s->hasR && !s->hasW && !s->hasX && !s->hasT in sane_NSegment()732 && !s->hasR && !s->hasW && !s->hasX && !s->hasT in sane_NSegment()767 s1->hasT |= s2->hasT; in maybe_merge_nsegments()779 s1->hasT |= s2->hasT; in maybe_merge_nsegments()1402 if (nsegments[i].hasT) in any_Ts_in_range()1537 seg->hasR = seg->hasW = seg->hasX = seg->hasT = seg->isCH = False; in init_nsegment()[all …]
839 return seg && seg->hasX && seg->hasT; in has_XT_perms()
665 || !seg->hasT) in aligned_ptr_above_page0_is_vtable_addr()
1164 if (seg && seg->hasT) in do_brk()