Lines Matching defs:num

145   signed char *num;
158 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
171 void bc_num_free(void *num);
576 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
1143   n->num[0] = 1;
1149   n->num[0] = 0;
1150   n->num[1] = 1;
1205     max_num = a->num + diff;
1206     min_num = b->num;
1210     max_num = b->num + diff;
1211     min_num = a->num;
1225   while (n->len && !n->num[n->len - 1]) --n->len;
1238     memmove(n->num, n->num + places, n->len);
1251   memmove(n->num + places, n->num, n->len);
1252   memset(n->num, 0, places);
1276     memcpy(b->num, n->num + idx, b->len);
1277     memcpy(a->num, n->num, idx);
1306   signed char num[2];
1309   one.num = num;
1315 static unsigned int bc_num_addDigit(signed char *num, unsigned int d, unsigned int c)
1318   *num = d % 10;
1347     ptr = a->num;
1348     ptr_a = a->num + diff;
1349     ptr_b = b->num;
1353     ptr = b->num;
1354     ptr_a = a->num;
1355     ptr_b = b->num + diff;
1358   for (ptr_c = c->num, i = 0; i < diff; ++i) ptr_c[i] = ptr[i];
1386   if (carry) c->num[c->len++] = carry;
1447   s = bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1481     ptr_c = c->num;
1493         in += ((unsigned int) a->num[j]) * ((unsigned int) b->num[i]);
1586     memset(c->num + c->len, 0, c->cap - c->len);
1632     for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1639   cp.num[cp.len++] = 0;
1644   memset(c->num + end, 0, c->cap - end);
1647   p = b->num;
1650     n = cp.num + i;
1653     c->num[i] = q;
1785   for (zero = 1, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
1949     bc_num_printHex((size_t) n->num[i], 1, i == rdx);
2041 void bc_num_setup(BcNum *n, signed char *num, size_t cap) {
2042   n->num = num;
2056     n->num = xrealloc(n->num, req);
2061 void bc_num_free(void *num) {
2062   free(((BcNum*) num)->num);
2071   memcpy(d->num, s->num, d->len);
2113           n->num[n->len] = c - '0';
2138     r = prev + ((uchar) n->num[--i]);
2160   for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
2230   half.num[0] = 5;
2244     if (pow & 1) x0->num[0] = 2;
2245     else x0->num[0] = 6;
4542 static BcStatus bc_program_num(BcProgram *p, BcResult *r, BcNum **num) {
4572       *num = n;
4592         *num = bc_vec_item(v, idx);
4594       else *num = bc_vec_top(v);
4601       *num = &p->last;
4607       *num = &p->one;
4882   BcNum *num = NULL;
4884   s = bc_program_prep(p, &ptr, &num);
4887   bc_num_init(&res.d.n, num->len);
4888   bc_program_unarys[inst - BC_INST_NEG](&res, num);
5076   BcNum *num = NULL;
5089     s = bc_program_prep(p, &operand, &num);
5091     s = bc_num_ulong(num, &temp);
5112   BcNum *num = NULL;
5115   s = bc_program_prep(p, &ptr, &num);
5120     bc_num_createCopy(&copy.d.n, num);
5213     BcNum *num = NULL;
5216     s = bc_program_operand(p, &operand, &num, 0);
5219     bc_num_createCopy(&res.d.n, num);
5251   for (i = n->len - 1; i < n->len && !n->num[i]; --len, --i);
5261   BcNum *num = NULL, *resn = &res.d.n;
5264   s = bc_program_operand(p, &opnd, &num, 0);
5267   if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, resn, p->scale);
5269     bc_num_createCopy(resn, num);
5278         val = (unsigned long) ((BcVec*) num)->len;
5279       else val = bc_program_len(num);
5281     else val = bc_program_scale(num);
5416   BcNum *num;
5426         s = bc_program_prep(p, &ptr, &num);
5428         cond = !BC_NUM_CMP_ZERO(num);