front
static struct address_cache *front;
for (cptr = front; cptr != NULL; cptr = cptr->ac_next) {
for (cptr = front; cptr != NULL; cptr = cptr->ac_next) {
front = cptr->ac_next;
ad_cache->ac_next = front;
front = ad_cache;
cptr = front;
ad_cache->ac_next = front;
front = ad_cache;
front = ad_cache;
if ((front = mmap(NULL, (size_t)sb.st_size, PROT_READ, MAP_SHARED, fd, (off_t)0)) == MAP_FAILED)
back = front + sb.st_size;
match *= (look(key, front, back));
look(wchar_t *string, unsigned char *front, unsigned char *back)
front = binary_search(string, front, back);
front = linear_search(string, front, back);
if (front)
print_from(string, front, back);
return (front ? 0 : 1);
binary_search(wchar_t *string, unsigned char *front, unsigned char *back)
p = front + (back - front) / 2;
while (p < back && back > front) {
front = p;
p = front + (back - front) / 2;
return (front);
linear_search(wchar_t *string, unsigned char *front, unsigned char *back)
while (front < back) {
switch (compare(string, front, back)) {
return (front);
SKIP_PAST_NEWLINE(front, back);
print_from(wchar_t *string, unsigned char *front, unsigned char *back)
for (; front < back && compare(string, front, back) == EQUAL; ++front) {
for (; front < back && *front != '\n'; ++front)
if (putchar(*front) == EOF)
unsigned char *back, *front;
front(selwin, 1);
void front(struct ww *, char);
front(w, 0);