| ... | @@ -3379,7 +3379,7 @@ static void get_fully_qualified_decl_name(CodeGen *g, Buf *buf, Tld *tld, bool i | ... | @@ -3379,7 +3379,7 @@ static void get_fully_qualified_decl_name(CodeGen *g, Buf *buf, Tld *tld, bool i |
| 3379 | } | 3379 | } |
| 3380 | } | 3380 | } |
| 3381 | | 3381 | |
| 3382 | ZigFn *create_fn_raw(CodeGen *g, FnInline inline_value) { | 3382 | static ZigFn *create_fn_raw(CodeGen *g, FnInline inline_value) { |
| 3383 | ZigFn *fn_entry = heap::c_allocator.create<ZigFn>(); | 3383 | ZigFn *fn_entry = heap::c_allocator.create<ZigFn>(); |
| 3384 | fn_entry->ir_executable = heap::c_allocator.create<IrExecutableSrc>(); | 3384 | fn_entry->ir_executable = heap::c_allocator.create<IrExecutableSrc>(); |
| 3385 | | 3385 | |
| ... | @@ -6111,7 +6111,7 @@ ZigValue **realloc_const_vals_ptrs(CodeGen *g, ZigValue **ptr, size_t old_count, | ... | @@ -6111,7 +6111,7 @@ ZigValue **realloc_const_vals_ptrs(CodeGen *g, ZigValue **ptr, size_t old_count, |
| 6111 | assert(new_count >= old_count); | 6111 | assert(new_count >= old_count); |
| 6112 | | 6112 | |
| 6113 | size_t new_item_count = new_count - old_count; | 6113 | size_t new_item_count = new_count - old_count; |
| 6114 | ZigValue **result = heap::c_allocator.reallocate(ptr, old_count, new_count); | 6114 | ZigValue **result = g->pass1_arena->reallocate(ptr, old_count, new_count); |
| 6115 | ZigValue *vals = g->pass1_arena->allocate<ZigValue>(new_item_count); | 6115 | ZigValue *vals = g->pass1_arena->allocate<ZigValue>(new_item_count); |
| 6116 | for (size_t i = old_count; i < new_count; i += 1) { | 6116 | for (size_t i = old_count; i < new_count; i += 1) { |
| 6117 | result[i] = &vals[i - old_count]; | 6117 | result[i] = &vals[i - old_count]; |