bot
void bot(void);
bot();
bot();
bot();
#define reverse(bot, top) { \
tmp = *bot; *bot++ = *s; *s++ = tmp; \
} while(bot < s); \
int bot;
bot = ((yday + 11 - wday) %
top = bot -
if (yday >= bot) {
w = 1 + ((yday - bot) /
int n, target, cur_period, bot, top, sc_region;
for (bot = __virtscr->maxy - 1; bot >= 0; bot--) {
if (__virtscr->alines[bot]->flags & __ISDIRTY &&
(__virtscr->alines[bot]->hash != curscr->alines[bot]->hash ||
!lineeq(__virtscr->alines[bot]->line,
curscr->alines[bot]->line,
__virtscr->alines[bot]->flags &= ~__ISDIRTY;
for (i = top + 1, j = 0; i < bot; i++) {
if (bot < __virtscr->maxy - 1)
for (bsize = bot - top; bsize >= THRESH; bsize--) {
for (startw = top; startw <= bot - bsize; startw++)
for (starts = top; starts <= bot - bsize; starts++) {
bsize, THRESH, starts, startw, curw, curs, top, bot);
if (bot < curs)
bot = curs - 1;
sc_region = bot - top + 1;
for (j = top; j <= bot; j++) {
|| target > bot)
(n < 0 && target <= bot && target > bot + n))
scrolln(starts, startw, curs, bot, top);
scrolln(int starts, int startw, int curs, int bot, int top)
top > 3 || bot + 3 < __virtscr->maxy) &&
tputs(tiparm(change_scroll_region, top, bot),
__mvcur(0, 0, bot, 0, 1);
__mvcur(bot, 0, 0, 0, 1);
__mvcur(oy, ox, bot, 0, 1);
__mvcur(oy, ox, bot, 0, 1);
__mvcur(top, 0, bot - n + 1, 0, 1);
__mvcur(bot - n + 1, 0, oy, ox, 1);
bot + 3 < __virtscr->maxy) && scroll_reverse != NULL)))
tputs(tiparm(change_scroll_region, top, bot),
__mvcur(oy, ox, bot + n + 1, 0, 1);
if (parm_rindex != NULL && bot == __virtscr->maxy)
bot == __virtscr->maxy)
__mvcur(bot + n + 1, 0, top, 0, 1);
if (!bot)
bot = getsecs();
bp->bp_secs = htons((u_short)(getsecs() - bot));
static satime_t bot;
aa_dorangeroute(struct ifaddr *ifa, u_int bot, u_int top, int cmd)
if (bot > top)
while (bot <= top) {
while (((bot & ~mask1) >= bot)
&& ((bot | mask1) <= top)) {
addr.s_net = htons(bot);
bot = (bot | mask1) + 1;
int top, bot; /* boundaries of bin search, inclusive */
bot = 0;
while (top >= bot) {
mid = (top+bot)/2;
bot = mid + 1;
slot = bot; /* place it would have gone */
int mid, top = ttop, bot = 0, cmpv = 1;
for (mid = top / 2; bot + 1 != top; mid = (bot + top) / 2) {
bot = mid;
if (bot != 0) {
memmove(flist, flist + 1, bot * sizeof(MFILE *));
flist[bot] = rec;
if (bot == 0 && cmpv != 0) {
bot = -1;
bot++;
memmove(flist + bot + 1, flist + bot, (ttop - bot) * sizeof(MFILE *));
flist[bot] = rec;
pct(u_long top, u_long bot)
if (bot == 0)
ans = (long)((quad_t)top * 100 / bot);
#define PCT(top, bot) (int)pct((u_long)(top), (u_long)(bot))