lnode 22 tools/capdis.c struct lnode *next; lnode 28 tools/capdis.c struct lnode *head; lnode 54 tools/capdis.c struct lnode *p, *n; lnode 69 tools/capdis.c struct lnode * new_node(t_address address, t_value data) { lnode 70 tools/capdis.c struct lnode *node; lnode 72 tools/capdis.c node = (struct lnode *) malloc (sizeof (struct lnode)); lnode 87 tools/capdis.c struct lnode * l_search(struct llist *ls, t_address address) { lnode 88 tools/capdis.c struct lnode *node; lnode 106 tools/capdis.c struct lnode *node; lnode 122 tools/capdis.c struct lnode *p, *l; lnode 165 tools/capdis.c struct lnode * addr_hash_get(struct llist **addr_hash,t_address addr) { lnode 678 tools/capdis.c struct lnode *label = addr_hash_get(branch_list,adr); lnode 137 tools/chdk_dasm.c struct lnode *next; lnode 143 tools/chdk_dasm.c struct lnode *head; lnode 169 tools/chdk_dasm.c struct lnode *p, *n; lnode 184 tools/chdk_dasm.c struct lnode * new_node(t_address address, t_value data) { lnode 185 tools/chdk_dasm.c struct lnode *node; lnode 187 tools/chdk_dasm.c node = (struct lnode *) malloc (sizeof (struct lnode)); lnode 202 tools/chdk_dasm.c struct lnode * l_search(struct llist *ls, t_address address) { lnode 203 tools/chdk_dasm.c struct lnode *node; lnode 221 tools/chdk_dasm.c struct lnode *node; lnode 237 tools/chdk_dasm.c struct lnode *p, *l; lnode 365 tools/chdk_dasm.c struct lnode * lptr ; lnode 461 tools/chdk_dasm.c struct lnode * lptr ; lnode 1298 tools/chdk_dasm.c struct lnode* lptr = dcd_list->head; lnode 1317 tools/chdk_dasm.c struct lnode* lptr = l_search(dcd_list,addr); lnode 1349 tools/chdk_dasm.c struct lnode* lptr = l_search(dcd_list,addr); lnode 86 tools/chdk_dasm.h struct lnode * l_search(struct llist *ls, t_address address);