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

/PHP_5_3/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_3/ext/spl/internal/
H A Drecursivetreeiterator.inc15 * entries in a RecursiveIterator
/PHP_5_3/ext/standard/
H A Ddns_win32.c203 zval *entries; local
207 ALLOC_INIT_ZVAL(entries);
208 array_init(entries);
219 add_next_index_stringl(entries, data_txt->pStringArray[i], len, 1);
224 add_assoc_zval(*subarray, "entries", entries);
H A Ddns.c500 zval *entries = NULL; local
505 MAKE_STD_ZVAL(entries);
506 array_init(entries);
511 add_next_index_stringl(entries, cp + ll + 1, n, 1);
518 add_assoc_zval(*subarray, "entries", entries);
835 /* Skip QD entries, they're only used by dn_expand later on */
/PHP_5_3/ext/fileinfo/libmagic/
H A Dapprentice.c308 file_delmagic(struct magic *p, int type, size_t entries) argument
512 * Magic entries with no description get a bonus because they depend
513 * on subsequent magic entries to print something.
521 * Sort callback for sorting entries by "strength" (basically length)
H A Dfile.h123 #define MAXMAGIS 8192 /* max entries in any one magic file
331 /* list of magic entries */
333 struct magic *magic; /* array of magic entries */
334 uint32_t nmagic; /* number of entries in array */
421 protected void file_delmagic(struct magic *, int type, size_t entries);
/PHP_5_3/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...]

Completed in 12 milliseconds