From 02e04fc7fd1bb266b81947b69970e26b4b26ae4a Mon Sep 17 00:00:00 2001 From: MelwareDE Date: Tue, 6 Apr 2010 16:45:49 +0000 Subject: [PATCH] Already part of this project --- divastreaming/dlist.c | 164 ------------------------------------------ divastreaming/dlist.h | 150 -------------------------------------- 2 files changed, 314 deletions(-) delete mode 100644 divastreaming/dlist.c delete mode 100644 divastreaming/dlist.h diff --git a/divastreaming/dlist.c b/divastreaming/dlist.c deleted file mode 100644 index 14ec32e..0000000 --- a/divastreaming/dlist.c +++ /dev/null @@ -1,164 +0,0 @@ -/* - * - Copyright (c) Dialogic (R) 2009 - 2010 - * - This source file is supplied for the use with - Eicon Networks range of DIVA Server Adapters. - * - Dialogic (R) File Revision : 1.9 - * - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. - * - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY OF ANY KIND WHATSOEVER INCLUDING ANY - implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. - See the GNU General Public License for more details. - * - You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. - * - */ -#include "platform.h" -#include "dlist.h" - -/* -** Initialize linked list -*/ - -void diva_q_init (diva_entity_queue_t* q) -{ - q->head = 0; - q->tail = 0; -} - -/* -** Remove element from linked list -*/ -void diva_q_remove (diva_entity_queue_t* q, diva_entity_link_t* what) -{ - if(!what->prev) { - if (0 != (q->head = what->next)) { - q->head->prev = 0; - } else { - q->tail = 0; - } - } else if (!what->next) { - q->tail = what->prev; - q->tail->next = 0; - } else { - what->prev->next = what->next; - what->next->prev = what->prev; - } - what->prev = what->next = 0; -} - -/* -** Add element to the tail of linked list -*/ -void diva_q_add_tail (diva_entity_queue_t* q, diva_entity_link_t* what) -{ - what->next = 0; - if (!q->head) { - what->prev = 0; - q->head = q->tail = what; - } else { - what->prev = q->tail; - q->tail->next = what; - q->tail = what; - } -} - -/* -** Add element to the linked list after a specified element -*/ -void diva_q_insert_after (diva_entity_queue_t* q, diva_entity_link_t* prev, diva_entity_link_t* what) -{ - diva_entity_link_t *next; - - if((0 == prev) || (0 == (next=diva_q_get_next(prev)))){ - diva_q_add_tail(q,what); - return; - } - what->prev = prev; - what->next = next; - prev->next = what; - next->prev = what; -} - -/* -** Add element to the linked list before a specified element -*/ -void diva_q_insert_before (diva_entity_queue_t* q, diva_entity_link_t* next, diva_entity_link_t* what) -{ - diva_entity_link_t *prev; - - if(!next){ - diva_q_add_tail(q,what); - return; - } - if(0 == (prev=diva_q_get_prev(next))){/*next seems to be the head*/ - q->head=what; - what->prev=0; - what->next=next; - next->prev=what; - }else{ /*not the head*/ - what->prev = prev; - what->next = next; - prev->next = what; - next->prev = what; - } -} - -diva_entity_link_t* diva_q_find (const diva_entity_queue_t* q, const void* what, - diva_q_cmp_fn_t cmp_fn) -{ - diva_entity_link_t* diva_q_current = q->head; - - while (diva_q_current) { - if (!(*cmp_fn)(what, diva_q_current)) { - break; - } - diva_q_current = diva_q_current->next; - } - - return (diva_q_current); -} - -diva_entity_link_t* -diva_q_get_head (const diva_entity_queue_t* q) -{ - return (q->head); -} - -diva_entity_link_t* diva_q_get_tail (const diva_entity_queue_t* q) -{ - return (q->tail); -} - -diva_entity_link_t* diva_q_get_next (const diva_entity_link_t* what) -{ - return ((what) ? what->next : 0); -} - -diva_entity_link_t* diva_q_get_prev (const diva_entity_link_t* what) -{ - return ((what) ? what->prev : 0); -} - -int diva_q_get_nr_of_entries (const diva_entity_queue_t* q) -{ - int i = 0; - const diva_entity_link_t* diva_q_current = q->head; - - while (diva_q_current) { - i++; - diva_q_current = diva_q_current->next; - } - - return (i); -} - diff --git a/divastreaming/dlist.h b/divastreaming/dlist.h deleted file mode 100644 index c869248..0000000 --- a/divastreaming/dlist.h +++ /dev/null @@ -1,150 +0,0 @@ -/* - * - Copyright (c) Dialogic (R) 2009 - 2010 - * - This source file is supplied for the use with - Eicon Networks range of DIVA Server Adapters. - * - Dialogic (R) File Revision : 1.9 - * - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. - * - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY OF ANY KIND WHATSOEVER INCLUDING ANY - implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. - See the GNU General Public License for more details. - * - You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. - * - */ -#ifndef __DIVA_LINK_H__ -#define __DIVA_LINK_H__ - -struct _diva_entity_link; -typedef struct _diva_entity_link { - struct _diva_entity_link* prev; - struct _diva_entity_link* next; -} diva_entity_link_t; - -typedef struct _diva_entity_queue { - diva_entity_link_t* head; - diva_entity_link_t* tail; -} diva_entity_queue_t; - - -typedef int (*diva_q_cmp_fn_t)(const void* what, - const diva_entity_link_t*); - -#if defined(__cplusplus) -extern "C" { -#endif - -void diva_q_remove (diva_entity_queue_t* q, diva_entity_link_t* what); -void diva_q_add_tail (diva_entity_queue_t* q, diva_entity_link_t* what); -void diva_q_insert_after (diva_entity_queue_t* q, - diva_entity_link_t* prev, - diva_entity_link_t* what); -void diva_q_insert_before (diva_entity_queue_t* q, - diva_entity_link_t* next, - diva_entity_link_t* what); -diva_entity_link_t* diva_q_find (const diva_entity_queue_t* q, - const void* what, diva_q_cmp_fn_t cmp_fn); - -diva_entity_link_t* diva_q_get_head (const diva_entity_queue_t* q); -diva_entity_link_t* diva_q_get_tail (const diva_entity_queue_t* q); -diva_entity_link_t* diva_q_get_next (const diva_entity_link_t* what); -diva_entity_link_t* diva_q_get_prev (const diva_entity_link_t* what); -int diva_q_get_nr_of_entries (const diva_entity_queue_t* q); -void diva_q_init (diva_entity_queue_t* q); - -#if defined(__cplusplus) -} -#endif - -#if defined(__cplusplus) /* { */ - -template class CDivaListEntry { - public: - T* prev; - T* next; -}; - -template class CDivaListQueue { - public: - CDivaListQueue() { head = 0; tail = 0; } - ~CDivaListQueue() { } - - void remove (T* what) { - if (what->prev == 0) { - if ((head = what->next) != 0) { - head->prev = 0; - } else { - tail = 0; - } - } else if (what->next == 0) { - tail = what->prev; - tail->next = 0; - } else { - what->prev->next = what->next; - what->next->prev = what->prev; - } - what->prev = what->next = 0; - } - - void add_tail (T* what) { - what->next = 0; - if (head == 0) { - what->prev = 0; - head = tail = what; - } else { - what->prev = tail; - tail->next = what; - tail = what; - } - } - - T* get_head () { return (head); } - - static T* next (T* what) { return ((what) ? what->next : 0); } - - static T* prev (T* what) { return ((what) ? what->prev : 0); } - - dword nr_of_entries () const { - const T* diva_q_current = head; - dword i = 0; - - while (diva_q_current != 0) { - i++; - diva_q_current = diva_q_current->next; - } - - return (i); - } - - T* find (const C& what) { - T* diva_q_current = head; - - while (diva_q_current != 0) { - if (*diva_q_current == what) { - break; - } - diva_q_current = diva_q_current->next; - } - - return (diva_q_current); - } - - private: - T* head; - T* tail; -}; - -#endif /* } */ - - -#endif