Lines Matching refs:ele
44 struct sh_le *ele = SH_LIST_FIRST(l, sh_le);
48 while (ele != NULL) {
49 buf[i] = ele->content;
50 ele = SH_LIST_NEXT(ele, sh_les, sh_le);
51 if (ele != NULL)
66 struct sh_le *ele = NULL, *last_ele = (struct sh_le*)-1;
73 last_ele = ele;
74 ele = calloc(1, sizeof(struct sh_le));
75 ele->content = c[0];
77 SH_LIST_INSERT_HEAD(l, ele, sh_les, sh_le);
80 last_ele, ele, sh_les, sh_le);
91 struct sh_le *ele = SH_LIST_FIRST(l, sh_le);
94 if (ele != NULL)
95 free(ele);
104 struct sh_le *ele = SH_LIST_FIRST(l, sh_le);
109 while (SH_LIST_NEXT(ele, sh_les, sh_le) != NULL)
110 ele = SH_LIST_NEXT(ele, sh_les, sh_le);
112 if (ele) {
113 SH_LIST_REMOVE(ele, sh_les, sh_le);
114 free(ele);
124 struct sh_le *ele = SH_LIST_FIRST(l, sh_le);
126 while (ele != NULL) {
127 if (ele->content == item[0])
129 ele = SH_LIST_NEXT(ele, sh_les, sh_le);
131 if (ele)
132 SH_LIST_REMOVE(ele, sh_les, sh_le);
141 struct sh_le *ele = calloc(1, sizeof(struct sh_le));
143 ele->content = item[0];
144 SH_LIST_INSERT_HEAD(l, ele, sh_les, sh_le);
154 struct sh_le *ele = NULL;
162 ele = calloc(1, sizeof(struct sh_le));
163 ele->content = item[0];
164 SH_LIST_INSERT_HEAD(l, ele, sh_les, sh_le);
166 ele = calloc(1, sizeof(struct sh_le));
167 ele->content = item[0];
168 SH_LIST_INSERT_AFTER(last_ele, ele, sh_les, sh_le);
180 struct sh_le *ele = NULL;
189 ele = calloc(1, sizeof(struct sh_le));
190 ele->content = item[0];
191 SH_LIST_INSERT_BEFORE(l, before_ele, ele, sh_les, sh_le);
202 struct sh_le *ele = NULL;
211 ele = calloc(1, sizeof(struct sh_le));
212 ele->content = item[0];
213 SH_LIST_INSERT_AFTER(after_ele, ele, sh_les, sh_le);
222 struct sh_le *ele = NULL;
224 while ((ele = SH_LIST_FIRST(l, sh_le)) != NULL) {
225 SH_LIST_REMOVE(ele, sh_les, sh_le);
226 free(ele);
238 struct sh_le *ele = NULL, *lele = NULL;
250 SH_LIST_FOREACH(ele, l, sh_les, sh_le) {
251 if (ele->content != c[0])
262 ele = SH_LIST_FIRST(l, sh_le);
264 lele = ele;
266 if (ele->content != c[0])
269 ele = SH_LIST_NEXT(ele, sh_les, sh_le);
273 ele = lele;
278 /* ele should be the last element in the list... */
280 if (ele->sh_les.sle_next != -1)
284 if (SH_LIST_NEXT(ele, sh_les, sh_le) != NULL)
295 lele = ele;
296 if (ele->content != c[0])
298 ele = SH_LIST_PREV(ele, sh_les, sh_le);
303 ele = lele;
308 if (ele != SH_LIST_FIRST(l, sh_le))
326 struct sh_te *ele = SH_TAILQ_FIRST(l, sh_te);
330 while (ele != NULL) {
331 buf[i] = ele->content;
332 ele = SH_TAILQ_NEXT(ele, sh_tes, sh_te);
333 if (ele != NULL)
348 struct sh_te *ele = NULL, *last_ele = (struct sh_te*)-1;
355 ele = calloc(1, sizeof(struct sh_te));
356 ele->content = c[0];
359 SH_TAILQ_INSERT_HEAD(l, ele, sh_tes, sh_te);
362 l, last_ele, ele, sh_tes, sh_te);
363 last_ele = ele;
374 struct sh_te *ele = SH_TAILQ_FIRST(l, sh_te);
376 if (ele != NULL)
377 SH_TAILQ_REMOVE(l, ele, sh_tes, sh_te);
379 free(ele);
388 struct sh_te *ele = SH_TAILQ_FIRST(l, sh_te);
393 while (SH_TAILQ_NEXT(ele, sh_tes, sh_te) != NULL)
394 ele = SH_TAILQ_NEXT(ele, sh_tes, sh_te);
396 if (ele != NULL) {
397 SH_TAILQ_REMOVE(l, ele, sh_tes, sh_te);
398 free(ele);
409 struct sh_te *ele = SH_TAILQ_FIRST(l, sh_te);
411 while (ele != NULL) {
412 if (ele->content == item[0])
414 ele = SH_TAILQ_NEXT(ele, sh_tes, sh_te);
416 if (ele != NULL)
417 SH_TAILQ_REMOVE(l, ele, sh_tes, sh_te);
427 struct sh_te *ele = calloc(1, sizeof(struct sh_te));
429 ele->content = item[0];
430 SH_TAILQ_INSERT_HEAD(l, ele, sh_tes, sh_te);
440 struct sh_te *ele = 0;
441 ele = calloc(1, sizeof(struct sh_te));
442 ele->content = item[0];
443 SH_TAILQ_INSERT_TAIL(l, ele, sh_tes);
453 struct sh_te *ele = NULL;
463 ele = calloc(1, sizeof(struct sh_te));
464 ele->content = item[0];
465 SH_TAILQ_INSERT_BEFORE(l, before_ele, ele, sh_tes, sh_te);
477 struct sh_te *ele = NULL;
487 ele = calloc(1, sizeof(struct sh_te));
488 ele->content = item[0];
489 SH_TAILQ_INSERT_AFTER(l, after_ele, ele, sh_tes, sh_te);
499 struct sh_te *ele = NULL;
501 while ((ele = SH_TAILQ_FIRST(l, sh_te)) != NULL) {
502 SH_TAILQ_REMOVE(l, ele, sh_tes, sh_te);
503 free(ele);
514 struct sh_te *ele = NULL, *lele = NULL;
526 SH_TAILQ_FOREACH(ele, l, sh_tes, sh_te) {
527 if (ele->content != c[0])
538 ele = SH_TAILQ_FIRST(l, sh_te);
540 lele = ele;
542 if (ele->content != c[0])
545 ele = SH_TAILQ_NEXT(ele, sh_tes, sh_te);
555 ele = lele;
557 /* ele should be the last element in the list... */
559 if (ele->sh_tes.stqe_next != -1)
563 if (SH_TAILQ_NEXT(ele, sh_tes, sh_te) != NULL)
572 lele = ele;
573 if (ele->content != c[0])
575 ele = SH_TAILQ_PREV(l, ele, sh_tes, sh_te);
580 ele = lele;
585 if (ele != SH_TAILQ_FIRST(l, sh_te))
592 ele = SH_TAILQ_LAST(l, sh_tes, sh_te);
593 SH_TAILQ_FOREACH_REVERSE(ele, l, sh_tes, sh_te) {
594 if (ele->content != c[0])
611 struct sh_te *ele = NULL;
623 ele = SH_TAILQ_LAST(l, sh_tes, sh_te);
624 if (ele->content != c[0])