exclude
_BIG5Exclude *exclude;
TAILQ_FOREACH(exclude, &ei->excludes, entry) {
if (c >= exclude->start && c <= exclude->end)
_BIG5Exclude *exclude;
exclude = TAILQ_LAST(&ei->excludes, _BIG5ExcludeList);
if (exclude != NULL && (wint_t)start <= exclude->end)
exclude = (void *)malloc(sizeof(*exclude));
if (exclude == NULL)
exclude->start = (wint_t)start;
exclude->end = (wint_t)end;
TAILQ_INSERT_TAIL(&ei->excludes, exclude, entry);
_BIG5Exclude *exclude;
while ((exclude = TAILQ_FIRST(&ei->excludes)) != NULL) {
TAILQ_REMOVE(&ei->excludes, exclude, entry);
free(exclude);
if (compat_is_excluded(pwd->pw_name, st->exclude)) {
if (st->exclude != NULL)
st->exclude->close(st->exclude);
DB *exclude;
&st->exclude);
compat_exclude(&pw_name[1], &st->exclude);
if (compat_is_excluded((char *)entry.data, st->exclude))
const struct dma_fence_ops *exclude,
if (shared[i]->ops == exclude)
if (ret >= 0 && excl && excl->ops != exclude) {
const struct dma_fence_ops *exclude,
static struct pattern_list exclude = STAILQ_HEAD_INITIALIZER(exclude);
if (!STAILQ_EMPTY(&exclude) && match_pattern(&exclude, pathname))
add_pattern(&exclude, optarg);
LIST_ENTRY(exclude) link;
static LIST_HEAD(, exclude) excludes;
struct exclude *e;
struct exclude *e;
int exclude = 0;
exclude = 1;
return exclude;
return !exclude;