X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fplist.c;h=aea85f5f58e6b5153c4e0f34c00f4d0e96225a33;hb=4bc38ea2ba218ad082162de7ff3dfeadd5b66561;hp=dc9ae7a280a26f869aa92fcb0421c6331f25d4dc;hpb=2948a7017e7e296b8a92fbeab6df689abd418660;p=libfirm

diff --git a/ir/adt/plist.c b/ir/adt/plist.c
index dc9ae7a28..aea85f5f5 100644
--- a/ir/adt/plist.c
+++ b/ir/adt/plist.c
@@ -1,14 +1,32 @@
+/*
+ * 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
+ * @version $Id$
  */
 #include <stdlib.h>
 
@@ -37,7 +55,7 @@ static plist_element_t *allocate_element(plist_t* list) {
 }
 
 plist_t *plist_new(void) {
-	plist_t *list = xmalloc(sizeof(*list));
+	plist_t *list = xmalloc(sizeof(*list) + sizeof(*list->obst));
 
 	list->obst               = (struct obstack *)&list[1];
 	list->foreign_obstack    = 0;