| /PHP_5_3/Zend/ |
| H A D | zend_strtod.c | 832 int i, k1, n, n1; local 842 n1 = n + b->wds + 1; 843 for(i = b->maxwds; n1 > i; i <<= 1) { 863 ++n1; 876 ++n1; 883 b1->wds = n1 - 1;
|
| /PHP_5_3/ext/bcmath/libbcmath/src/ |
| H A D | add.c | 47 bc_add (n1, n2, result, scale_min) 48 bc_num n1, n2, *result; 55 if (n1->n_sign == n2->n_sign) 57 sum = _bc_do_add (n1, n2, scale_min); 58 sum->n_sign = n1->n_sign; 63 cmp_res = _bc_do_compare (n1, n2, FALSE, FALSE); /* Compare magnitudes. */ 67 /* n1 is less than n2, subtract n1 from n2. */ 68 sum = _bc_do_sub (n2, n1, scale_min); 73 res_scale = MAX (scale_min, MAX(n1 [all...] |
| H A D | bcmath.h | 120 _PROTOTYPE(int bc_compare, (bc_num n1, bc_num n2)); 128 _PROTOTYPE(void bc_add, (bc_num n1, bc_num n2, bc_num *result, int scale_min)); 130 _PROTOTYPE(void bc_sub, (bc_num n1, bc_num n2, bc_num *result, int scale_min)); 132 _PROTOTYPE(void bc_multiply, (bc_num n1, bc_num n2, bc_num *prod, int scale TSRMLS_DC)); 134 _PROTOTYPE(int bc_divide, (bc_num n1, bc_num n2, bc_num *quot, int scale TSRMLS_DC));
|
| H A D | compare.c | 47 _bc_do_compare (n1, n2, use_sign, ignore_last) 48 bc_num n1, n2; 56 if (use_sign && n1->n_sign != n2->n_sign) 58 if (n1->n_sign == PLUS) 65 if (n1->n_len != n2->n_len) 67 if (n1->n_len > n2->n_len) 69 /* Magnitude of n1 > n2. */ 70 if (!use_sign || n1->n_sign == PLUS) 77 /* Magnitude of n1 < n2. */ 78 if (!use_sign || n1 [all...] |
| H A D | div.c | 88 bc_divide (bc_num n1, bc_num n2, bc_num *quot, int scale TSRMLS_DC) argument 108 qval = bc_new_num (n1->n_len, scale); 109 qval->n_sign = (n1->n_sign == n2->n_sign ? PLUS : MINUS); 110 memset (&qval->n_value[n1->n_len],0,scale); 111 memcpy (qval->n_value, n1->n_value, 112 n1->n_len + MIN(n1->n_scale,scale)); 118 /* Set up the divide. Move the decimal point on n1 by n2's scale. 124 len1 = n1->n_len + scale2; 125 scale1 = n1 [all...] |
| H A D | doaddsub.c | 47 _bc_do_add (n1, n2, scale_min) 48 bc_num n1, n2; 58 sum_scale = MAX (n1->n_scale, n2->n_scale); 59 sum_digits = MAX (n1->n_len, n2->n_len) + 1; 71 n1bytes = n1->n_scale; 73 n1ptr = (char *) (n1->n_value + n1->n_len + n1bytes - 1); 89 n1bytes += n1->n_len; 139 _bc_do_sub (n1, n2, scale_min) 140 bc_num n1, n [all...] |
| H A D | private.h | 40 int _bc_do_compare (bc_num n1, bc_num n2, int use_sign, int ignore_last); 41 bc_num _bc_do_add (bc_num n1, bc_num n2, int scale_min); 42 bc_num _bc_do_sub (bc_num n1, bc_num n2, int scale_min);
|
| H A D | recmul.c | 81 _bc_simp_mul (bc_num n1, int n1len, bc_num n2, int n2len, bc_num *prod, argument 85 char *n1end, *n2end; /* To the end of n1 and n2. */ 92 n1end = (char *) (n1->n_value + n1len - 1); 102 while ((n1ptr >= n1->n_value) && (n2ptr <= n2end)) 281 bc_multiply (bc_num n1, bc_num n2, bc_num *prod, int scale TSRMLS_DC) argument 288 len1 = n1->n_len + n1->n_scale; 290 full_scale = n1->n_scale + n2->n_scale; 291 prod_scale = MIN(full_scale,MAX(scale,MAX(n1->n_scale,n2->n_scale))); 294 _bc_rec_mul (n1, len [all...] |
| H A D | sub.c | 47 bc_sub (n1, n2, result, scale_min) 48 bc_num n1, n2, *result; 55 if (n1->n_sign != n2->n_sign) 57 diff = _bc_do_add (n1, n2, scale_min); 58 diff->n_sign = n1->n_sign; 64 cmp_res = _bc_do_compare (n1, n2, FALSE, FALSE); 68 /* n1 is less than n2, subtract n1 from n2. */ 69 diff = _bc_do_sub (n2, n1, scale_min); 74 res_scale = MAX (scale_min, MAX(n1 [all...] |
| /PHP_5_3/ext/sqlite/libsqlite/src/ |
| H A D | hash.c | 74 static int intCompare(const void *pKey1, int n1, const void *pKey2, int n2){ argument 75 return n2 - n1; 86 static int ptrCompare(const void *pKey1, int n1, const void *pKey2, int n2){ 99 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){ argument 100 if( n1!=n2 ) return n2-n1; 101 return sqliteStrNICmp((const char*)pKey1,(const char*)pKey2,n1); 115 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){ argument 116 if( n1!=n2 ) return n2-n1; [all...] |
| H A D | insert.c | 803 int j, n1, n2; local 806 n1 = strlen(zErrMsg); 807 for(j=0; j<pIdx->nColumn && n1<sizeof(zErrMsg)-30; j++){ 811 strcpy(&zErrMsg[n1], ", "); 812 n1 += 2; 814 if( n1+n2>sizeof(zErrMsg)-30 ){ 815 strcpy(&zErrMsg[n1], "..."); 816 n1 += 3; 819 strcpy(&zErrMsg[n1], zCol); 820 n1 [all...] |
| /PHP_5_3/ext/sqlite3/libsqlite/ |
| H A D | sqlite3.c | 57246 int n1, n2; local 113951 fts3DoclistOrMerge( int bDescIdx, char *a1, int n1, char *a2, int n2, char **paOut, int *pnOut ) argument 117979 fts3StrCompare(const void *pKey1, int n1, const void *pKey2, int n2) argument 117995 fts3BinCompare(const void *pKey1, int n1, const void *pKey2, int n2) argument 121030 int n1 = fts3HashKeysize(*(Fts3HashElem **)lhs); local [all...] |
| /PHP_5_3/ext/mbstring/oniguruma/ |
| H A D | regparse.c | 1798 OnigCodePoint i, n1, *data1; local 1830 GET_CODE_POINT(n1, data1); 1841 for (i = 0; i < n1; i++) { 1894 OnigCodePoint i, j, n1, n2, *data1, *data2; local 1914 GET_CODE_POINT(n1, data1); 1920 for (i = 0; i < n1; i++) { 1936 for (i = 0; i < n1; i++) {
|
| /PHP_5_3/ext/standard/ |
| H A D | versioning.c | 131 char *p1, *p2, *n1, *n2; local 152 p1 = n1 = ver1; 154 while (*p1 && *p2 && n1 && n2) { 155 if ((n1 = strchr(p1, '.')) != NULL) { 156 *n1 = '\0'; 180 if (n1 != NULL) { 181 p1 = n1 + 1; 188 if (n1 != NULL) {
|