Lines Matching defs:padlen
1250 size_t padlen, i;
1260 padlen = transform->ivlen - (rec->data_len + 1) % transform->ivlen;
1261 if (padlen == transform->ivlen) {
1262 padlen = 0;
1266 if (post_avail < padlen + 1) {
1271 for (i = 0; i <= padlen; i++) {
1272 data[rec->data_len + i] = (unsigned char) padlen;
1275 rec->data_len += padlen + 1;
1276 post_avail -= padlen + 1;
1309 padlen + 1));
1491 size_t padlen = 0;
1910 padlen = data[rec->data_len - 1];
1915 padlen + 1);
1917 padlen = mbedtls_ct_size_if_else_0(ge, padlen);
1920 if (rec->data_len < transform->maclen + padlen + 1) {
1923 ") + padlen (%" MBEDTLS_PRINTF_SIZET ")",
1926 padlen + 1));
1931 transform->maclen + padlen + 1);
1933 padlen = mbedtls_ct_size_if_else_0(ge, padlen);
1936 padlen++;
1939 * we have data_len >= padlen here. */
1947 * only the last `padlen` bytes for the padding check). */
1953 size_t const padding_idx = rec->data_len - padlen;
1960 * (check[idx] == padlen - 1);
1964 const mbedtls_ct_condition_t b = mbedtls_ct_uint_eq(check[idx], padlen - 1);
1968 correct = mbedtls_ct_bool_and(mbedtls_ct_uint_eq(pad_count, padlen), correct);
1971 if (padlen > 0 && correct == MBEDTLS_CT_FALSE) {
1975 padlen = mbedtls_ct_size_if_else_0(correct, padlen);
1979 /* If the padding was found to be invalid, padlen == 0
1981 * padlen hasn't been changed and the previous assertion
1982 * data_len >= padlen still holds. */
1983 rec->data_len -= padlen;
2005 /* For CBC+MAC, If the initial value of padlen was such that
2006 * data_len < maclen + padlen + 1, then padlen
2012 * If the initial value of padlen was such that
2013 * data_len >= maclen + padlen + 1, then we have
2014 * subtracted either padlen + 1 (if the padding was correct)
2029 * data_len over all padlen values.
2031 * They're independent of padlen, since we previously did
2032 * data_len -= padlen.
2037 const size_t max_len = rec->data_len + padlen;