oj 3.12.3 → 3.13.0

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: oj
 version: !ruby/object:Gem::Version
-  version: 3.12.3
+  version: 3.13.0
 platform: ruby
 authors:
 - Peter Ohler
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2021-08-02 00:00:00.000000000 Z
+date: 2021-08-08 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake-compiler
@@ -86,6 +86,7 @@ extra_rdoc_files:
 - pages/JsonGem.md
 - pages/Modes.md
 - pages/Options.md
+- pages/Parser.md
 - pages/Rails.md
 - pages/Security.md
 - pages/WAB.md
@@ -93,6 +94,8 @@ files:
 - LICENSE
 - README.md
 - ext/oj/buf.h
+- ext/oj/cache.c
+- ext/oj/cache.h
 - ext/oj/cache8.c
 - ext/oj/cache8.h
 - ext/oj/circarray.c
@@ -101,6 +104,7 @@ files:
 - ext/oj/code.h
 - ext/oj/compat.c
 - ext/oj/custom.c
+- ext/oj/debug.c
 - ext/oj/dump.c
 - ext/oj/dump.h
 - ext/oj/dump_compat.c
@@ -112,9 +116,9 @@ files:
 - ext/oj/err.h
 - ext/oj/extconf.rb
 - ext/oj/fast.c
-- ext/oj/hash.c
-- ext/oj/hash.h
 - ext/oj/hash_test.c
+- ext/oj/intern.c
+- ext/oj/intern.h
 - ext/oj/mimic_json.c
 - ext/oj/object.c
 - ext/oj/odd.c
@@ -123,6 +127,8 @@ files:
 - ext/oj/oj.h
 - ext/oj/parse.c
 - ext/oj/parse.h
+- ext/oj/parser.c
+- ext/oj/parser.h
 - ext/oj/rails.c
 - ext/oj/rails.h
 - ext/oj/reader.c
@@ -132,6 +138,7 @@ files:
 - ext/oj/rxclass.c
 - ext/oj/rxclass.h
 - ext/oj/saj.c
+- ext/oj/saj2.c
 - ext/oj/scp.c
 - ext/oj/sparse.c
 - ext/oj/stream_writer.c
@@ -139,10 +146,12 @@ files:
 - ext/oj/string_writer.c
 - ext/oj/trace.c
 - ext/oj/trace.h
+- ext/oj/usual.c
 - ext/oj/util.c
 - ext/oj/util.h
 - ext/oj/val_stack.c
 - ext/oj/val_stack.h
+- ext/oj/validate.c
 - ext/oj/wab.c
 - lib/oj.rb
 - lib/oj/active_support_helper.rb
@@ -162,6 +171,7 @@ files:
 - pages/JsonGem.md
 - pages/Modes.md
 - pages/Options.md
+- pages/Parser.md
 - pages/Rails.md
 - pages/Security.md
 - pages/WAB.md
@@ -214,6 +224,7 @@ files:
 - test/perf_fast.rb
 - test/perf_file.rb
 - test/perf_object.rb
+- test/perf_parser.rb
 - test/perf_saj.rb
 - test/perf_scp.rb
 - test/perf_simple.rb
@@ -245,6 +256,9 @@ files:
 - test/test_integer_range.rb
 - test/test_null.rb
 - test/test_object.rb
+- test/test_parser.rb
+- test/test_parser_saj.rb
+- test/test_parser_usual.rb
 - test/test_rails.rb
 - test/test_saj.rb
 - test/test_scp.rb
@@ -339,6 +353,7 @@ test_files:
 - test/perf_fast.rb
 - test/perf_file.rb
 - test/perf_object.rb
+- test/perf_parser.rb
 - test/perf_saj.rb
 - test/perf_scp.rb
 - test/perf_simple.rb
@@ -370,6 +385,9 @@ test_files:
 - test/test_integer_range.rb
 - test/test_null.rb
 - test/test_object.rb
+- test/test_parser.rb
+- test/test_parser_saj.rb
+- test/test_parser_usual.rb
 - test/test_rails.rb
 - test/test_saj.rb
 - test/test_scp.rb

data/ext/oj/hash.c

