Skip to content

Commit

Permalink
Merge pull request #16733 from JuliaLang/jb/array_any_rename
Browse files Browse the repository at this point in the history
more accurate names for identifiers that refer to `Array{Any}`s
  • Loading branch information
JeffBezanson committed Jun 3, 2016
2 parents 7f95e1b + a6e2e65 commit 452bbb3
Show file tree
Hide file tree
Showing 14 changed files with 49 additions and 49 deletions.
2 changes: 1 addition & 1 deletion doc/devdocs/object.rst
Original file line number Diff line number Diff line change
Expand Up @@ -148,7 +148,7 @@ Arrays::
jl_array_t *jl_alloc_array_1d(jl_value_t *atype, size_t nr);
jl_array_t *jl_alloc_array_2d(jl_value_t *atype, size_t nr, size_t nc);
jl_array_t *jl_alloc_array_3d(jl_value_t *atype, size_t nr, size_t nc, size_t z);
jl_array_t *jl_alloc_array_ptr_1d(size_t n);
jl_array_t *jl_alloc_vec_any(size_t n);

Note that many of these have alternative allocation functions for various special-purposes.
The list here reflects the more common usages, but a more complete list can be found by reading the `julia.h header file
Expand Down
10 changes: 5 additions & 5 deletions src/alloc.c
Original file line number Diff line number Diff line change
Expand Up @@ -55,7 +55,7 @@ jl_datatype_t *jl_ref_type;
jl_datatype_t *jl_pointer_type;
jl_datatype_t *jl_void_type;
jl_datatype_t *jl_voidpointer_type;
jl_value_t *jl_an_empty_array_ptr=NULL;
jl_value_t *jl_an_empty_vec_any=NULL;
jl_value_t *jl_stackovf_exception;
#ifdef SEGV_EXCEPTION
jl_value_t *jl_segv_exception;
Expand Down Expand Up @@ -319,7 +319,7 @@ void jl_lambda_info_set_ast(jl_lambda_info_t *li, jl_value_t *ast)
jl_value_t *ssavalue_types = jl_lam_ssavalues((jl_expr_t*)ast);
assert(jl_is_long(ssavalue_types));
size_t nssavalue = jl_unbox_long(ssavalue_types);
li->slotnames = jl_alloc_array_ptr_1d(nslots);
li->slotnames = jl_alloc_vec_any(nslots);
jl_gc_wb(li, li->slotnames);
li->slottypes = jl_nothing;
li->slotflags = jl_alloc_array_1d(jl_array_uint8_type, nslots);
Expand Down Expand Up @@ -410,7 +410,7 @@ static jl_lambda_info_t *jl_instantiate_staged(jl_method_t *generator, jl_tuplet
ex = jl_exprn(lambda_sym, 2);

int nargs = func->nargs;
jl_array_t *argnames = jl_alloc_array_ptr_1d(nargs);
jl_array_t *argnames = jl_alloc_vec_any(nargs);
jl_array_ptr_set(ex->args, 0, argnames);
for (i = 0; i < nargs; i++)
jl_array_ptr_set(argnames, i, jl_array_ptr_ref(func->slotnames, i));
Expand Down Expand Up @@ -1227,7 +1227,7 @@ JL_DLLEXPORT jl_value_t *jl_box_bool(int8_t x)

jl_expr_t *jl_exprn(jl_sym_t *head, size_t n)
{
jl_array_t *ar = n==0 ? (jl_array_t*)jl_an_empty_array_ptr : jl_alloc_array_ptr_1d(n);
jl_array_t *ar = n==0 ? (jl_array_t*)jl_an_empty_vec_any : jl_alloc_vec_any(n);
JL_GC_PUSH1(&ar);
jl_expr_t *ex = (jl_expr_t*)jl_gc_alloc_3w(); assert(NWORDS(sizeof(jl_expr_t))==3);
jl_set_typeof(ex, jl_expr_type);
Expand All @@ -1242,7 +1242,7 @@ JL_CALLABLE(jl_f__expr)
{
JL_NARGSV(Expr, 1);
JL_TYPECHK(Expr, symbol, args[0]);
jl_array_t *ar = jl_alloc_array_ptr_1d(nargs-1);
jl_array_t *ar = jl_alloc_vec_any(nargs-1);
JL_GC_PUSH1(&ar);
for(size_t i=0; i < nargs-1; i++)
jl_array_ptr_set(ar, i, args[i+1]);
Expand Down
2 changes: 1 addition & 1 deletion src/array.c
Original file line number Diff line number Diff line change
Expand Up @@ -384,7 +384,7 @@ JL_DLLEXPORT jl_value_t *jl_cstr_to_string(const char *str)
return jl_pchar_to_string(str, strlen(str));
}

JL_DLLEXPORT jl_array_t *jl_alloc_array_ptr_1d(size_t n)
JL_DLLEXPORT jl_array_t *jl_alloc_vec_any(size_t n)
{
return jl_alloc_array_1d(jl_array_any_type, n);
}
Expand Down
22 changes: 11 additions & 11 deletions src/ast.c
Original file line number Diff line number Diff line change
Expand Up @@ -92,7 +92,7 @@ static void jl_ast_preserve(fl_context_t *fl_ctx, jl_value_t *obj)
assert(ctx->roots);
jl_array_t *roots = *ctx->roots;
if (!roots) {
roots = *ctx->roots = jl_alloc_array_ptr_1d(1);
roots = *ctx->roots = jl_alloc_vec_any(1);
jl_array_ptr_set(roots, 0, obj);
}
else {
Expand Down Expand Up @@ -342,8 +342,8 @@ static jl_svec_t *full_svec(fl_context_t *fl_ctx, value_t e, int expronly)
static jl_value_t *full_list(fl_context_t *fl_ctx, value_t e, int expronly)
{
size_t ln = llength(e);
if (ln == 0) return jl_an_empty_array_ptr;
jl_array_t *ar = jl_alloc_array_ptr_1d(ln);
if (ln == 0) return jl_an_empty_vec_any;
jl_array_t *ar = jl_alloc_vec_any(ln);
JL_GC_PUSH1(&ar);
size_t i=0;
while (iscons(e)) {
Expand All @@ -358,8 +358,8 @@ static jl_value_t *full_list(fl_context_t *fl_ctx, value_t e, int expronly)
static jl_value_t *full_list_of_lists(fl_context_t *fl_ctx, value_t e, int expronly)
{
size_t ln = llength(e);
if (ln == 0) return jl_an_empty_array_ptr;
jl_array_t *ar = jl_alloc_array_ptr_1d(ln);
if (ln == 0) return jl_an_empty_vec_any;
jl_array_t *ar = jl_alloc_vec_any(ln);
JL_GC_PUSH1(&ar);
size_t i=0;
while (iscons(e)) {
Expand Down Expand Up @@ -470,7 +470,7 @@ static jl_value_t *scm_to_julia_(fl_context_t *fl_ctx, value_t e, int eo)
e = cdr_(e);

value_t ee = car_(e);
vinf = jl_alloc_array_ptr_1d(3);
vinf = jl_alloc_vec_any(3);
jl_array_ptr_set(vinf, 0, full_list_of_lists(fl_ctx, car_(ee), eo));
ee = cdr_(ee);
jl_array_ptr_set(vinf, 1, full_list_of_lists(fl_ctx, car_(ee), eo));
Expand Down Expand Up @@ -565,7 +565,7 @@ static jl_value_t *scm_to_julia_(fl_context_t *fl_ctx, value_t e, int eo)
JL_GC_PUSH1(&ex);
// allocate a fresh args array for empty exprs passed to macros
if (eo && n == 0) {
ex->args = jl_alloc_array_ptr_1d(0);
ex->args = jl_alloc_vec_any(0);
jl_gc_wb(ex, ex->args);
}
for(i=0; i < n; i++) {
Expand Down Expand Up @@ -860,12 +860,12 @@ jl_lambda_info_t *jl_wrap_expr(jl_value_t *expr)
{
// `(lambda () (() () () ()) ,expr)
jl_expr_t *le=NULL, *bo=NULL; jl_value_t *vi=NULL;
jl_value_t *mt = jl_an_empty_array_ptr;
jl_value_t *mt = jl_an_empty_vec_any;
jl_lambda_info_t *li = NULL;
JL_GC_PUSH4(&le, &vi, &bo, &li);
le = jl_exprn(lambda_sym, 3);
jl_array_ptr_set(le->args, 0, mt);
vi = (jl_value_t*)jl_alloc_array_ptr_1d(3);
vi = (jl_value_t*)jl_alloc_vec_any(3);
jl_array_ptr_set(vi, 0, mt);
jl_array_ptr_set(vi, 1, mt);
// front end always wraps toplevel exprs with ssavalues in (thunk (lambda () ...))
Expand Down Expand Up @@ -952,7 +952,7 @@ JL_DLLEXPORT jl_value_t *jl_copy_ast(jl_value_t *expr)
JL_GC_PUSH2(&ne, &expr);
ne = jl_exprn(e->head, l);
if (l == 0) {
ne->args = jl_alloc_array_ptr_1d(0);
ne->args = jl_alloc_vec_any(0);
jl_gc_wb(ne, ne->args);
}
else {
Expand All @@ -968,7 +968,7 @@ JL_DLLEXPORT jl_value_t *jl_copy_ast(jl_value_t *expr)
size_t i, l = jl_array_len(a);
jl_array_t *na = NULL;
JL_GC_PUSH2(&na, &expr);
na = jl_alloc_array_ptr_1d(l);
na = jl_alloc_vec_any(l);
for(i=0; i < l; i++)
jl_array_ptr_set(na, i, jl_copy_ast(jl_array_ptr_ref(a,i)));
JL_GC_POP();
Expand Down
2 changes: 1 addition & 1 deletion src/codegen.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1864,7 +1864,7 @@ static void jl_add_linfo_root(jl_lambda_info_t *li, jl_value_t *val)
JL_GC_PUSH1(&val);
jl_method_t *m = li->def;
if (m->roots == NULL) {
m->roots = jl_alloc_array_ptr_1d(1);
m->roots = jl_alloc_vec_any(1);
jl_gc_wb(m, m->roots);
jl_array_ptr_set(m->roots, 0, val);
}
Expand Down
8 changes: 4 additions & 4 deletions src/dump.c
Original file line number Diff line number Diff line change
Expand Up @@ -938,7 +938,7 @@ static void jl_serialize_value_(ios_t *s, jl_value_t *v)
offsetof(jl_typemap_level_t, key) == 4 * sizeof(jl_value_t*) &&
sizeof(jl_typemap_level_t) == 5 * sizeof(jl_value_t*));
if (node->arg1 != (void*)jl_nothing) {
jl_array_t *a = jl_alloc_array_ptr_1d(0);
jl_array_t *a = jl_alloc_vec_any(0);
for (i = 0, l = jl_array_len(node->arg1); i < l; i++) {
jl_value_t *d = jl_array_ptr_ref(node->arg1, i);
if (d != NULL && d != jl_nothing)
Expand All @@ -950,7 +950,7 @@ static void jl_serialize_value_(ios_t *s, jl_value_t *v)
jl_serialize_value(s, jl_nothing);
}
if (node->targ != (void*)jl_nothing) {
jl_array_t *a = jl_alloc_array_ptr_1d(0);
jl_array_t *a = jl_alloc_vec_any(0);
for (i = 0, l = jl_array_len(node->targ); i < l; i++) {
jl_value_t *d = jl_array_ptr_ref(node->targ, i);
if (d != NULL && d != jl_nothing)
Expand Down Expand Up @@ -1989,7 +1989,7 @@ static void jl_restore_system_image_from_stream(ios_t *f)
mode = MODE_SYSTEM_IMAGE;
arraylist_new(&backref_list, 250000);

datatype_list = jl_alloc_array_ptr_1d(0);
datatype_list = jl_alloc_vec_any(0);

jl_main_module = (jl_module_t*)jl_deserialize_value(f, NULL);
jl_top_module = (jl_module_t*)jl_deserialize_value(f, NULL);
Expand Down Expand Up @@ -2091,7 +2091,7 @@ JL_DLLEXPORT jl_array_t *jl_compress_ast(jl_lambda_info_t *li, jl_array_t *ast)
int en = jl_gc_enable(0); // Might GC

if (li->def->roots == NULL) {
li->def->roots = jl_alloc_array_ptr_1d(0);
li->def->roots = jl_alloc_vec_any(0);
jl_gc_wb(li->def, li->def->roots);
}
tree_literal_values = li->def->roots;
Expand Down
4 changes: 2 additions & 2 deletions src/gc.c
Original file line number Diff line number Diff line change
Expand Up @@ -1508,8 +1508,8 @@ void pre_mark(void)
}

// invisible builtin values
if (jl_an_empty_array_ptr != NULL)
gc_push_root(jl_an_empty_array_ptr, 0);
if (jl_an_empty_vec_any != NULL)
gc_push_root(jl_an_empty_vec_any, 0);
if (jl_module_init_order != NULL)
gc_push_root(jl_module_init_order, 0);
gc_push_root(jl_cfunction_list.unknown, 0);
Expand Down
28 changes: 14 additions & 14 deletions src/gf.c
Original file line number Diff line number Diff line change
Expand Up @@ -144,7 +144,7 @@ jl_value_t *jl_mk_builtin_func(const char *name, jl_fptr_t fptr)
jl_lambda_info_t *li = jl_new_lambda_info_uninit(jl_emptysvec);
li->fptr = fptr;
// TODO jb/functions: what should li->ast be?
li->code = (jl_array_t*)jl_an_empty_array_ptr; jl_gc_wb(li, li->code);
li->code = (jl_array_t*)jl_an_empty_vec_any; jl_gc_wb(li, li->code);
li->def = jl_new_method_uninit();
li->def->name = sname;
li->def->lambda_template = li;
Expand Down Expand Up @@ -276,7 +276,7 @@ JL_DLLEXPORT void jl_set_typeinf_func(jl_value_t *f)
{
jl_typeinf_func = (jl_function_t*)f;
// give type inference a chance to see all of these
jl_array_t *unspec = jl_alloc_array_ptr_1d(0);
jl_array_t *unspec = jl_alloc_vec_any(0);
JL_GC_PUSH1(&unspec);
jl_reset_mt_caches(jl_main_module, unspec);
size_t i, l;
Expand Down Expand Up @@ -665,7 +665,7 @@ static jl_lambda_info_t *cache_method(jl_methtable_t *mt, union jl_typemap_t *ca
if (newmeth->code != NULL) {
jl_array_t *spe = definition->specializations;
if (spe == NULL) {
spe = jl_alloc_array_ptr_1d(1);
spe = jl_alloc_vec_any(1);
jl_array_ptr_set(spe, 0, newmeth);
}
else {
Expand Down Expand Up @@ -781,11 +781,11 @@ static int check_ambiguous_visitor(jl_typemap_entry_t *oldentry, struct typemap_
return 1;
jl_method_t *mambig = oldentry->func.method;
if (m->ambig == jl_nothing) {
m->ambig = (jl_value_t*) jl_alloc_array_ptr_1d(0);
m->ambig = (jl_value_t*) jl_alloc_vec_any(0);
jl_gc_wb(m, m->ambig);
}
if (mambig->ambig == jl_nothing) {
mambig->ambig = (jl_value_t*) jl_alloc_array_ptr_1d(0);
mambig->ambig = (jl_value_t*) jl_alloc_vec_any(0);
jl_gc_wb(mambig, mambig->ambig);
}
jl_array_ptr_1d_push((jl_array_t*) m->ambig, (jl_value_t*) mambig);
Expand All @@ -807,7 +807,7 @@ static int check_ambiguous_visitor(jl_typemap_entry_t *oldentry, struct typemap_
else if (closure->after) {
// record that this method definition is being partially replaced
if (closure->shadowed == NULL) {
closure->shadowed = jl_alloc_array_ptr_1d(0);
closure->shadowed = jl_alloc_vec_any(0);
}
jl_array_ptr_1d_push(closure->shadowed, oldentry->func.value);
}
Expand Down Expand Up @@ -935,7 +935,7 @@ void jl_method_table_insert(jl_methtable_t *mt, jl_method_t *method, jl_tupletyp
if (oldvalue) {
method->ambig = ((jl_method_t*)oldvalue)->ambig;
method_overwrite(newentry, (jl_method_t*)oldvalue);
jl_array_t *shadowed = jl_alloc_array_ptr_1d(1);
jl_array_t *shadowed = jl_alloc_vec_any(1);
jl_array_ptr_set(shadowed, 0, oldvalue);
oldvalue = (jl_value_t*)shadowed;
}
Expand Down Expand Up @@ -1433,7 +1433,7 @@ static void jl_compile_all(void)
{
// this "found" array will contain
// TypeMapEntries for Methods and LambdaInfos that need to be compiled
jl_array_t *m = jl_alloc_array_ptr_1d(0);
jl_array_t *m = jl_alloc_vec_any(0);
JL_GC_PUSH1(&m);
while (1) {
_compile_all_enq_module(jl_main_module, m);
Expand Down Expand Up @@ -1502,7 +1502,7 @@ static void jl_compile_specializations(void)
{
// this "found" array will contain function
// type signatures that were inferred but haven't been compiled
jl_array_t *m = jl_alloc_array_ptr_1d(0);
jl_array_t *m = jl_alloc_vec_any(0);
JL_GC_PUSH1(&m);
_precompile_enq_module(jl_main_module, m);
size_t i, l;
Expand Down Expand Up @@ -1846,7 +1846,7 @@ static int ml_matches_visitor(jl_typemap_entry_t *ml, struct typemap_intersectio
}
if (k >= len) {
if (len == 0) {
closure->t = (jl_value_t*)jl_alloc_array_ptr_1d(0);
closure->t = (jl_value_t*)jl_alloc_vec_any(0);
}
jl_array_ptr_1d_push((jl_array_t*)closure->t,
(jl_value_t*)jl_svec(3, mti, env, mambig));
Expand Down Expand Up @@ -1875,7 +1875,7 @@ static int ml_matches_visitor(jl_typemap_entry_t *ml, struct typemap_intersectio
}
closure->matc = jl_svec(3, closure->match.ti, closure->match.env, meth);
if (len == 0) {
closure->t = (jl_value_t*)jl_alloc_array_ptr_1d(1);
closure->t = (jl_value_t*)jl_alloc_vec_any(1);
jl_array_ptr_set(closure->t, 0, (jl_value_t*)closure->matc);
}
else {
Expand Down Expand Up @@ -1910,7 +1910,7 @@ static jl_value_t *ml_matches(union jl_typemap_t defs, int offs,
env.match.va = va;
env.match.ti = NULL;
env.match.env = jl_emptysvec;
env.t = jl_an_empty_array_ptr;
env.t = jl_an_empty_vec_any;
env.matc = NULL;
env.lim = lim;
env.include_ambiguous = include_ambiguous;
Expand All @@ -1931,11 +1931,11 @@ JL_DLLEXPORT jl_value_t *jl_matching_methods(jl_tupletype_t *types, int lim, int
{
assert(jl_nparams(types) > 0);
if (jl_tparam0(types) == jl_bottom_type)
return (jl_value_t*)jl_alloc_array_ptr_1d(0);
return (jl_value_t*)jl_alloc_vec_any(0);
assert(jl_is_datatype(jl_tparam0(types)));
jl_methtable_t *mt = ((jl_datatype_t*)jl_tparam0(types))->name->mt;
if (mt == NULL)
return (jl_value_t*)jl_alloc_array_ptr_1d(0);
return (jl_value_t*)jl_alloc_vec_any(0);
return ml_matches(mt->defs, 0, types, lim, include_ambiguous);
}

Expand Down
4 changes: 2 additions & 2 deletions src/init.c
Original file line number Diff line number Diff line change
Expand Up @@ -633,7 +633,7 @@ void _julia_init(JL_IMAGE_SEARCH rel)

jl_start_threads();

jl_an_empty_array_ptr = (jl_value_t*)jl_alloc_array_ptr_1d(0);
jl_an_empty_vec_any = (jl_value_t*)jl_alloc_vec_any(0);
jl_init_serializer();

if (!jl_options.image_file) {
Expand Down Expand Up @@ -739,7 +739,7 @@ static void julia_save(void)

jl_array_t *worklist = jl_module_init_order;
JL_GC_PUSH1(&worklist);
jl_module_init_order = jl_alloc_array_ptr_1d(0);
jl_module_init_order = jl_alloc_vec_any(0);
int i, l = jl_array_len(worklist);
for (i = 0; i < l; i++) {
jl_value_t *m = jl_arrayref(worklist, i);
Expand Down
4 changes: 2 additions & 2 deletions src/julia.h
Original file line number Diff line number Diff line change
Expand Up @@ -495,7 +495,7 @@ extern JL_DLLEXPORT jl_value_t *jl_inexact_exception;
extern JL_DLLEXPORT jl_value_t *jl_undefref_exception;
extern JL_DLLEXPORT jl_value_t *jl_interrupt_exception;
extern JL_DLLEXPORT jl_datatype_t *jl_boundserror_type;
extern JL_DLLEXPORT jl_value_t *jl_an_empty_array_ptr;
extern JL_DLLEXPORT jl_value_t *jl_an_empty_vec_any;

extern JL_DLLEXPORT jl_datatype_t *jl_bool_type;
extern JL_DLLEXPORT jl_datatype_t *jl_char_type;
Expand Down Expand Up @@ -1147,7 +1147,7 @@ JL_DLLEXPORT jl_array_t *jl_pchar_to_array(const char *str, size_t len);
JL_DLLEXPORT jl_value_t *jl_pchar_to_string(const char *str, size_t len);
JL_DLLEXPORT jl_value_t *jl_cstr_to_string(const char *str);
JL_DLLEXPORT jl_value_t *jl_array_to_string(jl_array_t *a);
JL_DLLEXPORT jl_array_t *jl_alloc_array_ptr_1d(size_t n);
JL_DLLEXPORT jl_array_t *jl_alloc_vec_any(size_t n);
JL_DLLEXPORT jl_value_t *jl_arrayref(jl_array_t *a, size_t i); // 0-indexed
JL_DLLEXPORT void jl_arrayset(jl_array_t *a, jl_value_t *v, size_t i); // 0-indexed
JL_DLLEXPORT void jl_arrayunset(jl_array_t *a, size_t i); // 0-indexed
Expand Down
2 changes: 1 addition & 1 deletion src/table.c
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ void jl_idtable_rehash(jl_array_t **pa, size_t newsz)
size_t sz = jl_array_len(*pa);
size_t i;
void **ol = (void**)(*pa)->data;
jl_array_t *newa = jl_alloc_array_ptr_1d(newsz);
jl_array_t *newa = jl_alloc_vec_any(newsz);
// keep the original array in the original slot since we need `ol`
// to be valid in the loop below.
JL_GC_PUSH1(&newa);
Expand Down
2 changes: 1 addition & 1 deletion src/toplevel.c
Original file line number Diff line number Diff line change
Expand Up @@ -74,7 +74,7 @@ static void jl_module_load_time_initialize(jl_module_t *m)
int build_mode = jl_generating_output();
if (build_mode) {
if (jl_module_init_order == NULL)
jl_module_init_order = jl_alloc_array_ptr_1d(0);
jl_module_init_order = jl_alloc_vec_any(0);
jl_array_ptr_1d_push(jl_module_init_order, (jl_value_t*)m);
jl_function_t *f = jl_module_get_initializer(m);
if (f) {
Expand Down
6 changes: 3 additions & 3 deletions src/typemap.c
Original file line number Diff line number Diff line change
Expand Up @@ -215,7 +215,7 @@ static void mtcache_rehash(jl_array_t **pa, jl_value_t *parent, int8_t tparam, i
size_t i, len = jl_array_len(*pa);
size_t newlen = next_power_of_two(len) * 2;
jl_value_t **d = (jl_value_t**)jl_array_data(*pa);
jl_array_t *n = jl_alloc_array_ptr_1d(newlen);
jl_array_t *n = jl_alloc_vec_any(newlen);
for (i = 1; i <= len; i++) {
union jl_typemap_t ml;
ml.unknown = d[i - 1];
Expand All @@ -238,7 +238,7 @@ static void mtcache_rehash(jl_array_t **pa, jl_value_t *parent, int8_t tparam, i
// hash collision: start over after doubling the size again
i = 0;
newlen *= 2;
n = jl_alloc_array_ptr_1d(newlen);
n = jl_alloc_vec_any(newlen);
}
}
}
Expand Down Expand Up @@ -278,7 +278,7 @@ static union jl_typemap_t *mtcache_hash_bp(jl_array_t **pa, jl_value_t *ty,
// since they should have a lower priority and need to go into the sorted list
return NULL;
if (*pa == (void*)jl_nothing) {
*pa = jl_alloc_array_ptr_1d(INIT_CACHE_SIZE);
*pa = jl_alloc_vec_any(INIT_CACHE_SIZE);
jl_gc_wb(parent, *pa);
}
while (1) {
Expand Down
Loading

0 comments on commit 452bbb3

Please sign in to comment.