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

1234567891011>>

/freebsd-11-stable/usr.sbin/lpr/chkprintcap/
H A Dskimprintcap.h40 int entries; member in struct:skiminfo
/freebsd-11-stable/contrib/libarchive/libarchive/test/
H A Dtest_write_format_mtree_classic.c38 } entries[] = { variable in typeref:struct:__anon1909
127 /* Write entries */
128 for (i = 0; entries[i].path != NULL; i++) {
130 archive_entry_set_nlink(ae, entries[i].nlink);
131 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae));
132 archive_entry_set_mtime(ae, entries[i].mtime, 0);
133 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae));
134 archive_entry_set_mode(ae, entries[i].mode);
135 assertEqualInt(entries[i].mode, archive_entry_mode(ae));
136 archive_entry_set_uid(ae, entries[
[all...]
H A Dtest_write_format_mtree_classic_indent.c38 } entries[] = { variable in typeref:struct:__anon1910
129 /* Write entries */
130 for (i = 0; entries[i].path != NULL; i++) {
132 archive_entry_set_nlink(ae, entries[i].nlink);
133 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae));
134 archive_entry_set_mtime(ae, entries[i].mtime, 0);
135 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae));
136 archive_entry_set_mode(ae, entries[i].mode);
137 assertEqualInt(entries[i].mode, archive_entry_mode(ae));
138 archive_entry_set_uid(ae, entries[
[all...]
H A Dtest_write_format_mtree.c37 } entries[] = { variable in typeref:struct:__anon1907
89 /* Write entries */
90 for (i = 0; entries[i].path != NULL; i++) {
92 archive_entry_set_mtime(ae, entries[i].mtime, 0);
93 assert(entries[i].mtime == archive_entry_mtime(ae));
94 archive_entry_set_mode(ae, entries[i].mode);
95 assert(entries[i].mode == archive_entry_mode(ae));
96 archive_entry_set_uid(ae, entries[i].uid);
97 assert(entries[i].uid == archive_entry_uid(ae));
98 archive_entry_set_gid(ae, entries[
[all...]
H A Dtest_write_format_mtree_fflags.c42 } entries[] = { variable in typeref:struct:__anon1911
70 /* Write entries */
71 for (i = 0; entries[i].path != NULL; i++) {
73 archive_entry_set_fflags(ae, entries[i].fflags, 0);
74 archive_entry_copy_pathname(ae, entries[i].path);
109 /* Read entries */
110 for (i = 0; entries[i].path != NULL; i++) {
115 assertEqualInt((int)entries[i].fflags, (int)fset);
117 assertEqualString(entries[i].path, archive_entry_pathname(ae));
/freebsd-11-stable/lib/libc/stdlib/
H A Dhsearch.h36 size_t entries_used; /* Number of entries currently used. */
37 ENTRY *entries; /* Hash table entries. */ member in struct:__hsearch
H A Dhcreate_r.c41 * off with a table of sixteen entries. In most cases this hint is
48 hsearch->entries = calloc(16, sizeof(ENTRY));
49 if (hsearch->entries == NULL) {
H A Dhdestroy_r.c39 /* Free hash table object and its entries. */
41 free(hsearch->entries);
/freebsd-11-stable/usr.bin/grep/regex/
H A Dhashtable.c58 * Initializes a hash table that can hold table_size number of entries,
75 tbl->entries = calloc(sizeof(hashtable_entry *), table_size);
76 if (tbl->entries == NULL)
121 * On hash collision entries are inserted at the next free space,
127 if (tbl->entries[hash] == NULL)
129 else if (memcmp(tbl->entries[hash]->key, key, tbl->key_size) == 0)
131 memcpy(tbl->entries[hash]->value, value, tbl->value_size);
142 tbl->entries[hash] = malloc(sizeof(hashtable_entry));
143 if (tbl->entries[hash] == NULL)
149 tbl->entries[has
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_fs/
H A Dload-index.c35 get_max_covered(apr_array_header_t *entries) argument
38 if (entries->nelts == 0)
41 entry = APR_ARRAY_IDX(entries, entries->nelts - 1,
49 check_all_covered(apr_array_header_t *entries, argument
54 for (i = 0; i < entries->nelts; ++i)
57 = APR_ARRAY_IDX(entries, i, const svn_fs_fs__p2l_entry_t *);
99 apr_array_header_t *entries,
110 svn_sort__array(entries, compare_p2l_entry_revision);
113 if (entries
97 svn_fs_fs__load_index(svn_fs_t *fs, svn_revnum_t revision, apr_array_header_t *entries, apr_pool_t *scratch_pool) argument
[all...]
H A Ddump-index.c59 /* Walk through all P2L index entries in offset order. */
62 apr_array_header_t *entries; local
64 /* Read entries for the next block. There will be no overlaps since
67 SVN_ERR(svn_fs_fs__p2l_index_lookup(&entries, fs, rev_file, revision,
71 /* Print entries for this block, one line per entry. */
72 for (i = 0; i < entries->nelts && offset < max_offset; ++i)
75 = &APR_ARRAY_IDX(entries, i, const svn_fs_fs__p2l_entry_t);
H A Dtemp_serializer.c150 /* number of entries in the directory
170 /* reference to the entries */
171 svn_fs_dirent_t **entries; member in struct:dir_data_t
173 /* size of the serialized entries and don't be too wasteful
174 * (needed since the entries are no longer in sequence) */
212 apr_array_header_t *entries = dir->entries; local
215 int count = entries->nelts;
218 apr_size_t entries_len = total_count * sizeof(*dir_data.entries);
221 /* copy the hash entries t
270 svn_fs_dirent_t **entries; local
551 const char **entries = *strings; local
572 const svn_string_t **entries = *strings; local
890 find_entry(svn_fs_dirent_t **entries, const char *name, apr_size_t count, svn_boolean_t *found) argument
942 const svn_fs_dirent_t * const *entries = local
998 apr_array_header_t *entries; local
1037 svn_fs_dirent_t **entries; local
[all...]
/freebsd-11-stable/contrib/unbound/contrib/
H A Dbuild-unbound-localzone-from-hosts.pl24 my @entries = split( /\s+/, $hostline );
29 foreach my $entry ( @entries ) {
/freebsd-11-stable/lib/libc/tests/sys/
H A Dqueue_test.c47 SLIST_ENTRY(entry) entries;
60 SLIST_FOREACH(np, &head, entries) {
71 SLIST_INSERT_HEAD(&head, n1, entries);
77 SLIST_FOREACH(np, &head, entries) {
91 SLIST_INSERT_AFTER(n1, n2, entries);
97 SLIST_INSERT_AFTER(n2, n3, entries);
100 SLIST_FOREACH(np, &head, entries) {
113 SLIST_REMOVE_HEAD(&head, entries);
120 SLIST_FOREACH(np, &head, entries) {
130 SLIST_REMOVE_AFTER(n2, entries);
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dintegrate.c63 initial_value_pair * GTY ((length ("%h.num_entries"))) entries;
223 if (rtx_equal_p (ivs->entries[i].pseudo, reg))
224 return ivs->entries[i].hard_reg;
248 ivs->entries = ggc_alloc (5 * sizeof (initial_value_pair));
255 ivs->entries = ggc_realloc (ivs->entries,
260 ivs->entries[ivs->num_entries].hard_reg = gen_rtx_REG (mode, regno);
261 ivs->entries[ivs->num_entries].pseudo = gen_reg_rtx (mode);
263 return ivs->entries[ivs->num_entries++].pseudo;
279 if (GET_MODE (ivs->entries[
[all...]
H A Dstringpool.c66 /* Create with 16K (2^14) entries. */
218 entries;
233 spd->entries = ggc_alloc (sizeof (spd->entries[0]) * spd->nslots);
234 memcpy (spd->entries, ident_hash->entries,
235 spd->nslots * sizeof (spd->entries[0]));
252 ht_load (ident_hash, spd->entries, spd->nslots, spd->nelements, false);
/freebsd-11-stable/include/rpcsvc/
H A Dnis_callback.x66 obj_p entries<>; /* List of objects */
/freebsd-11-stable/sys/arm/include/
H A Dstack.h47 u_int entries; member in struct:unwind_state
/freebsd-11-stable/contrib/llvm-project/lldb/source/Interpreter/
H A DOptionValueBoolean.cpp79 auto entries = llvm::makeArrayRef(autocomplete_entries); local
83 entries = entries.take_front(2);
85 for (auto entry : entries)
/freebsd-11-stable/usr.sbin/mptutil/
H A Dmpt_evt.c96 MPI_LOG_0_ENTRY **entries; local
133 /* Build a list of valid entries and sort them by sequence. */
134 entries = malloc(sizeof(MPI_LOG_0_ENTRY *) * log->NumLogEntries);
135 if (entries == NULL) {
145 entries[num_events] = &log->LogEntry[i];
149 qsort(entries, num_events, sizeof(MPI_LOG_0_ENTRY *), event_compare);
156 mpt_print_event(entries[i], verbose);
159 free(entries);
/freebsd-11-stable/crypto/openssl/crypto/asn1/
H A Dx_name.c146 if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL)
159 if (ret->entries)
160 sk_X509_NAME_ENTRY_free(ret->entries);
174 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free);
210 STACK_OF(X509_NAME_ENTRY) *entries;
235 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i);
236 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
237 entry = sk_X509_NAME_ENTRY_value(entries, j);
239 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
241 sk_X509_NAME_ENTRY_set(entries,
[all...]
/freebsd-11-stable/contrib/gcclibs/libcpp/
H A Dsymtab.c68 table->entries = XCNEWVEC (hashnode, nslots);
81 free (table->entries);
115 node = table->entries[index];
138 node = table->entries[index];
159 table->entries[index] = node;
176 /* Double the size of a hash table, re-hashing existing entries. */
188 p = table->entries;
212 free (table->entries);
214 table->entries = nentries;
225 p = table->entries;
238 ht_load(hash_table *ht, hashnode *entries, unsigned int nslots, unsigned int nelements, bool own) argument
[all...]
/freebsd-11-stable/crypto/heimdal/lib/krb5/
H A Dkeytab_memory.c39 krb5_keytab_entry *entries; member in struct:mkt_data
88 d->entries = NULL;
123 krb5_kt_free_entry(context, &d->entries[i]);
124 free(d->entries);
159 return krb5_kt_copy_entry_contents(context, &d->entries[c->fd++], entry);
177 tmp = realloc(d->entries, (d->num_entries + 1) * sizeof(*d->entries));
183 d->entries = tmp;
185 &d->entries[d->num_entries++]);
203 for(end = d->entries
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/
H A Dtemp_serializer.c189 /* number of entries in the directory
209 /* reference to the entries */
210 svn_fs_x__dirent_t **entries; member in struct:dir_data_t
212 /* size of the serialized entries and don't be too wasteful
213 * (needed since the entries are no longer in sequence) */
253 apr_array_header_t *entries = dir->entries; local
256 int count = entries->nelts;
265 /* copy the hash entries to an auxiliary struct of known layout */
270 dir_data.entries
317 svn_fs_x__dirent_t **entries; local
521 const char **entries = *strings; local
542 const svn_string_t **entries = *strings; local
765 find_entry(svn_fs_x__dirent_t **entries, const char *name, apr_size_t count, svn_boolean_t *found) argument
809 found_entry(const svn_fs_x__dirent_t * const *entries, const char *name, apr_size_t idx) argument
835 const svn_fs_x__dirent_t * const *entries = local
910 apr_array_header_t *entries; local
949 svn_fs_x__dirent_t **entries; local
[all...]
/freebsd-11-stable/tools/tools/commitsdb/
H A Dmake_commit_db67 my @entries = split /----------------------------\n/, $log;
70 shift @entries;
74 foreach my $e (@entries) {

Completed in 286 milliseconds

1234567891011>>