Lines Matching refs:mres

827     ctx->mres = 0;
971     unsigned int n, ctr, mres;  local
989     mres = ctx->mres;
1002         mres = sizeof(ctx->Xi);
1018     n = mres % 16;
1025                     ctx->Xn[mres++] = *(out++) = *(in++) ^ ctx->EKi.c[n];
1030                     GHASH(ctx, ctx->Xn, mres);
1031                     mres = 0;
1033                     ctx->mres = mres;
1044                     mres = 0;
1046                     ctx->mres = n;
1056             if (len >= 16 && mres) {
1057                 GHASH(ctx, ctx->Xn, mres);
1058                 mres = 0;
1149                     ctx->Xn[mres++] = out[n] = in[n] ^ ctx->EKi.c[n];
1157                 mres = n;
1161             ctx->mres = mres;
1180         ctx->Xn[mres++] = out[i] = in[i] ^ ctx->EKi.c[n];
1182         if (mres == sizeof(ctx->Xn)) {
1184             mres = 0;
1188         mres = n = (n + 1) % 16;
1194     ctx->mres = mres;
1203     unsigned int n, ctr, mres;  local
1221     mres = ctx->mres;
1234         mres = sizeof(ctx->Xi);
1250     n = mres % 16;
1257                     *(out++) = (ctx->Xn[mres++] = *(in++)) ^ ctx->EKi.c[n];
1262                     GHASH(ctx, ctx->Xn, mres);
1263                     mres = 0;
1265                     ctx->mres = mres;
1278                     mres = 0;
1280                     ctx->mres = n;
1290             if (len >= 16 && mres) {
1291                 GHASH(ctx, ctx->Xn, mres);
1292                 mres = 0;
1384                     out[n] = (ctx->Xn[mres++] = in[n]) ^ ctx->EKi.c[n];
1394                 mres = n;
1398             ctx->mres = mres;
1418         out[i] = (ctx->Xn[mres++] = c = in[i]) ^ ctx->EKi.c[n];
1420         if (mres == sizeof(ctx->Xn)) {
1422             mres = 0;
1428         mres = n = (n + 1) % 16;
1434     ctx->mres = mres;
1446     unsigned int n, ctr, mres;
1463     mres = ctx->mres;
1476         mres = sizeof(ctx->Xi);
1492     n = mres % 16;
1496             ctx->Xn[mres++] = *(out++) = *(in++) ^ ctx->EKi.c[n];
1501             GHASH(ctx, ctx->Xn, mres);
1502             mres = 0;
1504             ctx->mres = mres;
1515             mres = 0;
1517             ctx->mres = n;
1523         if (len >= 16 && mres) {
1524             GHASH(ctx, ctx->Xn, mres);
1525             mres = 0;
1586             ctx->Xn[mres++] = out[n] = in[n] ^ ctx->EKi.c[n];
1588             ctx->Xi.c[mres++] ^= out[n] = in[n] ^ ctx->EKi.c[n];
1594     ctx->mres = mres;
1607     unsigned int n, ctr, mres;
1624     mres = ctx->mres;
1637         mres = sizeof(ctx->Xi);
1653     n = mres % 16;
1657             *(out++) = (ctx->Xn[mres++] = *(in++)) ^ ctx->EKi.c[n];
1662             GHASH(ctx, ctx->Xn, mres);
1663             mres = 0;
1665             ctx->mres = mres;
1678             mres = 0;
1680             ctx->mres = n;
1686     if (len >= 16 && mres) {
1687         GHASH(ctx, ctx->Xn, mres);
1688         mres = 0;
1752             out[n] = (ctx->Xn[mres++] = in[n]) ^ ctx->EKi.c[n];
1755             ctx->Xi.c[mres++] ^= c;
1762     ctx->mres = mres;
1783     unsigned int mres = ctx->mres;  local
1785     if (mres) {
1786         unsigned blocks = (mres + 15) & -16;
1788         memset(ctx->Xn + mres, 0, blocks - mres);
1789         mres = blocks;
1790         if (mres == sizeof(ctx->Xn)) {
1791             GHASH(ctx, ctx->Xn, mres);
1792             mres = 0;
1798     if (ctx->mres || ctx->ares)
1820     memcpy(ctx->Xn + mres, &bitlen, sizeof(bitlen));
1821     mres += sizeof(bitlen);
1822     GHASH(ctx, ctx->Xn, mres);