Searched refs:entries (Results 201 - 225 of 483) sorted by relevance

1234567891011>>

/macosx-10.10.1/emacs-93/emacs/lisp/gnus/
H A Dgnus-topic.el98 (?a (gnus-topic-articles-in-topic entries) ?d)
132 (defun gnus-topic-articles-in-topic (entries)
135 (while entries
136 (when (numberp (setq number (car (pop entries))))
204 "Return entries for all visible groups in TOPIC.
496 (entries (gnus-topic-find-groups
511 (all-entries entries)
525 (while (setq entry (pop entries))
586 level all-entries unrea
[all...]
/macosx-10.10.1/BerkeleyDB-21/db/tcl/
H A Dtcl_internal.c72 LIST_INSERT_HEAD(&__db_infohead, p, entries);
85 LIST_FOREACH(p, &__db_infohead, entries)
100 LIST_FOREACH(p, &__db_infohead, entries)
115 LIST_FOREACH(p, &__db_infohead, entries)
144 LIST_REMOVE(p, entries);
/macosx-10.10.1/file_cmds-242/ls/
H A Dprint.c504 if ((lastentries == -1) || (dp->entries > lastentries)) {
505 lastentries = dp->entries;
506 if ((array = realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) {
512 memset(array, 0, dp->entries * sizeof(FTSENT *));
545 assert(base < dp->entries);
/macosx-10.10.1/CPANInternal-159.1/Class-C3-XS-0.13/
H A DXS.xs274 !cand means no seqs have any entries left to check */
358 I32 entries;
471 entries = AvFILLp(linear_av) + 1;
473 while (entries--) {
480 if(entries > 0) {
484 while (entries--) {
/macosx-10.10.1/xnu-2782.1.97/security/
H A Dmac_base.c372 mac_policy_list.entries = kalloc(sizeof(struct mac_policy_list_element) * MAC_POLICY_LIST_CHUNKSIZE);
373 bzero(mac_policy_list.entries, sizeof(struct mac_policy_list_element) * MAC_POLICY_LIST_CHUNKSIZE);
688 /* copy old entries into new list */
689 memcpy(tmac_policy_list_element, mac_policy_list.entries,
694 kfree(mac_policy_list.entries,
698 mac_policy_list.entries = tmac_policy_list_element;
707 if (mac_policy_list.entries[i].mpc == NULL)
710 if (strcmp(mac_policy_list.entries[i].mpc->mpc_name,
744 if (mac_policy_list.entries[i].mpc == NULL) {
765 mac_policy_list.entries[*handle
[all...]
/macosx-10.10.1/IOFireWireSBP2-425/IOFireWireSBP2/
H A DIOFireWireSBP2LSIWorkaroundDescriptor.cpp435 ( UInt32 entries )
441 fRangeTableSize = sizeof( IOPhysicalRange ) * entries;
448 entries, status) );
454 ( UInt32 entries )
460 UInt32 requestedSize = sizeof( IOPhysicalRange ) * entries;
465 entries) );
472 entries) );
/macosx-10.10.1/bind9-45.101/bind9/contrib/dlz/drivers/
H A Ddlz_ldap_driver.c352 "LDAP no entries to process.");
356 /* loop through all entries returned */
576 int entries; local
809 entries = ldap_count_entries((LDAP *) dbi->dbconn, ldap_msg);
810 if (entries == 0)
812 else if (entries > 0)
818 entries = ldap_count_entries((LDAP *) dbi->dbconn, ldap_msg);
819 if (entries == 0)
821 else if (entries > 0)
/macosx-10.10.1/ipsec-286.1.1/ipsec-tools/racoon/
H A Dcrypto_openssl.c212 if (sk_X509_NAME_ENTRY_num(a->entries)
213 != sk_X509_NAME_ENTRY_num(b->entries))
214 return sk_X509_NAME_ENTRY_num(a->entries)
215 -sk_X509_NAME_ENTRY_num(b->entries);
216 for (i=sk_X509_NAME_ENTRY_num(a->entries)-1; i>=0; i--)
218 na=sk_X509_NAME_ENTRY_value(a->entries,i);
219 nb=sk_X509_NAME_ENTRY_value(b->entries,i);
/macosx-10.10.1/xnu-2782.1.97/bsd/kern/
H A Dkern_authorization.c644 KAUTH_DEBUG(" ACL - %d entries, initial residual %x", eval->ae_count, eval->ae_residual);
648 * Skip inherit-only entries.
786 int entries, error, index; local
796 * ACL and any inherited ACE entries from the container object.
821 * there are potentially inheritable ACE entries, but
835 * Compute the number of entries in the result ACL by scanning the
838 entries = 0;
842 entries++;
856 entries += initial->acl_entrycount;
862 * If there is no initial ACL, and no inheritable entries, th
[all...]
/macosx-10.10.1/xnu-2782.1.97/osfmk/kern/
H A Dsched_multiq.c107 * The entries array is 5K currently so it'd be really great to reduce.
118 * Decide how to support psets - do we need duplicate entries for each pset,
190 /* Each level in the run queue corresponds to one entry in the entries array */
192 struct sched_entry entries[NRQS]; member in struct:sched_group
413 sched_group->entries[i].runq = 0;
414 sched_group->entries[i].sched_pri = i;
437 assert(sched_group->entries[i].runq == 0);
438 assert(sched_group->entries[i].sched_pri == i);
467 return &group->entries[pri];
965 entry_queue_enqueue_entry(main_entryq, &group->entries[sched_pr
[all...]
/macosx-10.10.1/ntfs-84/kext/
H A Dntfs_dir.c673 * @entries: [IN/OUT] pointer to number of entries that have been returned
689 * If we successfully returned an entry *@entries is incremented.
692 struct dirent *de, uio_t uio, int *entries)
810 (*entries)++;
953 * ntfs_readdir - read directory entries into a supplied buffer
954 * @dir_ni: directory inode to read directory entries from
955 * @uio: destination in which to return the read entries
957 * @numdirent: return number of entries returned (can be NULL)
959 * ntfs_readdir() reads directory entries startin
691 ntfs_do_dirent(ntfs_volume *vol, INDEX_ENTRY *ie, struct dirent *de, uio_t uio, int *entries) argument
1062 int eof, entries, err; local
[all...]
H A Dntfs_index.h134 unsigned entry_nr; /* Index of the @entry in the @entries
189 INDEX_ENTRY **entries; /* Pointers to the index entries in the node. */ member in struct:_ntfs_index_context
190 unsigned nr_entries; /* Current number of entries in @entries. */
191 unsigned max_entries; /* Maximum number of entries in @entries. */
194 * entries.
222 * entries to the right-hand node. And if @cur_ictx->promote_inserted
224 * move all following entries t
[all...]
/macosx-10.10.1/BerkeleyDB-21/db/dbinc/
H A Ddb_page.h191 * | next pgno | entries | hf offset |
231 db_indx_t entries; /* 20-21: Number of items on the page. */ member in struct:_db_page
281 #define NUM_ENT(p) (((PAGE *)p)->entries)
382 * count is stored in the entries field.
385 #define OV_REF(p) (((PAGE *)p)->entries)
H A Dtcl_db.h60 LIST_ENTRY(dbtcl_info) entries; member in struct:dbtcl_info
/macosx-10.10.1/PostgreSQL-97/Support/
H A D58_postgres_setup.rb318 if d.entries.count > 2 # allow for ".." and "."
354 if d.entries.count > 2
378 if d.entries.count > 2 # allow for ".." and "."
/macosx-10.10.1/bind9-45.101/bind9/lib/dns/
H A Dacache.c71 * CLEANERINCREMENT is how many entries are examined in one pass.
76 #define DNS_ACACHE_CLEANERINCREMENT 1000 /* Number of entries. */
150 int increment; /* Number of entries to
153 unsigned long ncleaned; /* Number of entries cleaned
193 ISC_LIST(dns_acacheentry_t) entries;
214 /* Data for Management of cache entries */
286 if (ISC_LIST_EMPTY(acache->entries) && acache->dbentries == 0) {
304 * Release the dependency of all entries, and detach them.
306 for (entry = ISC_LIST_HEAD(acache->entries);
319 ISC_LIST_UNLINK(acache->entries, entr
[all...]
H A Dadb.c69 * For type 3 negative cache entries, we will remember that the address is
145 * Bucketized locks and lists for entries.
152 dns_adbentrylist_t *entries; member in struct:dns_adb
249 * persist until that time. This allows entries found
343 * Private flag(s) for entries.
491 * no longer grow beyond 2^28 entries.)
568 * Move entries to new arrays.
571 e = ISC_LIST_HEAD(adb->entries[i]);
573 ISC_LIST_UNLINK(adb->entries[i], e, plink);
580 e = ISC_LIST_HEAD(adb->entries[
[all...]
/macosx-10.10.1/cxxfilt-11/cxxfilt/binutils/
H A Dresres.c200 for (re = rd->entries; re != NULL; re = re->next)
602 (*resources)->entries = NULL;
605 for (pp = &(*resources)->entries; *pp != NULL; pp = &(*pp)->next)
/macosx-10.10.1/xnu-2782.1.97/bsd/hfs/
H A Dhfs_attrlist.c97 * It does not do . and .. entries. The problem is if you are at the root of the
101 * simpler, this call will only return entries in its directory, hfs like.
149 * It does not do . and .. entries. The problem is if you are at the root of the
153 * simpler, this call will only return entries in its directory, hfs like.
289 * Obtain a list of catalog entries and pack their attributes until
290 * the output buffer is full or maxcount entries have been packed.
356 /* Process the catalog entries. */
420 /* Pack catalog entries into attribute buffer. */
501 /* If we skipped catalog entries for reserved files that should
510 * If there are more entries the
953 u_int32_t entries; local
1589 u_int32_t entries; local
[all...]
/macosx-10.10.1/ICU-531.30/icuSources/layout/
H A DContextualGlyphSubstProc2.cpp116 const LEReferenceTo<LookupSingle> segment = lookupTable6->lookupSingle(lookupTable6->entries, gid);
/macosx-10.10.1/Security-57031.1.35/securityd/src/
H A Dtokenacl.cpp64 // read entries
71 ObjectAcl::entries(count, infos);
/macosx-10.10.1/iodbc-42.5/iodbc/iodbcadm/
H A Ddrvconn.c316 wchar_t entries[4096]; local
329 /* Get list of entries in .dsn file */
332 entries, sizeof (entries)/sizeof(wchar_t), &read_len))
335 for (p = entries; *p != '\0'; p = p_next)
/macosx-10.10.1/libauto-186/
H A Dauto_impl_utilities.c178 auto_refcount_history_entry_t entries[ENTRY_COUNT]; member in struct:__anon9175
238 history->entries[e].oldCount = UNUSED;
243 entry = &history->entries[history->nextEntry++];
276 entry = &history->entries[e];
339 // don't add NULL entries
365 // Provide more room in the hashtable and rehash the old entries.
384 // rehash old entries
531 // don't add NULL entries
558 // Provide more room in the hashtable and rehash the old entries.
580 // rehash old entries
[all...]
/macosx-10.10.1/ruby-106/ruby/include/ruby/
H A Dst.h100 struct st_packed_entry *entries; member in struct:st_table::__anon12202::__anon12204
/macosx-10.10.1/ruby-106/ruby/sample/openssl/
H A Dc_rehash.rb92 Dir.entries(".").each do |entry|

Completed in 518 milliseconds

1234567891011>>