Lines Matching refs:le
52 entry_to_citer(const atf_list_t *l, const struct list_entry *le)
56 iter.m_entry = le;
62 entry_to_iter(atf_list_t *l, struct list_entry *le)
66 iter.m_entry = le;
74 struct list_entry *le;
76 le = (struct list_entry *)malloc(sizeof(*le));
77 if (le != NULL) {
78 le->m_prev = le->m_next = NULL;
79 le->m_object = object;
80 le->m_managed = managed;
84 return le;
89 delete_entry(struct list_entry *le)
91 if (le->m_managed)
92 free(le->m_object);
94 free(le);
102 struct list_entry *le;
104 le = new_entry(object, managed);
105 if (le != NULL) {
106 le->m_prev = prev;
107 le->m_next = next;
109 prev->m_next = le;
110 next->m_prev = le;
113 return le;
127 const struct list_entry *le = citer.m_entry;
128 PRE(le != NULL);
129 return le->m_object;
135 const struct list_entry *le = citer.m_entry;
138 PRE(le != NULL);
141 newciter.m_entry = le->m_next;
164 const struct list_entry *le = iter.m_entry;
165 PRE(le != NULL);
166 return le->m_object;
172 const struct list_entry *le = iter.m_entry;
175 PRE(le != NULL);
178 newiter.m_entry = le->m_next;
230 struct list_entry *le;
233 le = (struct list_entry *)l->m_begin;
235 while (le != NULL) {
238 lenext = le->m_next;
239 delete_entry(le);
240 le = lenext;
254 struct list_entry *le = l->m_begin;
255 return entry_to_iter(l, le->m_next);
261 const struct list_entry *le = l->m_begin;
262 return entry_to_citer(l, le->m_next);
357 struct list_entry *le, *next, *prev;
362 le = new_entry_and_link(data, managed, prev, next);
363 if (le == NULL)