Searched refs:p2 (Results 1 - 25 of 31) sorted by relevance

12

/PHP_5_3/ext/ereg/regex/
H A Dengine.c52 #define AT(t, p1, p2, s1, s2) at(m, t, p1, p2, s1, s2)
56 #define AT(t, p1, p2, s1, s2) /* nothing */
/PHP_5_3/ext/sqlite/libsqlite/src/
H A Dfunc.c102 int p1, p2, len; local
107 p2 = atoi(argv[2]?argv[2]:0);
116 p2 += p1;
122 if( p1+p2>len ){
123 p2 = len-p1;
130 for(; i<p1+p2 && z[i]; i++){
131 if( (z[i]&0xc0)==0x80 ) p2++;
133 while( z[i] && (z[i]&0xc0)==0x80 ){ i++; p2++; }
135 if( p2<0 ) p2
[all...]
H A Dselect.c716 int p2 = i==pEList->nExpr-1; local
721 sqliteVdbeOp3(v, OP_ColumnName, i, p2, zName, 0);
739 int addr = sqliteVdbeOp3(v,OP_ColumnName, i, p2, p->span.z, p->span.n);
748 sqliteVdbeOp3(v, OP_ColumnName, i, p2, zName, P3_DYNAMIC);
750 sqliteVdbeOp3(v, OP_ColumnName, i, p2, zCol, 0);
753 int addr = sqliteVdbeOp3(v,OP_ColumnName, i, p2, p->span.z, p->span.n);
759 sqliteVdbeOp3(v, OP_ColumnName, i, p2, zName, 0);
H A DsqliteInt.h807 int op, p1, p2; /* Opcode used to terminate the loop */ member in struct:WhereLevel
H A Dutil.c289 void *p2; local
297 p2 = realloc(p, n);
298 if( p2==0 ){
301 return p2;
H A Dvdbe.c601 pc = pOp->p2 - 1;
622 pc = pOp->p2 - 1;
665 p->errorAction = pOp->p2;
765 if( pOp->p2 && (pTos->flags & (MEM_Dyn|MEM_Ephem)) ){
854 if( pOp->p2 ) p->nResColumn = pOp->p1+1;
927 if( pOp->p2==0 ){
948 if( pOp->p2==0 ){
1219 pc = pOp->p2 - 1;
1281 if( pOp->p2==0 ){
1286 pc = pOp->p2
2385 int p2 = pOp->p2; local
3121 int p2 = pOp->p2; local
[all...]
H A Dvdbe.h39 int p2; /* Second parameter (often the jump destination) */ member in struct:VdbeOp
56 short int p2; /* Second parameter (often the jump destination) */ member in struct:VdbeOpList
70 ** The following macro converts a relative address in the p2 field
H A Dvdbeaux.c68 ** p1, p2 First two of the three possible operands.
74 int sqliteVdbeAddOp(Vdbe *p, int op, int p1, int p2){ argument
96 if( p2<0 && (-1-p2)<p->nLabel && p->aLabel[-1-p2]>=0 ){
97 p2 = p->aLabel[-1-p2];
99 pOp->p2 = p2;
111 int sqliteVdbeOp3(Vdbe *p, int op, int p1, int p2, cons argument
123 int opcode, p1, p2; local
221 int p2 = pIn->p2; local
372 sqliteVdbeFindOp(Vdbe *p, int op, int p2) argument
[all...]
H A Dwhere.c866 pLevel->p2 = start;
915 pLevel->p2 = start;
934 pLevel->p2 = start;
1133 pLevel->p2 = start;
1200 sqliteVdbeAddOp(v, pLevel->op, pLevel->p1, pLevel->p2);
/PHP_5_3/ext/sqlite3/libsqlite/
H A Dsqlite3.c8180 int p2; /* Second parameter (often the jump destination) */ member in struct:VdbeOp
8227 signed char p2; /* Second parameter (often the jump destination) */ member in struct:VdbeOpList
8282 ** The following macro converts a relative address in the p2 field
10531 int p1, p2; /* Operands of the opcode used to ends the loop */ member in struct:WhereLevel
21223 /* a: p0<<14 | p2 (unmasked) */
21251 /* a: p0<<14 | p2 (masked) */
21253 /* 1:save off p0<<21 | p1<<14 | p2<<7 | p3 (masked) */
21258 /* s: p0<<14 | p2 (masked) */
21263 /* a: p0<<28 | p2<<14 | p4 (unmasked) */
21276 /* 2:save off p0<<21 | p1<<14 | p2<<
57686 sqlite3VdbeAddOp3(Vdbe *p, int op, int p1, int p2, int p3) argument
57723 sqlite3VdbeAddOp2(Vdbe *p, int op, int p1, int p2) argument
57731 sqlite3VdbeAddOp4( Vdbe *p, int op, int p1, int p2, int p3, const char *zP4, int p4type ) argument
57762 sqlite3VdbeAddOp4Int( Vdbe *p, int op, int p1, int p2, int p3, int p4 ) argument
58044 int p2 = pIn->p2; local
62936 int p2; /* Register to copy to */ member in struct:vdbeExecUnion::OP_Move_stack_vars
62975 int p2; member in struct:vdbeExecUnion::OP_Compare_stack_vars
62992 int p2; /* column number to retrieve */ member in struct:vdbeExecUnion::OP_Column_stack_vars
63071 int p2; member in struct:vdbeExecUnion::OP_OpenWrite_stack_vars
82388 i64 p1, p2; local
110927 sqlite3 *p2; local
113651 char *p2 = *pp2; local
113744 char *p2 = *pp2; local
113873 char *p2 = *pp2; local
113963 char *p2 = a2; local
114012 char *p2 = aRight; local
115297 char *p2 = aOut; local
115324 char *p2; local
115792 char *p2; local
119297 const sqlite3_tokenizer_module *p2; local
125828 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
125847 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
[all...]
/PHP_5_3/ext/xmlrpc/libxmlrpc/
H A Dxmlrpc.c193 char *p = (char *) text, *p2 = buf; local
196 *p2 = *p;
197 p2++;
198 if (p2-buf >= sizeof(buf)) {
/PHP_5_3/main/
H A Dmergesort.c111 u_char *list2, *list1, *p2, *p, *last, **p1; local
139 for (tp2 = p2 = list2; p2 != last; p1 = EVAL(l2)) {
140 p2 = *EVAL(p2);
142 f2 = l1 = list1 + (p2 - list2);
143 if (p2 != last)
144 p2 = *EVAL(p2);
145 l2 = list1 + (p2
268 u_char *f1, *f2, *s, *l2, *last, *p2; local
[all...]
/PHP_5_3/ext/ftp/tests/
H A Dserver.inc371 $p2 = $port % ((int) 1 << 8);
372 $p1 = ($port-$p2)/((int) 1 << 8);
374 fputs($s, "227 Entering Passive Mode. (127,0,0,1,{$p1},{$p2})\r\n");
/PHP_5_3/ext/gd/libgd/
H A Dgdkanji.c231 SJIStoJIS (int *p1, int *p2) argument
234 register unsigned char c2 = *p2;
240 *p2 -= cellOffset;
249 han2zen (int *p1, int *p2) argument
321 if (*p2 == 222 && IS_DAKU (*p1))
323 else if (*p2 == 223 && IS_HANDAKU (*p1))
327 *p2 = mtable[c - 161][1];
331 if ((*p2 >= 74 && *p2 <= 103) || (*p2 >
469 int p1, p2, i, j; local
[all...]
/PHP_5_3/ext/intl/collator/
H A Dcollator_sort.c250 static int collator_cmp_sort_keys( const void *p1, const void *p2 TSRMLS_DC )
253 char* key2 = ((collator_sort_key_index_t*)p2)->key;
/PHP_5_3/ext/mbstring/ucgendat/
H A Ducgendat.c225 add_range(ac_uint4 start, ac_uint4 end, char *p1, char *p2) argument
236 if (p2 == 0)
239 name = p2;
/PHP_5_3/ext/session/
H A Dsession.c715 char *p2; local
717 if ((p2 = strchr(p, ';'))) {
718 p = p2 + 1;
/PHP_5_3/ext/standard/
H A Dlevenshtein.c32 int *p1, *p2, *tmp; local
46 p2 = safe_emalloc((l2 + 1), sizeof(int), 0);
52 p2[0] = p1[0] + cost_del;
60 c2 = p2[i2] + cost_ins;
64 p2[i2 + 1] = c0;
67 p1 = p2;
68 p2 = tmp;
73 efree(p2);
H A Dquot_print.c58 register unsigned char *p2; local
100 i = length; p1 = str; p2 = retval;
116 *(p2++) = (h_nbl << 4) | l_nbl, decoded_len++;
135 *(p2++) = (replace_us_by_ws == *p1 ? '\x20': *p1);
140 *p2 = '\0';
H A Dversioning.c131 char *p1, *p2, *n1, *n2; local
153 p2 = n2 = ver2;
154 while (*p1 && *p2 && n1 && n2) {
158 if ((n2 = strchr(p2, '.')) != NULL) {
161 if (isdigit(*p1) && isdigit(*p2)) {
164 l2 = strtol(p2, NULL, 10);
166 } else if (!isdigit(*p1) && !isdigit(*p2)) {
168 compare = compare_special_version_forms(p1, p2);
172 compare = compare_special_version_forms("#N#", p2);
184 p2
[all...]
H A Dstring.c944 char *p1, *p2, *endp; local
949 p2 = php_memnstr(Z_STRVAL_P(str), Z_STRVAL_P(delim), Z_STRLEN_P(delim), endp);
951 if (p2 == NULL) {
955 add_next_index_stringl(return_value, p1, p2 - p1, 1);
956 p1 = p2 + Z_STRLEN_P(delim);
957 } while ((p2 = php_memnstr(p1, Z_STRVAL_P(delim), Z_STRLEN_P(delim), endp)) != NULL &&
971 char *p1, *p2, *endp; local
976 p2 = php_memnstr(Z_STRVAL_P(str), Z_STRVAL_P(delim), Z_STRLEN_P(delim), endp);
978 if (p2 == NULL) {
994 positions[found++] = p1 = p2
[all...]
/PHP_5_3/ext/wddx/
H A Dwddx.c852 char *p1, *p2, *endp; local
856 while ((p2 = php_memnstr(p1, ",", sizeof(",")-1, endp)) != NULL) {
857 key = estrndup(p1, p2 - p1);
860 add_assoc_zval_ex(ent.data, key, p2 - p1 + 1, tmp);
861 p1 = p2 + sizeof(",")-1;
/PHP_5_3/Zend/
H A Dzend_hash.c1425 Bucket *p1, *p2 = NULL; local
1444 p2 = ht2->pListHead;
1448 if (ordered && !p2) {
1454 if (p1->nKeyLength==0 && p2->nKeyLength==0) { /* numeric indices */
1455 result = p1->h - p2->h;
1462 result = p1->nKeyLength - p2->nKeyLength;
1468 result = memcmp(p1->arKey, p2->arKey, p1->nKeyLength);
1475 pData2 = p2->pData;
1499 p2 = p2
[all...]
H A Dzend_multibyte.c967 char *p, *p1, *p2, *endp, *tmpstr; local
983 while ((p2 = zend_memnstr(p1, ",", 1, endp)) != NULL) {
984 p1 = p2 + 1;
995 p2 = p = zend_memnstr(p1, ",", 1, endp);
1016 p1 = p2 + 1;
1017 } while (n < size && p2 != NULL);
/PHP_5_3/ext/spl/
H A Dspl_directory.c389 char *p1, *p2; local
405 p2 = strrchr(intern->file_name, '\\');
407 p2 = 0;
409 if (p1 || p2) {
410 intern->_path_len = (p1 > p2 ? p1 : p2) - intern->file_name;
2285 char *p1, *p2; local
2321 p2 = strrchr(tmp_path, '\\');
2323 p2 = 0;
2325 if (p1 || p2) {
[all...]

Completed in 184 milliseconds

12