X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fst%2Fbs.h;h=8b28b9ce3746a1b30f17dda9b37ed5c0e8b01532;hb=5679b7b33dbf50a18c5ec8e2803fd269ac953671;hp=beea7f87708abc9a29b0c0dc2fb8e0f3a4408d92;hpb=df83e37827032795585d3b25776c465870672901;p=libfirm

diff --git a/ir/st/bs.h b/ir/st/bs.h
index beea7f877..8b28b9ce3 100644
--- a/ir/st/bs.h
+++ b/ir/st/bs.h
@@ -1,6 +1,6 @@
 /* Copyright (c) 2002 by Universität Karlsruhe (TH).  All Rights Reserved */
 
-/**
+/*
    NAME
      bs
    PURPOSE
@@ -11,20 +11,32 @@
      liekweg - Feb 27, 2002: Created.
    CVS:
      $Id$
-***/
+ */
 
 # ifndef _BS_H_
 # define _BS_H_
 
+/**
+ * the type of a bit set
+ */
 typedef long int bs_t;
 
+/** set bit in a bit set */
 # define bs_set(bs, i) (bs) |= (0x00000001 << i)
+
+/** get bit in a bit set */
 # define bs_get(bs, i) (bs) &  (0x00000001 << i)
 
+/** logical AND of two bit sets */
 # define bs_and(bsa, bsb) (bsa) &= (bsb)
+
+/** logical OR of two bit sets */
 # define bs_or(bsa, bsb)  (bsa) |= (bsb)
+
+/** logical XOR of two bit sets */
 # define bs_xor(bsa, bsb) (bsa) ^= (bsb)
 
+/** returns TRUE if at least one bit is set */
 # define bs_zro(bs) (0x00000000 != bs)
 
 # endif /* ndef _BS_H_ */