Lines Matching defs:view
215 r->view = x->view;
387 if (!r->view && ((state.questionable & 0x00000800) || !(r->property & P_target)) && *s == '/' && (strncmp(s, internal.pwd, internal.pwdlen) || *(s + internal.pwdlen) != '/'))
404 int view;
439 gs->view = 0;
445 if (!strncmp(path, state.view[i].root, n = state.view[i].rootlen) && (!*(path + n) || *(path + n) == '/'))
449 gs->view = i;
458 while (gs->view++ < state.maxview)
463 sfprintf(internal.nam, "%s/%s", state.view[gs->view].root, gs->name);
466 if (*state.view[gs->view].path != '/')
468 sfprintf(internal.nam, "%s/%s", state.view[gs->view].path, gs->name);
510 if (gs->view++ >= state.maxview)
513 sfprintf(internal.nam, "%s/%s", state.view[gs->view].root, gs->name);
516 if (*state.view[gs->view].path != '/')
518 sfprintf(internal.nam, "%s/%s", state.view[gs->view].path, gs->name);
558 if (!strncmp(path, state.view[i].root, n = state.view[i].rootlen) && (!*(path + n) || *(path + n) == '/'))
569 sfprintf(internal.nam, "%s/%s", state.view[i].root, path);
572 if (*state.view[i].path != '/')
574 sfprintf(internal.nam, "%s/%s", state.view[i].path, path);
594 * return a vector of the top view of files in all views matching pattern s
713 r->view = x->view;
721 x->view = r->view;
776 * return local view rule for r if defined
778 * 0 always returned if !state && == r or if not in local view
794 if (!r->view)
796 if (!strncmp(r->name, state.view[r->view].path, state.view[r->view].pathlen))
798 s = r->name + state.view[r->view].pathlen;
808 if (x && !x->view && (x != r || force))
821 v = state.view[r->view].path;
842 if (x && !x->view && (force || x != r))
881 unsigned int view;
920 view = 0;
945 if (!strncmp(s, state.view[i].root, n = state.view[i].rootlen) && (!*(s + n) || *(s + n) == '/'))
951 sfprintf(internal.nam, "%s/%s", state.view[i].root, s);
959 view = i;
1111 view = state.maxview;
1185 d->view = od->view;
1201 if (d->view <= view)
1219 if (state.believe && d->view >= (state.believe - 1))
1223 r->view = d->view;
1230 view = d->view;
1232 message((-3, "%s: believe time [%s] from view %d", r->name, timestr(tm), view));
1239 view = state.fsview ? iview(&st) : d->view;
1243 view = d->view;
1246 if (!(flags & BIND_DOT) || !view)
1248 if (view && state.fsview && state.expandview)
1253 if (d->view > view)
1257 view = d->view;
1367 view = a ? a->view : state.maxview + 1;
1395 view = 0;
1417 * view view index of dir containing file
1420 if (view > state.maxview)
1421 view = 0;
1424 message((-11, "bindfile(%s): path=%s rule=%s alias=%s view=%d time=%s", name, b, r ? r->name : (char*)0, (x = getrule(b)) && x != r ? x->name : (char*)0, view, timestr(tm)));
1443 r->view = view;
1445 if (!r->view && *b == '/')
1456 r->preview = r->view;
1501 r->view = r->preview = view;
1502 if ((r->dynamic & D_regular) && r->view && (x = localrule(r, 0)))
1505 else if (!state.accept && !view)
1506 r->view = r->active ? r->active->parent->target->view : state.maxview;
1546 r->view = state.maxview;
1709 r->view = 0;
1733 if (!strncmp(s, state.view[i].root, n = state.view[i].rootlen) && (!*(s + n) || *(s + n) == '/'))
1739 sfprintf(tmp, "%s%s", state.view[j].root, s);
1786 unsigned int view;
1792 * recompute view cross product
1815 debug((-5, "%s: recompute view cross product", r->name));
1842 else if (!p->rule->view)
1845 for (view = 0; view <= state.maxview; view++)
1848 s = state.view[view].path->name;
1850 s = state.view[view].path;
1867 if (x->view < view)
1868 x->view = view;
1887 for (view = 0; view <= state.maxview; view++)
1890 s = state.view[view].path->name;
1892 s = state.view[view].path;
1898 z = z->next = cons(state.view[view].path, NiL);
1910 if (!p->rule->view || (p->rule->property & P_target) && !strchr(t, '/'))
1939 if (x->view < view)
1940 x->view = view;
1986 if (!state.logical && r->view && !(r->dynamic & D_bindindex))
1988 s = strcopy(s, state.view[r->view].path);
2002 * return local view path name for r
2034 if (r->view && r->uname)
2041 if (strneq(r->name, state.view[i].path, state.view[i].pathlen) && r->name[state.view[i].pathlen] == '/')
2042 return r->name + state.view[i].pathlen + 1;