Return to gforth.fs CVS log

Up to [gforth] / gforth / test

added checking for division by zero and division overflow to
  mixed-size division words (*/ */mod fm/mod sm/rem um/mod).
these exceptions are now tested in our test suite
fixed bug in testing

    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: 
   24: \ f>str-rdp (then f.rdp and f>buf-rdb should also be ok)
   25: 
   26: {  12.3456789e 7 3 1 f>str-rdp s"  12.346" str= -> true }
   27: {  12.3456789e 7 4 1 f>str-rdp s" 12.3457" str= -> true }
   28: { -12.3456789e 7 4 1 f>str-rdp s" -1.23E1" str= -> true }
   29: {      0.0996e 7 3 1 f>str-rdp s"   0.100" str= -> true }
   30: {      0.0996e 7 3 3 f>str-rdp s" 9.96E-2" str= -> true }
   31: {    999.9994e 7 3 1 f>str-rdp s" 999.999" str= -> true }
   32: {    999.9996e 7 3 1 f>str-rdp s" 1.000E3" str= -> true }
   33: {       -1e-20 5 2 1 f>str-rdp s" *****"   str= -> true }
   34: 
   35: \ 0x hex number conversion, or not
   36: 
   37: decimal
   38: { 0x10 -> 16 }
   39: { 0X10 -> 16 }
   40: 36 base !
   41: { 0x10 -> x10 }
   42: decimal
   43: { 'a' -> 97 }
   44: { 'A  -> 65 }
   45: { 1. '1 -> 1. 49 }
   46: 
   47: \ represent has no trailing 0s even for inf and nan
   48: 
   49: {  1e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }
   50: {  0e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }
   51: { -1e 0e f/ pad 16 represent drop 2drop pad 15 + c@ '0 = -> false }
   52: 
   53: \ gforth now guarantees exceptions in division errors
   54: 
   55: \ division by zero
   56: { 1 0 ' /    catch -> 1 0 -10 }
   57: { 1 0 ' mod  catch -> 1 0 -10 }
   58: { 1 0 ' /mod catch -> 1 0 -10 }
   59: { 1 1 0 ' */mod catch -> 1 1 0 -10 }
   60: { 1 1 0 ' */    catch -> 1 1 0 -10 }
   61: { 1. 0 ' fm/mod catch -> 1. 0 -10 }
   62: { 1. 0 ' sm/rem catch -> 1. 0 -10 }
   63: { 1. 0 ' um/mod catch -> 1. 0 -10 }
   64: 
   65: \ division overflows (might come out as "division by zero" or "overflow")
   66: environment-wordlist >order
   67: { max-n invert -1 ' /    catch 0= -> max-n invert -1 false }
   68: { max-n invert -1 ' mod  catch 0= -> max-n invert -1 false }
   69: { max-n invert -1 ' /mod catch 0= -> max-n invert -1 false }
   70: { 1 max-n invert -1 ' */     catch 0= -> 1 max-n invert -1 false }
   71: { 1 max-n invert -1 ' */mod  catch 0= -> 1 max-n invert -1 false }
   72: { max-n invert s>d -1 ' fm/mod catch 0= -> max-n invert s>d -1 false }
   73: { max-n invert s>d -1 ' sm/rem catch 0= -> max-n invert s>d -1 false }
   74: 
   75: { 2 max-n 2/ 1+ 1 ' */    catch 0= -> 2 max-n 2/ 1+ 1 false }
   76: { 2 max-n 2/ 1+ 1 ' */mod catch 0= -> 2 max-n 2/ 1+ 1 false }
   77: { max-n 0 1. d+ 1 ' fm/mod catch 0= -> max-n 0 1. d+ 1 false }
   78: { max-n 0 1. d+ 1 ' sm/rem catch 0= -> max-n 0 1. d+ 1 false }
   79: { max-u 0 1. d+ 1 ' um/mod catch 0= -> max-u 0 1. d+ 1 false }
   80: 
   81: { 1 1 dnegate 2 ' fm/mod catch 0= -> max-u 0 2. d+ dnegate 2 false }
   82: { 1 1 dnegate 2 ' sm/rem catch 0= -> -1 max-n invert true }
   83: 
   84: { 1 1 -2 ' fm/mod catch 0= -> 1 1 -2 false }
   85: { 1 1 -2 ' sm/rem catch 0= -> 1 max-n invert true }
   86: 
   87: { max-u max-n 2/ max-n invert ' fm/mod catch -> -1 max-n invert 0 }
   88: { max-u max-n 2/ max-n invert ' sm/rem catch -> max-n max-n negate 0 }
   89: 
   90: { 0 max-n 2/ 1+ max-n invert ' fm/mod catch -> 0 max-n invert 0 }
   91: { 0 max-n 2/ 1+ max-n invert ' sm/rem catch -> 0 max-n invert 0 }
   92: 
   93: { 1 max-n 2/ 1+ max-n invert ' fm/mod catch 0= -> 1 max-n 2/ 1+ max-n invert false }
   94: { 1 max-n 2/ 1+ max-n invert ' sm/rem catch 0= -> 1 max-n invert true }
   95: 
   96: { 0 max-u -1. d+ max-u ' um/mod catch 0= -> max-u 1- max-u true }
   97: { 0 max-u max-u ' um/mod catch 0= -> 0 max-u max-u false }