Searched refs:entries (Results 1 - 11 of 11) sorted by relevance

/PHP_5_5/ext/spl/examples/
H A Ddirectoryfilterdots.inc18 * and makes it recursive. Further more it filters the entries '.' and '..'.
37 /** @return the current entries path name
/PHP_5_5/ext/spl/internal/
H A Drecursivetreeiterator.inc15 * entries in a RecursiveIterator
/PHP_5_5/ext/standard/
H A Ddns_win32.c212 zval *entries; local
216 ALLOC_INIT_ZVAL(entries);
217 array_init(entries);
228 add_next_index_stringl(entries, data_txt->pStringArray[i], len, 1);
233 add_assoc_zval(*subarray, "entries", entries);
H A Dstring.c2786 STRLEN entries[1]; member in struct:__anon1
2790 int entries[1]; member in struct:__anon2
2842 shift->entries[i] = max_shift;
2848 shift->entries[h] = MIN(shift->entries[h], m - j - B);
2968 res->shift = safe_emalloc(SHIFT_TAB_SIZE, sizeof(*res->shift->entries), sizeof(*res->shift));
2972 res->hash = safe_emalloc(HASH_TAB_SIZE, sizeof(*res->hash->entries), sizeof(*res->hash));
2992 res->hash->entries[i] = -1;
2997 * Make res->hash->entries[h] de index of the first pattern in
3003 res->hash->entries[
[all...]
H A Ddns.c510 zval *entries = NULL; local
515 MAKE_STD_ZVAL(entries);
516 array_init(entries);
521 add_next_index_stringl(entries, cp + ll + 1, n, 1);
528 add_assoc_zval(*subarray, "entries", entries);
871 /* Skip QD entries, they're only used by dn_expand later on */
/PHP_5_5/ext/mbstring/libmbfl/tests/conv_encoding.tests/
H A Dgen_exp.c16 struct mappings_entry *entries; member in struct:mappings
23 map->entries = 0;
28 if (map->entries)
29 free(map->entries);
41 a = sizeof(*map->entries) * n;
42 if (a / n != sizeof(*map->entries))
44 new_entries = realloc(map->entries, a);
47 map->entries = new_entries;
61 entry = &map->entries[i];
68 size_t n = map->n - i, a = sizeof(*map->entries) *
368 static struct generator_entry entries[] = { variable in typeref:struct:generator_entry
[all...]
/PHP_5_5/ext/opcache/
H A Dzend_accelerator_blacklist.h34 zend_blacklist_entry *entries; member in struct:_zend_blacklist
H A Dzend_accelerator_blacklist.c61 if (blacklist->entries != NULL) {
65 blacklist->entries = (zend_blacklist_entry *) calloc(sizeof(zend_blacklist_entry), blacklist->size);
66 if (!blacklist->entries) {
100 rlen += blacklist->entries[i].path_length * 2 + 2;
103 if ((i + 1 == blacklist->pos) || ((rlen + blacklist->entries[i + 1].path_length * 2 + 2) > (12 * 1024))) {
120 for (c = 0; c < blacklist->entries[j].path_length; c++) {
121 if (strchr("^.[]$()|*+?{}\\", blacklist->entries[j].path[c])) {
124 regexp[clen++] = blacklist->entries[j].path[c];
152 zend_blacklist_entry *p = blacklist->entries, *end = blacklist->entries
[all...]
H A DZendAccelerator.c1104 zend_accel_error(ACCEL_LOG_DEBUG, "No more entries in hash table!");
1137 zend_accel_error(ACCEL_LOG_DEBUG, "No more entries in hash table!");
1199 zend_accel_error(ACCEL_LOG_DEBUG, "No more entries in hash table!");
2625 accel_blacklist.entries = NULL;
/PHP_5_5/sapi/cli/
H A Dphp_cli_server.c779 } entries[FD_SETSIZE * 2]; local
782 struct socket_entry *n = entries, *m;
794 for (e = entries; e < m; e++) {
800 assert(n < entries + FD_SETSIZE * 2);
808 struct socket_entry *e = entries;
/PHP_5_5/ext/fileinfo/libmagic/
H A Dfile.h131 #define MAXMAGIS 8192 /* max entries in any one magic file
349 /* list of magic entries */
351 struct magic *magic; /* array of magic entries */
352 uint32_t nmagic; /* number of entries in array */
377 struct mlist *mlist[MAGIC_SETS]; /* list of regular entries */
445 protected void file_delmagic(struct magic *, int type, size_t entries);

Completed in 64 milliseconds