/*
* This function compares contexts. It returns a 0 if no match and a 1 if
* there is a match
*/
static int context_match(llist *l)
{
if (event_se) { /* This does the "or" check if -se test */
if (event_subject) {
if (l->s.avc && alist_find_subj(l->s.avc)) {
do {
if (strmatch(event_subject,
l->s.avc->cur->scontext))
return 1;
} while(alist_next_subj(l->s.avc));
}
}
if (event_object) {
if (l->s.avc) {
alist_first(l->s.avc);
if (alist_find_obj(l->s.avc)) {
do {
if (strmatch(event_object,
l->s.avc->cur->tcontext))
return 1;
} while(alist_next_obj(l->s.avc));
}
}
}
return 0;
} else {
if (event_subject) {
if (l->s.avc == NULL)
return 0;
if (alist_find_subj(l->s.avc)) {
do {
if (strmatch(event_subject,
l->s.avc->cur->scontext))
return 1;
} while(alist_next_subj(l->s.avc));
}
return 0;
}
if (event_object) {
if (l->s.avc == NULL)
return 0;
if (alist_find_obj(l->s.avc)) {
do {
if (strmatch(event_object,
l->s.avc->cur->tcontext))
return 1;
} while(alist_next_obj(l->s.avc));
}
return 0;
}
}
return 1;
}
static historyp make_variable_history(void)
{
alist al;
historyp hp;
hpair *pair;
al = htable_list(var_table);
hp = new_history(FALSE);
for (pair = alist_first(al); pair != NULL; pair = alist_next(al))
alist_append(hp->completions, zstrdup(pair->key));
alist_delete(al);
return hp;
}
int main(void)
{
alist al;
char *t1 = "def", *t2 = "abc", *t3 = "xyz";
char *s;
al = alist_new();
assert(alist_count(al) == 0);
assert(alist_current(al) == NULL);
assert(alist_current_idx(al) == -1);
alist_append(al, t1);
assert(alist_count(al) == 1);
assert(alist_current(al) == t1);
assert(alist_current_idx(al) == 0);
alist_append(al, t2);
assert(alist_count(al) == 2);
assert(alist_current(al) == t2);
assert(alist_current_idx(al) == 1);
s = alist_first(al);
assert(s == t1);
assert(alist_current(al) == t1);
assert(alist_current_idx(al) == 0);
s = alist_next(al);
assert(s == t2);
assert(alist_current(al) == t2);
assert(alist_current_idx(al) == 1);
s = alist_next(al);
assert(s == NULL);
assert(alist_current(al) == NULL);
assert(alist_current_idx(al) == -1);
alist_prepend(al, t3);
assert(alist_count(al) == 3);
assert(alist_current(al) == t3);
assert(alist_current_idx(al) == 0);
printf("elements:\n");
for (s = alist_first(al); s != NULL; s = alist_next(al))
printf("element %d: %s\n", alist_current_idx(al), s);
alist_sort(al, sorter);
printf("sorted elements:\n");
for (s = alist_first(al); s != NULL; s = alist_next(al))
printf("element %d: %s\n", alist_current_idx(al), s)
; assert(alist_at(al, 0) == t2);
assert(alist_at(al, 1) == t1);
assert(alist_at(al, 2) == t3);
alist_clear(al);
assert(alist_count(al) == 0);
assert(alist_current(al) == NULL);
assert(alist_current_idx(al) == -1);
alist_insert(al, 5, t1);
assert(alist_count(al) == 1);
assert(alist_current(al) == t1);
assert(alist_current_idx(al) == 0);
alist_insert(al, 0, t2);
assert(alist_count(al) == 2);
assert(alist_current(al) == t2);
assert(alist_current_idx(al) == 0);
alist_insert(al, 1, t3);
assert(alist_count(al) == 3);
assert(alist_at(al, 0) == t2);
assert(alist_at(al, 1) == t3);
assert(alist_at(al, 2) == t1);
assert(alist_current(al) == t3);
assert(alist_current_idx(al) == 1);
alist_delete(al);
printf("alist test successful.\n");
return 0;
}
