Lines Matching defs:sign
234 int sign;
274 sign = -1;
278 * -sign*X*a == B (mod |n|),
279 * sign*Y*a == A (mod |n|).
292 * (1) -sign*X*a == B (mod |n|),
293 * (2) sign*Y*a == A (mod |n|) */
347 * (1) -sign*X*a == B (mod |n|),
348 * (2) sign*Y*a == A (mod |n|),
352 /* -sign*(X + Y)*a == B - A (mod |n|) */
362 /* sign*(X + Y)*a == A - B (mod |n|) */
380 * (*) -sign*X*a == B (mod |n|),
381 * sign*Y*a == A (mod |n|) */
438 * (**) sign*Y*a == D*B + M (mod |n|). */
449 * sign*Y*a == D*A + B (mod |n|),
451 * sign*Y*a - D*A == B (mod |n|).
453 * -sign*X*a == A (mod |n|).
456 * sign*Y*a + D*sign*X*a == B (mod |n|),
458 * sign*(Y + D*X)*a == B (mod |n|).
460 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
461 * -sign*X*a == B (mod |n|),
462 * sign*Y*a == A (mod |n|).
499 sign = -sign;
506 * sign*Y*a == A (mod |n|),
509 if (sign < 0) {
557 int sign;
598 sign = -1;
602 * -sign*X*a == B (mod |n|),
603 * sign*Y*a == A (mod |n|).
611 * (*) -sign*X*a == B (mod |n|),
612 * sign*Y*a == A (mod |n|)
629 * (**) sign*Y*a == D*B + M (mod |n|).
641 * sign*Y*a == D*A + B (mod |n|),
643 * sign*Y*a - D*A == B (mod |n|).
645 * -sign*X*a == A (mod |n|).
648 * sign*Y*a + D*sign*X*a == B (mod |n|),
650 * sign*(Y + D*X)*a == B (mod |n|).
652 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
653 * -sign*X*a == B (mod |n|),
654 * sign*Y*a == A (mod |n|).
668 sign = -sign;
675 * sign*Y*a == A (mod |n|),
679 if (sign < 0) {
