ref: 9aad4736a1a1a72912196a519b63b626d4211498
author: Sigrid Haflínudóttir <ftrvxmtrx@gmail.com>
date: Fri Jan 3 15:44:37 EST 2020
first
--- /dev/null
+++ b/.gitignore
@@ -1,0 +1,2 @@
+[0125678vqki].out
+*.[0125678vqki]
--- /dev/null
+++ b/README.md
@@ -1,0 +1,22 @@
+# atlas
+
+Creates an atlas texture out of smaller images, dumps it to stdout as
+a Plan 9 image and write the mapping between filenames of images and
+their positions and dimensions to a file.
+
+Dumping the resulting image file as two headers to be included in a C
+program can be done by using provided `atlasc` script (it needs
+[hx](https://github.com/ftrvxmtrx/hx) to be installed):
+```
+atlasc -b 0x000000ff -c grey8 *.png >atlas_priv.h >[2]atlas.h
+```
+
+## Installing
+
+```
+cd /tmp && \
+hget https://github.com/ftrvxmtrx/hx/archive/master.tar.gz | tar xz && \
+cd hx-master && mk install && cd ../.. && \
+hget https://github.com/ftrvxmtrx/atlas/archive/master.tar.gz | tar xz && \
+cd atlas-master && mk install
+```
--- /dev/null
+++ b/atlas.c
@@ -1,0 +1,198 @@
+#include <u.h>
+#include <libc.h>
+#include <draw.h>
+#include <memdraw.h>
+#define NULL nil
+#define STBRP_STATIC
+#define STBRP_LARGE_RECTS
+#define STBRP_SORT qsort
+#define STBRP_ASSERT assert
+#define STBRP__NOTUSED USED
+#define STB_RECT_PACK_IMPLEMENTATION
+#include "stb_rect_pack.h"
+
+static struct {+ u32int c;
+ char *s;
+}chans[] = {+ {GREY1, "grey1"},+ {GREY2, "grey2"},+ {GREY4, "grey4"},+ {GREY8, "grey8"},+ {CMAP8, "cmap8"},+ {RGB15, "rgb15"},+ {RGB16, "rgb16"},+ {RGB24, "rgb24"},+ {RGBA32, "rgba32"},+ {ARGB32, "argb32"},+ {XRGB32, "xrgb32"},+ {BGR24, "bgr24"},+ {ABGR32, "abgr32"},+ {XBGR32, "xbgr32"},+};
+
+static Memimage *
+load(char *path)
+{+ Memimage *im;
+ Waitmsg *msg;
+ char *e;
+ int p[2], pid;
+
+ if ((e = strrchr(path, '.')) != nil) {+ if (strcmp(e, ".png") == 0)
+ e = "/bin/png";
+ else if (strcmp(e, ".tga") == 0)
+ e = "/bin/tga";
+ else if (strcmp(e, ".bmp") == 0)
+ e = "/bin/bmp";
+ else if (strcmp(e, ".jpg") == 0)
+ e = "/bin/jpg";
+ else
+ e = nil;
+ }
+ if (e == nil) {+ werrstr("unsupported format");+ return nil;
+ }
+
+ pipe(p);
+ if ((pid = rfork(RFPROC|RFFDG|RFREND|RFNOTEG)) == 0) {+ close(0); close(p[0]);
+ dup(p[1], 1); close(p[1]);
+ dup(open("/dev/null", OWRITE), 2);+ execl("/bin/png", "png", "-9t", path, nil);+ sysfatal("load: %r");+ }
+ close(p[1]);
+ im = nil;
+ if (pid > 0)
+ im = readmemimage(p[0]);
+ msg = wait();
+ if (msg->msg[0] != 0) {+ im = nil;
+ werrstr(msg->msg);
+ }
+ free(msg);
+ close(p[0]);
+ return im;
+}
+
+static void
+usage(void)
+{+ int i;
+
+ print("usage: atlas [-o offsets] [-c chan] [-b backcolor] [file ...]\n\n");+ print("For each image of the atlas a line of format \"filename x y w h\"\n");+ print("is written to file specified with -o. Each line describes where\n");+ print("the image is located on the final atlas image.\n");+ print("The atlas itself is written to stdout.\n");+ print("-b sets the background color in rgba format, default is 0x00000000 (transparent).\n");+ print("Default chan is rgba32; supported values:");+ for (i = 0; i < nelem(chans); i++)
+ print(" %s", chans[i].s);+ print(".\n");+
+ exits("usage");+}
+
+void
+main(int argc, char **argv)
+{+ char *o, *c;
+ stbrp_rect *rects, r;
+ stbrp_node *nodes;
+ Memimage **im, *b;
+ stbrp_context ctx;
+ int i, w, h, n, fd, chan;
+ u32int backcolor;
+
+ o = nil;
+ chan = RGBA32;
+ backcolor = 0;
+ ARGBEGIN {+ case 'o':
+ o = EARGF(usage());
+ break;
+ case 'b':
+ backcolor = strtoul(EARGF(usage()), &c, 0);
+ if (*c != 0) {+ fprint(2, "bad color \"%s\"\n", c);
+ usage();
+ }
+ break;
+ case 'c':
+ c = EARGF(usage());
+ for (i = 0; i < nelem(chans); i++) {+ if (strcmp(chans[i].s, c) == 0) {+ chan = chans[i].c;
+ break;
+ }
+ }
+ if (i >= nelem(chans)) {+ fprint(2, "unknown chan \%s\"\n", c);
+ usage();
+ }
+ break;
+ default:
+ usage();
+ } ARGEND;
+
+ if (argc < 1)
+ usage();
+
+ if (memimageinit() != 0)
+ sysfatal("initdraw: %r");+
+ im = calloc(argc, sizeof(*im));
+ rects = calloc(argc, sizeof(*rects));
+ w = h = n = 0;
+ for (i = 0; i < argc; i++) {+ if ((im[i] = load(argv[i])) == nil)
+ sysfatal("%s: %r", argv[i]);+ rects[i].id = i;
+ rects[i].w = Dx(im[i]->r);
+ rects[i].h = Dy(im[i]->r);
+ if (rects[i].w <= 0 || rects[i].h <= 0)
+ sysfatal("%s: zero width/height", argv[i]);+ if (w < rects[i].w)
+ w = rects[i].w;
+ if (h < rects[i].h)
+ h = rects[i].h;
+ n += rects[i].w;
+ }
+ nodes = calloc(n, sizeof(*nodes));
+ for (;;) {+ stbrp_init_target(&ctx, w, h, nodes, n);
+ if (stbrp_pack_rects(&ctx, rects, argc) == 1)
+ break;
+ w += 32;
+ h += 32;
+ }
+
+ if ((fd = o == nil ? open("/dev/null", OWRITE) : create(o, OWRITE, 0664)) < 0)+ sysfatal("can't write: %r");+ w = h = 0;
+ for (i = 0; i < argc; i++) {+ r = rects[i];
+ if (w < r.x+r.w)
+ w = r.x+r.w;
+ if (h < r.y+r.h)
+ h = r.y+r.h;
+ if (o != nil)
+ fprint(fd, "%s\t%d\t%d\t%d\t%d\n", argv[r.id], r.x, r.y, r.w, r.h);
+ }
+ close(fd);
+
+ if ((b = allocmemimage(Rect(0, 0, w, h), chan)) == nil)
+ sysfatal("failed to allocate %dx%d image", w, h);+ memfillcolor(b, backcolor);
+ for (i = 0; i < argc; i++) {+ r = rects[i];
+ memimagedraw(b, Rect(r.x, r.y, r.x+r.w, r.y+r.h), im[rects[i].id], ZP, nil, ZP, SoverD);
+ }
+ writememimage(1, b);
+
+ exits(nil);
+}
--- /dev/null
+++ b/atlasc
@@ -1,0 +1,20 @@
+#!/bin/rc
+rfork e
+
+atlas -o /tmp/atlas.off $* > /tmp/atlas
+
+echo 'static u8int atlas_texture[] = {'+hx /tmp/atlas | awk -F' ' '{print $2, $3}' | sed 's/ *$/,/g;s/^/ 0x/g;s/ /, 0x/g'+echo '};'
+echo
+echo 'static struct {'+echo ' int x, y, w, h;'
+echo '}atlas[] = {'+cat /tmp/atlas.off | while(a=`{read}) { echo ' ['`{basename $a(1) | sed 's/\..*//g' | tr '[a-z]' '[A-Z]'}^'] = {'$a(2)^, $a(3)^, $a(4)^, $a(5)^'},' }+echo '};'
+
+echo 'enum {' >[1=2]+cat /tmp/atlas.off | while(a=`{read}) { echo ' '`{basename $a(1) | sed 's/\..*//g' | tr '[a-z]' '[A-Z]'}^',' } >[1=2]+echo '};' >[1=2]
+
+rm -f /tmp/atlas.off /tmp/atlas
--- /dev/null
+++ b/mkfile
@@ -1,0 +1,16 @@
+</$objtype/mkfile
+
+TARG=atlas
+BIN=/$objtype/bin
+
+OFILES=\
+ atlas.$O\
+
+default:V: all
+
+</sys/src/cmd/mkone
+
+install:V: $BIN/$TARG $BIN/atlasc
+
+$BIN/atlasc: atlasc
+ cp $prereq $BIN/atlasc
--- /dev/null
+++ b/stb_rect_pack.h
@@ -1,0 +1,624 @@
+// stb_rect_pack.h - v1.00 - public domain - rectangle packing
+// Sean Barrett 2014
+//
+// Useful for e.g. packing rectangular textures into an atlas.
+// Does not do rotation.
+//
+// Not necessarily the awesomest packing method, but better than
+// the totally naive one in stb_truetype (which is primarily what
+// this is meant to replace).
+//
+// Has only had a few tests run, may have issues.
+//
+// More docs to come.
+//
+// No memory allocations; uses qsort() and assert() from stdlib.
+// Can override those by defining STBRP_SORT and STBRP_ASSERT.
+//
+// This library currently uses the Skyline Bottom-Left algorithm.
+//
+// Please note: better rectangle packers are welcome! Please
+// implement them to the same API, but with a different init
+// function.
+//
+// Credits
+//
+// Library
+// Sean Barrett
+// Minor features
+// Martins Mozeiko
+// github:IntellectualKitty
+//
+// Bugfixes / warning fixes
+// Jeremy Jaussaud
+// Fabian Giesen
+//
+// Version history:
+//
+// 1.00 (2019-02-25) avoid small space waste; gracefully fail too-wide rectangles
+// 0.99 (2019-02-07) warning fixes
+// 0.11 (2017-03-03) return packing success/fail result
+// 0.10 (2016-10-25) remove cast-away-const to avoid warnings
+// 0.09 (2016-08-27) fix compiler warnings
+// 0.08 (2015-09-13) really fix bug with empty rects (w=0 or h=0)
+// 0.07 (2015-09-13) fix bug with empty rects (w=0 or h=0)
+// 0.06 (2015-04-15) added STBRP_SORT to allow replacing qsort
+// 0.05: added STBRP_ASSERT to allow replacing assert
+// 0.04: fixed minor bug in STBRP_LARGE_RECTS support
+// 0.01: initial release
+//
+// LICENSE
+//
+// See end of file for license information.
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// INCLUDE SECTION
+//
+
+#ifndef STB_INCLUDE_STB_RECT_PACK_H
+#define STB_INCLUDE_STB_RECT_PACK_H
+
+#define STB_RECT_PACK_VERSION 1
+
+#ifdef STBRP_STATIC
+#define STBRP_DEF static
+#else
+#define STBRP_DEF extern
+#endif
+
+#ifdef __cplusplus
+extern "C" {+#endif
+
+typedef struct stbrp_context stbrp_context;
+typedef struct stbrp_node stbrp_node;
+typedef struct stbrp_rect stbrp_rect;
+
+#ifdef STBRP_LARGE_RECTS
+typedef int stbrp_coord;
+#else
+typedef unsigned short stbrp_coord;
+#endif
+
+STBRP_DEF int stbrp_pack_rects (stbrp_context *context, stbrp_rect *rects, int num_rects);
+// Assign packed locations to rectangles. The rectangles are of type
+// 'stbrp_rect' defined below, stored in the array 'rects', and there
+// are 'num_rects' many of them.
+//
+// Rectangles which are successfully packed have the 'was_packed' flag
+// set to a non-zero value and 'x' and 'y' store the minimum location
+// on each axis (i.e. bottom-left in cartesian coordinates, top-left
+// if you imagine y increasing downwards). Rectangles which do not fit
+// have the 'was_packed' flag set to 0.
+//
+// You should not try to access the 'rects' array from another thread
+// while this function is running, as the function temporarily reorders
+// the array while it executes.
+//
+// To pack into another rectangle, you need to call stbrp_init_target
+// again. To continue packing into the same rectangle, you can call
+// this function again. Calling this multiple times with multiple rect
+// arrays will probably produce worse packing results than calling it
+// a single time with the full rectangle array, but the option is
+// available.
+//
+// The function returns 1 if all of the rectangles were successfully
+// packed and 0 otherwise.
+
+struct stbrp_rect
+{+ // reserved for your use:
+ int id;
+
+ // input:
+ stbrp_coord w, h;
+
+ // output:
+ stbrp_coord x, y;
+ int was_packed; // non-zero if valid packing
+
+}; // 16 bytes, nominally
+
+
+STBRP_DEF void stbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes);
+// Initialize a rectangle packer to:
+// pack a rectangle that is 'width' by 'height' in dimensions
+// using temporary storage provided by the array 'nodes', which is 'num_nodes' long
+//
+// You must call this function every time you start packing into a new target.
+//
+// There is no "shutdown" function. The 'nodes' memory must stay valid for
+// the following stbrp_pack_rects() call (or calls), but can be freed after
+// the call (or calls) finish.
+//
+// Note: to guarantee best results, either:
+// 1. make sure 'num_nodes' >= 'width'
+// or 2. call stbrp_allow_out_of_mem() defined below with 'allow_out_of_mem = 1'
+//
+// If you don't do either of the above things, widths will be quantized to multiples
+// of small integers to guarantee the algorithm doesn't run out of temporary storage.
+//
+// If you do #2, then the non-quantized algorithm will be used, but the algorithm
+// may run out of temporary storage and be unable to pack some rectangles.
+
+STBRP_DEF void stbrp_setup_allow_out_of_mem (stbrp_context *context, int allow_out_of_mem);
+// Optionally call this function after init but before doing any packing to
+// change the handling of the out-of-temp-memory scenario, described above.
+// If you call init again, this will be reset to the default (false).
+
+
+STBRP_DEF void stbrp_setup_heuristic (stbrp_context *context, int heuristic);
+// Optionally select which packing heuristic the library should use. Different
+// heuristics will produce better/worse results for different data sets.
+// If you call init again, this will be reset to the default.
+
+enum
+{+ STBRP_HEURISTIC_Skyline_default=0,
+ STBRP_HEURISTIC_Skyline_BL_sortHeight = STBRP_HEURISTIC_Skyline_default,
+ STBRP_HEURISTIC_Skyline_BF_sortHeight
+};
+
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// the details of the following structures don't matter to you, but they must
+// be visible so you can handle the memory allocations for them
+
+struct stbrp_node
+{+ stbrp_coord x,y;
+ stbrp_node *next;
+};
+
+struct stbrp_context
+{+ int width;
+ int height;
+ int align;
+ int init_mode;
+ int heuristic;
+ int num_nodes;
+ stbrp_node *active_head;
+ stbrp_node *free_head;
+ stbrp_node extra[2]; // we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2'
+};
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// IMPLEMENTATION SECTION
+//
+
+#ifdef STB_RECT_PACK_IMPLEMENTATION
+#ifndef STBRP_SORT
+#include <stdlib.h>
+#define STBRP_SORT qsort
+#endif
+
+#ifndef STBRP_ASSERT
+#include <assert.h>
+#define STBRP_ASSERT assert
+#endif
+
+#ifndef STBRP__NOTUSED
+#ifdef _MSC_VER
+#define STBRP__NOTUSED(v) (void)(v)
+#else
+#define STBRP__NOTUSED(v) (void)sizeof(v)
+#endif
+#endif
+
+enum
+{+ STBRP__INIT_skyline = 1
+};
+
+STBRP_DEF void stbrp_setup_heuristic(stbrp_context *context, int heuristic)
+{+ switch (context->init_mode) {+ case STBRP__INIT_skyline:
+ STBRP_ASSERT(heuristic == STBRP_HEURISTIC_Skyline_BL_sortHeight || heuristic == STBRP_HEURISTIC_Skyline_BF_sortHeight);
+ context->heuristic = heuristic;
+ break;
+ default:
+ STBRP_ASSERT(0);
+ }
+}
+
+STBRP_DEF void stbrp_setup_allow_out_of_mem(stbrp_context *context, int allow_out_of_mem)
+{+ if (allow_out_of_mem)
+ // if it's ok to run out of memory, then don't bother aligning them;
+ // this gives better packing, but may fail due to OOM (even though
+ // the rectangles easily fit). @TODO a smarter approach would be to only
+ // quantize once we've hit OOM, then we could get rid of this parameter.
+ context->align = 1;
+ else {+ // if it's not ok to run out of memory, then quantize the widths
+ // so that num_nodes is always enough nodes.
+ //
+ // I.e. num_nodes * align >= width
+ // align >= width / num_nodes
+ // align = ceil(width/num_nodes)
+
+ context->align = (context->width + context->num_nodes-1) / context->num_nodes;
+ }
+}
+
+STBRP_DEF void stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes)
+{+ int i;
+#ifndef STBRP_LARGE_RECTS
+ STBRP_ASSERT(width <= 0xffff && height <= 0xffff);
+#endif
+
+ for (i=0; i < num_nodes-1; ++i)
+ nodes[i].next = &nodes[i+1];
+ nodes[i].next = NULL;
+ context->init_mode = STBRP__INIT_skyline;
+ context->heuristic = STBRP_HEURISTIC_Skyline_default;
+ context->free_head = &nodes[0];
+ context->active_head = &context->extra[0];
+ context->width = width;
+ context->height = height;
+ context->num_nodes = num_nodes;
+ stbrp_setup_allow_out_of_mem(context, 0);
+
+ // node 0 is the full width, node 1 is the sentinel (lets us not store width explicitly)
+ context->extra[0].x = 0;
+ context->extra[0].y = 0;
+ context->extra[0].next = &context->extra[1];
+ context->extra[1].x = (stbrp_coord) width;
+#ifdef STBRP_LARGE_RECTS
+ context->extra[1].y = (1<<30);
+#else
+ context->extra[1].y = 65535;
+#endif
+ context->extra[1].next = NULL;
+}
+
+// find minimum y position if it starts at x1
+static int stbrp__skyline_find_min_y(stbrp_context *c, stbrp_node *first, int x0, int width, int *pwaste)
+{+ stbrp_node *node = first;
+ int x1 = x0 + width;
+ int min_y, visited_width, waste_area;
+
+ STBRP__NOTUSED(c);
+
+ STBRP_ASSERT(first->x <= x0);
+
+ STBRP_ASSERT(node->next->x > x0); // we ended up handling this in the caller for efficiency
+
+ STBRP_ASSERT(node->x <= x0);
+
+ min_y = 0;
+ waste_area = 0;
+ visited_width = 0;
+ while (node->x < x1) {+ if (node->y > min_y) {+ // raise min_y higher.
+ // we've accounted for all waste up to min_y,
+ // but we'll now add more waste for everything we've visted
+ waste_area += visited_width * (node->y - min_y);
+ min_y = node->y;
+ // the first time through, visited_width might be reduced
+ if (node->x < x0)
+ visited_width += node->next->x - x0;
+ else
+ visited_width += node->next->x - node->x;
+ } else {+ // add waste area
+ int under_width = node->next->x - node->x;
+ if (under_width + visited_width > width)
+ under_width = width - visited_width;
+ waste_area += under_width * (min_y - node->y);
+ visited_width += under_width;
+ }
+ node = node->next;
+ }
+
+ *pwaste = waste_area;
+ return min_y;
+}
+
+typedef struct
+{+ int x,y;
+ stbrp_node **prev_link;
+} stbrp__findresult;
+
+static stbrp__findresult stbrp__skyline_find_best_pos(stbrp_context *c, int width, int height)
+{+ int best_waste = (1<<30), best_x, best_y = (1 << 30);
+ stbrp__findresult fr;
+ stbrp_node **prev, *node, *tail, **best = NULL;
+
+ // align to multiple of c->align
+ width = (width + c->align - 1);
+ width -= width % c->align;
+ STBRP_ASSERT(width % c->align == 0);
+
+ // if it can't possibly fit, bail immediately
+ if (width > c->width || height > c->height) {+ fr.prev_link = NULL;
+ fr.x = fr.y = 0;
+ return fr;
+ }
+
+ node = c->active_head;
+ prev = &c->active_head;
+ while (node->x + width <= c->width) {+ int y,waste;
+ y = stbrp__skyline_find_min_y(c, node, node->x, width, &waste);
+ if (c->heuristic == STBRP_HEURISTIC_Skyline_BL_sortHeight) { // actually just want to test BL+ // bottom left
+ if (y < best_y) {+ best_y = y;
+ best = prev;
+ }
+ } else {+ // best-fit
+ if (y + height <= c->height) {+ // can only use it if it first vertically
+ if (y < best_y || (y == best_y && waste < best_waste)) {+ best_y = y;
+ best_waste = waste;
+ best = prev;
+ }
+ }
+ }
+ prev = &node->next;
+ node = node->next;
+ }
+
+ best_x = (best == NULL) ? 0 : (*best)->x;
+
+ // if doing best-fit (BF), we also have to try aligning right edge to each node position
+ //
+ // e.g, if fitting
+ //
+ // ____________________
+ // |____________________|
+ //
+ // into
+ //
+ // | |
+ // | ____________|
+ // |____________|
+ //
+ // then right-aligned reduces waste, but bottom-left BL is always chooses left-aligned
+ //
+ // This makes BF take about 2x the time
+
+ if (c->heuristic == STBRP_HEURISTIC_Skyline_BF_sortHeight) {+ tail = c->active_head;
+ node = c->active_head;
+ prev = &c->active_head;
+ // find first node that's admissible
+ while (tail->x < width)
+ tail = tail->next;
+ while (tail) {+ int xpos = tail->x - width;
+ int y,waste;
+ STBRP_ASSERT(xpos >= 0);
+ // find the left position that matches this
+ while (node->next->x <= xpos) {+ prev = &node->next;
+ node = node->next;
+ }
+ STBRP_ASSERT(node->next->x > xpos && node->x <= xpos);
+ y = stbrp__skyline_find_min_y(c, node, xpos, width, &waste);
+ if (y + height <= c->height) {+ if (y <= best_y) {+ if (y < best_y || waste < best_waste || (waste==best_waste && xpos < best_x)) {+ best_x = xpos;
+ STBRP_ASSERT(y <= best_y);
+ best_y = y;
+ best_waste = waste;
+ best = prev;
+ }
+ }
+ }
+ tail = tail->next;
+ }
+ }
+
+ fr.prev_link = best;
+ fr.x = best_x;
+ fr.y = best_y;
+ return fr;
+}
+
+static stbrp__findresult stbrp__skyline_pack_rectangle(stbrp_context *context, int width, int height)
+{+ // find best position according to heuristic
+ stbrp__findresult res = stbrp__skyline_find_best_pos(context, width, height);
+ stbrp_node *node, *cur;
+
+ // bail if:
+ // 1. it failed
+ // 2. the best node doesn't fit (we don't always check this)
+ // 3. we're out of memory
+ if (res.prev_link == NULL || res.y + height > context->height || context->free_head == NULL) {+ res.prev_link = NULL;
+ return res;
+ }
+
+ // on success, create new node
+ node = context->free_head;
+ node->x = (stbrp_coord) res.x;
+ node->y = (stbrp_coord) (res.y + height);
+
+ context->free_head = node->next;
+
+ // insert the new node into the right starting point, and
+ // let 'cur' point to the remaining nodes needing to be
+ // stiched back in
+
+ cur = *res.prev_link;
+ if (cur->x < res.x) {+ // preserve the existing one, so start testing with the next one
+ stbrp_node *next = cur->next;
+ cur->next = node;
+ cur = next;
+ } else {+ *res.prev_link = node;
+ }
+
+ // from here, traverse cur and free the nodes, until we get to one
+ // that shouldn't be freed
+ while (cur->next && cur->next->x <= res.x + width) {+ stbrp_node *next = cur->next;
+ // move the current node to the free list
+ cur->next = context->free_head;
+ context->free_head = cur;
+ cur = next;
+ }
+
+ // stitch the list back in
+ node->next = cur;
+
+ if (cur->x < res.x + width)
+ cur->x = (stbrp_coord) (res.x + width);
+
+#ifdef _DEBUG
+ cur = context->active_head;
+ while (cur->x < context->width) {+ STBRP_ASSERT(cur->x < cur->next->x);
+ cur = cur->next;
+ }
+ STBRP_ASSERT(cur->next == NULL);
+
+ {+ int count=0;
+ cur = context->active_head;
+ while (cur) {+ cur = cur->next;
+ ++count;
+ }
+ cur = context->free_head;
+ while (cur) {+ cur = cur->next;
+ ++count;
+ }
+ STBRP_ASSERT(count == context->num_nodes+2);
+ }
+#endif
+
+ return res;
+}
+
+static int rect_height_compare(const void *a, const void *b)
+{+ const stbrp_rect *p = (const stbrp_rect *) a;
+ const stbrp_rect *q = (const stbrp_rect *) b;
+ if (p->h > q->h)
+ return -1;
+ if (p->h < q->h)
+ return 1;
+ return (p->w > q->w) ? -1 : (p->w < q->w);
+}
+
+static int rect_original_order(const void *a, const void *b)
+{+ const stbrp_rect *p = (const stbrp_rect *) a;
+ const stbrp_rect *q = (const stbrp_rect *) b;
+ return (p->was_packed < q->was_packed) ? -1 : (p->was_packed > q->was_packed);
+}
+
+#ifdef STBRP_LARGE_RECTS
+#define STBRP__MAXVAL 0xffffffff
+#else
+#define STBRP__MAXVAL 0xffff
+#endif
+
+STBRP_DEF int stbrp_pack_rects(stbrp_context *context, stbrp_rect *rects, int num_rects)
+{+ int i, all_rects_packed = 1;
+
+ // we use the 'was_packed' field internally to allow sorting/unsorting
+ for (i=0; i < num_rects; ++i) {+ rects[i].was_packed = i;
+ }
+
+ // sort according to heuristic
+ STBRP_SORT(rects, num_rects, sizeof(rects[0]), rect_height_compare);
+
+ for (i=0; i < num_rects; ++i) {+ if (rects[i].w == 0 || rects[i].h == 0) {+ rects[i].x = rects[i].y = 0; // empty rect needs no space
+ } else {+ stbrp__findresult fr = stbrp__skyline_pack_rectangle(context, rects[i].w, rects[i].h);
+ if (fr.prev_link) {+ rects[i].x = (stbrp_coord) fr.x;
+ rects[i].y = (stbrp_coord) fr.y;
+ } else {+ rects[i].x = rects[i].y = STBRP__MAXVAL;
+ }
+ }
+ }
+
+ // unsort
+ STBRP_SORT(rects, num_rects, sizeof(rects[0]), rect_original_order);
+
+ // set was_packed flags and all_rects_packed status
+ for (i=0; i < num_rects; ++i) {+ rects[i].was_packed = !(rects[i].x == STBRP__MAXVAL && rects[i].y == STBRP__MAXVAL);
+ if (!rects[i].was_packed)
+ all_rects_packed = 0;
+ }
+
+ // return the all_rects_packed status
+ return all_rects_packed;
+}
+#endif
+
+/*
+------------------------------------------------------------------------------
+This software is available under 2 licenses -- choose whichever you prefer.
+------------------------------------------------------------------------------
+ALTERNATIVE A - MIT License
+Copyright (c) 2017 Sean Barrett
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is furnished to do
+so, subject to the following conditions:
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+------------------------------------------------------------------------------
+ALTERNATIVE B - Public Domain (www.unlicense.org)
+This is free and unencumbered software released into the public domain.
+Anyone is free to copy, modify, publish, use, compile, sell, or distribute this
+software, either in source code form or as a compiled binary, for any purpose,
+commercial or non-commercial, and by any means.
+In jurisdictions that recognize copyright laws, the author or authors of this
+software dedicate any and all copyright interest in the software to the public
+domain. We make this dedication for the benefit of the public at large and to
+the detriment of our heirs and successors. We intend this dedication to be an
+overt act of relinquishment in perpetuity of all present and future rights to
+this software under copyright law.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+------------------------------------------------------------------------------
+*/