projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
bescripts: Remove unused features and stale uses of gone features.
[libfirm]
/
ir
/
adt
/
plist.c
diff --git
a/ir/adt/plist.c
b/ir/adt/plist.c
index
6fa644a
..
81501b0
100644
(file)
--- a/
ir/adt/plist.c
+++ b/
ir/adt/plist.c
@@
-1,5
+1,5
@@
/*
/*
- * Copyright (C) 1995-200
7
University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-200
8
University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
*
* This file is part of libFirm.
*
@@
-26,7
+26,6
@@
* elements.
* @author Kimon Hoffmann
* @date 14.07.2005
* elements.
* @author Kimon Hoffmann
* @date 14.07.2005
- * @version $Id$
*/
#include <stdlib.h>
*/
#include <stdlib.h>
@@
-39,7
+38,8
@@
* @param list the list for which to allocate the element.
* @return the newly allocated, uninitialized element.
*/
* @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) {
plist_element_t *new_element;
if (list->first_free_element != NULL) {
@@
-48,14
+48,15
@@
static plist_element_t *allocate_element(plist_t* list) {
new_element->next = NULL;
}
else {
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;
}
}
return new_element;
}
-plist_t *plist_new(void) {
- plist_t *list = xmalloc(sizeof(*list) + sizeof(*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->obst = (struct obstack *)&list[1];
list->foreign_obstack = 0;
@@
-68,8
+69,9
@@
plist_t *plist_new(void) {
return list;
}
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;
list->obst = obst;
list->foreign_obstack = 1;
@@
-81,7
+83,8
@@
plist_t *plist_obstack_new(struct obstack *obst) {
return list;
}
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;
list->first_element = NULL;
list->last_element = NULL;
list->first_free_element = NULL;
@@
-93,7
+96,8
@@
void plist_free(plist_t *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);
}
if (list->last_element != NULL) {
plist_insert_after(list, list->last_element, value);
}
@@
-108,7
+112,8
@@
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);
}
if (list->first_element != NULL) {
plist_insert_before(list, list->first_element, value);
}
@@
-123,7
+128,8
@@
void plist_insert_front(plist_t *list, void *value) {
}
}
}
}
-void plist_insert_before(plist_t *list, plist_element_t *element, 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);
plist_element_t *prevElement;
plist_element_t *newElement = allocate_element(list);
@@
-139,11
+145,12
@@
void plist_insert_before(plist_t *list, plist_element_t *element, void *value) {
list->first_element = newElement;
}
list->first_element = newElement;
}
- element->prev = newElement;
+ element->prev = newElement;
++list->element_count;
}
++list->element_count;
}
-void plist_insert_after(plist_t* list, plist_element_t* element, void* value) {
+void plist_insert_after(plist_t* list, plist_element_t* element, void* value)
+{
plist_element_t *nextElement;
plist_element_t *newElement = allocate_element(list);
plist_element_t *nextElement;
plist_element_t *newElement = allocate_element(list);
@@
-163,7
+170,8
@@
void plist_insert_after(plist_t* list, plist_element_t* element, void* value) {
++list->element_count;
}
++list->element_count;
}
-int plist_has_value(plist_t *list, void *value) {
+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)) {
plist_element_t *iter;
for (iter = plist_first(list); iter; iter = plist_element_get_next(iter)) {
@@
-174,7
+182,8
@@
int plist_has_value(plist_t *list, void *value) {
return 0;
}
return 0;
}
-plist_element_t *plist_find_value(plist_t *list, void *value) {
+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)) {
plist_element_t *iter;
for (iter = plist_first(list); iter; iter = plist_element_get_next(iter)) {
@@
-185,7
+194,8
@@
plist_element_t *plist_find_value(plist_t *list, void *value) {
return NULL;
}
return NULL;
}
-void plist_erase(plist_t *list, plist_element_t *element) {
+void plist_erase(plist_t *list, plist_element_t *element)
+{
plist_element_t *next_element = element->next;
plist_element_t *prev_element = element->prev;
plist_element_t *next_element = element->next;
plist_element_t *prev_element = element->prev;
@@
-211,7
+221,8
@@
void plist_erase(plist_t *list, plist_element_t *element) {
list->first_free_element = 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) {
plist_element_t *curr_element = list->first_element;
while (curr_element != NULL) {