file/src/apprentice.c

627    struct magic_entry **marray, uint32_t *marraycount)
669 				if (*marraycount == 0) {
677 				    &(*marray)[*marraycount - 1],
684 			if (parse(ms, marray, marraycount, line, lineno,
709 	uint32_t marraycount, i, mentrycount = 0, starttest;
724 	marraycount = 0;
764 			    &marraycount);
769 		load_1(ms, action, fn, &errs, &marray, &marraycount);
774 	for (i = 0; i < marraycount; ) {
804 		} while (++i < marraycount && marray[i].mp->cont_level != 0);
807 	qsort(marray, marraycount, sizeof(*marray), apprentice_sort);
812 	for (i = 0; i < marraycount; i++) {
815 			while (++i < marraycount)
818 			if (i != marraycount) {
827 	for (i = 0; i < marraycount; i++)
838 	for (i = 0; i < marraycount; i++) {
844 	for (i = 0; i < marraycount; i++)