Searched refs:n2 (Results 1 – 1 of 1) sorted by relevance
240 { uint8_t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0; in gf_inv() local248 while(n2 >= n1) /* divide polynomial p2 by p1 */ in gf_inv()250 n2 /= n1; /* shift smaller polynomial left */ in gf_inv()251 p2 ^= (p1 * n2) & 0xff; /* and remove from larger one */ in gf_inv()252 v2 ^= (v1 * n2); /* shift accumulated value and */ in gf_inv()253 n2 = hibit(p2); /* add into result */ in gf_inv()258 if(n2) /* repeat with values swapped */ in gf_inv()259 while(n1 >= n2) in gf_inv()261 n1 /= n2; in gf_inv()
