GNUnet 0.29.1-19-g7e0f9c364
 
Loading...
Searching...
No Matches
Doubly-linked list
Collaboration diagram for Doubly-linked list:

Macros

#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
 Insert an element at the head of a DLL.
 
#define GNUNET_CONTAINER_DLL_insert_tail(head, tail, element)
 Insert an element at the tail of a DLL.
 
#define GNUNET_CONTAINER_DLL_insert_after(head, tail, other, element)
 Insert an element into a DLL after the given other element.
 
#define GNUNET_CONTAINER_DLL_insert_before(head, tail, other, element)
 Insert an element into a DLL before the given other element.
 
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
 Remove an element from a DLL.
 
#define GNUNET_CONTAINER_MDLL_insert(mdll, head, tail, element)
 Insert an element at the head of a MDLL.
 
#define GNUNET_CONTAINER_MDLL_insert_tail(mdll, head, tail, element)
 Insert an element at the tail of a MDLL.
 
#define GNUNET_CONTAINER_MDLL_insert_after(mdll, head, tail, other, element)
 Insert an element into a MDLL after the given other element.
 
#define GNUNET_CONTAINER_MDLL_insert_before(mdll, head, tail, other, element)
 Insert an element into a MDLL before the given other element.
 
#define GNUNET_CONTAINER_MDLL_remove(mdll, head, tail, element)
 Remove an element from a MDLL.
 

Detailed Description

See also
Documentation

Macro Definition Documentation

◆ GNUNET_CONTAINER_DLL_insert

#define GNUNET_CONTAINER_DLL_insert (   head,
  tail,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
(element)->next = (head); \
(element)->prev = NULL; \
if (NULL == (tail)) \
{ \
(tail) = element; \
} \
else \
{ \
(head)->prev = element; \
} \
(head) = (element); \
} while (0)

Insert an element at the head of a DLL.

Assumes that head, tail and element are structs with prev and next fields.

Parameters
headpointer to the head of the DLL
tailpointer to the tail of the DLL
elementelement to insert

Definition at line 355 of file gnunet_container_lib.h.

357 { \
358 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
359 GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
360 GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
361 (element)->next = (head); \
362 (element)->prev = NULL; \
363 if (NULL == (tail)) \
364 { \
365 (tail) = element; \
366 } \
367 else \
368 { \
369 (head)->prev = element; \
370 } \
371 (head) = (element); \
372 } while (0)

◆ GNUNET_CONTAINER_DLL_insert_tail

#define GNUNET_CONTAINER_DLL_insert_tail (   head,
  tail,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
(element)->prev = (tail); \
(element)->next = NULL; \
if (NULL == (head)) \
{ \
(head) = element; \
} \
else \
{ \
(tail)->next = element; \
} \
(tail) = (element); \
} while (0)

Insert an element at the tail of a DLL.

Assumes that head, tail and element are structs with prev and next fields.

Parameters
headpointer to the head of the DLL
tailpointer to the tail of the DLL
elementelement to insert

Definition at line 384 of file gnunet_container_lib.h.

386 { \
387 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
388 GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
389 GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
390 (element)->prev = (tail); \
391 (element)->next = NULL; \
392 if (NULL == (head)) \
393 { \
394 (head) = element; \
395 } \
396 else \
397 { \
398 (tail)->next = element; \
399 } \
400 (tail) = (element); \
401 } while (0)

◆ GNUNET_CONTAINER_DLL_insert_after

#define GNUNET_CONTAINER_DLL_insert_after (   head,
  tail,
  other,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
(element)->prev = (other); \
if (NULL == other) \
{ \
(element)->next = (head); \
(head) = (element); \
} \
else \
{ \
(element)->next = (other)->next; \
(other)->next = (element); \
} \
if (NULL == (element)->next) \
{ \
(tail) = (element); \
} \
else \
{ \
(element)->next->prev = (element); \
} \
} while (0)

Insert an element into a DLL after the given other element.

Insert at the head if the other element is NULL.

Parameters
headpointer to the head of the DLL
tailpointer to the tail of the DLL
otherprior element, NULL for insertion at head of DLL
elementelement to insert

Definition at line 414 of file gnunet_container_lib.h.

416 { \
417 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
418 GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
419 GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
420 (element)->prev = (other); \
421 if (NULL == other) \
422 { \
423 (element)->next = (head); \
424 (head) = (element); \
425 } \
426 else \
427 { \
428 (element)->next = (other)->next; \
429 (other)->next = (element); \
430 } \
431 if (NULL == (element)->next) \
432 { \
433 (tail) = (element); \
434 } \
435 else \
436 { \
437 (element)->next->prev = (element); \
438 } \
439 } while (0)

◆ GNUNET_CONTAINER_DLL_insert_before

#define GNUNET_CONTAINER_DLL_insert_before (   head,
  tail,
  other,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
(element)->next = (other); \
if (NULL == other) \
{ \
(element)->prev = (tail); \
(tail) = (element); \
} \
else \
{ \
(element)->prev = (other)->prev; \
(other)->prev = (element); \
} \
if (NULL == (element)->prev) \
{ \
(head) = (element); \
} \
else \
{ \
(element)->prev->next = (element); \
} \
} while (0)

Insert an element into a DLL before the given other element.

Insert at the tail if the other element is NULL.

Parameters
headpointer to the head of the DLL
tailpointer to the tail of the DLL
otherprior element, NULL for insertion at head of DLL
elementelement to insert

Definition at line 452 of file gnunet_container_lib.h.

454 { \
455 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
456 GNUNET_assert ((NULL == (element)->prev) && ((head) != (element))); \
457 GNUNET_assert ((NULL == (element)->next) && ((tail) != (element))); \
458 (element)->next = (other); \
459 if (NULL == other) \
460 { \
461 (element)->prev = (tail); \
462 (tail) = (element); \
463 } \
464 else \
465 { \
466 (element)->prev = (other)->prev; \
467 (other)->prev = (element); \
468 } \
469 if (NULL == (element)->prev) \
470 { \
471 (head) = (element); \
472 } \
473 else \
474 { \
475 (element)->prev->next = (element); \
476 } \
477 } while (0)

◆ GNUNET_CONTAINER_DLL_remove

#define GNUNET_CONTAINER_DLL_remove (   head,
  tail,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL != (element)->prev) || ((head) == (element))); \
GNUNET_assert ((NULL != (element)->next) || ((tail) == (element))); \
if (NULL == (element)->prev) \
{ \
(head) = (element)->next; \
} \
else \
{ \
(element)->prev->next = (element)->next; \
} \
if (NULL == (element)->next) \
{ \
(tail) = (element)->prev; \
} \
else \
{ \
(element)->next->prev = (element)->prev; \
} \
(element)->next = NULL; \
(element)->prev = NULL; \
} while (0)

Remove an element from a DLL.

Assumes that head, tail and element point to structs with prev and next fields.

Using the head or tail pointer as the element argument does NOT work with this macro. Make sure to store head/tail in another pointer and use it to remove the head or tail of the list.

Parameters
headpointer to the head of the DLL
tailpointer to the tail of the DLL
elementelement to remove

Definition at line 494 of file gnunet_container_lib.h.

496 { \
497 GNUNET_assert ((NULL != (element)->prev) || ((head) == (element))); \
498 GNUNET_assert ((NULL != (element)->next) || ((tail) == (element))); \
499 if (NULL == (element)->prev) \
500 { \
501 (head) = (element)->next; \
502 } \
503 else \
504 { \
505 (element)->prev->next = (element)->next; \
506 } \
507 if (NULL == (element)->next) \
508 { \
509 (tail) = (element)->prev; \
510 } \
511 else \
512 { \
513 (element)->next->prev = (element)->prev; \
514 } \
515 (element)->next = NULL; \
516 (element)->prev = NULL; \
517 } while (0)

◆ GNUNET_CONTAINER_MDLL_insert

#define GNUNET_CONTAINER_MDLL_insert (   mdll,
  head,
  tail,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
((head) != (element))); \
GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
((tail) != (element))); \
(element)->next_ ## mdll = (head); \
(element)->prev_ ## mdll = NULL; \
if (NULL == (tail)) \
{ \
(tail) = element; \
} \
else \
{ \
(head)->prev_ ## mdll = element; \
} \
(head) = (element); \
} while (0)

Insert an element at the head of a MDLL.

