tlist
ASN1_TAILQ_ENTRY(tlist) tmembers;
ASN1_TAILQ_HEAD(tlisthead, tlist);
static void tlist_header(struct tlist *, const char *, ...) __attribute__((__format__(__printf__, 2, 3)));
static int tlist_cmp(const struct tlist *, const struct tlist *);
static struct tlist *
struct tlist *tl = calloc(1, sizeof(*tl));
tlist_header(struct tlist *t, const char *fmt, ...)
tlist_count(struct tlist *tl)
tlist_add(struct tlist *tl)
tlist_print(struct tlist *tl)
static struct tlist *
struct tlist *ql;
struct tlist *tl = tlist_find_by_name(tname);
struct tlist *ql = tlist_find_by_name(qname);
tlist_cmp(const struct tlist *tl, const struct tlist *ql)
tlist_find_dup(const struct tlist *tl)
struct tlist *ql;
struct tlist *tl;
if (!(tlist = (char **) calloc( c1 + c2 + 1, sizeof ( char *))))
tlist[i] = list1[i];
tlist[i] = list2[j];
tlist[i]= NULL;
*combined_list = tlist;
char ** tlist;
struct krb5_cc_typelist *tlist;
for (tlist = cc_typehead; tlist; tlist = tlist->next) {
if (strcmp (tlist->ops->prefix, pfx) == 0) {
*ops = tlist->ops;
const struct krb5_kt_typelist *tlist;
tlist = kt_typehead;
for (; tlist; tlist = tlist->next) {
if (strcmp (tlist->ops->prefix, pfx) == 0) {
err = (*tlist->ops->resolve)(context, resid, &id);
tp = tlist;
} tlist[] = {
struct tpc_list *list, *tlist;
TAILQ_FOREACH_SAFE(list, &lun->tpc_lists, links, tlist) {
struct tpc_list *list, *tlist;
tlist = tpc_find_list(lun, list->list_id, list->init_idx);
if (tlist != NULL && !tlist->completed) {
if (tlist != NULL) {
TAILQ_REMOVE(&lun->tpc_lists, tlist, links);
free(tlist, M_CTL);
struct tpc_list *list, *tlist;
tlist = tpc_find_list(lun, list->list_id, list->init_idx);
if (tlist != NULL && !tlist->completed) {
if (tlist != NULL) {
TAILQ_REMOVE(&lun->tpc_lists, tlist, links);
free(tlist, M_CTL);
struct tpc_list *list, *tlist;
tlist = tpc_find_list(lun, list->list_id, list->init_idx);
if (tlist != NULL && !tlist->completed) {
if (tlist != NULL) {
TAILQ_REMOVE(&lun->tpc_lists, tlist, links);
free(tlist, M_CTL);
struct tpc_list *list, *tlist;
tlist = tpc_find_list(lun, list->list_id, list->init_idx);
if (tlist != NULL && !tlist->completed) {
if (tlist != NULL) {
TAILQ_REMOVE(&lun->tpc_lists, tlist, links);
free(tlist, M_CTL);
struct tpc_list *list, *tlist;
TAILQ_FOREACH_SAFE(list, &lun->tpc_lists, links, tlist) {
TAILQ_HEAD(, toepcb) tlist = TAILQ_HEAD_INITIALIZER(tlist);
TAILQ_SWAP(&td->stranded_atids, &tlist, toepcb, link);
while ((toep = TAILQ_FIRST(&tlist)) != NULL) {
TAILQ_REMOVE(&tlist, toep, link);
TAILQ_SWAP(&td->stranded_tids, &tlist, toepcb, link);
while ((toep = TAILQ_FIRST(&tlist)) != NULL) {
TAILQ_REMOVE(&tlist, toep, link);
LIST_HEAD(tlist);
LIST_HEAD(tlist);
LIST_HEAD(tlist);
LIST_HEAD(tlist);
LIST_HEAD(tlist);
LIST_HEAD(tlist);
list_splice_init(&catas_list, &tlist);
list_for_each_entry_safe(dev, tmpdev, &tlist, catas_err.list) {
static const char *tlist[3] = {
if ((handle = __rpc_setconf(tlist[i])) == NULL)
dumpcis(struct tuple_list *tlist)
for (tl = tlist; tl; tl = tl->next)
freecis(struct tuple_list *tlist)
while ((tl = tlist) != 0) {
tlist = tl->next;
static struct tuple_list *tlist;
tlist = 0;
last_tl = tlist = read_one_tuplelist(fd, MDF_ATTR, (off_t) 0);
if (find_tuple_in_list(tlist, CIS_NOLINK) == 0 &&
find_tuple_in_list(tlist, CIS_LINKTARGET) == 0 &&
tlist->next = read_one_tuplelist(fd, 0, 0);
return (tlist);
for (tl = tlist; tl; tl = tl->next)
struct typelist *tlist;
tlist = (struct typelist *) resp->data;
printf("There are %d total types:\n", tlist->numtypes);
if (tlist->numtypes > 0) {
for (k = 0; k < tlist->numtypes; k++) {
struct typeinfo *const ti = &tlist->typeinfo[k];