/freebsd-10.0-release/usr.sbin/lpr/chkprintcap/ |
H A D | skimprintcap.h | 38 int entries; member in struct:skiminfo
|
/freebsd-10.0-release/contrib/libarchive/libarchive/test/ |
H A D | test_write_format_mtree_classic.c | 38 } entries[] = { variable in typeref:struct:__anon1603 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:__anon1604 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:__anon1602 69 /* Write entries */ 70 for (i = 0; entries[i].path != NULL; i++) { 72 archive_entry_set_mtime(ae, entries[i].mtime, 0); 73 assert(entries[i].mtime == archive_entry_mtime(ae)); 74 archive_entry_set_mode(ae, entries[i].mode); 75 assert(entries[i].mode == archive_entry_mode(ae)); 76 archive_entry_set_uid(ae, entries[i].uid); 77 assert(entries[i].uid == archive_entry_uid(ae)); 78 archive_entry_set_gid(ae, entries[ [all...] |
H A D | test_write_format_mtree_fflags.c | 42 } entries[] = { variable in typeref:struct:__anon1605 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.0-release/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.0-release/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.0-release/include/rpcsvc/ |
H A D | nis_callback.x | 65 obj_p entries<>; /* List of objects */
|
/freebsd-10.0-release/crypto/openssh/ |
H A D | hostfile.c | 62 struct hostkey_entry *entries; member in struct:hostkeys 237 ret->entries = NULL; 254 debug3("%s: loading entries for host \"%.100s\" from file \"%s\"", 312 hostkeys->entries = xrealloc(hostkeys->entries, 313 hostkeys->num_entries + 1, sizeof(*hostkeys->entries)); 314 hostkeys->entries[hostkeys->num_entries].host = xstrdup(host); 315 hostkeys->entries[hostkeys->num_entries].file = xstrdup(path); 316 hostkeys->entries[hostkeys->num_entries].line = linenum; 317 hostkeys->entries[hostkey [all...] |
/freebsd-10.0-release/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.0-release/crypto/openssl/crypto/asn1/ |
H A D | x_name.c | 137 if ((ret->entries=sk_X509_NAME_ENTRY_new_null()) == NULL) 150 if (ret->entries) 151 sk_X509_NAME_ENTRY_free(ret->entries); 165 sk_X509_NAME_ENTRY_pop_free(a->entries,X509_NAME_ENTRY_free); 181 STACK_OF(X509_NAME_ENTRY) *entries; 200 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i); 201 for(j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { 202 entry = sk_X509_NAME_ENTRY_value(entries, j); 204 if(!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) 207 sk_X509_NAME_ENTRY_free(entries); [all...] |
/freebsd-10.0-release/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.0-release/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.0-release/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.0-release/sys/cam/ |
H A D | cam_queue.c | 124 KASSERT(new_size >= queue->entries, ("camq_resize: " 125 "New queue size can't accomodate 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.0-release/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.0-release/usr.bin/finger/ |
H A D | extern.h | 37 extern int entries; /* Number of people. */
|
/freebsd-10.0-release/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.0-release/contrib/subversion/subversion/libsvn_fs_fs/ |
H A D | temp_serializer.c | 220 /* number of entries in the directory */ 235 /* reference to the entries */ 236 svn_fs_dirent_t **entries; member in struct:hash_data_t 238 /* size of the serialized entries and don't be too wasteful 239 * (needed since the entries are no longer in sequence) */ 279 serialize_dir(apr_hash_t *entries, apr_pool_t *pool) argument 287 apr_size_t count = apr_hash_count(entries); 292 /* copy the hash entries to an auxilliary struct of known layout */ 296 hash_data.entries = apr_palloc(pool, entries_len); 299 for (hi = apr_hash_first(pool, entries); h 346 svn_fs_dirent_t **entries; local 576 const char **entries = *strings; local 597 const svn_string_t **entries = *strings; local 844 find_entry(svn_fs_dirent_t **entries, const char *name, apr_size_t count, svn_boolean_t *found) argument 896 const svn_fs_dirent_t * const *entries = local 966 svn_fs_dirent_t **entries; local [all...] |
/freebsd-10.0-release/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(1, \ 79 sizeof(*(table)->entries) * (_entries_size)); \ 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.0-release/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) {
|
/freebsd-10.0-release/sys/powerpc/powermac/ |
H A D | powermac_thermal.c | 66 SLIST_ENTRY(pmac_fan_le) entries; 71 SLIST_ENTRY(pmac_sens_le) entries; 103 SLIST_FOREACH(sensor, &sensors, entries) { 121 SLIST_FOREACH(fan, &fans, entries) { 124 SLIST_FOREACH(sensor, &sensors, entries) { 169 SLIST_INSERT_HEAD(&fans, list_entry, entries); 181 SLIST_INSERT_HEAD(&sensors, list_entry, entries);
|
/freebsd-10.0-release/usr.bin/ktrdump/ |
H A D | ktrdump.c | 81 * Reads the ktr trace buffer from kernel memory and prints the trace entries. 95 int entries; local 171 entries = sb.st_size / sizeof(*buf); 177 if (kvm_read(kd, nl[1].n_value, &entries, sizeof(entries)) 180 if ((buf = malloc(sizeof(*buf) * entries)) == NULL) 185 kvm_read(kd, bufptr, buf, sizeof(*buf) * entries) == -1) 223 i = (index - 1) % entries; 291 i = (i - 1) % entries; 293 if (++i == entries) [all...] |
/freebsd-10.0-release/usr.bin/gencat/ |
H A D | gencat.c | 90 LIST_ENTRY(_msgT) entries; 96 LIST_ENTRY(_setT) entries; 498 set = set->entries.le_next) { 502 msg = msg->entries.le_next) { 549 set = set->entries.le_next) { 553 msg = msg->entries.le_next) { 595 for (; p != NULL && p->setId < setId; q = p, p = p->entries.le_next); 607 LIST_INSERT_HEAD(&sethead, p, entries); 609 LIST_INSERT_AFTER(q, p, entries); 635 for (; p != NULL && p->msgId < msgId; q = p, p = p->entries [all...] |