Searched refs:lnode (Results 1 – 6 of 6) sorted by relevance
41 } lnode; typedef46 lnode *head; // List head47 lnode *cur; // Pointer to current node52 static inline lnode *list_get_cur(llist *l) { return l->cur; } in list_get_cur()53 void list_append(llist *l, lnode *node);57 lnode *list_find_inode(llist *l, unsigned long i);
36 void list_append(llist *l, lnode *node) in list_append()38 lnode* newnode; in list_append()43 newnode = malloc(sizeof(lnode)); in list_append()70 lnode* nextnode; in list_clear()71 register lnode* cur; in list_clear()87 lnode *list_find_inode(llist *l, unsigned long i) in list_find_inode()89 register lnode* cur; in list_find_inode()
164 lnode node; in collect_process_info()215 lnode *n = list_get_cur(&l); in report_finding()
49 __strong ACBTree *lnode; /* pointer to left node */ variable67 @property (retain) ACBTree *lnode;
77 @synthesize lnode;127 tmp.lnode = self;201 tnew.lnode = self;524 tr.lnode = t0;543 t1.lnode = self;
49 root.lnode = nil;72 root.lnode = nil;