Lines Matching refs:n2ptr
158 char *n1ptr, *n2ptr;
195 n2ptr = n2->n_value;
197 while ((count > 0) && (*n1ptr == *n2ptr))
200 n2ptr++;
207 if (*n1ptr > *n2ptr)
243 if (*n2ptr++ != 0)
343 char *n1ptr, *n2ptr, *sumptr;
364 n2ptr = (char *) (n2->n_value + n2->n_len + n2bytes - 1);
375 { *sumptr-- = *n2ptr--; n2bytes--;}
384 *sumptr = *n1ptr-- + *n2ptr-- + carry;
399 { n1bytes = n2bytes; n1ptr = n2ptr; }
436 char *n1ptr, *n2ptr, *diffptr;
456 n2ptr = (char *) (n2->n_value + n2->n_len + n2->n_scale -1);
474 val = - *n2ptr-- - borrow;
490 val = *n1ptr-- - *n2ptr-- - borrow;
660 char *n1ptr, *n2ptr, *pvptr;
677 n2ptr = (char *) (n2end - MIN(indx, n2len-1));
678 while ((n1ptr >= n1->n_value) && (n2ptr <= n2end))
679 sum += *n1ptr-- * *n2ptr++;
938 unsigned char *ptr1, *ptr2, *n2ptr, *qptr;
967 n2ptr = (unsigned char *) n2->n_value+n2->n_len+scale2-1;
968 while ((scale2 > 0) && (*n2ptr-- == 0)) scale2--;
986 n2ptr = num2;
987 while (*n2ptr == 0)
989 n2ptr++;
1020 norm = 10 / ((int)*n2ptr + 1);
1024 _one_mult (n2ptr, len2, norm, n2ptr);
1038 if (*n2ptr == num1[qdig])
1041 qguess = (num1[qdig]*10 + num1[qdig+1]) / *n2ptr;
1044 if (n2ptr[1]*qguess >
1045 (num1[qdig]*10 + num1[qdig+1] - *n2ptr*qguess)*10
1050 if (n2ptr[1]*qguess >
1051 (num1[qdig]*10 + num1[qdig+1] - *n2ptr*qguess)*10
1061 _one_mult (n2ptr, len2, qguess, mval+1);
1083 ptr2 = (unsigned char *) n2ptr+len2-1;