X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fplist.c;h=81501b017ef22b0f363f802fc7bd5d4e7010abe6;hb=2f8553d98a05815a9d24eb5746cab1e17858a2a0;hp=7016f57d59b9f476e37a3b391e506d01c6fe7a86;hpb=7fcb4d9c30486692cb865fc889d8d0770abae6d8;p=libfirm diff --git a/ir/adt/plist.c b/ir/adt/plist.c index 7016f57d5..81501b017 100644 --- a/ir/adt/plist.c +++ b/ir/adt/plist.c @@ -1,14 +1,31 @@ +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. + */ + /** - * Simple, non circular, double linked pointer list. - * Created because the properties of the standard circular list were not - * very well suited for the interference graph implementation. - * This list uses an obstack and a free-list to efficiently manage its - * elements. - * @author Kimon Hoffmann - * @date 14.07.2005 - * @cvs-id $Id$ - * @note Until now the code is entirely untested so it probably contains - * plenty of errors. + * @file + * @brief Simple, non circular, double linked pointer list. + * @note Created because the properties of the standard circular list were not + * very well suited for the interference graph implementation. + * This list uses an obstack and a free-list to efficiently manage its + * elements. + * @author Kimon Hoffmann + * @date 14.07.2005 */ #include @@ -21,7 +38,8 @@ * @param list the list for which to allocate the element. * @return the newly allocated, uninitialized element. */ -static plist_element_t *allocate_element(plist_t* list) { +static plist_element_t *allocate_element(plist_t* list) +{ plist_element_t *new_element; if (list->first_free_element != NULL) { @@ -30,29 +48,30 @@ static plist_element_t *allocate_element(plist_t* list) { new_element->next = NULL; } else { - new_element = obstack_alloc(list->obst, sizeof(*new_element)); + new_element = OALLOC(list->obst, plist_element_t); } return new_element; } -plist_t* plist_new(void) { - plist_t* list = xmalloc(sizeof(*list)); - - list->obst = xmalloc(sizeof(*list->obst)); - obstack_init(list->obst); +plist_t *plist_new(void) +{ + plist_t *list = (plist_t*) xmalloc(sizeof(*list) + sizeof(*list->obst)); + list->obst = (struct obstack *)&list[1]; list->foreign_obstack = 0; list->first_element = NULL; list->last_element = NULL; list->first_free_element = NULL; list->element_count = 0; + obstack_init(list->obst); return list; } -plist_t *plist_obstack_new(struct obstack *obst) { - plist_t *list = obstack_alloc(obst, sizeof(*list)); +plist_t *plist_obstack_new(struct obstack *obst) +{ + plist_t *list = OALLOC(obst, plist_t); list->obst = obst; list->foreign_obstack = 1; @@ -64,7 +83,8 @@ plist_t *plist_obstack_new(struct obstack *obst) { return list; } -void plist_free(plist_t *list) { +void plist_free(plist_t *list) +{ list->first_element = NULL; list->last_element = NULL; list->first_free_element = NULL; @@ -72,17 +92,17 @@ void plist_free(plist_t *list) { if (! list->foreign_obstack) { obstack_free(list->obst, NULL); - xfree(list->obst); xfree(list); } } -void plist_insert_back(plist_t* list, void* value) { +void plist_insert_back(plist_t *list, void *value) +{ if (list->last_element != NULL) { plist_insert_after(list, list->last_element, value); } else { - plist_element_t* newElement = allocate_element(list); + plist_element_t *newElement = allocate_element(list); newElement->data = value; newElement->prev = NULL; @@ -92,12 +112,13 @@ void plist_insert_back(plist_t* list, void* value) { } } -void plist_insert_front(plist_t* list, void* value) { +void plist_insert_front(plist_t *list, void *value) +{ if (list->first_element != NULL) { plist_insert_before(list, list->first_element, value); } else { - plist_element_t* newElement = allocate_element(list); + plist_element_t *newElement = allocate_element(list); newElement->data = value; newElement->prev = NULL; @@ -107,9 +128,10 @@ void plist_insert_front(plist_t* list, void* value) { } } -void plist_insert_before(plist_t* list, plist_element_t* element, void* value) { - plist_element_t* prevElement; - plist_element_t* newElement = allocate_element(list); +void plist_insert_before(plist_t *list, plist_element_t *element, void *value) +{ + plist_element_t *prevElement; + plist_element_t *newElement = allocate_element(list); newElement->data = value; newElement->next = element; @@ -123,13 +145,14 @@ void plist_insert_before(plist_t* list, plist_element_t* element, void* value) { list->first_element = newElement; } - element->prev = newElement; + element->prev = newElement; ++list->element_count; } -void plist_insert_after(plist_t* list, plist_element_t* element, void* value) { - plist_element_t* nextElement; - plist_element_t* newElement = allocate_element(list); +void plist_insert_after(plist_t* list, plist_element_t* element, void* value) +{ + plist_element_t *nextElement; + plist_element_t *newElement = allocate_element(list); newElement->data = value; newElement->prev = element; @@ -147,7 +170,32 @@ void plist_insert_after(plist_t* list, plist_element_t* element, void* value) { ++list->element_count; } -void plist_erase(plist_t *list, plist_element_t *element) { +int plist_has_value(plist_t *list, void *value) +{ + plist_element_t *iter; + + for (iter = plist_first(list); iter; iter = plist_element_get_next(iter)) { + if (plist_element_get_value(iter) == value) + return 1; + } + + return 0; +} + +plist_element_t *plist_find_value(plist_t *list, void *value) +{ + plist_element_t *iter; + + for (iter = plist_first(list); iter; iter = plist_element_get_next(iter)) { + if (plist_element_get_value(iter) == value) + return iter; + } + + return NULL; +} + +void plist_erase(plist_t *list, plist_element_t *element) +{ plist_element_t *next_element = element->next; plist_element_t *prev_element = element->prev; @@ -173,7 +221,8 @@ void plist_erase(plist_t *list, plist_element_t *element) { list->first_free_element = element; } -void plist_clear(plist_t *list) { +void plist_clear(plist_t *list) +{ plist_element_t *curr_element = list->first_element; while (curr_element != NULL) {