Lines Matching defs:P1
283 * If both P1 and P2 are infinity, then z1 == 0 and z2 == 0, implying that
285 * If either of P1 or P2 is infinity, but not both, then z3 == 0, which is
288 * -- if s1 == s2 then P1 and/or P2 is infinity, or P1 == P2
289 * -- if s1 != s2 then P1 + P2 == infinity (but neither P1 or P2 is infinity)
292 * -- P1 = 0 and P2 != 0
293 * -- P1 != 0 and P2 = 0
294 * -- P1 = P2
309 * This allows us to detect the "P1 == P2" case, assuming that P1 != 0 and
313 * -- Otherwise, if the returned flag is 1, then P1+P2 = 0, and the result
315 * -- Otherwise (result is infinity, flag is 0), then P1 = P2 and we should
384 * -- Coordinates x and y have been freshly decoded in P1 (but not
453 run_code(jacobian *P1, const jacobian *P2,
465 memcpy(t[P1x], P1->c, 3 * I15_LEN * sizeof(uint16_t));
517 memcpy(P1->c, t[P1x], 3 * I15_LEN * sizeof(uint16_t));
546 point_add(jacobian *P1, const jacobian *P2, const curve_params *cc)
548 return run_code(P1, P2, cc, code_add);