harfbuzzjs 0.2.1 → 0.3.1

package/libc/sprintf.c

@@ -1,112 +0,0 @@
-/* sprintf.c */
-
-/*
- * Copyright (c) 1997-2010, 2013-2014 Wind River Systems, Inc.
- *
- * SPDX-License-Identifier: Apache-2.0
- */
-
-#include <stdarg.h>
-#include <stdio.h>
-#define va_list __builtin_va_list
-#define va_start __builtin_va_start
-#define va_end __builtin_va_end
-#define va_arg __builtin_va_arg
-typedef __SIZE_TYPE__ size_t;
-#define stderr 0
-#define _MLIBC_RESTRICT
-
-extern int _prf(int (*func)(), void *dest,
-				const char *format, va_list vargs);
-
-struct emitter {
-	char *ptr;
-	int len;
-};
-
-static int sprintf_out(int c, struct emitter *p)
-{
-	if (p->len > 1) { /* need to reserve a byte for EOS */
-		*(p->ptr) = c;
-		p->ptr += 1;
-		p->len -= 1;
-	}
-	return 0; /* indicate keep going so we get the total count */
-}
-
-int snprintf(char *_MLIBC_RESTRICT s, size_t len,
-	     const char *_MLIBC_RESTRICT format, ...)
-{
-	va_list vargs;
-
-	struct emitter p;
-	int     r;
-	char    dummy;
-
-	if (len == 0) {
-		s = &dummy; /* write final NUL to dummy, can't change *s */
-	}
-
-	p.ptr = s;
-	p.len = (int) len;
-
-	va_start(vargs, format);
-	r = _prf(sprintf_out, (void *) (&p), format, vargs);
-	va_end(vargs);
-
-	*(p.ptr) = 0;
-	return r;
-}
-
-int sprintf(char *_MLIBC_RESTRICT s, const char *_MLIBC_RESTRICT format, ...)
-{
-	va_list vargs;
-
-	struct emitter p;
-	int     r;
-
-	p.ptr = s;
-	p.len = (int) 0x7fffffff; /* allow up to "maxint" characters */
-
-	va_start(vargs, format);
-	r = _prf(sprintf_out, (void *) (&p), format, vargs);
-	va_end(vargs);
-
-	*(p.ptr) = 0;
-	return r;
-}
-
-int vsnprintf(char *_MLIBC_RESTRICT s, size_t len,
-	      const char *_MLIBC_RESTRICT format, va_list vargs)
-{
-	struct emitter p;
-	int     r;
-	char    dummy;
-
-	if (len == 0) {
-		s = &dummy; /* write final NUL to dummy, can't change * *s */
-	}
-
-	p.ptr = s;
-	p.len = (int) len;
-
-	r = _prf(sprintf_out, (void *) (&p), format, vargs);
-
-	*(p.ptr) = 0;
-	return r;
-}
-
-int vsprintf(char *_MLIBC_RESTRICT s, const char *_MLIBC_RESTRICT format,
-	     va_list vargs)
-{
-	struct emitter p;
-	int     r;
-
-	p.ptr = s;
-	p.len = (int) 0x7fffffff; /* allow up to "maxint" characters */
-
-	r = _prf(sprintf_out, (void *) (&p), format, vargs);
-
-	*(p.ptr) = 0;
-	return r;
-}

package/libc/strtol.c

@@ -1,79 +0,0 @@
-#include <limits.h>
-#include <stdlib.h>
-#include "ctype.h"
-
-long strtol(const char *nptr, char **endptr, register int base)
-{
-	register const char *s = nptr;
-	register unsigned long acc;
-	register int c;
-	register unsigned long cutoff;
-	register int neg = 0, any, cutlim;
-
-	/*
-	 * Skip white space and pick up leading +/- sign if any.
-	 * If base is 0, allow 0x for hex and 0 for octal, else
-	 * assume decimal; if base is already 16, allow 0x.
-	 */
-	do {
-		c = *s++;
-	} while (isspace(c));
-	if (c == '-') {
-		neg = 1;
-		c = *s++;
-	} else if (c == '+')
-		c = *s++;
-	if ((base == 0 || base == 16) &&
-	    c == '0' && (*s == 'x' || *s == 'X')) {
-		c = s[1];
-		s += 2;
-		base = 16;
-	}
-	if (base == 0)
-		base = c == '0' ? 8 : 10;
-
-	/*
-	 * Compute the cutoff value between legal numbers and illegal
-	 * numbers.  That is the largest legal value, divided by the
-	 * base.  An input number that is greater than this value, if
-	 * followed by a legal input character, is too big.  One that
-	 * is equal to this value may be valid or not; the limit
-	 * between valid and invalid numbers is then based on the last
-	 * digit.  For instance, if the range for longs is
-	 * [-2147483648..2147483647] and the input base is 10,
-	 * cutoff will be set to 214748364 and cutlim to either
-	 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
-	 * a value > 214748364, or equal but the next digit is > 7 (or 8),
-	 * the number is too big, and we will return a range error.
-	 *
-	 * Set any if any `digits' consumed; make it negative to indicate
-	 * overflow.
-	 */
-	cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX;
-	cutlim = cutoff % (unsigned long)base;
-	cutoff /= (unsigned long)base;
-	for (acc = 0, any = 0;; c = *s++) {
-		if (isdigit(c))
-			c -= '0';
-		else if (isalpha(c))
-			c -= isupper(c) ? 'A' - 10 : 'a' - 10;
-		else
-			break;
-		if (c >= base)
-			break;
-		if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
-			any = -1;
-		else {
-			any = 1;
-			acc *= base;
-			acc += c;
-		}
-	}
-	if (any < 0) {
-		acc = neg ? LONG_MIN : LONG_MAX;
-	} else if (neg)
-		acc = -acc;
-	if (endptr != 0)
-		*endptr = (char *)(any ? s - 1 : nptr);
-	return acc;
-}

