Commit f8cc1566 authored by Matthias Braun's avatar Matthias Braun
Browse files

remove $Id$, it doesn't work with git anyway

parent a81596fb
dnl configure.ac file for libfirm, author Matthias Braun <matze@braunis.de>
dnl Process this file with autoconf to produce a configure script.
AC_PREREQ([2.60])
AC_REVISION([$Id$])
dnl Firm Versions
dnl * Increment major/minor/micro version as you see fit. These 3 numbers
......
......@@ -21,7 +21,6 @@
* @file
* @brief Dynamic and flexible arrays for C.
* @author Markus Armbruster, Michael Beck, Matthias Braun, Sebastian Hack
* @version $Id$
*/
#ifndef FIRM_ADT_ARRAY_H
#define FIRM_ADT_ARRAY_H
......
......@@ -22,7 +22,6 @@
* @date 16.03.2007
* @brief a set of pointers with a custom compare function
* @author Matthias Braun
* @version $Id$
*/
#ifndef FIRM_ADT_CPSET_H
#define FIRM_ADT_CPSET_H
......
......@@ -23,7 +23,6 @@
* instead)
* @author Hubert Schmid
* @date 09.06.2002
* @version $Id$
* @deprecated
*/
#ifndef FIRM_ADT_ESET_H
......
......@@ -21,7 +21,6 @@
* @file
* @brief Define the famous infame FOURCC macro.
* @date 02.01.2004
* @version $Id$
*/
#ifndef FIRM_ADT_FOURCC_H
#define FIRM_ADT_FOURCC_H
......
......@@ -21,7 +21,6 @@
* @file
* @brief Hash function for pointers
* @author Michael Beck, Sebastian Hack
* @version $Id$
*/
#ifndef FIRM_ADT_HASHPTR_H
#define FIRM_ADT_HASHPTR_H
......
......@@ -22,7 +22,6 @@
* @date 16.03.2007
* @brief Generic hashset functions
* @author Matthias Braun
* @version $Id$
*
* You have to specialize this header by defining HashSet, HashSetIterator and
* ValueType
......
......@@ -28,7 +28,6 @@
/**
* @file
* @brief Solving the Minimum Assignment Problem using the Hungarian Method.
* @version $Id$
*/
#ifndef FIRM_ADT_HUNGARIAN_H
#define FIRM_ADT_HUNGARIAN_H
......
......@@ -23,7 +23,6 @@
* Useful for formatted and unified dumping of collections of objects.
* @author Sebastian Hack
* @date 29.11.2004
* @version $Id$
*/
#ifndef FIRM_ADT_ITERATOR_H
#define FIRM_ADT_ITERATOR_H
......
/**
* @file
* @brief Doubly linked lists.
* @version $Id$
*
* Simple doubly linked list implementation.
*
......
......@@ -21,7 +21,6 @@
* @file
* @brief Provied obstack_chunk_alloc and obstack_chunk_free for obstack.h
* @author Martin Trapp, Christian Schaefer
* @version $Id$
*/
#ifndef FIRM_ADT_OBST_H
#define FIRM_ADT_OBST_H
......
......@@ -21,7 +21,6 @@
* @file
* @brief double ended queue of generic pointers.
* @author Christian von Roques
* @version $Id$
*/
#ifndef FIRM_ADT_PDEQ_H
#define FIRM_ADT_PDEQ_H
......
......@@ -21,7 +21,6 @@
* @file
* @author Kimon Hoffmann
* @date 14.07.2005
* @version $Id$
* @brief 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.
......
......@@ -22,7 +22,6 @@
* @brief Simplified hashnap for pointer->pointer relations
* @author Hubert Schmid
* @date 09.06.2002
* @version $Id$
*/
#ifndef FIRM_ADT_PMAP_H
#define FIRM_ADT_PMAP_H
......
......@@ -23,7 +23,6 @@
* @author Christian Wuerdig
* @brief Implementation of a priority queue. This is the ported version of
the original Java implementation by Matthias Braun.
* @version $Id$
*/
#ifndef FIRM_ADT_PQUEUE_H
#define FIRM_ADT_PQUEUE_H
......
......@@ -22,7 +22,6 @@
* @brief optimized version of set for sets containing only pointers
* (deprecated)
* @author Markus Armbruster
* @version $Id$
* @note This code has been deprecated. Use pset_new or cpset for new
* code.
*/
......
......@@ -22,7 +22,6 @@
* @date 17.03.2007
* @brief hashset containing pointers
* @author Matthias Braun
* @version $Id$
*
* @note This has been named pset_new_new for now until all code has been
* changed to use this instead of the old deprecated pset_new functions!
......
......@@ -21,7 +21,6 @@
* @file
* @brief hashset: datastructure containing objects accessible by their key
* @author Markus Armbruster
* @version $Id$
*/
#ifndef FIRM_ADT_SET_H
#define FIRM_ADT_SET_H
......
......@@ -21,7 +21,6 @@
* @file
* @brief Union-Find datastructure
* @author Matthias Braun
* @version $Id$
* @brief
* Union-Find datastructure
*
......
......@@ -21,7 +21,6 @@
* @file
* @brief never failing wrappers for malloc() & friends.
* @author Markus Armbruster
* @version $Id$
* @note The functions here never fail because they simply abort your
* program in case of an error.
*/
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment