_AWS_DOUBLY_LINKED_LIST_H_ macro

@file aws_doubly_linked_list.h Doubly Linked List implementation. A generic implementation of circular Doubly Linked List which consists of a list head and some list entries (zero in case of an empty list). To start with, a structure of type Link_t should be embedded in the structure which is to be organized as doubly linked list. A List head should then be defined and initialized. listADD can then be used to add nodes to the list. listFOR_EACH can be used for traversing the list. listFOR_EACH_SAFE should be used if you want to perform destructive operations (like free) on nodes while traversing the list.