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

/PHP_5_6/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_6/ext/opcache/
H A Dzend_accelerator_blacklist.h34 zend_blacklist_entry *entries; member in struct:_zend_blacklist
/PHP_5_6/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.c2798 STRLEN entries[1]; member in struct:__anon1
2802 int entries[1]; member in struct:__anon2
2854 shift->entries[i] = max_shift;
2860 shift->entries[h] = MIN(shift->entries[h], m - j - B);
2980 res->shift = safe_emalloc(SHIFT_TAB_SIZE, sizeof(*res->shift->entries), sizeof(*res->shift));
2984 res->hash = safe_emalloc(HASH_TAB_SIZE, sizeof(*res->hash->entries), sizeof(*res->hash));
3004 res->hash->entries[i] = -1;
3009 * Make res->hash->entries[h] de index of the first pattern in
3015 res->hash->entries[
[all...]
H A Ddns.c524 zval *entries = NULL; local
529 MAKE_STD_ZVAL(entries);
530 array_init(entries);
540 add_next_index_stringl(entries, cp + l1 + 1, n, 1);
549 add_assoc_zval(*subarray, "entries", entries);
911 /* Skip QD entries, they're only used by dn_expand later on */
/PHP_5_6/sapi/cli/
H A Dphp_cli_server.c912 } entries[FD_SETSIZE * 2]; local
915 struct socket_entry *n = entries, *m;
927 for (e = entries; e < m; e++) {
933 assert(n < entries + FD_SETSIZE * 2);
941 struct socket_entry *e = entries;
/PHP_5_6/ext/fileinfo/libmagic/
H A Dapprentice.c782 * Magic entries with no description get a bonus because they depend
783 * on subsequent magic entries to print something.
791 * Sort callback for sorting entries by "strength" (basically length)
1980 "\"name\" magic entries", m->value.s);
2602 uint32_t version, entries, nentries; local
2700 entries = (uint32_t)(st.sb.st_size / sizeof(struct magic));
2701 if ((off_t)(entries * sizeof(struct magic)) != st.sb.st_size) {
2719 if (NULL != fn && entries != nentries + 1) {
2720 file_error(ms, 0, "Inconsistent entries in `%s' %u != %u",
2721 dbname, entries, nentrie
[all...]

Completed in 21 milliseconds