democracy 0.0.56

data/quickjs/libunicode.h

@@ -0,0 +1,124 @@
+/*
+ * Unicode utilities
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * 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.
+ */
+#ifndef LIBUNICODE_H
+#define LIBUNICODE_H
+
+#include <inttypes.h>
+
+#define LRE_BOOL  int       /* for documentation purposes */
+
+/* define it to include all the unicode tables (40KB larger) */
+#define CONFIG_ALL_UNICODE
+
+#define LRE_CC_RES_LEN_MAX 3
+
+typedef enum {
+    UNICODE_NFC,
+    UNICODE_NFD,
+    UNICODE_NFKC,
+    UNICODE_NFKD,
+} UnicodeNormalizationEnum;
+
+int lre_case_conv(uint32_t *res, uint32_t c, int conv_type);
+LRE_BOOL lre_is_cased(uint32_t c);
+LRE_BOOL lre_is_case_ignorable(uint32_t c);
+
+/* char ranges */
+
+typedef struct {
+    int len; /* in points, always even */
+    int size;
+    uint32_t *points; /* points sorted by increasing value */
+    void *mem_opaque;
+    void *(*realloc_func)(void *opaque, void *ptr, size_t size);
+} CharRange;
+
+typedef enum {
+    CR_OP_UNION,
+    CR_OP_INTER,
+    CR_OP_XOR,
+} CharRangeOpEnum;
+
+void cr_init(CharRange *cr, void *mem_opaque, void *(*realloc_func)(void *opaque, void *ptr, size_t size));
+void cr_free(CharRange *cr);
+int cr_realloc(CharRange *cr, int size);
+int cr_copy(CharRange *cr, const CharRange *cr1);
+
+static inline int cr_add_point(CharRange *cr, uint32_t v)
+{
+    if (cr->len >= cr->size) {
+        if (cr_realloc(cr, cr->len + 1))
+            return -1;
+    }
+    cr->points[cr->len++] = v;
+    return 0;
+}
+
+static inline int cr_add_interval(CharRange *cr, uint32_t c1, uint32_t c2)
+{
+    if ((cr->len + 2) > cr->size) {
+        if (cr_realloc(cr, cr->len + 2))
+            return -1;
+    }
+    cr->points[cr->len++] = c1;
+    cr->points[cr->len++] = c2;
+    return 0;
+}
+
+int cr_union1(CharRange *cr, const uint32_t *b_pt, int b_len);
+
+static inline int cr_union_interval(CharRange *cr, uint32_t c1, uint32_t c2)
+{
+    uint32_t b_pt[2];
+    b_pt[0] = c1;
+    b_pt[1] = c2 + 1;
+    return cr_union1(cr, b_pt, 2);
+}
+
+int cr_op(CharRange *cr, const uint32_t *a_pt, int a_len,
+          const uint32_t *b_pt, int b_len, int op);
+
+int cr_invert(CharRange *cr);
+
+#ifdef CONFIG_ALL_UNICODE
+
+LRE_BOOL lre_is_id_start(uint32_t c);
+LRE_BOOL lre_is_id_continue(uint32_t c);
+
+int unicode_normalize(uint32_t **pdst, const uint32_t *src, int src_len,
+                      UnicodeNormalizationEnum n_type,
+                      void *opaque, void *(*realloc_func)(void *opaque, void *ptr, size_t size));
+
+/* Unicode character range functions */
+
+int unicode_script(CharRange *cr,
+                   const char *script_name, LRE_BOOL is_ext);
+int unicode_general_category(CharRange *cr, const char *gc_name);
+int unicode_prop(CharRange *cr, const char *prop_name);
+
+#endif /* CONFIG_ALL_UNICODE */
+
+#undef LRE_BOOL
+
+#endif /* LIBUNICODE_H */

data/quickjs/list.h

