name_top
str_t *r = &name_top(&db->cpp_name)->strp_r;
str_pair_t *func = name_top(&db->cpp_name);
str_pair_t *sp = name_top(&db->cpp_name);
str_pair_len(name_top(&db->cpp_name)) == 0)
if (NAMT(db, n) > 1 && str_pair_len(name_top(&db->cpp_name)) == 0)
sp = name_top((name_t *)n);
#define TOP_L(db) (&(name_top(&(db)->cpp_name)->strp_l))
str_pair_t *name_top(name_t *);
str_pair_t *top = name_top(n);
return (str_pair_merge(name_top(n)));