Searched refs:idx (Results 1 - 25 of 76) sorted by relevance

1234

/PHP_TRUNK/scripts/dev/
H A Dcheck_parameters.php138 function check_param($db, $idx, $exp, $optional)
142 if ($idx >= count($db)) {
148 } elseif ($db[$idx][0] === '**dummy**') {
152 if ($db[$idx][1] != $exp) {
153 error("{$db[$idx][0]}: expected '$exp' but got '{$db[$idx][1]}' [".($idx+1).']');
156 if ($optional && !$db[$idx][2]) {
157 error("optional var not initialized: {$db[$idx][0]} [".($idx
[all...]
/PHP_TRUNK/ext/spl/
H A Dspl_engine.c45 zend_ulong idx; local
49 if (ZEND_HANDLE_NUMERIC(Z_STR_P(offset), idx)) {
50 return idx;
/PHP_TRUNK/sapi/phpdbg/
H A Dphpdbg_btree.c39 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { argument
48 if ((idx >> i) % 2 == 1) {
66 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { argument
78 if (!had_alternative_branch && (idx >> i) % 2 == 0 && !branch->branches[0]) {
79 /* there's no lower branch than idx */
87 /* follow branch according to bits in idx until the last lower branch before the impossible branch */
89 CHOOSE_BRANCH((idx >> i) % 2 == 1 && branch->branches[1]);
91 /* use now the lower branch of which we can be sure that it contains only branches lower than idx */
93 /* and choose the highest possible branch in the branch containing only branches lower than idx */
99 /* follow branch according to bits in idx unti
140 phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) argument
175 phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) argument
[all...]
H A Dphpdbg_btree.h27 zend_ulong idx; member in struct:__anon6
50 phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx);
51 phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx);
54 int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx);
60 int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags);
61 #define phpdbg_btree_insert(tree, idx, ptr) phpdbg_btree_insert_or_update(tree, idx, ptr, PHPDBG_BTREE_INSERT)
62 #define phpdbg_btree_update(tree, idx, ptr) phpdbg_btree_insert_or_update(tree, idx, ptr, PHPDBG_BTREE_UPDATE)
63 #define phpdbg_btree_overwrite(tree, idx, pt
[all...]
/PHP_TRUNK/ext/zip/lib/
H A Dzip_add_entry.c45 zip_uint64_t idx; local
65 idx = za->nentry++;
67 _zip_entry_init(za->entry+idx);
69 return (zip_int64_t)idx;
H A Dzip_delete.c39 zip_delete(zip_t *za, zip_uint64_t idx) argument
41 if (idx >= za->nentry) {
53 if (_zip_unchange(za, idx, 1) != 0)
56 za->entry[idx].deleted = 1;
H A Dzip_dir_add.c47 zip_int64_t idx; local
79 idx = _zip_file_replace(za, ZIP_UINT64_MAX, s ? s : name, source, flags);
83 if (idx < 0)
86 if (zip_file_set_external_attributes(za, (zip_uint64_t)idx, 0, ZIP_OPSYS_DEFAULT, ZIP_EXT_ATTRIB_DEFAULT_DIR) < 0) {
87 zip_delete(za, (zip_uint64_t)idx);
92 return idx;
H A Dzip_extra_field_api.c39 zip_file_extra_field_delete(zip_t *za, zip_uint64_t idx, zip_uint16_t ef_idx, zip_flags_t flags) argument
53 if (_zip_get_dirent(za, idx, 0, NULL) == NULL)
61 if (_zip_file_extra_field_prepare_for_change(za, idx) < 0)
64 de = za->entry[idx].changes;
72 zip_file_extra_field_delete_by_id(zip_t *za, zip_uint64_t idx, zip_uint16_t ef_id, zip_uint16_t ef_idx, zip_flags_t flags) argument
86 if (_zip_get_dirent(za, idx, 0, NULL) == NULL)
94 if (_zip_file_extra_field_prepare_for_change(za, idx) < 0)
97 de = za->entry[idx].changes;
105 zip_file_extra_field_get(zip_t *za, zip_uint64_t idx, zip_uint16_t ef_idx, zip_uint16_t *idp, zip_uint16_t *lenp, zip_flags_t flags) argument
118 if ((de=_zip_get_dirent(za, idx, flag
151 zip_file_extra_field_get_by_id(zip_t *za, zip_uint64_t idx, zip_uint16_t ef_id, zip_uint16_t ef_idx, zip_uint16_t *lenp, zip_flags_t flags) argument
172 zip_file_extra_fields_count(zip_t *za, zip_uint64_t idx, zip_flags_t flags) argument
200 zip_file_extra_fields_count_by_id(zip_t *za, zip_uint64_t idx, zip_uint16_t ef_id, zip_flags_t flags) argument
228 zip_file_extra_field_set(zip_t *za, zip_uint64_t idx, zip_uint16_t ef_id, zip_uint16_t ef_idx, const zip_uint8_t *data, zip_uint16_t len, zip_flags_t flags) argument
332 _zip_file_extra_field_prepare_for_change(zip_t *za, zip_uint64_t idx) argument
[all...]
H A Dzip_file_get_comment.c40 zip_file_get_comment(zip_t *za, zip_uint64_t idx, zip_uint32_t *lenp, zip_flags_t flags) argument
46 if ((de=_zip_get_dirent(za, idx, flags, NULL)) == NULL)
H A Dzip_file_get_external_attributes.c37 zip_file_get_external_attributes(zip_t *za, zip_uint64_t idx, zip_flags_t flags, zip_uint8_t *opsys, zip_uint32_t *attributes) argument
41 if ((de=_zip_get_dirent(za, idx, flags, NULL)) == NULL)
H A Dzip_file_rename.c41 zip_file_rename(zip_t *za, zip_uint64_t idx, const char *name, zip_flags_t flags) argument
46 if (idx >= za->nentry || (name != NULL && strlen(name) > ZIP_UINT16_MAX)) {
56 if ((old_name=zip_get_name(za, idx, 0)) == NULL)
67 return _zip_set_name(za, idx, name, flags);
H A Dzip_file_replace.c39 zip_file_replace(zip_t *za, zip_uint64_t idx, zip_source_t *source, zip_flags_t flags) argument
41 if (idx >= za->nentry || source == NULL) {
46 if (_zip_file_replace(za, idx, NULL, source, flags) == -1)
57 _zip_file_replace(zip_t *za, zip_uint64_t idx, const char *name, zip_source_t *source, zip_flags_t flags) argument
67 if (idx == ZIP_UINT64_MAX) {
78 idx = (zip_uint64_t)i;
81 if (name && _zip_set_name(za, idx, name, flags) != 0) {
83 _zip_entry_finalize(za->entry+idx);
91 _zip_unchange_data(za->entry+idx);
93 if (za->entry[idx]
[all...]
H A Dzip_file_set_mtime.c36 ZIP_EXTERN int zip_file_set_mtime(zip_t *za, zip_uint64_t idx, time_t mtime, zip_flags_t flags) argument
41 if (_zip_get_dirent(za, idx, 0, NULL) == NULL)
49 e = za->entry+idx;
H A Dzip_fopen.c41 zip_int64_t idx; local
43 if ((idx=zip_name_locate(za, fname, flags)) < 0)
46 return zip_fopen_index_encrypted(za, (zip_uint64_t)idx, flags, za->default_password);
H A Dzip_fopen_encrypted.c41 zip_int64_t idx; local
43 if ((idx=zip_name_locate(za, fname, flags)) < 0)
46 return zip_fopen_index_encrypted(za, (zip_uint64_t)idx, flags, password);
H A Dzip_get_file_comment.c40 zip_get_file_comment(zip_t *za, zip_uint64_t idx, int *lenp, int flags) argument
45 if ((s=zip_file_get_comment(za, idx, &len, (zip_flags_t)flags)) != NULL) {
H A Dzip_get_name.c41 zip_get_name(zip_t *za, zip_uint64_t idx, zip_flags_t flags) argument
43 return _zip_get_name(za, idx, flags, &za->error);
48 _zip_get_name(zip_t *za, zip_uint64_t idx, zip_flags_t flags, zip_error_t *error) argument
53 if ((de=_zip_get_dirent(za, idx, flags, error)) == NULL)
H A Dzip_rename.c42 zip_rename(zip_t *za, zip_uint64_t idx, const char *name) argument
44 return zip_file_rename(za, idx, name, 0);
H A Dzip_replace.c40 zip_replace(zip_t *za, zip_uint64_t idx, zip_source_t *source) argument
42 return zip_file_replace(za, idx, source, 0);
H A Dzip_set_file_comment.c42 zip_set_file_comment(zip_t *za, zip_uint64_t idx, const char *comment, int len) argument
48 return zip_file_set_comment(za, idx, comment, (zip_uint16_t)len, 0);
H A Dzip_set_name.c42 _zip_set_name(zip_t *za, zip_uint64_t idx, const char *name, zip_flags_t flags) argument
49 if (idx >= za->nentry) {
70 if ((i=_zip_name_locate(za, name, 0, NULL)) >= 0 && (zip_uint64_t)i != idx) {
77 if (i>=0 && (zip_uint64_t)i == idx) {
82 e = za->entry+idx;
H A Dzip_stat.c41 zip_int64_t idx; local
43 if ((idx=zip_name_locate(za, fname, flags)) < 0)
46 return zip_stat_index(za, (zip_uint64_t)idx, flags, st);
H A Dzip_unchange.c41 zip_unchange(zip_t *za, zip_uint64_t idx) argument
43 return _zip_unchange(za, idx, 0);
48 _zip_unchange(zip_t *za, zip_uint64_t idx, int allow_duplicates) argument
52 if (idx >= za->nentry) {
57 if (!allow_duplicates && za->entry[idx].changes && (za->entry[idx].changes->changed & ZIP_DIRENT_FILENAME)) {
58 i = _zip_name_locate(za, _zip_get_name(za, idx, ZIP_FL_UNCHANGED, NULL), 0, NULL);
59 if (i >= 0 && (zip_uint64_t)i != idx) {
65 _zip_dirent_free(za->entry[idx].changes);
66 za->entry[idx]
[all...]
/PHP_TRUNK/Zend/
H A Dzend_string.c83 uint idx; local
92 idx = HT_HASH(&CG(interned_strings), nIndex);
93 while (idx != HT_INVALID_IDX) {
94 p = HT_HASH_TO_BUCKET(&CG(interned_strings), idx);
101 idx = Z_NEXT(p->val);
133 idx = CG(interned_strings).nNumUsed++;
135 p = CG(interned_strings).arData + idx;
142 HT_HASH(&CG(interned_strings), nIndex) = HT_IDX_TO_HASH(idx);
155 uint idx; local
158 idx
172 uint idx; local
[all...]
H A Dzend_hash.c278 uint32_t idx; local
287 idx = iter - EG(ht_iterators);
288 if (idx + 1 > EG(ht_iterators_used)) {
289 EG(ht_iterators_used) = idx + 1;
291 return idx;
306 idx = iter - EG(ht_iterators);
307 EG(ht_iterators_used) = idx + 1;
308 return idx;
311 ZEND_API HashPosition ZEND_FASTCALL zend_hash_iterator_pos(uint32_t idx, HashTable *ht) argument
313 HashTableIterator *iter = EG(ht_iterators) + idx;
331 zend_hash_iterator_del(uint32_t idx) argument
354 uint32_t idx; local
411 uint32_t idx; local
436 uint32_t idx; local
459 uint32_t idx; local
480 uint32_t idx; local
634 uint32_t idx; local
894 _zend_hash_del_el_ex(HashTable *ht, uint32_t idx, Bucket *p, Bucket *prev) argument
942 _zend_hash_del_el(HashTable *ht, uint32_t idx, Bucket *p) argument
973 uint32_t idx; local
1004 uint32_t idx; local
1048 uint32_t idx; local
1091 uint32_t idx; local
1120 uint32_t idx; local
1373 uint32_t idx; local
1393 uint32_t idx; local
1426 uint32_t idx; local
1452 uint32_t idx; local
1478 uint32_t idx; local
1514 uint32_t idx; local
1544 uint32_t idx; local
1588 zend_array_dup_element(HashTable *source, HashTable *target, uint32_t idx, Bucket *p, Bucket *q, int packed, int static_keys, int with_holes) argument
1660 uint32_t idx = 0; local
1688 uint32_t idx; local
1781 uint32_t idx; local
1829 uint32_t idx; local
1945 uint32_t idx; local
1965 uint32_t idx; local
1984 uint32_t idx = *pos; local
2008 uint32_t idx = *pos; local
2032 uint32_t idx = *pos; local
2051 uint32_t idx = *pos; local
2069 uint32_t idx = *pos; local
2087 uint32_t idx = *pos; local
2308 uint32_t idx; local
2343 _zend_handle_numeric_str_ex(const char *key, size_t length, zend_ulong *idx) argument
[all...]

Completed in 33 milliseconds

1234