Assumes that head, tail and element are structs with prev and next fields.

Parameters
mdllsuffix name for the next and prev pointers in the element
headpointer to the head of the MDLL
tailpointer to the tail of the MDLL
elementelement to insert

Definition at line 533 of file gnunet_container_lib.h.

535 { \
536 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
537 GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
538 ((head) != (element))); \
539 GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
540 ((tail) != (element))); \
541 (element)->next_ ## mdll = (head); \
542 (element)->prev_ ## mdll = NULL; \
543 if (NULL == (tail)) \
544 { \
545 (tail) = element; \
546 } \
547 else \
548 { \
549 (head)->prev_ ## mdll = element; \
550 } \
551 (head) = (element); \
552 } while (0)

◆ GNUNET_CONTAINER_MDLL_insert_tail

#define GNUNET_CONTAINER_MDLL_insert_tail (   mdll,
  head,
  tail,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
((head) != (element))); \
GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
((tail) != (element))); \
(element)->prev_ ## mdll = (tail); \
(element)->next_ ## mdll = NULL; \
if (NULL == (head)) \
{ \
(head) = element; \
} \
else \
{ \
(tail)->next_ ## mdll = element; \
} \
(tail) = (element); \
} while (0)

Insert an element at the tail of a MDLL.

Assumes that head, tail and element are structs with prev and next fields.

Parameters
mdllsuffix name for the next and prev pointers in the element
headpointer to the head of the MDLL
tailpointer to the tail of the MDLL
elementelement to insert

Definition at line 565 of file gnunet_container_lib.h.

567 { \
568 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
569 GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
570 ((head) != (element))); \
571 GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
572 ((tail) != (element))); \
573 (element)->prev_ ## mdll = (tail); \
574 (element)->next_ ## mdll = NULL; \
575 if (NULL == (head)) \
576 { \
577 (head) = element; \
578 } \
579 else \
580 { \
581 (tail)->next_ ## mdll = element; \
582 } \
583 (tail) = (element); \
584 } while (0)

◆ GNUNET_CONTAINER_MDLL_insert_after

#define GNUNET_CONTAINER_MDLL_insert_after (   mdll,
  head,
  tail,
  other,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
((head) != (element))); \
GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
((tail) != (element))); \
(element)->prev_ ## mdll = (other); \
if (NULL == other) \
{ \
(element)->next_ ## mdll = (head); \
(head) = (element); \
} \
else \
{ \
(element)->next_ ## mdll = (other)->next_ ## mdll; \
(other)->next_ ## mdll = (element); \
} \
if (NULL == (element)->next_ ## mdll) \
{ \
(tail) = (element); \
} \
else \
{ \
(element)->next_ ## mdll->prev_ ## mdll = (element); \
} \
} while (0)

Insert an element into a MDLL after the given other element.

Insert at the head if the other element is NULL.

Parameters
mdllsuffix name for the next and prev pointers in the element
headpointer to the head of the MDLL
tailpointer to the tail of the MDLL
otherprior element, NULL for insertion at head of MDLL
elementelement to insert

Definition at line 598 of file gnunet_container_lib.h.