package/libc/zephyr-string.c

@@ -1,381 +0,0 @@
-typedef __SIZE_TYPE__ size_t;
-#define NULL ((void*) 0)
-
-// Source: https://github.com/intel/zephyr/blob/master/lib/libc/minimal/source/string/string.c
-// but modified for size optimization
-/* string.c - common string routines */
-/*
- * Copyright (c) 2014 Wind River Systems, Inc.
- *
- * SPDX-License-Identifier: Apache-2.0
- */
-
-/**
- *
- * @brief Copy a string
- *
- * @return pointer to destination buffer <d>
- */
-
-char *strcpy(char * d, const char * s)
-{
-	char *dest = d;
-
-	while (*s != '\0') {
-		*d = *s;
-		d++;
-		s++;
-	}
-
-	*d = '\0';
-
-	return dest;
-}
-/**
- *
- * @brief Copy part of a string
- *
- * @return pointer to destination buffer <d>
- */
-char *strncpy(char *__restrict d, const char *__restrict s, size_t n)
-{
-	char *dest = d;
-
-	while ((n > 0) && *s != '\0') {
-		*d = *s;
-		s++;
-		d++;
-		n--;
-	}
-
-	while (n > 0) {
-		*d = '\0';
-		d++;
-		n--;
-	}
-
-	return dest;
-}
-
-/**
- *
- * @brief String scanning operation
- *
- * @return pointer to 1st instance of found byte, or NULL if not found
- */
-
-char *strchr(const char *s, int c)
-{
-	char tmp = (char) c;
-
-	while ((*s != tmp) && (*s != '\0'))
-		s++;
-
-	return (*s == tmp) ? (char *) s : (char *) NULL;
-}
-
-/**
- *
- * @brief Get string length
- *
- * @return number of bytes in string <s>
- */
-
-size_t strlen(const char *s)
-{
-	size_t n = 0;
-
-	while (*s != '\0') {
-		s++;
-		n++;
-	}
-
-	return n;
-}
-
-/**
- *
- * @brief Compare two strings
- *
- * @return negative # if <s1> < <s2>, 0 if <s1> == <s2>, else positive #
- */
-
-int strcmp(const char *s1, const char *s2)
-{
-	while ((*s1 == *s2) && (*s1 != '\0')) {
-		s1++;
-		s2++;
-	}
-
-	return *s1 - *s2;
-}
-
-/**
- *
- * @brief Compare part of two strings
- *
- * @return negative # if <s1> < <s2>, 0 if <s1> == <s2>, else positive #
- */
-
-int strncmp(const char *s1, const char *s2, size_t n)
-{
-	while ((n > 0) && (*s1 == *s2) && (*s1 != '\0')) {
-		s1++;
-		s2++;
-		n--;
-	}
-
-	return (n == 0) ? 0 : (*s1 - *s2);
-}
-
-char *strncat(char *__restrict dest, const char *__restrict src,
-	      size_t n)
-{
-	char *orig_dest = dest;
-	size_t len = strlen(dest);
-
-	dest += len;
-	while ((n-- > 0) && (*src != '\0')) {
-		*dest++ = *src++;
-	}
-	*dest = '\0';
-
-	return orig_dest;
-}
-
-/**
- *
- * @brief Compare two memory areas
- *
- * @return negative # if <m1> < <m2>, 0 if <m1> == <m2>, else positive #
- */
-int memcmp(const void *m1, const void *m2, size_t n)
-{
-	const char *c1 = (char *)m1;
-	const char *c2 = (char *)m2;
-
-	if (!n)
-		return 0;
-
-	while ((--n > 0) && (*c1 == *c2)) {
-		c1++;
-		c2++;
-	}
-
-	return *c1 - *c2;
-}
-
-/**
- *
- * @brief Copy bytes in memory with overlapping areas
- *
- * @return pointer to destination buffer <d>
- */
-
-void *memmove(void *d, const void *s, size_t n)
-{
-	char *dest = (char *)d;
-	const char *src  = (char *)s;
-
-	if ((size_t) ((char *)d - (char *)s) < n) {
-		/*
-		 * The <src> buffer overlaps with the start of the <dest> buffer.
-		 * Copy backwards to prevent the premature corruption of <src>.
-		 */
-
-		while (n > 0) {
-			n--;
-			dest[n] = src[n];
-		}
-	} else {
-		/* It is safe to perform a forward-copy */
-		while (n > 0) {
-			*dest = *src;
-			dest++;
-			src++;
-			n--;
-		}
-	}
-
-	return d;
-}
-
-/**
- *
- * @brief Copy bytes in memory
- *
- * @return pointer to start of destination buffer
- */
-
-void *memcpy(void *__restrict d, const void *__restrict s, size_t n)
-{
-	/* attempt word-sized copying only if buffers have identical alignment */
-
-	unsigned char *d_byte = (unsigned char *)d;
-	const unsigned char *s_byte = (const unsigned char *)s;
-
-	if ((((unsigned long)d ^ (unsigned long)s_byte) & 0x3) == 0) {
-
-		/* do byte-sized copying until word-aligned or finished */
-
-		while (((unsigned long)d_byte) & 0x3) {
-			if (n == 0) {
-				return d;
-			}
-			*(d_byte++) = *(s_byte++);
-			n--;
-		};
-
-		/* do word-sized copying as long as possible */
-
-		unsigned int *d_word = (unsigned int *)d_byte;
-		const unsigned int *s_word = (const unsigned int *)s_byte;
-
-		while (n >= sizeof(unsigned int)) {
-			*(d_word++) = *(s_word++);
-			n -= sizeof(unsigned int);
-		}
-
-		d_byte = (unsigned char *)d_word;
-		s_byte = (unsigned char *)s_word;
-	}
-
-	/* do byte-sized copying until finished */
-
-	while (n > 0) {
-		*(d_byte++) = *(s_byte++);
-		n--;
-	}
-
-	return d;
-}
-
-/**
- *
- * @brief Set bytes in memory
- *
- * @return pointer to start of buffer
- */
-
-void *memset(void *buf, int c, size_t n)
-{
-	/* do byte-sized initialization until word-aligned or finished */
-
-	unsigned char *d_byte = (unsigned char *)buf;
-	unsigned char c_byte = (unsigned char)c;
-
-	while (((unsigned long)d_byte) & 0x3) {
-		if (n == 0) {
-			return buf;
-		}
-		*(d_byte++) = c_byte;
-		n--;
-	};
-
-	/* do word-sized initialization as long as possible */
-
-	unsigned int *d_word = (unsigned int *)d_byte;
-	unsigned int c_word = (unsigned int)(unsigned char)c;
-
-	c_word |= c_word << 8;
-	c_word |= c_word << 16;
-
-	while (n >= sizeof(unsigned int)) {
-		*(d_word++) = c_word;
-		n -= sizeof(unsigned int);
-	}
-
-	/* do byte-sized initialization until finished */
-
-	d_byte = (unsigned char *)d_word;
-
-	while (n > 0) {
-		*(d_byte++) = c_byte;
-		n--;
-	}
-
-	return buf;
-}
-
-/**
- *
- * @brief Scan byte in memory
- *
- * @return pointer to start of found byte
- */
-
-void *memchr(const void *s, int c, size_t n)
-{
-	if (n != 0) {
-		const unsigned char *p = (const unsigned char *)s;
-
-		do {
-			if (*p++ == c) {
-				return ((void *)(p - 1));
-			}
-
-		} while (--n != 0);
-	}
-
-	return NULL;
-}
-
-// Source: https://github.com/intel/zephyr/blob/master/lib/libc/minimal/source/string/strstr.c
-/*-
- * Copyright (c) 1990, 1993
- *      The Regents of the University of California.  All rights reserved.
- *
- * This code is derived from software contributed to Berkeley by
- * Chris Torek.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgment:
- *      This product includes software developed by the University of
- *      California, Berkeley and its contributors.
- * 4. Neither the name of the University nor the names of its contributors
- *    may be used to endorse or promote products derived from this software
- *    without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- */
-
-/*
- * Find the first occurrence of find in s.
- */
-char *strstr(const char *s, const char *find)
-{
-	char c, sc;
-	size_t len;
-
-	c = *find++;
-	if (c != 0) {
-		len = strlen(find);
-		do {
-			do {
-				sc = *s++;
-				if (sc == 0)
-				return (char *)NULL;
-			} while (sc != c);
-		} while (strncmp(s, find, len) != 0);
-	s--;
-	}
-	return (char *)s;
-}

