Lines Matching defs:sign
233 int sign;
271 sign = -1;
275 * -sign*X*a == B (mod |n|),
276 * sign*Y*a == A (mod |n|).
289 * (1) -sign*X*a == B (mod |n|),
290 * (2) sign*Y*a == A (mod |n|) */
344 * (1) -sign*X*a == B (mod |n|),
345 * (2) sign*Y*a == A (mod |n|),
349 /* -sign*(X + Y)*a == B - A (mod |n|) */
359 /* sign*(X + Y)*a == A - B (mod |n|) */
377 * (*) -sign*X*a == B (mod |n|),
378 * sign*Y*a == A (mod |n|) */
435 * (**) sign*Y*a == D*B + M (mod |n|). */
446 * sign*Y*a == D*A + B (mod |n|),
448 * sign*Y*a - D*A == B (mod |n|).
450 * -sign*X*a == A (mod |n|).
453 * sign*Y*a + D*sign*X*a == B (mod |n|),
455 * sign*(Y + D*X)*a == B (mod |n|).
457 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
458 * -sign*X*a == B (mod |n|),
459 * sign*Y*a == A (mod |n|).
496 sign = -sign;
503 * sign*Y*a == A (mod |n|),
506 if (sign < 0) {
546 int sign;
585 sign = -1;
589 * -sign*X*a == B (mod |n|),
590 * sign*Y*a == A (mod |n|).
598 * (*) -sign*X*a == B (mod |n|),
599 * sign*Y*a == A (mod |n|)
616 * (**) sign*Y*a == D*B + M (mod |n|).
628 * sign*Y*a == D*A + B (mod |n|),
630 * sign*Y*a - D*A == B (mod |n|).
632 * -sign*X*a == A (mod |n|).
635 * sign*Y*a + D*sign*X*a == B (mod |n|),
637 * sign*(Y + D*X)*a == B (mod |n|).
639 * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at
640 * -sign*X*a == B (mod |n|),
641 * sign*Y*a == A (mod |n|).
655 sign = -sign;
662 * sign*Y*a == A (mod |n|),
666 if (sign < 0) {
