File:  [gforth] / gforth / test / gforth-nofast.fs
Revision 1.1: download - view: text, annotated - select for diffs
Fri Oct 27 21:47:02 2006 UTC (16 years, 1 month ago) by anton
Branches: MAIN
CVS tags: HEAD
Disabled division checks in gforth-fast
documented that and the floored division default

    1: \ test some gforth extension words
    2: 
    3: \ Copyright (C) 2003,2004,2005 Free Software Foundation, Inc.
    4: 
    5: \ This file is part of Gforth.
    6: 
    7: \ Gforth is free software; you can redistribute it and/or
    8: \ modify it under the terms of the GNU General Public License
    9: \ as published by the Free Software Foundation; either version 2
   10: \ of the License, or (at your option) any later version.
   11: 
   12: \ This program is distributed in the hope that it will be useful,
   13: \ but WITHOUT ANY WARRANTY; without even the implied warranty of
   14: \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   15: \ GNU General Public License for more details.
   16: 
   17: \ You should have received a copy of the GNU General Public License
   18: \ along with this program; if not, write to the Free Software
   19: \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
   20: 
   21: require ./tester.fs
   22: decimal
   23: \ division exception tests; exceptions are not guaranteed for gforth-fast
   24: environment-wordlist >order
   25: { max-n invert -1 ' /    catch 0= -> max-n invert -1 false }
   26: { max-n invert -1 ' mod  catch 0= -> max-n invert -1 false }
   27: { max-n invert -1 ' /mod catch 0= -> max-n invert -1 false }
   28: { 1 max-n invert -1 ' */     catch 0= -> 1 max-n invert -1 false }
   29: { 1 max-n invert -1 ' */mod  catch 0= -> 1 max-n invert -1 false }
   30: { max-n invert s>d -1 ' fm/mod catch 0= -> max-n invert s>d -1 false }
   31: { max-n invert s>d -1 ' sm/rem catch 0= -> max-n invert s>d -1 false }
   32: 
   33: { 2 max-n 2/ 1+ 1 ' */    catch 0= -> 2 max-n 2/ 1+ 1 false }
   34: { 2 max-n 2/ 1+ 1 ' */mod catch 0= -> 2 max-n 2/ 1+ 1 false }
   35: { max-n 0 1. d+ 1 ' fm/mod catch 0= -> max-n 0 1. d+ 1 false }
   36: { max-n 0 1. d+ 1 ' sm/rem catch 0= -> max-n 0 1. d+ 1 false }
   37: { max-u 0 1. d+ 1 ' um/mod catch 0= -> max-u 0 1. d+ 1 false }
   38: 
   39: { 1 1 dnegate 2 ' fm/mod catch 0= -> max-u 0 2. d+ dnegate 2 false }
   40: { 1 1 dnegate 2 ' sm/rem catch 0= -> -1 max-n invert true }
   41: 
   42: { 1 1 -2 ' fm/mod catch 0= -> 1 1 -2 false }
   43: { 1 1 -2 ' sm/rem catch 0= -> 1 max-n invert true }
   44: 
   45: { max-u max-n 2/ max-n invert ' fm/mod catch -> -1 max-n invert 0 }
   46: { max-u max-n 2/ max-n invert ' sm/rem catch -> max-n max-n negate 0 }
   47: 
   48: { 0 max-n 2/ 1+ max-n invert ' fm/mod catch -> 0 max-n invert 0 }
   49: { 0 max-n 2/ 1+ max-n invert ' sm/rem catch -> 0 max-n invert 0 }
   50: 
   51: { 1 max-n 2/ 1+ max-n invert ' fm/mod catch 0= -> 1 max-n 2/ 1+ max-n invert false }
   52: { 1 max-n 2/ 1+ max-n invert ' sm/rem catch 0= -> 1 max-n invert true }
   53: 
   54: { 0 max-u -1. d+ max-u ' um/mod catch 0= -> max-u 1- max-u true }
   55: { 0 max-u max-u ' um/mod catch 0= -> 0 max-u max-u false }

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>