Lines Matching refs:le
48 entry_to_citer(const atf_list_t *l, const struct list_entry *le)
52 iter.m_entry = le;
58 entry_to_iter(atf_list_t *l, struct list_entry *le)
62 iter.m_entry = le;
70 struct list_entry *le;
72 le = (struct list_entry *)malloc(sizeof(*le));
73 if (le != NULL) {
74 le->m_prev = le->m_next = NULL;
75 le->m_object = object;
76 le->m_managed = managed;
80 return le;
85 delete_entry(struct list_entry *le)
87 if (le->m_managed)
88 free(le->m_object);
90 free(le);
98 struct list_entry *le;
100 le = new_entry(object, managed);
101 if (le != NULL) {
102 le->m_prev = prev;
103 le->m_next = next;
105 prev->m_next = le;
106 next->m_prev = le;
109 return le;
123 const struct list_entry *le = citer.m_entry;
124 PRE(le != NULL);
125 return le->m_object;
131 const struct list_entry *le = citer.m_entry;
134 PRE(le != NULL);
137 newciter.m_entry = le->m_next;
160 const struct list_entry *le = iter.m_entry;
161 PRE(le != NULL);
162 return le->m_object;
168 const struct list_entry *le = iter.m_entry;
171 PRE(le != NULL);
174 newiter.m_entry = le->m_next;
226 struct list_entry *le;
229 le = (struct list_entry *)l->m_begin;
231 while (le != NULL) {
234 lenext = le->m_next;
235 delete_entry(le);
236 le = lenext;
250 struct list_entry *le = l->m_begin;
251 return entry_to_iter(l, le->m_next);
257 const struct list_entry *le = l->m_begin;
258 return entry_to_citer(l, le->m_next);
353 struct list_entry *le, *next, *prev;
358 le = new_entry_and_link(data, managed, prev, next);
359 if (le == NULL)