129 static const u16 gf128mul_table_le[256] = gf128mul_dat(xda_le);
130 static const u16 gf128mul_table_be[256] = gf128mul_dat(xda_be);
266 /*      This version uses 64k bytes of table space.
270     the 256 16 byte values that result from the 256 values
283 	int i, j, k;  in gf128mul_init_64k_bbe()  local
303 		for (j = 2; j < 256; j += j)  in gf128mul_init_64k_bbe()
304 			for (k = 1; k < j; ++k)  in gf128mul_init_64k_bbe()
305 				be128_xor(&t->t[i]->t[j + k],  in gf128mul_init_64k_bbe()
306 					  &t->t[i]->t[j], &t->t[i]->t[k]);  in gf128mul_init_64k_bbe()
345 /*      This version uses 4k bytes of table space.
348     single byte, we can construct a table of the 256 16 byte
349     values that result from the 256 values of this byte.
364 	int j, k;  in gf128mul_init_4k_lle()  local
374 	for (j = 2; j < 256; j += j)  in gf128mul_init_4k_lle()
375 		for (k = 1; k < j; ++k)  in gf128mul_init_4k_lle()
376 			be128_xor(&t->t[j + k], &t->t[j], &t->t[k]);  in gf128mul_init_4k_lle()
386 	int j, k;  in gf128mul_init_4k_bbe()  local
396 	for (j = 2; j < 256; j += j)  in gf128mul_init_4k_bbe()
397 		for (k = 1; k < j; ++k)  in gf128mul_init_4k_bbe()
398 			be128_xor(&t->t[j + k], &t->t[j], &t->t[k]);  in gf128mul_init_4k_bbe()