]>
git.saurik.com Git - bison.git/blob - src/warshall.c
1 /* Generate transitive closure of a matrix,
2 Copyright 1984, 1989, 2000, 2001 Free Software Foundation, Inc.
4 This file is part of Bison, the GNU Compiler Compiler.
6 Bison is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 Bison is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with Bison; see the file COPYING. If not, write to
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
26 /*-------------------------------------------------------------.
27 | Given n by n matrix of bits R, modify its contents to be the |
28 | transive closure of what was given. |
29 `-------------------------------------------------------------*/
32 bitmatrix_print (const char *title
, unsigned *matrix
, size_t size
)
35 size_t rowsize
= WORDSIZE (size
) * sizeof (unsigned);
36 #define ROW(Num) ((unsigned *) ((char *) matrix + ((Num) * rowsize)))
39 fprintf (stderr
, "%s BEGIN\n", title
);
43 for (i
= 0; i
< size
; ++i
)
44 putc (i
/ 10 ? '0' + i
/ 10 : ' ', stderr
);
47 for (i
= 0; i
< size
; ++i
)
48 fprintf (stderr
, "%d", i
% 10);
53 for (i
= 0; i
< size
; ++i
)
55 fputs (".\n", stderr
);
58 for (i
= 0; i
< size
; ++i
)
60 fprintf (stderr
, "%2d|", i
);
61 for (j
= 0; j
< size
; ++j
)
62 fputs (BITISSET (ROW (i
), j
) ? "1" : " ", stderr
);
63 fputs ("|\n", stderr
);
68 for (i
= 0; i
< size
; ++i
)
70 fputs ("'\n", stderr
);
73 fprintf (stderr
, "%s END\n\n", title
);
76 #define R(Num) (unsigned *) ((char *) R + ((Num) * rowsize))
79 TC (unsigned *R
, int n
)
81 int rowsize
= WORDSIZE (n
) * sizeof (unsigned);
85 bitmatrix_print ("TC: Input", R
, n
);
87 /* R (J, I) && R (I, K) => R (J, K).
88 I *must* be the outter loop. */
90 for (i
= 0; i
< n
; ++i
)
91 for (j
= 0; j
< n
; ++j
)
92 if (BITISSET (R (j
), i
))
93 for (k
= 0; k
< n
; ++k
)
94 if (BITISSET (R (i
), k
))
98 bitmatrix_print ("TC: Output", R
, n
);
102 /*---------------------------------------------------------------.
103 | Reflexive Transitive Closure. Same as TC and then set all the |
104 | bits on the diagonal of R. |
105 `---------------------------------------------------------------*/
108 RTC (unsigned *R
, int n
)
110 int rowsize
= WORDSIZE (n
) * sizeof (unsigned);
114 for (i
= 0; i
< n
; ++i
)