215 return (t1->
tail = t2);
234 return (t1->
tail = t2);
266 for (; tp != 0; tp =
next) {
282 for (tp = tree; tp; tp = tp->
next) {
283 if (type == 0 || tp->
type == type)
284 if ((result = action(tp)) != 0)
298 for (count = 0, tp = tree; tp; tp = tp->
next)
299 if (type == 0 || tp->
type == type)
304 for (count = 0, tp = tree; tp; tp = tp->
next)
305 if (type == 0 || tp->
type == type)
TOK822 * tok822_cut_after(TOK822 *tp)
TOK822 * tok822_sub_keep_before(TOK822 *t1, TOK822 *t2)
TOK822 * tok822_prepend(TOK822 *t1, TOK822 *t2)
TOK822 * tok822_unlink(TOK822 *tp)
TOK822 ** tok822_grep(TOK822 *tree, int type)
int tok822_apply(TOK822 *tree, int type, TOK822_ACTION action)
TOK822 * tok822_free_tree(TOK822 *tp)
TOK822 * tok822_cut_before(TOK822 *tp)
TOK822 * tok822_sub_append(TOK822 *t1, TOK822 *t2)
TOK822 * tok822_append(TOK822 *t1, TOK822 *t2)
TOK822 * tok822_free(TOK822 *)
int(* TOK822_ACTION)(TOK822 *)
TOK822 * tok822_sub_keep_after(TOK822 *t1, TOK822 *t2)
TOK822 * tok822_sub_prepend(TOK822 *t1, TOK822 *t2)
void * mymalloc(ssize_t len)