/* Peephole optimization routines and tables Copyright (C) 2001,2002,2003,2007 Free Software Foundation, Inc. This file is part of Gforth. Gforth is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/licenses/. */ #include "config.h" #include "forth.h" #include #include #include /* the numbers in this struct are primitive indices */ typedef struct Combination { int prefix; int lastprim; int combination_prim; } Combination; Combination peephole_table[] = { #include PEEPHOLE_I }; #ifdef PRINT_SUPER_LENGTHS char *prim_names[] = { #include PRIM_NAMES_I }; Combination *find_super(Cell prim) { Cell i; for (i=0; iprefix)+prim_length(super->lastprim); else return prim_length(prim); } void print_prim(Cell prim) { fprintf(stderr, "%s", prim_names[prim]); } void print_super(Cell prim) { Combination *super=find_super(prim); if (super) { print_super(super->prefix); fprintf(stderr, " "); print_prim(super->lastprim); } else { print_prim(prim); } } void print_super_lengths() { Cell i; for (i=0; i>4)&(HASH_SIZE-1)) Cell peeptable; Cell prepare_peephole_table(Inst insts[]) { Cell i; Peeptable_entry **pt = (Peeptable_entry **)calloc(HASH_SIZE,sizeof(Peeptable_entry *)); for (i=0; iprefix = insts[c->prefix]; p->lastprim = insts[c->lastprim]; p->combination_prim = insts[c->combination_prim]; h = hash(p->prefix,p->lastprim); p->next = pt[h]; pt[h] = p; } return (Cell)pt; } Inst peephole_opt(Inst inst1, Inst inst2, Cell peeptable) { Peeptable_entry **pt = (Peeptable_entry **)peeptable; Peeptable_entry *p; if (use_super == 0) return 0; for (p = pt[hash(inst1,inst2)]; p != NULL; p = p->next) if (inst1 == p->prefix && inst2 == p->lastprim) return p->combination_prim; return NULL; }