diff --git a/gui/build.sh b/gui/build.sh new file mode 100644 index 0000000..dce3c40 --- /dev/null +++ b/gui/build.sh @@ -0,0 +1 @@ +gcc -g -Wall -Wextra $1 -fsanitize=address,undefined gui.c stb_truetype.o -lX11 -lm diff --git a/gui/build_fast.sh b/gui/build_fast.sh new file mode 100644 index 0000000..a7f4a0f --- /dev/null +++ b/gui/build_fast.sh @@ -0,0 +1 @@ +gcc -g -Wall -Wextra $1 gui.c stb_truetype.o -lX11 -lm diff --git a/gui/build_stbtt.sh b/gui/build_stbtt.sh new file mode 100644 index 0000000..24e199e --- /dev/null +++ b/gui/build_stbtt.sh @@ -0,0 +1,2 @@ +gcc -O3 -c stb_truetype.c -o stb_truetype.o + diff --git a/gui/gui.c b/gui/gui.c new file mode 100644 index 0000000..28554c4 --- /dev/null +++ b/gui/gui.c @@ -0,0 +1,3250 @@ + + + +#include +#include +#include +#include + + +#define DEBUG(...) if(ENABLE_DEBUG) {printf(__VA_ARGS__);} + +#define ARRAYLENGTH(X) (sizeof(X)/sizeof((X)[0])) + + +bool my_bool = true; + + +int border_thickness = 0; +float roundedness = 60; + +#include "stb_truetype.h" + +void print_bakedchar(char c, stbtt_bakedchar *b) +{ + printf("%c: %d %d %d %d %.2g %.2g %.2g\n", + c, + b->x0, b->y0, b->x1, b->y1, + b->xoff, b->yoff, b->xadvance); +} +stbtt_bakedchar g_baked_font[96]; +unsigned char *g_font_bitmap; +int g_font_bitmap_width = 512; +int g_font_bitmap_height = 512; + + + + +// --- + + +#define arena_allocate_TYPE(arena, TYPE) ((TYPE*)memory_arena_allocate(arena, sizeof(TYPE), _Alignof(TYPE))) +#define arena_allocate_draw_command(arena) arena_allocate_TYPE(arena, GUI_Draw_Command) + +#include "memory_arena.c" +#include "memory_arena_linux.c" + + +// --- + +#define RDIC_IMPLEMENTATION +#include "../rdic.h" + +typedef struct { + // Top-left corner. + int x0, y0; + // Bottom-Right corner. + int x1, y1; +} GUI_Rectangle; + +// NOTE(Zelaven): I would have loved to do pascal strings here, but I could not +// find any way to pass those as literals in a reasonable way. +// I also use int instead of ssize_t or anything else because of the .*s format +// specifier being an absolute pain. +typedef struct { + int length; + char *cstring; +} GUI_String; +#define GUI_STRING(literal) (GUI_String){.length = sizeof(literal)-1, .cstring = literal} + +typedef uint32_t GUI_Color; +typedef struct { + GUI_Color *pixels; + int width; + int height; +} Pixel_Buffer; + +// TODO(Zelaven): Add a generation to this that you can +// increment so that the nodes that use a style can know +// when up dirty themselves due to style change? +typedef struct { + // TODO(Zelaven): Replace these with GUI_Color. + unsigned char red; + unsigned char green; + unsigned char blue; + + GUI_Color border_color; + int border_thickness; + unsigned char roundedness; +} GUI_Style; + +static inline int point_in_rect(int x, int y, GUI_Rectangle rect) +{ + return + (x >= rect.x0) + && (y >= rect.y0) + && (x <= rect.x1) + && (y <= rect.y1); +} + + +typedef enum { + GUI_SIZERULE_PIXELS, + GUI_SIZERULE_TEXTCONTENT, + GUI_SIZERULE_PERCENTOFPARENT, + GUI_SIZERULE_SUMOFCHILDREN, + //GUI_SIZERULE_SHARES, +} GUI_Size_Rule; + +typedef struct GUI_Size +{ + GUI_Size_Rule size_rule; + int value; + int strictness; +} GUI_Size; + +typedef enum GUI_Axis2 +{ + GUI_AXIS2_X, + GUI_AXIS2_Y, + GUI_AXIS2_COUNT, +} GUI_Axis2; + +typedef enum { + GUI_LAYOUT_NONE, + GUI_LAYOUT_HORIZONTAL, + GUI_LAYOUT_VERTICAL, +} GUI_Layout_Direction; + +typedef struct GUI_Node { + #define RDIC_GUI_NODE_MEMBER_NAME rdic_node + RDIC_Node rdic_node; + GUI_Style *style; + GUI_String text_string; // Optional. + int text_width, text_height; // Optional. Initialized by lazy_init and cached. + Pixel_Buffer *image; + + GUI_String debug_string; + + // NOTE(Zelaven): Useful for tab-navigation and other non-mouse navigation. + GUI_Layout_Direction layout_direction; + GUI_Size semantic_size[GUI_AXIS2_COUNT]; + // TODO(Zelaven): This needs a better name. + // True iff. it (and its children) should generate draw commands. + bool dirty; + + int computed_size[GUI_AXIS2_COUNT]; + GUI_Rectangle rect; // NOTE(Zelaven): I have no better name for this. +} GUI_Node; +#define GUI_NODE_PARENT(node) ((GUI_Node*)(node)->rdic_node.parent) +#define GUI_NODE_SIBLING(node) ((GUI_Node*)(node)->rdic_node.sibling) +#define GUI_NODE_FIRST_CHILD(node) ((GUI_Node*)(node)->rdic_node.first_child) + + + +typedef struct { + GUI_Rectangle rectangle; + GUI_Color color; + GUI_Color border_color; + int border_thickness; + unsigned char roundedness; + GUI_String text; + Pixel_Buffer *image; +} GUI_Draw_Command; + +typedef struct GUI_Subtree GUI_Subtree; +struct GUI_Subtree { + RDIC_Context rdic; + GUI_Subtree *prev; + GUI_Subtree *next; + GUI_Subtree *structural_parent; + + RDIC_Node_Reference relative_to; + GUI_Draw_Command *first_draw_command; + int num_draw_commands; + Pixel_Buffer *pixel_buffer; +}; + + +typedef struct { + //RDIC_Context rdic; + + GUI_Subtree *first_subtree; + GUI_Subtree *last_subtree; + GUI_Subtree *current_subtree; + + RDIC_Node_Reference focused_node; + RDIC_Node_Reference hovered_node; + RDIC_Node_Reference top_node_under_cursor; + int mouse_pressed; + int mouse_down; + int mouse_x; + int mouse_y; + + // TODO: An allocator for the nodes. + RDIC_Node *node_freelist; + + Memory_Arena *draw_command_arena; + int num_draw_commands; +} GUI_Context; + + + + + +// --- + +#if 0 +void print_node_tree(GUI_Node *node, int level) +{ + for(int i = 0; i < level; i++) + { + printf("-"); + } + + GUI_String text = node->debug_string; + printf(" %.*s\n", text.length, text.cstring); + + GUI_Node *child = node->rdic_node.first_child; + while(child != NULL) + { + print_node_tree(child, level+1); + child = child->rdic_node.sibling; + } +} +#endif + +// --- + + +// NOTE(Zelaven): This won't be used, but it will stay around as a reference for +// the technique. +#if 0 +#define GUIWITH_INNER2(token) defer ## token +#define GUIWITH_INNER(token) GUIWITH_INNER2(token) +/* + * NOTE(Zelaven): This is a "defer loop" macro, fitted as a "with" construct. + * What it is used for is temporarily overwriting a value, keeping the original + * value safe in a loop-local variable. + * The operation functions by declaring the loop variable of an anonymous struct + * type, which contains the temporary variable as well as the actual loop + * variable. + * The temporary is initialized with the contents of the stored value, which is + * then overwritten with the "with" value, and at the end of the loop the + * stored value is restored to contain the contents of the temporary. + * It is important to note that for this to operate correctly, the temporary + * needs to be filled out before the stored value is overwritten, which is + * dependent on the ORDER OF THE STRUCT MEMBERS. + * This is because the overwriting of the stored value is done in the + * initialization of the loop variable part of the struct, and the members are + * initialized in member order, not initializer declaration order. + * I tested this, but both are arranged in the desired order for both reading + * and in the case that it proves to be compiler-dependent. + * (Note that it appears to be consistent across optimization flags) +*/ +#define GUIWITH(storage_variable, TYPE, value_to_use)\ +for(struct {TYPE temp; int i;} GUIWITH_INNER(__LINE__) = {.temp=(storage_variable), .i = ((storage_variable) = (value_to_use), 0)}; !GUIWITH_INNER(__LINE__).i; GUIWITH_INNER(__LINE__).i += 1, ((storage_variable) = GUIWITH_INNER(__LINE__).temp)) + +#define GUI_WITH_REDNESS(context, value) GUIWITH(context->style.red, unsigned char, value) +#define GUI_WITH_BLUENESS(context, value) GUIWITH(context->style.blue, unsigned char, value) +#define GUI_WITH_GREENNESS(context, value) GUIWITH(context->style.green, unsigned char, value) +#define GUI_WITH_STYLE(context, value) GUIWITH(context->style, GUI_Style, value) + +#define GUI_WITH_BORDER_COLOR(context, value) GUIWITH((context)->style.border_color, GUI_Color, (value)) +#define GUI_WITH_BORDER_THICKNESS(context, value) GUIWITH((context)->style.border_thickness, int, (value)) +#define GUI_WITH_ROUNDEDNESS(context, value) GUIWITH((context)->style.roundedness, unsigned char, (value)) + +void fff(GUI_Context *context) +{ + GUI_WITH_REDNESS(context, 222) + printf("%d\n", context->style.red); + GUI_Style style = (GUI_Style){2,2,2,0,0,0}; + GUI_WITH_STYLE(context, style) + GUI_WITH_STYLE(context, ((GUI_Style){2,2,2,0,0,0})) + printf("%d\n", context->style.red); +} +#endif + + + + +// --- + + +// TODO(Zelaven): The mouse coordinates are in the context, so no need to pass +// them as parameters. +#undef ENABLE_DEBUG +#define ENABLE_DEBUG 0 +void gui_apply_input( + GUI_Context *context, + int mouse_x, + int mouse_y) +{ + //GUI_Node *top_node_under_cursor = (GUI_Node*)context->rdic.root; + GUI_Node *top_node_under_cursor = (GUI_Node*)context->first_subtree->rdic.root; + GUI_Node *current_node = (GUI_Node*)top_node_under_cursor->rdic_node.first_child; + int mouse_over_node = 0; + while(current_node != NULL) + { + mouse_over_node = point_in_rect(mouse_x, mouse_y, current_node->rect); + if(mouse_over_node) + { + top_node_under_cursor = current_node; + current_node = (GUI_Node*)current_node->rdic_node.first_child; + } + else + { + current_node = (GUI_Node*)current_node->rdic_node.sibling; + } + } + + context->top_node_under_cursor.node = &top_node_under_cursor->rdic_node; + context->top_node_under_cursor.generation = + top_node_under_cursor->rdic_node.generation; + DEBUG("Top node under cursor: %.*s\n", + top_node_under_cursor->debug_string.length, + top_node_under_cursor->debug_string.cstring); +} + + +RDIC_Node_Reference gui_get_node( + GUI_Context *context, + RDIC_Node_Reference last_reference, + GUI_Layout_Direction direction, + GUI_Style *style, + GUI_Size size[static 2]) +{ + int get_node_flags = 0; + RDIC_Node_Reference new_reference = + rdic_get_node(&context->current_subtree->rdic, last_reference, &get_node_flags); + GUI_Node *node = (GUI_Node*)new_reference.node; + node->layout_direction = direction; + node->style = style; + node->semantic_size[GUI_AXIS2_X] = size[GUI_AXIS2_X]; + node->semantic_size[GUI_AXIS2_Y] = size[GUI_AXIS2_Y]; + + // TODO(Zelaven): + // get_node_flags & RDIC_GET_NODE__OUT_OF_FREELIST + // ^ This should result in an attempt to allocate more nodes for the freelist. + // Then rdic_get_node should be retried. + + if(get_node_flags & RDIC_GET_NODE__NODES_COLLECTED) + { + GUI_NODE_PARENT(node)->dirty = true; + } + if(get_node_flags & RDIC_GET_NODE__NODE_ALLOCATED) + { + GUI_NODE_PARENT(node)->dirty = true; + } + node->dirty = (get_node_flags & RDIC_GET_NODE__NODE_ALLOCATED) != 0; + + + return new_reference; +} + +#undef ENABLE_DEBUG +#define ENABLE_DEBUG 0 +// TODO(Zelaven): Make this cause redrawing of root on parameter change. +// Maybe an explicit parameter so it can be based on received events? +// Such as expose events, resize events, etc. +// May also be a good idea because struct-comparing styles each frame wouldn't +// be good for performance, so a force-redraw bool sounds like an always-good +// option. That way you can force-dirty the root when you make a style change, +// but it could also be added at other granularity. +// Or should it be something that is done by just setting +// ref.node->dirty = true? +// That is one option, specifying the dirty flag as a part of the API itself. +// I think I like that option. +RDIC_Node_Reference gui_context_start_frame( + GUI_Context *context, + RDIC_Node_Reference last_root_reference, + int width, int height, + GUI_Layout_Direction layout_direction, + GUI_Style *style) +{ + //context->frame_current_node = context->root; + context->num_draw_commands = 0; + memory_arena_reset(context->draw_command_arena); + + DEBUG("%s: %d %d %d %d\n", __func__, + context->mouse_x, context->mouse_y, + context->mouse_pressed, context->mouse_down); + + static GUI_Subtree background_subtree = {0}; + background_subtree.rdic.node_freelist = context->node_freelist; + context->first_subtree = &background_subtree; + context->last_subtree = &background_subtree; + context->current_subtree = &background_subtree; + + RDIC_Node_Reference new_root_reference = rdic_context_start_frame( + &background_subtree.rdic, + last_root_reference); + GUI_Node *root = (GUI_Node*)new_root_reference.node; + root->dirty = false; + if(!gui_node_references_equal(last_root_reference, new_root_reference)) { + root->dirty = true; + } + if(layout_direction != root->layout_direction) { + root->dirty = true; + } + + gui_apply_input(context, context->mouse_x, context->mouse_y); + + root->debug_string = GUI_STRING("root"); + root->layout_direction = layout_direction; + root->semantic_size[GUI_AXIS2_X] = (GUI_Size) + {.size_rule = GUI_SIZERULE_PIXELS, .value = width, .strictness = 100,}; + root->semantic_size[GUI_AXIS2_Y] = (GUI_Size) + {.size_rule = GUI_SIZERULE_PIXELS, .value = height, .strictness = 100,}; + root->style = style; + + return new_root_reference; +} +void gui_context_finish_frame( + GUI_Context *context) +{ + rdic_context_finish_frame(&context->first_subtree->rdic); + context->node_freelist = context->first_subtree->rdic.node_freelist; +} + +RDIC_Node_Reference gui_push_subtree( + GUI_Context *context, + GUI_Subtree *subtree, + RDIC_Node_Reference last_root_reference, + GUI_Layout_Direction layout_direction, + GUI_Style *style, + GUI_Size size[static 2], + RDIC_Node_Reference relative_to) +{ + context->node_freelist = context->current_subtree->rdic.node_freelist; + subtree->rdic.node_freelist = context->node_freelist; + + context->last_subtree->next = subtree; + subtree->prev = context->last_subtree; + context->last_subtree = subtree; + + subtree->structural_parent = context->current_subtree; + context->current_subtree = subtree; + subtree->relative_to = relative_to; + + RDIC_Node_Reference new_root_reference = rdic_context_start_frame( + &subtree->rdic, + last_root_reference); + GUI_Node *root = (GUI_Node*)new_root_reference.node; + root->dirty = false; + if(!gui_node_references_equal(last_root_reference, new_root_reference)) { + root->dirty = true; + } + if(layout_direction != root->layout_direction) { + root->dirty = true; + } + + root->debug_string = GUI_STRING("gui_push_subtree"); + root->layout_direction = layout_direction; + root->semantic_size[GUI_AXIS2_X] = size[GUI_AXIS2_X]; + root->semantic_size[GUI_AXIS2_Y] = size[GUI_AXIS2_Y]; + root->style = style; + + return new_root_reference; +} + +void gui_pop_subtree( + GUI_Context *context) +{ + context->node_freelist = context->current_subtree->rdic.node_freelist; + context->current_subtree = context->current_subtree->structural_parent; + context->current_subtree->rdic.node_freelist = context->node_freelist; +} + + +void gui_push_parent( + GUI_Context *context, + RDIC_Node_Reference parent) +{ + rdic_push_parent(&context->current_subtree->rdic, parent); +} + +void gui_pop_parent( + GUI_Context *context) +{ + rdic_pop_parent(&context->current_subtree->rdic); +} + + + +// --- + +void gui_layout_calculate_standalone_sizes( + GUI_Node *node, + GUI_Axis2 axis) +{ + switch(node->semantic_size[axis].size_rule) + { + case GUI_SIZERULE_PIXELS: + { + node->computed_size[axis] = node->semantic_size[axis].value; + } break; + case GUI_SIZERULE_TEXTCONTENT: + { + // TODO(Zelaven): Calculate text width. + node->computed_size[axis] = 0; + } break; + default: + { + //assert(!"Non-standalone size passed to calculate_standalone_sizes."); + } break; + } + if(node->rdic_node.first_child != NULL) { + gui_layout_calculate_standalone_sizes(GUI_NODE_FIRST_CHILD(node), axis); + } + if(node->rdic_node.sibling != NULL) { + gui_layout_calculate_standalone_sizes(GUI_NODE_SIBLING(node), axis); + } +} +void gui_layout_calculate_parent_percent_sizes( + GUI_Node *node, + GUI_Axis2 axis) +{ + if(node->semantic_size[axis].size_rule == GUI_SIZERULE_PERCENTOFPARENT) + { + int percentage = node->semantic_size[axis].value; + node->computed_size[axis] = + (GUI_NODE_PARENT(node)->computed_size[axis] * percentage) / 100; + } + if(node->rdic_node.first_child != NULL) { + gui_layout_calculate_parent_percent_sizes(GUI_NODE_FIRST_CHILD(node), axis); + } + if(node->rdic_node.sibling != NULL) { + gui_layout_calculate_parent_percent_sizes(GUI_NODE_SIBLING(node), axis); + } +} + +void gui_layout_calculate_screen_rects( + GUI_Node *node, + int x, int y, + GUI_Layout_Direction layout_direction) +{ + int width = node->computed_size[GUI_AXIS2_X]; + int height = node->computed_size[GUI_AXIS2_Y]; + node->rect = (GUI_Rectangle){x, y, x+width, y+height}; + if(node->rdic_node.first_child != NULL) { + gui_layout_calculate_screen_rects( + GUI_NODE_FIRST_CHILD(node), x, y, node->layout_direction); + } + if(node->rdic_node.sibling != NULL) { + int sibling_x = x; + int sibling_y = y; + if(layout_direction == GUI_LAYOUT_HORIZONTAL) + { + sibling_x += width; + } + if(layout_direction == GUI_LAYOUT_VERTICAL) + { + sibling_y += height; + } + gui_layout_calculate_screen_rects( + GUI_NODE_SIBLING(node), sibling_x, sibling_y, layout_direction); + } +} + +void gui_layout_nodes(GUI_Node *root) +{ + //GUI_Node *root = (GUI_Node*)context->first_subtree->rdic.root; + for(GUI_Axis2 axis = 0; axis < GUI_AXIS2_COUNT; axis++) + { + gui_layout_calculate_standalone_sizes(root, axis); + gui_layout_calculate_parent_percent_sizes(root, axis); + } + gui_layout_calculate_screen_rects(root, 0, 0, GUI_LAYOUT_NONE); +} + + +// --- + + +#undef ENABLE_DEBUG +#define ENABLE_DEBUG 0 +void gui_generate_draw_commands_inner( + int x_offset, + int y_offset, + GUI_Node *node, + bool dirty, //TODO(Zelaven): Better name. + Memory_Arena *draw_command_arena, + int *out_num_draw_commands) +{ + DEBUG("%.*s: dirtiness: %b\n", + node->debug_string.length, node->debug_string.cstring, dirty); + if(dirty) { + GUI_Draw_Command *draw_command = + arena_allocate_draw_command(draw_command_arena); + DEBUG("%d, %d, %d, %x, %d, %u\n", node->style->red, node->style->green, node->style->blue, node->style->border_color, node->style->border_thickness, node->style->roundedness); + *draw_command = (GUI_Draw_Command){ + .rectangle = node->rect, + .color = node->style->red<<16 | node->style->green<<8 | node->style->blue, + .border_color = node->style->border_color, + .border_thickness = node->style->border_thickness, + .roundedness = node->style->roundedness, + .text = node->text_string, + .image = node->image, + }; + (*draw_command).rectangle.x0 += x_offset; + (*draw_command).rectangle.x1 += x_offset; + (*draw_command).rectangle.y0 += y_offset; + (*draw_command).rectangle.y1 += y_offset; + *out_num_draw_commands += 1; + } + + GUI_Node *sibling = GUI_NODE_SIBLING(node); + if(sibling != NULL) { + gui_generate_draw_commands_inner( + x_offset, y_offset, + sibling, + dirty || sibling->dirty, + draw_command_arena, out_num_draw_commands); + } + GUI_Node *first_child = GUI_NODE_FIRST_CHILD(node); + if(node->rdic_node.first_child != NULL) { + gui_generate_draw_commands_inner( + x_offset, y_offset, + first_child, + dirty || first_child->dirty, + draw_command_arena, out_num_draw_commands); + } +} + +void gui_generate_draw_commands( + //GUI_Node *root, + GUI_Subtree *subtree, + Memory_Arena *draw_command_arena, + int *out_num_draw_commands) +{ + // TODO(Zelaven): Test reference validity. + // TODO(Zelaven): This probably can be done once and passed in. + int x_offset = 0; + int y_offset = 0; + GUI_Node *relative_node = (GUI_Node*)subtree->relative_to.node; + if(relative_node != NULL){ + GUI_Rectangle *relative_rectangle = &relative_node->rect; + x_offset = relative_rectangle->x0; + y_offset = relative_rectangle->y0; + //printf("%.*s: %d, %d\n", relative_node->debug_string.length, relative_node->debug_string.cstring, x_offset, y_offset); + } + + GUI_Node *root = (GUI_Node*)subtree->rdic.root; + assert(root != NULL); + assert(draw_command_arena != NULL); + assert(out_num_draw_commands != NULL); + *out_num_draw_commands = 0; + memory_arena_reset(draw_command_arena); + gui_generate_draw_commands_inner( + x_offset, y_offset, + root, root->dirty, + draw_command_arena, out_num_draw_commands); +} + + + +// --- + + + + +RDIC_Node_Reference gui_layout( + GUI_Context *context, + RDIC_Node_Reference last_reference, + GUI_Layout_Direction direction, + GUI_Style *style, + GUI_Size size[static 2]) +{ + RDIC_Node_Reference new_reference = gui_get_node( + context, last_reference, direction, style, size); + GUI_Node *node = (GUI_Node*)new_reference.node; + node->text_string = (GUI_String){0}; + node->debug_string = GUI_STRING("gui_layout"); + return new_reference; +} + + +// --- + + +RDIC_Node_Reference gui_dumb_block( + GUI_Context *context, + RDIC_Node_Reference last_reference, + GUI_Style *style, + GUI_Size size[static 2]) +{ + RDIC_Node_Reference new_reference = gui_get_node( + context, last_reference, GUI_LAYOUT_NONE, style, size); + GUI_Node *node = (GUI_Node*)new_reference.node; + node->text_string = (GUI_String){0}; + node->debug_string = GUI_STRING("gui_dumb_block"); + return new_reference; +} + +#undef ENABLE_DEBUG +#define ENABLE_DEBUG 0 +bool gui_dumb_button( + GUI_Context *context, + RDIC_Node_Reference *last_reference, + GUI_String text, + GUI_Style *style, + GUI_Size size[static 2]) +{ + RDIC_Node_Reference new_reference = gui_get_node( + context, *last_reference, GUI_LAYOUT_NONE, style, size); + GUI_Node *node = (GUI_Node*)new_reference.node; + node->debug_string = text; + node->text_string = text; + + bool clicked = false; + if(gui_node_references_equal( + new_reference, context->top_node_under_cursor)) + { + DEBUG("%.*s: reference is the top node under cursor.\n", + text.length, text.cstring); + if(context->mouse_pressed) + { + DEBUG(" Mouse pressed on node\n"); + context->focused_node = new_reference; + } + else if(!context->mouse_down) + { + DEBUG(" Mouse released on node\n"); + if(gui_node_references_equal(new_reference, context->focused_node)) + { + DEBUG(" Mouse released over same node as pressed\n"); + context->focused_node.node = NULL; + clicked = true; + } + } + } + else if(gui_node_references_equal(new_reference, context->focused_node) + && !context->mouse_down) + { + context->focused_node.node = NULL; + } + + *last_reference = new_reference; + return clicked; +} + +#undef ENABLE_DEBUG +#define ENABLE_DEBUG 0 +bool gui_slider( + GUI_Context *context, + RDIC_Node_Reference *last_reference, + RDIC_Node_Reference *inner_box_reference, + float *value, + GUI_Style *background_style, + GUI_Style *bar_style, + GUI_Size size[static 2]) +{ + RDIC_Node_Reference new_reference = gui_get_node( + context, *last_reference, GUI_LAYOUT_NONE, background_style, size); + GUI_Node *node = (GUI_Node*)new_reference.node; + node->debug_string = GUI_STRING("gui_slider"); + node->text_string = (GUI_String){0}; + + // NOTE(Zelaven): We need a handle to this node, but we set its values later. + gui_push_parent(context, new_reference); + RDIC_Node_Reference new_inner_reference = gui_get_node( + context, *inner_box_reference, GUI_LAYOUT_NONE, bar_style, size); + + bool value_changed = false; + bool new_ref_is_top = gui_node_references_equal( + new_reference, context->top_node_under_cursor); + bool inner_ref_is_top = gui_node_references_equal( + new_inner_reference, context->top_node_under_cursor); + DEBUG("%p\n | %p %p\n | %p %p\n", + context->top_node_under_cursor.node, + last_reference->node, inner_box_reference->node, + new_reference.node, new_inner_reference.node); + if(new_ref_is_top || inner_ref_is_top) + { + DEBUG("\n%s: reference is the top node under cursor.\n", __func__); + if(context->mouse_pressed) + { + DEBUG(" Mouse pressed on node\n"); + context->focused_node = new_reference; + } + else if(!context->mouse_down) + { + DEBUG(" Mouse released on node\n"); + if(gui_node_references_equal(new_reference, context->focused_node)) + { + DEBUG(" Mouse released over same node as pressed\n"); + context->focused_node.node = NULL; + } + } + } + else if(gui_node_references_equal(new_reference, context->focused_node) + && !context->mouse_down) + { + context->focused_node.node = NULL; + } + + int last_frame_width = node->computed_size[GUI_AXIS2_X]; + if(gui_node_references_equal(new_reference, context->focused_node)) + { + if(last_frame_width == 0.0f) + { + DEBUG( + " last_frame_width is 0." + " This shouldn't really happen as the user shouldn't be able to focus" + " a node that hasn't been displayed on the screen yet." + " Not going to change the slider value."); + } + else + { + int offset_x = context->mouse_x - node->rect.x0; + float before_value = *value; + float new_value = ((float)offset_x) / ((float)last_frame_width); + if(new_value < 0.0f) + { + new_value = 0.0f; + } + else if(new_value >= 1.0f) + { + new_value = 1.0f; + } + *value = new_value; + DEBUG(" Value before: %f - Value after: %f\n", before_value, *value); + value_changed = (before_value != new_value); + } + } + + // NOTE(Zelaven): Modified by input, so handle input first. + GUI_Node *inner = (GUI_Node*)new_inner_reference.node; + inner->debug_string = GUI_STRING("gui_slider - inner node"); + inner->text_string = (GUI_String){0}; + assert(*value <= 1.0f); + inner->semantic_size[GUI_AXIS2_X].value = last_frame_width*(*value); + gui_pop_parent(context); + + + *last_reference = new_reference; + *inner_box_reference = new_inner_reference; + if(value_changed) {node->dirty = true;} + return value_changed; +} + + + + + +// --- + + + +void test_gui( + GUI_Context *context, + GUI_Rectangle full_gui_rectangle) +{ + static float border_thickness = 0; + float last_border_thickness = border_thickness; + + + + static GUI_Style root_style = {42, 24, 88, 0,0,0}; + static GUI_Style dumb_button_style = {88, 24, 42, 0,0,0}; + static GUI_Size dumb_button_size[2] = { + {GUI_SIZERULE_PIXELS, 42, 100}, + {GUI_SIZERULE_PIXELS, 24, 100}}; + static GUI_Style other_dumb_button_style = {24, 42, 88, 0x0000ffff,0,0}; + + static RDIC_Node_Reference root = {0}; + root = gui_context_start_frame( + context, root, + full_gui_rectangle.x1-full_gui_rectangle.x0, + full_gui_rectangle.y1-full_gui_rectangle.y0, + GUI_LAYOUT_HORIZONTAL, + &root_style); + + static RDIC_Node_Reference dumb_button = {0}; + if(my_bool) + if(gui_dumb_button( + context, + &dumb_button, + GUI_STRING("My Dumb Button"), + &dumb_button_style, + dumb_button_size)) + { + printf( + "**************\n" + "*** BUTTON ***\n" + "**************\n"); + border_thickness += 1; + if(border_thickness > 21) border_thickness = 21; + printf("border_thickness: %f\n", border_thickness); + my_bool = false; + ((GUI_Node*)root.node)->dirty = true; + } + static RDIC_Node_Reference dumb_button2 = {0}; + if(gui_dumb_button( + context, + &dumb_button2, + GUI_STRING("My Other Dumb Button"), + &other_dumb_button_style, + dumb_button_size)) + { + printf( + "**************\n" + "*** OTHER ***\n" + "**************\n" + ); + border_thickness -= 1; + if(border_thickness < 0) border_thickness = 0; + printf("border_thickness: %f\n", border_thickness); + my_bool = true; + } + + if(my_bool) + { + static GUI_Style layout_style = {100, 0, 100,0,0,0}; + static GUI_Size layout_size[2] = { + {GUI_SIZERULE_PIXELS, 400, 100}, + {GUI_SIZERULE_PIXELS, 400, 100}}; + static RDIC_Node_Reference layout = {0}; + layout = gui_layout( + context, layout, GUI_LAYOUT_VERTICAL, &layout_style, layout_size); + gui_push_parent(context, layout); + + // static variables can be used for isolated styles that: + // 1) are only used within the current scope. + // 2) don't need to be changed at runtime. + static GUI_Style inner_block_2_style = {200, 253, 235, 0,0,0}; + static GUI_Style inner_block_3_style = {235, 253, 200, 0,0,0}; + static GUI_Style inner_block_4_style = {0 , 0, 0, 0,0,0}; + static RDIC_Node_Reference dumb_block2 = {0}; + dumb_block2 = gui_dumb_block( + context, + dumb_block2, + &inner_block_2_style, + dumb_button_size); + static RDIC_Node_Reference dumb_block3 = {0}; + dumb_block3 = gui_dumb_block( + context, + dumb_block3, + &inner_block_3_style, + dumb_button_size); + static RDIC_Node_Reference dumb_block4 = {0}; + dumb_block4 = gui_dumb_block( + context, + dumb_block4, + &inner_block_4_style, + dumb_button_size); + static RDIC_Node_Reference dumb_button3 = {0}; + if(gui_dumb_button( + context, + &dumb_button3, + GUI_STRING("Inner Dumb Button"), + &dumb_button_style, + dumb_button_size)) + { + printf( + "**************\n" + "*** INNER ***\n" + "**************\n" + ); + } + static GUI_Size dumb_block5_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 42, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 24, 100}}; + static RDIC_Node_Reference dumb_block5 = {0}; + dumb_block5 = gui_dumb_block( + context, + dumb_block5, + &inner_block_4_style, + dumb_block5_size); + gui_pop_parent(context); + } + + static GUI_Style slider_background = {0, 0, 0, 0,0,0}; + static GUI_Style slider_bar = {255, 0, 0, 0,0,0}; + static GUI_Size slider_size[2] = { + {GUI_SIZERULE_PIXELS, 100, 100}, + {GUI_SIZERULE_PIXELS, 40, 100}}; + static RDIC_Node_Reference slider = {0}; + static RDIC_Node_Reference slider_inner = {0}; + static float slider_value = 0.25f; + //slider_bar.blue = 255 * slider_value; + //slider_value += 0.01f; + //if(slider_value >= 1.0f) slider_value = 0.5f; + // NOTE(Zelaven): This line is not good because it causes jankyness when using + // the slider, and the slider behaves properly without it. + // NOTE(Zelaven): This line is actually necessary if the value is writable by + // anything other than the slider. If border_thickness is a float variable, + // then there is no issue, though. + slider_value = ((float)border_thickness) / 21.; + bool slider_value_changed = gui_slider( + context, + &slider, &slider_inner, + &slider_value, + &slider_background, + &slider_bar, + slider_size); + border_thickness = 21.*slider_value; + //printf("Slider value changed?: %b\n", slider_value_changed); + ((GUI_Node*)root.node)->dirty |= slider_value_changed; + + static GUI_Style block_after_layout_style = {99, 99, 99, 0,0,0}; + static GUI_Size block_after_layout_size[2] = { + {GUI_SIZERULE_PIXELS, 50, 100}, + {GUI_SIZERULE_PIXELS, 50, 100}}; + static RDIC_Node_Reference dumb_block_after_layout = {0}; + dumb_block_after_layout = gui_dumb_block( + context, + dumb_block_after_layout, + &block_after_layout_style, + block_after_layout_size); + + static GUI_Style my_style = {100, 100, 0, 0, 3, 0}; + static GUI_Size dumb_block_size[2] = { + {GUI_SIZERULE_PIXELS, 50, 100}, + {GUI_SIZERULE_PIXELS, 100, 100}, + }; + my_style.border_thickness = border_thickness; + static RDIC_Node_Reference new_style_gui_dumb_block = {0}; + new_style_gui_dumb_block = gui_dumb_block( + context, + new_style_gui_dumb_block, + &my_style, + dumb_block_size); + + other_dumb_button_style.border_thickness = border_thickness; + if(border_thickness != last_border_thickness) { + ((GUI_Node*)root.node)->dirty = true; + } + gui_context_finish_frame(context); +} + + +// Text field at the top, 4x4 button grid below. +// See the nuklear example calculator? +void test_gui__calculator( + GUI_Context *context, + GUI_Rectangle full_gui_rectangle) +{ + (void)full_gui_rectangle; + + static GUI_Style root_style = {0x44,0x44,0x44, 0x00999999,2,0}; + static GUI_Style button_style = {0x33,0x33,0x33, 0x00999999,2,25}; + static GUI_Size button_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 25, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}}; + static GUI_Style row_style = {0x44,0x44,0x44, 0,0,0}; + static GUI_Size row_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 25, 100}}; + + static RDIC_Node_Reference root = {0}; + root = gui_context_start_frame( + context, root, + //full_gui_rectangle.x1-full_gui_rectangle.x0, + //full_gui_rectangle.y1-full_gui_rectangle.y0, + 300, 400, + GUI_LAYOUT_VERTICAL, + &root_style); + +#if 1 + static RDIC_Node_Reference rows[4] = {0}; + static RDIC_Node_Reference buttons[4][4] = {0}; + GUI_String button_labels[4][4] = { + {GUI_STRING("1"), GUI_STRING("2"), GUI_STRING("3"), GUI_STRING("+")}, + {GUI_STRING("4"), GUI_STRING("5"), GUI_STRING("6"), GUI_STRING("-")}, + {GUI_STRING("7"), GUI_STRING("8"), GUI_STRING("9"), GUI_STRING("*")}, + {GUI_STRING("C"), GUI_STRING("0"), GUI_STRING("="), GUI_STRING("/")}, + }; + for(size_t row = 0; row < ARRAYLENGTH(rows); row++) + { + rows[row] = gui_layout( + context, rows[row], GUI_LAYOUT_HORIZONTAL, &row_style, row_size); + gui_push_parent(context, rows[row]); + for(size_t i = 0; i < ARRAYLENGTH(buttons[0]); i++) + { + if(gui_dumb_button( + context, &buttons[row][i], + button_labels[row][i], + &button_style, button_size)) + { + GUI_String button_label = button_labels[row][i]; + printf("%.*s\n", button_label.length, button_label.cstring); + } + } + gui_pop_parent(context); + } +#else + static RDIC_Node_Reference row1 = {0}; + row1 = gui_layout2( + context, row1, GUI_LAYOUT_HORIZONTAL, &row_style, row_size); + gui_push_parent(context, row1); + static RDIC_Node_Reference row1_buttons[4] = {0}; + char *row1_button_labels[4] = {"1", "2", "3", "+"}; + for(size_t i = 0; i < ARRAYLENGTH(row1_buttons); i++) + { + if(gui_dumb_button( + context, &row1_buttons[i], + row1_button_labels[i], + &button_style, button_size)) + { + printf("%s\n", row1_button_labels[i]); + } + } + gui_pop_parent(context); +#endif + + + gui_context_finish_frame(context); +} + + +void test_gui__scrollbars( + GUI_Context *context, + GUI_Rectangle full_gui_rectangle) +{ + (void)full_gui_rectangle; + + static GUI_Style root_style = {0x44,0x44,0x44, 0x00999999,2,0}; + static GUI_Style element_style = {0,0x33,0x33, 0x00009999,2,0}; + static GUI_Size element_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PIXELS, 100, 100}}; + static GUI_Style outer_style = {0x33,0x33,0x33, 0x00999999,2,0}; + static GUI_Size top_bottom_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 25, 100}}; + static GUI_Size middle_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 50, 100}}; + static GUI_Size side_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 25, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}}; + static GUI_Size center_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 50, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}}; + + static RDIC_Node_Reference root = {0}; + root = gui_context_start_frame( + context, root, + full_gui_rectangle.x1-full_gui_rectangle.x0, + full_gui_rectangle.y1-full_gui_rectangle.y0, + //300, 400, + GUI_LAYOUT_VERTICAL, + &root_style); + + + static RDIC_Node_Reference top = {0}; + static RDIC_Node_Reference middle = {0}; + static RDIC_Node_Reference bottom = {0}; + + top = gui_dumb_block(context, top, &outer_style, top_bottom_size); + + middle = gui_layout( + context, middle, GUI_LAYOUT_HORIZONTAL, &outer_style, middle_size); + gui_push_parent(context, middle); { + static RDIC_Node_Reference left = {0}; + static RDIC_Node_Reference center = {0}; + static RDIC_Node_Reference right = {0}; + + left = gui_dumb_block(context, left, &outer_style, side_size); + center = gui_dumb_block(context, center, &outer_style, center_size); + gui_push_parent(context, center); { + static RDIC_Node_Reference scrollbox_layout = {0}; + static GUI_Size full_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}}; + scrollbox_layout = gui_layout( + context, scrollbox_layout, GUI_LAYOUT_HORIZONTAL, &outer_style, full_size); + + gui_push_parent(context, scrollbox_layout); { + static RDIC_Node_Reference scrollregion_layout = {0}; + static RDIC_Node_Reference scrollbar_layout = {0}; + static GUI_Size scrollregion_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 90, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}}; + static GUI_Size scrollbar_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 10, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}}; + scrollregion_layout = gui_layout( + context, scrollregion_layout, GUI_LAYOUT_VERTICAL, + &outer_style, scrollregion_size); + gui_push_parent(context, scrollregion_layout); { + static RDIC_Node_Reference elements[6] = {0}; + for(size_t i = 0; i < ARRAYLENGTH(elements); i++) + { + elements[i] = gui_dumb_block( + context, elements[i], &element_style, element_size); + } + } gui_pop_parent(context); + scrollbar_layout = gui_layout( + context, scrollbar_layout, GUI_LAYOUT_VERTICAL, + &outer_style, scrollbar_size); + float scroll_position = 0.75f; + int spacer_total = 90; + int spacer_upper = scroll_position * spacer_total; + int spacer_lower = spacer_total - spacer_upper; + gui_push_parent(context, scrollbar_layout); { + static GUI_Size bar_knob_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 10, 100}}; + // NOTE(Zelaven): These sizes are unique to each scrollbar. + static GUI_Size bar_upper_spacer_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 0, 100}}; + static GUI_Size bar_lower_spacer_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 90, 100}}; + bar_upper_spacer_size[GUI_AXIS2_Y].value = spacer_upper; + bar_lower_spacer_size[GUI_AXIS2_Y].value = spacer_lower; + + static RDIC_Node_Reference scrollbar_upper_spacer = {0}; + static RDIC_Node_Reference scrollbar_knob = {0}; + static RDIC_Node_Reference scrollbar_lower_spacer = {0}; + scrollbar_upper_spacer = gui_dumb_block( + context, scrollbar_upper_spacer, &outer_style, bar_upper_spacer_size); + scrollbar_knob = gui_dumb_block( + context, scrollbar_knob, &outer_style, bar_knob_size); + scrollbar_lower_spacer = gui_dumb_block( + context, scrollbar_lower_spacer, &outer_style, bar_lower_spacer_size); + } gui_pop_parent(context); // scrollbar_layout. + #if 0 + float contents_height_ratio = 0.0f; + if(scrollbox_layout.node->computed_size[GUI_AXIS2_Y] > 0) { + float layout_height = + (float)scrollbox_layout.node->computed_size[GUI_AXIS2_Y]; + float contents_height = 600.0f; // TODO(Zelaven): take from scrollregion_layout. (dependency on CHILDRENSUM). + } + #endif + } gui_pop_parent(context); // scrollbox_layout. + } gui_pop_parent(context); // center. + right = gui_dumb_block(context, right, &outer_style, side_size); + } gui_pop_parent(context); // middle. + + bottom = gui_dumb_block(context, bottom, &outer_style, top_bottom_size); + + + gui_context_finish_frame(context); +} + +void test_gui__draw_command_using_sliders( + GUI_Context *context, + GUI_Rectangle full_gui_rectangle) +{ + //static float border_thickness = 0; + + static GUI_Style root_style = {42, 24, 88, 0,0,0}; + static RDIC_Node_Reference root = {0}; + root = gui_context_start_frame( + context, root, + full_gui_rectangle.x1-full_gui_rectangle.x0, + full_gui_rectangle.y1-full_gui_rectangle.y0, + GUI_LAYOUT_VERTICAL, + &root_style); + + static GUI_Size layout_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 50, 100}}; + static RDIC_Node_Reference layout = {0}; + layout = gui_layout( + context, layout, GUI_LAYOUT_VERTICAL, &root_style, layout_size); + gui_push_parent(context, layout); + { + static GUI_Style slider_background = {0, 0, 0, 0,0,0}; + static GUI_Style slider_bar = {255, 0, 0, 0,0,0}; + static GUI_Size slider_size[2] = { + {GUI_SIZERULE_PIXELS, 200, 100}, + {GUI_SIZERULE_PIXELS, 40, 100}}; + static RDIC_Node_Reference slider = {0}; + static RDIC_Node_Reference slider_inner = {0}; + + static GUI_Style button_style = {200, 0, 0, 0,5,0}; + static GUI_Size button_size[2] = { + {GUI_SIZERULE_PIXELS, 100, 100}, + {GUI_SIZERULE_PIXELS, 40, 100}}; + + static GUI_Style slider_spacer_style = {99, 99, 99, 0,0,0}; + static GUI_Size slider_spacer_size[2] = { + {GUI_SIZERULE_PIXELS, 200, 100}, + {GUI_SIZERULE_PIXELS, 5, 100}}; + + static GUI_Style button_spacer_style = {99, 99, 99, 0,0,0}; + static GUI_Size button_spacer_size[2] = { + {GUI_SIZERULE_PIXELS, 5, 100}, + {GUI_SIZERULE_PIXELS, 40, 100}}; + + static GUI_Size row_layout_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PIXELS, 40, 100}}; + + static RDIC_Node_Reference row1_layout = {0}; + row1_layout = gui_layout( + context, row1_layout, GUI_LAYOUT_HORIZONTAL, &root_style, row_layout_size); +#if 1 + gui_push_parent(context, row1_layout); + { + static float slider_value = 0.25f; + // NOTE(Zelaven): This line is not good because it causes jankyness when + // using the slider, and the slider behaves properly without it. + // NOTE(Zelaven): This line is actually necessary if the value is writable + // by anything other than the slider. If border_thickness is a float + // variable, then there is no issue, though. + slider_value = ((float)border_thickness) / 51.; + gui_slider(context, &slider, &slider_inner, + &slider_value, &slider_background, &slider_bar, slider_size); + border_thickness = 51.*slider_value; + + static RDIC_Node_Reference spacer1 = {0}; + spacer1 = gui_dumb_block( + context, spacer1, &button_spacer_style, button_spacer_size); + + static RDIC_Node_Reference button_thickness_down = {0}; + if(gui_dumb_button(context, &button_thickness_down, + GUI_STRING("-"), &button_style, button_size)) + { + border_thickness -= 1; + printf("-\n"); + } + + static RDIC_Node_Reference spacer2 = {0}; + spacer2 = gui_dumb_block( + context, spacer2, &button_spacer_style, button_spacer_size); + + static RDIC_Node_Reference button_thickness_up = {0}; + if(gui_dumb_button(context, &button_thickness_up, + GUI_STRING("+"), &button_style, button_size)) + { + border_thickness += 1; + printf("+\n"); + } + } + gui_pop_parent(context); +#endif + + static RDIC_Node_Reference slider_spacer = {0}; + slider_spacer = gui_dumb_block( + context, slider_spacer, &slider_spacer_style, slider_spacer_size); + + static RDIC_Node_Reference slider2 = {0}; + static RDIC_Node_Reference slider2_inner = {0}; + static float slider2_value = 0.25f; + slider2_value = ((float)roundedness) / 100.; + gui_slider(context, &slider2, &slider2_inner, + &slider2_value, &slider_background, &slider_bar, slider_size); + roundedness = 100.*slider2_value; + } + gui_pop_parent(context); + + + gui_context_finish_frame(context); +} + + +void test_gui__subtree( + GUI_Context *context, + GUI_Rectangle full_gui_rectangle) +{ + static GUI_Style root_style = {0x44,0x44,0x44, 0x00999999,2,0}; + static GUI_Style element_style = {0,0x33,0x33, 0x00009999,2,0}; + static GUI_Size element_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PIXELS, 100, 100}}; + static GUI_Style outer_style = {0x33,0x33,0x33, 0x00999999,2,0}; + static GUI_Size top_bottom_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 25, 100}}; + static GUI_Size middle_size[2] = { + {GUI_SIZERULE_PERCENTOFPARENT, 100, 100}, + {GUI_SIZERULE_PERCENTOFPARENT, 50, 100}}; + static GUI_Size test_size[2] = { + {GUI_SIZERULE_PIXELS, 200, 100}, + {GUI_SIZERULE_PIXELS, 600, 100}}; + + static RDIC_Node_Reference root = {0}; + root = gui_context_start_frame( + context, root, + full_gui_rectangle.x1-full_gui_rectangle.x0, + full_gui_rectangle.y1-full_gui_rectangle.y0, + GUI_LAYOUT_VERTICAL, + &root_style); + + + static RDIC_Node_Reference top = {0}; + static RDIC_Node_Reference middle = {0}; + static RDIC_Node_Reference bottom = {0}; + + static float slider_value = 0.25f; + top = gui_layout( + context, top, GUI_LAYOUT_HORIZONTAL, &outer_style, top_bottom_size); + gui_push_parent(context, top); + { + static GUI_Style slider_background = {0, 0, 0, 0,0,0}; + static GUI_Style slider_bar = {255, 0, 0, 0,0,0}; + static GUI_Size slider_size[2] = { + {GUI_SIZERULE_PIXELS, 200, 100}, + {GUI_SIZERULE_PIXELS, 40, 100}}; + static RDIC_Node_Reference slider = {0}; + static RDIC_Node_Reference slider_inner = {0}; + // NOTE(Zelaven): This line is not good because it causes jankyness when + // using the slider, and the slider behaves properly without it. + // NOTE(Zelaven): This line is actually necessary if the value is writable + // by anything other than the slider. If border_thickness is a float + // variable, then there is no issue, though. + gui_slider(context, &slider, &slider_inner, + &slider_value, &slider_background, &slider_bar, slider_size); + } gui_pop_parent(context); // middle. + + middle = gui_dumb_block(context, middle, &outer_style, middle_size); + + static GUI_Subtree middle_subtree = {0}; + static RDIC_Node_Reference middle_subtree_root = {0}; + middle_subtree_root = gui_push_subtree( + context, &middle_subtree, middle_subtree_root, + GUI_LAYOUT_VERTICAL, &element_style, test_size, middle); + { + static GUI_Color test_image_pixels[10*10] = { + 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, + ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, + 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, + ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, + 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, + ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, + 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, + ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, + 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, + ~0, 0, ~0, 0, ~0, 0, ~0, 0, ~0, 0, + }; + static Pixel_Buffer test_image = { + .pixels = test_image_pixels, + .width = 10, + .height = 10, + }; + static RDIC_Node_Reference inner_top = {0}; + inner_top = gui_dumb_block(context, inner_top, &outer_style, element_size); + ((GUI_Node*)inner_top.node)->image = &test_image; + } gui_pop_subtree(context); + + bottom = gui_dumb_block(context, bottom, &outer_style, top_bottom_size); + + + gui_context_finish_frame(context); +} + + +#if 0 +void test_gui_layout( + GUI_Context *context, + GUI_Rectangle full_gui_rectangle) +{ + static RDIC_Node_Reference root = {0}; + root = gui_context_start_frame( + context, root, + full_gui_rectangle.x1-full_gui_rectangle.x0, + full_gui_rectangle.y1-full_gui_rectangle.y0, + GUI_LAYOUT_HORIZONTAL); + + static RDIC_Node_Reference dumb_block = {0}; +#if 0 + dumb_block = gui_dumb_block( + context, + dumb_block, + (GUI_Style){255, 0, 0,0,0,0}, + 50, 50); +#else + if(gui_dumb_button( + context, &dumb_block, "BEFORE Button", (GUI_Style){255, 0, 0,0,0,0}, 50, 50)) + {printf( + "**************\n" + "*** BEFORE ***\n" + "**************\n");} +#endif + + static RDIC_Node_Reference layout = {0}; + layout = gui_layout( + context, + layout, + GUI_LAYOUT_VERTICAL); + gui_push_parent(context, layout); + + static RDIC_Node_Reference dumb_block2 = {0}; +#if 0 + dumb_block2 = gui_dumb_block( + context, + dumb_block2, + (GUI_Style){0, 255, 0,0,0,0}, + 100, 50); +#else + if(gui_dumb_button( + context, &dumb_block2, "INSIDE Button", (GUI_Style){0, 255, 0,0,0,0}, 100, 50)) + {printf( + "**************\n" + "*** INSIDE ***\n" + "**************\n");} +#endif + + gui_pop_parent(context); + + static RDIC_Node_Reference dumb_block3 = {0}; +#if 0 + dumb_block_after_layout = gui_dumb_block( + context, + dumb_block3, + (GUI_Style){0, 0, 255,0,0,0}, + 150, 50); +#else + if(gui_dumb_button( + context, &dumb_block3, "AFTER Button", (GUI_Style){0, 0, 255,0,0,0}, 150, 50)) + {printf( + "**************\n" + "*** AFTER ***\n" + "**************\n");} +#endif + + gui_context_finish_frame(context); +} +#endif + +// --- +// --- +// --- + +#include +#include +#include + +#define WINDOW_WIDTH 800 +#define WINDOW_HEIGHT 600 +typedef struct X11_Window { + Display *display; + Window root; + Visual *visual; + Colormap colormap; + XWindowAttributes window_attributes; + XSetWindowAttributes set_window_attributes; + Window window; + GC graphics_context; + int screen; + unsigned int width; + unsigned int height; + XImage *screen_image; + + Pixel_Buffer pixel_buffer; +} X11_Window; + + +#include +#include +#include +#include +noreturn void die(const char *fmt, ...) +{ + va_list args; + va_start(args, fmt); + vfprintf(stderr, fmt, args); + va_end(args); + exit(EXIT_FAILURE); +} + +void print_binary_long(long value) +{ + int num_bits = sizeof(long)*8; + unsigned long mask = ((unsigned long)1) << (num_bits-1); + while(mask != (unsigned long)0) + { + int bit = (value & mask) != 0; + printf("%d", bit); + mask >>= 1; + } +} + + +void fill_pixel_buffer( + uint32_t *pixels, + unsigned int width, + unsigned int height, + uint8_t red_offset, + uint8_t blue_offset) +{ + for(unsigned int column = 0; column < width; column++) + { + for(unsigned int row = 0; row < height; row++) + { + uint8_t red = (uint8_t)((column+ red_offset) & 0xFF); + uint8_t blue = (uint8_t)((row +blue_offset) & 0xFF); + pixels[column + row*width] = (red<<16) | blue; + } + } +} +void draw_pixel_buffer( + unsigned int width, + unsigned int height, + Display *game_display, + Window game_window, + XImage *game_image, + GC x_graphics_context) +{ + /* + int XPutImage(Display *display, Drawable d, GC gc, XImage *image, int src_x, int src_y, int + dest_x, int dest_y, unsigned int width, unsigned int height); + */ + + int error = XPutImage( + game_display, + game_window, + x_graphics_context, + game_image, + 0, 0, + 0, 0, + width, height); + assert(error == 0); +} + +typedef unsigned int uint; +void draw_rect( + uint32_t *pixels, + unsigned int width, + unsigned int height, + uint x0, uint y0, uint x1, uint y1, + uint32_t color) +{ + //x0 = x0 < 0 ? 0 : x0; + //y0 = y0 < 0 ? 0 : y0; + x1 = x1 > width ? width : x1; + y1 = y1 > width ? height : y1; + + for(unsigned int column = x0; column < x1; column++) + { + for(unsigned int row = y0; row < y1; row++) + { + pixels[column + row*width] = color; + } + } +} + + + + + +void draw_rect2( + Pixel_Buffer *pixel_buffer, + GUI_Draw_Command *draw_command) +{ + int width = pixel_buffer->width; + int height = pixel_buffer->height; + + int x0 = draw_command->rectangle.x0; + int y0 = draw_command->rectangle.y0; + int x1 = draw_command->rectangle.x1; + int y1 = draw_command->rectangle.y1; + x0 = x0 < 0 ? 0 : x0; + y0 = y0 < 0 ? 0 : y0; + x1 = x1 > width ? width : x1; + y1 = y1 > width ? height : y1; + + for(int column = x0; column < x1; column++) + { + for(int row = y0; row < y1; row++) + { + pixel_buffer->pixels[column + row*width] = draw_command->color; + } + } +} + +void draw_rect3( + Pixel_Buffer *pixel_buffer, + GUI_Rectangle rectangle, + GUI_Color color) +{ + int width = pixel_buffer->width; + int height = pixel_buffer->height; + + int x0 = rectangle.x0; + int y0 = rectangle.y0; + int x1 = rectangle.x1; + int y1 = rectangle.y1; + x0 = x0 < 0 ? 0 : x0; + y0 = y0 < 0 ? 0 : y0; + x1 = x1 > width ? width : x1; + y1 = y1 > width ? height : y1; + + for(int column = x0; column < x1; column++) + { + for(int row = y0; row < y1; row++) + { + pixel_buffer->pixels[column + row*width] = color; + } + } +} + +#define SET_PIXEL(pixel_buffer, x, y, color) (pixel_buffer)->pixels[(y)*(pixel_buffer)->width + (x)] = (color) +#define GET_PIXEL(pixel_buffer, x, y) (pixel_buffer)->pixels[(y)*(pixel_buffer)->width + (x)] + +void test_draw_horizontal_pixel_line( + Pixel_Buffer *pixel_buffer, + int x0, int x1, int y, + GUI_Color color) +{ + for(int i = x0; i < x1; i++) + { + SET_PIXEL(pixel_buffer, i, y, color); + } +} +void test_draw_vertical_pixel_line( + Pixel_Buffer *pixel_buffer, + GUI_Color color, + int x, int y0, int y1) +{ + for(int i = y0; i < y1; i++) + { + SET_PIXEL(pixel_buffer, x, i, color); + } +} +// NOTE(Zelaven): Based on the technique and code for drawing circles +// showcased by Casey here: +// https://www.computerenhance.com/p/efficient-dda-circle-outlines +void gui_draw_rounded_rect( + Pixel_Buffer *pixel_buffer, + GUI_Draw_Command *draw_command) +{ + int roundedness = draw_command->roundedness; + // NOTE(Zelaven): Roundedness is a function of width and height, whichever + // is smaller. + int width = draw_command->rectangle.x1 - draw_command->rectangle.x0; + int height = draw_command->rectangle.y1 - draw_command->rectangle.y0; + short r = 0; + { + int shortest_dimension = width < height ? width : height; + r = (shortest_dimension * roundedness) / 200; + } + + int Cx = draw_command->rectangle.x0+r; + int Cy = draw_command->rectangle.y0+r; + int R = r; + int R2, X, Y, dY, dX, D; + // TODO(Zelaven): Remove this static limit. + assert(R < 500); + // NOTE(Zelaven): Both of these are used to cache calculations. + // NOTE(Zelaven): This one is also used to prevent redrawing the same pixels. + int Y_to_X_map[500]; + int Y_to_X_map2[500]; +#if 0 + for(size_t i = 0; i < ARRAYLENGTH(Y_to_X_map); i++) + { + Y_to_X_map[i] = -1; + Y_to_X_map2[i] = -1; + } +#endif + //printf("\n\n"); + R2 = R+R; + Y = R; X = 0; + dX = -2; + dY = R2+R2 - 4; + D = R2 - 1; + + while(X <= Y) + { + //printf("X=%d, Y=%d\n", X, Y); + //setPixel(Cx - X, Cy - Y); + Y_to_X_map[Y] = X; + //setPixel(Cx - X, Cy + Y); + //setPixel(Cx + X, Cy - Y); + //setPixel(Cx + X, Cy + Y); + //setPixel(Cx - Y, Cy - X); + Y_to_X_map2[X] = Y; + //setPixel(Cx - Y, Cy + X); + //setPixel(Cx + Y, Cy - X); + //setPixel(Cx + Y, Cy + X); + + D += dX; + dX -= 4; + ++X; + + // NOTE(casey): Branchless version + int Mask = (D >> 31); + D += dY & Mask; + dY -= 4 & Mask; + Y += Mask; + } + //SET_PIXEL(pixel_buffer, draw_command->rectangle.x0, draw_command->rectangle.y0, draw_command->border_color); + //SET_PIXEL(pixel_buffer, draw_command->rectangle.x1-1, draw_command->rectangle.y1-1, draw_command->border_color); + + // top. + int top_y0 = Cy - R; + int top_y1 = Cy - Y; + //int top_height = top_y1 - top_y0; + for(int y = top_y0; y < top_y1; y++) + { + int Y_ = Cy - y; + int X_ = Y_to_X_map[Y_]; + //printf("X_: %d\n", X_); + test_draw_horizontal_pixel_line( + pixel_buffer, + Cx - X_, draw_command->rectangle.x1 - R + X_, y, + draw_command->color); + } + + // lower. + int lower_y0 = Cy - Y; + int lower_y1 = Cy; + //int lower_height = lower_y1 - lower_y0; + //printf("lower: %d to %d\n", lower_y0, lower_y1); + for(int y = lower_y0; y < lower_y1; y++) + { + int Y_ = Cy - y; + int X_ = Y_to_X_map2[Y_]; + //printf("X_: %d\n", X_); + test_draw_horizontal_pixel_line( + pixel_buffer, + Cx - X_, draw_command->rectangle.x1 - R + X_, y, + draw_command->color); + } + + // middle. + GUI_Rectangle middle = draw_command->rectangle; + middle.y0 = middle.y0 + r; + middle.y1 -= r; + draw_rect3(pixel_buffer, middle, draw_command->color); + int middle_height = middle.y1-middle.y0; + int Cy1 = Cy + middle_height - 1; + + // lower. + lower_y0 = Cy1 +1; + lower_y1 = Cy1 + Y +1; + //printf("lower: %d = %d = %d - %d\n", lower_height, lower_y1 - lower_y0, lower_y1, lower_y0); + for(int y = lower_y0; y < lower_y1; y++) + { + int Y_ = y - Cy1; + int X_ = Y_to_X_map2[Y_]; + //printf("X_: %d\n", X_); + test_draw_horizontal_pixel_line( + pixel_buffer, + Cx - X_, draw_command->rectangle.x1 - R + X_, y, + draw_command->color); + } + + // top. + top_y0 = Cy1 + Y +1; + top_y1 = Cy1 + R +1; + //printf("top: %d = %d = %d - %d\n", top_height, top_y1 - top_y0, top_y1, top_y0); + for(int y = top_y0; y < top_y1; y++) + { + int Y_ = y - Cy1; + int X_ = Y_to_X_map[Y_]; + //printf("X_: %d\n", X_); + test_draw_horizontal_pixel_line( + pixel_buffer, + Cx - X_, draw_command->rectangle.x1 - R + X_, y, + draw_command->color); + } +} +void gui_draw_rounded_rect_with_border( + Pixel_Buffer *pixel_buffer, + GUI_Draw_Command *draw_command) +{ + int width = draw_command->rectangle.x1 - draw_command->rectangle.x0; + int height = draw_command->rectangle.y1 - draw_command->rectangle.y0; + int roundedness = draw_command->roundedness; + int border_thickness = draw_command->border_thickness; + if(border_thickness > (height+1)/2) border_thickness = (height+1)/2; + //printf("\n\n"); + //printf("border_thickness: %d\n", border_thickness); + // NOTE(Zelaven): Roundedness is a function of width and height, whichever + // is smaller. + short r = 0; + { + int shortest_dimension = width < height ? width : height; + r = (shortest_dimension * roundedness) / 200; + } + + int Cx = draw_command->rectangle.x0+r; + int Cy = draw_command->rectangle.y0+r; + int R = r; + int R2, X, Y, dY, dX, D; + // TODO(Zelaven): Remove this static limit. + assert(R < 500); + // NOTE(Zelaven): Both of these are used to cache calculations. + // NOTE(Zelaven): This one is also used to prevent redrawing the same pixels. + int Y_to_X_map[500]; + int Y_to_X_map2[500]; +#if 1 + for(size_t i = 0; i < ARRAYLENGTH(Y_to_X_map); i++) + { + Y_to_X_map[i] = -1; + Y_to_X_map2[i] = -1; + } +#endif + { + //printf("\n\n"); + R2 = R+R; + Y = R; X = 0; + dX = -2; + dY = R2+R2 - 4; + D = R2 - 1; + + while(X <= Y) + { + //printf("X=%d, Y=%d\n", X, Y); + //setPixel(Cx - X, Cy - Y); + Y_to_X_map[Y] = X; + //setPixel(Cx - X, Cy + Y); + //setPixel(Cx + X, Cy - Y); + //setPixel(Cx + X, Cy + Y); + //setPixel(Cx - Y, Cy - X); + Y_to_X_map2[X] = Y; + //setPixel(Cx - Y, Cy + X); + //setPixel(Cx + Y, Cy - X); + //setPixel(Cx + Y, Cy + X); + //if((Cx - X) == (Cx - Y) && (Cy - Y)==(Cy - X)) + // printf("SAMENESS: X: %d , Y: %d\n", X, Y); + + D += dX; + dX -= 4; + ++X; + + // NOTE(casey): Branchless version + int Mask = (D >> 31); + D += dY & Mask; + dY -= 4 & Mask; + Y += Mask; + } + } + //printf("R: %d , X: %d , Y: %d\n", R, X, Y); + + // inner circle. + int R_inner = r - border_thickness; + int R2_inner, X_inner, Y_inner, dY_inner, dX_inner, D_inner; + assert(R_inner < 500); + // NOTE(Zelaven): Both of these are used to cache calculations. + // NOTE(Zelaven): This one is also used to prevent redrawing the same pixels. + int Y_to_X_map_inner[500]; + int Y_to_X_map2_inner[500]; +#if 1 + for(size_t i = 0; i < ARRAYLENGTH(Y_to_X_map_inner); i++) + { + Y_to_X_map_inner[i] = -1; + Y_to_X_map2_inner[i] = -1; + } +#endif + { + //printf("\n\n"); + R2_inner = R_inner+R_inner; + Y_inner = R_inner; X_inner = 0; + dX_inner = -2; + dY_inner = R2_inner+R2_inner - 4; + D_inner = R2_inner - 1; + + while(X_inner <= Y_inner) + { + //printf("X_inner=%d, Y_inner=%d\n", X_inner, Y_inner); + Y_to_X_map_inner[Y_inner] = X_inner; + Y_to_X_map2_inner[X_inner] = Y_inner; + //if((Cx - X_inner) == (Cx - Y_inner) && (Cy - Y_inner)==(Cy - X_inner)) + // printf("SAMENESS: X: %d , Y: %d\n", X_inner, Y_inner); + + D_inner += dX_inner; + dX_inner -= 4; + ++X_inner; + + // NOTE(casey): Branchless version + int Mask = (D_inner >> 31); + D_inner += dY_inner & Mask; + dY_inner -= 4 & Mask; + Y_inner += Mask; + } + } + //printf("R_inner: %d , X_inner: %d , Y_inner: %d\n", R_inner, X_inner, Y_inner); + + // Drawing. + int y_ = draw_command->rectangle.y0; + int rect_x0 = draw_command->rectangle.x0; + int rect_x1 = draw_command->rectangle.x1; + int draw_guide_lines = 0; + int border_y = y_ + border_thickness; + +#if 0 +- top1 : upper octant of outer, above inner. +- top2 : upper octant of outer, upper octant of inner. +- lower1: lower octant of outer, above inner. + Happens when border is thicker than height of outer-upper-octant. +- lower2: lower octant of outer, upper octant of inner. +- lower3: lower octant of outer, lower octant of inner. +#endif + + // top1. + int top1_y0 = Cy-R; + int top1_ycap = Cy-Y; + //printf("%d %d\n", border_y, top1_ycap); + int top1_y1 = top1_ycap < border_y ? top1_ycap : border_y; + for(int top1_y = top1_y0; top1_y < top1_y1; top1_y++) + { + int Y_ = Cy - top1_y; + int X_ = Y_to_X_map[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, top1_y); + //printf("X_: %d\n", X_); + test_draw_horizontal_pixel_line( + pixel_buffer, + Cx - X_, rect_x1 - R + X_, top1_y, + draw_command->border_color); + } + if(draw_guide_lines)test_draw_horizontal_pixel_line( + pixel_buffer, + rect_x0, rect_x1, Cy - top1_ycap-1, + 0x00ffffff); + + // top2. + int top2_y0 = Cy-R_inner; + int top2_y1 = Cy - Y; + for(int top2_y = top2_y0; top2_y < top2_y1; top2_y++) + { + int Y_ = Cy - top2_y; + int X_ = Y_to_X_map[Y_]; + int X_inn = Y_to_X_map_inner[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, top2_y); + //printf("X_: %d , X_inn: %d\n", X_, X_inn); + test_draw_horizontal_pixel_line(pixel_buffer, + Cx - X_, Cx - X_inn, top2_y, + draw_command->border_color); + test_draw_horizontal_pixel_line(pixel_buffer, + Cx - X_inn, rect_x1 - R + X_inn, top2_y, + draw_command->color); + test_draw_horizontal_pixel_line(pixel_buffer, + rect_x1 - R + X_inn, rect_x1 - R + X_, top2_y, + draw_command->border_color); + } + if(draw_guide_lines)test_draw_horizontal_pixel_line( + pixel_buffer, + rect_x0, rect_x1, top2_y1, + 0x00ffffff); + + // lower1. + int lower1_y0 = Cy - Y; + int lower1_y1 = border_y; + if(border_y > Cy) lower1_y1 = Cy; + for(int lower1_y = lower1_y0; lower1_y < lower1_y1; lower1_y++) + { + int Y_ = Cy - lower1_y; + int X_ = Y_to_X_map2[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, lower1_y); + //printf("X_: %d\n", X_); + test_draw_horizontal_pixel_line(pixel_buffer, + Cx - X_, rect_x1 - R + X_, lower1_y, + draw_command->border_color); + } + if(draw_guide_lines)test_draw_horizontal_pixel_line( + pixel_buffer, + draw_command->rectangle.x0, draw_command->rectangle.x1, lower1_y1, + 0x00ffffff); + + // lower2. + int lower2_y0 = Cy - Y; + if(border_y > lower2_y0) lower2_y0 = border_y; + if(Y_inner < 0) Y_inner = 0; // Will happen if border_thickness > R. + int lower2_y1 = Cy - Y_inner; + for(int lower2_y = lower2_y0; lower2_y < lower2_y1; lower2_y++) + { + int Y_ = Cy - lower2_y; + int X_ = Y_to_X_map2[Y_]; + int X_inn = Y_to_X_map_inner[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, lower2_y); + //printf("X_: %d , X_inn: %d\n", X_, X_inn); + int x0 = Cx - X_; int x1 = Cx - X_inn; + int x2 = rect_x1 - R + X_inn; int x3 = rect_x1 - R + X_; + test_draw_horizontal_pixel_line( + pixel_buffer, x0, x1, lower2_y, + draw_command->border_color); + test_draw_horizontal_pixel_line( + pixel_buffer, x1, x2, lower2_y, + draw_command->color); + test_draw_horizontal_pixel_line( + pixel_buffer, x2, x3, lower2_y, + draw_command->border_color); + } + if(draw_guide_lines)test_draw_horizontal_pixel_line( + pixel_buffer, + draw_command->rectangle.x0, draw_command->rectangle.x1, lower2_y1, + 0x00ffffff); + + // lower3. + int lower3_y0 = Cy - Y_inner; + int lower3_y1 = Cy; + for(int lower3_y = lower3_y0; lower3_y < lower3_y1; lower3_y++) + { + int Y_ = Cy - lower3_y; + int X_ = Y_to_X_map2[Y_]; + int X_inn = Y_to_X_map2_inner[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, lower3_y); + //printf("X_: %d , X_inn: %d\n", X_, X_inn); + int x0 = Cx - X_; int x1 = Cx - X_inn; + int x2 = rect_x1 - R + X_inn; int x3 = rect_x1 - R + X_; + test_draw_horizontal_pixel_line( + pixel_buffer, x0, x1, lower3_y, + draw_command->border_color); + test_draw_horizontal_pixel_line( + pixel_buffer, x1, x2, lower3_y, + draw_command->color); + test_draw_horizontal_pixel_line( + pixel_buffer, x2, x3, lower3_y, + draw_command->border_color); + } + if(draw_guide_lines)test_draw_horizontal_pixel_line( + pixel_buffer, + draw_command->rectangle.x0, draw_command->rectangle.x1, lower3_y1, + 0x00ffffff); + + + // Middle section. + GUI_Rectangle middle = draw_command->rectangle; + middle.y0 = middle.y0 + r; + middle.y1 -= r; + //printf("%d %d -> %d %d\n", draw_command->rectangle.y0, draw_command->rectangle.y1, middle.y0, middle.y1); + int y = middle.y0; + for(; y < middle.y0 + border_thickness-r; y++) + { + test_draw_horizontal_pixel_line( + pixel_buffer, middle.x0, middle.x1, y, + draw_command->border_color); + } + for(; y < middle.y1 - (border_thickness-r) && y < middle.y1; y++) + { + int x = middle.x0; + for(; x < middle.x0+border_thickness && x < middle.x1; x++) + {SET_PIXEL(pixel_buffer, x, y, draw_command->border_color);} + for(; x < middle.x1-border_thickness; x++) + {SET_PIXEL(pixel_buffer, x, y, draw_command->color);} + for(; x < middle.x1; x++) + {SET_PIXEL(pixel_buffer, x, y, draw_command->border_color);} + } + for(; y < middle.y1; y++) + { + test_draw_horizontal_pixel_line( + pixel_buffer, middle.x0, middle.x1, y, + draw_command->border_color); + } + + int middle_height = middle.y1-middle.y0; + int Cy1 = Cy + middle_height -1; + border_y = draw_command->rectangle.y1 - border_thickness; + + //printf("middle_height: %d, Cy1: %d, border_y: %d\n", middle_height, Cy1, border_y); + + // top1. + { + int border_y = draw_command->rectangle.y1 - border_thickness; + int top1_y1 = Cy1+R + 1; + int top1_ycap = Cy1 + Y +1; + //int top1_y0 = 1 + (border_y > top1_ycap ? border_y : top1_ycap); + int top1_y0 = 0 + (border_y > top1_ycap ? border_y : top1_ycap); + for(int top1_y = top1_y0; top1_y < top1_y1; top1_y++) + { + int Y_ = top1_y - Cy1; + //printf("%d = %d + %d\n", Y_, Cy1, top1_y); + int X_ = Y_to_X_map[Y_]; + //printf("X_: %d\n", X_); + test_draw_horizontal_pixel_line( + pixel_buffer, + Cx - X_, rect_x1 - R + X_, top1_y, + draw_command->border_color); + } + + // top2. + int top2_y0 = Cy1 + Y +1; + int top2_y1 = Cy1+R_inner +1; + //printf("top2: %d to %d\n", top2_y0, top2_y1); + for(int top2_y = top2_y0; top2_y < top2_y1; top2_y++) + { + int Y_ = top2_y - Cy1; + int X_ = Y_to_X_map[Y_]; + int X_inn = Y_to_X_map_inner[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, top2_y); + //printf("X_: %d , X_inn: %d\n", X_, X_inn); + test_draw_horizontal_pixel_line(pixel_buffer, + Cx - X_, Cx - X_inn, top2_y, + draw_command->border_color); + test_draw_horizontal_pixel_line(pixel_buffer, + Cx - X_inn, rect_x1 - R + X_inn, top2_y, + draw_command->color); + test_draw_horizontal_pixel_line(pixel_buffer, + rect_x1 - R + X_inn, rect_x1 - R + X_, top2_y, + draw_command->border_color); + } + + // lower1. + int lower1_y0 = border_y; + int lower1_y1 = Cy1 + Y +1; + if(border_y < (Cy1+1)) lower1_y0 = Cy1+1; + for(int lower1_y = lower1_y0; lower1_y < lower1_y1; lower1_y++) + { + int Y_ = lower1_y - Cy1; + int X_ = Y_to_X_map2[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, lower1_y); + //printf("X_: %d\n", X_); + test_draw_horizontal_pixel_line(pixel_buffer, + Cx - X_, rect_x1 - R + X_, lower1_y, + draw_command->border_color); + } + + // lower2. + if(Y_inner < 0) Y_inner = 0; // Will happen if border_thickness > R. + int lower2_y0 = Cy1 + Y_inner +1; + int lower2_y1 = Cy1 + Y +1; + if(border_y < lower2_y1) lower2_y1 = border_y; + for(int lower2_y = lower2_y0; lower2_y < lower2_y1; lower2_y++) + { + int Y_ = lower2_y - Cy1; + int X_ = Y_to_X_map2[Y_]; + int X_inn = Y_to_X_map_inner[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, lower2_y); + //printf("X_: %d , X_inn: %d\n", X_, X_inn); + int x0 = Cx - X_; int x1 = Cx - X_inn; + int x2 = rect_x1 - R + X_inn; int x3 = rect_x1 - R + X_; + test_draw_horizontal_pixel_line( + pixel_buffer, x0, x1, lower2_y, + draw_command->border_color); + test_draw_horizontal_pixel_line( + pixel_buffer, x1, x2, lower2_y, + draw_command->color); + test_draw_horizontal_pixel_line( + pixel_buffer, x2, x3, lower2_y, + draw_command->border_color); + } + + // lower3. + int lower3_y0 = Cy1 +1; + int lower3_y1 = Cy1 + Y_inner+1; + for(int lower3_y = lower3_y0; lower3_y < lower3_y1; lower3_y++) + { + int Y_ = lower3_y - Cy1; + int X_ = Y_to_X_map2[Y_]; + int X_inn = Y_to_X_map2_inner[Y_]; + //printf("%d = %d - %d\n", Y_, Cy, lower3_y); + //printf("X_: %d , X_inn: %d\n", X_, X_inn); + int x0 = Cx - X_; int x1 = Cx - X_inn; + int x2 = rect_x1 - R + X_inn; int x3 = rect_x1 - R + X_; + test_draw_horizontal_pixel_line( + pixel_buffer, x0, x1, lower3_y, + draw_command->border_color); + test_draw_horizontal_pixel_line( + pixel_buffer, x1, x2, lower3_y, + draw_command->color); + test_draw_horizontal_pixel_line( + pixel_buffer, x2, x3, lower3_y, + draw_command->border_color); + } + } + if(draw_guide_lines)test_draw_horizontal_pixel_line( + pixel_buffer, + rect_x0, rect_x1, Cy - top1_ycap-1, + 0x00ffffff); + + // Debug. +#if 0 + GUI_Color white = 0x00ffffff; + {R2 = R+R;Y = R; X = 0;dX = -2;dY = R2+R2 - 4;D = R2 - 1; + while(X <= Y){ + //setPixel(Cx - X, Cy - Y); + //setPixel(Cx - X, Cy + Y + middle_height -1); + SET_PIXEL(pixel_buffer, Cx-X, Cy-Y, white); + SET_PIXEL(pixel_buffer, Cx-X, Cy+Y + middle_height -1, white); + //setPixel(Cx + X, Cy - Y); + //setPixel(Cx + X, Cy + Y); + //setPixel(Cx - Y, Cy - X); + //setPixel(Cx - Y, Cy + X + middle_height -1); + SET_PIXEL(pixel_buffer, Cx-Y, Cy-X, white); + SET_PIXEL(pixel_buffer, Cx-Y, Cy+X + middle_height -1, white); + //setPixel(Cx + Y, Cy - X); + //setPixel(Cx + Y, Cy + X); + D += dX;dX -= 4;++X; + int Mask = (D >> 31);D += dY & Mask;dY -= 4 & Mask;Y += Mask;}} + {R2_inner = R_inner+R_inner;Y_inner = R_inner; X_inner = 0;dX_inner = -2;dY_inner = R2_inner+R2_inner - 4;D_inner = R2_inner - 1; + while(X_inner <= Y_inner){ + //setPixel(Cx - X_inner, Cy - Y_inner); + //setPixel(Cx - X_inner, Cy + Y_inner + middle_height-1); + SET_PIXEL(pixel_buffer, Cx-X_inner, Cy-Y_inner, white); + SET_PIXEL(pixel_buffer, Cx-X_inner, Cy+Y_inner + middle_height-1, white); + //setPixel(Cx + X_inner, Cy - Y_inner); + //setPixel(Cx + X_inner, Cy + Y_inner); + //setPixel(Cx - Y_inner, Cy - X_inner); + //setPixel(Cx - Y_inner, Cy + X_inner + middle_height-1); + SET_PIXEL(pixel_buffer, Cx-Y_inner, Cy-X_inner, white); + SET_PIXEL(pixel_buffer, Cx-Y_inner, Cy+X_inner + middle_height-1, white); + //setPixel(Cx + Y_inner, Cy - X_inner); + //setPixel(Cx + Y_inner, Cy + X_inner); + D_inner += dX_inner;dX_inner -= 4;++X_inner; + int Mask = (D_inner >> 31);D_inner += dY_inner & Mask;dY_inner -= 4 & Mask;Y_inner += Mask;}} + + { + printf("%%%%%%%%%%%%%%%%%%%%\n"); + GUI_Color red = 0x00ff4444; + GUI_Color cyan = 0x0000ffff; + GUI_Color yellow = 0x00ffff00; + int x_ = draw_command->rectangle.x0 + R; + int y_ = draw_command->rectangle.y0; + + int Y_ = Y + 1; + + printf("rect corner: x: %d, y: %d\n", x_ -R, y_); + printf("R: %d, R_inner: %d, Cx: %d, Cy: %d\n", R, R_inner, Cx, Cy); + printf("Y: %d, Y_: %d, Y_inner: %d\n", Y, Y_, Y_inner); + + SET_PIXEL(pixel_buffer, Cx, Cy, white); + + if(0)test_draw_horizontal_pixel_line( + pixel_buffer, draw_command->rectangle.x0, draw_command->rectangle.x1, + Cy-Y, + 0x00ffffff); + int top1_height, top2_height, lower1_height, lower2_height, lower3_height; + { + // top1. + int border_y = y_ + border_thickness; + int top1_y0 = Cy-R; + int top1_y = Cy-Y; + //printf("%d %d\n", border_y, top1_y); + int top1_y1 = top1_y < border_y ? top1_y : border_y; + top1_height = top1_y1 - top1_y0; //debug. + test_draw_vertical_pixel_line(pixel_buffer, cyan, + x_, top1_y0, top1_y1); + + // top2. + int top2_y0 = Cy-R_inner; + int top2_y1 = Cy - Y; + top2_height = top2_y1 - top2_y0; // debug. + test_draw_vertical_pixel_line(pixel_buffer, red, + x_+1, top2_y0, top2_y1); + + // lower1. + int lower1_y0 = Cy - Y; + int lower1_y1 = border_y; + if(border_y > Cy) lower1_y1 = Cy; + lower1_height = lower1_y1 - lower1_y0; //debug. + test_draw_vertical_pixel_line(pixel_buffer, yellow, + x_+2, lower1_y0, lower1_y1); + + // lower2. + int lower2_y0 = Cy - Y; + if(border_y > lower2_y0) lower2_y0 = border_y; + if(Y_inner < 0) Y_inner = 0; // Will happen if border_thickness > R. + int lower2_y1 = Cy - Y_inner; + lower2_height = lower2_y1 - lower2_y0; //debug. + //printf("lower2: %d %d\n", lower2_y0, lower2_y1); + test_draw_vertical_pixel_line(pixel_buffer, red, + x_+3, lower2_y0, lower2_y1); + + // lower3. + int lower3_y0 = Cy - Y_inner; + int lower3_y1 = Cy; + lower3_height = lower3_y1 - lower3_y0; //debug. + test_draw_vertical_pixel_line(pixel_buffer, cyan, + x_+4, lower3_y0, lower3_y1); + } + + + if(0)test_draw_horizontal_pixel_line( + pixel_buffer, draw_command->rectangle.x0, draw_command->rectangle.x1, + Cy1+Y, + 0x00ffffff); + { + int Cy1 = Cy + middle_height -1; + printf("Cy1: %d\n", Cy1); + SET_PIXEL(pixel_buffer, Cx, Cy1, white); + // top1. + int border_y = draw_command->rectangle.y1 - border_thickness; + int top1_y1 = Cy1+R+1; + int top1_ycap = Cy1 + Y +1; + //int top1_y0 = 1 + (border_y > top1_ycap ? border_y : top1_ycap); + int top1_y0 = 0 + (border_y > top1_ycap ? border_y : top1_ycap); + //printf("%d %d\n", border_y, top1_y); + if((top1_y1 - top1_y0) != top1_height) printf("top1 height error.\n"); + test_draw_vertical_pixel_line(pixel_buffer, cyan, + x_, top1_y0, top1_y1); + + // top2. + int top2_y0 = Cy1 + Y +1; + int top2_y1 = Cy1+R_inner+1; + if((top2_y1 - top2_y0) != top2_height) printf("top2 height error.\n"); + test_draw_vertical_pixel_line(pixel_buffer, red, + x_+1, top2_y0, top2_y1); + + // lower1. + int lower1_y0 = border_y; + int lower1_y1 = Cy1 + Y +1; + if(border_y < (Cy1+1)) lower1_y0 = Cy1+1; + if((lower1_y1 - lower1_y0) != lower1_height) printf("lower1 height error.\n"); + test_draw_vertical_pixel_line(pixel_buffer, yellow, + x_+2, lower1_y0, lower1_y1); + + // lower2. + if(Y_inner < 0) Y_inner = 0; // Will happen if border_thickness > R. + int lower2_y0 = Cy1 + Y_inner +1; + int lower2_y1 = Cy1 + Y +1; + if(border_y < lower2_y1) lower2_y1 = border_y; + //printf("lower2: %d %d\n", lower2_y0, lower2_y1); + if((lower2_y1 - lower2_y0) != lower2_height) printf("lower2 height error.\n"); + test_draw_vertical_pixel_line(pixel_buffer, red, + x_+3, lower2_y0, lower2_y1); + + // lower3. + int lower3_y0 = Cy1 +1; + int lower3_y1 = Cy1 + Y_inner+1; + if((lower3_y1 - lower3_y0) != lower3_height) printf("lower3 height error.\n"); + test_draw_vertical_pixel_line(pixel_buffer, cyan, + x_+4, lower3_y0, lower3_y1); + } + + + test_draw_vertical_pixel_line(pixel_buffer, cyan, + draw_command->rectangle.x0+80, y_, y_+border_thickness); + test_draw_vertical_pixel_line(pixel_buffer, red, + draw_command->rectangle.x0+90, y_, y_+height); + } +#endif +} + +void gui_draw_rect( + Pixel_Buffer *pixel_buffer, + GUI_Draw_Command *draw_command) +{ + if(draw_command->roundedness == 0) + { + // TODO(Zelaven) Don't double-draw on the space covered by the inner + // rectangle. + draw_rect3( + pixel_buffer, draw_command->rectangle, draw_command->border_color); + GUI_Rectangle inner = draw_command->rectangle; + inner.x0 += draw_command->border_thickness; + inner.y0 += draw_command->border_thickness; + inner.x1 -= draw_command->border_thickness; + inner.y1 -= draw_command->border_thickness; + if(inner.x0 < inner.x1 && inner.y0 < inner.y1) + { + draw_rect3(pixel_buffer, inner, draw_command->color); + } + } + else + { + if(draw_command->border_thickness == 0) + { + gui_draw_rounded_rect(pixel_buffer, draw_command); + } + else + { + gui_draw_rounded_rect_with_border(pixel_buffer, draw_command); + } + } +} + + +int init_x11( + X11_Window *xwindow) +{ + xwindow->display = XOpenDisplay(NULL); + if(xwindow->display == NULL) + { + return EXIT_FAILURE; + } + + xwindow->root = DefaultRootWindow(xwindow->display); + xwindow->screen = XDefaultScreen(xwindow->display); + xwindow->visual = XDefaultVisual(xwindow->display, xwindow->screen); + xwindow->colormap = XCreateColormap( + xwindow->display, xwindow->root, xwindow->visual, AllocNone); + xwindow->set_window_attributes.colormap = xwindow->colormap; + xwindow->set_window_attributes.event_mask = + StructureNotifyMask | ExposureMask | KeyPressMask | KeyReleaseMask | + ButtonPressMask | ButtonReleaseMask | ButtonMotionMask | + Button1MotionMask | Button3MotionMask | + Button4MotionMask | Button5MotionMask | + PointerMotionMask | KeymapStateMask | EnterWindowMask | LeaveWindowMask; + xwindow->window = XCreateWindow( + xwindow->display, xwindow->root, 0, 0, WINDOW_WIDTH, WINDOW_HEIGHT, 0, + XDefaultDepth(xwindow->display, xwindow->screen), InputOutput, + xwindow->visual, CWEventMask | CWColormap, &xwindow->set_window_attributes); + + #if 0 + XSelectInput( + xwindow->display, + xwindow->window, + StructureNotifyMask | KeyPressMask | KeyReleaseMask | + ButtonPressMask | ButtonReleaseMask | ButtonMotionMask); + #endif + + XStoreName(xwindow->display, xwindow->window, "X11 Test Program"); + XMapWindow(xwindow->display, xwindow->window); + XGetWindowAttributes( + xwindow->display, xwindow->window, &xwindow->window_attributes); + xwindow->width = (unsigned int)xwindow->window_attributes.width; + xwindow->height = (unsigned int)xwindow->window_attributes.height; + +#if 0 + printf("Initial window dimensions: %u x %u\n", xwindow->width, xwindow->height); + printf("Window depth: %d\n", xwindow->window_attributes.depth); + printf("ALL Event mask: %lx\n", xwindow->window_attributes.all_event_masks); + print_binary_long(xwindow->window_attributes.all_event_masks); printf("\n"); + printf("YOUR Event mask: %lx\n", xwindow->window_attributes.your_event_mask); + print_binary_long(xwindow->window_attributes.your_event_mask); printf("\n"); +#endif + + // TODO: This is an experiment. +#if 0 + { + int display_width = XDisplayWidth(xwindow->display, xwindow->screen); + int display_height = XDisplayHeight(xwindow->display, xwindow->screen); + int display_width_mm = XDisplayWidthMM(xwindow->display, xwindow->screen); + int display_height_mm = XDisplayHeightMM(xwindow->display, xwindow->screen); + printf("Display Resolution: %d, %d.\n", display_width, display_height); + printf("Display Size: %d, %d.\n", display_width_mm, display_height_mm); + printf("Display DPmm: %d, %d.\n", + display_width / display_width_mm, + display_height / display_height_mm); + printf("Display DPI: %d, %d.\n", + display_width / ((display_width_mm*10)/254), + display_height / ((display_height_mm*10)/254)); + + Screen *screen = XScreenOfDisplay(xwindow->display, xwindow->screen); + int screen_width = XWidthOfScreen(screen); + int screen_height = XHeightOfScreen(screen); + int screen_width_mm = XWidthMMOfScreen(screen); + int screen_height_mm = XHeightMMOfScreen(screen); + printf("Screen Resolution: %d, %d.\n", screen_width, screen_height); + printf("Screen Size: %d, %d.\n", screen_width_mm, screen_height_mm); + printf("Screen DPmm: %d, %d.\n", + screen_width / screen_width_mm, + screen_height / screen_height_mm); + printf("Screen DPI: %d, %d.\n", + screen_width / ((screen_width_mm*10)/254), + screen_height / ((screen_height_mm*10)/254)); + } +#endif + // . + + +#if 0 + XSelectInput( + xwindow->display, + xwindow->window, + StructureNotifyMask | KeyPressMask | KeyReleaseMask | + ButtonPressMask | ButtonReleaseMask | ButtonMotionMask); +#endif + + + + // Discard everything preceding the MapNotify event that tells us that we + // have been properly mapped. + // This requires StructureNotifyMask to be selected. + // https://tronche.com/gui/x/xlib-tutorial/2nd-program-anatomy.html + { + XEvent e; + e.type = 0; + assert(MapNotify != 0); + while(e.type != MapNotify) + { + XNextEvent(xwindow->display, &e); + } + } + + // Re-get in case the window manager decides to instantiate the window with a + // different size than the one we ask for. + XGetWindowAttributes( + xwindow->display, xwindow->window, &xwindow->window_attributes); + xwindow->width = (unsigned int)xwindow->window_attributes.width; + xwindow->height = (unsigned int)xwindow->window_attributes.height; + +#if 0 + printf("Window dimensions: %u x %u\n", xwindow->width, xwindow->height); + printf("Window depth: %d\n", xwindow->window_attributes.depth); + printf("ALL Event mask: %lx\n", xwindow->window_attributes.all_event_masks); + print_binary_long(xwindow->window_attributes.all_event_masks); printf("\n"); + printf("YOUR Event mask: %lx\n", xwindow->window_attributes.your_event_mask); + print_binary_long(xwindow->window_attributes.your_event_mask); printf("\n"); +#endif + + uint32_t *pixels = malloc(sizeof(*pixels) * xwindow->width * xwindow->height); + assert(pixels != NULL); + + + xwindow->graphics_context = XDefaultGC(xwindow->display, xwindow->screen); + XSetForeground(xwindow->display, xwindow->graphics_context, 0x123456); + + + + + XImage *game_image = XCreateImage( + xwindow->display, + xwindow->visual, + XDefaultDepth(xwindow->display, xwindow->screen), + // NOTE(Zelaven): I can't find an explanation to what this actually is + // anywhere. All the documentation I can find just assumes that you + // magically know. + ZPixmap, + 0, + (char*)pixels, + xwindow->width, xwindow->height, + 8, // NOTE(Zelaven): No clue + // NOTE(Zelaven): This is how many bytes there are in a row of pixels. + xwindow->width * sizeof(uint32_t)); + assert(game_image != NULL); + fill_pixel_buffer( + pixels, + xwindow->width, + xwindow->height, + 0, + 0); + + draw_rect( + pixels, + xwindow->width, + xwindow->height, + 20, 40, 25, 50, + 0xFFFF00); + + GUI_Draw_Command my_draw_command = { + .rectangle = {60, 60, 100, 90}, + .color = 0xFF00FF, + }; + xwindow->pixel_buffer = (Pixel_Buffer){ + .pixels = (GUI_Color*)pixels, + .width = xwindow->width, + .height = xwindow->height, + }; + draw_rect2( + &xwindow->pixel_buffer, + &my_draw_command); + + xwindow->screen_image = game_image; + return EXIT_SUCCESS; +} + + + + +// --- +// --- +// --- + + + +void init_node_freelist(GUI_Node *nodes, int node_count) +{ + // NOTE(Zelaven): We special-case the last node. + for(int i = 0; i < node_count -1; i++) + { + nodes[i] = (GUI_Node){0}; + nodes[i].rdic_node = (RDIC_Node){ + .sibling = &((nodes+i+1)->rdic_node), + }; + } + nodes[node_count-1].rdic_node = (RDIC_Node){0}; +} + +GUI_Node g_gui_node_freelist[128]; + + + +#include "size_of_file.c" + +struct File_Read_Result { + unsigned char *data; + size_t size; +} read_file__cruddy( + FILE *file) +{ + struct File_Read_Result retval = {0}; + size_t status = 0; + long filesize = size_of_file(file); + if(filesize == -1) { + status = 1;} + if(status == 0) { + size_t memory_size = filesize; + memory_size = ((memory_size + 4096 - 1) / 4096) * 4096; + void *file_memory = mmap( + NULL, memory_size, + PROT_READ|PROT_WRITE, MAP_SHARED|MAP_ANONYMOUS, -1, 0); + if(file_memory == (void*)-1) { + //perror("mmap"); + status = 2; + } + else + { + retval.data = file_memory; + } + } + if(status == 0) { + if(fread(retval.data, filesize, 1, file) != 1) { + status = 3;} + } + + if(status == 0) { + retval.size = (size_t)filesize;} + else { + if(retval.data != NULL) { + free(retval.data); + retval.data = NULL;} + retval.size = status; + } + + return retval; +} + + +void copy_from_atlas( + Pixel_Buffer *pixel_buffer, + int off_x, int off_y, + int x, int y, int w, int h) +{ + draw_rect( + pixel_buffer->pixels, + pixel_buffer->width, + pixel_buffer->height, + off_x, off_y, off_x+w, off_y+h, + 0x00ffffff); + for(int j=0; j < h; ++j) { + for(int i=0; i < w; ++i) + { + int atlas_x = x + i; + int atlas_y = y + j; + int atlas_index = atlas_y * g_font_bitmap_width + atlas_x; + unsigned char atlas_shade = g_font_bitmap[atlas_index]; + int color = (atlas_shade << 16) | (atlas_shade << 8) | atlas_shade; + //printf("%d ", color); + SET_PIXEL(pixel_buffer, x+off_x+i, y+off_y+j, color); + } + } + //printf("\n"); +} + +void blend_glyph( + Pixel_Buffer *pixel_buffer, + stbtt_bakedchar *bakedchar, + int x, + int y) +{ + int glyph_height = bakedchar->y1 - bakedchar->y0; + int glyph_width = bakedchar->x1 - bakedchar->x0; + //printf("%d, %d - %d, %d\n", x, y, glyph_width, glyph_height); + + if(0)draw_rect( + pixel_buffer->pixels, + pixel_buffer->width, + pixel_buffer->height, + x, y, x+glyph_width, y+glyph_height, + 0x00ffffff); + + for(int j=0; j < glyph_height; ++j) { + for(int i=0; i < glyph_width; ++i) + { + //unsigned char font_pixel_shade = glyph_bitmap[j*glyph_size.w+i]; + int atlas_x = bakedchar->x0 + i; + int atlas_y = bakedchar->y0 + j; + int atlas_index = atlas_y * g_font_bitmap_width + atlas_x; + GUI_Color atlas_shade = (GUI_Color)g_font_bitmap[atlas_index]; + //GUI_Color color = (atlas_shade << 16) | (atlas_shade << 8) | atlas_shade; + //GUI_Color color = atlas_shade; + GUI_Color pixel_color = GET_PIXEL(pixel_buffer, x+i, y+j); + //GUI_Color pixel_color = 0x00aa764a; + int red = ((pixel_color & 0x00ff0000) >> 16) * (256-atlas_shade) / 256; + int green = ((pixel_color & 0x0000ff00) >> 8) * (256-atlas_shade) / 256; + int blue = ((pixel_color & 0x000000ff)) * (256-atlas_shade) / 256; + GUI_Color new_color = (red << 16) | (green << 8) | blue; + //GUI_Color new_color = pixel_color * (255-color) / 255; + //GUI_Color new_color = (atlas_shade << 16) | (atlas_shade << 8) | atlas_shade; + //printf("%x %x %x\n", color, pixel_color, new_color); + SET_PIXEL(pixel_buffer, x+i, y+j, new_color); + //*pixel_color = *pixel_color * (255-font_pixel_shade) / 255; + //*pixel_color = font_pixel_shade; + } + } + //printf("\n"); +} + +int text_measure_string_width(char *string, size_t str_length) +{ + int result = 0; + for(size_t i = 0; i < str_length; i++) + { + int glyph_index = string[i] - 32; + stbtt_bakedchar *glyph = &g_baked_font[glyph_index]; + result += glyph->xadvance; + } + + return result; +} + +#include +struct Text_Y_Bounds {int upper; int lower;} +text_measure_string_y_bounds(char *string, size_t str_length) +{ + struct Text_Y_Bounds result = {.upper = INT_MAX, .lower = INT_MIN}; + for(size_t i = 0; i < str_length; i++) + { + int glyph_index = string[i] - 32; + stbtt_bakedchar *glyph = &g_baked_font[glyph_index]; + int height = glyph->y1 - glyph->y0; + int offset = glyph->yoff; // This is negative. + int uppermost_pixel = offset; + int lowermost_pixel = height + offset; + //print_bakedchar(string[i], glyph); + if(uppermost_pixel < result.upper) { + result.upper = uppermost_pixel; + } + if(lowermost_pixel > result.lower) { + result.lower = lowermost_pixel; + } + } + + return result; +} + +void blend_string( + Pixel_Buffer *pixel_buffer, + GUI_String text, + int x, int y) +{ + int next_x = x; + for(int i = 0; i < text.length; i++) + { + int glyph_index = text.cstring[i] - 32; + stbtt_bakedchar *g = &g_baked_font[glyph_index]; + blend_glyph( + pixel_buffer, + g, + next_x + g->xoff, y + g->yoff); + next_x += g->xadvance; + } +} + +void gui_draw_text( + Pixel_Buffer *pixel_buffer, + GUI_Draw_Command *draw_command) +{ + if(draw_command->text.cstring == NULL) { + return; + } + //printf("%.*s: %d\n", draw_command->text.length, draw_command->text.cstring, draw_command->text.length); + int text_width = text_measure_string_width( + draw_command->text.cstring, draw_command->text.length); + int width = draw_command->rectangle.x1 - draw_command->rectangle.x0; + int x = draw_command->rectangle.x0 + width/2 - text_width/2; + + struct Text_Y_Bounds y_bounds = text_measure_string_y_bounds( + draw_command->text.cstring, draw_command->text.length); + int y_bounds_middle = (y_bounds.lower + y_bounds.upper)/2; + int height = draw_command->rectangle.y1 - draw_command->rectangle.y0; + int y = draw_command->rectangle.y0 + height/2 - y_bounds_middle; +#if 0 + printf("%.*s: %d, (%d,%d) %d -> %d, %d\n", + draw_command->text.length, draw_command->text.cstring, + text_width, y_bounds.upper, y_bounds.lower, y_bounds_middle, + x, y); +#endif + blend_string( + pixel_buffer, + draw_command->text, + x, y); +#if 0 + SET_PIXEL(pixel_buffer, x, draw_command->rectangle.y0 + height/2, 0x00ff0000); + SET_PIXEL(pixel_buffer, draw_command->rectangle.x0 + width/2, draw_command->rectangle.y0 + height/2, 0x00ffff00); + SET_PIXEL(pixel_buffer, x, y, 0x0000ff00); +#endif +} + +void gui_draw_image( + Pixel_Buffer *pixel_buffer, + GUI_Draw_Command *draw_command) +{ + if(draw_command->image == NULL) { + return; + } + + // TODO(Zelaven): Clipping. + + int off_x = draw_command->rectangle.x0; + int off_y = draw_command->rectangle.y0; + Pixel_Buffer *image = draw_command->image; + int w = image->width; + int h = image->height; + + for(int j=0; j < h; ++j) + { + for(int i=0; i < w; ++i) + { + int image_x = i; + int image_y = j; + int image_index = image_y * w + image_x; + GUI_Color pixel = image->pixels[image_index]; + SET_PIXEL(pixel_buffer, off_x+i, off_y+j, pixel); + } + } +} + + + +#include // usleep. +int main(void) +{ + void (*gui)(GUI_Context *,GUI_Rectangle); + + // Font initialization. + Memory_Arena font_arena = {0}; + assert(linux_allocate_arena_memory( + &font_arena, + g_font_bitmap_width*g_font_bitmap_height) == 0); + FILE *font_file = fopen("michroma/Michroma-Regular.ttf", "r"); + //FILE *font_file = fopen("/usr/share/fonts/TTF/Roboto-Black.ttf", "r"); + struct File_Read_Result font_data = read_file__cruddy(font_file); + // TODO(Zelaven): How much data do I have to make sure that I read at minimum? + assert(font_data.size > 16); + g_font_bitmap = memory_arena_allocate(&font_arena, sizeof(char), _Alignof(char)); + { + int bake_font_return_value = stbtt_BakeFontBitmap( + font_data.data, 0, + 20.0, + g_font_bitmap, g_font_bitmap_width, g_font_bitmap_height, + 32, 96, g_baked_font); + + //printf("bake_font_return_value: %d\n", bake_font_return_value); + if(bake_font_return_value < 1) + { + return EXIT_FAILURE; + } + } + + + + // GUI initializaiton. + + //gui = test_gui; + //gui = test_gui__calculator; + //gui = test_gui__scrollbars; + //gui = test_gui__draw_command_using_sliders; + gui = test_gui__subtree; + + X11_Window xwindow = {0}; + int xinit_status = init_x11(&xwindow); + if(xinit_status != EXIT_SUCCESS) + { + return EXIT_FAILURE; + } + + Memory_Arena draw_command_arena = {0}; + assert(linux_allocate_arena_memory( + &draw_command_arena, + 1024*4) == 0); + + GUI_Context context = {0}; +#if 0 + init_node_freelist(g_gui_node_freelist, ARRAYLENGTH(g_gui_node_freelist)); + context.rdic.node_freelist = &g_gui_node_freelist[0].rdic_node; +#else + init_node_freelist(g_gui_node_freelist, ARRAYLENGTH(g_gui_node_freelist)); + context.node_freelist = &g_gui_node_freelist[0].rdic_node; +#endif + + context.draw_command_arena = &draw_command_arena; + context.num_draw_commands = 0; + + fill_pixel_buffer( + xwindow.pixel_buffer.pixels, + xwindow.width, + xwindow.height, + 0, + 0); + GUI_Rectangle screen_rectangle = { + .x0 = 0, .y0 = 0, + .x1 = xwindow.width, .y1 = xwindow.height, + }; + //gui(&context, screen_rectangle); + //gui_layout_nodes(&context); +#if 0 + gui_generate_draw_commands( + context.root, + &draw_command_arena, + &context.num_draw_commands); + GUI_Draw_Command *draw_commands = (GUI_Draw_Command*)(draw_command_arena.memory); + for(int i = 0; i < context.num_draw_commands; i++) + { + draw_rect2( + &pixel_buffer, + &draw_commands[i]); + } + for(int i = 4; i < 100; i += 5) + { + pixel_buffer.pixels[i*xwindow.width + 10] = 0x0000FFFF; + } + draw_pixel_buffer( + xwindow.width, + xwindow.height, + xwindow.display, + xwindow.window, + xwindow.screen_image, + xwindow.graphics_context); +#endif + + //print_node_tree(context.rdic.root, 1); + //getc(stdin); + + bool running = true; + while(running) + { + usleep(2*100000); + context.mouse_pressed = false; + while(XPending(xwindow.display)) + { + XEvent x_event = {0}; + XNextEvent(xwindow.display, &x_event); + if(XFilterEvent(&x_event, xwindow.window)) + { + continue; + } + switch(x_event.type) + { + case ButtonPress: + { + //printf("Button pressed: %d\n", x_event.xbutton.button); + context.mouse_pressed = true; + context.mouse_down = true; + } break; + case ButtonRelease: + { + //printf("Button released: %d\n", x_event.xbutton.button); + context.mouse_down = false; + } break; + case MotionNotify: + { + //printf("Pointer motion: %d, %d\n", x_event.xmotion.x, x_event.xmotion.y); + context.mouse_x = x_event.xmotion.x; + context.mouse_y = x_event.xmotion.y; + } break; + case KeyPress: + { + KeySym keysym = XLookupKeysym( + &x_event.xkey, + 0); // What does 0 mean here? + (void) keysym; + + //printf("Keysym pressed: %s\n", XKeysymToString(keysym)); + //printf("\tkeycode: %d\n", x_event.xkey.keycode); + //printf("\tkeysym code: %ld\n", keysym); + switch(x_event.xkey.keycode) + { + case 38: break; // a + case 40: break; // d + case 25: break; // w + case 39: break; // s + //case 24: running = false; break; // q + case 24: // q + { + // Setting the flag here is necessary. + running = false; + // Can I just do this after the loop iteration finishes? + XDestroyWindow(xwindow.display, xwindow.window); + } break; + } + + } break; + case KeyRelease: + { + KeySym keysym = XLookupKeysym( + &x_event.xkey, + 0); // What does 0 mean here? + (void) keysym; + + //printf("Keysym released: %s\n", XKeysymToString(keysym)); + switch(x_event.xkey.keycode) + { + case 38: break; // a + case 40: break; // d + case 25: break; // w + case 39: break; // s + } + + } break; + case DestroyNotify: + { + running = false; + } break; + default: + { + //printf("Unknown event, type: %d\n", x_event.type); + } break; + } + } + + static bool meh = true; + if(running && meh) + { + gui(&context, screen_rectangle); + //gui_layout_nodes(&context); + #if 1 + for( + GUI_Subtree *current = context.first_subtree; + current != NULL; + current = current->next) + { + gui_layout_nodes((GUI_Node*)current->rdic.root); + gui_generate_draw_commands( + //(GUI_Node*)current->rdic.root, + current, + &draw_command_arena, + &context.num_draw_commands); + + GUI_Draw_Command *draw_command = + (GUI_Draw_Command*)(draw_command_arena.memory); + for(int i = 0; i < context.num_draw_commands; i++) + { + #if 0 + if(i > 0) + (draw_command+i)->roundedness = roundedness; + #endif + gui_draw_rect( + &xwindow.pixel_buffer, + draw_command+i); + gui_draw_image( + &xwindow.pixel_buffer, + draw_command+i); + gui_draw_text( + &xwindow.pixel_buffer, + draw_command+i); + } + } + #else + gui_generate_draw_commands( + (GUI_Node*)context.first_subtree->rdic.root, + &draw_command_arena, + &context.num_draw_commands); + + GUI_Draw_Command *draw_command = + (GUI_Draw_Command*)(draw_command_arena.memory); + for(int i = 0; i < context.num_draw_commands; i++) + { + #if 0 + if(i > 0) + (draw_command+i)->roundedness = roundedness; + #endif + gui_draw_rect( + &xwindow.pixel_buffer, + draw_command+i); + gui_draw_text( + &xwindow.pixel_buffer, + draw_command+i); + } + #endif + #if 0 + GUI_Draw_Command test_draw_command = { + .rectangle = {50, 150, 250, 250}, + .color = 0x00aa8888, + .border_color = 0x00ffaaff, + .border_thickness = border_thickness, + .roundedness = roundedness, + }; + gui_draw_rounded_rect(&xwindow.pixel_buffer, &test_draw_command); + GUI_Draw_Command test_draw_command2 = { + .rectangle = {50, 300, 250, 400}, + .color = 0x00aa8888, + .border_color = 0x00ffaaff, + .border_thickness = border_thickness, + .roundedness = roundedness, + }; + gui_draw_rounded_rect_with_border(&xwindow.pixel_buffer, &test_draw_command2); + //meh = false; + #endif + #if 0 + //print_bakedchar(32+1, &g_baked_font[1]); + blend_glyph( + &xwindow.pixel_buffer, + &g_baked_font[1], + 80, 170); + blend_glyph( + &xwindow.pixel_buffer, + &g_baked_font[1], + 80+g_baked_font[1].xadvance, 170); + char *text = "This is a text! VA"; + int textlen = sizeof("This is a text! VA")-1; + int text_width = text_measure_string_width(text, textlen); + //printf("Text width: %d\n", text_width); + int next_x = 80; + test_draw_horizontal_pixel_line( + &xwindow.pixel_buffer, + next_x, next_x + text_width, 195, + 0); + for(int i = 0; i < textlen; i++) + { + int glyph_index = text[i] - 32; + stbtt_bakedchar *g = &g_baked_font[glyph_index]; + blend_glyph( + &xwindow.pixel_buffer, + g, + next_x + g->xoff, 195 + g->yoff); + next_x += g->xadvance; + } + blend_string( + &xwindow.pixel_buffer, + //GUI_STRING("This is a text! VA"), + GUI_STRING("a = 19 + 23; 1234567890C+-*/="), + 360, 260); + test_draw_horizontal_pixel_line( + &xwindow.pixel_buffer, + 360, 360+200, 260, + 0x00ff0000); + copy_from_atlas( + &xwindow.pixel_buffer, + 300, 100, + 0, 0, 512, 100); + //SET_PIXEL(&xwindow.pixel_buffer, 100, 100, 0x00ffffff); + #endif + draw_pixel_buffer( + xwindow.width, + xwindow.height, + xwindow.display, + xwindow.window, + xwindow.screen_image, + xwindow.graphics_context); + + #if 1 + + // NOTE(Zelaven): What does this _really_ do and why would you want it? + //XClearWindow(xwindow.display, xwindow.window); + + + /* + GUI_Draw_Command *draw_command = + (GUI_Draw_Command*)(draw_command_arena.memory); + for(int i = 0; i < context.num_draw_commands; i++) + { + //xstuff_filled_rect(&xwindow, draw_command+i); + + xstuff_draw_rect( + &xwindow, + draw_command+i); + } + */ + + //xstuff_blit_window( + // &xwindow); + XFlush(xwindow.display); + #endif + } + + } + + XDestroyImage(xwindow.screen_image); + //XUnmapWindow(xwindow.display, xwindow.window); + //XDestroyWindow(xwindow.display, xwindow.window); + XFreeColormap(xwindow.display, xwindow.colormap); + XCloseDisplay(xwindow.display); + + + //getc(stdin); + return 0; +} + + + diff --git a/gui/memory_arena.c b/gui/memory_arena.c new file mode 100644 index 0000000..c6b96c6 --- /dev/null +++ b/gui/memory_arena.c @@ -0,0 +1,51 @@ + + + +typedef struct Memory_Arena +{ + void *memory; + size_t size; + size_t allocation_offset; +} Memory_Arena; + +_Static_assert(sizeof(size_t) == sizeof(void*), + "The Memory_Arena implementation assumes that size_t and pointers are of the same size."); + +void *memory_arena_allocate( + Memory_Arena *arena, + size_t size, + size_t alignment) +{ + #if 0 + printf( + "%s: arena: {.memory=%p, .size=%zu, .allocation_offset=%zu}\n" + "size: %zu, alignment: %zu\n" + , __func__ + , arena->memory, arena->size, arena->allocation_offset + , size, alignment + ); + #endif + size_t allocation_offset = arena->allocation_offset; + allocation_offset = ((allocation_offset + alignment - 1) / alignment) * alignment; + if(allocation_offset + size > arena->size) + { + return NULL; + } + void *allocation = ((char*)arena->memory) + allocation_offset; + arena->allocation_offset = allocation_offset + size; + return allocation; +} + +void memory_arena_reset( + Memory_Arena *arena) +{ + arena->allocation_offset = 0; +} + + + + + + + + diff --git a/gui/memory_arena_linux.c b/gui/memory_arena_linux.c new file mode 100644 index 0000000..e02a91b --- /dev/null +++ b/gui/memory_arena_linux.c @@ -0,0 +1,27 @@ + +#include +#include + + +// NOTE(Patrick): The memory here is by default allocated uncommitted. +// This means that we don't lock down 1GB of memory up front, but get +// allocated pages by the kernel as needed. +int linux_allocate_arena_memory( + Memory_Arena *arena, + size_t arena_size) +{ + void *arena_memory = mmap( + NULL, arena_size, + PROT_READ|PROT_WRITE|PROT_EXEC, MAP_SHARED|MAP_ANONYMOUS, -1, 0); + if(arena_memory == (void*)-1) { + //perror("mmap"); + return errno; + } + arena->memory = arena_memory; + arena->size = arena_size; + return 0; +} + + + + diff --git a/gui/michroma/Michroma-Regular.ttf b/gui/michroma/Michroma-Regular.ttf new file mode 100644 index 0000000..4179369 Binary files /dev/null and b/gui/michroma/Michroma-Regular.ttf differ diff --git a/gui/michroma/OFL.txt b/gui/michroma/OFL.txt new file mode 100644 index 0000000..f56e176 --- /dev/null +++ b/gui/michroma/OFL.txt @@ -0,0 +1,94 @@ +Copyright (c) 2011, Vernon Adams (vern@newtypography.co.uk), +with Reserved Font Name Michroma. + +This Font Software is licensed under the SIL Open Font License, Version 1.1. +This license is copied below, and is also available with a FAQ at: +http://scripts.sil.org/OFL + + +----------------------------------------------------------- +SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 +----------------------------------------------------------- + +PREAMBLE +The goals of the Open Font License (OFL) are to stimulate worldwide +development of collaborative font projects, to support the font creation +efforts of academic and linguistic communities, and to provide a free and +open framework in which fonts may be shared and improved in partnership +with others. + +The OFL allows the licensed fonts to be used, studied, modified and +redistributed freely as long as they are not sold by themselves. The +fonts, including any derivative works, can be bundled, embedded, +redistributed and/or sold with any software provided that any reserved +names are not used by derivative works. The fonts and derivatives, +however, cannot be released under any other type of license. The +requirement for fonts to remain under this license does not apply +to any document created using the fonts or their derivatives. + +DEFINITIONS +"Font Software" refers to the set of files released by the Copyright +Holder(s) under this license and clearly marked as such. This may +include source files, build scripts and documentation. + +"Reserved Font Name" refers to any names specified as such after the +copyright statement(s). + +"Original Version" refers to the collection of Font Software components as +distributed by the Copyright Holder(s). + +"Modified Version" refers to any derivative made by adding to, deleting, +or substituting -- in part or in whole -- any of the components of the +Original Version, by changing formats or by porting the Font Software to a +new environment. + +"Author" refers to any designer, engineer, programmer, technical +writer or other person who contributed to the Font Software. + +PERMISSION & CONDITIONS +Permission is hereby granted, free of charge, to any person obtaining +a copy of the Font Software, to use, study, copy, merge, embed, modify, +redistribute, and sell modified and unmodified copies of the Font +Software, subject to the following conditions: + +1) Neither the Font Software nor any of its individual components, +in Original or Modified Versions, may be sold by itself. + +2) Original or Modified Versions of the Font Software may be bundled, +redistributed and/or sold with any software, provided that each copy +contains the above copyright notice and this license. These can be +included either as stand-alone text files, human-readable headers or +in the appropriate machine-readable metadata fields within text or +binary files as long as those fields can be easily viewed by the user. + +3) No Modified Version of the Font Software may use the Reserved Font +Name(s) unless explicit written permission is granted by the corresponding +Copyright Holder. This restriction only applies to the primary font name as +presented to the users. + +4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font +Software shall not be used to promote, endorse or advertise any +Modified Version, except to acknowledge the contribution(s) of the +Copyright Holder(s) and the Author(s) or with their explicit written +permission. + +5) The Font Software, modified or unmodified, in part or in whole, +must be distributed entirely under this license, and must not be +distributed under any other license. The requirement for fonts to +remain under this license does not apply to any document created +using the Font Software. + +TERMINATION +This license becomes null and void if any of the above conditions are +not met. + +DISCLAIMER +THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, +EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF +MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT +OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE +COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, +INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL +DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING +FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM +OTHER DEALINGS IN THE FONT SOFTWARE. diff --git a/gui/size_of_file.c b/gui/size_of_file.c new file mode 100644 index 0000000..fa48f1e --- /dev/null +++ b/gui/size_of_file.c @@ -0,0 +1,9 @@ +long size_of_file( + FILE *file) +{ + long position = ftell(file); + fseek(file, 0, SEEK_END); + long file_length = ftell(file); + fseek(file, position, SEEK_SET); + return file_length; +} diff --git a/gui/stb_truetype.c b/gui/stb_truetype.c new file mode 100644 index 0000000..dc22d88 --- /dev/null +++ b/gui/stb_truetype.c @@ -0,0 +1,2 @@ +#define STB_TRUETYPE_IMPLEMENTATION +#include "stb_truetype.h" diff --git a/gui/stb_truetype.h b/gui/stb_truetype.h new file mode 100644 index 0000000..bbf2284 --- /dev/null +++ b/gui/stb_truetype.h @@ -0,0 +1,5077 @@ +// stb_truetype.h - v1.26 - public domain +// authored from 2009-2021 by Sean Barrett / RAD Game Tools +// +// ======================================================================= +// +// NO SECURITY GUARANTEE -- DO NOT USE THIS ON UNTRUSTED FONT FILES +// +// This library does no range checking of the offsets found in the file, +// meaning an attacker can use it to read arbitrary memory. +// +// ======================================================================= +// +// This library processes TrueType files: +// parse files +// extract glyph metrics +// extract glyph shapes +// render glyphs to one-channel bitmaps with antialiasing (box filter) +// render glyphs to one-channel SDF bitmaps (signed-distance field/function) +// +// Todo: +// non-MS cmaps +// crashproof on bad data +// hinting? (no longer patented) +// cleartype-style AA? +// optimize: use simple memory allocator for intermediates +// optimize: build edge-list directly from curves +// optimize: rasterize directly from curves? +// +// ADDITIONAL CONTRIBUTORS +// +// Mikko Mononen: compound shape support, more cmap formats +// Tor Andersson: kerning, subpixel rendering +// Dougall Johnson: OpenType / Type 2 font handling +// Daniel Ribeiro Maciel: basic GPOS-based kerning +// +// Misc other: +// Ryan Gordon +// Simon Glass +// github:IntellectualKitty +// Imanol Celaya +// Daniel Ribeiro Maciel +// +// Bug/warning reports/fixes: +// "Zer" on mollyrocket Fabian "ryg" Giesen github:NiLuJe +// Cass Everitt Martins Mozeiko github:aloucks +// stoiko (Haemimont Games) Cap Petschulat github:oyvindjam +// Brian Hook Omar Cornut github:vassvik +// Walter van Niftrik Ryan Griege +// David Gow Peter LaValle +// David Given Sergey Popov +// Ivan-Assen Ivanov Giumo X. Clanjor +// Anthony Pesch Higor Euripedes +// Johan Duparc Thomas Fields +// Hou Qiming Derek Vinyard +// Rob Loach Cort Stratton +// Kenney Phillis Jr. Brian Costabile +// Ken Voskuil (kaesve) +// +// VERSION HISTORY +// +// 1.26 (2021-08-28) fix broken rasterizer +// 1.25 (2021-07-11) many fixes +// 1.24 (2020-02-05) fix warning +// 1.23 (2020-02-02) query SVG data for glyphs; query whole kerning table (but only kern not GPOS) +// 1.22 (2019-08-11) minimize missing-glyph duplication; fix kerning if both 'GPOS' and 'kern' are defined +// 1.21 (2019-02-25) fix warning +// 1.20 (2019-02-07) PackFontRange skips missing codepoints; GetScaleFontVMetrics() +// 1.19 (2018-02-11) GPOS kerning, STBTT_fmod +// 1.18 (2018-01-29) add missing function +// 1.17 (2017-07-23) make more arguments const; doc fix +// 1.16 (2017-07-12) SDF support +// 1.15 (2017-03-03) make more arguments const +// 1.14 (2017-01-16) num-fonts-in-TTC function +// 1.13 (2017-01-02) support OpenType fonts, certain Apple fonts +// 1.12 (2016-10-25) suppress warnings about casting away const with -Wcast-qual +// 1.11 (2016-04-02) fix unused-variable warning +// 1.10 (2016-04-02) user-defined fabs(); rare memory leak; remove duplicate typedef +// 1.09 (2016-01-16) warning fix; avoid crash on outofmem; use allocation userdata properly +// 1.08 (2015-09-13) document stbtt_Rasterize(); fixes for vertical & horizontal edges +// 1.07 (2015-08-01) allow PackFontRanges to accept arrays of sparse codepoints; +// variant PackFontRanges to pack and render in separate phases; +// fix stbtt_GetFontOFfsetForIndex (never worked for non-0 input?); +// fixed an assert() bug in the new rasterizer +// replace assert() with STBTT_assert() in new rasterizer +// +// Full history can be found at the end of this file. +// +// LICENSE +// +// See end of file for license information. +// +// USAGE +// +// Include this file in whatever places need to refer to it. In ONE C/C++ +// file, write: +// #define STB_TRUETYPE_IMPLEMENTATION +// before the #include of this file. This expands out the actual +// implementation into that C/C++ file. +// +// To make the implementation private to the file that generates the implementation, +// #define STBTT_STATIC +// +// Simple 3D API (don't ship this, but it's fine for tools and quick start) +// stbtt_BakeFontBitmap() -- bake a font to a bitmap for use as texture +// stbtt_GetBakedQuad() -- compute quad to draw for a given char +// +// Improved 3D API (more shippable): +// #include "stb_rect_pack.h" -- optional, but you really want it +// stbtt_PackBegin() +// stbtt_PackSetOversampling() -- for improved quality on small fonts +// stbtt_PackFontRanges() -- pack and renders +// stbtt_PackEnd() +// stbtt_GetPackedQuad() +// +// "Load" a font file from a memory buffer (you have to keep the buffer loaded) +// stbtt_InitFont() +// stbtt_GetFontOffsetForIndex() -- indexing for TTC font collections +// stbtt_GetNumberOfFonts() -- number of fonts for TTC font collections +// +// Render a unicode codepoint to a bitmap +// stbtt_GetCodepointBitmap() -- allocates and returns a bitmap +// stbtt_MakeCodepointBitmap() -- renders into bitmap you provide +// stbtt_GetCodepointBitmapBox() -- how big the bitmap must be +// +// Character advance/positioning +// stbtt_GetCodepointHMetrics() +// stbtt_GetFontVMetrics() +// stbtt_GetFontVMetricsOS2() +// stbtt_GetCodepointKernAdvance() +// +// Starting with version 1.06, the rasterizer was replaced with a new, +// faster and generally-more-precise rasterizer. The new rasterizer more +// accurately measures pixel coverage for anti-aliasing, except in the case +// where multiple shapes overlap, in which case it overestimates the AA pixel +// coverage. Thus, anti-aliasing of intersecting shapes may look wrong. If +// this turns out to be a problem, you can re-enable the old rasterizer with +// #define STBTT_RASTERIZER_VERSION 1 +// which will incur about a 15% speed hit. +// +// ADDITIONAL DOCUMENTATION +// +// Immediately after this block comment are a series of sample programs. +// +// After the sample programs is the "header file" section. This section +// includes documentation for each API function. +// +// Some important concepts to understand to use this library: +// +// Codepoint +// Characters are defined by unicode codepoints, e.g. 65 is +// uppercase A, 231 is lowercase c with a cedilla, 0x7e30 is +// the hiragana for "ma". +// +// Glyph +// A visual character shape (every codepoint is rendered as +// some glyph) +// +// Glyph index +// A font-specific integer ID representing a glyph +// +// Baseline +// Glyph shapes are defined relative to a baseline, which is the +// bottom of uppercase characters. Characters extend both above +// and below the baseline. +// +// Current Point +// As you draw text to the screen, you keep track of a "current point" +// which is the origin of each character. The current point's vertical +// position is the baseline. Even "baked fonts" use this model. +// +// Vertical Font Metrics +// The vertical qualities of the font, used to vertically position +// and space the characters. See docs for stbtt_GetFontVMetrics. +// +// Font Size in Pixels or Points +// The preferred interface for specifying font sizes in stb_truetype +// is to specify how tall the font's vertical extent should be in pixels. +// If that sounds good enough, skip the next paragraph. +// +// Most font APIs instead use "points", which are a common typographic +// measurement for describing font size, defined as 72 points per inch. +// stb_truetype provides a point API for compatibility. However, true +// "per inch" conventions don't make much sense on computer displays +// since different monitors have different number of pixels per +// inch. For example, Windows traditionally uses a convention that +// there are 96 pixels per inch, thus making 'inch' measurements have +// nothing to do with inches, and thus effectively defining a point to +// be 1.333 pixels. Additionally, the TrueType font data provides +// an explicit scale factor to scale a given font's glyphs to points, +// but the author has observed that this scale factor is often wrong +// for non-commercial fonts, thus making fonts scaled in points +// according to the TrueType spec incoherently sized in practice. +// +// DETAILED USAGE: +// +// Scale: +// Select how high you want the font to be, in points or pixels. +// Call ScaleForPixelHeight or ScaleForMappingEmToPixels to compute +// a scale factor SF that will be used by all other functions. +// +// Baseline: +// You need to select a y-coordinate that is the baseline of where +// your text will appear. Call GetFontBoundingBox to get the baseline-relative +// bounding box for all characters. SF*-y0 will be the distance in pixels +// that the worst-case character could extend above the baseline, so if +// you want the top edge of characters to appear at the top of the +// screen where y=0, then you would set the baseline to SF*-y0. +// +// Current point: +// Set the current point where the first character will appear. The +// first character could extend left of the current point; this is font +// dependent. You can either choose a current point that is the leftmost +// point and hope, or add some padding, or check the bounding box or +// left-side-bearing of the first character to be displayed and set +// the current point based on that. +// +// Displaying a character: +// Compute the bounding box of the character. It will contain signed values +// relative to . I.e. if it returns x0,y0,x1,y1, +// then the character should be displayed in the rectangle from +// to = 32 && *text < 128) { + stbtt_aligned_quad q; + stbtt_GetBakedQuad(cdata, 512,512, *text-32, &x,&y,&q,1);//1=opengl & d3d10+,0=d3d9 + glTexCoord2f(q.s0,q.t0); glVertex2f(q.x0,q.y0); + glTexCoord2f(q.s1,q.t0); glVertex2f(q.x1,q.y0); + glTexCoord2f(q.s1,q.t1); glVertex2f(q.x1,q.y1); + glTexCoord2f(q.s0,q.t1); glVertex2f(q.x0,q.y1); + } + ++text; + } + glEnd(); +} +#endif +// +// +////////////////////////////////////////////////////////////////////////////// +// +// Complete program (this compiles): get a single bitmap, print as ASCII art +// +#if 0 +#include +#define STB_TRUETYPE_IMPLEMENTATION // force following include to generate implementation +#include "stb_truetype.h" + +char ttf_buffer[1<<25]; + +int main(int argc, char **argv) +{ + stbtt_fontinfo font; + unsigned char *bitmap; + int w,h,i,j,c = (argc > 1 ? atoi(argv[1]) : 'a'), s = (argc > 2 ? atoi(argv[2]) : 20); + + fread(ttf_buffer, 1, 1<<25, fopen(argc > 3 ? argv[3] : "c:/windows/fonts/arialbd.ttf", "rb")); + + stbtt_InitFont(&font, ttf_buffer, stbtt_GetFontOffsetForIndex(ttf_buffer,0)); + bitmap = stbtt_GetCodepointBitmap(&font, 0,stbtt_ScaleForPixelHeight(&font, s), c, &w, &h, 0,0); + + for (j=0; j < h; ++j) { + for (i=0; i < w; ++i) + putchar(" .:ioVM@"[bitmap[j*w+i]>>5]); + putchar('\n'); + } + return 0; +} +#endif +// +// Output: +// +// .ii. +// @@@@@@. +// V@Mio@@o +// :i. V@V +// :oM@@M +// :@@@MM@M +// @@o o@M +// :@@. M@M +// @@@o@@@@ +// :M@@V:@@. +// +////////////////////////////////////////////////////////////////////////////// +// +// Complete program: print "Hello World!" banner, with bugs +// +#if 0 +char buffer[24<<20]; +unsigned char screen[20][79]; + +int main(int arg, char **argv) +{ + stbtt_fontinfo font; + int i,j,ascent,baseline,ch=0; + float scale, xpos=2; // leave a little padding in case the character extends left + char *text = "Heljo World!"; // intentionally misspelled to show 'lj' brokenness + + fread(buffer, 1, 1000000, fopen("c:/windows/fonts/arialbd.ttf", "rb")); + stbtt_InitFont(&font, buffer, 0); + + scale = stbtt_ScaleForPixelHeight(&font, 15); + stbtt_GetFontVMetrics(&font, &ascent,0,0); + baseline = (int) (ascent*scale); + + while (text[ch]) { + int advance,lsb,x0,y0,x1,y1; + float x_shift = xpos - (float) floor(xpos); + stbtt_GetCodepointHMetrics(&font, text[ch], &advance, &lsb); + stbtt_GetCodepointBitmapBoxSubpixel(&font, text[ch], scale,scale,x_shift,0, &x0,&y0,&x1,&y1); + stbtt_MakeCodepointBitmapSubpixel(&font, &screen[baseline + y0][(int) xpos + x0], x1-x0,y1-y0, 79, scale,scale,x_shift,0, text[ch]); + // note that this stomps the old data, so where character boxes overlap (e.g. 'lj') it's wrong + // because this API is really for baking character bitmaps into textures. if you want to render + // a sequence of characters, you really need to render each bitmap to a temp buffer, then + // "alpha blend" that into the working buffer + xpos += (advance * scale); + if (text[ch+1]) + xpos += scale*stbtt_GetCodepointKernAdvance(&font, text[ch],text[ch+1]); + ++ch; + } + + for (j=0; j < 20; ++j) { + for (i=0; i < 78; ++i) + putchar(" .:ioVM@"[screen[j][i]>>5]); + putchar('\n'); + } + + return 0; +} +#endif + + +////////////////////////////////////////////////////////////////////////////// +////////////////////////////////////////////////////////////////////////////// +//// +//// INTEGRATION WITH YOUR CODEBASE +//// +//// The following sections allow you to supply alternate definitions +//// of C library functions used by stb_truetype, e.g. if you don't +//// link with the C runtime library. + +#ifdef STB_TRUETYPE_IMPLEMENTATION + // #define your own (u)stbtt_int8/16/32 before including to override this + #ifndef stbtt_uint8 + typedef unsigned char stbtt_uint8; + typedef signed char stbtt_int8; + typedef unsigned short stbtt_uint16; + typedef signed short stbtt_int16; + typedef unsigned int stbtt_uint32; + typedef signed int stbtt_int32; + #endif + + typedef char stbtt__check_size32[sizeof(stbtt_int32)==4 ? 1 : -1]; + typedef char stbtt__check_size16[sizeof(stbtt_int16)==2 ? 1 : -1]; + + // e.g. #define your own STBTT_ifloor/STBTT_iceil() to avoid math.h + #ifndef STBTT_ifloor + #include + #define STBTT_ifloor(x) ((int) floor(x)) + #define STBTT_iceil(x) ((int) ceil(x)) + #endif + + #ifndef STBTT_sqrt + #include + #define STBTT_sqrt(x) sqrt(x) + #define STBTT_pow(x,y) pow(x,y) + #endif + + #ifndef STBTT_fmod + #include + #define STBTT_fmod(x,y) fmod(x,y) + #endif + + #ifndef STBTT_cos + #include + #define STBTT_cos(x) cos(x) + #define STBTT_acos(x) acos(x) + #endif + + #ifndef STBTT_fabs + #include + #define STBTT_fabs(x) fabs(x) + #endif + + // #define your own functions "STBTT_malloc" / "STBTT_free" to avoid malloc.h + #ifndef STBTT_malloc + #include + #define STBTT_malloc(x,u) ((void)(u),malloc(x)) + #define STBTT_free(x,u) ((void)(u),free(x)) + #endif + + #ifndef STBTT_assert + #include + #define STBTT_assert(x) assert(x) + #endif + + #ifndef STBTT_strlen + #include + #define STBTT_strlen(x) strlen(x) + #endif + + #ifndef STBTT_memcpy + #include + #define STBTT_memcpy memcpy + #define STBTT_memset memset + #endif +#endif + +/////////////////////////////////////////////////////////////////////////////// +/////////////////////////////////////////////////////////////////////////////// +//// +//// INTERFACE +//// +//// + +#ifndef __STB_INCLUDE_STB_TRUETYPE_H__ +#define __STB_INCLUDE_STB_TRUETYPE_H__ + +#ifdef STBTT_STATIC +#define STBTT_DEF static +#else +#define STBTT_DEF extern +#endif + +#ifdef __cplusplus +extern "C" { +#endif + +// private structure +typedef struct +{ + unsigned char *data; + int cursor; + int size; +} stbtt__buf; + +////////////////////////////////////////////////////////////////////////////// +// +// TEXTURE BAKING API +// +// If you use this API, you only have to call two functions ever. +// + +typedef struct +{ + unsigned short x0,y0,x1,y1; // coordinates of bbox in bitmap + float xoff,yoff,xadvance; +} stbtt_bakedchar; + +STBTT_DEF int stbtt_BakeFontBitmap(const unsigned char *data, int offset, // font location (use offset=0 for plain .ttf) + float pixel_height, // height of font in pixels + unsigned char *pixels, int pw, int ph, // bitmap to be filled in + int first_char, int num_chars, // characters to bake + stbtt_bakedchar *chardata); // you allocate this, it's num_chars long +// if return is positive, the first unused row of the bitmap +// if return is negative, returns the negative of the number of characters that fit +// if return is 0, no characters fit and no rows were used +// This uses a very crappy packing. + +typedef struct +{ + float x0,y0,s0,t0; // top-left + float x1,y1,s1,t1; // bottom-right +} stbtt_aligned_quad; + +STBTT_DEF void stbtt_GetBakedQuad(const stbtt_bakedchar *chardata, int pw, int ph, // same data as above + int char_index, // character to display + float *xpos, float *ypos, // pointers to current position in screen pixel space + stbtt_aligned_quad *q, // output: quad to draw + int opengl_fillrule); // true if opengl fill rule; false if DX9 or earlier +// Call GetBakedQuad with char_index = 'character - first_char', and it +// creates the quad you need to draw and advances the current position. +// +// The coordinate system used assumes y increases downwards. +// +// Characters will extend both above and below the current position; +// see discussion of "BASELINE" above. +// +// It's inefficient; you might want to c&p it and optimize it. + +STBTT_DEF void stbtt_GetScaledFontVMetrics(const unsigned char *fontdata, int index, float size, float *ascent, float *descent, float *lineGap); +// Query the font vertical metrics without having to create a font first. + + +////////////////////////////////////////////////////////////////////////////// +// +// NEW TEXTURE BAKING API +// +// This provides options for packing multiple fonts into one atlas, not +// perfectly but better than nothing. + +typedef struct +{ + unsigned short x0,y0,x1,y1; // coordinates of bbox in bitmap + float xoff,yoff,xadvance; + float xoff2,yoff2; +} stbtt_packedchar; + +typedef struct stbtt_pack_context stbtt_pack_context; +typedef struct stbtt_fontinfo stbtt_fontinfo; +#ifndef STB_RECT_PACK_VERSION +typedef struct stbrp_rect stbrp_rect; +#endif + +STBTT_DEF int stbtt_PackBegin(stbtt_pack_context *spc, unsigned char *pixels, int width, int height, int stride_in_bytes, int padding, void *alloc_context); +// Initializes a packing context stored in the passed-in stbtt_pack_context. +// Future calls using this context will pack characters into the bitmap passed +// in here: a 1-channel bitmap that is width * height. stride_in_bytes is +// the distance from one row to the next (or 0 to mean they are packed tightly +// together). "padding" is the amount of padding to leave between each +// character (normally you want '1' for bitmaps you'll use as textures with +// bilinear filtering). +// +// Returns 0 on failure, 1 on success. + +STBTT_DEF void stbtt_PackEnd (stbtt_pack_context *spc); +// Cleans up the packing context and frees all memory. + +#define STBTT_POINT_SIZE(x) (-(x)) + +STBTT_DEF int stbtt_PackFontRange(stbtt_pack_context *spc, const unsigned char *fontdata, int font_index, float font_size, + int first_unicode_char_in_range, int num_chars_in_range, stbtt_packedchar *chardata_for_range); +// Creates character bitmaps from the font_index'th font found in fontdata (use +// font_index=0 if you don't know what that is). It creates num_chars_in_range +// bitmaps for characters with unicode values starting at first_unicode_char_in_range +// and increasing. Data for how to render them is stored in chardata_for_range; +// pass these to stbtt_GetPackedQuad to get back renderable quads. +// +// font_size is the full height of the character from ascender to descender, +// as computed by stbtt_ScaleForPixelHeight. To use a point size as computed +// by stbtt_ScaleForMappingEmToPixels, wrap the point size in STBTT_POINT_SIZE() +// and pass that result as 'font_size': +// ..., 20 , ... // font max minus min y is 20 pixels tall +// ..., STBTT_POINT_SIZE(20), ... // 'M' is 20 pixels tall + +typedef struct +{ + float font_size; + int first_unicode_codepoint_in_range; // if non-zero, then the chars are continuous, and this is the first codepoint + int *array_of_unicode_codepoints; // if non-zero, then this is an array of unicode codepoints + int num_chars; + stbtt_packedchar *chardata_for_range; // output + unsigned char h_oversample, v_oversample; // don't set these, they're used internally +} stbtt_pack_range; + +STBTT_DEF int stbtt_PackFontRanges(stbtt_pack_context *spc, const unsigned char *fontdata, int font_index, stbtt_pack_range *ranges, int num_ranges); +// Creates character bitmaps from multiple ranges of characters stored in +// ranges. This will usually create a better-packed bitmap than multiple +// calls to stbtt_PackFontRange. Note that you can call this multiple +// times within a single PackBegin/PackEnd. + +STBTT_DEF void stbtt_PackSetOversampling(stbtt_pack_context *spc, unsigned int h_oversample, unsigned int v_oversample); +// Oversampling a font increases the quality by allowing higher-quality subpixel +// positioning, and is especially valuable at smaller text sizes. +// +// This function sets the amount of oversampling for all following calls to +// stbtt_PackFontRange(s) or stbtt_PackFontRangesGatherRects for a given +// pack context. The default (no oversampling) is achieved by h_oversample=1 +// and v_oversample=1. The total number of pixels required is +// h_oversample*v_oversample larger than the default; for example, 2x2 +// oversampling requires 4x the storage of 1x1. For best results, render +// oversampled textures with bilinear filtering. Look at the readme in +// stb/tests/oversample for information about oversampled fonts +// +// To use with PackFontRangesGather etc., you must set it before calls +// call to PackFontRangesGatherRects. + +STBTT_DEF void stbtt_PackSetSkipMissingCodepoints(stbtt_pack_context *spc, int skip); +// If skip != 0, this tells stb_truetype to skip any codepoints for which +// there is no corresponding glyph. If skip=0, which is the default, then +// codepoints without a glyph recived the font's "missing character" glyph, +// typically an empty box by convention. + +STBTT_DEF void stbtt_GetPackedQuad(const stbtt_packedchar *chardata, int pw, int ph, // same data as above + int char_index, // character to display + float *xpos, float *ypos, // pointers to current position in screen pixel space + stbtt_aligned_quad *q, // output: quad to draw + int align_to_integer); + +STBTT_DEF int stbtt_PackFontRangesGatherRects(stbtt_pack_context *spc, const stbtt_fontinfo *info, stbtt_pack_range *ranges, int num_ranges, stbrp_rect *rects); +STBTT_DEF void stbtt_PackFontRangesPackRects(stbtt_pack_context *spc, stbrp_rect *rects, int num_rects); +STBTT_DEF int stbtt_PackFontRangesRenderIntoRects(stbtt_pack_context *spc, const stbtt_fontinfo *info, stbtt_pack_range *ranges, int num_ranges, stbrp_rect *rects); +// Calling these functions in sequence is roughly equivalent to calling +// stbtt_PackFontRanges(). If you more control over the packing of multiple +// fonts, or if you want to pack custom data into a font texture, take a look +// at the source to of stbtt_PackFontRanges() and create a custom version +// using these functions, e.g. call GatherRects multiple times, +// building up a single array of rects, then call PackRects once, +// then call RenderIntoRects repeatedly. This may result in a +// better packing than calling PackFontRanges multiple times +// (or it may not). + +// this is an opaque structure that you shouldn't mess with which holds +// all the context needed from PackBegin to PackEnd. +struct stbtt_pack_context { + void *user_allocator_context; + void *pack_info; + int width; + int height; + int stride_in_bytes; + int padding; + int skip_missing; + unsigned int h_oversample, v_oversample; + unsigned char *pixels; + void *nodes; +}; + +////////////////////////////////////////////////////////////////////////////// +// +// FONT LOADING +// +// + +STBTT_DEF int stbtt_GetNumberOfFonts(const unsigned char *data); +// This function will determine the number of fonts in a font file. TrueType +// collection (.ttc) files may contain multiple fonts, while TrueType font +// (.ttf) files only contain one font. The number of fonts can be used for +// indexing with the previous function where the index is between zero and one +// less than the total fonts. If an error occurs, -1 is returned. + +STBTT_DEF int stbtt_GetFontOffsetForIndex(const unsigned char *data, int index); +// Each .ttf/.ttc file may have more than one font. Each font has a sequential +// index number starting from 0. Call this function to get the font offset for +// a given index; it returns -1 if the index is out of range. A regular .ttf +// file will only define one font and it always be at offset 0, so it will +// return '0' for index 0, and -1 for all other indices. + +// The following structure is defined publicly so you can declare one on +// the stack or as a global or etc, but you should treat it as opaque. +struct stbtt_fontinfo +{ + void * userdata; + unsigned char * data; // pointer to .ttf file + int fontstart; // offset of start of font + + int numGlyphs; // number of glyphs, needed for range checking + + int loca,head,glyf,hhea,hmtx,kern,gpos,svg; // table locations as offset from start of .ttf + int index_map; // a cmap mapping for our chosen character encoding + int indexToLocFormat; // format needed to map from glyph index to glyph + + stbtt__buf cff; // cff font data + stbtt__buf charstrings; // the charstring index + stbtt__buf gsubrs; // global charstring subroutines index + stbtt__buf subrs; // private charstring subroutines index + stbtt__buf fontdicts; // array of font dicts + stbtt__buf fdselect; // map from glyph to fontdict +}; + +STBTT_DEF int stbtt_InitFont(stbtt_fontinfo *info, const unsigned char *data, int offset); +// Given an offset into the file that defines a font, this function builds +// the necessary cached info for the rest of the system. You must allocate +// the stbtt_fontinfo yourself, and stbtt_InitFont will fill it out. You don't +// need to do anything special to free it, because the contents are pure +// value data with no additional data structures. Returns 0 on failure. + + +////////////////////////////////////////////////////////////////////////////// +// +// CHARACTER TO GLYPH-INDEX CONVERSIOn + +STBTT_DEF int stbtt_FindGlyphIndex(const stbtt_fontinfo *info, int unicode_codepoint); +// If you're going to perform multiple operations on the same character +// and you want a speed-up, call this function with the character you're +// going to process, then use glyph-based functions instead of the +// codepoint-based functions. +// Returns 0 if the character codepoint is not defined in the font. + + +////////////////////////////////////////////////////////////////////////////// +// +// CHARACTER PROPERTIES +// + +STBTT_DEF float stbtt_ScaleForPixelHeight(const stbtt_fontinfo *info, float pixels); +// computes a scale factor to produce a font whose "height" is 'pixels' tall. +// Height is measured as the distance from the highest ascender to the lowest +// descender; in other words, it's equivalent to calling stbtt_GetFontVMetrics +// and computing: +// scale = pixels / (ascent - descent) +// so if you prefer to measure height by the ascent only, use a similar calculation. + +STBTT_DEF float stbtt_ScaleForMappingEmToPixels(const stbtt_fontinfo *info, float pixels); +// computes a scale factor to produce a font whose EM size is mapped to +// 'pixels' tall. This is probably what traditional APIs compute, but +// I'm not positive. + +STBTT_DEF void stbtt_GetFontVMetrics(const stbtt_fontinfo *info, int *ascent, int *descent, int *lineGap); +// ascent is the coordinate above the baseline the font extends; descent +// is the coordinate below the baseline the font extends (i.e. it is typically negative) +// lineGap is the spacing between one row's descent and the next row's ascent... +// so you should advance the vertical position by "*ascent - *descent + *lineGap" +// these are expressed in unscaled coordinates, so you must multiply by +// the scale factor for a given size + +STBTT_DEF int stbtt_GetFontVMetricsOS2(const stbtt_fontinfo *info, int *typoAscent, int *typoDescent, int *typoLineGap); +// analogous to GetFontVMetrics, but returns the "typographic" values from the OS/2 +// table (specific to MS/Windows TTF files). +// +// Returns 1 on success (table present), 0 on failure. + +STBTT_DEF void stbtt_GetFontBoundingBox(const stbtt_fontinfo *info, int *x0, int *y0, int *x1, int *y1); +// the bounding box around all possible characters + +STBTT_DEF void stbtt_GetCodepointHMetrics(const stbtt_fontinfo *info, int codepoint, int *advanceWidth, int *leftSideBearing); +// leftSideBearing is the offset from the current horizontal position to the left edge of the character +// advanceWidth is the offset from the current horizontal position to the next horizontal position +// these are expressed in unscaled coordinates + +STBTT_DEF int stbtt_GetCodepointKernAdvance(const stbtt_fontinfo *info, int ch1, int ch2); +// an additional amount to add to the 'advance' value between ch1 and ch2 + +STBTT_DEF int stbtt_GetCodepointBox(const stbtt_fontinfo *info, int codepoint, int *x0, int *y0, int *x1, int *y1); +// Gets the bounding box of the visible part of the glyph, in unscaled coordinates + +STBTT_DEF void stbtt_GetGlyphHMetrics(const stbtt_fontinfo *info, int glyph_index, int *advanceWidth, int *leftSideBearing); +STBTT_DEF int stbtt_GetGlyphKernAdvance(const stbtt_fontinfo *info, int glyph1, int glyph2); +STBTT_DEF int stbtt_GetGlyphBox(const stbtt_fontinfo *info, int glyph_index, int *x0, int *y0, int *x1, int *y1); +// as above, but takes one or more glyph indices for greater efficiency + +typedef struct stbtt_kerningentry +{ + int glyph1; // use stbtt_FindGlyphIndex + int glyph2; + int advance; +} stbtt_kerningentry; + +STBTT_DEF int stbtt_GetKerningTableLength(const stbtt_fontinfo *info); +STBTT_DEF int stbtt_GetKerningTable(const stbtt_fontinfo *info, stbtt_kerningentry* table, int table_length); +// Retrieves a complete list of all of the kerning pairs provided by the font +// stbtt_GetKerningTable never writes more than table_length entries and returns how many entries it did write. +// The table will be sorted by (a.glyph1 == b.glyph1)?(a.glyph2 < b.glyph2):(a.glyph1 < b.glyph1) + +////////////////////////////////////////////////////////////////////////////// +// +// GLYPH SHAPES (you probably don't need these, but they have to go before +// the bitmaps for C declaration-order reasons) +// + +#ifndef STBTT_vmove // you can predefine these to use different values (but why?) + enum { + STBTT_vmove=1, + STBTT_vline, + STBTT_vcurve, + STBTT_vcubic + }; +#endif + +#ifndef stbtt_vertex // you can predefine this to use different values + // (we share this with other code at RAD) + #define stbtt_vertex_type short // can't use stbtt_int16 because that's not visible in the header file + typedef struct + { + stbtt_vertex_type x,y,cx,cy,cx1,cy1; + unsigned char type,padding; + } stbtt_vertex; +#endif + +STBTT_DEF int stbtt_IsGlyphEmpty(const stbtt_fontinfo *info, int glyph_index); +// returns non-zero if nothing is drawn for this glyph + +STBTT_DEF int stbtt_GetCodepointShape(const stbtt_fontinfo *info, int unicode_codepoint, stbtt_vertex **vertices); +STBTT_DEF int stbtt_GetGlyphShape(const stbtt_fontinfo *info, int glyph_index, stbtt_vertex **vertices); +// returns # of vertices and fills *vertices with the pointer to them +// these are expressed in "unscaled" coordinates +// +// The shape is a series of contours. Each one starts with +// a STBTT_moveto, then consists of a series of mixed +// STBTT_lineto and STBTT_curveto segments. A lineto +// draws a line from previous endpoint to its x,y; a curveto +// draws a quadratic bezier from previous endpoint to +// its x,y, using cx,cy as the bezier control point. + +STBTT_DEF void stbtt_FreeShape(const stbtt_fontinfo *info, stbtt_vertex *vertices); +// frees the data allocated above + +STBTT_DEF unsigned char *stbtt_FindSVGDoc(const stbtt_fontinfo *info, int gl); +STBTT_DEF int stbtt_GetCodepointSVG(const stbtt_fontinfo *info, int unicode_codepoint, const char **svg); +STBTT_DEF int stbtt_GetGlyphSVG(const stbtt_fontinfo *info, int gl, const char **svg); +// fills svg with the character's SVG data. +// returns data size or 0 if SVG not found. + +////////////////////////////////////////////////////////////////////////////// +// +// BITMAP RENDERING +// + +STBTT_DEF void stbtt_FreeBitmap(unsigned char *bitmap, void *userdata); +// frees the bitmap allocated below + +STBTT_DEF unsigned char *stbtt_GetCodepointBitmap(const stbtt_fontinfo *info, float scale_x, float scale_y, int codepoint, int *width, int *height, int *xoff, int *yoff); +// allocates a large-enough single-channel 8bpp bitmap and renders the +// specified character/glyph at the specified scale into it, with +// antialiasing. 0 is no coverage (transparent), 255 is fully covered (opaque). +// *width & *height are filled out with the width & height of the bitmap, +// which is stored left-to-right, top-to-bottom. +// +// xoff/yoff are the offset it pixel space from the glyph origin to the top-left of the bitmap + +STBTT_DEF unsigned char *stbtt_GetCodepointBitmapSubpixel(const stbtt_fontinfo *info, float scale_x, float scale_y, float shift_x, float shift_y, int codepoint, int *width, int *height, int *xoff, int *yoff); +// the same as stbtt_GetCodepoitnBitmap, but you can specify a subpixel +// shift for the character + +STBTT_DEF void stbtt_MakeCodepointBitmap(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, int codepoint); +// the same as stbtt_GetCodepointBitmap, but you pass in storage for the bitmap +// in the form of 'output', with row spacing of 'out_stride' bytes. the bitmap +// is clipped to out_w/out_h bytes. Call stbtt_GetCodepointBitmapBox to get the +// width and height and positioning info for it first. + +STBTT_DEF void stbtt_MakeCodepointBitmapSubpixel(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int codepoint); +// same as stbtt_MakeCodepointBitmap, but you can specify a subpixel +// shift for the character + +STBTT_DEF void stbtt_MakeCodepointBitmapSubpixelPrefilter(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int oversample_x, int oversample_y, float *sub_x, float *sub_y, int codepoint); +// same as stbtt_MakeCodepointBitmapSubpixel, but prefiltering +// is performed (see stbtt_PackSetOversampling) + +STBTT_DEF void stbtt_GetCodepointBitmapBox(const stbtt_fontinfo *font, int codepoint, float scale_x, float scale_y, int *ix0, int *iy0, int *ix1, int *iy1); +// get the bbox of the bitmap centered around the glyph origin; so the +// bitmap width is ix1-ix0, height is iy1-iy0, and location to place +// the bitmap top left is (leftSideBearing*scale,iy0). +// (Note that the bitmap uses y-increases-down, but the shape uses +// y-increases-up, so CodepointBitmapBox and CodepointBox are inverted.) + +STBTT_DEF void stbtt_GetCodepointBitmapBoxSubpixel(const stbtt_fontinfo *font, int codepoint, float scale_x, float scale_y, float shift_x, float shift_y, int *ix0, int *iy0, int *ix1, int *iy1); +// same as stbtt_GetCodepointBitmapBox, but you can specify a subpixel +// shift for the character + +// the following functions are equivalent to the above functions, but operate +// on glyph indices instead of Unicode codepoints (for efficiency) +STBTT_DEF unsigned char *stbtt_GetGlyphBitmap(const stbtt_fontinfo *info, float scale_x, float scale_y, int glyph, int *width, int *height, int *xoff, int *yoff); +STBTT_DEF unsigned char *stbtt_GetGlyphBitmapSubpixel(const stbtt_fontinfo *info, float scale_x, float scale_y, float shift_x, float shift_y, int glyph, int *width, int *height, int *xoff, int *yoff); +STBTT_DEF void stbtt_MakeGlyphBitmap(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, int glyph); +STBTT_DEF void stbtt_MakeGlyphBitmapSubpixel(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int glyph); +STBTT_DEF void stbtt_MakeGlyphBitmapSubpixelPrefilter(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int oversample_x, int oversample_y, float *sub_x, float *sub_y, int glyph); +STBTT_DEF void stbtt_GetGlyphBitmapBox(const stbtt_fontinfo *font, int glyph, float scale_x, float scale_y, int *ix0, int *iy0, int *ix1, int *iy1); +STBTT_DEF void stbtt_GetGlyphBitmapBoxSubpixel(const stbtt_fontinfo *font, int glyph, float scale_x, float scale_y,float shift_x, float shift_y, int *ix0, int *iy0, int *ix1, int *iy1); + + +// @TODO: don't expose this structure +typedef struct +{ + int w,h,stride; + unsigned char *pixels; +} stbtt__bitmap; + +// rasterize a shape with quadratic beziers into a bitmap +STBTT_DEF void stbtt_Rasterize(stbtt__bitmap *result, // 1-channel bitmap to draw into + float flatness_in_pixels, // allowable error of curve in pixels + stbtt_vertex *vertices, // array of vertices defining shape + int num_verts, // number of vertices in above array + float scale_x, float scale_y, // scale applied to input vertices + float shift_x, float shift_y, // translation applied to input vertices + int x_off, int y_off, // another translation applied to input + int invert, // if non-zero, vertically flip shape + void *userdata); // context for to STBTT_MALLOC + +////////////////////////////////////////////////////////////////////////////// +// +// Signed Distance Function (or Field) rendering + +STBTT_DEF void stbtt_FreeSDF(unsigned char *bitmap, void *userdata); +// frees the SDF bitmap allocated below + +STBTT_DEF unsigned char * stbtt_GetGlyphSDF(const stbtt_fontinfo *info, float scale, int glyph, int padding, unsigned char onedge_value, float pixel_dist_scale, int *width, int *height, int *xoff, int *yoff); +STBTT_DEF unsigned char * stbtt_GetCodepointSDF(const stbtt_fontinfo *info, float scale, int codepoint, int padding, unsigned char onedge_value, float pixel_dist_scale, int *width, int *height, int *xoff, int *yoff); +// These functions compute a discretized SDF field for a single character, suitable for storing +// in a single-channel texture, sampling with bilinear filtering, and testing against +// larger than some threshold to produce scalable fonts. +// info -- the font +// scale -- controls the size of the resulting SDF bitmap, same as it would be creating a regular bitmap +// glyph/codepoint -- the character to generate the SDF for +// padding -- extra "pixels" around the character which are filled with the distance to the character (not 0), +// which allows effects like bit outlines +// onedge_value -- value 0-255 to test the SDF against to reconstruct the character (i.e. the isocontour of the character) +// pixel_dist_scale -- what value the SDF should increase by when moving one SDF "pixel" away from the edge (on the 0..255 scale) +// if positive, > onedge_value is inside; if negative, < onedge_value is inside +// width,height -- output height & width of the SDF bitmap (including padding) +// xoff,yoff -- output origin of the character +// return value -- a 2D array of bytes 0..255, width*height in size +// +// pixel_dist_scale & onedge_value are a scale & bias that allows you to make +// optimal use of the limited 0..255 for your application, trading off precision +// and special effects. SDF values outside the range 0..255 are clamped to 0..255. +// +// Example: +// scale = stbtt_ScaleForPixelHeight(22) +// padding = 5 +// onedge_value = 180 +// pixel_dist_scale = 180/5.0 = 36.0 +// +// This will create an SDF bitmap in which the character is about 22 pixels +// high but the whole bitmap is about 22+5+5=32 pixels high. To produce a filled +// shape, sample the SDF at each pixel and fill the pixel if the SDF value +// is greater than or equal to 180/255. (You'll actually want to antialias, +// which is beyond the scope of this example.) Additionally, you can compute +// offset outlines (e.g. to stroke the character border inside & outside, +// or only outside). For example, to fill outside the character up to 3 SDF +// pixels, you would compare against (180-36.0*3)/255 = 72/255. The above +// choice of variables maps a range from 5 pixels outside the shape to +// 2 pixels inside the shape to 0..255; this is intended primarily for apply +// outside effects only (the interior range is needed to allow proper +// antialiasing of the font at *smaller* sizes) +// +// The function computes the SDF analytically at each SDF pixel, not by e.g. +// building a higher-res bitmap and approximating it. In theory the quality +// should be as high as possible for an SDF of this size & representation, but +// unclear if this is true in practice (perhaps building a higher-res bitmap +// and computing from that can allow drop-out prevention). +// +// The algorithm has not been optimized at all, so expect it to be slow +// if computing lots of characters or very large sizes. + + + +////////////////////////////////////////////////////////////////////////////// +// +// Finding the right font... +// +// You should really just solve this offline, keep your own tables +// of what font is what, and don't try to get it out of the .ttf file. +// That's because getting it out of the .ttf file is really hard, because +// the names in the file can appear in many possible encodings, in many +// possible languages, and e.g. if you need a case-insensitive comparison, +// the details of that depend on the encoding & language in a complex way +// (actually underspecified in truetype, but also gigantic). +// +// But you can use the provided functions in two possible ways: +// stbtt_FindMatchingFont() will use *case-sensitive* comparisons on +// unicode-encoded names to try to find the font you want; +// you can run this before calling stbtt_InitFont() +// +// stbtt_GetFontNameString() lets you get any of the various strings +// from the file yourself and do your own comparisons on them. +// You have to have called stbtt_InitFont() first. + + +STBTT_DEF int stbtt_FindMatchingFont(const unsigned char *fontdata, const char *name, int flags); +// returns the offset (not index) of the font that matches, or -1 if none +// if you use STBTT_MACSTYLE_DONTCARE, use a font name like "Arial Bold". +// if you use any other flag, use a font name like "Arial"; this checks +// the 'macStyle' header field; i don't know if fonts set this consistently +#define STBTT_MACSTYLE_DONTCARE 0 +#define STBTT_MACSTYLE_BOLD 1 +#define STBTT_MACSTYLE_ITALIC 2 +#define STBTT_MACSTYLE_UNDERSCORE 4 +#define STBTT_MACSTYLE_NONE 8 // <= not same as 0, this makes us check the bitfield is 0 + +STBTT_DEF int stbtt_CompareUTF8toUTF16_bigendian(const char *s1, int len1, const char *s2, int len2); +// returns 1/0 whether the first string interpreted as utf8 is identical to +// the second string interpreted as big-endian utf16... useful for strings from next func + +STBTT_DEF const char *stbtt_GetFontNameString(const stbtt_fontinfo *font, int *length, int platformID, int encodingID, int languageID, int nameID); +// returns the string (which may be big-endian double byte, e.g. for unicode) +// and puts the length in bytes in *length. +// +// some of the values for the IDs are below; for more see the truetype spec: +// http://developer.apple.com/textfonts/TTRefMan/RM06/Chap6name.html +// http://www.microsoft.com/typography/otspec/name.htm + +enum { // platformID + STBTT_PLATFORM_ID_UNICODE =0, + STBTT_PLATFORM_ID_MAC =1, + STBTT_PLATFORM_ID_ISO =2, + STBTT_PLATFORM_ID_MICROSOFT =3 +}; + +enum { // encodingID for STBTT_PLATFORM_ID_UNICODE + STBTT_UNICODE_EID_UNICODE_1_0 =0, + STBTT_UNICODE_EID_UNICODE_1_1 =1, + STBTT_UNICODE_EID_ISO_10646 =2, + STBTT_UNICODE_EID_UNICODE_2_0_BMP=3, + STBTT_UNICODE_EID_UNICODE_2_0_FULL=4 +}; + +enum { // encodingID for STBTT_PLATFORM_ID_MICROSOFT + STBTT_MS_EID_SYMBOL =0, + STBTT_MS_EID_UNICODE_BMP =1, + STBTT_MS_EID_SHIFTJIS =2, + STBTT_MS_EID_UNICODE_FULL =10 +}; + +enum { // encodingID for STBTT_PLATFORM_ID_MAC; same as Script Manager codes + STBTT_MAC_EID_ROMAN =0, STBTT_MAC_EID_ARABIC =4, + STBTT_MAC_EID_JAPANESE =1, STBTT_MAC_EID_HEBREW =5, + STBTT_MAC_EID_CHINESE_TRAD =2, STBTT_MAC_EID_GREEK =6, + STBTT_MAC_EID_KOREAN =3, STBTT_MAC_EID_RUSSIAN =7 +}; + +enum { // languageID for STBTT_PLATFORM_ID_MICROSOFT; same as LCID... + // problematic because there are e.g. 16 english LCIDs and 16 arabic LCIDs + STBTT_MS_LANG_ENGLISH =0x0409, STBTT_MS_LANG_ITALIAN =0x0410, + STBTT_MS_LANG_CHINESE =0x0804, STBTT_MS_LANG_JAPANESE =0x0411, + STBTT_MS_LANG_DUTCH =0x0413, STBTT_MS_LANG_KOREAN =0x0412, + STBTT_MS_LANG_FRENCH =0x040c, STBTT_MS_LANG_RUSSIAN =0x0419, + STBTT_MS_LANG_GERMAN =0x0407, STBTT_MS_LANG_SPANISH =0x0409, + STBTT_MS_LANG_HEBREW =0x040d, STBTT_MS_LANG_SWEDISH =0x041D +}; + +enum { // languageID for STBTT_PLATFORM_ID_MAC + STBTT_MAC_LANG_ENGLISH =0 , STBTT_MAC_LANG_JAPANESE =11, + STBTT_MAC_LANG_ARABIC =12, STBTT_MAC_LANG_KOREAN =23, + STBTT_MAC_LANG_DUTCH =4 , STBTT_MAC_LANG_RUSSIAN =32, + STBTT_MAC_LANG_FRENCH =1 , STBTT_MAC_LANG_SPANISH =6 , + STBTT_MAC_LANG_GERMAN =2 , STBTT_MAC_LANG_SWEDISH =5 , + STBTT_MAC_LANG_HEBREW =10, STBTT_MAC_LANG_CHINESE_SIMPLIFIED =33, + STBTT_MAC_LANG_ITALIAN =3 , STBTT_MAC_LANG_CHINESE_TRAD =19 +}; + +#ifdef __cplusplus +} +#endif + +#endif // __STB_INCLUDE_STB_TRUETYPE_H__ + +/////////////////////////////////////////////////////////////////////////////// +/////////////////////////////////////////////////////////////////////////////// +//// +//// IMPLEMENTATION +//// +//// + +#ifdef STB_TRUETYPE_IMPLEMENTATION + +#ifndef STBTT_MAX_OVERSAMPLE +#define STBTT_MAX_OVERSAMPLE 8 +#endif + +#if STBTT_MAX_OVERSAMPLE > 255 +#error "STBTT_MAX_OVERSAMPLE cannot be > 255" +#endif + +typedef int stbtt__test_oversample_pow2[(STBTT_MAX_OVERSAMPLE & (STBTT_MAX_OVERSAMPLE-1)) == 0 ? 1 : -1]; + +#ifndef STBTT_RASTERIZER_VERSION +#define STBTT_RASTERIZER_VERSION 2 +#endif + +#ifdef _MSC_VER +#define STBTT__NOTUSED(v) (void)(v) +#else +#define STBTT__NOTUSED(v) (void)sizeof(v) +#endif + +////////////////////////////////////////////////////////////////////////// +// +// stbtt__buf helpers to parse data from file +// + +static stbtt_uint8 stbtt__buf_get8(stbtt__buf *b) +{ + if (b->cursor >= b->size) + return 0; + return b->data[b->cursor++]; +} + +static stbtt_uint8 stbtt__buf_peek8(stbtt__buf *b) +{ + if (b->cursor >= b->size) + return 0; + return b->data[b->cursor]; +} + +static void stbtt__buf_seek(stbtt__buf *b, int o) +{ + STBTT_assert(!(o > b->size || o < 0)); + b->cursor = (o > b->size || o < 0) ? b->size : o; +} + +static void stbtt__buf_skip(stbtt__buf *b, int o) +{ + stbtt__buf_seek(b, b->cursor + o); +} + +static stbtt_uint32 stbtt__buf_get(stbtt__buf *b, int n) +{ + stbtt_uint32 v = 0; + int i; + STBTT_assert(n >= 1 && n <= 4); + for (i = 0; i < n; i++) + v = (v << 8) | stbtt__buf_get8(b); + return v; +} + +static stbtt__buf stbtt__new_buf(const void *p, size_t size) +{ + stbtt__buf r; + STBTT_assert(size < 0x40000000); + r.data = (stbtt_uint8*) p; + r.size = (int) size; + r.cursor = 0; + return r; +} + +#define stbtt__buf_get16(b) stbtt__buf_get((b), 2) +#define stbtt__buf_get32(b) stbtt__buf_get((b), 4) + +static stbtt__buf stbtt__buf_range(const stbtt__buf *b, int o, int s) +{ + stbtt__buf r = stbtt__new_buf(NULL, 0); + if (o < 0 || s < 0 || o > b->size || s > b->size - o) return r; + r.data = b->data + o; + r.size = s; + return r; +} + +static stbtt__buf stbtt__cff_get_index(stbtt__buf *b) +{ + int count, start, offsize; + start = b->cursor; + count = stbtt__buf_get16(b); + if (count) { + offsize = stbtt__buf_get8(b); + STBTT_assert(offsize >= 1 && offsize <= 4); + stbtt__buf_skip(b, offsize * count); + stbtt__buf_skip(b, stbtt__buf_get(b, offsize) - 1); + } + return stbtt__buf_range(b, start, b->cursor - start); +} + +static stbtt_uint32 stbtt__cff_int(stbtt__buf *b) +{ + int b0 = stbtt__buf_get8(b); + if (b0 >= 32 && b0 <= 246) return b0 - 139; + else if (b0 >= 247 && b0 <= 250) return (b0 - 247)*256 + stbtt__buf_get8(b) + 108; + else if (b0 >= 251 && b0 <= 254) return -(b0 - 251)*256 - stbtt__buf_get8(b) - 108; + else if (b0 == 28) return stbtt__buf_get16(b); + else if (b0 == 29) return stbtt__buf_get32(b); + STBTT_assert(0); + return 0; +} + +static void stbtt__cff_skip_operand(stbtt__buf *b) { + int v, b0 = stbtt__buf_peek8(b); + STBTT_assert(b0 >= 28); + if (b0 == 30) { + stbtt__buf_skip(b, 1); + while (b->cursor < b->size) { + v = stbtt__buf_get8(b); + if ((v & 0xF) == 0xF || (v >> 4) == 0xF) + break; + } + } else { + stbtt__cff_int(b); + } +} + +static stbtt__buf stbtt__dict_get(stbtt__buf *b, int key) +{ + stbtt__buf_seek(b, 0); + while (b->cursor < b->size) { + int start = b->cursor, end, op; + while (stbtt__buf_peek8(b) >= 28) + stbtt__cff_skip_operand(b); + end = b->cursor; + op = stbtt__buf_get8(b); + if (op == 12) op = stbtt__buf_get8(b) | 0x100; + if (op == key) return stbtt__buf_range(b, start, end-start); + } + return stbtt__buf_range(b, 0, 0); +} + +static void stbtt__dict_get_ints(stbtt__buf *b, int key, int outcount, stbtt_uint32 *out) +{ + int i; + stbtt__buf operands = stbtt__dict_get(b, key); + for (i = 0; i < outcount && operands.cursor < operands.size; i++) + out[i] = stbtt__cff_int(&operands); +} + +static int stbtt__cff_index_count(stbtt__buf *b) +{ + stbtt__buf_seek(b, 0); + return stbtt__buf_get16(b); +} + +static stbtt__buf stbtt__cff_index_get(stbtt__buf b, int i) +{ + int count, offsize, start, end; + stbtt__buf_seek(&b, 0); + count = stbtt__buf_get16(&b); + offsize = stbtt__buf_get8(&b); + STBTT_assert(i >= 0 && i < count); + STBTT_assert(offsize >= 1 && offsize <= 4); + stbtt__buf_skip(&b, i*offsize); + start = stbtt__buf_get(&b, offsize); + end = stbtt__buf_get(&b, offsize); + return stbtt__buf_range(&b, 2+(count+1)*offsize+start, end - start); +} + +////////////////////////////////////////////////////////////////////////// +// +// accessors to parse data from file +// + +// on platforms that don't allow misaligned reads, if we want to allow +// truetype fonts that aren't padded to alignment, define ALLOW_UNALIGNED_TRUETYPE + +#define ttBYTE(p) (* (stbtt_uint8 *) (p)) +#define ttCHAR(p) (* (stbtt_int8 *) (p)) +#define ttFixed(p) ttLONG(p) + +static stbtt_uint16 ttUSHORT(stbtt_uint8 *p) { return p[0]*256 + p[1]; } +static stbtt_int16 ttSHORT(stbtt_uint8 *p) { return p[0]*256 + p[1]; } +static stbtt_uint32 ttULONG(stbtt_uint8 *p) { return (p[0]<<24) + (p[1]<<16) + (p[2]<<8) + p[3]; } +static stbtt_int32 ttLONG(stbtt_uint8 *p) { return (p[0]<<24) + (p[1]<<16) + (p[2]<<8) + p[3]; } + +#define stbtt_tag4(p,c0,c1,c2,c3) ((p)[0] == (c0) && (p)[1] == (c1) && (p)[2] == (c2) && (p)[3] == (c3)) +#define stbtt_tag(p,str) stbtt_tag4(p,str[0],str[1],str[2],str[3]) + +static int stbtt__isfont(stbtt_uint8 *font) +{ + // check the version number + if (stbtt_tag4(font, '1',0,0,0)) return 1; // TrueType 1 + if (stbtt_tag(font, "typ1")) return 1; // TrueType with type 1 font -- we don't support this! + if (stbtt_tag(font, "OTTO")) return 1; // OpenType with CFF + if (stbtt_tag4(font, 0,1,0,0)) return 1; // OpenType 1.0 + if (stbtt_tag(font, "true")) return 1; // Apple specification for TrueType fonts + return 0; +} + +// @OPTIMIZE: binary search +static stbtt_uint32 stbtt__find_table(stbtt_uint8 *data, stbtt_uint32 fontstart, const char *tag) +{ + stbtt_int32 num_tables = ttUSHORT(data+fontstart+4); + stbtt_uint32 tabledir = fontstart + 12; + stbtt_int32 i; + for (i=0; i < num_tables; ++i) { + stbtt_uint32 loc = tabledir + 16*i; + if (stbtt_tag(data+loc+0, tag)) + return ttULONG(data+loc+8); + } + return 0; +} + +static int stbtt_GetFontOffsetForIndex_internal(unsigned char *font_collection, int index) +{ + // if it's just a font, there's only one valid index + if (stbtt__isfont(font_collection)) + return index == 0 ? 0 : -1; + + // check if it's a TTC + if (stbtt_tag(font_collection, "ttcf")) { + // version 1? + if (ttULONG(font_collection+4) == 0x00010000 || ttULONG(font_collection+4) == 0x00020000) { + stbtt_int32 n = ttLONG(font_collection+8); + if (index >= n) + return -1; + return ttULONG(font_collection+12+index*4); + } + } + return -1; +} + +static int stbtt_GetNumberOfFonts_internal(unsigned char *font_collection) +{ + // if it's just a font, there's only one valid font + if (stbtt__isfont(font_collection)) + return 1; + + // check if it's a TTC + if (stbtt_tag(font_collection, "ttcf")) { + // version 1? + if (ttULONG(font_collection+4) == 0x00010000 || ttULONG(font_collection+4) == 0x00020000) { + return ttLONG(font_collection+8); + } + } + return 0; +} + +static stbtt__buf stbtt__get_subrs(stbtt__buf cff, stbtt__buf fontdict) +{ + stbtt_uint32 subrsoff = 0, private_loc[2] = { 0, 0 }; + stbtt__buf pdict; + stbtt__dict_get_ints(&fontdict, 18, 2, private_loc); + if (!private_loc[1] || !private_loc[0]) return stbtt__new_buf(NULL, 0); + pdict = stbtt__buf_range(&cff, private_loc[1], private_loc[0]); + stbtt__dict_get_ints(&pdict, 19, 1, &subrsoff); + if (!subrsoff) return stbtt__new_buf(NULL, 0); + stbtt__buf_seek(&cff, private_loc[1]+subrsoff); + return stbtt__cff_get_index(&cff); +} + +// since most people won't use this, find this table the first time it's needed +static int stbtt__get_svg(stbtt_fontinfo *info) +{ + stbtt_uint32 t; + if (info->svg < 0) { + t = stbtt__find_table(info->data, info->fontstart, "SVG "); + if (t) { + stbtt_uint32 offset = ttULONG(info->data + t + 2); + info->svg = t + offset; + } else { + info->svg = 0; + } + } + return info->svg; +} + +static int stbtt_InitFont_internal(stbtt_fontinfo *info, unsigned char *data, int fontstart) +{ + stbtt_uint32 cmap, t; + stbtt_int32 i,numTables; + + info->data = data; + info->fontstart = fontstart; + info->cff = stbtt__new_buf(NULL, 0); + + cmap = stbtt__find_table(data, fontstart, "cmap"); // required + info->loca = stbtt__find_table(data, fontstart, "loca"); // required + info->head = stbtt__find_table(data, fontstart, "head"); // required + info->glyf = stbtt__find_table(data, fontstart, "glyf"); // required + info->hhea = stbtt__find_table(data, fontstart, "hhea"); // required + info->hmtx = stbtt__find_table(data, fontstart, "hmtx"); // required + info->kern = stbtt__find_table(data, fontstart, "kern"); // not required + info->gpos = stbtt__find_table(data, fontstart, "GPOS"); // not required + + if (!cmap || !info->head || !info->hhea || !info->hmtx) + return 0; + if (info->glyf) { + // required for truetype + if (!info->loca) return 0; + } else { + // initialization for CFF / Type2 fonts (OTF) + stbtt__buf b, topdict, topdictidx; + stbtt_uint32 cstype = 2, charstrings = 0, fdarrayoff = 0, fdselectoff = 0; + stbtt_uint32 cff; + + cff = stbtt__find_table(data, fontstart, "CFF "); + if (!cff) return 0; + + info->fontdicts = stbtt__new_buf(NULL, 0); + info->fdselect = stbtt__new_buf(NULL, 0); + + // @TODO this should use size from table (not 512MB) + info->cff = stbtt__new_buf(data+cff, 512*1024*1024); + b = info->cff; + + // read the header + stbtt__buf_skip(&b, 2); + stbtt__buf_seek(&b, stbtt__buf_get8(&b)); // hdrsize + + // @TODO the name INDEX could list multiple fonts, + // but we just use the first one. + stbtt__cff_get_index(&b); // name INDEX + topdictidx = stbtt__cff_get_index(&b); + topdict = stbtt__cff_index_get(topdictidx, 0); + stbtt__cff_get_index(&b); // string INDEX + info->gsubrs = stbtt__cff_get_index(&b); + + stbtt__dict_get_ints(&topdict, 17, 1, &charstrings); + stbtt__dict_get_ints(&topdict, 0x100 | 6, 1, &cstype); + stbtt__dict_get_ints(&topdict, 0x100 | 36, 1, &fdarrayoff); + stbtt__dict_get_ints(&topdict, 0x100 | 37, 1, &fdselectoff); + info->subrs = stbtt__get_subrs(b, topdict); + + // we only support Type 2 charstrings + if (cstype != 2) return 0; + if (charstrings == 0) return 0; + + if (fdarrayoff) { + // looks like a CID font + if (!fdselectoff) return 0; + stbtt__buf_seek(&b, fdarrayoff); + info->fontdicts = stbtt__cff_get_index(&b); + info->fdselect = stbtt__buf_range(&b, fdselectoff, b.size-fdselectoff); + } + + stbtt__buf_seek(&b, charstrings); + info->charstrings = stbtt__cff_get_index(&b); + } + + t = stbtt__find_table(data, fontstart, "maxp"); + if (t) + info->numGlyphs = ttUSHORT(data+t+4); + else + info->numGlyphs = 0xffff; + + info->svg = -1; + + // find a cmap encoding table we understand *now* to avoid searching + // later. (todo: could make this installable) + // the same regardless of glyph. + numTables = ttUSHORT(data + cmap + 2); + info->index_map = 0; + for (i=0; i < numTables; ++i) { + stbtt_uint32 encoding_record = cmap + 4 + 8 * i; + // find an encoding we understand: + switch(ttUSHORT(data+encoding_record)) { + case STBTT_PLATFORM_ID_MICROSOFT: + switch (ttUSHORT(data+encoding_record+2)) { + case STBTT_MS_EID_UNICODE_BMP: + case STBTT_MS_EID_UNICODE_FULL: + // MS/Unicode + info->index_map = cmap + ttULONG(data+encoding_record+4); + break; + } + break; + case STBTT_PLATFORM_ID_UNICODE: + // Mac/iOS has these + // all the encodingIDs are unicode, so we don't bother to check it + info->index_map = cmap + ttULONG(data+encoding_record+4); + break; + } + } + if (info->index_map == 0) + return 0; + + info->indexToLocFormat = ttUSHORT(data+info->head + 50); + return 1; +} + +STBTT_DEF int stbtt_FindGlyphIndex(const stbtt_fontinfo *info, int unicode_codepoint) +{ + stbtt_uint8 *data = info->data; + stbtt_uint32 index_map = info->index_map; + + stbtt_uint16 format = ttUSHORT(data + index_map + 0); + if (format == 0) { // apple byte encoding + stbtt_int32 bytes = ttUSHORT(data + index_map + 2); + if (unicode_codepoint < bytes-6) + return ttBYTE(data + index_map + 6 + unicode_codepoint); + return 0; + } else if (format == 6) { + stbtt_uint32 first = ttUSHORT(data + index_map + 6); + stbtt_uint32 count = ttUSHORT(data + index_map + 8); + if ((stbtt_uint32) unicode_codepoint >= first && (stbtt_uint32) unicode_codepoint < first+count) + return ttUSHORT(data + index_map + 10 + (unicode_codepoint - first)*2); + return 0; + } else if (format == 2) { + STBTT_assert(0); // @TODO: high-byte mapping for japanese/chinese/korean + return 0; + } else if (format == 4) { // standard mapping for windows fonts: binary search collection of ranges + stbtt_uint16 segcount = ttUSHORT(data+index_map+6) >> 1; + stbtt_uint16 searchRange = ttUSHORT(data+index_map+8) >> 1; + stbtt_uint16 entrySelector = ttUSHORT(data+index_map+10); + stbtt_uint16 rangeShift = ttUSHORT(data+index_map+12) >> 1; + + // do a binary search of the segments + stbtt_uint32 endCount = index_map + 14; + stbtt_uint32 search = endCount; + + if (unicode_codepoint > 0xffff) + return 0; + + // they lie from endCount .. endCount + segCount + // but searchRange is the nearest power of two, so... + if (unicode_codepoint >= ttUSHORT(data + search + rangeShift*2)) + search += rangeShift*2; + + // now decrement to bias correctly to find smallest + search -= 2; + while (entrySelector) { + stbtt_uint16 end; + searchRange >>= 1; + end = ttUSHORT(data + search + searchRange*2); + if (unicode_codepoint > end) + search += searchRange*2; + --entrySelector; + } + search += 2; + + { + stbtt_uint16 offset, start, last; + stbtt_uint16 item = (stbtt_uint16) ((search - endCount) >> 1); + + start = ttUSHORT(data + index_map + 14 + segcount*2 + 2 + 2*item); + last = ttUSHORT(data + endCount + 2*item); + if (unicode_codepoint < start || unicode_codepoint > last) + return 0; + + offset = ttUSHORT(data + index_map + 14 + segcount*6 + 2 + 2*item); + if (offset == 0) + return (stbtt_uint16) (unicode_codepoint + ttSHORT(data + index_map + 14 + segcount*4 + 2 + 2*item)); + + return ttUSHORT(data + offset + (unicode_codepoint-start)*2 + index_map + 14 + segcount*6 + 2 + 2*item); + } + } else if (format == 12 || format == 13) { + stbtt_uint32 ngroups = ttULONG(data+index_map+12); + stbtt_int32 low,high; + low = 0; high = (stbtt_int32)ngroups; + // Binary search the right group. + while (low < high) { + stbtt_int32 mid = low + ((high-low) >> 1); // rounds down, so low <= mid < high + stbtt_uint32 start_char = ttULONG(data+index_map+16+mid*12); + stbtt_uint32 end_char = ttULONG(data+index_map+16+mid*12+4); + if ((stbtt_uint32) unicode_codepoint < start_char) + high = mid; + else if ((stbtt_uint32) unicode_codepoint > end_char) + low = mid+1; + else { + stbtt_uint32 start_glyph = ttULONG(data+index_map+16+mid*12+8); + if (format == 12) + return start_glyph + unicode_codepoint-start_char; + else // format == 13 + return start_glyph; + } + } + return 0; // not found + } + // @TODO + STBTT_assert(0); + return 0; +} + +STBTT_DEF int stbtt_GetCodepointShape(const stbtt_fontinfo *info, int unicode_codepoint, stbtt_vertex **vertices) +{ + return stbtt_GetGlyphShape(info, stbtt_FindGlyphIndex(info, unicode_codepoint), vertices); +} + +static void stbtt_setvertex(stbtt_vertex *v, stbtt_uint8 type, stbtt_int32 x, stbtt_int32 y, stbtt_int32 cx, stbtt_int32 cy) +{ + v->type = type; + v->x = (stbtt_int16) x; + v->y = (stbtt_int16) y; + v->cx = (stbtt_int16) cx; + v->cy = (stbtt_int16) cy; +} + +static int stbtt__GetGlyfOffset(const stbtt_fontinfo *info, int glyph_index) +{ + int g1,g2; + + STBTT_assert(!info->cff.size); + + if (glyph_index >= info->numGlyphs) return -1; // glyph index out of range + if (info->indexToLocFormat >= 2) return -1; // unknown index->glyph map format + + if (info->indexToLocFormat == 0) { + g1 = info->glyf + ttUSHORT(info->data + info->loca + glyph_index * 2) * 2; + g2 = info->glyf + ttUSHORT(info->data + info->loca + glyph_index * 2 + 2) * 2; + } else { + g1 = info->glyf + ttULONG (info->data + info->loca + glyph_index * 4); + g2 = info->glyf + ttULONG (info->data + info->loca + glyph_index * 4 + 4); + } + + return g1==g2 ? -1 : g1; // if length is 0, return -1 +} + +static int stbtt__GetGlyphInfoT2(const stbtt_fontinfo *info, int glyph_index, int *x0, int *y0, int *x1, int *y1); + +STBTT_DEF int stbtt_GetGlyphBox(const stbtt_fontinfo *info, int glyph_index, int *x0, int *y0, int *x1, int *y1) +{ + if (info->cff.size) { + stbtt__GetGlyphInfoT2(info, glyph_index, x0, y0, x1, y1); + } else { + int g = stbtt__GetGlyfOffset(info, glyph_index); + if (g < 0) return 0; + + if (x0) *x0 = ttSHORT(info->data + g + 2); + if (y0) *y0 = ttSHORT(info->data + g + 4); + if (x1) *x1 = ttSHORT(info->data + g + 6); + if (y1) *y1 = ttSHORT(info->data + g + 8); + } + return 1; +} + +STBTT_DEF int stbtt_GetCodepointBox(const stbtt_fontinfo *info, int codepoint, int *x0, int *y0, int *x1, int *y1) +{ + return stbtt_GetGlyphBox(info, stbtt_FindGlyphIndex(info,codepoint), x0,y0,x1,y1); +} + +STBTT_DEF int stbtt_IsGlyphEmpty(const stbtt_fontinfo *info, int glyph_index) +{ + stbtt_int16 numberOfContours; + int g; + if (info->cff.size) + return stbtt__GetGlyphInfoT2(info, glyph_index, NULL, NULL, NULL, NULL) == 0; + g = stbtt__GetGlyfOffset(info, glyph_index); + if (g < 0) return 1; + numberOfContours = ttSHORT(info->data + g); + return numberOfContours == 0; +} + +static int stbtt__close_shape(stbtt_vertex *vertices, int num_vertices, int was_off, int start_off, + stbtt_int32 sx, stbtt_int32 sy, stbtt_int32 scx, stbtt_int32 scy, stbtt_int32 cx, stbtt_int32 cy) +{ + if (start_off) { + if (was_off) + stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve, (cx+scx)>>1, (cy+scy)>>1, cx,cy); + stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve, sx,sy,scx,scy); + } else { + if (was_off) + stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve,sx,sy,cx,cy); + else + stbtt_setvertex(&vertices[num_vertices++], STBTT_vline,sx,sy,0,0); + } + return num_vertices; +} + +static int stbtt__GetGlyphShapeTT(const stbtt_fontinfo *info, int glyph_index, stbtt_vertex **pvertices) +{ + stbtt_int16 numberOfContours; + stbtt_uint8 *endPtsOfContours; + stbtt_uint8 *data = info->data; + stbtt_vertex *vertices=0; + int num_vertices=0; + int g = stbtt__GetGlyfOffset(info, glyph_index); + + *pvertices = NULL; + + if (g < 0) return 0; + + numberOfContours = ttSHORT(data + g); + + if (numberOfContours > 0) { + stbtt_uint8 flags=0,flagcount; + stbtt_int32 ins, i,j=0,m,n, next_move, was_off=0, off, start_off=0; + stbtt_int32 x,y,cx,cy,sx,sy, scx,scy; + stbtt_uint8 *points; + endPtsOfContours = (data + g + 10); + ins = ttUSHORT(data + g + 10 + numberOfContours * 2); + points = data + g + 10 + numberOfContours * 2 + 2 + ins; + + n = 1+ttUSHORT(endPtsOfContours + numberOfContours*2-2); + + m = n + 2*numberOfContours; // a loose bound on how many vertices we might need + vertices = (stbtt_vertex *) STBTT_malloc(m * sizeof(vertices[0]), info->userdata); + if (vertices == 0) + return 0; + + next_move = 0; + flagcount=0; + + // in first pass, we load uninterpreted data into the allocated array + // above, shifted to the end of the array so we won't overwrite it when + // we create our final data starting from the front + + off = m - n; // starting offset for uninterpreted data, regardless of how m ends up being calculated + + // first load flags + + for (i=0; i < n; ++i) { + if (flagcount == 0) { + flags = *points++; + if (flags & 8) + flagcount = *points++; + } else + --flagcount; + vertices[off+i].type = flags; + } + + // now load x coordinates + x=0; + for (i=0; i < n; ++i) { + flags = vertices[off+i].type; + if (flags & 2) { + stbtt_int16 dx = *points++; + x += (flags & 16) ? dx : -dx; // ??? + } else { + if (!(flags & 16)) { + x = x + (stbtt_int16) (points[0]*256 + points[1]); + points += 2; + } + } + vertices[off+i].x = (stbtt_int16) x; + } + + // now load y coordinates + y=0; + for (i=0; i < n; ++i) { + flags = vertices[off+i].type; + if (flags & 4) { + stbtt_int16 dy = *points++; + y += (flags & 32) ? dy : -dy; // ??? + } else { + if (!(flags & 32)) { + y = y + (stbtt_int16) (points[0]*256 + points[1]); + points += 2; + } + } + vertices[off+i].y = (stbtt_int16) y; + } + + // now convert them to our format + num_vertices=0; + sx = sy = cx = cy = scx = scy = 0; + for (i=0; i < n; ++i) { + flags = vertices[off+i].type; + x = (stbtt_int16) vertices[off+i].x; + y = (stbtt_int16) vertices[off+i].y; + + if (next_move == i) { + if (i != 0) + num_vertices = stbtt__close_shape(vertices, num_vertices, was_off, start_off, sx,sy,scx,scy,cx,cy); + + // now start the new one + start_off = !(flags & 1); + if (start_off) { + // if we start off with an off-curve point, then when we need to find a point on the curve + // where we can start, and we need to save some state for when we wraparound. + scx = x; + scy = y; + if (!(vertices[off+i+1].type & 1)) { + // next point is also a curve point, so interpolate an on-point curve + sx = (x + (stbtt_int32) vertices[off+i+1].x) >> 1; + sy = (y + (stbtt_int32) vertices[off+i+1].y) >> 1; + } else { + // otherwise just use the next point as our start point + sx = (stbtt_int32) vertices[off+i+1].x; + sy = (stbtt_int32) vertices[off+i+1].y; + ++i; // we're using point i+1 as the starting point, so skip it + } + } else { + sx = x; + sy = y; + } + stbtt_setvertex(&vertices[num_vertices++], STBTT_vmove,sx,sy,0,0); + was_off = 0; + next_move = 1 + ttUSHORT(endPtsOfContours+j*2); + ++j; + } else { + if (!(flags & 1)) { // if it's a curve + if (was_off) // two off-curve control points in a row means interpolate an on-curve midpoint + stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve, (cx+x)>>1, (cy+y)>>1, cx, cy); + cx = x; + cy = y; + was_off = 1; + } else { + if (was_off) + stbtt_setvertex(&vertices[num_vertices++], STBTT_vcurve, x,y, cx, cy); + else + stbtt_setvertex(&vertices[num_vertices++], STBTT_vline, x,y,0,0); + was_off = 0; + } + } + } + num_vertices = stbtt__close_shape(vertices, num_vertices, was_off, start_off, sx,sy,scx,scy,cx,cy); + } else if (numberOfContours < 0) { + // Compound shapes. + int more = 1; + stbtt_uint8 *comp = data + g + 10; + num_vertices = 0; + vertices = 0; + while (more) { + stbtt_uint16 flags, gidx; + int comp_num_verts = 0, i; + stbtt_vertex *comp_verts = 0, *tmp = 0; + float mtx[6] = {1,0,0,1,0,0}, m, n; + + flags = ttSHORT(comp); comp+=2; + gidx = ttSHORT(comp); comp+=2; + + if (flags & 2) { // XY values + if (flags & 1) { // shorts + mtx[4] = ttSHORT(comp); comp+=2; + mtx[5] = ttSHORT(comp); comp+=2; + } else { + mtx[4] = ttCHAR(comp); comp+=1; + mtx[5] = ttCHAR(comp); comp+=1; + } + } + else { + // @TODO handle matching point + STBTT_assert(0); + } + if (flags & (1<<3)) { // WE_HAVE_A_SCALE + mtx[0] = mtx[3] = ttSHORT(comp)/16384.0f; comp+=2; + mtx[1] = mtx[2] = 0; + } else if (flags & (1<<6)) { // WE_HAVE_AN_X_AND_YSCALE + mtx[0] = ttSHORT(comp)/16384.0f; comp+=2; + mtx[1] = mtx[2] = 0; + mtx[3] = ttSHORT(comp)/16384.0f; comp+=2; + } else if (flags & (1<<7)) { // WE_HAVE_A_TWO_BY_TWO + mtx[0] = ttSHORT(comp)/16384.0f; comp+=2; + mtx[1] = ttSHORT(comp)/16384.0f; comp+=2; + mtx[2] = ttSHORT(comp)/16384.0f; comp+=2; + mtx[3] = ttSHORT(comp)/16384.0f; comp+=2; + } + + // Find transformation scales. + m = (float) STBTT_sqrt(mtx[0]*mtx[0] + mtx[1]*mtx[1]); + n = (float) STBTT_sqrt(mtx[2]*mtx[2] + mtx[3]*mtx[3]); + + // Get indexed glyph. + comp_num_verts = stbtt_GetGlyphShape(info, gidx, &comp_verts); + if (comp_num_verts > 0) { + // Transform vertices. + for (i = 0; i < comp_num_verts; ++i) { + stbtt_vertex* v = &comp_verts[i]; + stbtt_vertex_type x,y; + x=v->x; y=v->y; + v->x = (stbtt_vertex_type)(m * (mtx[0]*x + mtx[2]*y + mtx[4])); + v->y = (stbtt_vertex_type)(n * (mtx[1]*x + mtx[3]*y + mtx[5])); + x=v->cx; y=v->cy; + v->cx = (stbtt_vertex_type)(m * (mtx[0]*x + mtx[2]*y + mtx[4])); + v->cy = (stbtt_vertex_type)(n * (mtx[1]*x + mtx[3]*y + mtx[5])); + } + // Append vertices. + tmp = (stbtt_vertex*)STBTT_malloc((num_vertices+comp_num_verts)*sizeof(stbtt_vertex), info->userdata); + if (!tmp) { + if (vertices) STBTT_free(vertices, info->userdata); + if (comp_verts) STBTT_free(comp_verts, info->userdata); + return 0; + } + if (num_vertices > 0 && vertices) STBTT_memcpy(tmp, vertices, num_vertices*sizeof(stbtt_vertex)); + STBTT_memcpy(tmp+num_vertices, comp_verts, comp_num_verts*sizeof(stbtt_vertex)); + if (vertices) STBTT_free(vertices, info->userdata); + vertices = tmp; + STBTT_free(comp_verts, info->userdata); + num_vertices += comp_num_verts; + } + // More components ? + more = flags & (1<<5); + } + } else { + // numberOfCounters == 0, do nothing + } + + *pvertices = vertices; + return num_vertices; +} + +typedef struct +{ + int bounds; + int started; + float first_x, first_y; + float x, y; + stbtt_int32 min_x, max_x, min_y, max_y; + + stbtt_vertex *pvertices; + int num_vertices; +} stbtt__csctx; + +#define STBTT__CSCTX_INIT(bounds) {bounds,0, 0,0, 0,0, 0,0,0,0, NULL, 0} + +static void stbtt__track_vertex(stbtt__csctx *c, stbtt_int32 x, stbtt_int32 y) +{ + if (x > c->max_x || !c->started) c->max_x = x; + if (y > c->max_y || !c->started) c->max_y = y; + if (x < c->min_x || !c->started) c->min_x = x; + if (y < c->min_y || !c->started) c->min_y = y; + c->started = 1; +} + +static void stbtt__csctx_v(stbtt__csctx *c, stbtt_uint8 type, stbtt_int32 x, stbtt_int32 y, stbtt_int32 cx, stbtt_int32 cy, stbtt_int32 cx1, stbtt_int32 cy1) +{ + if (c->bounds) { + stbtt__track_vertex(c, x, y); + if (type == STBTT_vcubic) { + stbtt__track_vertex(c, cx, cy); + stbtt__track_vertex(c, cx1, cy1); + } + } else { + stbtt_setvertex(&c->pvertices[c->num_vertices], type, x, y, cx, cy); + c->pvertices[c->num_vertices].cx1 = (stbtt_int16) cx1; + c->pvertices[c->num_vertices].cy1 = (stbtt_int16) cy1; + } + c->num_vertices++; +} + +static void stbtt__csctx_close_shape(stbtt__csctx *ctx) +{ + if (ctx->first_x != ctx->x || ctx->first_y != ctx->y) + stbtt__csctx_v(ctx, STBTT_vline, (int)ctx->first_x, (int)ctx->first_y, 0, 0, 0, 0); +} + +static void stbtt__csctx_rmove_to(stbtt__csctx *ctx, float dx, float dy) +{ + stbtt__csctx_close_shape(ctx); + ctx->first_x = ctx->x = ctx->x + dx; + ctx->first_y = ctx->y = ctx->y + dy; + stbtt__csctx_v(ctx, STBTT_vmove, (int)ctx->x, (int)ctx->y, 0, 0, 0, 0); +} + +static void stbtt__csctx_rline_to(stbtt__csctx *ctx, float dx, float dy) +{ + ctx->x += dx; + ctx->y += dy; + stbtt__csctx_v(ctx, STBTT_vline, (int)ctx->x, (int)ctx->y, 0, 0, 0, 0); +} + +static void stbtt__csctx_rccurve_to(stbtt__csctx *ctx, float dx1, float dy1, float dx2, float dy2, float dx3, float dy3) +{ + float cx1 = ctx->x + dx1; + float cy1 = ctx->y + dy1; + float cx2 = cx1 + dx2; + float cy2 = cy1 + dy2; + ctx->x = cx2 + dx3; + ctx->y = cy2 + dy3; + stbtt__csctx_v(ctx, STBTT_vcubic, (int)ctx->x, (int)ctx->y, (int)cx1, (int)cy1, (int)cx2, (int)cy2); +} + +static stbtt__buf stbtt__get_subr(stbtt__buf idx, int n) +{ + int count = stbtt__cff_index_count(&idx); + int bias = 107; + if (count >= 33900) + bias = 32768; + else if (count >= 1240) + bias = 1131; + n += bias; + if (n < 0 || n >= count) + return stbtt__new_buf(NULL, 0); + return stbtt__cff_index_get(idx, n); +} + +static stbtt__buf stbtt__cid_get_glyph_subrs(const stbtt_fontinfo *info, int glyph_index) +{ + stbtt__buf fdselect = info->fdselect; + int nranges, start, end, v, fmt, fdselector = -1, i; + + stbtt__buf_seek(&fdselect, 0); + fmt = stbtt__buf_get8(&fdselect); + if (fmt == 0) { + // untested + stbtt__buf_skip(&fdselect, glyph_index); + fdselector = stbtt__buf_get8(&fdselect); + } else if (fmt == 3) { + nranges = stbtt__buf_get16(&fdselect); + start = stbtt__buf_get16(&fdselect); + for (i = 0; i < nranges; i++) { + v = stbtt__buf_get8(&fdselect); + end = stbtt__buf_get16(&fdselect); + if (glyph_index >= start && glyph_index < end) { + fdselector = v; + break; + } + start = end; + } + } + if (fdselector == -1) stbtt__new_buf(NULL, 0); + return stbtt__get_subrs(info->cff, stbtt__cff_index_get(info->fontdicts, fdselector)); +} + +static int stbtt__run_charstring(const stbtt_fontinfo *info, int glyph_index, stbtt__csctx *c) +{ + int in_header = 1, maskbits = 0, subr_stack_height = 0, sp = 0, v, i, b0; + int has_subrs = 0, clear_stack; + float s[48]; + stbtt__buf subr_stack[10], subrs = info->subrs, b; + float f; + +#define STBTT__CSERR(s) (0) + + // this currently ignores the initial width value, which isn't needed if we have hmtx + b = stbtt__cff_index_get(info->charstrings, glyph_index); + while (b.cursor < b.size) { + i = 0; + clear_stack = 1; + b0 = stbtt__buf_get8(&b); + switch (b0) { + // @TODO implement hinting + case 0x13: // hintmask + case 0x14: // cntrmask + if (in_header) + maskbits += (sp / 2); // implicit "vstem" + in_header = 0; + stbtt__buf_skip(&b, (maskbits + 7) / 8); + break; + + case 0x01: // hstem + case 0x03: // vstem + case 0x12: // hstemhm + case 0x17: // vstemhm + maskbits += (sp / 2); + break; + + case 0x15: // rmoveto + in_header = 0; + if (sp < 2) return STBTT__CSERR("rmoveto stack"); + stbtt__csctx_rmove_to(c, s[sp-2], s[sp-1]); + break; + case 0x04: // vmoveto + in_header = 0; + if (sp < 1) return STBTT__CSERR("vmoveto stack"); + stbtt__csctx_rmove_to(c, 0, s[sp-1]); + break; + case 0x16: // hmoveto + in_header = 0; + if (sp < 1) return STBTT__CSERR("hmoveto stack"); + stbtt__csctx_rmove_to(c, s[sp-1], 0); + break; + + case 0x05: // rlineto + if (sp < 2) return STBTT__CSERR("rlineto stack"); + for (; i + 1 < sp; i += 2) + stbtt__csctx_rline_to(c, s[i], s[i+1]); + break; + + // hlineto/vlineto and vhcurveto/hvcurveto alternate horizontal and vertical + // starting from a different place. + + case 0x07: // vlineto + if (sp < 1) return STBTT__CSERR("vlineto stack"); + goto vlineto; + case 0x06: // hlineto + if (sp < 1) return STBTT__CSERR("hlineto stack"); + for (;;) { + if (i >= sp) break; + stbtt__csctx_rline_to(c, s[i], 0); + i++; + vlineto: + if (i >= sp) break; + stbtt__csctx_rline_to(c, 0, s[i]); + i++; + } + break; + + case 0x1F: // hvcurveto + if (sp < 4) return STBTT__CSERR("hvcurveto stack"); + goto hvcurveto; + case 0x1E: // vhcurveto + if (sp < 4) return STBTT__CSERR("vhcurveto stack"); + for (;;) { + if (i + 3 >= sp) break; + stbtt__csctx_rccurve_to(c, 0, s[i], s[i+1], s[i+2], s[i+3], (sp - i == 5) ? s[i + 4] : 0.0f); + i += 4; + hvcurveto: + if (i + 3 >= sp) break; + stbtt__csctx_rccurve_to(c, s[i], 0, s[i+1], s[i+2], (sp - i == 5) ? s[i+4] : 0.0f, s[i+3]); + i += 4; + } + break; + + case 0x08: // rrcurveto + if (sp < 6) return STBTT__CSERR("rcurveline stack"); + for (; i + 5 < sp; i += 6) + stbtt__csctx_rccurve_to(c, s[i], s[i+1], s[i+2], s[i+3], s[i+4], s[i+5]); + break; + + case 0x18: // rcurveline + if (sp < 8) return STBTT__CSERR("rcurveline stack"); + for (; i + 5 < sp - 2; i += 6) + stbtt__csctx_rccurve_to(c, s[i], s[i+1], s[i+2], s[i+3], s[i+4], s[i+5]); + if (i + 1 >= sp) return STBTT__CSERR("rcurveline stack"); + stbtt__csctx_rline_to(c, s[i], s[i+1]); + break; + + case 0x19: // rlinecurve + if (sp < 8) return STBTT__CSERR("rlinecurve stack"); + for (; i + 1 < sp - 6; i += 2) + stbtt__csctx_rline_to(c, s[i], s[i+1]); + if (i + 5 >= sp) return STBTT__CSERR("rlinecurve stack"); + stbtt__csctx_rccurve_to(c, s[i], s[i+1], s[i+2], s[i+3], s[i+4], s[i+5]); + break; + + case 0x1A: // vvcurveto + case 0x1B: // hhcurveto + if (sp < 4) return STBTT__CSERR("(vv|hh)curveto stack"); + f = 0.0; + if (sp & 1) { f = s[i]; i++; } + for (; i + 3 < sp; i += 4) { + if (b0 == 0x1B) + stbtt__csctx_rccurve_to(c, s[i], f, s[i+1], s[i+2], s[i+3], 0.0); + else + stbtt__csctx_rccurve_to(c, f, s[i], s[i+1], s[i+2], 0.0, s[i+3]); + f = 0.0; + } + break; + + case 0x0A: // callsubr + if (!has_subrs) { + if (info->fdselect.size) + subrs = stbtt__cid_get_glyph_subrs(info, glyph_index); + has_subrs = 1; + } + // FALLTHROUGH + case 0x1D: // callgsubr + if (sp < 1) return STBTT__CSERR("call(g|)subr stack"); + v = (int) s[--sp]; + if (subr_stack_height >= 10) return STBTT__CSERR("recursion limit"); + subr_stack[subr_stack_height++] = b; + b = stbtt__get_subr(b0 == 0x0A ? subrs : info->gsubrs, v); + if (b.size == 0) return STBTT__CSERR("subr not found"); + b.cursor = 0; + clear_stack = 0; + break; + + case 0x0B: // return + if (subr_stack_height <= 0) return STBTT__CSERR("return outside subr"); + b = subr_stack[--subr_stack_height]; + clear_stack = 0; + break; + + case 0x0E: // endchar + stbtt__csctx_close_shape(c); + return 1; + + case 0x0C: { // two-byte escape + float dx1, dx2, dx3, dx4, dx5, dx6, dy1, dy2, dy3, dy4, dy5, dy6; + float dx, dy; + int b1 = stbtt__buf_get8(&b); + switch (b1) { + // @TODO These "flex" implementations ignore the flex-depth and resolution, + // and always draw beziers. + case 0x22: // hflex + if (sp < 7) return STBTT__CSERR("hflex stack"); + dx1 = s[0]; + dx2 = s[1]; + dy2 = s[2]; + dx3 = s[3]; + dx4 = s[4]; + dx5 = s[5]; + dx6 = s[6]; + stbtt__csctx_rccurve_to(c, dx1, 0, dx2, dy2, dx3, 0); + stbtt__csctx_rccurve_to(c, dx4, 0, dx5, -dy2, dx6, 0); + break; + + case 0x23: // flex + if (sp < 13) return STBTT__CSERR("flex stack"); + dx1 = s[0]; + dy1 = s[1]; + dx2 = s[2]; + dy2 = s[3]; + dx3 = s[4]; + dy3 = s[5]; + dx4 = s[6]; + dy4 = s[7]; + dx5 = s[8]; + dy5 = s[9]; + dx6 = s[10]; + dy6 = s[11]; + //fd is s[12] + stbtt__csctx_rccurve_to(c, dx1, dy1, dx2, dy2, dx3, dy3); + stbtt__csctx_rccurve_to(c, dx4, dy4, dx5, dy5, dx6, dy6); + break; + + case 0x24: // hflex1 + if (sp < 9) return STBTT__CSERR("hflex1 stack"); + dx1 = s[0]; + dy1 = s[1]; + dx2 = s[2]; + dy2 = s[3]; + dx3 = s[4]; + dx4 = s[5]; + dx5 = s[6]; + dy5 = s[7]; + dx6 = s[8]; + stbtt__csctx_rccurve_to(c, dx1, dy1, dx2, dy2, dx3, 0); + stbtt__csctx_rccurve_to(c, dx4, 0, dx5, dy5, dx6, -(dy1+dy2+dy5)); + break; + + case 0x25: // flex1 + if (sp < 11) return STBTT__CSERR("flex1 stack"); + dx1 = s[0]; + dy1 = s[1]; + dx2 = s[2]; + dy2 = s[3]; + dx3 = s[4]; + dy3 = s[5]; + dx4 = s[6]; + dy4 = s[7]; + dx5 = s[8]; + dy5 = s[9]; + dx6 = dy6 = s[10]; + dx = dx1+dx2+dx3+dx4+dx5; + dy = dy1+dy2+dy3+dy4+dy5; + if (STBTT_fabs(dx) > STBTT_fabs(dy)) + dy6 = -dy; + else + dx6 = -dx; + stbtt__csctx_rccurve_to(c, dx1, dy1, dx2, dy2, dx3, dy3); + stbtt__csctx_rccurve_to(c, dx4, dy4, dx5, dy5, dx6, dy6); + break; + + default: + return STBTT__CSERR("unimplemented"); + } + } break; + + default: + if (b0 != 255 && b0 != 28 && b0 < 32) + return STBTT__CSERR("reserved operator"); + + // push immediate + if (b0 == 255) { + f = (float)(stbtt_int32)stbtt__buf_get32(&b) / 0x10000; + } else { + stbtt__buf_skip(&b, -1); + f = (float)(stbtt_int16)stbtt__cff_int(&b); + } + if (sp >= 48) return STBTT__CSERR("push stack overflow"); + s[sp++] = f; + clear_stack = 0; + break; + } + if (clear_stack) sp = 0; + } + return STBTT__CSERR("no endchar"); + +#undef STBTT__CSERR +} + +static int stbtt__GetGlyphShapeT2(const stbtt_fontinfo *info, int glyph_index, stbtt_vertex **pvertices) +{ + // runs the charstring twice, once to count and once to output (to avoid realloc) + stbtt__csctx count_ctx = STBTT__CSCTX_INIT(1); + stbtt__csctx output_ctx = STBTT__CSCTX_INIT(0); + if (stbtt__run_charstring(info, glyph_index, &count_ctx)) { + *pvertices = (stbtt_vertex*)STBTT_malloc(count_ctx.num_vertices*sizeof(stbtt_vertex), info->userdata); + output_ctx.pvertices = *pvertices; + if (stbtt__run_charstring(info, glyph_index, &output_ctx)) { + STBTT_assert(output_ctx.num_vertices == count_ctx.num_vertices); + return output_ctx.num_vertices; + } + } + *pvertices = NULL; + return 0; +} + +static int stbtt__GetGlyphInfoT2(const stbtt_fontinfo *info, int glyph_index, int *x0, int *y0, int *x1, int *y1) +{ + stbtt__csctx c = STBTT__CSCTX_INIT(1); + int r = stbtt__run_charstring(info, glyph_index, &c); + if (x0) *x0 = r ? c.min_x : 0; + if (y0) *y0 = r ? c.min_y : 0; + if (x1) *x1 = r ? c.max_x : 0; + if (y1) *y1 = r ? c.max_y : 0; + return r ? c.num_vertices : 0; +} + +STBTT_DEF int stbtt_GetGlyphShape(const stbtt_fontinfo *info, int glyph_index, stbtt_vertex **pvertices) +{ + if (!info->cff.size) + return stbtt__GetGlyphShapeTT(info, glyph_index, pvertices); + else + return stbtt__GetGlyphShapeT2(info, glyph_index, pvertices); +} + +STBTT_DEF void stbtt_GetGlyphHMetrics(const stbtt_fontinfo *info, int glyph_index, int *advanceWidth, int *leftSideBearing) +{ + stbtt_uint16 numOfLongHorMetrics = ttUSHORT(info->data+info->hhea + 34); + if (glyph_index < numOfLongHorMetrics) { + if (advanceWidth) *advanceWidth = ttSHORT(info->data + info->hmtx + 4*glyph_index); + if (leftSideBearing) *leftSideBearing = ttSHORT(info->data + info->hmtx + 4*glyph_index + 2); + } else { + if (advanceWidth) *advanceWidth = ttSHORT(info->data + info->hmtx + 4*(numOfLongHorMetrics-1)); + if (leftSideBearing) *leftSideBearing = ttSHORT(info->data + info->hmtx + 4*numOfLongHorMetrics + 2*(glyph_index - numOfLongHorMetrics)); + } +} + +STBTT_DEF int stbtt_GetKerningTableLength(const stbtt_fontinfo *info) +{ + stbtt_uint8 *data = info->data + info->kern; + + // we only look at the first table. it must be 'horizontal' and format 0. + if (!info->kern) + return 0; + if (ttUSHORT(data+2) < 1) // number of tables, need at least 1 + return 0; + if (ttUSHORT(data+8) != 1) // horizontal flag must be set in format + return 0; + + return ttUSHORT(data+10); +} + +STBTT_DEF int stbtt_GetKerningTable(const stbtt_fontinfo *info, stbtt_kerningentry* table, int table_length) +{ + stbtt_uint8 *data = info->data + info->kern; + int k, length; + + // we only look at the first table. it must be 'horizontal' and format 0. + if (!info->kern) + return 0; + if (ttUSHORT(data+2) < 1) // number of tables, need at least 1 + return 0; + if (ttUSHORT(data+8) != 1) // horizontal flag must be set in format + return 0; + + length = ttUSHORT(data+10); + if (table_length < length) + length = table_length; + + for (k = 0; k < length; k++) + { + table[k].glyph1 = ttUSHORT(data+18+(k*6)); + table[k].glyph2 = ttUSHORT(data+20+(k*6)); + table[k].advance = ttSHORT(data+22+(k*6)); + } + + return length; +} + +static int stbtt__GetGlyphKernInfoAdvance(const stbtt_fontinfo *info, int glyph1, int glyph2) +{ + stbtt_uint8 *data = info->data + info->kern; + stbtt_uint32 needle, straw; + int l, r, m; + + // we only look at the first table. it must be 'horizontal' and format 0. + if (!info->kern) + return 0; + if (ttUSHORT(data+2) < 1) // number of tables, need at least 1 + return 0; + if (ttUSHORT(data+8) != 1) // horizontal flag must be set in format + return 0; + + l = 0; + r = ttUSHORT(data+10) - 1; + needle = glyph1 << 16 | glyph2; + while (l <= r) { + m = (l + r) >> 1; + straw = ttULONG(data+18+(m*6)); // note: unaligned read + if (needle < straw) + r = m - 1; + else if (needle > straw) + l = m + 1; + else + return ttSHORT(data+22+(m*6)); + } + return 0; +} + +static stbtt_int32 stbtt__GetCoverageIndex(stbtt_uint8 *coverageTable, int glyph) +{ + stbtt_uint16 coverageFormat = ttUSHORT(coverageTable); + switch (coverageFormat) { + case 1: { + stbtt_uint16 glyphCount = ttUSHORT(coverageTable + 2); + + // Binary search. + stbtt_int32 l=0, r=glyphCount-1, m; + int straw, needle=glyph; + while (l <= r) { + stbtt_uint8 *glyphArray = coverageTable + 4; + stbtt_uint16 glyphID; + m = (l + r) >> 1; + glyphID = ttUSHORT(glyphArray + 2 * m); + straw = glyphID; + if (needle < straw) + r = m - 1; + else if (needle > straw) + l = m + 1; + else { + return m; + } + } + break; + } + + case 2: { + stbtt_uint16 rangeCount = ttUSHORT(coverageTable + 2); + stbtt_uint8 *rangeArray = coverageTable + 4; + + // Binary search. + stbtt_int32 l=0, r=rangeCount-1, m; + int strawStart, strawEnd, needle=glyph; + while (l <= r) { + stbtt_uint8 *rangeRecord; + m = (l + r) >> 1; + rangeRecord = rangeArray + 6 * m; + strawStart = ttUSHORT(rangeRecord); + strawEnd = ttUSHORT(rangeRecord + 2); + if (needle < strawStart) + r = m - 1; + else if (needle > strawEnd) + l = m + 1; + else { + stbtt_uint16 startCoverageIndex = ttUSHORT(rangeRecord + 4); + return startCoverageIndex + glyph - strawStart; + } + } + break; + } + + default: return -1; // unsupported + } + + return -1; +} + +static stbtt_int32 stbtt__GetGlyphClass(stbtt_uint8 *classDefTable, int glyph) +{ + stbtt_uint16 classDefFormat = ttUSHORT(classDefTable); + switch (classDefFormat) + { + case 1: { + stbtt_uint16 startGlyphID = ttUSHORT(classDefTable + 2); + stbtt_uint16 glyphCount = ttUSHORT(classDefTable + 4); + stbtt_uint8 *classDef1ValueArray = classDefTable + 6; + + if (glyph >= startGlyphID && glyph < startGlyphID + glyphCount) + return (stbtt_int32)ttUSHORT(classDef1ValueArray + 2 * (glyph - startGlyphID)); + break; + } + + case 2: { + stbtt_uint16 classRangeCount = ttUSHORT(classDefTable + 2); + stbtt_uint8 *classRangeRecords = classDefTable + 4; + + // Binary search. + stbtt_int32 l=0, r=classRangeCount-1, m; + int strawStart, strawEnd, needle=glyph; + while (l <= r) { + stbtt_uint8 *classRangeRecord; + m = (l + r) >> 1; + classRangeRecord = classRangeRecords + 6 * m; + strawStart = ttUSHORT(classRangeRecord); + strawEnd = ttUSHORT(classRangeRecord + 2); + if (needle < strawStart) + r = m - 1; + else if (needle > strawEnd) + l = m + 1; + else + return (stbtt_int32)ttUSHORT(classRangeRecord + 4); + } + break; + } + + default: + return -1; // Unsupported definition type, return an error. + } + + // "All glyphs not assigned to a class fall into class 0". (OpenType spec) + return 0; +} + +// Define to STBTT_assert(x) if you want to break on unimplemented formats. +#define STBTT_GPOS_TODO_assert(x) + +static stbtt_int32 stbtt__GetGlyphGPOSInfoAdvance(const stbtt_fontinfo *info, int glyph1, int glyph2) +{ + stbtt_uint16 lookupListOffset; + stbtt_uint8 *lookupList; + stbtt_uint16 lookupCount; + stbtt_uint8 *data; + stbtt_int32 i, sti; + + if (!info->gpos) return 0; + + data = info->data + info->gpos; + + if (ttUSHORT(data+0) != 1) return 0; // Major version 1 + if (ttUSHORT(data+2) != 0) return 0; // Minor version 0 + + lookupListOffset = ttUSHORT(data+8); + lookupList = data + lookupListOffset; + lookupCount = ttUSHORT(lookupList); + + for (i=0; i= pairSetCount) return 0; + + needle=glyph2; + r=pairValueCount-1; + l=0; + + // Binary search. + while (l <= r) { + stbtt_uint16 secondGlyph; + stbtt_uint8 *pairValue; + m = (l + r) >> 1; + pairValue = pairValueArray + (2 + valueRecordPairSizeInBytes) * m; + secondGlyph = ttUSHORT(pairValue); + straw = secondGlyph; + if (needle < straw) + r = m - 1; + else if (needle > straw) + l = m + 1; + else { + stbtt_int16 xAdvance = ttSHORT(pairValue + 2); + return xAdvance; + } + } + } else + return 0; + break; + } + + case 2: { + stbtt_uint16 valueFormat1 = ttUSHORT(table + 4); + stbtt_uint16 valueFormat2 = ttUSHORT(table + 6); + if (valueFormat1 == 4 && valueFormat2 == 0) { // Support more formats? + stbtt_uint16 classDef1Offset = ttUSHORT(table + 8); + stbtt_uint16 classDef2Offset = ttUSHORT(table + 10); + int glyph1class = stbtt__GetGlyphClass(table + classDef1Offset, glyph1); + int glyph2class = stbtt__GetGlyphClass(table + classDef2Offset, glyph2); + + stbtt_uint16 class1Count = ttUSHORT(table + 12); + stbtt_uint16 class2Count = ttUSHORT(table + 14); + stbtt_uint8 *class1Records, *class2Records; + stbtt_int16 xAdvance; + + if (glyph1class < 0 || glyph1class >= class1Count) return 0; // malformed + if (glyph2class < 0 || glyph2class >= class2Count) return 0; // malformed + + class1Records = table + 16; + class2Records = class1Records + 2 * (glyph1class * class2Count); + xAdvance = ttSHORT(class2Records + 2 * glyph2class); + return xAdvance; + } else + return 0; + break; + } + + default: + return 0; // Unsupported position format + } + } + } + + return 0; +} + +STBTT_DEF int stbtt_GetGlyphKernAdvance(const stbtt_fontinfo *info, int g1, int g2) +{ + int xAdvance = 0; + + if (info->gpos) + xAdvance += stbtt__GetGlyphGPOSInfoAdvance(info, g1, g2); + else if (info->kern) + xAdvance += stbtt__GetGlyphKernInfoAdvance(info, g1, g2); + + return xAdvance; +} + +STBTT_DEF int stbtt_GetCodepointKernAdvance(const stbtt_fontinfo *info, int ch1, int ch2) +{ + if (!info->kern && !info->gpos) // if no kerning table, don't waste time looking up both codepoint->glyphs + return 0; + return stbtt_GetGlyphKernAdvance(info, stbtt_FindGlyphIndex(info,ch1), stbtt_FindGlyphIndex(info,ch2)); +} + +STBTT_DEF void stbtt_GetCodepointHMetrics(const stbtt_fontinfo *info, int codepoint, int *advanceWidth, int *leftSideBearing) +{ + stbtt_GetGlyphHMetrics(info, stbtt_FindGlyphIndex(info,codepoint), advanceWidth, leftSideBearing); +} + +STBTT_DEF void stbtt_GetFontVMetrics(const stbtt_fontinfo *info, int *ascent, int *descent, int *lineGap) +{ + if (ascent ) *ascent = ttSHORT(info->data+info->hhea + 4); + if (descent) *descent = ttSHORT(info->data+info->hhea + 6); + if (lineGap) *lineGap = ttSHORT(info->data+info->hhea + 8); +} + +STBTT_DEF int stbtt_GetFontVMetricsOS2(const stbtt_fontinfo *info, int *typoAscent, int *typoDescent, int *typoLineGap) +{ + int tab = stbtt__find_table(info->data, info->fontstart, "OS/2"); + if (!tab) + return 0; + if (typoAscent ) *typoAscent = ttSHORT(info->data+tab + 68); + if (typoDescent) *typoDescent = ttSHORT(info->data+tab + 70); + if (typoLineGap) *typoLineGap = ttSHORT(info->data+tab + 72); + return 1; +} + +STBTT_DEF void stbtt_GetFontBoundingBox(const stbtt_fontinfo *info, int *x0, int *y0, int *x1, int *y1) +{ + *x0 = ttSHORT(info->data + info->head + 36); + *y0 = ttSHORT(info->data + info->head + 38); + *x1 = ttSHORT(info->data + info->head + 40); + *y1 = ttSHORT(info->data + info->head + 42); +} + +STBTT_DEF float stbtt_ScaleForPixelHeight(const stbtt_fontinfo *info, float height) +{ + int fheight = ttSHORT(info->data + info->hhea + 4) - ttSHORT(info->data + info->hhea + 6); + return (float) height / fheight; +} + +STBTT_DEF float stbtt_ScaleForMappingEmToPixels(const stbtt_fontinfo *info, float pixels) +{ + int unitsPerEm = ttUSHORT(info->data + info->head + 18); + return pixels / unitsPerEm; +} + +STBTT_DEF void stbtt_FreeShape(const stbtt_fontinfo *info, stbtt_vertex *v) +{ + STBTT_free(v, info->userdata); +} + +STBTT_DEF stbtt_uint8 *stbtt_FindSVGDoc(const stbtt_fontinfo *info, int gl) +{ + int i; + stbtt_uint8 *data = info->data; + stbtt_uint8 *svg_doc_list = data + stbtt__get_svg((stbtt_fontinfo *) info); + + int numEntries = ttUSHORT(svg_doc_list); + stbtt_uint8 *svg_docs = svg_doc_list + 2; + + for(i=0; i= ttUSHORT(svg_doc)) && (gl <= ttUSHORT(svg_doc + 2))) + return svg_doc; + } + return 0; +} + +STBTT_DEF int stbtt_GetGlyphSVG(const stbtt_fontinfo *info, int gl, const char **svg) +{ + stbtt_uint8 *data = info->data; + stbtt_uint8 *svg_doc; + + if (info->svg == 0) + return 0; + + svg_doc = stbtt_FindSVGDoc(info, gl); + if (svg_doc != NULL) { + *svg = (char *) data + info->svg + ttULONG(svg_doc + 4); + return ttULONG(svg_doc + 8); + } else { + return 0; + } +} + +STBTT_DEF int stbtt_GetCodepointSVG(const stbtt_fontinfo *info, int unicode_codepoint, const char **svg) +{ + return stbtt_GetGlyphSVG(info, stbtt_FindGlyphIndex(info, unicode_codepoint), svg); +} + +////////////////////////////////////////////////////////////////////////////// +// +// antialiasing software rasterizer +// + +STBTT_DEF void stbtt_GetGlyphBitmapBoxSubpixel(const stbtt_fontinfo *font, int glyph, float scale_x, float scale_y,float shift_x, float shift_y, int *ix0, int *iy0, int *ix1, int *iy1) +{ + int x0=0,y0=0,x1,y1; // =0 suppresses compiler warning + if (!stbtt_GetGlyphBox(font, glyph, &x0,&y0,&x1,&y1)) { + // e.g. space character + if (ix0) *ix0 = 0; + if (iy0) *iy0 = 0; + if (ix1) *ix1 = 0; + if (iy1) *iy1 = 0; + } else { + // move to integral bboxes (treating pixels as little squares, what pixels get touched)? + if (ix0) *ix0 = STBTT_ifloor( x0 * scale_x + shift_x); + if (iy0) *iy0 = STBTT_ifloor(-y1 * scale_y + shift_y); + if (ix1) *ix1 = STBTT_iceil ( x1 * scale_x + shift_x); + if (iy1) *iy1 = STBTT_iceil (-y0 * scale_y + shift_y); + } +} + +STBTT_DEF void stbtt_GetGlyphBitmapBox(const stbtt_fontinfo *font, int glyph, float scale_x, float scale_y, int *ix0, int *iy0, int *ix1, int *iy1) +{ + stbtt_GetGlyphBitmapBoxSubpixel(font, glyph, scale_x, scale_y,0.0f,0.0f, ix0, iy0, ix1, iy1); +} + +STBTT_DEF void stbtt_GetCodepointBitmapBoxSubpixel(const stbtt_fontinfo *font, int codepoint, float scale_x, float scale_y, float shift_x, float shift_y, int *ix0, int *iy0, int *ix1, int *iy1) +{ + stbtt_GetGlyphBitmapBoxSubpixel(font, stbtt_FindGlyphIndex(font,codepoint), scale_x, scale_y,shift_x,shift_y, ix0,iy0,ix1,iy1); +} + +STBTT_DEF void stbtt_GetCodepointBitmapBox(const stbtt_fontinfo *font, int codepoint, float scale_x, float scale_y, int *ix0, int *iy0, int *ix1, int *iy1) +{ + stbtt_GetCodepointBitmapBoxSubpixel(font, codepoint, scale_x, scale_y,0.0f,0.0f, ix0,iy0,ix1,iy1); +} + +////////////////////////////////////////////////////////////////////////////// +// +// Rasterizer + +typedef struct stbtt__hheap_chunk +{ + struct stbtt__hheap_chunk *next; +} stbtt__hheap_chunk; + +typedef struct stbtt__hheap +{ + struct stbtt__hheap_chunk *head; + void *first_free; + int num_remaining_in_head_chunk; +} stbtt__hheap; + +static void *stbtt__hheap_alloc(stbtt__hheap *hh, size_t size, void *userdata) +{ + if (hh->first_free) { + void *p = hh->first_free; + hh->first_free = * (void **) p; + return p; + } else { + if (hh->num_remaining_in_head_chunk == 0) { + int count = (size < 32 ? 2000 : size < 128 ? 800 : 100); + stbtt__hheap_chunk *c = (stbtt__hheap_chunk *) STBTT_malloc(sizeof(stbtt__hheap_chunk) + size * count, userdata); + if (c == NULL) + return NULL; + c->next = hh->head; + hh->head = c; + hh->num_remaining_in_head_chunk = count; + } + --hh->num_remaining_in_head_chunk; + return (char *) (hh->head) + sizeof(stbtt__hheap_chunk) + size * hh->num_remaining_in_head_chunk; + } +} + +static void stbtt__hheap_free(stbtt__hheap *hh, void *p) +{ + *(void **) p = hh->first_free; + hh->first_free = p; +} + +static void stbtt__hheap_cleanup(stbtt__hheap *hh, void *userdata) +{ + stbtt__hheap_chunk *c = hh->head; + while (c) { + stbtt__hheap_chunk *n = c->next; + STBTT_free(c, userdata); + c = n; + } +} + +typedef struct stbtt__edge { + float x0,y0, x1,y1; + int invert; +} stbtt__edge; + + +typedef struct stbtt__active_edge +{ + struct stbtt__active_edge *next; + #if STBTT_RASTERIZER_VERSION==1 + int x,dx; + float ey; + int direction; + #elif STBTT_RASTERIZER_VERSION==2 + float fx,fdx,fdy; + float direction; + float sy; + float ey; + #else + #error "Unrecognized value of STBTT_RASTERIZER_VERSION" + #endif +} stbtt__active_edge; + +#if STBTT_RASTERIZER_VERSION == 1 +#define STBTT_FIXSHIFT 10 +#define STBTT_FIX (1 << STBTT_FIXSHIFT) +#define STBTT_FIXMASK (STBTT_FIX-1) + +static stbtt__active_edge *stbtt__new_active(stbtt__hheap *hh, stbtt__edge *e, int off_x, float start_point, void *userdata) +{ + stbtt__active_edge *z = (stbtt__active_edge *) stbtt__hheap_alloc(hh, sizeof(*z), userdata); + float dxdy = (e->x1 - e->x0) / (e->y1 - e->y0); + STBTT_assert(z != NULL); + if (!z) return z; + + // round dx down to avoid overshooting + if (dxdy < 0) + z->dx = -STBTT_ifloor(STBTT_FIX * -dxdy); + else + z->dx = STBTT_ifloor(STBTT_FIX * dxdy); + + z->x = STBTT_ifloor(STBTT_FIX * e->x0 + z->dx * (start_point - e->y0)); // use z->dx so when we offset later it's by the same amount + z->x -= off_x * STBTT_FIX; + + z->ey = e->y1; + z->next = 0; + z->direction = e->invert ? 1 : -1; + return z; +} +#elif STBTT_RASTERIZER_VERSION == 2 +static stbtt__active_edge *stbtt__new_active(stbtt__hheap *hh, stbtt__edge *e, int off_x, float start_point, void *userdata) +{ + stbtt__active_edge *z = (stbtt__active_edge *) stbtt__hheap_alloc(hh, sizeof(*z), userdata); + float dxdy = (e->x1 - e->x0) / (e->y1 - e->y0); + STBTT_assert(z != NULL); + //STBTT_assert(e->y0 <= start_point); + if (!z) return z; + z->fdx = dxdy; + z->fdy = dxdy != 0.0f ? (1.0f/dxdy) : 0.0f; + z->fx = e->x0 + dxdy * (start_point - e->y0); + z->fx -= off_x; + z->direction = e->invert ? 1.0f : -1.0f; + z->sy = e->y0; + z->ey = e->y1; + z->next = 0; + return z; +} +#else +#error "Unrecognized value of STBTT_RASTERIZER_VERSION" +#endif + +#if STBTT_RASTERIZER_VERSION == 1 +// note: this routine clips fills that extend off the edges... ideally this +// wouldn't happen, but it could happen if the truetype glyph bounding boxes +// are wrong, or if the user supplies a too-small bitmap +static void stbtt__fill_active_edges(unsigned char *scanline, int len, stbtt__active_edge *e, int max_weight) +{ + // non-zero winding fill + int x0=0, w=0; + + while (e) { + if (w == 0) { + // if we're currently at zero, we need to record the edge start point + x0 = e->x; w += e->direction; + } else { + int x1 = e->x; w += e->direction; + // if we went to zero, we need to draw + if (w == 0) { + int i = x0 >> STBTT_FIXSHIFT; + int j = x1 >> STBTT_FIXSHIFT; + + if (i < len && j >= 0) { + if (i == j) { + // x0,x1 are the same pixel, so compute combined coverage + scanline[i] = scanline[i] + (stbtt_uint8) ((x1 - x0) * max_weight >> STBTT_FIXSHIFT); + } else { + if (i >= 0) // add antialiasing for x0 + scanline[i] = scanline[i] + (stbtt_uint8) (((STBTT_FIX - (x0 & STBTT_FIXMASK)) * max_weight) >> STBTT_FIXSHIFT); + else + i = -1; // clip + + if (j < len) // add antialiasing for x1 + scanline[j] = scanline[j] + (stbtt_uint8) (((x1 & STBTT_FIXMASK) * max_weight) >> STBTT_FIXSHIFT); + else + j = len; // clip + + for (++i; i < j; ++i) // fill pixels between x0 and x1 + scanline[i] = scanline[i] + (stbtt_uint8) max_weight; + } + } + } + } + + e = e->next; + } +} + +static void stbtt__rasterize_sorted_edges(stbtt__bitmap *result, stbtt__edge *e, int n, int vsubsample, int off_x, int off_y, void *userdata) +{ + stbtt__hheap hh = { 0, 0, 0 }; + stbtt__active_edge *active = NULL; + int y,j=0; + int max_weight = (255 / vsubsample); // weight per vertical scanline + int s; // vertical subsample index + unsigned char scanline_data[512], *scanline; + + if (result->w > 512) + scanline = (unsigned char *) STBTT_malloc(result->w, userdata); + else + scanline = scanline_data; + + y = off_y * vsubsample; + e[n].y0 = (off_y + result->h) * (float) vsubsample + 1; + + while (j < result->h) { + STBTT_memset(scanline, 0, result->w); + for (s=0; s < vsubsample; ++s) { + // find center of pixel for this scanline + float scan_y = y + 0.5f; + stbtt__active_edge **step = &active; + + // update all active edges; + // remove all active edges that terminate before the center of this scanline + while (*step) { + stbtt__active_edge * z = *step; + if (z->ey <= scan_y) { + *step = z->next; // delete from list + STBTT_assert(z->direction); + z->direction = 0; + stbtt__hheap_free(&hh, z); + } else { + z->x += z->dx; // advance to position for current scanline + step = &((*step)->next); // advance through list + } + } + + // resort the list if needed + for(;;) { + int changed=0; + step = &active; + while (*step && (*step)->next) { + if ((*step)->x > (*step)->next->x) { + stbtt__active_edge *t = *step; + stbtt__active_edge *q = t->next; + + t->next = q->next; + q->next = t; + *step = q; + changed = 1; + } + step = &(*step)->next; + } + if (!changed) break; + } + + // insert all edges that start before the center of this scanline -- omit ones that also end on this scanline + while (e->y0 <= scan_y) { + if (e->y1 > scan_y) { + stbtt__active_edge *z = stbtt__new_active(&hh, e, off_x, scan_y, userdata); + if (z != NULL) { + // find insertion point + if (active == NULL) + active = z; + else if (z->x < active->x) { + // insert at front + z->next = active; + active = z; + } else { + // find thing to insert AFTER + stbtt__active_edge *p = active; + while (p->next && p->next->x < z->x) + p = p->next; + // at this point, p->next->x is NOT < z->x + z->next = p->next; + p->next = z; + } + } + } + ++e; + } + + // now process all active edges in XOR fashion + if (active) + stbtt__fill_active_edges(scanline, result->w, active, max_weight); + + ++y; + } + STBTT_memcpy(result->pixels + j * result->stride, scanline, result->w); + ++j; + } + + stbtt__hheap_cleanup(&hh, userdata); + + if (scanline != scanline_data) + STBTT_free(scanline, userdata); +} + +#elif STBTT_RASTERIZER_VERSION == 2 + +// the edge passed in here does not cross the vertical line at x or the vertical line at x+1 +// (i.e. it has already been clipped to those) +static void stbtt__handle_clipped_edge(float *scanline, int x, stbtt__active_edge *e, float x0, float y0, float x1, float y1) +{ + if (y0 == y1) return; + STBTT_assert(y0 < y1); + STBTT_assert(e->sy <= e->ey); + if (y0 > e->ey) return; + if (y1 < e->sy) return; + if (y0 < e->sy) { + x0 += (x1-x0) * (e->sy - y0) / (y1-y0); + y0 = e->sy; + } + if (y1 > e->ey) { + x1 += (x1-x0) * (e->ey - y1) / (y1-y0); + y1 = e->ey; + } + + if (x0 == x) + STBTT_assert(x1 <= x+1); + else if (x0 == x+1) + STBTT_assert(x1 >= x); + else if (x0 <= x) + STBTT_assert(x1 <= x); + else if (x0 >= x+1) + STBTT_assert(x1 >= x+1); + else + STBTT_assert(x1 >= x && x1 <= x+1); + + if (x0 <= x && x1 <= x) + scanline[x] += e->direction * (y1-y0); + else if (x0 >= x+1 && x1 >= x+1) + ; + else { + STBTT_assert(x0 >= x && x0 <= x+1 && x1 >= x && x1 <= x+1); + scanline[x] += e->direction * (y1-y0) * (1-((x0-x)+(x1-x))/2); // coverage = 1 - average x position + } +} + +static float stbtt__sized_trapezoid_area(float height, float top_width, float bottom_width) +{ + STBTT_assert(top_width >= 0); + STBTT_assert(bottom_width >= 0); + return (top_width + bottom_width) / 2.0f * height; +} + +static float stbtt__position_trapezoid_area(float height, float tx0, float tx1, float bx0, float bx1) +{ + return stbtt__sized_trapezoid_area(height, tx1 - tx0, bx1 - bx0); +} + +static float stbtt__sized_triangle_area(float height, float width) +{ + return height * width / 2; +} + +static void stbtt__fill_active_edges_new(float *scanline, float *scanline_fill, int len, stbtt__active_edge *e, float y_top) +{ + float y_bottom = y_top+1; + + while (e) { + // brute force every pixel + + // compute intersection points with top & bottom + STBTT_assert(e->ey >= y_top); + + if (e->fdx == 0) { + float x0 = e->fx; + if (x0 < len) { + if (x0 >= 0) { + stbtt__handle_clipped_edge(scanline,(int) x0,e, x0,y_top, x0,y_bottom); + stbtt__handle_clipped_edge(scanline_fill-1,(int) x0+1,e, x0,y_top, x0,y_bottom); + } else { + stbtt__handle_clipped_edge(scanline_fill-1,0,e, x0,y_top, x0,y_bottom); + } + } + } else { + float x0 = e->fx; + float dx = e->fdx; + float xb = x0 + dx; + float x_top, x_bottom; + float sy0,sy1; + float dy = e->fdy; + STBTT_assert(e->sy <= y_bottom && e->ey >= y_top); + + // compute endpoints of line segment clipped to this scanline (if the + // line segment starts on this scanline. x0 is the intersection of the + // line with y_top, but that may be off the line segment. + if (e->sy > y_top) { + x_top = x0 + dx * (e->sy - y_top); + sy0 = e->sy; + } else { + x_top = x0; + sy0 = y_top; + } + if (e->ey < y_bottom) { + x_bottom = x0 + dx * (e->ey - y_top); + sy1 = e->ey; + } else { + x_bottom = xb; + sy1 = y_bottom; + } + + if (x_top >= 0 && x_bottom >= 0 && x_top < len && x_bottom < len) { + // from here on, we don't have to range check x values + + if ((int) x_top == (int) x_bottom) { + float height; + // simple case, only spans one pixel + int x = (int) x_top; + height = (sy1 - sy0) * e->direction; + STBTT_assert(x >= 0 && x < len); + scanline[x] += stbtt__position_trapezoid_area(height, x_top, x+1.0f, x_bottom, x+1.0f); + scanline_fill[x] += height; // everything right of this pixel is filled + } else { + int x,x1,x2; + float y_crossing, y_final, step, sign, area; + // covers 2+ pixels + if (x_top > x_bottom) { + // flip scanline vertically; signed area is the same + float t; + sy0 = y_bottom - (sy0 - y_top); + sy1 = y_bottom - (sy1 - y_top); + t = sy0, sy0 = sy1, sy1 = t; + t = x_bottom, x_bottom = x_top, x_top = t; + dx = -dx; + dy = -dy; + t = x0, x0 = xb, xb = t; + } + STBTT_assert(dy >= 0); + STBTT_assert(dx >= 0); + + x1 = (int) x_top; + x2 = (int) x_bottom; + // compute intersection with y axis at x1+1 + y_crossing = y_top + dy * (x1+1 - x0); + + // compute intersection with y axis at x2 + y_final = y_top + dy * (x2 - x0); + + // x1 x_top x2 x_bottom + // y_top +------|-----+------------+------------+--------|---+------------+ + // | | | | | | + // | | | | | | + // sy0 | Txxxxx|............|............|............|............| + // y_crossing | *xxxxx.......|............|............|............| + // | | xxxxx..|............|............|............| + // | | /- xx*xxxx........|............|............| + // | | dy < | xxxxxx..|............|............| + // y_final | | \- | xx*xxx.........|............| + // sy1 | | | | xxxxxB...|............| + // | | | | | | + // | | | | | | + // y_bottom +------------+------------+------------+------------+------------+ + // + // goal is to measure the area covered by '.' in each pixel + + // if x2 is right at the right edge of x1, y_crossing can blow up, github #1057 + // @TODO: maybe test against sy1 rather than y_bottom? + if (y_crossing > y_bottom) + y_crossing = y_bottom; + + sign = e->direction; + + // area of the rectangle covered from sy0..y_crossing + area = sign * (y_crossing-sy0); + + // area of the triangle (x_top,sy0), (x1+1,sy0), (x1+1,y_crossing) + scanline[x1] += stbtt__sized_triangle_area(area, x1+1 - x_top); + + // check if final y_crossing is blown up; no test case for this + if (y_final > y_bottom) { + y_final = y_bottom; + dy = (y_final - y_crossing ) / (x2 - (x1+1)); // if denom=0, y_final = y_crossing, so y_final <= y_bottom + } + + // in second pixel, area covered by line segment found in first pixel + // is always a rectangle 1 wide * the height of that line segment; this + // is exactly what the variable 'area' stores. it also gets a contribution + // from the line segment within it. the THIRD pixel will get the first + // pixel's rectangle contribution, the second pixel's rectangle contribution, + // and its own contribution. the 'own contribution' is the same in every pixel except + // the leftmost and rightmost, a trapezoid that slides down in each pixel. + // the second pixel's contribution to the third pixel will be the + // rectangle 1 wide times the height change in the second pixel, which is dy. + + step = sign * dy * 1; // dy is dy/dx, change in y for every 1 change in x, + // which multiplied by 1-pixel-width is how much pixel area changes for each step in x + // so the area advances by 'step' every time + + for (x = x1+1; x < x2; ++x) { + scanline[x] += area + step/2; // area of trapezoid is 1*step/2 + area += step; + } + STBTT_assert(STBTT_fabs(area) <= 1.01f); // accumulated error from area += step unless we round step down + STBTT_assert(sy1 > y_final-0.01f); + + // area covered in the last pixel is the rectangle from all the pixels to the left, + // plus the trapezoid filled by the line segment in this pixel all the way to the right edge + scanline[x2] += area + sign * stbtt__position_trapezoid_area(sy1-y_final, (float) x2, x2+1.0f, x_bottom, x2+1.0f); + + // the rest of the line is filled based on the total height of the line segment in this pixel + scanline_fill[x2] += sign * (sy1-sy0); + } + } else { + // if edge goes outside of box we're drawing, we require + // clipping logic. since this does not match the intended use + // of this library, we use a different, very slow brute + // force implementation + // note though that this does happen some of the time because + // x_top and x_bottom can be extrapolated at the top & bottom of + // the shape and actually lie outside the bounding box + int x; + for (x=0; x < len; ++x) { + // cases: + // + // there can be up to two intersections with the pixel. any intersection + // with left or right edges can be handled by splitting into two (or three) + // regions. intersections with top & bottom do not necessitate case-wise logic. + // + // the old way of doing this found the intersections with the left & right edges, + // then used some simple logic to produce up to three segments in sorted order + // from top-to-bottom. however, this had a problem: if an x edge was epsilon + // across the x border, then the corresponding y position might not be distinct + // from the other y segment, and it might ignored as an empty segment. to avoid + // that, we need to explicitly produce segments based on x positions. + + // rename variables to clearly-defined pairs + float y0 = y_top; + float x1 = (float) (x); + float x2 = (float) (x+1); + float x3 = xb; + float y3 = y_bottom; + + // x = e->x + e->dx * (y-y_top) + // (y-y_top) = (x - e->x) / e->dx + // y = (x - e->x) / e->dx + y_top + float y1 = (x - x0) / dx + y_top; + float y2 = (x+1 - x0) / dx + y_top; + + if (x0 < x1 && x3 > x2) { // three segments descending down-right + stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x1,y1); + stbtt__handle_clipped_edge(scanline,x,e, x1,y1, x2,y2); + stbtt__handle_clipped_edge(scanline,x,e, x2,y2, x3,y3); + } else if (x3 < x1 && x0 > x2) { // three segments descending down-left + stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x2,y2); + stbtt__handle_clipped_edge(scanline,x,e, x2,y2, x1,y1); + stbtt__handle_clipped_edge(scanline,x,e, x1,y1, x3,y3); + } else if (x0 < x1 && x3 > x1) { // two segments across x, down-right + stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x1,y1); + stbtt__handle_clipped_edge(scanline,x,e, x1,y1, x3,y3); + } else if (x3 < x1 && x0 > x1) { // two segments across x, down-left + stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x1,y1); + stbtt__handle_clipped_edge(scanline,x,e, x1,y1, x3,y3); + } else if (x0 < x2 && x3 > x2) { // two segments across x+1, down-right + stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x2,y2); + stbtt__handle_clipped_edge(scanline,x,e, x2,y2, x3,y3); + } else if (x3 < x2 && x0 > x2) { // two segments across x+1, down-left + stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x2,y2); + stbtt__handle_clipped_edge(scanline,x,e, x2,y2, x3,y3); + } else { // one segment + stbtt__handle_clipped_edge(scanline,x,e, x0,y0, x3,y3); + } + } + } + } + e = e->next; + } +} + +// directly AA rasterize edges w/o supersampling +static void stbtt__rasterize_sorted_edges(stbtt__bitmap *result, stbtt__edge *e, int n, int vsubsample, int off_x, int off_y, void *userdata) +{ + stbtt__hheap hh = { 0, 0, 0 }; + stbtt__active_edge *active = NULL; + int y,j=0, i; + float scanline_data[129], *scanline, *scanline2; + + STBTT__NOTUSED(vsubsample); + + if (result->w > 64) + scanline = (float *) STBTT_malloc((result->w*2+1) * sizeof(float), userdata); + else + scanline = scanline_data; + + scanline2 = scanline + result->w; + + y = off_y; + e[n].y0 = (float) (off_y + result->h) + 1; + + while (j < result->h) { + // find center of pixel for this scanline + float scan_y_top = y + 0.0f; + float scan_y_bottom = y + 1.0f; + stbtt__active_edge **step = &active; + + STBTT_memset(scanline , 0, result->w*sizeof(scanline[0])); + STBTT_memset(scanline2, 0, (result->w+1)*sizeof(scanline[0])); + + // update all active edges; + // remove all active edges that terminate before the top of this scanline + while (*step) { + stbtt__active_edge * z = *step; + if (z->ey <= scan_y_top) { + *step = z->next; // delete from list + STBTT_assert(z->direction); + z->direction = 0; + stbtt__hheap_free(&hh, z); + } else { + step = &((*step)->next); // advance through list + } + } + + // insert all edges that start before the bottom of this scanline + while (e->y0 <= scan_y_bottom) { + if (e->y0 != e->y1) { + stbtt__active_edge *z = stbtt__new_active(&hh, e, off_x, scan_y_top, userdata); + if (z != NULL) { + if (j == 0 && off_y != 0) { + if (z->ey < scan_y_top) { + // this can happen due to subpixel positioning and some kind of fp rounding error i think + z->ey = scan_y_top; + } + } + STBTT_assert(z->ey >= scan_y_top); // if we get really unlucky a tiny bit of an edge can be out of bounds + // insert at front + z->next = active; + active = z; + } + } + ++e; + } + + // now process all active edges + if (active) + stbtt__fill_active_edges_new(scanline, scanline2+1, result->w, active, scan_y_top); + + { + float sum = 0; + for (i=0; i < result->w; ++i) { + float k; + int m; + sum += scanline2[i]; + k = scanline[i] + sum; + k = (float) STBTT_fabs(k)*255 + 0.5f; + m = (int) k; + if (m > 255) m = 255; + result->pixels[j*result->stride + i] = (unsigned char) m; + } + } + // advance all the edges + step = &active; + while (*step) { + stbtt__active_edge *z = *step; + z->fx += z->fdx; // advance to position for current scanline + step = &((*step)->next); // advance through list + } + + ++y; + ++j; + } + + stbtt__hheap_cleanup(&hh, userdata); + + if (scanline != scanline_data) + STBTT_free(scanline, userdata); +} +#else +#error "Unrecognized value of STBTT_RASTERIZER_VERSION" +#endif + +#define STBTT__COMPARE(a,b) ((a)->y0 < (b)->y0) + +static void stbtt__sort_edges_ins_sort(stbtt__edge *p, int n) +{ + int i,j; + for (i=1; i < n; ++i) { + stbtt__edge t = p[i], *a = &t; + j = i; + while (j > 0) { + stbtt__edge *b = &p[j-1]; + int c = STBTT__COMPARE(a,b); + if (!c) break; + p[j] = p[j-1]; + --j; + } + if (i != j) + p[j] = t; + } +} + +static void stbtt__sort_edges_quicksort(stbtt__edge *p, int n) +{ + /* threshold for transitioning to insertion sort */ + while (n > 12) { + stbtt__edge t; + int c01,c12,c,m,i,j; + + /* compute median of three */ + m = n >> 1; + c01 = STBTT__COMPARE(&p[0],&p[m]); + c12 = STBTT__COMPARE(&p[m],&p[n-1]); + /* if 0 >= mid >= end, or 0 < mid < end, then use mid */ + if (c01 != c12) { + /* otherwise, we'll need to swap something else to middle */ + int z; + c = STBTT__COMPARE(&p[0],&p[n-1]); + /* 0>mid && midn => n; 0 0 */ + /* 0n: 0>n => 0; 0 n */ + z = (c == c12) ? 0 : n-1; + t = p[z]; + p[z] = p[m]; + p[m] = t; + } + /* now p[m] is the median-of-three */ + /* swap it to the beginning so it won't move around */ + t = p[0]; + p[0] = p[m]; + p[m] = t; + + /* partition loop */ + i=1; + j=n-1; + for(;;) { + /* handling of equality is crucial here */ + /* for sentinels & efficiency with duplicates */ + for (;;++i) { + if (!STBTT__COMPARE(&p[i], &p[0])) break; + } + for (;;--j) { + if (!STBTT__COMPARE(&p[0], &p[j])) break; + } + /* make sure we haven't crossed */ + if (i >= j) break; + t = p[i]; + p[i] = p[j]; + p[j] = t; + + ++i; + --j; + } + /* recurse on smaller side, iterate on larger */ + if (j < (n-i)) { + stbtt__sort_edges_quicksort(p,j); + p = p+i; + n = n-i; + } else { + stbtt__sort_edges_quicksort(p+i, n-i); + n = j; + } + } +} + +static void stbtt__sort_edges(stbtt__edge *p, int n) +{ + stbtt__sort_edges_quicksort(p, n); + stbtt__sort_edges_ins_sort(p, n); +} + +typedef struct +{ + float x,y; +} stbtt__point; + +static void stbtt__rasterize(stbtt__bitmap *result, stbtt__point *pts, int *wcount, int windings, float scale_x, float scale_y, float shift_x, float shift_y, int off_x, int off_y, int invert, void *userdata) +{ + float y_scale_inv = invert ? -scale_y : scale_y; + stbtt__edge *e; + int n,i,j,k,m; +#if STBTT_RASTERIZER_VERSION == 1 + int vsubsample = result->h < 8 ? 15 : 5; +#elif STBTT_RASTERIZER_VERSION == 2 + int vsubsample = 1; +#else + #error "Unrecognized value of STBTT_RASTERIZER_VERSION" +#endif + // vsubsample should divide 255 evenly; otherwise we won't reach full opacity + + // now we have to blow out the windings into explicit edge lists + n = 0; + for (i=0; i < windings; ++i) + n += wcount[i]; + + e = (stbtt__edge *) STBTT_malloc(sizeof(*e) * (n+1), userdata); // add an extra one as a sentinel + if (e == 0) return; + n = 0; + + m=0; + for (i=0; i < windings; ++i) { + stbtt__point *p = pts + m; + m += wcount[i]; + j = wcount[i]-1; + for (k=0; k < wcount[i]; j=k++) { + int a=k,b=j; + // skip the edge if horizontal + if (p[j].y == p[k].y) + continue; + // add edge from j to k to the list + e[n].invert = 0; + if (invert ? p[j].y > p[k].y : p[j].y < p[k].y) { + e[n].invert = 1; + a=j,b=k; + } + e[n].x0 = p[a].x * scale_x + shift_x; + e[n].y0 = (p[a].y * y_scale_inv + shift_y) * vsubsample; + e[n].x1 = p[b].x * scale_x + shift_x; + e[n].y1 = (p[b].y * y_scale_inv + shift_y) * vsubsample; + ++n; + } + } + + // now sort the edges by their highest point (should snap to integer, and then by x) + //STBTT_sort(e, n, sizeof(e[0]), stbtt__edge_compare); + stbtt__sort_edges(e, n); + + // now, traverse the scanlines and find the intersections on each scanline, use xor winding rule + stbtt__rasterize_sorted_edges(result, e, n, vsubsample, off_x, off_y, userdata); + + STBTT_free(e, userdata); +} + +static void stbtt__add_point(stbtt__point *points, int n, float x, float y) +{ + if (!points) return; // during first pass, it's unallocated + points[n].x = x; + points[n].y = y; +} + +// tessellate until threshold p is happy... @TODO warped to compensate for non-linear stretching +static int stbtt__tesselate_curve(stbtt__point *points, int *num_points, float x0, float y0, float x1, float y1, float x2, float y2, float objspace_flatness_squared, int n) +{ + // midpoint + float mx = (x0 + 2*x1 + x2)/4; + float my = (y0 + 2*y1 + y2)/4; + // versus directly drawn line + float dx = (x0+x2)/2 - mx; + float dy = (y0+y2)/2 - my; + if (n > 16) // 65536 segments on one curve better be enough! + return 1; + if (dx*dx+dy*dy > objspace_flatness_squared) { // half-pixel error allowed... need to be smaller if AA + stbtt__tesselate_curve(points, num_points, x0,y0, (x0+x1)/2.0f,(y0+y1)/2.0f, mx,my, objspace_flatness_squared,n+1); + stbtt__tesselate_curve(points, num_points, mx,my, (x1+x2)/2.0f,(y1+y2)/2.0f, x2,y2, objspace_flatness_squared,n+1); + } else { + stbtt__add_point(points, *num_points,x2,y2); + *num_points = *num_points+1; + } + return 1; +} + +static void stbtt__tesselate_cubic(stbtt__point *points, int *num_points, float x0, float y0, float x1, float y1, float x2, float y2, float x3, float y3, float objspace_flatness_squared, int n) +{ + // @TODO this "flatness" calculation is just made-up nonsense that seems to work well enough + float dx0 = x1-x0; + float dy0 = y1-y0; + float dx1 = x2-x1; + float dy1 = y2-y1; + float dx2 = x3-x2; + float dy2 = y3-y2; + float dx = x3-x0; + float dy = y3-y0; + float longlen = (float) (STBTT_sqrt(dx0*dx0+dy0*dy0)+STBTT_sqrt(dx1*dx1+dy1*dy1)+STBTT_sqrt(dx2*dx2+dy2*dy2)); + float shortlen = (float) STBTT_sqrt(dx*dx+dy*dy); + float flatness_squared = longlen*longlen-shortlen*shortlen; + + if (n > 16) // 65536 segments on one curve better be enough! + return; + + if (flatness_squared > objspace_flatness_squared) { + float x01 = (x0+x1)/2; + float y01 = (y0+y1)/2; + float x12 = (x1+x2)/2; + float y12 = (y1+y2)/2; + float x23 = (x2+x3)/2; + float y23 = (y2+y3)/2; + + float xa = (x01+x12)/2; + float ya = (y01+y12)/2; + float xb = (x12+x23)/2; + float yb = (y12+y23)/2; + + float mx = (xa+xb)/2; + float my = (ya+yb)/2; + + stbtt__tesselate_cubic(points, num_points, x0,y0, x01,y01, xa,ya, mx,my, objspace_flatness_squared,n+1); + stbtt__tesselate_cubic(points, num_points, mx,my, xb,yb, x23,y23, x3,y3, objspace_flatness_squared,n+1); + } else { + stbtt__add_point(points, *num_points,x3,y3); + *num_points = *num_points+1; + } +} + +// returns number of contours +static stbtt__point *stbtt_FlattenCurves(stbtt_vertex *vertices, int num_verts, float objspace_flatness, int **contour_lengths, int *num_contours, void *userdata) +{ + stbtt__point *points=0; + int num_points=0; + + float objspace_flatness_squared = objspace_flatness * objspace_flatness; + int i,n=0,start=0, pass; + + // count how many "moves" there are to get the contour count + for (i=0; i < num_verts; ++i) + if (vertices[i].type == STBTT_vmove) + ++n; + + *num_contours = n; + if (n == 0) return 0; + + *contour_lengths = (int *) STBTT_malloc(sizeof(**contour_lengths) * n, userdata); + + if (*contour_lengths == 0) { + *num_contours = 0; + return 0; + } + + // make two passes through the points so we don't need to realloc + for (pass=0; pass < 2; ++pass) { + float x=0,y=0; + if (pass == 1) { + points = (stbtt__point *) STBTT_malloc(num_points * sizeof(points[0]), userdata); + if (points == NULL) goto error; + } + num_points = 0; + n= -1; + for (i=0; i < num_verts; ++i) { + switch (vertices[i].type) { + case STBTT_vmove: + // start the next contour + if (n >= 0) + (*contour_lengths)[n] = num_points - start; + ++n; + start = num_points; + + x = vertices[i].x, y = vertices[i].y; + stbtt__add_point(points, num_points++, x,y); + break; + case STBTT_vline: + x = vertices[i].x, y = vertices[i].y; + stbtt__add_point(points, num_points++, x, y); + break; + case STBTT_vcurve: + stbtt__tesselate_curve(points, &num_points, x,y, + vertices[i].cx, vertices[i].cy, + vertices[i].x, vertices[i].y, + objspace_flatness_squared, 0); + x = vertices[i].x, y = vertices[i].y; + break; + case STBTT_vcubic: + stbtt__tesselate_cubic(points, &num_points, x,y, + vertices[i].cx, vertices[i].cy, + vertices[i].cx1, vertices[i].cy1, + vertices[i].x, vertices[i].y, + objspace_flatness_squared, 0); + x = vertices[i].x, y = vertices[i].y; + break; + } + } + (*contour_lengths)[n] = num_points - start; + } + + return points; +error: + STBTT_free(points, userdata); + STBTT_free(*contour_lengths, userdata); + *contour_lengths = 0; + *num_contours = 0; + return NULL; +} + +STBTT_DEF void stbtt_Rasterize(stbtt__bitmap *result, float flatness_in_pixels, stbtt_vertex *vertices, int num_verts, float scale_x, float scale_y, float shift_x, float shift_y, int x_off, int y_off, int invert, void *userdata) +{ + float scale = scale_x > scale_y ? scale_y : scale_x; + int winding_count = 0; + int *winding_lengths = NULL; + stbtt__point *windings = stbtt_FlattenCurves(vertices, num_verts, flatness_in_pixels / scale, &winding_lengths, &winding_count, userdata); + if (windings) { + stbtt__rasterize(result, windings, winding_lengths, winding_count, scale_x, scale_y, shift_x, shift_y, x_off, y_off, invert, userdata); + STBTT_free(winding_lengths, userdata); + STBTT_free(windings, userdata); + } +} + +STBTT_DEF void stbtt_FreeBitmap(unsigned char *bitmap, void *userdata) +{ + STBTT_free(bitmap, userdata); +} + +STBTT_DEF unsigned char *stbtt_GetGlyphBitmapSubpixel(const stbtt_fontinfo *info, float scale_x, float scale_y, float shift_x, float shift_y, int glyph, int *width, int *height, int *xoff, int *yoff) +{ + int ix0,iy0,ix1,iy1; + stbtt__bitmap gbm; + stbtt_vertex *vertices; + int num_verts = stbtt_GetGlyphShape(info, glyph, &vertices); + + if (scale_x == 0) scale_x = scale_y; + if (scale_y == 0) { + if (scale_x == 0) { + STBTT_free(vertices, info->userdata); + return NULL; + } + scale_y = scale_x; + } + + stbtt_GetGlyphBitmapBoxSubpixel(info, glyph, scale_x, scale_y, shift_x, shift_y, &ix0,&iy0,&ix1,&iy1); + + // now we get the size + gbm.w = (ix1 - ix0); + gbm.h = (iy1 - iy0); + gbm.pixels = NULL; // in case we error + + if (width ) *width = gbm.w; + if (height) *height = gbm.h; + if (xoff ) *xoff = ix0; + if (yoff ) *yoff = iy0; + + if (gbm.w && gbm.h) { + gbm.pixels = (unsigned char *) STBTT_malloc(gbm.w * gbm.h, info->userdata); + if (gbm.pixels) { + gbm.stride = gbm.w; + + stbtt_Rasterize(&gbm, 0.35f, vertices, num_verts, scale_x, scale_y, shift_x, shift_y, ix0, iy0, 1, info->userdata); + } + } + STBTT_free(vertices, info->userdata); + return gbm.pixels; +} + +STBTT_DEF unsigned char *stbtt_GetGlyphBitmap(const stbtt_fontinfo *info, float scale_x, float scale_y, int glyph, int *width, int *height, int *xoff, int *yoff) +{ + return stbtt_GetGlyphBitmapSubpixel(info, scale_x, scale_y, 0.0f, 0.0f, glyph, width, height, xoff, yoff); +} + +STBTT_DEF void stbtt_MakeGlyphBitmapSubpixel(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int glyph) +{ + int ix0,iy0; + stbtt_vertex *vertices; + int num_verts = stbtt_GetGlyphShape(info, glyph, &vertices); + stbtt__bitmap gbm; + + stbtt_GetGlyphBitmapBoxSubpixel(info, glyph, scale_x, scale_y, shift_x, shift_y, &ix0,&iy0,0,0); + gbm.pixels = output; + gbm.w = out_w; + gbm.h = out_h; + gbm.stride = out_stride; + + if (gbm.w && gbm.h) + stbtt_Rasterize(&gbm, 0.35f, vertices, num_verts, scale_x, scale_y, shift_x, shift_y, ix0,iy0, 1, info->userdata); + + STBTT_free(vertices, info->userdata); +} + +STBTT_DEF void stbtt_MakeGlyphBitmap(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, int glyph) +{ + stbtt_MakeGlyphBitmapSubpixel(info, output, out_w, out_h, out_stride, scale_x, scale_y, 0.0f,0.0f, glyph); +} + +STBTT_DEF unsigned char *stbtt_GetCodepointBitmapSubpixel(const stbtt_fontinfo *info, float scale_x, float scale_y, float shift_x, float shift_y, int codepoint, int *width, int *height, int *xoff, int *yoff) +{ + return stbtt_GetGlyphBitmapSubpixel(info, scale_x, scale_y,shift_x,shift_y, stbtt_FindGlyphIndex(info,codepoint), width,height,xoff,yoff); +} + +STBTT_DEF void stbtt_MakeCodepointBitmapSubpixelPrefilter(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int oversample_x, int oversample_y, float *sub_x, float *sub_y, int codepoint) +{ + stbtt_MakeGlyphBitmapSubpixelPrefilter(info, output, out_w, out_h, out_stride, scale_x, scale_y, shift_x, shift_y, oversample_x, oversample_y, sub_x, sub_y, stbtt_FindGlyphIndex(info,codepoint)); +} + +STBTT_DEF void stbtt_MakeCodepointBitmapSubpixel(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int codepoint) +{ + stbtt_MakeGlyphBitmapSubpixel(info, output, out_w, out_h, out_stride, scale_x, scale_y, shift_x, shift_y, stbtt_FindGlyphIndex(info,codepoint)); +} + +STBTT_DEF unsigned char *stbtt_GetCodepointBitmap(const stbtt_fontinfo *info, float scale_x, float scale_y, int codepoint, int *width, int *height, int *xoff, int *yoff) +{ + return stbtt_GetCodepointBitmapSubpixel(info, scale_x, scale_y, 0.0f,0.0f, codepoint, width,height,xoff,yoff); +} + +STBTT_DEF void stbtt_MakeCodepointBitmap(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, int codepoint) +{ + stbtt_MakeCodepointBitmapSubpixel(info, output, out_w, out_h, out_stride, scale_x, scale_y, 0.0f,0.0f, codepoint); +} + +////////////////////////////////////////////////////////////////////////////// +// +// bitmap baking +// +// This is SUPER-CRAPPY packing to keep source code small + +static int stbtt_BakeFontBitmap_internal(unsigned char *data, int offset, // font location (use offset=0 for plain .ttf) + float pixel_height, // height of font in pixels + unsigned char *pixels, int pw, int ph, // bitmap to be filled in + int first_char, int num_chars, // characters to bake + stbtt_bakedchar *chardata) +{ + float scale; + int x,y,bottom_y, i; + stbtt_fontinfo f; + f.userdata = NULL; + if (!stbtt_InitFont(&f, data, offset)) + return -1; + STBTT_memset(pixels, 0, pw*ph); // background of 0 around pixels + x=y=1; + bottom_y = 1; + + scale = stbtt_ScaleForPixelHeight(&f, pixel_height); + + for (i=0; i < num_chars; ++i) { + int advance, lsb, x0,y0,x1,y1,gw,gh; + int g = stbtt_FindGlyphIndex(&f, first_char + i); + stbtt_GetGlyphHMetrics(&f, g, &advance, &lsb); + stbtt_GetGlyphBitmapBox(&f, g, scale,scale, &x0,&y0,&x1,&y1); + gw = x1-x0; + gh = y1-y0; + if (x + gw + 1 >= pw) + y = bottom_y, x = 1; // advance to next row + if (y + gh + 1 >= ph) // check if it fits vertically AFTER potentially moving to next row + return -i; + STBTT_assert(x+gw < pw); + STBTT_assert(y+gh < ph); + stbtt_MakeGlyphBitmap(&f, pixels+x+y*pw, gw,gh,pw, scale,scale, g); + chardata[i].x0 = (stbtt_int16) x; + chardata[i].y0 = (stbtt_int16) y; + chardata[i].x1 = (stbtt_int16) (x + gw); + chardata[i].y1 = (stbtt_int16) (y + gh); + chardata[i].xadvance = scale * advance; + chardata[i].xoff = (float) x0; + chardata[i].yoff = (float) y0; + x = x + gw + 1; + if (y+gh+1 > bottom_y) + bottom_y = y+gh+1; + } + return bottom_y; +} + +STBTT_DEF void stbtt_GetBakedQuad(const stbtt_bakedchar *chardata, int pw, int ph, int char_index, float *xpos, float *ypos, stbtt_aligned_quad *q, int opengl_fillrule) +{ + float d3d_bias = opengl_fillrule ? 0 : -0.5f; + float ipw = 1.0f / pw, iph = 1.0f / ph; + const stbtt_bakedchar *b = chardata + char_index; + int round_x = STBTT_ifloor((*xpos + b->xoff) + 0.5f); + int round_y = STBTT_ifloor((*ypos + b->yoff) + 0.5f); + + q->x0 = round_x + d3d_bias; + q->y0 = round_y + d3d_bias; + q->x1 = round_x + b->x1 - b->x0 + d3d_bias; + q->y1 = round_y + b->y1 - b->y0 + d3d_bias; + + q->s0 = b->x0 * ipw; + q->t0 = b->y0 * iph; + q->s1 = b->x1 * ipw; + q->t1 = b->y1 * iph; + + *xpos += b->xadvance; +} + +////////////////////////////////////////////////////////////////////////////// +// +// rectangle packing replacement routines if you don't have stb_rect_pack.h +// + +#ifndef STB_RECT_PACK_VERSION + +typedef int stbrp_coord; + +//////////////////////////////////////////////////////////////////////////////////// +// // +// // +// COMPILER WARNING ?!?!? // +// // +// // +// if you get a compile warning due to these symbols being defined more than // +// once, move #include "stb_rect_pack.h" before #include "stb_truetype.h" // +// // +//////////////////////////////////////////////////////////////////////////////////// + +typedef struct +{ + int width,height; + int x,y,bottom_y; +} stbrp_context; + +typedef struct +{ + unsigned char x; +} stbrp_node; + +struct stbrp_rect +{ + stbrp_coord x,y; + int id,w,h,was_packed; +}; + +static void stbrp_init_target(stbrp_context *con, int pw, int ph, stbrp_node *nodes, int num_nodes) +{ + con->width = pw; + con->height = ph; + con->x = 0; + con->y = 0; + con->bottom_y = 0; + STBTT__NOTUSED(nodes); + STBTT__NOTUSED(num_nodes); +} + +static void stbrp_pack_rects(stbrp_context *con, stbrp_rect *rects, int num_rects) +{ + int i; + for (i=0; i < num_rects; ++i) { + if (con->x + rects[i].w > con->width) { + con->x = 0; + con->y = con->bottom_y; + } + if (con->y + rects[i].h > con->height) + break; + rects[i].x = con->x; + rects[i].y = con->y; + rects[i].was_packed = 1; + con->x += rects[i].w; + if (con->y + rects[i].h > con->bottom_y) + con->bottom_y = con->y + rects[i].h; + } + for ( ; i < num_rects; ++i) + rects[i].was_packed = 0; +} +#endif + +////////////////////////////////////////////////////////////////////////////// +// +// bitmap baking +// +// This is SUPER-AWESOME (tm Ryan Gordon) packing using stb_rect_pack.h. If +// stb_rect_pack.h isn't available, it uses the BakeFontBitmap strategy. + +STBTT_DEF int stbtt_PackBegin(stbtt_pack_context *spc, unsigned char *pixels, int pw, int ph, int stride_in_bytes, int padding, void *alloc_context) +{ + stbrp_context *context = (stbrp_context *) STBTT_malloc(sizeof(*context) ,alloc_context); + int num_nodes = pw - padding; + stbrp_node *nodes = (stbrp_node *) STBTT_malloc(sizeof(*nodes ) * num_nodes,alloc_context); + + if (context == NULL || nodes == NULL) { + if (context != NULL) STBTT_free(context, alloc_context); + if (nodes != NULL) STBTT_free(nodes , alloc_context); + return 0; + } + + spc->user_allocator_context = alloc_context; + spc->width = pw; + spc->height = ph; + spc->pixels = pixels; + spc->pack_info = context; + spc->nodes = nodes; + spc->padding = padding; + spc->stride_in_bytes = stride_in_bytes != 0 ? stride_in_bytes : pw; + spc->h_oversample = 1; + spc->v_oversample = 1; + spc->skip_missing = 0; + + stbrp_init_target(context, pw-padding, ph-padding, nodes, num_nodes); + + if (pixels) + STBTT_memset(pixels, 0, pw*ph); // background of 0 around pixels + + return 1; +} + +STBTT_DEF void stbtt_PackEnd (stbtt_pack_context *spc) +{ + STBTT_free(spc->nodes , spc->user_allocator_context); + STBTT_free(spc->pack_info, spc->user_allocator_context); +} + +STBTT_DEF void stbtt_PackSetOversampling(stbtt_pack_context *spc, unsigned int h_oversample, unsigned int v_oversample) +{ + STBTT_assert(h_oversample <= STBTT_MAX_OVERSAMPLE); + STBTT_assert(v_oversample <= STBTT_MAX_OVERSAMPLE); + if (h_oversample <= STBTT_MAX_OVERSAMPLE) + spc->h_oversample = h_oversample; + if (v_oversample <= STBTT_MAX_OVERSAMPLE) + spc->v_oversample = v_oversample; +} + +STBTT_DEF void stbtt_PackSetSkipMissingCodepoints(stbtt_pack_context *spc, int skip) +{ + spc->skip_missing = skip; +} + +#define STBTT__OVER_MASK (STBTT_MAX_OVERSAMPLE-1) + +static void stbtt__h_prefilter(unsigned char *pixels, int w, int h, int stride_in_bytes, unsigned int kernel_width) +{ + unsigned char buffer[STBTT_MAX_OVERSAMPLE]; + int safe_w = w - kernel_width; + int j; + STBTT_memset(buffer, 0, STBTT_MAX_OVERSAMPLE); // suppress bogus warning from VS2013 -analyze + for (j=0; j < h; ++j) { + int i; + unsigned int total; + STBTT_memset(buffer, 0, kernel_width); + + total = 0; + + // make kernel_width a constant in common cases so compiler can optimize out the divide + switch (kernel_width) { + case 2: + for (i=0; i <= safe_w; ++i) { + total += pixels[i] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; + pixels[i] = (unsigned char) (total / 2); + } + break; + case 3: + for (i=0; i <= safe_w; ++i) { + total += pixels[i] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; + pixels[i] = (unsigned char) (total / 3); + } + break; + case 4: + for (i=0; i <= safe_w; ++i) { + total += pixels[i] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; + pixels[i] = (unsigned char) (total / 4); + } + break; + case 5: + for (i=0; i <= safe_w; ++i) { + total += pixels[i] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; + pixels[i] = (unsigned char) (total / 5); + } + break; + default: + for (i=0; i <= safe_w; ++i) { + total += pixels[i] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i]; + pixels[i] = (unsigned char) (total / kernel_width); + } + break; + } + + for (; i < w; ++i) { + STBTT_assert(pixels[i] == 0); + total -= buffer[i & STBTT__OVER_MASK]; + pixels[i] = (unsigned char) (total / kernel_width); + } + + pixels += stride_in_bytes; + } +} + +static void stbtt__v_prefilter(unsigned char *pixels, int w, int h, int stride_in_bytes, unsigned int kernel_width) +{ + unsigned char buffer[STBTT_MAX_OVERSAMPLE]; + int safe_h = h - kernel_width; + int j; + STBTT_memset(buffer, 0, STBTT_MAX_OVERSAMPLE); // suppress bogus warning from VS2013 -analyze + for (j=0; j < w; ++j) { + int i; + unsigned int total; + STBTT_memset(buffer, 0, kernel_width); + + total = 0; + + // make kernel_width a constant in common cases so compiler can optimize out the divide + switch (kernel_width) { + case 2: + for (i=0; i <= safe_h; ++i) { + total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; + pixels[i*stride_in_bytes] = (unsigned char) (total / 2); + } + break; + case 3: + for (i=0; i <= safe_h; ++i) { + total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; + pixels[i*stride_in_bytes] = (unsigned char) (total / 3); + } + break; + case 4: + for (i=0; i <= safe_h; ++i) { + total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; + pixels[i*stride_in_bytes] = (unsigned char) (total / 4); + } + break; + case 5: + for (i=0; i <= safe_h; ++i) { + total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; + pixels[i*stride_in_bytes] = (unsigned char) (total / 5); + } + break; + default: + for (i=0; i <= safe_h; ++i) { + total += pixels[i*stride_in_bytes] - buffer[i & STBTT__OVER_MASK]; + buffer[(i+kernel_width) & STBTT__OVER_MASK] = pixels[i*stride_in_bytes]; + pixels[i*stride_in_bytes] = (unsigned char) (total / kernel_width); + } + break; + } + + for (; i < h; ++i) { + STBTT_assert(pixels[i*stride_in_bytes] == 0); + total -= buffer[i & STBTT__OVER_MASK]; + pixels[i*stride_in_bytes] = (unsigned char) (total / kernel_width); + } + + pixels += 1; + } +} + +static float stbtt__oversample_shift(int oversample) +{ + if (!oversample) + return 0.0f; + + // The prefilter is a box filter of width "oversample", + // which shifts phase by (oversample - 1)/2 pixels in + // oversampled space. We want to shift in the opposite + // direction to counter this. + return (float)-(oversample - 1) / (2.0f * (float)oversample); +} + +// rects array must be big enough to accommodate all characters in the given ranges +STBTT_DEF int stbtt_PackFontRangesGatherRects(stbtt_pack_context *spc, const stbtt_fontinfo *info, stbtt_pack_range *ranges, int num_ranges, stbrp_rect *rects) +{ + int i,j,k; + int missing_glyph_added = 0; + + k=0; + for (i=0; i < num_ranges; ++i) { + float fh = ranges[i].font_size; + float scale = fh > 0 ? stbtt_ScaleForPixelHeight(info, fh) : stbtt_ScaleForMappingEmToPixels(info, -fh); + ranges[i].h_oversample = (unsigned char) spc->h_oversample; + ranges[i].v_oversample = (unsigned char) spc->v_oversample; + for (j=0; j < ranges[i].num_chars; ++j) { + int x0,y0,x1,y1; + int codepoint = ranges[i].array_of_unicode_codepoints == NULL ? ranges[i].first_unicode_codepoint_in_range + j : ranges[i].array_of_unicode_codepoints[j]; + int glyph = stbtt_FindGlyphIndex(info, codepoint); + if (glyph == 0 && (spc->skip_missing || missing_glyph_added)) { + rects[k].w = rects[k].h = 0; + } else { + stbtt_GetGlyphBitmapBoxSubpixel(info,glyph, + scale * spc->h_oversample, + scale * spc->v_oversample, + 0,0, + &x0,&y0,&x1,&y1); + rects[k].w = (stbrp_coord) (x1-x0 + spc->padding + spc->h_oversample-1); + rects[k].h = (stbrp_coord) (y1-y0 + spc->padding + spc->v_oversample-1); + if (glyph == 0) + missing_glyph_added = 1; + } + ++k; + } + } + + return k; +} + +STBTT_DEF void stbtt_MakeGlyphBitmapSubpixelPrefilter(const stbtt_fontinfo *info, unsigned char *output, int out_w, int out_h, int out_stride, float scale_x, float scale_y, float shift_x, float shift_y, int prefilter_x, int prefilter_y, float *sub_x, float *sub_y, int glyph) +{ + stbtt_MakeGlyphBitmapSubpixel(info, + output, + out_w - (prefilter_x - 1), + out_h - (prefilter_y - 1), + out_stride, + scale_x, + scale_y, + shift_x, + shift_y, + glyph); + + if (prefilter_x > 1) + stbtt__h_prefilter(output, out_w, out_h, out_stride, prefilter_x); + + if (prefilter_y > 1) + stbtt__v_prefilter(output, out_w, out_h, out_stride, prefilter_y); + + *sub_x = stbtt__oversample_shift(prefilter_x); + *sub_y = stbtt__oversample_shift(prefilter_y); +} + +// rects array must be big enough to accommodate all characters in the given ranges +STBTT_DEF int stbtt_PackFontRangesRenderIntoRects(stbtt_pack_context *spc, const stbtt_fontinfo *info, stbtt_pack_range *ranges, int num_ranges, stbrp_rect *rects) +{ + int i,j,k, missing_glyph = -1, return_value = 1; + + // save current values + int old_h_over = spc->h_oversample; + int old_v_over = spc->v_oversample; + + k = 0; + for (i=0; i < num_ranges; ++i) { + float fh = ranges[i].font_size; + float scale = fh > 0 ? stbtt_ScaleForPixelHeight(info, fh) : stbtt_ScaleForMappingEmToPixels(info, -fh); + float recip_h,recip_v,sub_x,sub_y; + spc->h_oversample = ranges[i].h_oversample; + spc->v_oversample = ranges[i].v_oversample; + recip_h = 1.0f / spc->h_oversample; + recip_v = 1.0f / spc->v_oversample; + sub_x = stbtt__oversample_shift(spc->h_oversample); + sub_y = stbtt__oversample_shift(spc->v_oversample); + for (j=0; j < ranges[i].num_chars; ++j) { + stbrp_rect *r = &rects[k]; + if (r->was_packed && r->w != 0 && r->h != 0) { + stbtt_packedchar *bc = &ranges[i].chardata_for_range[j]; + int advance, lsb, x0,y0,x1,y1; + int codepoint = ranges[i].array_of_unicode_codepoints == NULL ? ranges[i].first_unicode_codepoint_in_range + j : ranges[i].array_of_unicode_codepoints[j]; + int glyph = stbtt_FindGlyphIndex(info, codepoint); + stbrp_coord pad = (stbrp_coord) spc->padding; + + // pad on left and top + r->x += pad; + r->y += pad; + r->w -= pad; + r->h -= pad; + stbtt_GetGlyphHMetrics(info, glyph, &advance, &lsb); + stbtt_GetGlyphBitmapBox(info, glyph, + scale * spc->h_oversample, + scale * spc->v_oversample, + &x0,&y0,&x1,&y1); + stbtt_MakeGlyphBitmapSubpixel(info, + spc->pixels + r->x + r->y*spc->stride_in_bytes, + r->w - spc->h_oversample+1, + r->h - spc->v_oversample+1, + spc->stride_in_bytes, + scale * spc->h_oversample, + scale * spc->v_oversample, + 0,0, + glyph); + + if (spc->h_oversample > 1) + stbtt__h_prefilter(spc->pixels + r->x + r->y*spc->stride_in_bytes, + r->w, r->h, spc->stride_in_bytes, + spc->h_oversample); + + if (spc->v_oversample > 1) + stbtt__v_prefilter(spc->pixels + r->x + r->y*spc->stride_in_bytes, + r->w, r->h, spc->stride_in_bytes, + spc->v_oversample); + + bc->x0 = (stbtt_int16) r->x; + bc->y0 = (stbtt_int16) r->y; + bc->x1 = (stbtt_int16) (r->x + r->w); + bc->y1 = (stbtt_int16) (r->y + r->h); + bc->xadvance = scale * advance; + bc->xoff = (float) x0 * recip_h + sub_x; + bc->yoff = (float) y0 * recip_v + sub_y; + bc->xoff2 = (x0 + r->w) * recip_h + sub_x; + bc->yoff2 = (y0 + r->h) * recip_v + sub_y; + + if (glyph == 0) + missing_glyph = j; + } else if (spc->skip_missing) { + return_value = 0; + } else if (r->was_packed && r->w == 0 && r->h == 0 && missing_glyph >= 0) { + ranges[i].chardata_for_range[j] = ranges[i].chardata_for_range[missing_glyph]; + } else { + return_value = 0; // if any fail, report failure + } + + ++k; + } + } + + // restore original values + spc->h_oversample = old_h_over; + spc->v_oversample = old_v_over; + + return return_value; +} + +STBTT_DEF void stbtt_PackFontRangesPackRects(stbtt_pack_context *spc, stbrp_rect *rects, int num_rects) +{ + stbrp_pack_rects((stbrp_context *) spc->pack_info, rects, num_rects); +} + +STBTT_DEF int stbtt_PackFontRanges(stbtt_pack_context *spc, const unsigned char *fontdata, int font_index, stbtt_pack_range *ranges, int num_ranges) +{ + stbtt_fontinfo info; + int i,j,n, return_value = 1; + //stbrp_context *context = (stbrp_context *) spc->pack_info; + stbrp_rect *rects; + + // flag all characters as NOT packed + for (i=0; i < num_ranges; ++i) + for (j=0; j < ranges[i].num_chars; ++j) + ranges[i].chardata_for_range[j].x0 = + ranges[i].chardata_for_range[j].y0 = + ranges[i].chardata_for_range[j].x1 = + ranges[i].chardata_for_range[j].y1 = 0; + + n = 0; + for (i=0; i < num_ranges; ++i) + n += ranges[i].num_chars; + + rects = (stbrp_rect *) STBTT_malloc(sizeof(*rects) * n, spc->user_allocator_context); + if (rects == NULL) + return 0; + + info.userdata = spc->user_allocator_context; + stbtt_InitFont(&info, fontdata, stbtt_GetFontOffsetForIndex(fontdata,font_index)); + + n = stbtt_PackFontRangesGatherRects(spc, &info, ranges, num_ranges, rects); + + stbtt_PackFontRangesPackRects(spc, rects, n); + + return_value = stbtt_PackFontRangesRenderIntoRects(spc, &info, ranges, num_ranges, rects); + + STBTT_free(rects, spc->user_allocator_context); + return return_value; +} + +STBTT_DEF int stbtt_PackFontRange(stbtt_pack_context *spc, const unsigned char *fontdata, int font_index, float font_size, + int first_unicode_codepoint_in_range, int num_chars_in_range, stbtt_packedchar *chardata_for_range) +{ + stbtt_pack_range range; + range.first_unicode_codepoint_in_range = first_unicode_codepoint_in_range; + range.array_of_unicode_codepoints = NULL; + range.num_chars = num_chars_in_range; + range.chardata_for_range = chardata_for_range; + range.font_size = font_size; + return stbtt_PackFontRanges(spc, fontdata, font_index, &range, 1); +} + +STBTT_DEF void stbtt_GetScaledFontVMetrics(const unsigned char *fontdata, int index, float size, float *ascent, float *descent, float *lineGap) +{ + int i_ascent, i_descent, i_lineGap; + float scale; + stbtt_fontinfo info; + stbtt_InitFont(&info, fontdata, stbtt_GetFontOffsetForIndex(fontdata, index)); + scale = size > 0 ? stbtt_ScaleForPixelHeight(&info, size) : stbtt_ScaleForMappingEmToPixels(&info, -size); + stbtt_GetFontVMetrics(&info, &i_ascent, &i_descent, &i_lineGap); + *ascent = (float) i_ascent * scale; + *descent = (float) i_descent * scale; + *lineGap = (float) i_lineGap * scale; +} + +STBTT_DEF void stbtt_GetPackedQuad(const stbtt_packedchar *chardata, int pw, int ph, int char_index, float *xpos, float *ypos, stbtt_aligned_quad *q, int align_to_integer) +{ + float ipw = 1.0f / pw, iph = 1.0f / ph; + const stbtt_packedchar *b = chardata + char_index; + + if (align_to_integer) { + float x = (float) STBTT_ifloor((*xpos + b->xoff) + 0.5f); + float y = (float) STBTT_ifloor((*ypos + b->yoff) + 0.5f); + q->x0 = x; + q->y0 = y; + q->x1 = x + b->xoff2 - b->xoff; + q->y1 = y + b->yoff2 - b->yoff; + } else { + q->x0 = *xpos + b->xoff; + q->y0 = *ypos + b->yoff; + q->x1 = *xpos + b->xoff2; + q->y1 = *ypos + b->yoff2; + } + + q->s0 = b->x0 * ipw; + q->t0 = b->y0 * iph; + q->s1 = b->x1 * ipw; + q->t1 = b->y1 * iph; + + *xpos += b->xadvance; +} + +////////////////////////////////////////////////////////////////////////////// +// +// sdf computation +// + +#define STBTT_min(a,b) ((a) < (b) ? (a) : (b)) +#define STBTT_max(a,b) ((a) < (b) ? (b) : (a)) + +static int stbtt__ray_intersect_bezier(float orig[2], float ray[2], float q0[2], float q1[2], float q2[2], float hits[2][2]) +{ + float q0perp = q0[1]*ray[0] - q0[0]*ray[1]; + float q1perp = q1[1]*ray[0] - q1[0]*ray[1]; + float q2perp = q2[1]*ray[0] - q2[0]*ray[1]; + float roperp = orig[1]*ray[0] - orig[0]*ray[1]; + + float a = q0perp - 2*q1perp + q2perp; + float b = q1perp - q0perp; + float c = q0perp - roperp; + + float s0 = 0., s1 = 0.; + int num_s = 0; + + if (a != 0.0) { + float discr = b*b - a*c; + if (discr > 0.0) { + float rcpna = -1 / a; + float d = (float) STBTT_sqrt(discr); + s0 = (b+d) * rcpna; + s1 = (b-d) * rcpna; + if (s0 >= 0.0 && s0 <= 1.0) + num_s = 1; + if (d > 0.0 && s1 >= 0.0 && s1 <= 1.0) { + if (num_s == 0) s0 = s1; + ++num_s; + } + } + } else { + // 2*b*s + c = 0 + // s = -c / (2*b) + s0 = c / (-2 * b); + if (s0 >= 0.0 && s0 <= 1.0) + num_s = 1; + } + + if (num_s == 0) + return 0; + else { + float rcp_len2 = 1 / (ray[0]*ray[0] + ray[1]*ray[1]); + float rayn_x = ray[0] * rcp_len2, rayn_y = ray[1] * rcp_len2; + + float q0d = q0[0]*rayn_x + q0[1]*rayn_y; + float q1d = q1[0]*rayn_x + q1[1]*rayn_y; + float q2d = q2[0]*rayn_x + q2[1]*rayn_y; + float rod = orig[0]*rayn_x + orig[1]*rayn_y; + + float q10d = q1d - q0d; + float q20d = q2d - q0d; + float q0rd = q0d - rod; + + hits[0][0] = q0rd + s0*(2.0f - 2.0f*s0)*q10d + s0*s0*q20d; + hits[0][1] = a*s0+b; + + if (num_s > 1) { + hits[1][0] = q0rd + s1*(2.0f - 2.0f*s1)*q10d + s1*s1*q20d; + hits[1][1] = a*s1+b; + return 2; + } else { + return 1; + } + } +} + +static int equal(float *a, float *b) +{ + return (a[0] == b[0] && a[1] == b[1]); +} + +static int stbtt__compute_crossings_x(float x, float y, int nverts, stbtt_vertex *verts) +{ + int i; + float orig[2], ray[2] = { 1, 0 }; + float y_frac; + int winding = 0; + + // make sure y never passes through a vertex of the shape + y_frac = (float) STBTT_fmod(y, 1.0f); + if (y_frac < 0.01f) + y += 0.01f; + else if (y_frac > 0.99f) + y -= 0.01f; + + orig[0] = x; + orig[1] = y; + + // test a ray from (-infinity,y) to (x,y) + for (i=0; i < nverts; ++i) { + if (verts[i].type == STBTT_vline) { + int x0 = (int) verts[i-1].x, y0 = (int) verts[i-1].y; + int x1 = (int) verts[i ].x, y1 = (int) verts[i ].y; + if (y > STBTT_min(y0,y1) && y < STBTT_max(y0,y1) && x > STBTT_min(x0,x1)) { + float x_inter = (y - y0) / (y1 - y0) * (x1-x0) + x0; + if (x_inter < x) + winding += (y0 < y1) ? 1 : -1; + } + } + if (verts[i].type == STBTT_vcurve) { + int x0 = (int) verts[i-1].x , y0 = (int) verts[i-1].y ; + int x1 = (int) verts[i ].cx, y1 = (int) verts[i ].cy; + int x2 = (int) verts[i ].x , y2 = (int) verts[i ].y ; + int ax = STBTT_min(x0,STBTT_min(x1,x2)), ay = STBTT_min(y0,STBTT_min(y1,y2)); + int by = STBTT_max(y0,STBTT_max(y1,y2)); + if (y > ay && y < by && x > ax) { + float q0[2],q1[2],q2[2]; + float hits[2][2]; + q0[0] = (float)x0; + q0[1] = (float)y0; + q1[0] = (float)x1; + q1[1] = (float)y1; + q2[0] = (float)x2; + q2[1] = (float)y2; + if (equal(q0,q1) || equal(q1,q2)) { + x0 = (int)verts[i-1].x; + y0 = (int)verts[i-1].y; + x1 = (int)verts[i ].x; + y1 = (int)verts[i ].y; + if (y > STBTT_min(y0,y1) && y < STBTT_max(y0,y1) && x > STBTT_min(x0,x1)) { + float x_inter = (y - y0) / (y1 - y0) * (x1-x0) + x0; + if (x_inter < x) + winding += (y0 < y1) ? 1 : -1; + } + } else { + int num_hits = stbtt__ray_intersect_bezier(orig, ray, q0, q1, q2, hits); + if (num_hits >= 1) + if (hits[0][0] < 0) + winding += (hits[0][1] < 0 ? -1 : 1); + if (num_hits >= 2) + if (hits[1][0] < 0) + winding += (hits[1][1] < 0 ? -1 : 1); + } + } + } + } + return winding; +} + +static float stbtt__cuberoot( float x ) +{ + if (x<0) + return -(float) STBTT_pow(-x,1.0f/3.0f); + else + return (float) STBTT_pow( x,1.0f/3.0f); +} + +// x^3 + a*x^2 + b*x + c = 0 +static int stbtt__solve_cubic(float a, float b, float c, float* r) +{ + float s = -a / 3; + float p = b - a*a / 3; + float q = a * (2*a*a - 9*b) / 27 + c; + float p3 = p*p*p; + float d = q*q + 4*p3 / 27; + if (d >= 0) { + float z = (float) STBTT_sqrt(d); + float u = (-q + z) / 2; + float v = (-q - z) / 2; + u = stbtt__cuberoot(u); + v = stbtt__cuberoot(v); + r[0] = s + u + v; + return 1; + } else { + float u = (float) STBTT_sqrt(-p/3); + float v = (float) STBTT_acos(-STBTT_sqrt(-27/p3) * q / 2) / 3; // p3 must be negative, since d is negative + float m = (float) STBTT_cos(v); + float n = (float) STBTT_cos(v-3.141592/2)*1.732050808f; + r[0] = s + u * 2 * m; + r[1] = s - u * (m + n); + r[2] = s - u * (m - n); + + //STBTT_assert( STBTT_fabs(((r[0]+a)*r[0]+b)*r[0]+c) < 0.05f); // these asserts may not be safe at all scales, though they're in bezier t parameter units so maybe? + //STBTT_assert( STBTT_fabs(((r[1]+a)*r[1]+b)*r[1]+c) < 0.05f); + //STBTT_assert( STBTT_fabs(((r[2]+a)*r[2]+b)*r[2]+c) < 0.05f); + return 3; + } +} + +STBTT_DEF unsigned char * stbtt_GetGlyphSDF(const stbtt_fontinfo *info, float scale, int glyph, int padding, unsigned char onedge_value, float pixel_dist_scale, int *width, int *height, int *xoff, int *yoff) +{ + float scale_x = scale, scale_y = scale; + int ix0,iy0,ix1,iy1; + int w,h; + unsigned char *data; + + if (scale == 0) return NULL; + + stbtt_GetGlyphBitmapBoxSubpixel(info, glyph, scale, scale, 0.0f,0.0f, &ix0,&iy0,&ix1,&iy1); + + // if empty, return NULL + if (ix0 == ix1 || iy0 == iy1) + return NULL; + + ix0 -= padding; + iy0 -= padding; + ix1 += padding; + iy1 += padding; + + w = (ix1 - ix0); + h = (iy1 - iy0); + + if (width ) *width = w; + if (height) *height = h; + if (xoff ) *xoff = ix0; + if (yoff ) *yoff = iy0; + + // invert for y-downwards bitmaps + scale_y = -scale_y; + + { + int x,y,i,j; + float *precompute; + stbtt_vertex *verts; + int num_verts = stbtt_GetGlyphShape(info, glyph, &verts); + data = (unsigned char *) STBTT_malloc(w * h, info->userdata); + precompute = (float *) STBTT_malloc(num_verts * sizeof(float), info->userdata); + + for (i=0,j=num_verts-1; i < num_verts; j=i++) { + if (verts[i].type == STBTT_vline) { + float x0 = verts[i].x*scale_x, y0 = verts[i].y*scale_y; + float x1 = verts[j].x*scale_x, y1 = verts[j].y*scale_y; + float dist = (float) STBTT_sqrt((x1-x0)*(x1-x0) + (y1-y0)*(y1-y0)); + precompute[i] = (dist == 0) ? 0.0f : 1.0f / dist; + } else if (verts[i].type == STBTT_vcurve) { + float x2 = verts[j].x *scale_x, y2 = verts[j].y *scale_y; + float x1 = verts[i].cx*scale_x, y1 = verts[i].cy*scale_y; + float x0 = verts[i].x *scale_x, y0 = verts[i].y *scale_y; + float bx = x0 - 2*x1 + x2, by = y0 - 2*y1 + y2; + float len2 = bx*bx + by*by; + if (len2 != 0.0f) + precompute[i] = 1.0f / (bx*bx + by*by); + else + precompute[i] = 0.0f; + } else + precompute[i] = 0.0f; + } + + for (y=iy0; y < iy1; ++y) { + for (x=ix0; x < ix1; ++x) { + float val; + float min_dist = 999999.0f; + float sx = (float) x + 0.5f; + float sy = (float) y + 0.5f; + float x_gspace = (sx / scale_x); + float y_gspace = (sy / scale_y); + + int winding = stbtt__compute_crossings_x(x_gspace, y_gspace, num_verts, verts); // @OPTIMIZE: this could just be a rasterization, but needs to be line vs. non-tesselated curves so a new path + + for (i=0; i < num_verts; ++i) { + float x0 = verts[i].x*scale_x, y0 = verts[i].y*scale_y; + + if (verts[i].type == STBTT_vline && precompute[i] != 0.0f) { + float x1 = verts[i-1].x*scale_x, y1 = verts[i-1].y*scale_y; + + float dist,dist2 = (x0-sx)*(x0-sx) + (y0-sy)*(y0-sy); + if (dist2 < min_dist*min_dist) + min_dist = (float) STBTT_sqrt(dist2); + + // coarse culling against bbox + //if (sx > STBTT_min(x0,x1)-min_dist && sx < STBTT_max(x0,x1)+min_dist && + // sy > STBTT_min(y0,y1)-min_dist && sy < STBTT_max(y0,y1)+min_dist) + dist = (float) STBTT_fabs((x1-x0)*(y0-sy) - (y1-y0)*(x0-sx)) * precompute[i]; + STBTT_assert(i != 0); + if (dist < min_dist) { + // check position along line + // x' = x0 + t*(x1-x0), y' = y0 + t*(y1-y0) + // minimize (x'-sx)*(x'-sx)+(y'-sy)*(y'-sy) + float dx = x1-x0, dy = y1-y0; + float px = x0-sx, py = y0-sy; + // minimize (px+t*dx)^2 + (py+t*dy)^2 = px*px + 2*px*dx*t + t^2*dx*dx + py*py + 2*py*dy*t + t^2*dy*dy + // derivative: 2*px*dx + 2*py*dy + (2*dx*dx+2*dy*dy)*t, set to 0 and solve + float t = -(px*dx + py*dy) / (dx*dx + dy*dy); + if (t >= 0.0f && t <= 1.0f) + min_dist = dist; + } + } else if (verts[i].type == STBTT_vcurve) { + float x2 = verts[i-1].x *scale_x, y2 = verts[i-1].y *scale_y; + float x1 = verts[i ].cx*scale_x, y1 = verts[i ].cy*scale_y; + float box_x0 = STBTT_min(STBTT_min(x0,x1),x2); + float box_y0 = STBTT_min(STBTT_min(y0,y1),y2); + float box_x1 = STBTT_max(STBTT_max(x0,x1),x2); + float box_y1 = STBTT_max(STBTT_max(y0,y1),y2); + // coarse culling against bbox to avoid computing cubic unnecessarily + if (sx > box_x0-min_dist && sx < box_x1+min_dist && sy > box_y0-min_dist && sy < box_y1+min_dist) { + int num=0; + float ax = x1-x0, ay = y1-y0; + float bx = x0 - 2*x1 + x2, by = y0 - 2*y1 + y2; + float mx = x0 - sx, my = y0 - sy; + float res[3] = {0.f,0.f,0.f}; + float px,py,t,it,dist2; + float a_inv = precompute[i]; + if (a_inv == 0.0) { // if a_inv is 0, it's 2nd degree so use quadratic formula + float a = 3*(ax*bx + ay*by); + float b = 2*(ax*ax + ay*ay) + (mx*bx+my*by); + float c = mx*ax+my*ay; + if (a == 0.0) { // if a is 0, it's linear + if (b != 0.0) { + res[num++] = -c/b; + } + } else { + float discriminant = b*b - 4*a*c; + if (discriminant < 0) + num = 0; + else { + float root = (float) STBTT_sqrt(discriminant); + res[0] = (-b - root)/(2*a); + res[1] = (-b + root)/(2*a); + num = 2; // don't bother distinguishing 1-solution case, as code below will still work + } + } + } else { + float b = 3*(ax*bx + ay*by) * a_inv; // could precompute this as it doesn't depend on sample point + float c = (2*(ax*ax + ay*ay) + (mx*bx+my*by)) * a_inv; + float d = (mx*ax+my*ay) * a_inv; + num = stbtt__solve_cubic(b, c, d, res); + } + dist2 = (x0-sx)*(x0-sx) + (y0-sy)*(y0-sy); + if (dist2 < min_dist*min_dist) + min_dist = (float) STBTT_sqrt(dist2); + + if (num >= 1 && res[0] >= 0.0f && res[0] <= 1.0f) { + t = res[0], it = 1.0f - t; + px = it*it*x0 + 2*t*it*x1 + t*t*x2; + py = it*it*y0 + 2*t*it*y1 + t*t*y2; + dist2 = (px-sx)*(px-sx) + (py-sy)*(py-sy); + if (dist2 < min_dist * min_dist) + min_dist = (float) STBTT_sqrt(dist2); + } + if (num >= 2 && res[1] >= 0.0f && res[1] <= 1.0f) { + t = res[1], it = 1.0f - t; + px = it*it*x0 + 2*t*it*x1 + t*t*x2; + py = it*it*y0 + 2*t*it*y1 + t*t*y2; + dist2 = (px-sx)*(px-sx) + (py-sy)*(py-sy); + if (dist2 < min_dist * min_dist) + min_dist = (float) STBTT_sqrt(dist2); + } + if (num >= 3 && res[2] >= 0.0f && res[2] <= 1.0f) { + t = res[2], it = 1.0f - t; + px = it*it*x0 + 2*t*it*x1 + t*t*x2; + py = it*it*y0 + 2*t*it*y1 + t*t*y2; + dist2 = (px-sx)*(px-sx) + (py-sy)*(py-sy); + if (dist2 < min_dist * min_dist) + min_dist = (float) STBTT_sqrt(dist2); + } + } + } + } + if (winding == 0) + min_dist = -min_dist; // if outside the shape, value is negative + val = onedge_value + pixel_dist_scale * min_dist; + if (val < 0) + val = 0; + else if (val > 255) + val = 255; + data[(y-iy0)*w+(x-ix0)] = (unsigned char) val; + } + } + STBTT_free(precompute, info->userdata); + STBTT_free(verts, info->userdata); + } + return data; +} + +STBTT_DEF unsigned char * stbtt_GetCodepointSDF(const stbtt_fontinfo *info, float scale, int codepoint, int padding, unsigned char onedge_value, float pixel_dist_scale, int *width, int *height, int *xoff, int *yoff) +{ + return stbtt_GetGlyphSDF(info, scale, stbtt_FindGlyphIndex(info, codepoint), padding, onedge_value, pixel_dist_scale, width, height, xoff, yoff); +} + +STBTT_DEF void stbtt_FreeSDF(unsigned char *bitmap, void *userdata) +{ + STBTT_free(bitmap, userdata); +} + +////////////////////////////////////////////////////////////////////////////// +// +// font name matching -- recommended not to use this +// + +// check if a utf8 string contains a prefix which is the utf16 string; if so return length of matching utf8 string +static stbtt_int32 stbtt__CompareUTF8toUTF16_bigendian_prefix(stbtt_uint8 *s1, stbtt_int32 len1, stbtt_uint8 *s2, stbtt_int32 len2) +{ + stbtt_int32 i=0; + + // convert utf16 to utf8 and compare the results while converting + while (len2) { + stbtt_uint16 ch = s2[0]*256 + s2[1]; + if (ch < 0x80) { + if (i >= len1) return -1; + if (s1[i++] != ch) return -1; + } else if (ch < 0x800) { + if (i+1 >= len1) return -1; + if (s1[i++] != 0xc0 + (ch >> 6)) return -1; + if (s1[i++] != 0x80 + (ch & 0x3f)) return -1; + } else if (ch >= 0xd800 && ch < 0xdc00) { + stbtt_uint32 c; + stbtt_uint16 ch2 = s2[2]*256 + s2[3]; + if (i+3 >= len1) return -1; + c = ((ch - 0xd800) << 10) + (ch2 - 0xdc00) + 0x10000; + if (s1[i++] != 0xf0 + (c >> 18)) return -1; + if (s1[i++] != 0x80 + ((c >> 12) & 0x3f)) return -1; + if (s1[i++] != 0x80 + ((c >> 6) & 0x3f)) return -1; + if (s1[i++] != 0x80 + ((c ) & 0x3f)) return -1; + s2 += 2; // plus another 2 below + len2 -= 2; + } else if (ch >= 0xdc00 && ch < 0xe000) { + return -1; + } else { + if (i+2 >= len1) return -1; + if (s1[i++] != 0xe0 + (ch >> 12)) return -1; + if (s1[i++] != 0x80 + ((ch >> 6) & 0x3f)) return -1; + if (s1[i++] != 0x80 + ((ch ) & 0x3f)) return -1; + } + s2 += 2; + len2 -= 2; + } + return i; +} + +static int stbtt_CompareUTF8toUTF16_bigendian_internal(char *s1, int len1, char *s2, int len2) +{ + return len1 == stbtt__CompareUTF8toUTF16_bigendian_prefix((stbtt_uint8*) s1, len1, (stbtt_uint8*) s2, len2); +} + +// returns results in whatever encoding you request... but note that 2-byte encodings +// will be BIG-ENDIAN... use stbtt_CompareUTF8toUTF16_bigendian() to compare +STBTT_DEF const char *stbtt_GetFontNameString(const stbtt_fontinfo *font, int *length, int platformID, int encodingID, int languageID, int nameID) +{ + stbtt_int32 i,count,stringOffset; + stbtt_uint8 *fc = font->data; + stbtt_uint32 offset = font->fontstart; + stbtt_uint32 nm = stbtt__find_table(fc, offset, "name"); + if (!nm) return NULL; + + count = ttUSHORT(fc+nm+2); + stringOffset = nm + ttUSHORT(fc+nm+4); + for (i=0; i < count; ++i) { + stbtt_uint32 loc = nm + 6 + 12 * i; + if (platformID == ttUSHORT(fc+loc+0) && encodingID == ttUSHORT(fc+loc+2) + && languageID == ttUSHORT(fc+loc+4) && nameID == ttUSHORT(fc+loc+6)) { + *length = ttUSHORT(fc+loc+8); + return (const char *) (fc+stringOffset+ttUSHORT(fc+loc+10)); + } + } + return NULL; +} + +static int stbtt__matchpair(stbtt_uint8 *fc, stbtt_uint32 nm, stbtt_uint8 *name, stbtt_int32 nlen, stbtt_int32 target_id, stbtt_int32 next_id) +{ + stbtt_int32 i; + stbtt_int32 count = ttUSHORT(fc+nm+2); + stbtt_int32 stringOffset = nm + ttUSHORT(fc+nm+4); + + for (i=0; i < count; ++i) { + stbtt_uint32 loc = nm + 6 + 12 * i; + stbtt_int32 id = ttUSHORT(fc+loc+6); + if (id == target_id) { + // find the encoding + stbtt_int32 platform = ttUSHORT(fc+loc+0), encoding = ttUSHORT(fc+loc+2), language = ttUSHORT(fc+loc+4); + + // is this a Unicode encoding? + if (platform == 0 || (platform == 3 && encoding == 1) || (platform == 3 && encoding == 10)) { + stbtt_int32 slen = ttUSHORT(fc+loc+8); + stbtt_int32 off = ttUSHORT(fc+loc+10); + + // check if there's a prefix match + stbtt_int32 matchlen = stbtt__CompareUTF8toUTF16_bigendian_prefix(name, nlen, fc+stringOffset+off,slen); + if (matchlen >= 0) { + // check for target_id+1 immediately following, with same encoding & language + if (i+1 < count && ttUSHORT(fc+loc+12+6) == next_id && ttUSHORT(fc+loc+12) == platform && ttUSHORT(fc+loc+12+2) == encoding && ttUSHORT(fc+loc+12+4) == language) { + slen = ttUSHORT(fc+loc+12+8); + off = ttUSHORT(fc+loc+12+10); + if (slen == 0) { + if (matchlen == nlen) + return 1; + } else if (matchlen < nlen && name[matchlen] == ' ') { + ++matchlen; + if (stbtt_CompareUTF8toUTF16_bigendian_internal((char*) (name+matchlen), nlen-matchlen, (char*)(fc+stringOffset+off),slen)) + return 1; + } + } else { + // if nothing immediately following + if (matchlen == nlen) + return 1; + } + } + } + + // @TODO handle other encodings + } + } + return 0; +} + +static int stbtt__matches(stbtt_uint8 *fc, stbtt_uint32 offset, stbtt_uint8 *name, stbtt_int32 flags) +{ + stbtt_int32 nlen = (stbtt_int32) STBTT_strlen((char *) name); + stbtt_uint32 nm,hd; + if (!stbtt__isfont(fc+offset)) return 0; + + // check italics/bold/underline flags in macStyle... + if (flags) { + hd = stbtt__find_table(fc, offset, "head"); + if ((ttUSHORT(fc+hd+44) & 7) != (flags & 7)) return 0; + } + + nm = stbtt__find_table(fc, offset, "name"); + if (!nm) return 0; + + if (flags) { + // if we checked the macStyle flags, then just check the family and ignore the subfamily + if (stbtt__matchpair(fc, nm, name, nlen, 16, -1)) return 1; + if (stbtt__matchpair(fc, nm, name, nlen, 1, -1)) return 1; + if (stbtt__matchpair(fc, nm, name, nlen, 3, -1)) return 1; + } else { + if (stbtt__matchpair(fc, nm, name, nlen, 16, 17)) return 1; + if (stbtt__matchpair(fc, nm, name, nlen, 1, 2)) return 1; + if (stbtt__matchpair(fc, nm, name, nlen, 3, -1)) return 1; + } + + return 0; +} + +static int stbtt_FindMatchingFont_internal(unsigned char *font_collection, char *name_utf8, stbtt_int32 flags) +{ + stbtt_int32 i; + for (i=0;;++i) { + stbtt_int32 off = stbtt_GetFontOffsetForIndex(font_collection, i); + if (off < 0) return off; + if (stbtt__matches((stbtt_uint8 *) font_collection, off, (stbtt_uint8*) name_utf8, flags)) + return off; + } +} + +#if defined(__GNUC__) || defined(__clang__) +#pragma GCC diagnostic push +#pragma GCC diagnostic ignored "-Wcast-qual" +#endif + +STBTT_DEF int stbtt_BakeFontBitmap(const unsigned char *data, int offset, + float pixel_height, unsigned char *pixels, int pw, int ph, + int first_char, int num_chars, stbtt_bakedchar *chardata) +{ + return stbtt_BakeFontBitmap_internal((unsigned char *) data, offset, pixel_height, pixels, pw, ph, first_char, num_chars, chardata); +} + +STBTT_DEF int stbtt_GetFontOffsetForIndex(const unsigned char *data, int index) +{ + return stbtt_GetFontOffsetForIndex_internal((unsigned char *) data, index); +} + +STBTT_DEF int stbtt_GetNumberOfFonts(const unsigned char *data) +{ + return stbtt_GetNumberOfFonts_internal((unsigned char *) data); +} + +STBTT_DEF int stbtt_InitFont(stbtt_fontinfo *info, const unsigned char *data, int offset) +{ + return stbtt_InitFont_internal(info, (unsigned char *) data, offset); +} + +STBTT_DEF int stbtt_FindMatchingFont(const unsigned char *fontdata, const char *name, int flags) +{ + return stbtt_FindMatchingFont_internal((unsigned char *) fontdata, (char *) name, flags); +} + +STBTT_DEF int stbtt_CompareUTF8toUTF16_bigendian(const char *s1, int len1, const char *s2, int len2) +{ + return stbtt_CompareUTF8toUTF16_bigendian_internal((char *) s1, len1, (char *) s2, len2); +} + +#if defined(__GNUC__) || defined(__clang__) +#pragma GCC diagnostic pop +#endif + +#endif // STB_TRUETYPE_IMPLEMENTATION + + +// FULL VERSION HISTORY +// +// 1.25 (2021-07-11) many fixes +// 1.24 (2020-02-05) fix warning +// 1.23 (2020-02-02) query SVG data for glyphs; query whole kerning table (but only kern not GPOS) +// 1.22 (2019-08-11) minimize missing-glyph duplication; fix kerning if both 'GPOS' and 'kern' are defined +// 1.21 (2019-02-25) fix warning +// 1.20 (2019-02-07) PackFontRange skips missing codepoints; GetScaleFontVMetrics() +// 1.19 (2018-02-11) OpenType GPOS kerning (horizontal only), STBTT_fmod +// 1.18 (2018-01-29) add missing function +// 1.17 (2017-07-23) make more arguments const; doc fix +// 1.16 (2017-07-12) SDF support +// 1.15 (2017-03-03) make more arguments const +// 1.14 (2017-01-16) num-fonts-in-TTC function +// 1.13 (2017-01-02) support OpenType fonts, certain Apple fonts +// 1.12 (2016-10-25) suppress warnings about casting away const with -Wcast-qual +// 1.11 (2016-04-02) fix unused-variable warning +// 1.10 (2016-04-02) allow user-defined fabs() replacement +// fix memory leak if fontsize=0.0 +// fix warning from duplicate typedef +// 1.09 (2016-01-16) warning fix; avoid crash on outofmem; use alloc userdata for PackFontRanges +// 1.08 (2015-09-13) document stbtt_Rasterize(); fixes for vertical & horizontal edges +// 1.07 (2015-08-01) allow PackFontRanges to accept arrays of sparse codepoints; +// allow PackFontRanges to pack and render in separate phases; +// fix stbtt_GetFontOFfsetForIndex (never worked for non-0 input?); +// fixed an assert() bug in the new rasterizer +// replace assert() with STBTT_assert() in new rasterizer +// 1.06 (2015-07-14) performance improvements (~35% faster on x86 and x64 on test machine) +// also more precise AA rasterizer, except if shapes overlap +// remove need for STBTT_sort +// 1.05 (2015-04-15) fix misplaced definitions for STBTT_STATIC +// 1.04 (2015-04-15) typo in example +// 1.03 (2015-04-12) STBTT_STATIC, fix memory leak in new packing, various fixes +// 1.02 (2014-12-10) fix various warnings & compile issues w/ stb_rect_pack, C++ +// 1.01 (2014-12-08) fix subpixel position when oversampling to exactly match +// non-oversampled; STBTT_POINT_SIZE for packed case only +// 1.00 (2014-12-06) add new PackBegin etc. API, w/ support for oversampling +// 0.99 (2014-09-18) fix multiple bugs with subpixel rendering (ryg) +// 0.9 (2014-08-07) support certain mac/iOS fonts without an MS platformID +// 0.8b (2014-07-07) fix a warning +// 0.8 (2014-05-25) fix a few more warnings +// 0.7 (2013-09-25) bugfix: subpixel glyph bug fixed in 0.5 had come back +// 0.6c (2012-07-24) improve documentation +// 0.6b (2012-07-20) fix a few more warnings +// 0.6 (2012-07-17) fix warnings; added stbtt_ScaleForMappingEmToPixels, +// stbtt_GetFontBoundingBox, stbtt_IsGlyphEmpty +// 0.5 (2011-12-09) bugfixes: +// subpixel glyph renderer computed wrong bounding box +// first vertex of shape can be off-curve (FreeSans) +// 0.4b (2011-12-03) fixed an error in the font baking example +// 0.4 (2011-12-01) kerning, subpixel rendering (tor) +// bugfixes for: +// codepoint-to-glyph conversion using table fmt=12 +// codepoint-to-glyph conversion using table fmt=4 +// stbtt_GetBakedQuad with non-square texture (Zer) +// updated Hello World! sample to use kerning and subpixel +// fixed some warnings +// 0.3 (2009-06-24) cmap fmt=12, compound shapes (MM) +// userdata, malloc-from-userdata, non-zero fill (stb) +// 0.2 (2009-03-11) Fix unsigned/signed char warnings +// 0.1 (2009-03-09) First public release +// + +/* +------------------------------------------------------------------------------ +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. +------------------------------------------------------------------------------ +*/ diff --git a/rdic.h b/rdic.h new file mode 100644 index 0000000..7eb3360 --- /dev/null +++ b/rdic.h @@ -0,0 +1,423 @@ + + + +typedef struct RDIC_Node RDIC_Node; +struct RDIC_Node { + unsigned int generation; + RDIC_Node *parent; // Ease of access. + RDIC_Node *sibling; + RDIC_Node *first_child; + //RDIC_Node *last_child; // Ease of access. + //RDIC_Node *previous_sibling; // Ease of access. +#if 0 + NOTE(Zelaven): + Pre-order traversal is self-then-first_child. + Post-order traversal is first_child-then-self. + The sibling always comes last. +#endif +}; + + +typedef struct { + RDIC_Node *node; + unsigned int generation; +} RDIC_Node_Reference; +// IDEA(Zelaven): Can the node reference hold only the pointer, and the pointed-to node hold a back-pointer to the reference? +// There is only one valid reference at a time, so the reference validity should be easy to determine without use of generations. +// NOTE(Zelaven): This idea is bad because it assumes that a reference won't be reallocated. Generations are much more reliable. + + +typedef struct { + RDIC_Node *root; + RDIC_Node *node_freelist; + + RDIC_Node *current_parent; + RDIC_Node *frame_current_node; +} RDIC_Context; + + +static inline int gui_node_references_equal( + RDIC_Node_Reference n, + RDIC_Node_Reference m) +{ + return (n.node == m.node) && (n.generation == m.generation); +} + +enum { + RDIC_GET_NODE__NODES_COLLECTED = 1 << 0, + RDIC_GET_NODE__NODE_ALLOCATED = 1 << 1, + RDIC_GET_NODE__OUT_OF_FREELIST = 1 << 2, +}; + + +void rdic_cull_subtrees( + RDIC_Context context[static 1], + RDIC_Node *subtree); + +RDIC_Node_Reference rdic_context_start_frame( + RDIC_Context context[static 1], + RDIC_Node_Reference last_root); + +int rdic_context_finish_frame( + RDIC_Context context[static 1]); + +RDIC_Node_Reference rdic_get_node( + RDIC_Context context[static 1], + RDIC_Node_Reference node_reference, + int *out_flags); // NOTE(Zelaven): NULL-safe. + +void rdic_push_parent( + RDIC_Context context[static 1], + RDIC_Node_Reference parent); + +int rdic_pop_parent( + RDIC_Context context[static 1]); + + + +#ifndef NULL +#warning "NULL not defined. Please define NULL or include stddef." +#define NULL ((void*)0) +#endif + + +#ifdef RDIC_IMPLEMENTATION + +// TODO(Zelaven): Offer a macro that enables runtime NULL-guards. + +// --- + + +/* *** Information for those reading this source *** + * Procedure parameters such as `RDIC_Context context[static 1]` may look + * strange, but they aren't as evil as they look. Arrays degrade to pointers, + * and the static keyword simply requires that the array has a minimum size. In + * this case we use this to pass a pointer that may not be NULL. Note that this + * is just a compile time check and guard clauses for runtime NULL can still + * make plenty of sense. +*/ + + + +void rdic_cull_subtrees( + RDIC_Context context[static 1], + RDIC_Node *subtree) +{ + assert(context != NULL); + // NOTE(Zelaven): + // This code collects an entire subtree. + // It requires that the initial node has a NULL sibling to limit its + // operation to only the subtree. + // The way it operates is that it uses the parent pointers to maintain a + // stack of "collect later" whenever a node in the tree has a sibling. + // When a subtree is finished it "pops" an element from the stack and + // continues collection from there. + + RDIC_Node *current = subtree; + // NOTE(Zelaven): Top of our "stack" of "collect later". + RDIC_Node *stashed = NULL; + while(current != NULL) + { + RDIC_Node *next = NULL; + if(current->first_child != NULL) + { + if(current->sibling != NULL) + { + // Has both a child and a sibling - we need to save one for later. + // We "push" the sibling onto our "stack". + current->sibling->parent = stashed; + stashed = current->sibling; + } + // We always take the child as the next node. + next = current->first_child; + } + else if(current->sibling != NULL) + { + // No child but we have a sibling, then we just continue with the sibling. + next = current->sibling; + } + else + { + // A node with no child and no sibling. Time to "pop" from out "stack". + next = stashed; + if(stashed != NULL) + { + stashed = stashed->parent; + } + } + + current->sibling = context->node_freelist; + current->generation += 1; // Invalidate references. + context->node_freelist = current; + + current = next; + } +} + + +// --- + + +RDIC_Node_Reference rdic_context_start_frame( + RDIC_Context context[static 1], + RDIC_Node_Reference last_root) +{ + RDIC_Node_Reference node_reference = last_root; + int need_new_node = (last_root.node == NULL) + || (last_root.generation != last_root.node->generation); + if(need_new_node && context->node_freelist == NULL) + { + return (RDIC_Node_Reference){0}; + } + if(need_new_node) + { + RDIC_Node_Reference result; + result.node = context->node_freelist; + result.generation = result.node->generation; + + context->node_freelist = context->node_freelist->sibling; + + RDIC_Node *root = result.node; + root->sibling = NULL; + root->parent = root; + + node_reference = result; + } + + context->frame_current_node = node_reference.node; + context->root = node_reference.node; + context->current_parent = context->root; + + return node_reference; +} + +// TODO(Zelaven): This is almost 1-1 with pop_parent, so consider compression. +// TODO(Zelaven): pop parents until it gets to a node that is a child of the +// root. This is so that all the stragglers of partial parents can be collected. +int rdic_context_finish_frame( + RDIC_Context context[static 1]) +{ + assert(context->current_parent == context->root); + + RDIC_Node *last_root_child = NULL; + RDIC_Node *first_straggler = NULL; + if(context->frame_current_node == context->root) + { + last_root_child = context->root->first_child; + first_straggler = last_root_child; + } + else + { + last_root_child = context->frame_current_node; + first_straggler = last_root_child->sibling; + last_root_child->sibling = NULL; + } + + int nodes_collected = 0; + if(last_root_child == NULL) + { + return 0; + } + + assert(last_root_child->parent == context->root); + if(first_straggler != NULL) + { + rdic_cull_subtrees(context, first_straggler); + RDIC_Node *root = context->root; + if(first_straggler == root->first_child) + { + root->first_child = NULL; + } + nodes_collected = RDIC_GET_NODE__NODES_COLLECTED; + } + + return nodes_collected; +} + + +// --- + +RDIC_Node_Reference rdic_get_node( + RDIC_Context context[static 1], + RDIC_Node_Reference node_reference, + int *out_flags) // NOTE(Zelaven): NULL-safe. +{ + //assert(context->current_parent != NULL); + if(context->current_parent == NULL) + { + return (RDIC_Node_Reference){0}; + } + + int reference_is_valid = + (node_reference.node != NULL) + && (node_reference.generation == node_reference.node->generation); + int first_node_of_parent = + (context->current_parent == context->frame_current_node); + + // NOTE(Zelaven): If the node is being moved to another parent, then we want + // to invalidate it to ensure consistent behavior. + reference_is_valid = + reference_is_valid + && (context->current_parent == node_reference.node->parent); + + if(!reference_is_valid && context->node_freelist == NULL) + { + if(out_flags != NULL) + { + *out_flags = RDIC_GET_NODE__OUT_OF_FREELIST; + } + return (RDIC_Node_Reference){0}; + } + + + if(reference_is_valid) + { + RDIC_Node *subroot_to_cull = NULL; + if(first_node_of_parent) + { + // NOTE(Zelaven): Here I need to collect any preceding stale nodes. + subroot_to_cull = context->current_parent->first_child; + context->frame_current_node = node_reference.node; + context->current_parent->first_child = node_reference.node; + } + else + { + // NOTE(Zelaven): Skip (and collect) nodes between last and new nodes. + subroot_to_cull = context->frame_current_node->sibling; + context->frame_current_node->sibling = node_reference.node; + context->frame_current_node = node_reference.node; + } + + if(subroot_to_cull != node_reference.node) + { + if(out_flags != NULL) + { + *out_flags = RDIC_GET_NODE__NODES_COLLECTED; + } + } + while(subroot_to_cull != node_reference.node) + { + // NOTE(Zelaven): Here we want to cull a subtree at a time because we are + // only skipping a certain quantity subtrees. + // TODO(Zelaven): Would it be preferable to "detach" the last node to cull + // and just to a single call to rdic_cull_subtrees? + // It really depends on what is faster, so that is profiling territory. + RDIC_Node *current = subroot_to_cull; + subroot_to_cull = subroot_to_cull->sibling; + current->sibling = NULL; + + rdic_cull_subtrees(context, current); + + } + } + else if(!reference_is_valid) + { + RDIC_Node_Reference new_reference = {0}; + { // Make new node + // NOTE(Zelaven): We guard against empty freelist, so this is safe. + RDIC_Node_Reference result = {0}; + result.node = context->node_freelist; + result.generation = result.node->generation; + context->node_freelist = context->node_freelist->sibling; + + // TODO(Zelaven): Should the various fields be filled out here, or outside? + // What will be the strategy to avoid redundant work? + // Doing it here certainly could avoid redundant work, assuming that all + // the styling and other fields will stay stable across frames. + // That will likely be the common case, but it may be necessary to expose + // reference_is_valid to the caller, so that the caller can decide if it + // should be used to avoid redundancy of work, whatever that means for + // the given node. + // I suppose that the caller can already determine that by comparing the + // last_reference with the new_reference, and if they are different then + // all work must be done. + + new_reference = result; + } + + RDIC_Node *new_node = new_reference.node; + if(first_node_of_parent) + { + RDIC_Node *parent = context->current_parent; + RDIC_Node *former_first_child = parent->first_child; + parent->first_child = new_node; + new_node->sibling = former_first_child; + new_node->parent = parent; + } + else + { + RDIC_Node *current = context->frame_current_node; + RDIC_Node *old_sibling = current->sibling; + current->sibling = new_node; + new_node->sibling = old_sibling; + new_node->parent = context->current_parent; + } + new_node->first_child = NULL; + + context->frame_current_node = new_node; + node_reference = new_reference; + if(out_flags != NULL) + { + *out_flags = RDIC_GET_NODE__NODE_ALLOCATED; + } + } + + return node_reference; +} + + +// --- + + +void rdic_push_parent( + RDIC_Context context[static 1], + RDIC_Node_Reference parent) +{ + //assert(parent.node != NULL); + if(parent.node == NULL) + { + return; + } + context->current_parent = parent.node; +} + +int rdic_pop_parent( + RDIC_Context context[static 1]) +{ + RDIC_Node *current_parent = context->current_parent; + RDIC_Node *last_child = NULL; + RDIC_Node *first_straggler = NULL; + if(context->frame_current_node == context->current_parent) + { + last_child = current_parent->first_child; + first_straggler = last_child; + } + else + { + last_child = context->frame_current_node; + first_straggler = last_child->sibling; + last_child->sibling = NULL; + } + + int nodes_collected = 0; + if(last_child != NULL) + { + assert(last_child->parent == context->current_parent); + if(first_straggler != NULL) + { + rdic_cull_subtrees(context, first_straggler); + if(first_straggler == current_parent->first_child) + { + current_parent->first_child = NULL; + } + nodes_collected = RDIC_GET_NODE__NODES_COLLECTED; + } + } + + context->frame_current_node = context->current_parent; + context->current_parent = context->current_parent->parent; + assert(context->current_parent != NULL); + return nodes_collected; +} + +#endif /* RDIC_IMPLEMENTATION */ diff --git a/test/build.sh b/test/build.sh new file mode 100644 index 0000000..441c6c0 --- /dev/null +++ b/test/build.sh @@ -0,0 +1 @@ +gcc -std=c99 -ggdb -Wall -Wextra -fsanitize=address,undefined rdic_test.c diff --git a/test/memory_arena.c b/test/memory_arena.c new file mode 100644 index 0000000..c6b96c6 --- /dev/null +++ b/test/memory_arena.c @@ -0,0 +1,51 @@ + + + +typedef struct Memory_Arena +{ + void *memory; + size_t size; + size_t allocation_offset; +} Memory_Arena; + +_Static_assert(sizeof(size_t) == sizeof(void*), + "The Memory_Arena implementation assumes that size_t and pointers are of the same size."); + +void *memory_arena_allocate( + Memory_Arena *arena, + size_t size, + size_t alignment) +{ + #if 0 + printf( + "%s: arena: {.memory=%p, .size=%zu, .allocation_offset=%zu}\n" + "size: %zu, alignment: %zu\n" + , __func__ + , arena->memory, arena->size, arena->allocation_offset + , size, alignment + ); + #endif + size_t allocation_offset = arena->allocation_offset; + allocation_offset = ((allocation_offset + alignment - 1) / alignment) * alignment; + if(allocation_offset + size > arena->size) + { + return NULL; + } + void *allocation = ((char*)arena->memory) + allocation_offset; + arena->allocation_offset = allocation_offset + size; + return allocation; +} + +void memory_arena_reset( + Memory_Arena *arena) +{ + arena->allocation_offset = 0; +} + + + + + + + + diff --git a/test/memory_arena_linux.c b/test/memory_arena_linux.c new file mode 100644 index 0000000..e02a91b --- /dev/null +++ b/test/memory_arena_linux.c @@ -0,0 +1,27 @@ + +#include +#include + + +// NOTE(Patrick): The memory here is by default allocated uncommitted. +// This means that we don't lock down 1GB of memory up front, but get +// allocated pages by the kernel as needed. +int linux_allocate_arena_memory( + Memory_Arena *arena, + size_t arena_size) +{ + void *arena_memory = mmap( + NULL, arena_size, + PROT_READ|PROT_WRITE|PROT_EXEC, MAP_SHARED|MAP_ANONYMOUS, -1, 0); + if(arena_memory == (void*)-1) { + //perror("mmap"); + return errno; + } + arena->memory = arena_memory; + arena->size = arena_size; + return 0; +} + + + + diff --git a/test/rdic_test.c b/test/rdic_test.c new file mode 100644 index 0000000..663ebf4 --- /dev/null +++ b/test/rdic_test.c @@ -0,0 +1,1162 @@ + + +// *** TODO *** +// Consider "Arrange, Act, Assert" structure. +// - So far this looks pretty nice. Encourages a structure I like. +// - I will probably define some macros to generate the boilerplate code that +// will be repeated over and over. +// +// Handle segfaults as ordinary test failures. +// - See https://stackoverflow.com/questions/10202941/segmentation-fault-handling +// - Would be a great way to allow more tests to run after a test has crashed. + + + + +#include +#include + +#define RDIC_IMPLEMENTATION +#include "../rdic.h" + +typedef struct GUI_Node { + // NOTE(Zelaven): This codebase assumes rn is the first member for subtyping. + RDIC_Node rn; + char *debug_name; +} GUI_Node; + + + +// --- ARRANGE HELPERS --- + +#define ARRAYLENGTH(X) (sizeof(X)/sizeof((X)[0])) + +void init_node_freelist(GUI_Node *nodes, int node_count) +{ + // NOTE(Zelaven): We special-case the last node. + for(int i = 0; i < node_count -1; i++) + { + nodes[i].rn = (RDIC_Node){ + .sibling = &((nodes+i+1)->rn), + }; + nodes[i].debug_name = NULL; + } + nodes[node_count-1].rn = (RDIC_Node){0}; +} + +#define ARRANGE_DEFAULT_CONFIGURATION(FREELIST_LENGTH)\ + RDIC_Context context = {0};\ + GUI_Node freelist_nodes[FREELIST_LENGTH] = {0};\ + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes));\ + context.node_freelist = &freelist_nodes[0].rn;\ + RDIC_Node_Reference root = {0}; + + +RDIC_Node_Reference test_get_node( + RDIC_Context *context, + RDIC_Node_Reference reference, + char *name) +{ + RDIC_Node_Reference new_ref = rdic_get_node(context, reference, NULL); + if(new_ref.node != NULL) + { + ((GUI_Node*)new_ref.node)->debug_name = name; + } + return new_ref; +} +#define GET_NODE(context, ref) test_get_node(context, ref, #ref); + +#define SET_DEBUG_NAME(REF, NAME) ((GUI_Node*)(REF).node)->debug_name = (NAME) + + + +// --- ASSERT HELPERS --- +// NOTE(Zelaven): Helpers can be buggy too and could in principle have tests. +int freelist_contains(RDIC_Context *context, RDIC_Node *node) +{ + RDIC_Node *current = context->node_freelist; + int result = 0; + while(!result && current != NULL) + { + if(current == node) {result = 1;} + current = current->sibling; + } + return result; +} + +#define ASSERT_REFERENCE_VALID(REF)\ + if((REF).node == NULL)\ + {TEST_ERROR("`" #REF "` is invalid: node is NULL.");}\ + else if((REF).generation != (REF).node->generation)\ + {TEST_ERROR("`" #REF "` is invalid: generation differs.");} +// TODO(Zelaven): create TEST_ERROR_FMT and use it here. +//{TEST_ERROR("`" #REF "` is invalid: generation differs (" #REF ": %d, node: %d).");} +#define ASSERT_REFERENCE_INVALID(REF, TEXT...)\ + if(((REF).node != NULL) && ((REF).generation == (REF).node->generation))\ + {TEST_ERROR("`" #REF "` is valid when it should be invalid. "TEXT);} + +#define ASSERT_PARENT_OF(PARENT, CHILD)\ + if((CHILD).node->parent != (PARENT).node)\ + {TEST_ERROR("parent of `" #CHILD "` is not `" #PARENT "`.");} +#define ASSERT_SIBLING_OF(SIBLING, NODE)\ + if((NODE).node->sibling != (SIBLING).node)\ + {TEST_ERROR("sibling of `" #NODE "` is not `" #SIBLING "`.");} +#define ASSERT_NO_SIBLING(NODE)\ + if((NODE).node->sibling != NULL)\ + {TEST_ERROR("`" #NODE "` has a sibling when it should not.");} +#define ASSERT_FRISTCHILD_OF(FIRSTCHILD, PARENT)\ + if((PARENT).node->first_child != (FIRSTCHILD).node)\ + {TEST_ERROR("first_child of `" #PARENT "` is not `" #FIRSTCHILD "`.");} + +#define ASSERT_IN_FREELIST(CONTEXT, NODE)\ + if(!freelist_contains(CONTEXT, NODE.node))\ + {TEST_ERROR("`"#NODE"` not in freelist.");} + + + +// --- TEST INFRASTRUCTURE --- + +// TODO(Zelaven): Should probably make a separate arena for strings generated by running the tests. +#include "memory_arena.c" +#include "memory_arena_linux.c" + +typedef struct Report_Test_Result +{ + enum { + TESTRESULT_UNDEFINED = 0, + TESTRESULT_SUCCESS, + TESTRESULT_ERROR, + TESTRESULT_NUM_LEVELS, + } level; + const char *test_name; + char *string; +} Report_Test_Result; +typedef struct Report_Group Report_Group; +struct Report_Group { + char *name; + Report_Group *next; + unsigned int num_test_results; + Report_Test_Result results[]; +}; + +Memory_Arena g_test_report_arena; +unsigned int _g_test_report_num_test_results = 0; +Report_Group *g_first_report_group = NULL; +Report_Group *g_current_report_group = NULL; +int g_error_occurred = 0; + +#define arena_allocate_TYPE(arena, TYPE) ((TYPE*)memory_arena_allocate(arena, sizeof(TYPE), _Alignof(TYPE))) +#define arena_allocate_report_group(arena) arena_allocate_TYPE(arena, Report_Group) +#define arena_allocate_report_test_result(arena) arena_allocate_TYPE(arena, Report_Test_Result) + +static inline void log_new_report_group(char *name) +{ + Report_Group *new_group = arena_allocate_report_group(&g_test_report_arena); + if(g_current_report_group == NULL) + { + g_first_report_group = new_group; + } + else + { + g_current_report_group->next = new_group; + } + g_current_report_group = new_group; + + *new_group = (Report_Group){ + .name = name, + }; +} + +static inline void log_result_to_report( + Report_Test_Result result) +{ + // This is allocated in extension of the results[] member of a Report_Group. + *arena_allocate_report_test_result(&g_test_report_arena) = result; + //g_test_report_num_test_results += 1; + g_current_report_group->num_test_results += 1; +} + +char *g_test_name; + +#define TEST_ERROR(STRING) \ + g_error_occurred = 1;\ + log_result_to_report((Report_Test_Result){\ + .level = TESTRESULT_ERROR,\ + .test_name = g_test_name,\ + .string = STRING,\ + }) + + +// --- TESTS --- + + +void test__start_frame__empty_freelist(void) +{ + // Arrange. + RDIC_Context context = {0}; + RDIC_Node_Reference root = {0}; + + // Act. + root = rdic_context_start_frame( + &context, + root); + + // Assert. + ASSERT_REFERENCE_INVALID(root, "(Empty freelist)"); +} + +void test__start_frame__succeed(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[1] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + + // Act. + root = rdic_context_start_frame( + &context, + root); + + // Assert. + ASSERT_REFERENCE_VALID(root); +} + +void test__finish_frame__succeed(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[1] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + root = rdic_context_start_frame( + &context, + root); + + // Act. + rdic_context_finish_frame(&context); + + // Assert. + // No asserts. If it doesn't crash then we're good for now. + // In the future we will want to assert on the structure of the node tree. +} + + +// --- + + +void test__get_node_with_empty_freelist__return_null_reference(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[1] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + root = rdic_context_start_frame( + &context, + root); + + assert(context.node_freelist == NULL); + + // Act. + RDIC_Node_Reference node = {0}; // Invalid reference -> new node. + node = GET_NODE(&context, node); + + // Assert. + // NOTE(Zelaven): We specifically assert that the reference is all 0. + if(node.node != NULL) + {TEST_ERROR("Non-NULL node despite empty freelist.");} + if(node.generation != 0) + {TEST_ERROR("Non-0 generation despite empty freelist.");} +} + +void test__get_node_with_empty_freelist_with_nonzero_generation__return_null_reference(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[1] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + root = rdic_context_start_frame( + &context, + root); + + // Act. + RDIC_Node_Reference node = {0}; // Invalid reference -> new node. + node.generation = 42; // Should become 0. + node = GET_NODE(&context, node); + + // Assert. + // NOTE(Zelaven): We specifically assert that the reference is all 0. + if(node.node != NULL) + {TEST_ERROR("Non-NULL node despite empty freelist.");} + if(node.generation != 0) + {TEST_ERROR("Non-0 generation despite empty freelist.");} +} + +void test__get_node__succeed(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[2] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + root = rdic_context_start_frame( + &context, + root); + + // Act. + RDIC_Node_Reference node = {0}; // Invalid reference -> new node. + node = GET_NODE(&context, node); + + // Assert. + ASSERT_REFERENCE_VALID(node); + // NOTE(Zelaven): We want to assert this to make sure we are counting from 0. + // If not then we may be incrementing on the allocation of the node, which is + // incorrect. We increment (invalidate) the generation on de-allocation. + if(node.generation != 0) + {TEST_ERROR("Non-0 generation for first allocation of node from freelist.");} +} + +void test__get_node_finish_frame__succeed(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[2] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + root = rdic_context_start_frame( + &context, + root); + + // Act. + RDIC_Node_Reference node = {0}; // Invalid reference -> new node. + node = GET_NODE(&context, node); + + rdic_context_finish_frame(&context); + + // Assert. +} + +void test__single_node__returned_to_freelist(void) +{ + // Arrange. + ARRANGE_DEFAULT_CONFIGURATION(2); + RDIC_Node_Reference node = {0}; + + // Act. + // First frame. + root = rdic_context_start_frame( + &context, + root); + // Invalid reference -> new node. + node = GET_NODE(&context, node); + rdic_context_finish_frame(&context); + // Second frame. + // node should return to freelist. + root = rdic_context_start_frame( + &context, + root); + // No call to get_node for node. + rdic_context_finish_frame(&context); + + // Assert. + // Firstly, we know that the release of the node should increment its + // generation. + // We also know that the pointer points to a node that has just been submitted + // to the freelist. + // In fact, we know that it has been released precisely 1 time, so its + // generation should be 1 and the reference should still have a generation of + // 0 as we seek to invalidate it, so they should mismatch. + if(node.generation != 0) + {TEST_ERROR("Node _reference_ generation changed?");} + if(node.node->generation == 0) + {TEST_ERROR("Node submitted to freelist stayed generation 0.");} + if(node.node->generation != 1) + {TEST_ERROR("Node submitted to freelist increased generation more than once?");} + ASSERT_REFERENCE_INVALID(node, "(Skipped in second frame)"); + if(context.node_freelist != node.node) + {TEST_ERROR("Node not prepended to freelist.");} + + + if(root.node->first_child != NULL) + {TEST_ERROR("Last frame is empty, yet root has a first_child.");} +} + +#define ASSERT_REFERENCES_EQUAL(REF1, REF2)\ + if(!gui_node_references_equal((REF1), (REF2)))\ + {TEST_ERROR("`"#REF1"` != `"#REF2"`.\n");} +void test__single_node__nodes_are_stable(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[2] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + RDIC_Node_Reference node = {0}; + + RDIC_Node_Reference new_root = {0}; + RDIC_Node_Reference new_node = {0}; + + // Act. + // First frame. + root = rdic_context_start_frame(&context, root); + node = GET_NODE(&context, node); + rdic_context_finish_frame(&context); + // Second frame. + new_root = rdic_context_start_frame(&context, root); + new_node = GET_NODE(&context, node); + rdic_context_finish_frame(&context); + + // Assert. + ASSERT_REFERENCES_EQUAL(root, new_root); + ASSERT_REFERENCES_EQUAL(node, new_node); +} + +void test__single_node_freelist_reuse__succeed(void) +{ + // Arrange. + ARRANGE_DEFAULT_CONFIGURATION(2); + RDIC_Node_Reference node = {0}; + + // Act. + // --- FRAME --- + root = rdic_context_start_frame( + &context, + root); + // Invalid reference -> new node. + node = GET_NODE(&context, node); + rdic_context_finish_frame(&context); + // --- FRAME --- + // node should return to freelist. + root = rdic_context_start_frame( + &context, + root); + // No call to get_node for node. + rdic_context_finish_frame(&context); + // --- FRAME --- + root = rdic_context_start_frame( + &context, + root); + // Invalid reference -> new node. + node = GET_NODE(&context, node); + rdic_context_finish_frame(&context); + + // Assert. + // Firstly, we know that the release of the node should increment its + // generation. Therefore, when we get the node again, its generation should + // be exactly 1. + if(node.generation != 1) + {TEST_ERROR("`node` generation is not 1.");} + ASSERT_REFERENCE_VALID(node); + if(context.node_freelist != NULL) + {TEST_ERROR("Freelist should be empty.");} +} + + +// --- + + +void test__parent_child_frame__succeed(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[3] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + RDIC_Node_Reference parent_node = {0}; + RDIC_Node_Reference child_node = {0}; + + // Act. + // First frame. + root = rdic_context_start_frame( + &context, + root); + // Invalid reference -> new node. + parent_node = GET_NODE(&context, parent_node); + rdic_push_parent(&context, parent_node); + child_node = GET_NODE(&context, child_node); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + + // Assert. + ASSERT_PARENT_OF(root, parent_node); + ASSERT_PARENT_OF(parent_node, child_node); + ASSERT_FRISTCHILD_OF(child_node, parent_node); +} + +void test__parent_child_free_child__child_to_freelist(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[3] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + RDIC_Node_Reference parent_node = {0}; + RDIC_Node_Reference child_node = {0}; + + // Act. + // First frame. + root = rdic_context_start_frame( + &context, + root); + // Invalid reference -> new node. + parent_node = GET_NODE(&context, parent_node); + rdic_push_parent(&context, parent_node); + child_node = GET_NODE(&context, child_node); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + // Second frame. + root = rdic_context_start_frame( + &context, + root); + parent_node = GET_NODE(&context, parent_node); + rdic_push_parent(&context, parent_node); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + + // Assert. + if(child_node.generation != 0) + {TEST_ERROR("Node _reference_ generation changed?");} + if(child_node.node->generation != 1) + {TEST_ERROR("Node submitted to freelist retained same generation?");} + ASSERT_REFERENCE_INVALID(child_node, "(Skipped in second frame)"); + if(context.node_freelist != child_node.node) + {TEST_ERROR("Node not prepended to freelist.");} +} + +void test__parent_child_free_child__parent_to_freelist(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[3] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + RDIC_Node_Reference parent = {0}; + RDIC_Node_Reference child = {0}; + + // Act. + // First frame. + root = rdic_context_start_frame( + &context, + root); + // Invalid reference -> new node. + parent = GET_NODE(&context, parent); + rdic_push_parent(&context, parent); + child = GET_NODE(&context, child); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + // Second frame. + root = rdic_context_start_frame( + &context, + root); + rdic_context_finish_frame(&context); + + // Assert. + if(child.generation != 0) + {TEST_ERROR("`child` _reference_ generation changed?");} + if(child.node->generation != 1) + {TEST_ERROR("`child` submitted to freelist retained same generation?");} + ASSERT_REFERENCE_INVALID(child, "(Skipped in second frame)"); + ASSERT_IN_FREELIST(&context, child); + + if(parent.generation != 0) + {TEST_ERROR("`parent` _reference_ generation changed?");} + if(parent.node->generation != 1) + {TEST_ERROR("`parent` submitted to freelist retained same generation?");} + ASSERT_REFERENCE_INVALID(parent, "(Skipped in second frame)"); + ASSERT_IN_FREELIST(&context, parent); +} + +void test__parent_child_both_reused__succeed(void) +{ + // Arrange. + ARRANGE_DEFAULT_CONFIGURATION(3); + RDIC_Node_Reference parent = {0}; + RDIC_Node_Reference child = {0}; + + // NOTE(Zelaven): Multiple re-uses because it uncovers new bugs. + // Act. + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + parent = GET_NODE(&context, parent); + rdic_push_parent(&context, parent); + child = GET_NODE(&context, child); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + parent = GET_NODE(&context, parent); + rdic_push_parent(&context, parent); + child = GET_NODE(&context, child); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + parent = GET_NODE(&context, parent); + rdic_push_parent(&context, parent); + child = GET_NODE(&context, child); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + parent = GET_NODE(&context, parent); + rdic_push_parent(&context, parent); + child = GET_NODE(&context, child); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + + // Assert. + ASSERT_REFERENCE_VALID(parent); + ASSERT_REFERENCE_VALID(child); +} + + + +// --- + +#define PREAMBLE__parent_3children\ + RDIC_Context context = {0};\ + GUI_Node freelist_nodes[5] = {0};\ + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes));\ + context.node_freelist = &freelist_nodes[0].rn;\ + RDIC_Node_Reference root = {0};\ + RDIC_Node_Reference parent = {0};\ + RDIC_Node_Reference child1 = {0};\ + RDIC_Node_Reference child2 = {0};\ + RDIC_Node_Reference child3 = {0}; + +#define ACT__parent_3children_full_frame\ + root = rdic_context_start_frame(&context, root);\ + SET_DEBUG_NAME(root, "root");\ + parent = GET_NODE(&context, parent);\ + rdic_push_parent(&context, parent);\ + child1 = GET_NODE(&context, child1);\ + child2 = GET_NODE(&context, child2);\ + child3 = GET_NODE(&context, child3);\ + rdic_pop_parent(&context);\ + rdic_context_finish_frame(&context); + +#define ASSERT__parent_3children__123_frame_structure\ + ASSERT_PARENT_OF(root, parent);\ + ASSERT_FRISTCHILD_OF(child1, parent);\ + ASSERT_PARENT_OF(parent, child1);\ + ASSERT_PARENT_OF(parent, child2);\ + ASSERT_PARENT_OF(parent, child3);\ + ASSERT_SIBLING_OF(child2, child1);\ + ASSERT_SIBLING_OF(child3, child2);\ + ASSERT_NO_SIBLING(child3); + +void test__parent_3children_123frame__succeed(void) { + // Arrange. + PREAMBLE__parent_3children + + // Act. + // --- FRAME --- + ACT__parent_3children_full_frame + + // Assert. + ASSERT__parent_3children__123_frame_structure +} + +void test__parent_3children_partial_frame_then_complete__succeed( + int enable_child1, int enable_child2, int enable_child3) +{ + PREAMBLE__parent_3children; + + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + parent = GET_NODE(&context, parent); + rdic_push_parent(&context, parent); + if(enable_child1) child1 = GET_NODE(&context, child1); + if(enable_child2) child2 = GET_NODE(&context, child2); + if(enable_child3) child3 = GET_NODE(&context, child3); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + //ASSERT_REFERENCE_VALID(child1); + //ASSERT_REFERENCE_VALID(child2); + //ASSERT_REFERENCE_VALID(child3); + // --- FRAME --- + ACT__parent_3children_full_frame + + // Assert. + ASSERT__parent_3children__123_frame_structure +} + + +void test__parent_3children_culling__succeed( + int enable_child1, int enable_child2, int enable_child3) +{ + PREAMBLE__parent_3children; + + // --- FRAME --- + ACT__parent_3children_full_frame + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + parent = GET_NODE(&context, parent); + rdic_push_parent(&context, parent); + if(enable_child1) { + child1 = GET_NODE(&context, child1);} + if(enable_child2) { + child2 = GET_NODE(&context, child2);} + if(enable_child3) { + child3 = GET_NODE(&context, child3);} + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + + // Assert. + // NOTE(Zelaven): Yes, the assertions look messy, but it's just as easy to + // make 9 cases of copy-paste messy. + // Deciphering the exact conditions may take a few seconds, but this was the + // simplest solution I could come up with that met my quality standards for + // this test code. + if(enable_child1) {ASSERT_REFERENCE_VALID(child1);} + else {ASSERT_REFERENCE_INVALID(child1);} + if(enable_child2) {ASSERT_REFERENCE_VALID(child2);} + else {ASSERT_REFERENCE_INVALID(child2);} + if(enable_child3) {ASSERT_REFERENCE_VALID(child3);} + else {ASSERT_REFERENCE_INVALID(child3);} + + ASSERT_PARENT_OF(root, parent); + if(enable_child1) {ASSERT_FRISTCHILD_OF(child1, parent);} + else if(enable_child2) {ASSERT_FRISTCHILD_OF(child2, parent);} + else if (enable_child3) {ASSERT_FRISTCHILD_OF(child3, parent);} + + if(enable_child1) {ASSERT_PARENT_OF(parent, child1);} + if(enable_child2) {ASSERT_PARENT_OF(parent, child2);} + if(enable_child3) {ASSERT_PARENT_OF(parent, child3);} + if(enable_child1 && enable_child2) {ASSERT_SIBLING_OF(child2, child1);} + else if(enable_child1 && enable_child3) {ASSERT_SIBLING_OF(child3, child1);} + if(enable_child2 && enable_child3) {ASSERT_SIBLING_OF(child3, child2);} + + if(enable_child3) {ASSERT_NO_SIBLING(child3);} + else if(enable_child2) {ASSERT_NO_SIBLING(child2);} + else if(enable_child1) {ASSERT_NO_SIBLING(child2);} + + if(!enable_child1) {ASSERT_IN_FREELIST(&context, child1);} + if(!enable_child2) {ASSERT_IN_FREELIST(&context, child2);} + if(!enable_child3) {ASSERT_IN_FREELIST(&context, child3);} +} + + +void test__parent_3children_full_frame_reuse__succeed(void) { + // Arrange. + PREAMBLE__parent_3children + + // Act. + // --- FRAME --- + ACT__parent_3children_full_frame + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + ACT__parent_3children_full_frame + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + ACT__parent_3children_full_frame + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + ACT__parent_3children_full_frame + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + ACT__parent_3children_full_frame + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + ACT__parent_3children_full_frame + // --- FRAME --- + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + // --- FRAME --- + ACT__parent_3children_full_frame + + + // Assert. + ASSERT__parent_3children__123_frame_structure +} + + +// --- + +void test__exhaust_freelist_larger_tree__no_crash(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[3] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + RDIC_Node_Reference n1 = {0}; + RDIC_Node_Reference n1_1 = {0}; + RDIC_Node_Reference n1_1_1 = {0}; + RDIC_Node_Reference n1_1_2 = {0}; + RDIC_Node_Reference n1_2 = {0}; + RDIC_Node_Reference n1_2_1 = {0}; + RDIC_Node_Reference n1_2_2 = {0}; + RDIC_Node_Reference n2 = {0}; + RDIC_Node_Reference n2_1 = {0}; + RDIC_Node_Reference n2_2 = {0}; + RDIC_Node_Reference n3 = {0}; + RDIC_Node_Reference n3_1 = {0}; + RDIC_Node_Reference n3_2 = {0}; + + // Act. + /* + * r + * n n n + * n n nn nn + * nn nn + */ + // First frame. + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + n1 = GET_NODE(&context, n1); + rdic_push_parent(&context, n1); + n1_1 = GET_NODE(&context, n1_1); + rdic_push_parent(&context, n1_1); + n1_1_1 = GET_NODE(&context, n1_1_1); + n1_1_2 = GET_NODE(&context, n1_1_2); + rdic_pop_parent(&context); + n1_2 = GET_NODE(&context, n1_2); + rdic_push_parent(&context, n1_2); + n1_2_1 = GET_NODE(&context, n1_2_1); + n1_2_2 = GET_NODE(&context, n1_2_2); + rdic_pop_parent(&context); + rdic_pop_parent(&context); + n2 = GET_NODE(&context, n2); + rdic_push_parent(&context, n2); + n2_1 = GET_NODE(&context, n2_1); + n2_2 = GET_NODE(&context, n2_2); + rdic_pop_parent(&context); + n3 = GET_NODE(&context, n3); + rdic_push_parent(&context, n3); + n3_1 = GET_NODE(&context, n3_1); + n3_2 = GET_NODE(&context, n3_2); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + + // Assert. +} + +void test__large_tree_constructed__succeed(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[14] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + RDIC_Node_Reference n1 = {0}; + RDIC_Node_Reference n1_1 = {0}; + RDIC_Node_Reference n1_1_1 = {0}; + RDIC_Node_Reference n1_1_2 = {0}; + RDIC_Node_Reference n1_2 = {0}; + RDIC_Node_Reference n1_2_1 = {0}; + RDIC_Node_Reference n1_2_2 = {0}; + RDIC_Node_Reference n2 = {0}; + RDIC_Node_Reference n2_1 = {0}; + RDIC_Node_Reference n2_2 = {0}; + RDIC_Node_Reference n3 = {0}; + RDIC_Node_Reference n3_1 = {0}; + RDIC_Node_Reference n3_2 = {0}; + + // Act. + /* + * r + * n n n + * n n nn nn + * nn nn + */ + // First frame. + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + n1 = GET_NODE(&context, n1); + rdic_push_parent(&context, n1); + n1_1 = GET_NODE(&context, n1_1); + rdic_push_parent(&context, n1_1); + n1_1_1 = GET_NODE(&context, n1_1_1); + n1_1_2 = GET_NODE(&context, n1_1_2); + rdic_pop_parent(&context); + n1_2 = GET_NODE(&context, n1_2); + rdic_push_parent(&context, n1_2); + n1_2_1 = GET_NODE(&context, n1_2_1); + n1_2_2 = GET_NODE(&context, n1_2_2); + rdic_pop_parent(&context); + rdic_pop_parent(&context); + n2 = GET_NODE(&context, n2); + rdic_push_parent(&context, n2); + n2_1 = GET_NODE(&context, n2_1); + n2_2 = GET_NODE(&context, n2_2); + rdic_pop_parent(&context); + n3 = GET_NODE(&context, n3); + rdic_push_parent(&context, n3); + n3_1 = GET_NODE(&context, n3_1); + n3_2 = GET_NODE(&context, n3_2); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + + // Assert. + ASSERT_REFERENCE_VALID(root); + ASSERT_REFERENCE_VALID(n1); + ASSERT_REFERENCE_VALID(n1_1); + ASSERT_REFERENCE_VALID(n1_1_1); + ASSERT_REFERENCE_VALID(n1_1_2); + ASSERT_REFERENCE_VALID(n1_2); + ASSERT_REFERENCE_VALID(n1_2_1); + ASSERT_REFERENCE_VALID(n1_2_2); + ASSERT_REFERENCE_VALID(n2); + ASSERT_REFERENCE_VALID(n2_1); + ASSERT_REFERENCE_VALID(n2_2); + ASSERT_REFERENCE_VALID(n3); + ASSERT_REFERENCE_VALID(n3_1); + ASSERT_REFERENCE_VALID(n3_2); + // NOTE(Zelaven): More asserts could be added to assert correct structure. +} + +void test__culling_that_needs_to_use_stash__succeed(void) +{ + // Arrange. + RDIC_Context context = {0}; + GUI_Node freelist_nodes[14] = {0}; + init_node_freelist(freelist_nodes, ARRAYLENGTH(freelist_nodes)); + context.node_freelist = &freelist_nodes[0].rn; + RDIC_Node_Reference root = {0}; + RDIC_Node_Reference n1 = {0}; + RDIC_Node_Reference n1_1 = {0}; + RDIC_Node_Reference n1_1_1 = {0}; + RDIC_Node_Reference n1_1_2 = {0}; + RDIC_Node_Reference n1_2 = {0}; + RDIC_Node_Reference n1_2_1 = {0}; + RDIC_Node_Reference n1_2_2 = {0}; + RDIC_Node_Reference n2 = {0}; + RDIC_Node_Reference n2_1 = {0}; + RDIC_Node_Reference n2_2 = {0}; + RDIC_Node_Reference n3 = {0}; + RDIC_Node_Reference n3_1 = {0}; + RDIC_Node_Reference n3_2 = {0}; + + // Act. + /* + * r + * n n n + * n n nn nn + * nn nn + */ + // First frame. + root = rdic_context_start_frame(&context, root); + SET_DEBUG_NAME(root, "root"); + n1 = GET_NODE(&context, n1); + rdic_push_parent(&context, n1); + n1_1 = GET_NODE(&context, n1_1); + rdic_push_parent(&context, n1_1); + n1_1_1 = GET_NODE(&context, n1_1_1); + n1_1_2 = GET_NODE(&context, n1_1_2); + rdic_pop_parent(&context); + n1_2 = GET_NODE(&context, n1_2); + rdic_push_parent(&context, n1_2); + n1_2_1 = GET_NODE(&context, n1_2_1); + n1_2_2 = GET_NODE(&context, n1_2_2); + rdic_pop_parent(&context); + rdic_pop_parent(&context); + n2 = GET_NODE(&context, n2); + rdic_push_parent(&context, n2); + n2_1 = GET_NODE(&context, n2_1); + n2_2 = GET_NODE(&context, n2_2); + rdic_pop_parent(&context); + n3 = GET_NODE(&context, n3); + rdic_push_parent(&context, n3); + n3_1 = GET_NODE(&context, n3_1); + n3_2 = GET_NODE(&context, n3_2); + rdic_pop_parent(&context); + rdic_context_finish_frame(&context); + + root = rdic_context_start_frame(&context, root); + rdic_context_finish_frame(&context); + + // Assert. + // NOTE(Zelaven): The root node is never collected (always re-used). + //ASSERT_REFERENCE_INVALID(root); + //ASSERT_IN_FREELIST(&context, root); + ASSERT_REFERENCE_INVALID(n1); + ASSERT_IN_FREELIST(&context, n1); + ASSERT_REFERENCE_INVALID(n1_1); + ASSERT_IN_FREELIST(&context, n1_1); + ASSERT_REFERENCE_INVALID(n1_1_1); + ASSERT_IN_FREELIST(&context, n1_1_1); + ASSERT_REFERENCE_INVALID(n1_1_2); + ASSERT_IN_FREELIST(&context, n1_1_2); + ASSERT_REFERENCE_INVALID(n1_2); + ASSERT_IN_FREELIST(&context, n1_2); + ASSERT_REFERENCE_INVALID(n1_2_1); + ASSERT_IN_FREELIST(&context, n1_2_1); + ASSERT_REFERENCE_INVALID(n1_2_2); + ASSERT_IN_FREELIST(&context, n1_2_2); + ASSERT_REFERENCE_INVALID(n2); + ASSERT_IN_FREELIST(&context, n2); + ASSERT_REFERENCE_INVALID(n2_1); + ASSERT_IN_FREELIST(&context, n2_1); + ASSERT_REFERENCE_INVALID(n2_2); + ASSERT_IN_FREELIST(&context, n2_2); + ASSERT_REFERENCE_INVALID(n3); + ASSERT_IN_FREELIST(&context, n3); + ASSERT_REFERENCE_INVALID(n3_1); + ASSERT_IN_FREELIST(&context, n3_1); + ASSERT_REFERENCE_INVALID(n3_2); + ASSERT_IN_FREELIST(&context, n3_2); +} + + + + +#include +#if 0 + // You can remove the %d in this format specifier by using stringification. + // I just lazied and didn't bother. +#define MY_ASSERT(X) if(!(X)) printf(__FILE__":%d: %s: `"#X"` failed.\n", __LINE__, __func__); + MY_ASSERT(node.generation != 0); + assert(node.generation != 0); +#endif + + +// --- TEST RUNNER --- + + +#include + +void print_test_result(Report_Test_Result result) +{ + char *color_codes[TESTRESULT_NUM_LEVELS] = { + "\033[30m", + "\033[32m", + "\033[31m", + }; + printf("%s: %s%s\033[0m\n", result.test_name, color_codes[result.level], result.string); +} + +//#define TEST(func_to_test, args...) print_test_result(#func_to_test, func_to_test(args)); + +#define TEST(func_to_test, args...) \ + g_error_occurred = 0;\ + g_test_name = #func_to_test"("#args")";\ + func_to_test(args);\ + if(!g_error_occurred) log_result_to_report((Report_Test_Result){\ + .level = TESTRESULT_SUCCESS,\ + .test_name = g_test_name,\ + .string = "Test Successful.",\ + }); + +int main() +{ + assert(linux_allocate_arena_memory( + &g_test_report_arena, + 1024*4) == 0); + + log_new_report_group("Starting and Finishing Frames."); + // Starting and finishing frames. + TEST(test__start_frame__empty_freelist); + TEST(test__start_frame__succeed); + TEST(test__finish_frame__succeed); + + log_new_report_group("Next node - getting a single node."); + // Next node. + TEST(test__get_node_with_empty_freelist__return_null_reference); + TEST(test__get_node_with_empty_freelist_with_nonzero_generation__return_null_reference); + TEST(test__get_node__succeed); + TEST(test__get_node_finish_frame__succeed); + TEST(test__single_node__returned_to_freelist); + TEST(test__single_node__nodes_are_stable); + TEST(test__single_node_freelist_reuse__succeed); + + log_new_report_group("Root - parent - child."); + TEST(test__parent_child_frame__succeed); + TEST(test__parent_child_free_child__child_to_freelist); + TEST(test__parent_child_free_child__parent_to_freelist); + TEST(test__parent_child_both_reused__succeed); + + log_new_report_group("Root - parent - 3 children."); + TEST(test__parent_3children_123frame__succeed); + + TEST(test__parent_3children_partial_frame_then_complete__succeed, 1,1,1); + TEST(test__parent_3children_partial_frame_then_complete__succeed, 1,1,0); + TEST(test__parent_3children_partial_frame_then_complete__succeed, 1,0,1); + TEST(test__parent_3children_partial_frame_then_complete__succeed, 0,1,1); + TEST(test__parent_3children_partial_frame_then_complete__succeed, 1,0,0); + TEST(test__parent_3children_partial_frame_then_complete__succeed, 0,1,0); + TEST(test__parent_3children_partial_frame_then_complete__succeed, 0,0,1); + TEST(test__parent_3children_partial_frame_then_complete__succeed, 0,0,0); + + TEST(test__parent_3children_culling__succeed, 1,1,0); + TEST(test__parent_3children_culling__succeed, 1,0,1); + TEST(test__parent_3children_culling__succeed, 0,1,1); + TEST(test__parent_3children_culling__succeed, 1,0,0); + TEST(test__parent_3children_culling__succeed, 0,1,0); + TEST(test__parent_3children_culling__succeed, 0,0,1); + TEST(test__parent_3children_culling__succeed, 0,0,0); + + TEST(test__parent_3children_full_frame_reuse__succeed); + + log_new_report_group("Larger tree."); + TEST(test__exhaust_freelist_larger_tree__no_crash); + TEST(test__large_tree_constructed__succeed); + TEST(test__culling_that_needs_to_use_stash__succeed); + + + // TODO(Zelaven): A test that causes the deallocation of a subtree that + // requires the collector to use the stashing mechanism. + + + //printf("\n\n\n"); + //Test_Result *results = g_test_report_arena.memory; + Report_Group *current_group = g_first_report_group; + while(current_group != NULL) + { + printf("\n*** %s ***\n", current_group->name); + Report_Test_Result *results = current_group->results; + for(unsigned int i = 0; i < current_group->num_test_results; i++) + { + print_test_result(results[i]); + } + current_group = current_group->next; + } + + return 0; +} + + + +