106 // set to a non-zero value and 'x' and 'y' store the minimum location
133     stbrp_coord    x, y;  member
181     stbrp_coord  x, y;  member
280     context->extra[0].x = 0;  in stbrp_init_target()
283     context->extra[1].x = (stbrp_coord) width;  in stbrp_init_target()
297     STBRP_ASSERT(first->x <= x0);  in stbrp__skyline_find_min_y()
301     while(node->next->x <= x0)  in stbrp__skyline_find_min_y()
304     STBRP_ASSERT(node->next->x > x0); // we ended up handling this in the caller for efficiency  in stbrp__skyline_find_min_y()
307     STBRP_ASSERT(node->x <= x0);  in stbrp__skyline_find_min_y()
312     while(node->x < x1) {  in stbrp__skyline_find_min_y()
320             if(node->x < x0)  in stbrp__skyline_find_min_y()
321                 visited_width += node->next->x - x0;  in stbrp__skyline_find_min_y()
323                 visited_width += node->next->x - node->x;  in stbrp__skyline_find_min_y()
327             int under_width = node->next->x - node->x;  in stbrp__skyline_find_min_y()
341     int x, y;  member
359         fr.x = fr.y = 0;  in stbrp__skyline_find_best_pos()
365     while(node->x + width <= c->width) {  in stbrp__skyline_find_best_pos()
367         y = stbrp__skyline_find_min_y(c, node, node->x, width, &waste);  in stbrp__skyline_find_best_pos()
390     best_x = (best == NULL) ? 0 : (*best)->x;  in stbrp__skyline_find_best_pos()
407     // This makes BF take about 2x the time  in stbrp__skyline_find_best_pos()
414         while(tail->x < width)  in stbrp__skyline_find_best_pos()
417             int xpos = tail->x - width;  in stbrp__skyline_find_best_pos()
421             while(node->next->x <= xpos) {  in stbrp__skyline_find_best_pos()
425             STBRP_ASSERT(node->next->x > xpos && node->x <= xpos);  in stbrp__skyline_find_best_pos()
443     fr.x = best_x;  in stbrp__skyline_find_best_pos()
465     node->x = (stbrp_coord) res.x;  in stbrp__skyline_pack_rectangle()
475     if(cur->x < res.x) {  in stbrp__skyline_pack_rectangle()
487     while(cur->next && cur->next->x <= res.x + width) {  in stbrp__skyline_pack_rectangle()
498     if(cur->x < res.x + width)  in stbrp__skyline_pack_rectangle()
499         cur->x = (stbrp_coord)(res.x + width);  in stbrp__skyline_pack_rectangle()
503     while(cur->x < context->width) {  in stbrp__skyline_pack_rectangle()
504         STBRP_ASSERT(cur->x < cur->next->x);  in stbrp__skyline_pack_rectangle()
560             rects[i].x = rects[i].y = 0;  // empty rect needs no space  in stbrp_pack_rects()
565                 rects[i].x = (stbrp_coord) fr.x;  in stbrp_pack_rects()
569                 rects[i].x = rects[i].y = STBRP__MAXVAL;  in stbrp_pack_rects()
579         rects[i].was_packed = !(rects[i].x == STBRP__MAXVAL && rects[i].y == STBRP__MAXVAL);  in stbrp_pack_rects()