alloc 743 mbstring/oniguruma/oniguruma.h unsigned int alloc; /* allocated space for p */ alloc 128 mbstring/oniguruma/regcomp.c buf->alloc = size; alloc 144 mbstring/oniguruma/regcomp.c uslist->alloc = size; alloc 162 mbstring/oniguruma/regcomp.c if (uslist->num >= uslist->alloc) { alloc 163 mbstring/oniguruma/regcomp.c size = uslist->alloc * 2; alloc 166 mbstring/oniguruma/regcomp.c uslist->alloc = size; alloc 5084 mbstring/oniguruma/regcomp.c reg->p = (UChar* )xmalloc(reg->alloc); alloc 5086 mbstring/oniguruma/regcomp.c xmemcpy(reg->p, from->p, reg->alloc); alloc 5150 mbstring/oniguruma/regcomp.c if (reg->alloc == 0) { alloc 5376 mbstring/oniguruma/regcomp.c (*reg)->alloc = 0; alloc 454 mbstring/oniguruma/regint.h unsigned int alloc; alloc 460 mbstring/oniguruma/regint.h (buf)->alloc += (inc);\ alloc 461 mbstring/oniguruma/regint.h (buf)->p = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ alloc 466 mbstring/oniguruma/regint.h do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ alloc 467 mbstring/oniguruma/regint.h (buf)->p = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ alloc 472 mbstring/oniguruma/regint.h unsigned int new_alloc = (buf)->alloc;\ alloc 474 mbstring/oniguruma/regint.h if ((buf)->alloc != new_alloc) {\ alloc 477 mbstring/oniguruma/regint.h (buf)->alloc = new_alloc;\ alloc 483 mbstring/oniguruma/regint.h if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ alloc 490 mbstring/oniguruma/regint.h if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ alloc 502 mbstring/oniguruma/regint.h if ((unsigned int )((to)+(n)) > (buf)->alloc) BBUF_EXPAND((buf),(to) + (n));\ alloc 116 mbstring/oniguruma/regparse.c r = BBUF_INIT(to, from->alloc); alloc 585 mbstring/oniguruma/regparse.c int alloc; alloc 721 mbstring/oniguruma/regparse.c int alloc; alloc 751 mbstring/oniguruma/regparse.c alloc = INIT_NAMES_ALLOC_NUM; alloc 755 mbstring/oniguruma/regparse.c t->alloc = 0; alloc 758 mbstring/oniguruma/regparse.c t->e = (NameEntry* )xmalloc(sizeof(NameEntry) * alloc); alloc 763 mbstring/oniguruma/regparse.c t->alloc = alloc; alloc 767 mbstring/oniguruma/regparse.c else if (t->num == t->alloc) { alloc 770 mbstring/oniguruma/regparse.c alloc = t->alloc * 2; alloc 771 mbstring/oniguruma/regparse.c t->e = (NameEntry* )xrealloc(t->e, sizeof(NameEntry) * alloc); alloc 773 mbstring/oniguruma/regparse.c t->alloc = alloc; alloc 776 mbstring/oniguruma/regparse.c for (i = t->num; i < t->alloc; i++) { alloc 804 mbstring/oniguruma/regparse.c alloc = INIT_NAME_BACKREFS_ALLOC_NUM; alloc 805 mbstring/oniguruma/regparse.c e->back_refs = (int* )xmalloc(sizeof(int) * alloc); alloc 807 mbstring/oniguruma/regparse.c e->back_alloc = alloc; alloc 813 mbstring/oniguruma/regparse.c alloc = e->back_alloc * 2; alloc 814 mbstring/oniguruma/regparse.c e->back_refs = (int* )xrealloc(e->back_refs, sizeof(int) * alloc); alloc 816 mbstring/oniguruma/regparse.c e->back_alloc = alloc; alloc 955 mbstring/oniguruma/regparse.c int i, need, alloc; alloc 962 mbstring/oniguruma/regparse.c alloc = INIT_SCANENV_MEMNODES_ALLOC_SIZE; alloc 963 mbstring/oniguruma/regparse.c p = (Node** )xmalloc(sizeof(Node*) * alloc); alloc 968 mbstring/oniguruma/regparse.c alloc = env->mem_alloc * 2; alloc 969 mbstring/oniguruma/regparse.c p = (Node** )xrealloc(env->mem_nodes_dynamic, sizeof(Node*) * alloc); alloc 973 mbstring/oniguruma/regparse.c for (i = env->num_mem + 1; i < alloc; i++) alloc 977 mbstring/oniguruma/regparse.c env->mem_alloc = alloc; alloc 1184 mbstring/oniguruma/regparse.c bbuf->alloc = n + 1; alloc 201 mbstring/oniguruma/regparse.h int alloc; alloc 173 mbstring/oniguruma/st.c tbl = alloc(st_table); alloc 284 mbstring/oniguruma/st.c entry = alloc(st_table_entry);\ alloc 363 mbstring/oniguruma/st.c new_table = alloc(st_table); alloc 381 mbstring/oniguruma/st.c entry = alloc(st_table_entry); alloc 37 spl/spl_engine.c if (alloc) { alloc 35 spl/spl_engine.h spl_instantiate(pce, retval, alloc TSRMLS_CC); alloc 45 spl/spl_engine.h spl_instantiate(pce, retval, alloc TSRMLS_CC);