@@ -1,168 +0,0 @@
-// Copyright (c) 2011 Peter Ohler. All rights reserved.
-// Licensed under the MIT License. See LICENSE file in the project root for license details.
-
-#include "hash.h"
-
-#include <stdint.h>
-
-#define HASH_SLOT_CNT ((uint32_t)8192)
-#define HASH_MASK (HASH_SLOT_CNT - 1)
-
-typedef struct _keyVal {
-    struct _keyVal *next;
-    const char *    key;
-    size_t          len;
-    VALUE           val;
-} * KeyVal;
-
-struct _hash {
-    struct _keyVal slots[HASH_SLOT_CNT];
-};
-
-struct _hash class_hash;
-struct _hash str_hash;
-struct _hash sym_hash;
-struct _hash intern_hash;
-
-// almost the Murmur hash algorithm
-#define M 0x5bd1e995
-#define C1 0xCC9E2D51
-#define C2 0x1B873593
-#define N 0xE6546B64
-
-static uint32_t hash_calc(const uint8_t *key, size_t len) {
-    const uint8_t *end     = key + len;
-    const uint8_t *endless = key + (len / 4 * 4);
-    uint32_t       h       = (uint32_t)len;
-    uint32_t       k;
-
-    while (key < endless) {
-        k = (uint32_t)*key++;
-        k |= (uint32_t)*key++ << 8;
-        k |= (uint32_t)*key++ << 16;
-        k |= (uint32_t)*key++ << 24;
-
-        k *= M;
-        k ^= k >> 24;
-        h *= M;
-        h ^= k * M;
-    }
-    if (1 < end - key) {
-        uint16_t k16 = (uint16_t)*key++;
-
-        k16 |= (uint16_t)*key++ << 8;
-        h ^= k16 << 8;
-    }
-    if (key < end) {
-        h ^= *key;
-    }
-    h *= M;
-    h ^= h >> 13;
-    h *= M;
-    h ^= h >> 15;
-
-    return h;
-}
-
-void oj_hash_init() {
-    memset(class_hash.slots, 0, sizeof(class_hash.slots));
-    memset(str_hash.slots, 0, sizeof(str_hash.slots));
-    memset(sym_hash.slots, 0, sizeof(sym_hash.slots));
-    memset(intern_hash.slots, 0, sizeof(intern_hash.slots));
-}
-
-// if slotp is 0 then just lookup
-static VALUE hash_get(Hash hash, const char *key, size_t len, VALUE **slotp, VALUE def_value) {
-    uint32_t h      = hash_calc((const uint8_t *)key, len) & HASH_MASK;
-    KeyVal   bucket = hash->slots + h;
-
-    if (0 != bucket->key) {
-        KeyVal b;
-
-        for (b = bucket; 0 != b; b = b->next) {
-            if (len == b->len && 0 == strncmp(b->key, key, len)) {
-                *slotp = &b->val;
-                return b->val;
-            }
-            bucket = b;
-        }
-    }
-    if (0 != slotp) {
-        if (0 != bucket->key) {
-            KeyVal b = ALLOC(struct _keyVal);
-
-            b->next      = 0;
-            bucket->next = b;
-            bucket       = b;
-        }
-        bucket->key = oj_strndup(key, len);
-        bucket->len = len;
-        bucket->val = def_value;
-        *slotp      = &bucket->val;
-    }
-    return def_value;
-}
-
-void oj_hash_print() {
-    uint32_t i;
-    KeyVal   b;
-
-    for (i = 0; i < HASH_SLOT_CNT; i++) {
-        printf("%4d:", i);
-        for (b = class_hash.slots + i; 0 != b && 0 != b->key; b = b->next) {
-            printf(" %s", b->key);
-        }
-        printf("\n");
-    }
-}
-
-void oj_hash_sizes() {
-    uint32_t i;
-    KeyVal   b;
-    int      max = 0;
-    int      min = 1000000;
-
-    for (i = 0; i < HASH_SLOT_CNT; i++) {
-        int cnt = 0;
-
-        for (b = str_hash.slots + i; 0 != b && 0 != b->key; b = b->next) {
-            cnt++;
-        }
-        // printf(" %4d\n", cnt);
-        if (max < cnt) {
-            max = cnt;
-        }
-        if (cnt < min) {
-            min = cnt;
-        }
-    }
-    printf("min: %d  max: %d\n", min, max);
-}
-
-VALUE
-oj_class_hash_get(const char *key, size_t len, VALUE **slotp) {
-    return hash_get(&class_hash, key, len, slotp, Qnil);
-}
-
-VALUE
-oj_str_hash_get(const char *key, size_t len, VALUE **slotp) {
-    return hash_get(&str_hash, key, len, slotp, Qnil);
-}
-
-VALUE
-oj_sym_hash_get(const char *key, size_t len, VALUE **slotp) {
-    return hash_get(&sym_hash, key, len, slotp, Qnil);
-}
-
-ID oj_attr_hash_get(const char *key, size_t len, ID **slotp) {
-    return (ID)hash_get(&intern_hash, key, len, (VALUE **)slotp, 0);
-}
-
-char *oj_strndup(const char *s, size_t len) {
-    char *d = ALLOC_N(char, len + 1);
-
-    memcpy(d, s, len);
-    d[len] = '\0';
-
-    return d;
-}

data/ext/oj/hash.h

@@ -1,21 +0,0 @@
-// Copyright (c) 2011 Peter Ohler. All rights reserved.
-// Licensed under the MIT License. See LICENSE file in the project root for license details.
-
-#ifndef OJ_HASH_H
-#define OJ_HASH_H
-
-#include "ruby.h"
-
-typedef struct _hash *Hash;
-
-extern void oj_hash_init();
-
-extern VALUE oj_class_hash_get(const char *key, size_t len, VALUE **slotp);
-extern VALUE oj_str_hash_get(const char *key, size_t len, VALUE **slotp);
-extern VALUE oj_sym_hash_get(const char *key, size_t len, VALUE **slotp);
-extern ID    oj_attr_hash_get(const char *key, size_t len, ID **slotp);
-
-extern void  oj_hash_print();
-extern char *oj_strndup(const char *s, size_t len);
-
-#endif /* OJ_HASH_H */