package/subset/build.sh

@@ -1,48 +0,0 @@
-#!/bin/bash
-
-(cd ..; [ -d harfbuzz/src ] || git clone https://github.com/harfbuzz/harfbuzz)
-(cd ../harfbuzz; git checkout 3.0.0)
-
-clang \
-    -I../libc/include -I. -O3 \
-	-fno-exceptions -fno-rtti -fno-threadsafe-statics -fvisibility-inlines-hidden \
-	--target=wasm32 \
-	-nostdlib -nostdinc \
-	-flto \
-	-DHB_TINY -DHB_USE_INTERNAL_QSORT -DHAVE_CONFIG_OVERRIDE_H \
-	-Wl,--no-entry \
-	-Wl,--strip-all \
-	-Wl,--lto-O3 \
-	-Wl,--gc-sections \
-	-Wl,--export=malloc \
-	-Wl,--export=hb_blob_create \
-	-Wl,--export=hb_face_create \
-	-Wl,--export=hb_set_create \
-	-Wl,--export=hb_set_add \
-	-Wl,--export=hb_set_del \
-	-Wl,--export=hb_set_destroy \
-	-Wl,--export=hb_set_union \
-	-Wl,--export=hb_set_clear \
-	-Wl,--export=hb_set_invert \
-	-Wl,--export=hb_face_reference_blob \
-	-Wl,--export=hb_blob_get_data \
-	-Wl,--export=hb_blob_get_length \
-	-Wl,--export=hb_blob_destroy \
-	-Wl,--export=hb_face_get_empty \
-	-Wl,--export=hb_face_destroy \
-	-Wl,--export=hb_subset_input_create_or_fail \
-	-Wl,--export=hb_subset_input_reference \
-	-Wl,--export=hb_subset_input_destroy \
-	-Wl,--export=hb_subset_input_set_user_data \
-	-Wl,--export=hb_subset_input_get_user_data \
-	-Wl,--export=hb_subset_input_unicode_set \
-	-Wl,--export=hb_subset_input_glyph_set \
-	-Wl,--export=hb_subset_input_set \
-	-Wl,--export=hb_subset_input_get_flags \
-	-Wl,--export=hb_subset_input_set_flags \
-	-Wl,--export=hb_subset_or_fail \
-	-Wl,--export=free \
-	-Wl,--export=__heap_base \
-	../libc/malloc.cc ../libc/zephyr-string.c ../libc/main.c ../harfbuzz/src/harfbuzz.cc \
-	../harfbuzz/src/hb-subset*.cc \
-	-o hb-subset.wasm

package/subset/test.cc

@@ -1,50 +0,0 @@
-// clang test.cc -o test -I ../harfbuzz/src/ -fno-rtti -fno-exceptions -lm && ./test
-#include <stdio.h>
-#include <stdlib.h>
-
-#include <harfbuzz.cc>
-#include <hb-subset.cc>
-#include <hb-subset-cff1.cc>
-#include <hb-subset-cff2.cc>
-#include <hb-subset-cff-common.cc>
-#include <hb-subset-input.cc>
-#include <hb-subset-plan.cc>
-
-int main() {
-    hb_blob_t *blob = hb_blob_create_from_file ("roboto-black.ttf");
-    hb_face_t *face = hb_face_create (blob, 0/*this is ttcIndex*/);
-    hb_blob_destroy (blob); /* face keeps a reference of to it so you can destroy it here */
-
-    /* Add your glyph indices here and subset */
-    hb_set_t *glyphs = hb_set_create ();
-    hb_set_add (glyphs, 'a');
-    hb_set_add (glyphs, 'b');
-    hb_set_add (glyphs, 'c');
-
-    hb_subset_input_t *input = hb_subset_input_create_or_fail ();
-    hb_set_t *input_glyphs = hb_subset_input_unicode_set (input);
-    hb_set_union (input_glyphs, glyphs);
-    hb_set_destroy (glyphs);
-    //hb_subset_input_set_drop_hints (input, true);
-    hb_face_t *subset = hb_subset (face, input);
-
-    /* Clean up */
-    hb_subset_input_destroy (input);
-
-    /* Get result blob */
-    hb_blob_t *result = hb_face_reference_blob (subset);
-    unsigned int length = hb_blob_get_length (result);
-    const char *data = hb_blob_get_data (result, 0);
-
-    /* Write. If you like! */
-    FILE *f = fopen ("roboto-black-subset-c.ttf", "wb");
-    fwrite (data, 1, length, f);
-    fclose (f);
-
-    /* Clean up */
-    hb_blob_destroy (result);
-    hb_face_destroy (subset);
-    hb_face_destroy (face);
-
-    return 0;
-}