600 { \
601 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
602 GNUNET_assert ((NULL == (element)->prev_ ## mdll) && \
603 ((head) != (element))); \
604 GNUNET_assert ((NULL == (element)->next_ ## mdll) && \
605 ((tail) != (element))); \
606 (element)->prev_ ## mdll = (other); \
607 if (NULL == other) \
608 { \
609 (element)->next_ ## mdll = (head); \
610 (head) = (element); \
611 } \
612 else \
613 { \
614 (element)->next_ ## mdll = (other)->next_ ## mdll; \
615 (other)->next_ ## mdll = (element); \
616 } \
617 if (NULL == (element)->next_ ## mdll) \
618 { \
619 (tail) = (element); \
620 } \
621 else \
622 { \
623 (element)->next_ ## mdll->prev_ ## mdll = (element); \
624 } \
625 } while (0)

◆ GNUNET_CONTAINER_MDLL_insert_before

#define GNUNET_CONTAINER_MDLL_insert_before (   mdll,
  head,
  tail,
  other,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
GNUNET_assert (((element)->prev_ ## mdll == NULL) && \
((head) != (element))); \
GNUNET_assert (((element)->next_ ## mdll == NULL) && \
((tail) != (element))); \
(element)->next_ ## mdll = (other); \
if (NULL == other) \
{ \
(element)->prev_ ## mdll = (tail); \
(tail) = (element); \
} \
else \
{ \
(element)->prev_ ## mdll = (other)->prev_ ## mdll; \
(other)->prev_ ## mdll = (element); \
} \
if (NULL == (element)->prev_ ## mdll) \
{ \
(head) = (element); \
} \
else \
{ \
(element)->prev_ ## mdll->next_ ## mdll = (element); \
} \
} while (0)

Insert an element into a MDLL before the given other element.

Insert at the tail if the other element is NULL.

Parameters
mdllsuffix name for the next and prev pointers in the element
headpointer to the head of the MDLL
tailpointer to the tail of the MDLL
otherprior element, NULL for insertion at head of MDLL
elementelement to insert

Definition at line 639 of file gnunet_container_lib.h.

641 { \
642 GNUNET_assert ((NULL == (head)) == (NULL == (tail))); \
643 GNUNET_assert (((element)->prev_ ## mdll == NULL) && \
644 ((head) != (element))); \
645 GNUNET_assert (((element)->next_ ## mdll == NULL) && \
646 ((tail) != (element))); \
647 (element)->next_ ## mdll = (other); \
648 if (NULL == other) \
649 { \
650 (element)->prev_ ## mdll = (tail); \
651 (tail) = (element); \
652 } \
653 else \
654 { \
655 (element)->prev_ ## mdll = (other)->prev_ ## mdll; \
656 (other)->prev_ ## mdll = (element); \
657 } \
658 if (NULL == (element)->prev_ ## mdll) \
659 { \
660 (head) = (element); \
661 } \
662 else \
663 { \
664 (element)->prev_ ## mdll->next_ ## mdll = (element); \
665 } \
666 } while (0)

◆ GNUNET_CONTAINER_MDLL_remove

#define GNUNET_CONTAINER_MDLL_remove (   mdll,
  head,
  tail,
  element 
)
Value:
do \
{ \
GNUNET_assert ((NULL != (element)->prev_ ## mdll) || \
((head) == (element))); \
GNUNET_assert ((NULL != (element)->next_ ## mdll) || \
((tail) == (element))); \
if (NULL == (element)->prev_ ## mdll) \
{ \
(head) = (element)->next_ ## mdll; \
} \
else \
{ \
(element)->prev_ ## mdll->next_ ## mdll = \
(element)->next_ ## mdll; \
} \
if (NULL == (element)->next_ ## mdll) \
{ \
(tail) = (element)->prev_ ## mdll; \
} \
else \
{ \
(element)->next_ ## mdll->prev_ ## mdll = \
(element)->prev_ ## mdll; \
} \
(element)->next_ ## mdll = NULL; \
(element)->prev_ ## mdll = NULL; \
} while (0)

Remove an element from a MDLL.

Assumes that head, tail and element are structs with prev and next fields.

Parameters
mdllsuffix name for the next and prev pointers in the element
headpointer to the head of the MDLL
tailpointer to the tail of the MDLL
elementelement to remove

Definition at line 680 of file gnunet_container_lib.h.

682 { \
683 GNUNET_assert ((NULL != (element)->prev_ ## mdll) || \
684 ((head) == (element))); \
685 GNUNET_assert ((NULL != (element)->next_ ## mdll) || \
686 ((tail) == (element))); \
687 if (NULL == (element)->prev_ ## mdll) \
688 { \
689 (head) = (element)->next_ ## mdll; \
690 } \
691 else \
692 { \
693 (element)->prev_ ## mdll->next_ ## mdll = \
694 (element)->next_ ## mdll; \
695 } \
696 if (NULL == (element)->next_ ## mdll) \
697 { \
698 (tail) = (element)->prev_ ## mdll; \
699 } \
700 else \
701 { \
702 (element)->next_ ## mdll->prev_ ## mdll = \
703 (element)->prev_ ## mdll; \
704 } \
705 (element)->next_ ## mdll = NULL; \
706 (element)->prev_ ## mdll = NULL; \
707 } while (0)