Lines Matching refs:j
274 for ($i = 0, $j = 1; $j < $size; $i += 2, $j += 2) {
276 … $sum = ($x_value[$j] + $y_value[$j]) * static::BASE_FULL + $x_value[$i] + $y_value[$i] + $carry;
283 $value[$j] = $temp;
286 if ($j == $size) { // ie. if $y_size is odd
364 for ($i = 0, $j = 1; $j < $y_size; $i += 2, $j += 2) {
365 … $sum = ($x_value[$j] - $y_value[$j]) * static::BASE_FULL + $x_value[$i] - $y_value[$i] - $carry;
373 $x_value[$j] = $temp;
376 if ($j == $y_size) { // ie. if $y_size is odd
500 for ($j = 0; $j < $x_length; ++$j) { // ie. $i = 0
501 $temp = $x_value[$j] * $y_value[0] + $carry; // $product_value[$k] == 0
503 $product_value[$j] = (int)($temp - static::BASE_FULL * $carry);
506 $product_value[$j] = $carry;
513 for ($j = 0, $k = $i; $j < $x_length; ++$j, ++$k) {
514 $temp = $product_value[$k] + $x_value[$j] * $y_value[$i] + $carry;
1033 for ($j = $i + 1, $k = $i2 + 1; $j <= $max_index; ++$j, ++$k) {
1034 $temp = $square_value[$k] + 2 * $value[$j] * $value[$i] + $carry;
1138 for ($j = 1; ($temp >> $j) & 1; ++$j) {
1140 if ($j <= static::BASE) {
1144 $s = static::BASE * $i + $j;
1275 for ($j = count($digit) - 1; $j >= 0; $j--) {
1276 $temp = $digit[$j] & $mask;
1277 $digit[$j] = ($digit[$j] >> $overflow) | ($newbits << $remaining);