Lines Matching refs:blen
184 int blen, int secs, u32 num_mb) in test_mb_aead_jiffies() argument
203 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_aead_jiffies()
211 int blen, u32 num_mb) in test_mb_aead_cycles() argument
244 (cycles + 4) / (8 * num_mb), blen); in test_mb_aead_cycles()
462 int blen, int secs) in test_aead_jiffies() argument
480 bcount, secs, (u64)bcount * blen); in test_aead_jiffies()
484 static int test_aead_cycles(struct aead_request *req, int enc, int blen) in test_aead_cycles() argument
521 (cycles + 4) / 8, blen); in test_aead_cycles()
757 static int test_mb_ahash_jiffies(struct test_mb_ahash_data *data, int blen, in test_mb_ahash_jiffies() argument
777 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_ahash_jiffies()
784 static int test_mb_ahash_cycles(struct test_mb_ahash_data *data, int blen, in test_mb_ahash_cycles() argument
818 (cycles + 4) / (8 * num_mb), blen); in test_mb_ahash_cycles()
870 for (i = 0; speed[i].blen != 0; i++) { in test_mb_ahash_speed()
872 if (speed[i].blen != speed[i].plen) in test_mb_ahash_speed()
875 if (speed[i].blen > XBUFSIZE * PAGE_SIZE) { in test_mb_ahash_speed()
877 speed[i].blen, XBUFSIZE * PAGE_SIZE); in test_mb_ahash_speed()
886 data[k].result, speed[i].blen); in test_mb_ahash_speed()
890 i, speed[i].blen, speed[i].plen, in test_mb_ahash_speed()
891 speed[i].blen / speed[i].plen); in test_mb_ahash_speed()
894 ret = test_mb_ahash_jiffies(data, speed[i].blen, secs, in test_mb_ahash_speed()
898 ret = test_mb_ahash_cycles(data, speed[i].blen, num_mb); in test_mb_ahash_speed()
921 static int test_ahash_jiffies_digest(struct ahash_request *req, int blen, in test_ahash_jiffies_digest() argument
936 bcount / secs, ((long)bcount * blen) / secs); in test_ahash_jiffies_digest()
941 static int test_ahash_jiffies(struct ahash_request *req, int blen, in test_ahash_jiffies() argument
948 if (plen == blen) in test_ahash_jiffies()
949 return test_ahash_jiffies_digest(req, blen, out, secs); in test_ahash_jiffies()
956 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_jiffies()
968 bcount / secs, ((long)bcount * blen) / secs); in test_ahash_jiffies()
973 static int test_ahash_cycles_digest(struct ahash_request *req, int blen, in test_ahash_cycles_digest() argument
1006 cycles / 8, cycles / (8 * blen)); in test_ahash_cycles_digest()
1011 static int test_ahash_cycles(struct ahash_request *req, int blen, in test_ahash_cycles() argument
1017 if (plen == blen) in test_ahash_cycles()
1018 return test_ahash_cycles_digest(req, blen, out); in test_ahash_cycles()
1025 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_cycles()
1044 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_cycles()
1063 cycles / 8, cycles / (8 * blen)); in test_ahash_cycles()
1109 for (i = 0; speed[i].blen != 0; i++) { in test_ahash_speed_common()
1110 if (speed[i].blen > TVMEMSIZE * PAGE_SIZE) { in test_ahash_speed_common()
1112 speed[i].blen, TVMEMSIZE * PAGE_SIZE); in test_ahash_speed_common()
1121 i, speed[i].blen, speed[i].plen, speed[i].blen / speed[i].plen); in test_ahash_speed_common()
1126 ret = test_ahash_jiffies(req, speed[i].blen, in test_ahash_speed_common()
1130 ret = test_ahash_cycles(req, speed[i].blen, in test_ahash_speed_common()
1195 int blen, int secs, u32 num_mb) in test_mb_acipher_jiffies() argument
1214 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_acipher_jiffies()
1222 int blen, u32 num_mb) in test_mb_acipher_cycles() argument
1255 (cycles + 4) / (8 * num_mb), blen); in test_mb_acipher_cycles()
1434 int blen, int secs) in test_acipher_jiffies() argument
1454 bcount, secs, (u64)bcount * blen); in test_acipher_jiffies()
1459 int blen) in test_acipher_cycles() argument
1500 (cycles + 4) / 8, blen); in test_acipher_cycles()