Lines Matching refs:quo
43 int32_t quo;
89 qr.quo = xa/b;
92 qr.quo -= 1;
239 e->x.quo = p1->x;
241 e->dxdy.quo = 0;
255 e->x.quo += p1->x;
260 e->x.quo += dst_x*pixman_fixed_1;
263 I(e->x.quo), e->x.quo, e->x.rem, e->dy,
264 e->dxdy.quo, e->dxdy.rem, e->dy));
288 if (head_a->x.quo <= head_b->x.quo) {
297 x = head_b->x.quo;
298 while (head_a != NULL && head_a->x.quo <= x) {
310 x = head_a->x.quo;
311 while (head_b != NULL && head_b->x.quo <= x) {
340 if (list->x.quo <= head_other->x.quo) {
368 e->x.quo == n->x.quo &&
370 e->dxdy.quo == n->dxdy.quo &&
374 __FUNCTION__, e->x.quo, e->x.rem, e->dxdy.quo, e->dxdy.rem));
388 __FUNCTION__, n->x.quo, n->x.rem, n->dxdy.quo, n->dxdy.rem, n->dy, n->height_left));
409 if (edges->x.quo < INT16_MAX << 16) {
411 edges->x.quo, edges->x.rem,
412 edges->dxdy.quo, edges->dxdy.rem,
423 int prev_x = edges->x.quo;
425 assert(edges->x.quo >= prev_x);
426 prev_x = edges->x.quo;
591 int16_t xend = I(edge->x.quo);
594 __FUNCTION__, edge->dir, winding + edge->dir, xend, edge->x.quo));
597 edge->x.quo += edge->dxdy.quo;
600 ++edge->x.quo;
604 __FUNCTION__, edge->x.quo, edge->x.rem, edge->dxdy.quo, edge->dxdy.rem, edge->dy, edge->height_left, edge->x.quo));
607 if (edge->x.quo < prev_x) {
613 } while (edge->x.quo < pos->x.quo);
619 prev_x = edge->x.quo;
627 assert(I(next->x.quo) >= xend);
628 if (I(next->x.quo) > xend) {
660 c->head.x.quo = INT16_MIN << 16;
665 c->tail.x.quo = INT16_MAX << 16;