@@ -0,0 +1,100 @@
+/*
+ * Linux klist like system
+ * 
+ * Copyright (c) 2016-2017 Fabrice Bellard
+ *
+ * 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.
+ */
+#ifndef LIST_H
+#define LIST_H
+
+#ifndef NULL
+#include <stddef.h>
+#endif
+
+struct list_head {
+    struct list_head *prev;
+    struct list_head *next;
+};
+
+#define LIST_HEAD_INIT(el) { &(el), &(el) }
+
+/* return the pointer of type 'type *' containing 'el' as field 'member' */
+#define list_entry(el, type, member) \
+    ((type *)((uint8_t *)(el) - offsetof(type, member)))
+
+static inline void init_list_head(struct list_head *head)
+{
+    head->prev = head;
+    head->next = head;
+}
+
+/* insert 'el' between 'prev' and 'next' */
+static inline void __list_add(struct list_head *el, 
+                              struct list_head *prev, struct list_head *next)
+{
+    prev->next = el;
+    el->prev = prev;
+    el->next = next;
+    next->prev = el;
+}
+
+/* add 'el' at the head of the list 'head' (= after element head) */
+static inline void list_add(struct list_head *el, struct list_head *head)
+{
+    __list_add(el, head, head->next);
+}
+
+/* add 'el' at the end of the list 'head' (= before element head) */
+static inline void list_add_tail(struct list_head *el, struct list_head *head)
+{
+    __list_add(el, head->prev, head);
+}
+
+static inline void list_del(struct list_head *el)
+{
+    struct list_head *prev, *next;
+    prev = el->prev;
+    next = el->next;
+    prev->next = next;
+    next->prev = prev;
+    el->prev = NULL; /* fail safe */
+    el->next = NULL; /* fail safe */
+}
+
+static inline int list_empty(struct list_head *el)
+{
+    return el->next == el;
+}
+
+#define list_for_each(el, head) \
+  for(el = (head)->next; el != (head); el = el->next)
+
+#define list_for_each_safe(el, el1, head)                \
+    for(el = (head)->next, el1 = el->next; el != (head); \
+        el = el1, el1 = el->next)
+
+#define list_for_each_prev(el, head) \
+  for(el = (head)->prev; el != (head); el = el->prev)
+
+#define list_for_each_prev_safe(el, el1, head)           \
+    for(el = (head)->prev, el1 = el->prev; el != (head); \
+        el = el1, el1 = el->prev)
+
+#endif /* LIST_H */

data/quickjs/out.c

@@ -0,0 +1,24 @@
+/* File generated automatically by the QuickJS compiler. */
+
+#include <inttypes.h>
+
+const uint32_t qjsc_a_size = 115;
+
+const uint8_t qjsc_a[115] = {
+ 0x02, 0x04, 0x02, 0x69, 0x0e, 0x63, 0x6f, 0x6e,
+ 0x73, 0x6f, 0x6c, 0x65, 0x06, 0x6c, 0x6f, 0x67,
+ 0x08, 0x61, 0x2e, 0x6a, 0x73, 0x0e, 0x00, 0x06,
+ 0x00, 0xa0, 0x01, 0x00, 0x01, 0x00, 0x03, 0x00,
+ 0x00, 0x41, 0x01, 0xa2, 0x01, 0x00, 0x00, 0x00,
+ 0x3f, 0xe1, 0x00, 0x00, 0x00, 0x00, 0x3e, 0xe1,
+ 0x00, 0x00, 0x00, 0x00, 0x06, 0xc9, 0xb5, 0x39,
+ 0xe1, 0x00, 0x00, 0x00, 0x38, 0xe1, 0x00, 0x00,
+ 0x00, 0xba, 0xa3, 0xea, 0x23, 0x38, 0xe2, 0x00,
+ 0x00, 0x00, 0x42, 0xe3, 0x00, 0x00, 0x00, 0x38,
+ 0xe1, 0x00, 0x00, 0x00, 0x24, 0x01, 0x00, 0xc9,
+ 0x38, 0xe1, 0x00, 0x00, 0x00, 0x8f, 0x11, 0x39,
+ 0xe1, 0x00, 0x00, 0x00, 0x0e, 0xec, 0xd6, 0xc5,
+ 0x28, 0xc8, 0x03, 0x01, 0x06, 0x1f, 0x21, 0x58,
+ 0x00, 0x13, 0x08,
+};
+

