/freebsd-10-stable/usr.sbin/lpr/chkprintcap/ |
H A D | skimprintcap.h | 38 int entries; member in struct:skiminfo
|
/freebsd-10-stable/contrib/libarchive/libarchive/test/ |
H A D | test_write_format_mtree_classic.c | 38 } entries[] = { variable in typeref:struct:__anon1698 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 D | test_write_format_mtree_classic_indent.c | 38 } entries[] = { variable in typeref:struct:__anon1699 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 D | test_write_format_mtree.c | 37 } entries[] = { variable in typeref:struct:__anon70 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 D | test_write_format_mtree_fflags.c | 42 } entries[] = { variable in typeref:struct:__anon1700 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-10-stable/usr.bin/grep/regex/ |
H A D | hashtable.c | 56 * Initializes a hash table that can hold table_size number of entries, 73 tbl->entries = calloc(sizeof(hashtable_entry *), table_size); 74 if (tbl->entries == NULL) 119 * On hash collision entries are inserted at the next free space, 125 if (tbl->entries[hash] == NULL) 127 else if (memcmp(tbl->entries[hash]->key, key, tbl->key_size) == 0) 129 memcpy(tbl->entries[hash]->value, value, tbl->value_size); 140 tbl->entries[hash] = malloc(sizeof(hashtable_entry)); 141 if (tbl->entries[hash] == NULL) 147 tbl->entries[has [all...] |
/freebsd-10-stable/lib/libc/tests/sys/ |
H A D | queue_test.c | 47 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-10-stable/contrib/subversion/subversion/libsvn_fs_fs/ |
H A D | load-index.c | 52 apr_array_header_t *entries, 63 svn_sort__array(entries, compare_p2l_entry_revision); 66 if (entries->nelts != 0) 83 rev_file, entries, 86 entries, iterpool, 50 svn_fs_fs__load_index(svn_fs_t *fs, svn_revnum_t revision, apr_array_header_t *entries, apr_pool_t *scratch_pool) argument
|
H A D | dump-index.c | 59 /* 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);
|
/freebsd-10-stable/contrib/gcc/ |
H A D | integrate.c | 63 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 D | stringpool.c | 66 /* 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-10-stable/include/rpcsvc/ |
H A D | nis_callback.x | 66 obj_p entries<>; /* List of objects */
|
/freebsd-10-stable/usr.sbin/mptutil/ |
H A D | mpt_evt.c | 96 MPI_LOG_0_ENTRY **entries; local 131 /* Build a list of valid entries and sort them by sequence. */ 132 entries = malloc(sizeof(MPI_LOG_0_ENTRY *) * log->NumLogEntries); 133 if (entries == NULL) 140 entries[num_events] = &log->LogEntry[i]; 144 qsort(entries, num_events, sizeof(MPI_LOG_0_ENTRY *), event_compare); 151 mpt_print_event(entries[i], verbose); 154 free(entries);
|
/freebsd-10-stable/crypto/openssl/crypto/asn1/ |
H A D | x_name.c | 146 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); 200 STACK_OF(X509_NAME_ENTRY) *entries; 225 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i); 226 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { 227 entry = sk_X509_NAME_ENTRY_value(entries, j); 229 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) 232 sk_X509_NAME_ENTRY_free(entries); [all...] |
/freebsd-10-stable/contrib/gcclibs/libcpp/ |
H A D | symtab.c | 68 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-10-stable/crypto/heimdal/lib/krb5/ |
H A D | keytab_memory.c | 39 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-10-stable/tools/tools/commitsdb/ |
H A D | make_commit_db | 67 my @entries = split /----------------------------\n/, $log; 70 shift @entries; 74 foreach my $e (@entries) {
|
/freebsd-10-stable/sys/cam/ |
H A D | cam_sim.h | 82 #define spriv_ptr0 sim_priv.entries[0].ptr 83 #define spriv_ptr1 sim_priv.entries[1].ptr 84 #define spriv_field0 sim_priv.entries[0].field 85 #define spriv_field1 sim_priv.entries[1].field
|
H A D | cam_queue.c | 124 KASSERT(new_size >= queue->entries, ("camq_resize: " 125 "New queue size can't accommodate queued entries (%d < %d).", 126 new_size, queue->entries)); 141 queue->entries * sizeof(cam_pinfo *)); 158 KASSERT(queue->entries < queue->array_size, 160 queue->entries, queue->array_size)); 161 queue->entries++; 162 queue->queue_array[queue->entries] = new_entry; 163 new_entry->index = queue->entries; 164 if (queue->entries ! [all...] |
/freebsd-10-stable/usr.bin/finger/ |
H A D | extern.h | 37 extern int entries; /* Number of people. */
|
/freebsd-10-stable/sys/dev/random/ |
H A D | live_entropy_sources.h | 39 LIST_ENTRY(live_entropy_sources) entries; /* list of providers */ member in struct:live_entropy_sources
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | temp_serializer.c | 189 /* number of entries in the directory 205 /* reference to the entries */ 206 svn_fs_x__dirent_t **entries; member in struct:dir_data_t 208 /* size of the serialized entries and don't be too wasteful 209 * (needed since the entries are no longer in sequence) */ 243 serialize_dir(apr_array_header_t *entries, argument 251 int count = entries->nelts; 257 /* copy the hash entries to an auxiliary struct of known layout */ 261 dir_data.entries = apr_palloc(scratch_pool, entries_len); 265 dir_data.entries[ 306 svn_fs_x__dirent_t **entries; local 531 const char **entries = *strings; local 552 const svn_string_t **entries = *strings; local 758 find_entry(svn_fs_x__dirent_t **entries, const char *name, apr_size_t count, svn_boolean_t *found) argument 802 found_entry(const svn_fs_x__dirent_t * const *entries, const char *name, apr_size_t idx) argument 828 const svn_fs_x__dirent_t * const *entries = local 936 svn_fs_x__dirent_t **entries; local [all...] |
/freebsd-10-stable/usr.bin/column/ |
H A D | column.c | 71 static int entries; /* number of records */ variable 137 if (!entries) 163 if (!--entries) 187 numrows = entries / numcols; 188 if (entries % numcols) 196 if ((base += numrows) >= entries) 214 for (cnt = entries, lp = list; cnt--; ++lp) 235 if ((t = tbl = calloc(entries, sizeof(TBL))) == NULL) 241 for (cnt = 0, lp = list; cnt < entries; ++cnt, ++lp, ++t) { 266 for (cnt = 0, t = tbl; cnt < entries; [all...] |
/freebsd-10-stable/usr.sbin/nscd/ |
H A D | hashtable.h | 59 * Defines the hash table structure, which uses the specified type of entries. 60 * The only restriction for entries is that is that they should have the field, 64 struct entry *entries; \ 78 (table)->entries = calloc(_entries_size, \ 79 sizeof(*(table)->entries)); \ 82 (table)->entries[var].field.capacity = \ 84 (table)->entries[var].field.size = 0; \ 85 (table)->entries[var].field.values = malloc( \ 88 assert((table)->entries[var].field.values != NULL);\ 99 free((table)->entries[va [all...] |
/freebsd-10-stable/sys/netinet/libalias/ |
H A D | alias_mod.c | 140 LIST_FOREACH(b, &handler_chain, entries) { 146 LIST_INSERT_BEFORE(b, p, entries); 152 LIST_INSERT_AFTER(b, p, entries); 154 LIST_INSERT_HEAD(&handler_chain, p, entries); 164 LIST_FOREACH_SAFE(b, &handler_chain, entries, b_tmp) { 166 LIST_REMOVE(b, entries); 230 LIST_FOREACH(p, &handler_chain, entries) {
|