X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/f6fbd3da9d1366ccaa0163c6c93dde11e5720262..eb1b07409f0ccad9970c8a60ded9f2a56d205b9c:/src/closure.c?ds=sidebyside diff --git a/src/closure.c b/src/closure.c index 01f026bb..a6cc784a 100644 --- a/src/closure.c +++ b/src/closure.c @@ -1,7 +1,7 @@ /* Closures for Bison - Copyright (C) 1984, 1989, 2000, 2001, 2002, 2004 Free Software - Foundation, Inc. + Copyright (C) 1984, 1989, 2000, 2001, 2002, 2004, 2005, 2007 Free + Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -17,9 +17,10 @@ You should have received a copy of the GNU General Public License along with Bison; see the file COPYING. If not, write to the Free - Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA - 02111-1307, USA. */ + Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA + 02110-1301, USA. */ +#include #include "system.h" #include @@ -36,7 +37,7 @@ /* NITEMSET is the size of the array ITEMSET. */ item_number *itemset; -size_t nritemset; +size_t nitemset; static bitset ruleset; @@ -212,30 +213,32 @@ closure (item_number *core, size_t n) if (ISVAR (ritem[core[c]])) bitset_or (ruleset, ruleset, FDERIVES (ritem[core[c]])); - nritemset = 0; + /* core is sorted on item index in ritem, which is sorted on rule number. + Compute itemset with the same sort. */ + nitemset = 0; c = 0; BITSET_FOR_EACH (iter, ruleset, ruleno, 0) { item_number itemno = rules[ruleno].rhs - ritem; while (c < n && core[c] < itemno) { - itemset[nritemset] = core[c]; - nritemset++; + itemset[nitemset] = core[c]; + nitemset++; c++; } - itemset[nritemset] = itemno; - nritemset++; + itemset[nitemset] = itemno; + nitemset++; }; while (c < n) { - itemset[nritemset] = core[c]; - nritemset++; + itemset[nitemset] = core[c]; + nitemset++; c++; } if (trace_flag & trace_sets) - print_closure ("output", itemset, nritemset); + print_closure ("output", itemset, nitemset); }