/freebsd/contrib/bc/include/ |
H A D | num.h | 566 bc_num_add(BcNum* a, BcNum* b, BcNum* c, size_t scale); 576 bc_num_sub(BcNum* a, BcNum* b, BcNum* c, size_t scale); 586 bc_num_mul(BcNum* a, BcNum* b, BcNum* c, size_t scale); 596 bc_num_div(BcNum* a, BcNum* b, BcNum* c, size_t scale); 606 bc_num_mod(BcNum* a, BcNum* b, BcNum* c, size_t scale); 616 bc_num_pow(BcNum* a, BcNum* b, BcNum* c, size_t scale); 627 bc_num_places(BcNum* a, BcNum* b, BcNum* c, size_t scale); 637 bc_num_lshift(BcNum* a, BcNum* b, BcNum* c, size_t scale); 647 bc_num_rshift(BcNum* a, BcNum* b, BcNum* c, size_t scale); 669 bc_num_divmod(BcNum* a, BcNum* b, BcNum* c, BcNum* d, size_t scale); [all …]
|
H A D | program.h | 135 BcNum strmb; 139 BcNum asciify; 144 BcNum last; 292 typedef void (*BcProgramUnary)(BcResult* r, BcNum* n); 401 bc_program_negate(BcResult* r, BcNum* n); 409 bc_program_not(BcResult* r, BcNum* n); 419 bc_program_trunc(BcResult* r, BcNum* n); 427 bc_program_assignSeed(BcProgram* p, BcNum* val);
|
H A D | vm.h | 713 BcNum zero; 718 BcNum one; 721 BcNum max; 724 BcNum max2;
|
H A D | lang.h | 379 BcNum num; 478 BcNum n;
|
H A D | library.h | 59 BcNum n; 172 typedef BcNum BclNum;
|
/freebsd/contrib/bc/src/ |
H A D | num.c | 55 bc_num_m(BcNum* a, BcNum* b, BcNum* restrict c, size_t scale); 1943 bc_num_r(BcNum* a, BcNum* b, BcNum* restrict c, BcNum* restrict d, size_t scale, in bc_num_r() 3406 BcNum* n = (BcNum*) num; in bc_num_free() 4009 bc_num_add(BcNum* a, BcNum* b, BcNum* c, size_t scale) in bc_num_add() 4017 bc_num_sub(BcNum* a, BcNum* b, BcNum* c, size_t scale) in bc_num_sub() 4025 bc_num_mul(BcNum* a, BcNum* b, BcNum* c, size_t scale) in bc_num_mul() 4033 bc_num_div(BcNum* a, BcNum* b, BcNum* c, size_t scale) in bc_num_div() 4041 bc_num_mod(BcNum* a, BcNum* b, BcNum* c, size_t scale) in bc_num_mod() 4049 bc_num_pow(BcNum* a, BcNum* b, BcNum* c, size_t scale) in bc_num_pow() 4237 bc_num_divmod(BcNum* a, BcNum* b, BcNum* c, BcNum* d, size_t scale) in bc_num_divmod() [all …]
|
H A D | lang.c | 166 if (nums) bc_vec_init(a, sizeof(BcNum), BC_DTOR_NUM); in bc_array_init() 195 BcNum* dnum; in bc_array_copy() 196 BcNum* snum; in bc_array_copy() 205 memcpy(dnum, snum, sizeof(BcNum)); in bc_array_copy() 221 if (a->size == sizeof(BcNum) && a->dtor == BC_DTOR_NUM) in bc_array_expand() 226 BcNum* n = bc_vec_pushEmpty(a); in bc_array_expand() 290 memcpy(&d->d.n, &src->d.n, sizeof(BcNum)); in bc_result_copy()
|
H A D | program.c | 306 BcNum* n; in bc_program_num() 689 BcNum* n1; in bc_program_op() 690 BcNum* n2; in bc_program_op() 956 BcNum* n; in bc_program_print() 1183 BcNum* n; in bc_program_assignStr() 1430 BcNum* l; in bc_program_assign() 1431 BcNum* r; in bc_program_assign() 2236 BcNum* n; in bc_program_asciify() 2284 BcNum* num = (BcNum*) bc_vec_item(v, i); in bc_program_asciify() 2355 BcNum* n; in bc_program_printStream() [all …]
|
H A D | args.c | 97 BcNum n; in bc_args_builtin() 390 BcNum n; in bc_args()
|
H A D | library.c | 514 memcpy(BCL_NUM_NUM(ptr), n, sizeof(BcNum)); in bcl_num_insert() 1485 bcl_frandHelper(BcNum* restrict b, size_t places) in bcl_frandHelper() 1487 BcNum exp, pow, ten; in bcl_frandHelper() 1559 bcl_ifrandHelper(BcNum* restrict a, BcNum* restrict b, size_t places) in bcl_ifrandHelper() 1561 BcNum ir, fr; in bcl_ifrandHelper()
|
/freebsd/contrib/bc/ |
H A D | NEWS.md | 824 Third, `bc` tries to reuse `BcNum`'s (the internal representation of 825 arbitary-precision numbers). If a `BcNum` has the default capacity of 827 to a list of available `BcNum`'s. And then, when a `BcNum` is allocated with a 828 capacity of `BC_NUM_DEF_SIZE` and any `BcNum`'s exist on the list of reusable 859 especially with regard to reusing `BcNum`'s. One was putting `BcNum`'s into 861 worse than `bc` did in `2.7.2`. Another was putting any `BcNum` on the reuse 862 list that had a capacity of `BC_NUM_DEF_SIZE * 2` and reusing them for `BcNum`'s 865 using `strace`, a bunch more `brk` calls showed up.) Just reusing `BcNum`'s that
|