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

/PHP_5_4/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_4/ext/spl/internal/
H A Drecursivetreeiterator.inc15 * entries in a RecursiveIterator
/PHP_5_4/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_4/ext/standard/
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 */
H A Dstring.c2799 STRLEN entries[1]; member in struct:__anon1
2803 int entries[1]; member in struct:__anon2
2855 shift->entries[i] = max_shift;
2861 shift->entries[h] = MIN(shift->entries[h], m - j - B);
3037 res->shift = safe_emalloc(SHIFT_TAB_SIZE, sizeof(*res->shift->entries), sizeof(*res->shift));
3041 res->hash = safe_emalloc(HASH_TAB_SIZE, sizeof(*res->hash->entries), sizeof(*res->hash));
3055 res->hash->entries[i] = -1;
3060 * Make res->hash->entries[h] de index of the first pattern in
3066 res->hash->entries[
[all...]
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);
/PHP_5_4/sapi/cli/
H A Dphp_cli_server.c785 } entries[FD_SETSIZE * 2]; local
788 struct socket_entry *n = entries, *m;
800 for (e = entries; e < m; e++) {
806 assert(n < entries + FD_SETSIZE * 2);
814 struct socket_entry *e = entries;
/PHP_5_4/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 19 milliseconds