Annotation of gforth/test/gforth-nofast.fs, revision 1.2

1.2     ! anton       1: \ test stuff that is not guaranteed in gforth-fast, but elsewhere
1.1       anton       2: 
1.2     ! anton       3: \ Copyright (C) 2006 Free Software Foundation, Inc.
1.1       anton       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
1.2     ! anton      23: 
        !            24: \ division by zero
        !            25: { 1 0 ' /    catch -> 1 0 -10 }
        !            26: { 1 0 ' mod  catch -> 1 0 -10 }
        !            27: { 1 0 ' /mod catch -> 1 0 -10 }
        !            28: { 1 1 0 ' */mod catch -> 1 1 0 -10 }
        !            29: { 1 1 0 ' */    catch -> 1 1 0 -10 }
        !            30: { 1. 0 ' fm/mod catch -> 1. 0 -10 }
        !            31: { 1. 0 ' sm/rem catch -> 1. 0 -10 }
        !            32: { 1. 0 ' um/mod catch -> 1. 0 -10 }
        !            33: 
        !            34: \ division overflow
1.1       anton      35: environment-wordlist >order
                     36: { max-n invert -1 ' /    catch 0= -> max-n invert -1 false }
                     37: { max-n invert -1 ' mod  catch 0= -> max-n invert -1 false }
                     38: { max-n invert -1 ' /mod catch 0= -> max-n invert -1 false }
                     39: { 1 max-n invert -1 ' */     catch 0= -> 1 max-n invert -1 false }
                     40: { 1 max-n invert -1 ' */mod  catch 0= -> 1 max-n invert -1 false }
                     41: { max-n invert s>d -1 ' fm/mod catch 0= -> max-n invert s>d -1 false }
                     42: { max-n invert s>d -1 ' sm/rem catch 0= -> max-n invert s>d -1 false }
                     43: 
                     44: { 2 max-n 2/ 1+ 1 ' */    catch 0= -> 2 max-n 2/ 1+ 1 false }
                     45: { 2 max-n 2/ 1+ 1 ' */mod catch 0= -> 2 max-n 2/ 1+ 1 false }
                     46: { max-n 0 1. d+ 1 ' fm/mod catch 0= -> max-n 0 1. d+ 1 false }
                     47: { max-n 0 1. d+ 1 ' sm/rem catch 0= -> max-n 0 1. d+ 1 false }
                     48: { max-u 0 1. d+ 1 ' um/mod catch 0= -> max-u 0 1. d+ 1 false }
                     49: 
                     50: { 1 1 dnegate 2 ' fm/mod catch 0= -> max-u 0 2. d+ dnegate 2 false }
                     51: { 1 1 dnegate 2 ' sm/rem catch 0= -> -1 max-n invert true }
                     52: 
                     53: { 1 1 -2 ' fm/mod catch 0= -> 1 1 -2 false }
                     54: { 1 1 -2 ' sm/rem catch 0= -> 1 max-n invert true }
                     55: 
                     56: { max-u max-n 2/ max-n invert ' fm/mod catch -> -1 max-n invert 0 }
                     57: { max-u max-n 2/ max-n invert ' sm/rem catch -> max-n max-n negate 0 }
                     58: 
                     59: { 0 max-n 2/ 1+ max-n invert ' fm/mod catch -> 0 max-n invert 0 }
                     60: { 0 max-n 2/ 1+ max-n invert ' sm/rem catch -> 0 max-n invert 0 }
                     61: 
                     62: { 1 max-n 2/ 1+ max-n invert ' fm/mod catch 0= -> 1 max-n 2/ 1+ max-n invert false }
                     63: { 1 max-n 2/ 1+ max-n invert ' sm/rem catch 0= -> 1 max-n invert true }
                     64: 
                     65: { 0 max-u -1. d+ max-u ' um/mod catch 0= -> max-u 1- max-u true }
                     66: { 0 max-u max-u ' um/mod catch 0= -> 0 max-u max-u false }

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