Searched refs:entries (Results 1 - 25 of 28) sorted by relevance

12

/ast/src/cmd/dsslib/ip_t/
H A Dptcopy.c37 b->entries = a->entries;
H A Dptvcopy.c37 b->entries = a->entries;
H A Dptstats.c72 sfprintf(sp, " %2d %6I*u %*I*u ranges %I*u entries %I*u\n", n, sizeof(total_prefixes), total_prefixes, sizeof(S) - 1, sizeof(total_addresses), total_addresses, sizeof(Ptcount_t), (Ptcount_t)dtsize(a->dict), sizeof(a->entries), a->entries, sizeof(Ptcount_t));
H A Dptv.h62 Ptvcount_t entries; member in struct:Ptv_s
H A Dptopen.c122 tab->entries++;
163 tab->entries++;
H A Dptvstats.c110 sfprintf(sp, " %3d %s %s ranges %I*u entries %I*u\n", n, fmtfv(a->size, total_prefixes, 10, ',', 3), sizeof(S) - 1, fmtfv(a->size, total_addresses, 10, ',', 3), sizeof(Ptvcount_t), (Ptvcount_t)dtsize(a->dict), sizeof(a->entries), a->entries);
H A Dpt.h70 Ptcount_t entries; member in struct:Pt_s
H A Dptvopen.c141 tab->entries++;
196 tab->entries++;
/ast/src/cmd/ksh93/tests/
H A Dvartree2.sh80 if [[ "${!dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[*]}" == "" ]] ; then
81 typeset -A dest_tree.l1["$a"].l2["$b"].l3["$c"].entries
86 new_index=$(( ${#dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[@]}+1 ))
91 if [[ "${dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}]}" != "" ]] ; then
96 add_tree_leaf dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}] "${index}" "${tree_mode}"
147 if [[ "${!dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[*]}" == "" ]] ; then
148 typeset -A dest_tree.l1["$a"].l2["$b"].l3["$c"].entries
153 new_index=$(( ${#dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[@]}+1 ))
158 if [[ "${dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}]}" != "" ]] ; then
163 add_tree_leaf dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[
[all...]
H A Dvartree1.sh75 if [[ "${!dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[*]}" == "" ]] ; then
76 typeset -A dest_tree.l1["$a"].l2["$b"].l3["$c"].entries
79 #dest_tree.l1["$a"].l2["$b"].l3["$c"].entries+=( "$index" )
82 new_index=$(( ${#dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[@]}+1 ))
87 if [[ "${dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}]}" != "" ]] ; then
92 add_tree_leaf dest_tree.l1["$a"].l2["$b"].l3["$c"].entries[${new_index}] "${index}" "${tree_mode}"
199 unset 'mytree_global.l1[urw].l2[itc zapfdingbats].l3[medium].entries[abcd].filenames[0]' ||
200 err_exit "variable 'mytree_global.l1[urw].l2[itc zapfdingbats].l3[medium].entries[abcd].filenames[0]' not found"
204 unset 'mytree_local.l1[urw].l2[itc zapfdingbats].l3[medium].entries[abcd].filenames[0]' ||
205 err_exit "variable 'mytree_local.l1[urw].l2[itc zapfdingbats].l3[medium].entries[abc
[all...]
H A Dcomvar.sh107 entries=(
/ast/src/lib/libtk/generic/
H A DtkMenu.c5 * support normal button entries, plus check buttons, radio
7 * entries.
79 XFontStruct *fontPtr; /* Text font for menu entries. NULL means
92 * button entries. NULL means use indicatorFg
105 * entries). Malloc'ed.*/
121 * Flag values defined for menu entries:
157 * Configuration specs for individual menu entries:
254 MenuEntry **entries; /* Array of pointers to all the entries member in struct:Menu
255 * in the menu. NULL means no entries
[all...]
/ast/src/cmd/paxlib/ico/
H A Dico.c66 int entries; member in struct:Ico_s
106 ico->entries = m;
127 if (ap->entry > ico->entries)
296 size = offset = ICO_HEADER + ap->entries * ICO_DIRECTORY;
/ast/src/cmd/cs/vcs_src/
H A Dvcs_search.c201 int lookup_tag(entries, rf, ap, version, domain, tpp, mode)
202 rdirent_t* entries;
218 if (entries)
219 list = entries;
/ast/src/cmd/pax/
H A Dpax-rpm.c61 uint32_t entries; member in struct:__anon185
202 num = head.entries * sizeof(Rpm_entry_t) + head.datalen;
203 message((-2, "%s: head entries=%lu datalen=%lu num=%lu", ap->name, head.entries, head.datalen, num));
H A Dpax-mime.c153 sfsprintf(f->name, ap->stash.head.size, "%s-%d", s, ap->entries + 1);
H A Dpaxlib.h166 size_t entries; /* total number of entries */ member in struct:Paxarchive_s
H A Dformat.c653 ap->entries++;
735 ap->entries++;
H A Dpax.c1996 message((-1, "%s totals entries=%d count=%I*d expand=%I*d offset=%I*d BLOCKSIZE=%I*d n=%I*d blocks=%I*d", ap->name, ap->entries, sizeof(ap->io->count), ap->io->count, sizeof(ap->io->expand), ap->io->expand, sizeof(ap->io->offset), ap->io->offset, sizeof(BLOCKSIZE), BLOCKSIZE, sizeof(n), n, sizeof(n), (n + BLOCKSIZE - 1) / BLOCKSIZE));
1997 if (ap->entries)
/ast/src/lib/libtk/library/demos/
H A Drolodex180 set helpTopics(help) {This application provides only very crude help. Besides the entries in this menu, you can get help on individual windows by moving the mouse cursor over the window and pressing the Help or F1 keys.}
/ast/src/cmd/ksh93/features/
H A Dmath.sh135 : generate the intercept functions and table entries
/ast/src/cmd/dsslib/bgp/
H A Dbgp-mrt.c90 int entries; member in struct:Mrtstate_s
1412 state->entries = BE2(state->buf);
1415 sfprintf(sfstderr, " table entries %u\n", state->entries);
1680 if (state->buf >= state->end || state->entries-- <= 0)
/ast/src/cmd/ksh93/sh/
H A Dname.c104 } entries[NVCACHE]; member in struct:Namcache
1267 for(c=0,xp=nvcache.entries ; c < NVCACHE; xp= &nvcache.entries[++c])
1415 for(c=0,xp=nvcache.entries ; c < NVCACHE; xp= &nvcache.entries[++c])
1438 xp = &nvcache.entries[nvcache.index];
/ast/src/cmd/nmake/
H A Drule.c963 if (a == internal.entries) return n & D_entries;
1506 INIT(entries, ".ENTRIES", 0);
H A Dmake.h247 #define MERGE_SCANNED (1<<5) /* MERGE_ALL but no entries|scanned */
332 #define D_entries (1<<7) /* scanned rule has entries */
576 Rule_t* entries; /* .ENTRIES rule pointer */ member in struct:Internal_s

Completed in 382 milliseconds

12