Changes in src/libcfa/bits/containers.h [705e612:65deb18]

File:

• src/libcfa/bits/containers.h (modified) (1 diff)

src/libcfa/bits/containers.h

@@ -186 +186 @@
 #endif
 
-
-//-----------------------------------------------------------------------------
-// Doubly Linked List
-//-----------------------------------------------------------------------------
-#ifdef __cforall
-        forall(dtype TYPE | sized(TYPE))
-        #define T TYPE
-        #define __getter_t * [T * & next, T * & prev] ( T & )
-#else
-        typedef void (*__generit_c_getter_t)();
-        #define T void
-        #define __getter_t __generit_c_getter_t
-#endif
-struct __dllist {
-        T * head;
-        __getter_t __get;
-};
-#undef T
-#undef __getter_t
-
-#ifdef __cforall
-#define __dllist_t(T) __dllist(T)
-#else
-#define __dllist_t(T) struct __dllist
-#endif
-
-#ifdef __cforall
-
-        forall(dtype T | sized(T))
-        static inline [void] ?{}( __dllist(T) & this, * [T * & next, T * & prev] ( T & ) __get ) {
-                this.head{ NULL };
-                this.__get = __get;
-        }
-
-        #define _next .0
-        #define _prev .1
-        forall(dtype T | sized(T))
-        static inline void push_front( __dllist(T) & this, T & node ) with( this ) {
-                if ( head ) {
-                        __get( node )_next = head;
-                        __get( node )_prev = __get( *head )_prev;
-                        // inserted node must be consistent before it is seen
-                        // prevent code movement across barrier
-                        asm( "" : : : "memory" );
-                        __get( *head )_prev = &node;
-                        T & prev = *__get( node )_prev;
-                        __get( prev )_next = &node;
-                }
-                else {
-                        __get( node )_next = &node;
-                        __get( node )_prev = &node;
-                }
-
-                // prevent code movement across barrier
-                asm( "" : : : "memory" );
-                head = &node;
-        }
-
-        forall(dtype T | sized(T))
-        static inline void remove( __dllist(T) & this, T & node ) with( this ) {
-                if ( &node == head ) {
-                        if ( __get( *head )_next == head ) {
-                                head = NULL;
-                        }
-                        else {
-                                head = __get( *head )_next;
-                        }
-                }
-                __get( *__get( node )_next )_prev = __get( node )_prev;
-                __get( *__get( node )_prev )_next = __get( node )_next;
-                __get( node )_next = NULL;
-                __get( node )_prev = NULL;
-        }
-        #undef _next
-        #undef _prev
-#endif
-
 //-----------------------------------------------------------------------------
 // Tools