Lines Matching full:blen

184 				int blen, int secs, u32 num_mb)  in test_mb_aead_jiffies()  argument
203 bcount * num_mb, secs, (long)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()
455 int blen, int secs) in test_aead_jiffies() argument
473 bcount, secs, (long)bcount * blen); in test_aead_jiffies()
477 static int test_aead_cycles(struct aead_request *req, int enc, int blen) in test_aead_cycles() argument
514 (cycles + 4) / 8, blen); in test_aead_cycles()
744 static int test_mb_ahash_jiffies(struct test_mb_ahash_data *data, int blen, in test_mb_ahash_jiffies() argument
764 bcount * num_mb, secs, (long)bcount * blen * num_mb); in test_mb_ahash_jiffies()
771 static int test_mb_ahash_cycles(struct test_mb_ahash_data *data, int blen, in test_mb_ahash_cycles() argument
805 (cycles + 4) / (8 * num_mb), blen); in test_mb_ahash_cycles()
857 for (i = 0; speed[i].blen != 0; i++) { in test_mb_ahash_speed()
859 if (speed[i].blen != speed[i].plen) in test_mb_ahash_speed()
862 if (speed[i].blen > XBUFSIZE * PAGE_SIZE) { in test_mb_ahash_speed()
864 speed[i].blen, XBUFSIZE * PAGE_SIZE); in test_mb_ahash_speed()
873 data[k].result, speed[i].blen); in test_mb_ahash_speed()
877 i, speed[i].blen, speed[i].plen, in test_mb_ahash_speed()
878 speed[i].blen / speed[i].plen); in test_mb_ahash_speed()
881 ret = test_mb_ahash_jiffies(data, speed[i].blen, secs, in test_mb_ahash_speed()
885 ret = test_mb_ahash_cycles(data, speed[i].blen, num_mb); in test_mb_ahash_speed()
908 static int test_ahash_jiffies_digest(struct ahash_request *req, int blen, in test_ahash_jiffies_digest() argument
923 bcount / secs, ((long)bcount * blen) / secs); in test_ahash_jiffies_digest()
928 static int test_ahash_jiffies(struct ahash_request *req, int blen, in test_ahash_jiffies() argument
935 if (plen == blen) in test_ahash_jiffies()
936 return test_ahash_jiffies_digest(req, blen, out, secs); in test_ahash_jiffies()
943 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_jiffies()
955 bcount / secs, ((long)bcount * blen) / secs); in test_ahash_jiffies()
960 static int test_ahash_cycles_digest(struct ahash_request *req, int blen, in test_ahash_cycles_digest() argument
993 cycles / 8, cycles / (8 * blen)); in test_ahash_cycles_digest()
998 static int test_ahash_cycles(struct ahash_request *req, int blen, in test_ahash_cycles() argument
1004 if (plen == blen) in test_ahash_cycles()
1005 return test_ahash_cycles_digest(req, blen, out); in test_ahash_cycles()
1012 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_cycles()
1031 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_cycles()
1050 cycles / 8, cycles / (8 * blen)); in test_ahash_cycles()
1096 for (i = 0; speed[i].blen != 0; i++) { in test_ahash_speed_common()
1097 if (speed[i].blen > TVMEMSIZE * PAGE_SIZE) { in test_ahash_speed_common()
1099 speed[i].blen, TVMEMSIZE * PAGE_SIZE); in test_ahash_speed_common()
1108 i, speed[i].blen, speed[i].plen, speed[i].blen / speed[i].plen); in test_ahash_speed_common()
1113 ret = test_ahash_jiffies(req, speed[i].blen, in test_ahash_speed_common()
1117 ret = test_ahash_cycles(req, speed[i].blen, in test_ahash_speed_common()
1182 int blen, int secs, u32 num_mb) in test_mb_acipher_jiffies() argument
1201 bcount * num_mb, secs, (long)bcount * blen * num_mb); in test_mb_acipher_jiffies()
1209 int blen, u32 num_mb) in test_mb_acipher_cycles() argument
1242 (cycles + 4) / (8 * num_mb), blen); in test_mb_acipher_cycles()
1419 int blen, int secs) in test_acipher_jiffies() argument
1439 bcount, secs, (long)bcount * blen); in test_acipher_jiffies()
1444 int blen) in test_acipher_cycles() argument
1485 (cycles + 4) / 8, blen); in test_acipher_cycles()