data/quickjs/out55.c

@@ -0,0 +1,59 @@
+/* File generated automatically by the QuickJS compiler. */
+
+#include "quickjs-libc.h"
+
+const uint32_t qjsc_a_size = 115;
+
+const uint8_t qjsc_a[115] = {
+ 0x02, 0x04, 0x02, 0x69, 0x0e, 0x63, 0x6f, 0x6e,
+ 0x73, 0x6f, 0x6c, 0x65, 0x06, 0x6c, 0x6f, 0x67,
+ 0x08, 0x61, 0x2e, 0x6a, 0x73, 0x0e, 0x00, 0x06,
+ 0x00, 0xa0, 0x01, 0x00, 0x01, 0x00, 0x03, 0x00,
+ 0x00, 0x41, 0x01, 0xa2, 0x01, 0x00, 0x00, 0x00,
+ 0x3f, 0xe1, 0x00, 0x00, 0x00, 0x00, 0x3e, 0xe1,
+ 0x00, 0x00, 0x00, 0x00, 0x06, 0xc9, 0xb5, 0x39,
+ 0xe1, 0x00, 0x00, 0x00, 0x38, 0xe1, 0x00, 0x00,
+ 0x00, 0xba, 0xa3, 0xea, 0x23, 0x38, 0xe2, 0x00,
+ 0x00, 0x00, 0x42, 0xe3, 0x00, 0x00, 0x00, 0x38,
+ 0xe1, 0x00, 0x00, 0x00, 0x24, 0x01, 0x00, 0xc9,
+ 0x38, 0xe1, 0x00, 0x00, 0x00, 0x8f, 0x11, 0x39,
+ 0xe1, 0x00, 0x00, 0x00, 0x0e, 0xec, 0xd6, 0xc5,
+ 0x28, 0xc8, 0x03, 0x01, 0x06, 0x1f, 0x21, 0x58,
+ 0x00, 0x13, 0x08,
+};
+
+static JSContext *JS_NewCustomContext(JSRuntime *rt)
+{
+  JSContext *ctx = JS_NewContextRaw(rt);
+  if (!ctx)
+    return NULL;
+  JS_AddIntrinsicBaseObjects(ctx);
+  JS_AddIntrinsicDate(ctx);
+  JS_AddIntrinsicEval(ctx);
+  JS_AddIntrinsicStringNormalize(ctx);
+  JS_AddIntrinsicRegExp(ctx);
+  JS_AddIntrinsicJSON(ctx);
+  JS_AddIntrinsicProxy(ctx);
+  JS_AddIntrinsicMapSet(ctx);
+  JS_AddIntrinsicTypedArrays(ctx);
+  JS_AddIntrinsicPromise(ctx);
+  JS_AddIntrinsicBigInt(ctx);
+  return ctx;
+}
+
+int main(int argc, char **argv)
+{
+  JSRuntime *rt;
+  JSContext *ctx;
+  rt = JS_NewRuntime();
+  js_std_set_worker_new_context_func(JS_NewCustomContext);
+  js_std_init_handlers(rt);
+  JS_SetModuleLoaderFunc(rt, NULL, js_module_loader, NULL);
+  ctx = JS_NewCustomContext(rt);
+  js_std_add_helpers(ctx, argc, argv);
+  js_std_eval_binary(ctx, qjsc_a, qjsc_a_size, 0);
+  js_std_loop(ctx);
+  JS_FreeContext(ctx);
+  JS_FreeRuntime(rt);
+  return 0;
+}

data/quickjs/out56.c

