Searched defs:top (Results 1 - 25 of 51) sorted by relevance

123

/osnet-11/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dscrreg.c52 setscrreg(int top, int bottom) argument
54 if (top < 0 || bottom < top || stdscr->_maxy <= bottom)
58 stdscr->_top = (short) top;
H A Dwscrreg.c50 wsetscrreg(WINDOW *w, int top, int bottom) argument
52 if (top < 0 || bottom < top || w->_maxy <= bottom)
56 w->_top = (short) top;
/osnet-11/usr/src/lib/libeti/menu/common/
H A Dchk.c38 /* Make sure top is not within a page of the end of the menu */
41 _chk_top(MENU *m, int *top, ITEM *current) argument
43 if (Y(current) < *top) {
44 *top = Y(current);
46 if (Y(current) >= *top + Height(m)) {
47 *top = Y(current) - Height(m) + 1;
52 * This routine makes sure top is in the correct position
58 _chk_current(MENU *m, int *top, ITEM *current) argument
60 if (Y(current) < *top) {
61 *top
[all...]
H A Dtopitem.c39 set_top_row(MENU *m, int top) argument
50 if (top < 0 || top > Rows(m) - Height(m)) {
53 if (top != Top(m)) {
59 current = IthItem(m, RowMajor(m) ? top * Cols(m) : top);
62 _affect_change(m, top, current);
H A Dcuritem.c41 int top; local
52 top = Top(m);
53 _chk_current(m, &top, current);
58 _affect_change(m, top, current);
H A Ddriver.c42 int top; local
56 top = Top(m);
104 if (--top < 0) {
105 ++top;
113 if (++top > Rows(m) - Height(m)) {
114 --top;
122 n = min(Height(m), top);
124 top -= n;
135 n = min(Height(m), Rows(m) - Height(m) - top);
137 top
[all...]
H A Dpattern.c140 int top; local
164 top = Top(m);
175 _chk_current(m, &top, current);
176 _affect_change(m, top, current);
/osnet-11/usr/src/lib/libast/common/hash/
H A Dhashview.c35 * bot==0 pop top scope
36 * bot==top query
37 * bot!=0 push top on bot
43 hashview(Hash_table_t* top, Hash_table_t* bot) argument
50 if (!top || top->frozen)
52 else if (top == bot)
53 bot = top->scope;
56 if (top->scope)
60 sx = &top
[all...]
H A Dhashlook.c42 Hash_table_t* top; local
76 top = tab;
161 if (tab != top && !(flags & HASH_SCOPE)) break;
167 if (tab == top || (flags & HASH_SCOPE))
205 if (tab != top || tab->frozen || (b->hash & (HASH_KEEP|HASH_OPAQUED)) || hashlook(top, value, (flags&(HASH_HASHED|HASH_INTERNAL))|HASH_LOOKUP, NiL))
262 if (tab == top) prev = 0;
270 if (!(flags & HASH_SCOPE)) tab = top;
/osnet-11/usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/
H A Dbt_conv.c67 indx_t i, top; local
86 top = NEXTINDEX(h);
88 for (i = 0; i < top; i++) {
103 for (i = 0; i < top; i++) {
135 indx_t i, top; local
147 top = NEXTINDEX(h);
149 for (i = 0; i < top; i++) {
164 for (i = 0; i < top; i++) {
H A Dbt_debug.c207 indx_t cur, top, lim; local
235 top = NEXTINDEX(h);
236 lim = top > lim ? lim : top;
238 h->lower, h->upper, top);
H A Dbt_split.c625 indx_t full, half, nxt, off, skip, top, used; local
640 for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) {
677 || nxt == top - 1) {
737 for (off = 0; nxt < top; ++off) {
769 if (skip == top)
823 indx_t nxt, top; local
825 for (recs = 0, nxt = 0, top = NEXTINDEX(h); nxt < top; ++nxt)
/osnet-11/usr/src/lib/krb5/plugins/kdb/db2/libdb2/recno/
H A Drec_search.c74 indx_t top; local
87 for (idx = 0, top = NEXTINDEX(h);;) {
89 if (++idx == top || total + r->nrecs > recno)
/osnet-11/usr/src/lib/libcurses/screen/
H A Dinit_pair.c81 short top = -1; local
98 if (top == -1)
99 top = i;
104 if (top != -1) {
105 _VIRTTOP = top;
H A Doverlap.c56 top, bottom, left, right; local
71 top = _MAX(sby, dby); bottom = _MIN(sey, dey);
74 sby = top - sby; sbx = left - sbx;
76 dby = top - dby; dbx = left - dbx;
H A Dtparm.c100 long top; member in struct:__anon1509
112 if (st->top < 0) {
115 return (st->stack[st->top]);
121 if (st->top >= (st->stacksize - 1)) {
128 st->stack[++st->top] = (i);
134 if (st->top < 0) {
137 return (st->stack[st->top--]);
147 if (st->top < 0) {
150 return ((char *)(st->stack[st->top--]));
156 st->top
[all...]
/osnet-11/usr/src/grub/grub-0.97/stage2/
H A Dcommon.c122 unsigned long long top; local
126 top = bottom;
136 && desc->BaseAddr <= top
137 && desc->BaseAddr + desc->Length > top)
139 top = desc->BaseAddr + desc->Length;
147 if (top > 0xFFFFFFFF)
148 top = 0xFFFFFFFF;
150 return (unsigned long) top - bottom;
/osnet-11/usr/src/cmd/sendmail/db/btree/
H A Dbt_rsearch.c77 db_indx_t indx, top; local
204 for (indx = 0, top = NUM_ENT(h);;) {
206 if (++indx == top || total + bi->nrecs >= recno)
220 for (indx = 0, top = NUM_ENT(h);;) {
222 if (++indx == top || total + ri->nrecs >= recno)
365 db_indx_t indx, top; local
368 top = NUM_ENT(h);
373 for (indx = 0; indx < top; indx += P_INDX)
378 for (indx = 0; indx < top; indx += O_INDX)
385 for (indx = 0; indx < top; ind
[all...]
/osnet-11/usr/src/lib/fm/topo/modules/sun4v/pcibus/common/
H A Dpci_sun4v.c194 tnode_t *top; local
201 top = node;
202 while ((parent = topo_node_parent(top)) != NULL) {
203 top = parent;
214 wp = topo_mod_walk_init(mod, top, platform_pci_fru_cb, &walkdata, &err);
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Net/
H A DPOP3.pm160 sub top subroutine
162 @_ == 2 || @_ == 3 or croak 'usage: $pop3->top( MSGNUM [, NUMLINES ])';
461 =item top ( MSGNUM [, NUMLINES ] )
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Pod/
H A DInputObjects.pm751 (top) of the parse tree.
769 =head2 $ptree-E<gt>B<top()>
771 my $top_node = $ptree->top();
772 $ptree->top( $top_node );
773 $ptree->top( @children );
775 This method gets/sets the top node of the parse-tree. If no arguments are
778 then the reference is assumed to a parse-tree and becomes the new top node.
780 children for the top node.
784 sub top { subroutine
792 ## let parse_tree() & ptree() be aliases for the 'top' metho
[all...]
/osnet-11/usr/src/lib/libshell/common/sh/
H A Denv.c232 Evar_t *vp, *vpnext,*top; local
240 for(top=0,vp = ep->freelist; vp; vp = vpnext)
245 vp->un.next = top;
246 top = vp;
249 for(vp=top; vp; vp = vpnext)
H A Dexpand.c274 struct argnod *top = 0; local
383 ap->argchn.ap = top;
384 top = ap;
H A Dmain.c447 Sfio_t *top; local
465 if(top = fcfile())
469 while(top=sfstack(iop,SF_POPSTACK))
470 sfclose(top);
/osnet-11/usr/src/grub/grub2/grub-core/gnulib/
H A Dgetopt.c151 int top = d->optind;
161 string can work normally. Our top argument must be in the range
163 if (d->__nonoption_flags_len > 0 && top >= d->__nonoption_flags_max_len)
167 char *new_str = malloc (top + 1);
174 '\0', top + 1 - d->__nonoption_flags_max_len);
175 d->__nonoption_flags_max_len = top + 1;
181 while (top > middle && middle > bottom)
183 if (top - middle > middle - bottom)
189 /* Swap it with the top part of the top segmen
148 int top = d->optind; local
[all...]

Completed in 44 milliseconds

123