697 #define	LOGSIZE	256			/* should be power of 2 to avoid div below */  macro
704 } logtab[LOGSIZE];
743 	logi = (i + 1) % LOGSIZE;  in bcmlog()
750 		readi = (readi + 1) % LOGSIZE;  in bcmlog()
755 		readi = readi % LOGSIZE;  in bcmlog()
788 	logi = (i + 1) % LOGSIZE;  in bcmstats()
798 		readi = (readi + 1) % LOGSIZE;  in bcmstats()
802 		readi = readi % LOGSIZE;  in bcmstats()
824 		num += LOGSIZE;  in bcmdumplog()
828 	for (j = 0; j < num && (buf < limit); readi = (readi + 1) % LOGSIZE, j++) {  in bcmdumplog()
853 		i = ((i > 0) && (i < (LOGSIZE - 1))) ? i : (LOGSIZE - 1);  in bcmdumplogent()
854 		return ((logi - i) % LOGSIZE);  in bcmdumplogent()
859 	ASSERT(i < LOGSIZE);  in bcmdumplogent()
865 	for (; (i != logi) && !hit; i = (i + 1) % LOGSIZE) {  in bcmdumplogent()
868 		buf += snprintf(buf, LOGSIZE, "%d: %d\t", i, logtab[i].cycles);  in bcmdumplogent()
869 		buf += snprintf(buf, LOGSIZE, logtab[i].fmt, logtab[i].a1, logtab[i].a2);  in bcmdumplogent()
870 		buf += snprintf(buf, LOGSIZE, "\n");  in bcmdumplogent()
920 	logi = (i + 1) % LOGSIZE;  in bcmtslog()
945 		num += LOGSIZE;  in bcmprinttslogs()
948 	for (j = 0; j < num; readi = (readi + 1) % LOGSIZE, j++) {  in bcmprinttslogs()
979 		num += LOGSIZE;  in bcmdumptslog()
982 	for (j = 0; j < num && (BCMSTRBUF_BUF(b) < limit); readi = (readi + 1) % LOGSIZE, j++) {  in bcmdumptslog()