Searched refs:num2 (Results 1 - 6 of 6) sorted by relevance
| /haiku-fatelf/src/bin/bc/h/ |
| H A D | number.h | 136 _PROTOTYPE(int bc_modulo, (bc_num num1, bc_num num2, bc_num *result,
139 _PROTOTYPE(int bc_divmod, (bc_num num1, bc_num num2, bc_num *quot,
145 _PROTOTYPE(void bc_raise, (bc_num num1, bc_num num2, bc_num *result,
|
| /haiku-fatelf/src/bin/bc/lib/ |
| H A D | number.c | 937 unsigned char *num1, *num2; local
965 Remember, zeros on the end of num2 are wasted effort for dividing. */
982 num2 = (unsigned char *) malloc (len2+1);
983 if (num2 == NULL) bc_out_of_memory();
984 memcpy (num2, n2->n_value, len2);
985 *(num2+len2) = 0;
986 n2ptr = num2;
1116 free (num2);
1128 bc_divmod (num1, num2, quot, rem, scale)
1129 bc_num num1, num2, *quo
[all...] |
| /haiku-fatelf/src/bin/rcs/ |
| H A D | rcsrev.c | 167 int cmpnum(num1, num2)
168 char const *num1, *num2;
169 /* compares the two dotted numbers num1 and num2 lexicographically
171 * returns <0, 0, >0 if num1<num2, num1==num2, and num1>num2, resp.
180 s2 = num2 ? num2 : "";
211 int cmpnumfld(num1, num2, fld)
212 char const *num1, *num2;
[all...] |
| H A D | rlog.c | 1177 checkrevpair(num1,num2)
1178 char const *num1, *num2;
1179 /* function: check whether num1, num2 are legal pair,i.e.
1187 countnumflds(num2) != length
1188 || (2 < length && compartial(num1, num2, length-1) != 0)
1190 rcserror("invalid branch or revision pair %s : %s", num1, num2);
|
| /haiku-fatelf/headers/libs/agg/ |
| H A D | agg_scanline_boolean_algebra.h | 671 unsigned num2 = sl2.num_spans(); local
672 if(num2 == 0) return;
677 while(num1 && num2)
707 --num2;
709 if(num2) ++span2;
720 --num2;
721 if(num2) ++span2;
851 unsigned num2 = sl2.num_spans();
881 if(num2)
886 --num2;
[all...] |
| /haiku-fatelf/src/kits/support/ |
| H A D | String.cpp | 45 min_clamp0(int32 num1, int32 num2) argument
47 if (num1 < num2)
50 return num2 > 0 ? num2 : 0;
|
Completed in 107 milliseconds