Home
last modified time | relevance | path

Searched refs:mset (Results 1 – 2 of 2) sorted by relevance

/PHP-8.0/ext/fileinfo/libmagic/
H A Dapprentice.c1107 if (mset[i].count == mset[i].max) { in addentry()
1112 erealloc(mset[i].me, sizeof(*mp) * mset[i].max))) == in addentry()
1119 mset[i].me = mp; in addentry()
1121 mset[i].me[mset[i].count++] = *me; in addentry()
1334 memset(mset, 0, sizeof(mset)); in apprentice_load()
1407 i = set_text_binary(ms, mset[j].me, mset[j].count, i); in apprentice_load()
1409 if (mset[j].me) in apprentice_load()
1410 qsort(mset[j].me, mset[j].count, sizeof(*mset[j].me), in apprentice_load()
1417 set_last_default(ms, mset[j].me, mset[j].count); in apprentice_load()
1420 if (coalesce_entries(ms, mset[j].me, mset[j].count, in apprentice_load()
[all …]
/PHP-8.0/ext/fileinfo/
H A Dlibmagic.patch337 mset[i].max += ALLOC_INCR;
339 - realloc(mset[i].me, sizeof(*mp) * mset[i].max))) ==
340 + erealloc(mset[i].me, sizeof(*mp) * mset[i].max))) ==
342 file_oomem(ms, sizeof(*mp) * mset[i].max);
346 struct magic_entry_set *mset)
381 (void)addentry(ms, &me, mset);
418 struct magic_entry_set mset[MAGIC_SETS];
425 memset(mset, 0, sizeof(mset));
496 load_1(ms, action, filearr[i], &errs, mset);
505 load_1(ms, action, fn, &errs, mset);
[all …]

Completed in 15 milliseconds