Lines Matching +full:0 +full:ms
66 * are left and the lsb's are right. char b[16] is an array and b[0] is
70 * b[0] b[1] b[2] b[3] b[13] b[14] b[15]
76 * like 11100001 00000000 .... 00000000 = { 0xE1, 0x00, }.
83 * b[15] = 0x87 and the rest is 0. LRW uses this convention and bbe
92 * primitive polynomial is b[0] = 0x87.
105 * MS x[0] LS MS x[1] LS
106 * ms ls ms ls ms ls ms ls ms ls ms ls ms ls ms ls
109 * MS x[2] LS MS x[3] LS
110 * ms ls ms ls ms ls ms ls ms ls ms ls ms ls ms ls
115 * MS x[0] LS MS x[1] LS
116 * ms ls ms ls ms ls ms ls ms ls ms ls ms ls ms ls
119 * MS x[2] LS MS x[3] LS
120 * ms ls ms ls ms ls ms ls ms ls ms ls ms ls ms ls
141 MS x[0] LS MS x[1] LS
142 ms ls ms ls ms ls ms ls ms ls ms ls ms ls ms ls
145 MS x[2] LS MS x[3] LS
146 ms ls ms ls ms ls ms ls ms ls ms ls ms ls ms ls
152 MS x[0] LS MS x[1] LS
153 ms ls ms ls ms ls ms ls ms ls ms ls ms ls ms ls
156 MS x[2] LS MS x[3] LS
157 ms ls ms ls ms ls ms ls ms ls ms ls ms ls ms ls
178 /* a constant-time version of 'x & ((u64)1 << which) ? (u64)-1 : 0' */ in gf128mul_mask_from_bit()
187 /* equivalent to gf128mul_table_le[(b << 7) & 0xff] << 48 in gf128mul_x_lle()
189 u64 _tt = gf128mul_mask_from_bit(b, 0) & ((u64)0xe1 << 56); in gf128mul_x_lle()
201 u64 _tt = gf128mul_mask_from_bit(a, 63) & 0x87; in gf128mul_x_bbe()
214 u64 _tt = gf128mul_mask_from_bit(a, 63) & 0x87; in gf128mul_x_ble()