pike.git / src / builtin_functions.c

version» Context lines:

pike.git/src/builtin_functions.c:4057:    /* Used for the precompiled case. */    int e = ctx->num;    while (e--) {    free_string(ctx->v[e].ind);    free_string(ctx->v[e].val);    }    if (ctx->empty_repl) {    free_string(ctx->empty_repl);    }    } -  free ((char *) ctx->v); +  free (ctx->v);    ctx->v = NULL;    }   }      void compile_replace_many(struct replace_many_context *ctx,    struct array *from,    struct array *to,    int reference_strings)   {    INT32 e, num;
pike.git/src/builtin_functions.c:5171:    if(Pike_sp[e-args].u.array->size != a->size)    bad_arg_error("sort", Pike_sp-args, args, e+1, "array", Pike_sp+e-args,    "Argument %d has wrong size.\n", (e+1));    }       if(args > 1)    {    order = stable_sort_array_destructively(a);    for(e=1;e<args;e++) order_array(Pike_sp[e-args].u.array,order);    pop_n_elems(args-1); -  free((char *)order); +  free(order);    }    else {    /* If there are only simple types in the array we can use unstable    * sorting. */    array_fix_unfinished_type_field (a);    if (a->type_field & BIT_COMPLEX)    free (stable_sort_array_destructively (a));    else    sort_array_destructively (a);    }