Lines Matching defs:entries
388 /* A cluster of entries to reflect the argp tree structure. */
422 struct hol_entry *entries;
423 /* The number of entries in this hol. If this field is zero, the others
431 /* Clusters of entries in this hol. */
437 hol_cluster in which these entries occur, or 0, if at the root. */
469 hol->entries = malloc (sizeof (struct hol_entry) * hol->num_entries);
472 assert (hol->entries && hol->short_options);
476 /* Fill in the entries. */
478 for (o = opts, entry = hol->entries; ! oend (o); entry++)
549 free (hol->entries);
640 struct hol_entry *entry = hol->entries;
760 /* The group numbers by which the entries should be ordered; if either is
767 /* The entries are not within the same cluster, so we can't compare them
779 /* Both entries are in clusters, we can just compare the clusters. */
784 /* The entries are both in the same cluster and group, so compare them
851 for (i = 0, e = hol->entries; i < hol->num_entries; i++, e++)
853 qsort (hol->entries, hol->num_entries, sizeof (struct hol_entry),
872 /* Merge entries. */
878 hol->entries = more->entries;
883 /* Append the entries in MORE to those in HOL, taking care to only add
890 struct hol_entry *entries =
896 assert (entries && short_options);
900 __mempcpy (__mempcpy (entries, hol->entries,
902 more->entries,
908 for (e = entries, left = hol->num_entries; left > 0; e++, left--)
911 /* Now add the short options from MORE, fixing up its entries
940 free (hol->entries);
943 hol->entries = entries;
1260 for (entry = hol->entries, num = hol->num_entries; num > 0; entry++, num--)
1374 for (entry = hol->entries, nentries = hol->num_entries
1386 for (entry = hol->entries, nentries = hol->num_entries
1393 for (entry = hol->entries, nentries = hol->num_entries
1403 cluster in which ARGP's entries should be clustered, or 0. */