prism 0.25.0 → 0.26.0

data/src/token_type.c

@@ -540,7 +540,7 @@ pm_token_type_human(pm_token_type_t token_type) {
         case PM_TOKEN_KEYWORD_RESCUE:
             return "'rescue'";
         case PM_TOKEN_KEYWORD_RESCUE_MODIFIER:
-            return "'rescue'";
+            return "'rescue' modifier";
         case PM_TOKEN_KEYWORD_RETRY:
             return "'retry'";
         case PM_TOKEN_KEYWORD_RETURN:
@@ -658,13 +658,13 @@ pm_token_type_human(pm_token_type_t token_type) {
         case PM_TOKEN_STAR_STAR_EQUAL:
             return "'**='";
         case PM_TOKEN_STRING_BEGIN:
-            return "string beginning";
+            return "string literal";
         case PM_TOKEN_STRING_CONTENT:
             return "string content";
         case PM_TOKEN_STRING_END:
             return "string ending";
         case PM_TOKEN_SYMBOL_BEGIN:
-            return "symbol beginning";
+            return "symbol literal";
         case PM_TOKEN_TILDE:
             return "'~'";
         case PM_TOKEN_UAMPERSAND:

data/src/util/pm_integer.c

@@ -172,21 +172,21 @@ karatsuba_multiply(pm_integer_t *destination, pm_integer_t *left, pm_integer_t *
     pm_integer_t y0 = { 0, half, right_values, false };
     pm_integer_t y1 = { 0, right_length - half, right_values + half, false };
 
-    pm_integer_t z0;
+    pm_integer_t z0 = { 0 };
     karatsuba_multiply(&z0, &x0, &y0, base);
 
-    pm_integer_t z2;
+    pm_integer_t z2 = { 0 };
     karatsuba_multiply(&z2, &x1, &y1, base);
 
     // For simplicity to avoid considering negative values,
     // use `z1 = (x0 + x1) * (y0 + y1) - z0 - z2` instead of original karatsuba algorithm.
-    pm_integer_t x01;
+    pm_integer_t x01 = { 0 };
     big_add(&x01, &x0, &x1, base);
 
-    pm_integer_t y01;
+    pm_integer_t y01 = { 0 };
     big_add(&y01, &y0, &y1, base);
 
-    pm_integer_t xy;
+    pm_integer_t xy = { 0 };
     karatsuba_multiply(&xy, &x01, &y01, base);
 
     pm_integer_t z1;
@@ -194,7 +194,11 @@ karatsuba_multiply(pm_integer_t *destination, pm_integer_t *left, pm_integer_t *
 
     size_t length = left_length + right_length;
     uint32_t *values = (uint32_t*) xcalloc(length, sizeof(uint32_t));
+
+    assert(z0.values != NULL);
     memcpy(values, z0.values, sizeof(uint32_t) * z0.length);
+
+    assert(z2.values != NULL);
     memcpy(values + 2 * half, z2.values, sizeof(uint32_t) * z2.length);
 
     uint32_t carry = 0;
@@ -326,6 +330,8 @@ pm_integer_convert_base(pm_integer_t *destination, const pm_integer_t *source, u
     INTEGER_EXTRACT(source, source_length, source_values)
 
     size_t bigints_length = (source_length + 1) / 2;
+    assert(bigints_length > 0);
+
     pm_integer_t *bigints = (pm_integer_t *) xcalloc(bigints_length, sizeof(pm_integer_t));
     if (bigints == NULL) return;
 
@@ -345,13 +351,13 @@ pm_integer_convert_base(pm_integer_t *destination, const pm_integer_t *source, u
         base = next_base;
 
         size_t next_length = (bigints_length + 1) / 2;
-        pm_integer_t *next_bigints = (pm_integer_t *) xmalloc(sizeof(pm_integer_t) * next_length);
+        pm_integer_t *next_bigints = (pm_integer_t *) xcalloc(next_length, sizeof(pm_integer_t));
 
         for (size_t bigints_index = 0; bigints_index < bigints_length; bigints_index += 2) {
             if (bigints_index + 1 == bigints_length) {
                 next_bigints[bigints_index / 2] = bigints[bigints_index];
             } else {
-                pm_integer_t multiplied;
+                pm_integer_t multiplied = { 0 };
                 karatsuba_multiply(&multiplied, &base, &bigints[bigints_index + 1], base_to);
 
                 big_add(&next_bigints[bigints_index / 2], &bigints[bigints_index], &multiplied, base_to);
@@ -584,7 +590,7 @@ pm_integer_string(pm_buffer_t *buffer, const pm_integer_t *integer) {
     }
 
     // Otherwise, first we'll convert the base from 1<<32 to 10**9.
-    pm_integer_t converted;
+    pm_integer_t converted = { 0 };
     pm_integer_convert_base(&converted, integer, (uint64_t) 1 << 32, 1000000000);
 
     if (converted.values == NULL) {

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: prism
 version: !ruby/object:Gem::Version
-  version: 0.25.0
+  version: 0.26.0
 platform: ruby
 authors:
 - Shopify
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2024-04-05 00:00:00.000000000 Z
+date: 2024-04-18 00:00:00.000000000 Z
 dependencies: []
 description:
 email:
@@ -68,7 +68,6 @@ files:
 - include/prism/util/pm_list.h
 - include/prism/util/pm_memchr.h
 - include/prism/util/pm_newline_list.h
-- include/prism/util/pm_state_stack.h
 - include/prism/util/pm_string.h
 - include/prism/util/pm_string_list.h
 - include/prism/util/pm_strncasecmp.h
@@ -93,6 +92,7 @@ files:
 - lib/prism/parse_result/newlines.rb
 - lib/prism/pattern.rb
 - lib/prism/polyfill/string.rb
+- lib/prism/reflection.rb
 - lib/prism/serialize.rb
 - lib/prism/translation.rb
 - lib/prism/translation/parser.rb
@@ -114,7 +114,11 @@ files:
 - rbi/prism/node.rbi
 - rbi/prism/node_ext.rbi
 - rbi/prism/parse_result.rbi
+- rbi/prism/reflection.rbi
+- rbi/prism/translation/parser.rbi
 - rbi/prism/translation/parser/compiler.rbi
+- rbi/prism/translation/parser33.rbi
+- rbi/prism/translation/parser34.rbi
 - rbi/prism/translation/ripper.rbi
 - rbi/prism/translation/ripper/ripper_compiler.rbi
 - rbi/prism/translation/ruby_parser.rbi
@@ -130,6 +134,7 @@ files:
 - sig/prism/pack.rbs
 - sig/prism/parse_result.rbs
 - sig/prism/pattern.rbs
+- sig/prism/reflection.rbs
 - sig/prism/serialize.rbs
 - sig/prism/visitor.rbs
 - src/diagnostic.c
@@ -150,7 +155,6 @@ files:
 - src/util/pm_list.c
 - src/util/pm_memchr.c
 - src/util/pm_newline_list.c
-- src/util/pm_state_stack.c
 - src/util/pm_string.c
 - src/util/pm_string_list.c
 - src/util/pm_strncasecmp.c

data/include/prism/util/pm_state_stack.h

@@ -1,42 +0,0 @@
-/**
- * @file pm_state_stack.h
- *
- * A stack of boolean values.
- */
-#ifndef PRISM_STATE_STACK_H
-#define PRISM_STATE_STACK_H
-
-#include "prism/defines.h"
-
-#include <stdbool.h>
-#include <stdint.h>
-
-/**
- * A struct that represents a stack of boolean values.
- */
-typedef uint32_t pm_state_stack_t;
-
-/**
- * Pushes a value onto the stack.
- *
- * @param stack The stack to push the value onto.
- * @param value The value to push onto the stack.
- */
-void pm_state_stack_push(pm_state_stack_t *stack, bool value);
-
-/**
- * Pops a value off the stack.
- *
- * @param stack The stack to pop the value off of.
- */
-void pm_state_stack_pop(pm_state_stack_t *stack);
-
-/**
- * Returns the value at the top of the stack.
- *
- * @param stack The stack to get the value from.
- * @return The value at the top of the stack.
- */
-bool pm_state_stack_p(pm_state_stack_t *stack);
-
-#endif

data/src/util/pm_state_stack.c

@@ -1,25 +0,0 @@
-#include "prism/util/pm_state_stack.h"
-
-/**
- * Pushes a value onto the stack.
- */
-void
-pm_state_stack_push(pm_state_stack_t *stack, bool value) {
-    *stack = (*stack << 1) | (value & 1);
-}
-
-/**
- * Pops a value off the stack.
- */
-void
-pm_state_stack_pop(pm_state_stack_t *stack) {
-    *stack >>= 1;
-}
-
-/**
- * Returns the value at the top of the stack.
- */
-bool
-pm_state_stack_p(pm_state_stack_t *stack) {
-    return *stack & 1;
-}