Lines Matching refs:blen

176 				int blen, int secs, u32 num_mb)  in test_mb_aead_jiffies()  argument
195 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_aead_jiffies()
203 int blen, u32 num_mb) in test_mb_aead_cycles() argument
236 (cycles + 4) / (8 * num_mb), blen); in test_mb_aead_cycles()
454 int blen, int secs) in test_aead_jiffies() argument
472 bcount, secs, (u64)bcount * blen); in test_aead_jiffies()
476 static int test_aead_cycles(struct aead_request *req, int enc, int blen) in test_aead_cycles() argument
513 (cycles + 4) / 8, blen); in test_aead_cycles()
751 static int test_mb_ahash_jiffies(struct test_mb_ahash_data *data, int blen, in test_mb_ahash_jiffies() argument
771 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_ahash_jiffies()
778 static int test_mb_ahash_cycles(struct test_mb_ahash_data *data, int blen, in test_mb_ahash_cycles() argument
812 (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()
920 static int test_ahash_jiffies_digest(struct ahash_request *req, int blen, in test_ahash_jiffies_digest() argument
935 bcount / secs, ((long)bcount * blen) / secs); in test_ahash_jiffies_digest()
940 static int test_ahash_jiffies(struct ahash_request *req, int blen, in test_ahash_jiffies() argument
947 if (plen == blen) in test_ahash_jiffies()
948 return test_ahash_jiffies_digest(req, blen, out, secs); in test_ahash_jiffies()
955 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_jiffies()
967 bcount / secs, ((long)bcount * blen) / secs); in test_ahash_jiffies()
972 static int test_ahash_cycles_digest(struct ahash_request *req, int blen, in test_ahash_cycles_digest() argument
1005 cycles / 8, cycles / (8 * blen)); in test_ahash_cycles_digest()
1010 static int test_ahash_cycles(struct ahash_request *req, int blen, in test_ahash_cycles() argument
1016 if (plen == blen) in test_ahash_cycles()
1017 return test_ahash_cycles_digest(req, blen, out); in test_ahash_cycles()
1024 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_cycles()
1043 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_cycles()
1062 cycles / 8, cycles / (8 * blen)); in test_ahash_cycles()
1108 for (i = 0; speed[i].blen != 0; i++) { in test_ahash_speed_common()
1109 if (speed[i].blen > TVMEMSIZE * PAGE_SIZE) { in test_ahash_speed_common()
1111 speed[i].blen, TVMEMSIZE * PAGE_SIZE); in test_ahash_speed_common()
1120 i, speed[i].blen, speed[i].plen, speed[i].blen / speed[i].plen); in test_ahash_speed_common()
1125 ret = test_ahash_jiffies(req, speed[i].blen, in test_ahash_speed_common()
1129 ret = test_ahash_cycles(req, speed[i].blen, in test_ahash_speed_common()
1194 int blen, int secs, u32 num_mb) in test_mb_acipher_jiffies() argument
1213 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_acipher_jiffies()
1221 int blen, u32 num_mb) in test_mb_acipher_cycles() argument
1254 (cycles + 4) / (8 * num_mb), blen); in test_mb_acipher_cycles()
1423 int blen, int secs) in test_acipher_jiffies() argument
1443 bcount, secs, (u64)bcount * blen); in test_acipher_jiffies()
1448 int blen) in test_acipher_cycles() argument
1489 (cycles + 4) / 8, blen); in test_acipher_cycles()