Lines Matching refs:blen
183 int blen, int secs, u32 num_mb) in test_mb_aead_jiffies() argument
202 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_aead_jiffies()
210 int blen, u32 num_mb) in test_mb_aead_cycles() argument
243 (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()
743 static int test_mb_ahash_jiffies(struct test_mb_ahash_data *data, int blen, in test_mb_ahash_jiffies() argument
763 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_ahash_jiffies()
770 static int test_mb_ahash_cycles(struct test_mb_ahash_data *data, int blen, in test_mb_ahash_cycles() argument
804 (cycles + 4) / (8 * num_mb), blen); in test_mb_ahash_cycles()
856 for (i = 0; speed[i].blen != 0; i++) { in test_mb_ahash_speed()
858 if (speed[i].blen != speed[i].plen) in test_mb_ahash_speed()
861 if (speed[i].blen > XBUFSIZE * PAGE_SIZE) { in test_mb_ahash_speed()
863 speed[i].blen, XBUFSIZE * PAGE_SIZE); in test_mb_ahash_speed()
872 data[k].result, speed[i].blen); in test_mb_ahash_speed()
876 i, speed[i].blen, speed[i].plen, in test_mb_ahash_speed()
877 speed[i].blen / speed[i].plen); in test_mb_ahash_speed()
880 ret = test_mb_ahash_jiffies(data, speed[i].blen, secs, in test_mb_ahash_speed()
884 ret = test_mb_ahash_cycles(data, speed[i].blen, num_mb); in test_mb_ahash_speed()
907 static int test_ahash_jiffies_digest(struct ahash_request *req, int blen, in test_ahash_jiffies_digest() argument
922 bcount / secs, ((long)bcount * blen) / secs); in test_ahash_jiffies_digest()
927 static int test_ahash_jiffies(struct ahash_request *req, int blen, in test_ahash_jiffies() argument
934 if (plen == blen) in test_ahash_jiffies()
935 return test_ahash_jiffies_digest(req, blen, out, secs); in test_ahash_jiffies()
942 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_jiffies()
954 bcount / secs, ((long)bcount * blen) / secs); in test_ahash_jiffies()
959 static int test_ahash_cycles_digest(struct ahash_request *req, int blen, in test_ahash_cycles_digest() argument
992 cycles / 8, cycles / (8 * blen)); in test_ahash_cycles_digest()
997 static int test_ahash_cycles(struct ahash_request *req, int blen, in test_ahash_cycles() argument
1003 if (plen == blen) in test_ahash_cycles()
1004 return test_ahash_cycles_digest(req, blen, out); in test_ahash_cycles()
1011 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_cycles()
1030 for (pcount = 0; pcount < blen; pcount += plen) { in test_ahash_cycles()
1049 cycles / 8, cycles / (8 * blen)); in test_ahash_cycles()
1095 for (i = 0; speed[i].blen != 0; i++) { in test_ahash_speed_common()
1096 if (speed[i].blen > TVMEMSIZE * PAGE_SIZE) { in test_ahash_speed_common()
1098 speed[i].blen, TVMEMSIZE * PAGE_SIZE); in test_ahash_speed_common()
1107 i, speed[i].blen, speed[i].plen, speed[i].blen / speed[i].plen); in test_ahash_speed_common()
1112 ret = test_ahash_jiffies(req, speed[i].blen, in test_ahash_speed_common()
1116 ret = test_ahash_cycles(req, speed[i].blen, in test_ahash_speed_common()
1181 int blen, int secs, u32 num_mb) in test_mb_acipher_jiffies() argument
1200 bcount * num_mb, secs, (u64)bcount * blen * num_mb); in test_mb_acipher_jiffies()
1208 int blen, u32 num_mb) in test_mb_acipher_cycles() argument
1241 (cycles + 4) / (8 * num_mb), blen); in test_mb_acipher_cycles()
1409 int blen, int secs) in test_acipher_jiffies() argument
1429 bcount, secs, (u64)bcount * blen); in test_acipher_jiffies()
1434 int blen) in test_acipher_cycles() argument
1475 (cycles + 4) / 8, blen); in test_acipher_cycles()