144 gen_digest(const void *buff, size_t len)  in gen_digest()  argument
146 	const uint8_t *bp = (const uint8_t *) buff;  in gen_digest()
568 init_sernum(sernum_buffer_t *buff)  in init_sernum()  argument
571 	buff->bottom = 0;  in init_sernum()
572 	buff->top = 0;  in init_sernum()
573 	buff->next_sn = 0;  in init_sernum()
574 	buff->ExpSN = 0;  in init_sernum()
598 add_sernum(sernum_buffer_t *buff, uint32_t num)  in add_sernum()  argument
607 	n = buff->next_sn;  in add_sernum()
614 	buff->next_sn = num + 1;  in add_sernum()
615 	t = buff->top;  in add_sernum()
616 	b = buff->bottom;  in add_sernum()
619 		buff->sernum[t] = n++;  in add_sernum()
620 		buff->ack[t] = false;  in add_sernum()
628 	buff->top = t;  in add_sernum()
630 			 b, buff->sernum[b], buff->top, num, diff));  in add_sernum()
650 ack_sernum(sernum_buffer_t *buff, uint32_t num)  in ack_sernum()  argument
652 	int b = buff->bottom;  in ack_sernum()
653 	int t = buff->top;  in ack_sernum()
656 	if (t == (b + 1) && num == buff->sernum[b]) {  in ack_sernum()
658 		buff->top = b;  in ack_sernum()
661 			if (!sn_a_lt_b(buff->sernum[b], num))  in ack_sernum()
664 		if (num == buff->sernum[b]) {  in ack_sernum()
665 			if (b == buff->bottom)  in ack_sernum()
666 				buff->bottom = (b + 1) % SERNUM_BUFFER_LENGTH;  in ack_sernum()
668 				buff->ack[b] = true;  in ack_sernum()
671 		for (b = buff->bottom, num = buff->sernum[b] - 1;  in ack_sernum()
672 			 b != t && buff->ack[b]; b = (b + 1) % SERNUM_BUFFER_LENGTH) {  in ack_sernum()
673 			num = buff->sernum[b];  in ack_sernum()
677 	if (!sn_a_lt_b(num, buff->ExpSN))  in ack_sernum()
678 		buff->ExpSN = num + 1;  in ack_sernum()
681 			 buff->bottom, buff->top, num, buff->ExpSN));  in ack_sernum()
683 	return buff->ExpSN;  in ack_sernum()