Searched refs:entries (Results 101 - 125 of 273) sorted by relevance

1234567891011

/freebsd-9.3-release/usr.bin/makewhatis/
H A Dmakewhatis.c830 struct dirent **entries; local
843 nentries = scandir(section_dir, &entries, NULL, alphasort);
854 struct page_info *info = new_page_info(section_dir, entries[i]);
857 free(entries[i]);
859 free(entries);
902 struct dirent **entries; local
912 nsections = scandir(dir_name, &entries, select_sections, alphasort);
922 snprintf(section_dir, sizeof section_dir, "%s/%s", dir_name, entries[i]->d_name);
925 entries[i]->d_name, machine);
930 dir_name, entries[
[all...]
/freebsd-9.3-release/sys/gnu/fs/xfs/
H A Dxfs_dir_leaf.c412 * Copy out directory entries for getdents(), for shortform directories.
438 * Collect all the entries into the buffer.
461 * Scan the directory data for the rest of the entries.
486 * Sort the entries on hash then entno.
535 * Loop putting entries into the user buffer.
539 * Save the first resid in a run of equal-hashval entries
653 entry = &leaf->entries[0];
675 entry = &leaf->entries[0];
746 INT_GET(leaf->entries[
825 * Rebalance the entries acros
[all...]
H A Dxfs_attr_leaf.c526 * Copy out entries of shortform attribute lists for attr_list().
529 * we have to calculate each entries' hashvalue and sort them before
604 * Scan the attribute list for the rest of the entries, storing
644 * Sort the entries on hash then entno.
671 * Loop putting entries into the user buffer.
703 * Check a leaf attribute block to see if all the entries would fit into
717 entry = &leaf->entries[0];
721 continue; /* don't copy partial entries */
802 entry = &leaf->entries[0];
805 continue; /* don't copy partial entries */
[all...]
/freebsd-9.3-release/contrib/cvs/src/
H A Dupdate.c71 List *entries));
74 List *entries));
79 List *entries));
388 * as we go, we make sure there is no static entries file and write the
588 * repository is the repository. entries and srcfiles are the pre-parsed
589 * entries and source control files.
709 Register (finfo->entries, finfo->file,
823 update_filesdone_proc (callerdat, err, repository, update_dir, entries)
828 List *entries;
839 ignore_files (ignlist, entries, update_di
[all...]
H A Dcvs.h457 List *Find_Directories PROTO((char *repository, int which, List *entries));
458 void Entries_Close PROTO((List *entries));
460 void Subdirs_Known PROTO((List *entries));
545 /* The pre-parsed entries for this directory. */
546 List *entries; member in struct:file_info
663 List *entries));
666 List *entries));
668 const char *update_dir, List *entries));
786 /* Pointer to entries file node */
810 /* CVSADM_BASEREV stuff, from entries
[all...]
H A Dcheckout.c1117 List *entries; local
1120 entries = Entries_Open (0, NULL);
1133 finfo.entries = entries;
1144 Register (entries, finfo.file,
1154 Entries_Close (entries);
H A Dcheckin.c129 Register (finfo->entries, finfo->file, vers->vn_rcs, vers->ts_user,
H A DMakefile.am46 entries.c \
H A Dtag.c32 List *entries));
40 List *entries));
543 check_filesdoneproc (callerdat, err, repos, update_dir, entries)
548 List *entries;
1079 tag_dirproc (callerdat, dir, repos, update_dir, entries)
1084 List *entries;
1310 val_direntproc (callerdat, dir, repository, update_dir, entries)
1315 List *entries;
1385 entries in val-tags in general (that is, the val-tags entry
/freebsd-9.3-release/sbin/fsck/
H A Dfsck.c73 TAILQ_ENTRY(entry) entries;
404 TAILQ_FOREACH(e, &selhead, entries)
417 TAILQ_FOREACH(e, &opthead, entries)
435 TAILQ_FOREACH(e, &opthead, entries)
452 TAILQ_INSERT_TAIL(list, e, entries);
/freebsd-9.3-release/share/examples/autofs/driver/
H A Dautodriver.c62 struct autoentry *entries; variable in typeref:struct:autoentry
213 ent->ae_next = entries;
214 entries = ent;
237 for (ent = entries; ent != NULL; ent = ent->ae_next) {
285 * Process an autofs request, scan the list of entries in the config
300 for (ent = entries; ent != NULL; ent = ent->ae_next) {
/freebsd-9.3-release/contrib/libarchive/libarchive/
H A Darchive_write_set_format_zip.c37 * - Only supports regular file and folder entries.
194 char entries[2]; member in struct:zip_central_directory_end
295 /* Directory entries should have a size of 0. */
502 int entries; local
512 * Formatting central directory file header fields that are fixed for all entries.
525 entries = 0;
565 entries++;
572 archive_le16enc(&end.entries_disk, entries);
573 archive_le16enc(&end.entries, entries);
[all...]
/freebsd-9.3-release/bin/ls/
H A Dls.c139 static int f_whiteout; /* show whiteout entries */
422 * If -W, show whiteout entries
585 int entries, needstats; local
675 for (cur = list, entries = 0; cur; cur = cur->fts_link) {
835 ++entries;
839 * If there are no entries to display, we normally stop right
844 if (!entries && (!(f_longform || f_size) || p == NULL))
848 d.entries = entries;
878 * All other levels use the sort function. Error entries remai
[all...]
/freebsd-9.3-release/contrib/pf/pfctl/
H A Dpfctl_altq.c100 TAILQ_INSERT_TAIL(&altqs, altq, entries);
108 TAILQ_FOREACH(altq, &altqs, entries) {
121 TAILQ_FOREACH(altq, &altqs, entries) {
140 TAILQ_FOREACH(altq, &altqs, entries) {
285 TAILQ_FOREACH(altq, &altqs, entries) {
362 TAILQ_FOREACH(altq, &altqs, entries) {
536 TAILQ_FOREACH(altq, &altqs, entries) {
605 TAILQ_FOREACH(altq, &altqs, entries) {
628 TAILQ_FOREACH(altq, &altqs, entries) {
725 TAILQ_FOREACH(altq, &altqs, entries) {
[all...]
/freebsd-9.3-release/sys/dev/agp/
H A Dagp_ati.c128 u_int32_t entries = apsize >> AGP_PAGE_SHIFT; local
133 sc->ag_entries = entries;
134 sc->ag_virtual = malloc(entries * sizeof(u_int32_t), M_AGP,
/freebsd-9.3-release/usr.sbin/acpi/acpidump/
H A Dacpi.c504 u_int i, entries; local
509 entries = (sdp->Length - sizeof(ACPI_TABLE_MCFG)) /
512 for (i = 0; i < entries; i++, alloc++) {
809 int i, entries; local
816 entries = (rsdp->Length - sizeof(ACPI_TABLE_HEADER)) / addr_size;
818 for (i = 0; i < entries; i++) {
1081 int entries, i; local
1086 entries = (rsdp->Length - sizeof(ACPI_TABLE_HEADER)) / addr_size;
1087 for (i = 0; i < entries; i++) {
1285 int entries, local
[all...]
/freebsd-9.3-release/contrib/amd/conf/nfs_prot/
H A Dnfs_prot_freebsd3.h93 #define dl_entries entries
/freebsd-9.3-release/contrib/binutils/opcodes/
H A Dcgen-opc.c42 /* Return number of hash table entries to use for N elements. */
243 /* Use the number of compiled in entries as an estimate for the
272 const CGEN_HW_ENTRY **hw = cd->hw_table.entries;
290 const CGEN_HW_ENTRY **hw = cd->hw_table.entries;
311 const CGEN_OPERAND **op = cd->operand_table.entries;
329 return cd->operand_table.entries[opnum];
/freebsd-9.3-release/contrib/gdb/include/
H A Dhashtab.h102 PTR * GTY ((use_param (""), length ("%h.size"))) entries;
104 /* Current size (in entries) of the hash table */
/freebsd-9.3-release/sys/dev/uart/
H A Duart_cpu_ia64.c77 for (i = 0; i < tbl->entries; i++) {
/freebsd-9.3-release/sys/ofed/drivers/infiniband/hw/mthca/
H A Dmthca_provider.c674 static struct ib_cq *mthca_create_cq(struct ib_device *ibdev, int entries, argument
684 if (entries < 1 || entries > to_mdev(ibdev)->limits.max_cqes)
716 for (nent = 1; nent <= entries; nent <<= 1)
752 int entries)
778 ret = mthca_alloc_cq_buf(dev, &cq->resize_buf->buf, entries);
787 cq->resize_buf->cqe = entries - 1;
796 static int mthca_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata) argument
805 if (entries < 1 || entries > de
751 mthca_alloc_resize_buf(struct mthca_dev *dev, struct mthca_cq *cq, int entries) argument
[all...]
/freebsd-9.3-release/sys/ofed/include/linux/mlx4/
H A Dcq.h148 int entries, struct mlx4_mtt *mtt);
/freebsd-9.3-release/sys/sys/
H A Dcdrio.h73 struct cdr_cue_entry *entries; member in struct:cdr_cuesheet
/freebsd-9.3-release/sys/amd64/include/xen/
H A Dhypercall.h167 unsigned long *frame_list, unsigned int entries)
169 return _hypercall2(int, set_gdt, frame_list, entries);
166 HYPERVISOR_set_gdt( unsigned long *frame_list, unsigned int entries) argument
/freebsd-9.3-release/sys/cam/ctl/
H A Dctl_ioctl.h332 struct ctl_ooa_entry *entries; /* filled in kernel */ member in struct:ctl_ooa
350 struct ctl_port_entry *entries; /* filled in kernel */ member in struct:ctl_port_list
544 * NEED_MORE_SPACE: The allocated length of the entries field is too
565 * alloc_len: The length of the data buffer allocated for entries.
573 * fill_len: The amount of data filled in the storage for entries.

Completed in 391 milliseconds

1234567891011