1300    struct magic_entry_set *mset)  in addentry()  argument
1303 	if (mset[i].me == NULL || mset[i].count == mset[i].max) {  in addentry()
1306 		size_t incr = mset[i].max + ALLOC_INCR;  in addentry()
1308 		    realloc(mset[i].me, sizeof(*mp) * incr))) ==  in addentry()
1313 		(void)memset(&mp[mset[i].count], 0, sizeof(*mp) *  in addentry()
1315 		mset[i].me = mp;  in addentry()
1316 		mset[i].max = CAST(uint32_t, incr);  in addentry()
1317 		assert(mset[i].max == incr);  in addentry()
1319 	mset[i].me[mset[i].count++] = *me;  in addentry()
1329    struct magic_entry_set *mset)  in load_1()  argument
1399 				(void)addentry(ms, &me, mset);  in load_1()
1408 		(void)addentry(ms, &me, mset);  in load_1()
1530 	struct magic_entry_set mset[MAGIC_SETS];  in apprentice_load()  local
1534 	memset(mset, 0, sizeof(mset));  in apprentice_load()
1591 				load_1(ms, action, filearr[i], &errs, mset);  in apprentice_load()
1598 		load_1(ms, action, fn, &errs, mset);  in apprentice_load()
1604 		for (i = 0; i < mset[j].count; ) {  in apprentice_load()
1605 			if (mset[j].me[i].mp->cont_level != 0) {  in apprentice_load()
1609 			i = set_text_binary(ms, mset[j].me, mset[j].count, i);  in apprentice_load()
1611 		if (mset[j].me)  in apprentice_load()
1612 			qsort(mset[j].me, mset[j].count, sizeof(*mset[0].me),  in apprentice_load()
1619 		set_last_default(ms, mset[j].me, mset[j].count);  in apprentice_load()
1622 		if (mset[j].count == 0)  in apprentice_load()
1625 		if (coalesce_entries(ms, mset[j].me, mset[j].count,  in apprentice_load()
1635 		magic_entry_free(mset[j].me, mset[j].count);  in apprentice_load()