@@ -0,0 +1,79 @@
+/* File generated automatically by the QuickJS compiler. */
+
+#include "quickjs-libc.h"
+
+const uint32_t qjsc_fib_module_size = 135;
+
+const uint8_t qjsc_fib_module[135] = {
+ 0x02, 0x03, 0x2c, 0x65, 0x78, 0x61, 0x6d, 0x70,
+ 0x6c, 0x65, 0x73, 0x2f, 0x66, 0x69, 0x62, 0x5f,
+ 0x6d, 0x6f, 0x64, 0x75, 0x6c, 0x65, 0x2e, 0x6a,
+ 0x73, 0x06, 0x66, 0x69, 0x62, 0x02, 0x6e, 0x0f,
+ 0xc2, 0x03, 0x00, 0x01, 0x00, 0x00, 0xc4, 0x03,
+ 0x00, 0x00, 0x0e, 0x00, 0x06, 0x01, 0xa0, 0x01,
+ 0x00, 0x00, 0x00, 0x01, 0x01, 0x01, 0x08, 0x00,
+ 0xc4, 0x03, 0x00, 0x01, 0x08, 0xea, 0x05, 0xc0,
+ 0x00, 0xe1, 0x29, 0x29, 0xc2, 0x03, 0x01, 0x04,
+ 0x01, 0x00, 0x07, 0x14, 0x0e, 0x43, 0x06, 0x01,
+ 0xc4, 0x03, 0x01, 0x00, 0x01, 0x04, 0x01, 0x00,
+ 0x1a, 0x01, 0xc6, 0x03, 0x00, 0x01, 0x00, 0xc4,
+ 0x03, 0x00, 0x00, 0xd1, 0xb5, 0xa4, 0xea, 0x03,
+ 0xb5, 0x28, 0xd1, 0xb6, 0xa9, 0xea, 0x03, 0xb6,
+ 0x28, 0xdd, 0xd1, 0xb6, 0x9e, 0xef, 0xdd, 0xd1,
+ 0xb7, 0x9e, 0xef, 0x9d, 0x28, 0xc2, 0x03, 0x02,
+ 0x06, 0x04, 0x1c, 0x08, 0x21, 0x08, 0x08,
+};
+
+const uint32_t qjsc_hello_module_size = 168;
+
+const uint8_t qjsc_hello_module[168] = {
+ 0x02, 0x07, 0x30, 0x65, 0x78, 0x61, 0x6d, 0x70,
+ 0x6c, 0x65, 0x73, 0x2f, 0x68, 0x65, 0x6c, 0x6c,
+ 0x6f, 0x5f, 0x6d, 0x6f, 0x64, 0x75, 0x6c, 0x65,
+ 0x2e, 0x6a, 0x73, 0x1e, 0x2e, 0x2f, 0x66, 0x69,
+ 0x62, 0x5f, 0x6d, 0x6f, 0x64, 0x75, 0x6c, 0x65,
+ 0x2e, 0x6a, 0x73, 0x06, 0x66, 0x69, 0x62, 0x0e,
+ 0x63, 0x6f, 0x6e, 0x73, 0x6f, 0x6c, 0x65, 0x06,
+ 0x6c, 0x6f, 0x67, 0x16, 0x48, 0x65, 0x6c, 0x6c,
+ 0x6f, 0x20, 0x57, 0x6f, 0x72, 0x6c, 0x64, 0x10,
+ 0x66, 0x69, 0x62, 0x28, 0x31, 0x30, 0x29, 0x3d,
+ 0x0f, 0xc2, 0x03, 0x01, 0xc4, 0x03, 0x00, 0x00,
+ 0x01, 0x00, 0xc6, 0x03, 0x00, 0x0e, 0x00, 0x06,
+ 0x01, 0xa0, 0x01, 0x00, 0x00, 0x00, 0x05, 0x01,
+ 0x00, 0x30, 0x00, 0xc6, 0x03, 0x00, 0x0c, 0x08,
+ 0xea, 0x02, 0x29, 0x38, 0xe4, 0x00, 0x00, 0x00,
+ 0x42, 0xe5, 0x00, 0x00, 0x00, 0x04, 0xe6, 0x00,
+ 0x00, 0x00, 0x24, 0x01, 0x00, 0x0e, 0x38, 0xe4,
+ 0x00, 0x00, 0x00, 0x42, 0xe5, 0x00, 0x00, 0x00,
+ 0x04, 0xe7, 0x00, 0x00, 0x00, 0x65, 0x00, 0x00,
+ 0xbd, 0x0a, 0xef, 0x24, 0x02, 0x00, 0x29, 0xc2,
+ 0x03, 0x01, 0x05, 0x01, 0x00, 0x04, 0x0a, 0x62,
+};
+
+static JSContext *JS_NewCustomContext(JSRuntime *rt)
+{
+  JSContext *ctx = JS_NewContextRaw(rt);
+  if (!ctx)
+    return NULL;
+  JS_AddIntrinsicBaseObjects(ctx);
+  JS_AddIntrinsicBigInt(ctx);
+  js_std_eval_binary(ctx, qjsc_fib_module, qjsc_fib_module_size, 1);
+  return ctx;
+}
+
+int main(int argc, char **argv)
+{
+  JSRuntime *rt;
+  JSContext *ctx;
+  rt = JS_NewRuntime();
+  js_std_set_worker_new_context_func(JS_NewCustomContext);
+  js_std_init_handlers(rt);
+  JS_SetModuleLoaderFunc(rt, NULL, js_module_loader, NULL);
+  ctx = JS_NewCustomContext(rt);
+  js_std_add_helpers(ctx, argc, argv);
+  js_std_eval_binary(ctx, qjsc_hello_module, qjsc_hello_module_size, 0);
+  js_std_loop(ctx);
+  JS_FreeContext(ctx);
+  JS_FreeRuntime(rt);
+  return 0;
+}

