HomeSort by relevance Sort by last modified time
    Searched full:lnode (Results 1 - 9 of 9) sorted by null

  /external/libcap-ng/libcap-ng-0.7/utils/
proc-llist.h 41 } lnode; typedef in typeref:struct:_lnode
46 lnode *head; // List head
47 lnode *cur; // Pointer to current node
52 static inline lnode *list_get_cur(llist *l) { return l->cur; }
53 void list_append(llist *l, lnode *node);
57 lnode *list_find_inode(llist *l, unsigned long i);
proc-llist.c 36 void list_append(llist *l, lnode *node)
38 lnode* newnode;
43 newnode = malloc(sizeof(lnode));
70 lnode* nextnode;
71 register lnode* cur;
87 lnode *list_find_inode(llist *l, unsigned long i)
89 register lnode* cur;
netcap.c 164 lnode node;
215 lnode *n = list_get_cur(&l);
  /external/srec/seti/sltsEngine/include/
linklist.h 23 typedef struct LNode {
25 struct LNode *next;
26 struct LNode *prev;
27 }LNode;
30 struct LNode *head;
31 struct LNode *curr;
32 struct LNode *tail;
  /external/srec/seti/sltsEngine/src/
linklist_impl.c 43 LNode node;
52 LNode *n;
62 static LNode *AllocNode()
83 static void FreeNode(LNode *n)
104 static LNode *AllocNode()
106 return (LNode *)lts_alloc(1, sizeof(LNode));
108 static void FreeNode(LNode *n)
125 LNode *newnode = AllocNode();
194 LNode *curr
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ACBTree.h 42 __strong ACBTree *lnode; /* pointer to left node */ variable
60 @property (retain) ACBTree *lnode; variable
AMutableDictionary.m 49 root.lnode = nil;
72 root.lnode = nil;
ACBTree.m 64 @synthesize lnode;
106 tmp.lnode = self;
180 tnew.lnode = self;
503 tr.lnode = t0;
522 t1.lnode = self;
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp     [all...]

Completed in 768 milliseconds