| /PHP_TRUNK/TSRM/ |
| H A D | TSRM.c | 29 tsrm_tls_entry *next; member in struct:_tsrm_tls_entry 176 next_p = p->next; 260 p = p->next; 279 (*thread_resources_ptr)->next = NULL; 358 if (thread_resources->next) { 359 thread_resources = thread_resources->next; 361 allocate_new_resource(&thread_resources->next, thread_id); 364 * thread_resources = thread_resources->next; 385 tsrm_tls_entry *next, *thread_resources = (tsrm_tls_entry*)context; local 389 next [all...] |
| /PHP_TRUNK/ext/phar/phar/ |
| H A D | phar.inc | 50 function next()
|
| /PHP_TRUNK/ext/spl/internal/ |
| H A D | cachingiterator.inc | 56 $this->next(); 64 $this->next(); 67 /** Forward to the next element 69 function next() 86 $this->it->next();
|
| H A D | filteriterator.inc | 57 * Fetch next element and store it. 66 $this->it->next(); 71 * Move to next element 75 function next() { 76 $this->it->next();
|
| H A D | infiniteiterator.inc | 35 /** Move the inner Iterator forward to its next element or rewind it. 38 function next() 40 $this->getInnerIterator()->next();
|
| H A D | recursiveiteratoriterator.inc | 32 * to the next element. */ 50 * getChildren() calls and simply jumps to the next 105 /** Forward to next element 107 function next() 124 $it->next(); 139 $it->next(); 230 /** Called when the next element is available
|
| /PHP_TRUNK/sapi/fpm/fpm/ |
| H A D | fpm_children.c | 96 child->next = wp->children; 97 if (child->next) { 98 child->next->prev = child; 111 child->prev->next = child->next; 113 child->wp->children = child->next; 116 if (child->next) { 117 child->next->prev = child->prev; 127 for (wp = fpm_worker_all_pools; wp; wp = wp->next) { 129 for (child = wp->children; child; child = child->next) { 166 struct fpm_child_s *next; local [all...] |
| H A D | fpm_children.h | 23 struct fpm_child_s *prev, *next; member in struct:fpm_child_s
|
| H A D | fpm_worker_pool.h | 22 struct fpm_worker_pool_s *next; member in struct:fpm_worker_pool_s
|
| H A D | fpm_events.c | 136 queue = queue->next; 160 elt->next = NULL; 165 elt->next = *queue; 188 q->prev->next = q->next; 190 if (q->next) { 191 q->next->prev = q->prev; 194 *queue = q->next; 208 q = q->next; 229 q = q->next; [all...] |
| /PHP_TRUNK/ext/gd/ |
| H A D | gdcache.h | 60 gdCache_element_t *next; member in struct:gdCache_element_s
|
| H A D | gdcache.c | 84 elem = elem->next; 107 prev->next = elem->next; 108 elem->next = head->mru; 115 elem = elem->next; 128 prevprev->next = NULL; 133 elem->next = head->mru;
|
| /PHP_TRUNK/ext/gd/libgd/ |
| H A D | gdcache.c | 84 elem = elem->next; 105 prev->next = elem->next; 106 elem->next = head->mru; 113 elem = elem->next; 129 prevprev->next = NULL; 134 elem->next = head->mru;
|
| H A D | gdcache.h | 59 gdCache_element_t *next; member in struct:gdCache_element_s
|
| /PHP_TRUNK/ext/mbstring/oniguruma/ |
| H A D | st.c | 22 st_table_entry *next; member in struct:st_table_entry 203 register st_table_entry *ptr, *next; local 209 next = ptr->next; 211 ptr = next; 232 while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\ 233 ptr = ptr->next;\ 235 ptr = ptr->next;\ 273 entry->next = table->bins[bin_pos];\ 317 register st_table_entry *ptr, *next, **new_bin local [all...] |
| /PHP_TRUNK/Zend/ |
| H A D | zend_llist.c | 42 tmp->next = NULL; 44 l->tail->next = tmp; 59 tmp->next = l->head; 75 (current)->prev->next = (current)->next;\ 77 (l)->head = (current)->next;\ 79 if ((current)->next) {\ 80 (current)->next->prev = (current)->prev;\ 100 current = current->next; 107 zend_llist_element *current=l->head, *next; local 173 zend_llist_element *element, *next; local [all...] |
| /PHP_TRUNK/ext/dba/libcdb/ |
| H A D | cdb_make.h | 38 struct cdb_hplist *next; member in struct:cdb_hplist
|
| /PHP_TRUNK/ext/pdo_sqlite/ |
| H A D | php_pdo_sqlite_int.h | 39 struct pdo_sqlite_func *next; member in struct:pdo_sqlite_func 50 struct pdo_sqlite_collation *next; member in struct:pdo_sqlite_collation
|
| /PHP_TRUNK/ext/session/ |
| H A D | mod_mm.c | 48 struct ps_sd *next; member in struct:ps_sd 91 ps_sd *ps, *next; local 103 for (ps = *ohash; ps; ps = next) { 104 next = ps->next; 105 ps->next = nhash[ps->hv & nmax]; 141 sd->next = data->hash[slot]; 146 if (!sd->next) { 164 data->hash[slot] = sd->next; 169 for (prev = data->hash[slot]; prev->next ! 239 ps_sd *sd, *next; local 417 ps_sd *sd, *next; local [all...] |
| /PHP_TRUNK/ext/soap/ |
| H A D | php_packet_soap.c | 74 trav = trav->next; 99 attr = attr->next; 106 trav = trav->next; 110 trav = trav->next; 116 trav = trav->next; 120 trav = trav->next; 123 trav = trav->next; 149 attr = attr->next; 175 attr = attr->next; 253 resp = resp->next; [all...] |
| /PHP_TRUNK/ext/sqlite3/ |
| H A D | php_sqlite3_structs.h | 56 struct _php_sqlite3_func *next; member in struct:_php_sqlite3_func 67 struct _php_sqlite3_collation *next; member in struct:_php_sqlite3_collation
|
| /PHP_TRUNK/main/streams/ |
| H A D | filter.c | 84 bucket->next = bucket->prev = NULL; 194 bucket->next = brigade->head; 213 bucket->next = NULL; 216 brigade->tail->next = bucket; 227 bucket->prev->next = bucket->next; 229 bucket->brigade->head = bucket->next; 231 if (bucket->next) { 232 bucket->next->prev = bucket->prev; 237 bucket->next [all...] |
| /PHP_TRUNK/ext/standard/ |
| H A D | html.c | 183 unsigned char next; local 187 next = str[pos + 1]; 189 if ((next >= 0x40 && next <= 0x7E) || 190 (next >= 0xA1 && next <= 0xFE)) { 191 this_char = (c << 8) | next; 207 unsigned char next; local 211 next = str[pos + 1]; 213 if ((next > 233 unsigned char next; local 260 unsigned char next; local 288 unsigned next; local 301 unsigned next; local 944 const char *next = NULL; /* when set, next > p, otherwise possible inf loop */ local 1394 *next = start; local [all...] |
| /PHP_TRUNK/ext/intl/breakiterator/ |
| H A D | breakiterator_iterators.cpp | 69 int32_t pos = biter->next(); 156 next; local 162 next = bio->biter->next(); 163 if (next == BreakIterator::DONE) { 170 iter->index = next; 180 if (next == BreakIterator::DONE) { 181 next = slen; 183 assert(next <= slen && next > [all...] |
| /PHP_TRUNK/ext/opcache/ |
| H A D | zend_accelerator_hash.c | 115 entry = entry->next; 135 entry->next = accel_hash->hash_table[index]; 163 entry = entry->next; 191 entry = entry->next; 214 last_entry->next = entry->next; 216 accel_hash->hash_table[index] = entry->next; 221 entry = entry->next;
|