data/quickjs/out57.c

@@ -0,0 +1,24 @@
+/* File generated automatically by the QuickJS compiler. */
+
+#include "quickjs-libc.h"
+
+const uint32_t qjsc_a_size = 115;
+
+const uint8_t qjsc_a[115] = {
+ 0x02, 0x04, 0x02, 0x69, 0x0e, 0x63, 0x6f, 0x6e,
+ 0x73, 0x6f, 0x6c, 0x65, 0x06, 0x6c, 0x6f, 0x67,
+ 0x08, 0x61, 0x2e, 0x6a, 0x73, 0x0e, 0x00, 0x06,
+ 0x00, 0xa0, 0x01, 0x00, 0x01, 0x00, 0x03, 0x00,
+ 0x00, 0x41, 0x01, 0xa2, 0x01, 0x00, 0x00, 0x00,
+ 0x3f, 0xe1, 0x00, 0x00, 0x00, 0x00, 0x3e, 0xe1,
+ 0x00, 0x00, 0x00, 0x00, 0x06, 0xc9, 0xb5, 0x39,
+ 0xe1, 0x00, 0x00, 0x00, 0x38, 0xe1, 0x00, 0x00,
+ 0x00, 0xba, 0xa3, 0xea, 0x23, 0x38, 0xe2, 0x00,
+ 0x00, 0x00, 0x42, 0xe3, 0x00, 0x00, 0x00, 0x38,
+ 0xe1, 0x00, 0x00, 0x00, 0x24, 0x01, 0x00, 0xc9,
+ 0x38, 0xe1, 0x00, 0x00, 0x00, 0x8f, 0x11, 0x39,
+ 0xe1, 0x00, 0x00, 0x00, 0x0e, 0xec, 0xd6, 0xc5,
+ 0x28, 0xc8, 0x03, 0x01, 0x06, 0x1f, 0x21, 0x58,
+ 0x00, 0x13, 0x08,
+};
+

data/quickjs/out58.c

@@ -0,0 +1,4 @@
+/* File generated automatically by the QuickJS compiler. */
+
+#include "quickjs-libc.h"
+