bottom
bottom[des] = *cp;
if (tabok(bottom[sour], des)) {
temp = bottom[sour];
bottom[sour] = NIL;
if (bottom[des] == NIL)
bottom[des] = temp;
static struct cardtype *bottom[4], *found[4], *tableau[4];
bottom[i] = tableau[i];
cp != bottom[0] && cp != bottom[1] &&
cp != bottom[2] && cp != bottom[3])
ne += bbox.isset(BOX::bottom);
dir = BOX::bottom;
int CO, LI, last, bottom, ch, number, trail;
bottom = LI - 1;
mvaddch(y = w->ypos[h] = bottom,
: (y == bottom ? lowleft : left))
: (y == bottom ? lowright : right))
: (y == bottom ? lower : normal)))
bottom & __CHARTEXT, bottom & __ATTRIBUTES);
bottom |= (bottom & __COLOR) ? (win->wattr & ~__COLOR) : win->wattr;
bottom |= (bottom & __COLOR) ? (win->battr & ~__COLOR) : win->battr;
lp[i].ch = (wchar_t) bottom & __CHARTEXT;
lp[i].attr = (attr_t) bottom & __ATTRIBUTES;
S(bottom, bs, WACS_HLINE);
cchar_t left, right, bottom, top, topleft, topright, botleft, botright;
memcpy(&bottom, bs, sizeof(cchar_t));
memcpy(&bottom, WACS_HLINE, sizeof(cchar_t));
bottom.vals[0], bottom.attributes );
bottom.attributes |= (bottom.attributes & __COLOR) ?
bottom.attributes |= (bottom.attributes & __COLOR) ?
win->alines[endy]->line[i + j].ch = bottom.vals[0];
win->alines[endy]->line[i + j].attr = bottom.attributes;
if (bottom.elements > 1) {
for (k = 1; k < bottom.elements; k++) {
np->ch = bottom.vals[ k ];
border(chtype left, chtype right, chtype top, chtype bottom, chtype topleft,
return wborder(stdscr, left, right, top, bottom, topleft, topright,
wborder(WINDOW *win, chtype left, chtype right, chtype top, chtype bottom,
if (!(bottom & __CHARTEXT))
bottom |= ACS_HLINE;
wsetscrreg(WINDOW *win, int top, int bottom)
if (top < 0 || bottom >= win->maxy || bottom - top < 1)
win->scr_b = bottom;
wgetscrreg(WINDOW *win, int *top, int *bottom)
*bottom = win->scr_b;
setscrreg(int top, int bottom)
return wsetscrreg(stdscr, top, bottom);
getscrreg(int *top, int *bottom)
return wgetscrreg(stdscr, top, bottom);
int top, bottom, middle, omiddle;
bottom = mohandle->mo.mo_nstring;
if (top > bottom)
middle = (top + bottom) / 2;
bottom = middle;
uintptr_t bottom;
bottom = ((uintptr_t)&bottom) & ~(stacksize-1);
return (struct puffs_cc *)bottom;
prop_dictionary_augment(prop_dictionary_t bottom, prop_dictionary_t top)
d = prop_dictionary_copy_mutable(bottom);
mp_digit *top, *bottom;
bottom = a->dp + a->used - 1 - b;
*top-- = *bottom--;
BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
if (bottom) {
(r)->bottom = (b)->y + (b)->height -1; \
(b)->height = (r)->bottom - (r)->top +1; \
#define INIT_RECT(rc,l,t,r,b) do{(rc)->left = l; (rc)->right = r; (rc)->top = t; (rc)->bottom = b;}while (0)
long bottom;
screen_up(struct ite_softc *ip, int top, int bottom, int lines)
if (top >= bottom)
if (top + lines >= bottom) {
RZ3AlphaErase(ip->grf, 0, top, bottom - top, ip->cols);
RZ3AlphaCopy(ip->grf, 0, top+lines, 0, top, ip->cols, bottom-top-lines+1);
RZ3AlphaErase(ip->grf, 0, bottom - lines + 1, ip->cols, lines);
screen_down (struct ite_softc *ip, int top, int bottom, int lines)
if (top >= bottom)
if (top + lines >= bottom) {
RZ3AlphaErase(ip->grf, 0, top, bottom - top, ip->cols);
RZ3AlphaCopy(ip->grf, 0, top, 0, top+lines, ip->cols, bottom-top-lines+1);
screen_up(struct ite_softc *ip, int top, int bottom, int lines)
if (top >= bottom)
if (top + lines >= bottom)
retina_clear (ip, top, 0, bottom - top, ip->cols);
short x = (1 + bottom - (top + lines)) * (md->TX / 16) - 1;
f += (1 + bottom - lines) * md->TX * 2;
p += (1 + bottom - lines) * (md->TX/4);
screen_down(struct ite_softc *ip, int top, int bottom, int lines)
if (top >= bottom)
if (top + lines >= bottom)
retina_clear (ip, top, 0, bottom - top, ip->cols);
short x = (1 + bottom - (top + lines)) * (md->TX / 16) - 1;
p += (1 + bottom - (top + lines)) * md->TX;
static void screen_up(struct ite_softc *ip, int top, int bottom, int lines)
printf("screen_up %d %d %d ->",top,bottom,lines);
if (top >= bottom)
if (top + lines >= bottom)
ulowell_clear (ip, top, 0, bottom - top, ip->cols);
cmd[4] = (bottom-top+1) * ip->ftheight; /* h */
ulowell_clear(ip, bottom-lines+1, 0, lines-1, ip->cols);
static void screen_down(struct ite_softc *ip, int top, int bottom, int lines)
printf("screen_down %d %d %d ->",top,bottom,lines);
if (top >= bottom)
if (top + lines >= bottom)
ulowell_clear (ip, top, 0, bottom - top, ip->cols);
cmd[4] = (bottom - top - lines) * ip->ftheight; /* h */
long bottom;
SCALEY(UNSCALEY(_rect.bottom - _rect.top) - 60), TRUE);
int cy = _rect.bottom - _rect.top;
_rect.bottom - _rect.top, TRUE);
ratio_y = (rect.bottom - rect.top) * 100 / dlg.cy;
u_int16_t bottom;
gm->height = image.bottom - image.top;
memcpy(&image->bottom, d + 14, 2);
short bottom;
sc->atrq.bottom = sc->atrq.top;
sc->atrs.bottom = sc->atrs.top;
if (db_tr != dbch->bottom)
tr = dbch->bottom;
dbch->bottom = STAILQ_NEXT(tr, link);
if (dbch->bottom == dbch->top) {
tr = dbch->bottom;
dbch->bottom = dbch->top;
for (i = 0, dbch->bottom = dbch->top; i < dbch->ndb - 1; i++)
dbch->bottom = STAILQ_NEXT(dbch->bottom, link);
dbch->bottom->db[dbch->bottom->dbcnt - 1].db.desc.depend, 0xf);
for (i = 0, dbch->bottom = dbch->top; i < dbch->ndb - 1; i++)
dbch->bottom = STAILQ_NEXT(dbch->bottom, link);
FWOHCI_DMA_CLEAR(dbch->bottom->db[db_tr->dbcnt - 1].db.desc.depend,
struct fwohcidb_tr *bdb_tr = dbch->bottom;
dbch->bottom = db_tr;
struct fwohcidb_tr *bottom;
int bottom; /* bottom of buffer (oldest element) */
return buf->top == buf->bottom;
buff->bottom = 0;
b = buff->bottom;
int b = buff->bottom;
if (b == buff->bottom)
buff->bottom = (b + 1) % SERNUM_BUFFER_LENGTH;
for (b = buff->bottom, num = buff->sernum[b] - 1;
buff->bottom, buff->top, num, buff->ExpSN));
eqh->curs_pos.y <= eqh->curs_box.bottom ) {
eqh->curs_pos.y <= eqh->curs_box.bottom ) {
eq_header[unit]->curs_box.bottom = 0;
short bottom;
bottom = 2048;
adder->y_clip_max = bottom;
adder->scroll_y_max = bottom;
short bottom;
ARG_INT(bottom);
report_return(wsetscrreg(win, top, bottom));
ARG_INT(bottom);
report_return(setscrreg(top, bottom));
short top, left, bottom, right;
Candidate *bottom; /* Start of found transformation path */
bottom = NULL;
bottom = FindThem(&sources, cs);
if (bottom == NULL) {
for (targ = bottom;
while (bottom != NULL && bottom->parent != NULL) {
CandidateSearcher_AddIfNew(cs, bottom);
bottom = bottom->parent;
bottom = src;
if (bottom == NULL) {
if (bottom->node == NULL)
bottom->node = Targ_GetNode(bottom->file);
for (src = bottom; src->parent != NULL; src = src->parent) {
if (bottom != NULL)
CandidateSearcher_AddIfNew(cs, bottom);
ring->supply = ring->consume = ring->bottom = buffer;
ring->top = ring->bottom+ring->size;
ring->bottom <= ring->clearto)
ring->consume = ring->supply = ring->bottom;
(*encryptor)(ring->bottom, s - ring->bottom);
#define ring_decrement(d,a,c) (((a)-(c) >= (d)->bottom)? \
*bottom, /* lowest address in buffer */
n1 = TerminalWrite(ttyoring.bottom, n1);