302 	g->mlen = 0;  in regcomp()
323 	if (g->mlen > 3) {  in regcomp()
1623 			if (newlen > (sopno)g->mlen) {		/* ends one */  in findmust()
1625 				g->mlen = newlen;  in findmust()
1638 			if (newlen > (sopno)g->mlen) {		/* ends one */  in findmust()
1640 				g->mlen = newlen;  in findmust()
1656 			if (newlen > (sopno)g->mlen) {		/* ends one */  in findmust()
1658 				g->mlen = newlen;  in findmust()
1680 			if (newlen > (sopno)g->mlen) {		/* ends one */  in findmust()
1682 				g->mlen = newlen;  in findmust()
1694 	if (g->mlen == 0) {		/* there isn't one */  in findmust()
1700 	g->must = malloc((size_t)g->mlen + 1);  in findmust()
1702 		g->mlen = 0;  in findmust()
1709 	while (cp < g->must + g->mlen) {  in findmust()
1716 	assert(cp == g->must + g->mlen);  in findmust()
1823 		g->charjump[ch] = g->mlen;  in computejumps()
1831 	for (mindex = 0; mindex < g->mlen; mindex++)  in computejumps()
1832 		g->charjump[(int)g->must[mindex]] = g->mlen - mindex - 1;  in computejumps()
1864 	pmatches = (int *)malloc(g->mlen * sizeof (unsigned int));  in computematchjumps()
1870 	g->matchjump = (int *)malloc(g->mlen * sizeof (unsigned int));  in computematchjumps()
1877 	for (mindex = 0; mindex < g->mlen; mindex++)  in computematchjumps()
1878 		g->matchjump[mindex] = 2*g->mlen - mindex - 1;  in computematchjumps()
1881 	for (mindex = g->mlen - 1, suffix = g->mlen; mindex >= 0;  in computematchjumps()
1892 		while (suffix < g->mlen && g->must[mindex] != g->must[suffix]) {  in computematchjumps()
1894 			    g->mlen - mindex - 1);  in computematchjumps()
1906 		    g->mlen + suffix - mindex);  in computematchjumps()
1909 	while (suffix < g->mlen) {  in computematchjumps()
1910 		while (suffix <= ssuffix && suffix < g->mlen) {  in computematchjumps()
1912 			    g->mlen + ssuffix - suffix);  in computematchjumps()
1915 		if (suffix < g->mlen)  in computematchjumps()