Lines Matching refs:i
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;
282 …$value[$i] = (int)($sum - static::BASE_FULL * $temp); // eg. a faster alternative to fmod($sum, 0x…
287 $sum = $x_value[$i] + $y_value[$i] + $carry;
289 $value[$i] = $carry ? $sum - static::BASE_FULL : $sum;
290 ++$i; // ie. let $i = $j since we've just done $value[$i]
294 for (; $value[$i] == static::MAX_DIGIT; ++$i) {
295 $value[$i] = 0;
297 ++$value[$i];
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;
372 $x_value[$i] = (int)($sum - static::BASE_FULL * $temp);
377 $sum = $x_value[$i] - $y_value[$i] - $carry;
379 $x_value[$i] = $carry ? $sum + static::BASE_FULL : $sum;
380 ++$i;
384 for (; !$x_value[$i]; ++$i) {
385 $x_value[$i] = static::MAX_DIGIT;
387 --$x_value[$i];
510 for ($i = 1; $i < $y_length; ++$i) {
513 for ($j = 0, $k = $i; $j < $x_length; ++$j, ++$k) {
514 $temp = $product_value[$k] + $x_value[$j] * $y_value[$i] + $carry;
614 for ($i = $x_max; $i >= $y_max + 1; --$i) {
617 isset($x_value[$i]) ? $x_value[$i] : 0,
618 isset($x_value[$i - 1]) ? $x_value[$i - 1] : 0,
619 isset($x_value[$i - 2]) ? $x_value[$i - 2] : 0
626 $q_index = $i - $y_max - 1;
698 for ($i = count($dividend) - 1; $i >= 0; --$i) {
699 $temp = static::BASE_FULL * $carry + $dividend[$i];
700 $result[$i] = self::safe_divide($temp, $divisor);
701 $carry = (int)($temp - $divisor * $result[$i]);
771 for ($i = 0; $i < $length; ++$i) {
772 $value[$i] = $value[$i] & $result->bitmask->value[$i];
807 for ($i = count($x_value) - 1; $i >= 0; --$i) {
808 if ($x_value[$i] != $y_value[$i]) {
809 return ($x_value[$i] > $y_value[$i]) ? $result : -$result;
839 for ($i = count($value) - 1; $i >= 0; --$i) {
840 if ($value[$i]) {
843 unset($value[$i]);
930 for ($i = 0; $i < count($this->value); ++$i) {
931 $temp = $this->value[$i] * $shift + $carry;
933 $this->value[$i] = (int)($temp - $carry * static::BASE_FULL);
969 for ($i = count($this->value) - 1; $i >= 0; --$i) {
970 $temp = $this->value[$i] >> $shift | $carry;
971 $carry = ($this->value[$i] & $carry_mask) << $carry_shift;
972 $this->value[$i] = $temp;
1025 for ($i = 0, $max_index = count($value) - 1; $i <= $max_index; ++$i) {
1026 $i2 = $i << 1;
1028 $temp = $square_value[$i2] + $value[$i] * $value[$i];
1033 for ($j = $i + 1, $k = $i2 + 1; $j <= $max_index; ++$j, ++$k) {
1034 $temp = $square_value[$k] + 2 * $value[$j] * $value[$i] + $carry;
1041 $square_value[$i + $max_index + 1] = $carry;
1136 for ($i = 0, $r_length = count($r_value); $i < $r_length; ++$i) {
1137 $temp = ~$r_value[$i] & static::MAX_DIGIT;
1144 $s = static::BASE * $i + $j;
1249 $i = $overflow = 0;
1251 while ($i < $len) {
1254 $digit = array_slice($val, $i, $width);
1255 $i += $width;
1259 $temp = isset($val[$i]) ? $val[$i] : 0;
1266 $digit = array_slice($val, $i, $tempwidth);
1267 $i += $tempwidth;
1271 $temp = isset($val[$i]) ? $val[$i] : 0;
1304 $i = $overflow = 0;
1308 while ($i != $len) {
1309 $digit = $val[$i] & $mask;
1310 $val[$i] >>= $split;
1316 $i++;
1320 } elseif (++$i != $len) {
1322 $digit |= ($val[$i] & $tempmask) << $remaining;
1323 $val[$i] >>= $overflow;