98f64ae516
* module/language/c99/compiler.mes (expr->accu): Add mul. (test->jump->info): Add le, ge. (ast->info): Support int and char* initialization at top level. * module/mes/as-i386.mes (i386:accu*base, i386:Xjump-cz, i386:Xjump-ncz): New function. * module/mes/as-i386.scm: Export them. * doc/examples/t.c (test): Test them. * module/mes/libc.mes (ungetc): New function. (getchar): Support it. (assert_fail, isdigit): New functions. (libc): Export them. * module/mes/mini-0.mes: Load full reader. * mlibc.c (ungetc): New function. (getchar): Support it. (assert_fail, isdigit): New functions. * mes.c (list length error lookup_ getchar ungetchar peekchar peek_byte read_byte unread_byte greater_p less_p): Move functions needed to run read-0.mes into core. * doc/examples/mini-mes.c: Likewise. * lib.c (length, error): Comment-out. * math.c (greater_p, less_p): Comment-out. * posix.c: (getchar, ungetchar, peekchar, peek_byte, read_byte, unread_byte): Comment-out. * reader.c (lookup_): Comment-out.
159 lines
3.3 KiB
C
159 lines
3.3 KiB
C
/* -*-comment-start: "//";comment-end:""-*-
|
|
* Mes --- Maxwell Equations of Software
|
|
* Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
|
*
|
|
* This file is part of Mes.
|
|
*
|
|
* Mes 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.
|
|
*
|
|
* Mes 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 Mes. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
//MINI_MES
|
|
// SCM
|
|
// greater_p (SCM x) ///((name . ">") (arity . n))
|
|
// {
|
|
// int n = INT_MAX;
|
|
// while (x != cell_nil)
|
|
// {
|
|
// assert (TYPE (car (x)) == TNUMBER);
|
|
// if (VALUE (car (x)) >= n) return cell_f;
|
|
// n = VALUE (car (x));
|
|
// x = cdr (x);
|
|
// }
|
|
// return cell_t;
|
|
// }
|
|
|
|
// SCM
|
|
// less_p (SCM x) ///((name . "<") (arity . n))
|
|
// {
|
|
// int n = INT_MIN;
|
|
// while (x != cell_nil)
|
|
// {
|
|
// assert (TYPE (car (x)) == TNUMBER);
|
|
// if (VALUE (car (x)) <= n) return cell_f;
|
|
// n = VALUE (car (x));
|
|
// x = cdr (x);
|
|
// }
|
|
// return cell_t;
|
|
// }
|
|
|
|
SCM
|
|
is_p (SCM x) ///((name . "=") (arity . n))
|
|
{
|
|
if (x == cell_nil) return cell_t;
|
|
assert (TYPE (car (x)) == TNUMBER);
|
|
int n = VALUE (car (x));
|
|
x = cdr (x);
|
|
while (x != cell_nil)
|
|
{
|
|
if (VALUE (car (x)) != n) return cell_f;
|
|
x = cdr (x);
|
|
}
|
|
return cell_t;
|
|
}
|
|
|
|
SCM
|
|
minus (SCM x) ///((name . "-") (arity . n))
|
|
{
|
|
SCM a = car (x);
|
|
assert (TYPE (a) == TNUMBER);
|
|
int n = VALUE (a);
|
|
x = cdr (x);
|
|
if (x == cell_nil)
|
|
n = -n;
|
|
while (x != cell_nil)
|
|
{
|
|
assert (TYPE (car (x)) == TNUMBER);
|
|
n -= VALUE (car (x));
|
|
x = cdr (x);
|
|
}
|
|
return MAKE_NUMBER (n);
|
|
}
|
|
|
|
SCM
|
|
plus (SCM x) ///((name . "+") (arity . n))
|
|
{
|
|
int n = 0;
|
|
while (x != cell_nil)
|
|
{
|
|
assert (TYPE (car (x)) == TNUMBER);
|
|
n += VALUE (car (x));
|
|
x = cdr (x);
|
|
}
|
|
return MAKE_NUMBER (n);
|
|
}
|
|
|
|
SCM
|
|
divide (SCM x) ///((name . "/") (arity . n))
|
|
{
|
|
int n = 1;
|
|
if (x != cell_nil) {
|
|
assert (TYPE (car (x)) == TNUMBER);
|
|
n = VALUE (car (x));
|
|
x = cdr (x);
|
|
}
|
|
while (x != cell_nil)
|
|
{
|
|
assert (TYPE (car (x)) == TNUMBER);
|
|
n /= VALUE (car (x));
|
|
x = cdr (x);
|
|
}
|
|
return MAKE_NUMBER (n);
|
|
}
|
|
|
|
SCM
|
|
modulo (SCM a, SCM b)
|
|
{
|
|
assert (TYPE (a) == TNUMBER);
|
|
assert (TYPE (b) == TNUMBER);
|
|
int x = VALUE (a);
|
|
while (x < 0) x += VALUE (b);
|
|
return MAKE_NUMBER (x % VALUE (b));
|
|
}
|
|
|
|
SCM
|
|
multiply (SCM x) ///((name . "*") (arity . n))
|
|
{
|
|
int n = 1;
|
|
while (x != cell_nil)
|
|
{
|
|
assert (TYPE (car (x)) == TNUMBER);
|
|
n *= VALUE (car (x));
|
|
x = cdr (x);
|
|
}
|
|
return MAKE_NUMBER (n);
|
|
}
|
|
|
|
SCM
|
|
logior (SCM x) ///((arity . n))
|
|
{
|
|
int n = 0;
|
|
while (x != cell_nil)
|
|
{
|
|
assert (TYPE (car (x)) == TNUMBER);
|
|
n |= VALUE (car (x));
|
|
x = cdr (x);
|
|
}
|
|
return MAKE_NUMBER (n);
|
|
}
|
|
|
|
SCM
|
|
ash (SCM n, SCM count)
|
|
{
|
|
assert (TYPE (n) == TNUMBER);
|
|
assert (TYPE (count) == TNUMBER);
|
|
int cn = VALUE (n);
|
|
int ccount = VALUE (count);
|
|
return MAKE_NUMBER ((ccount < 0) ? cn >> -ccount : cn << ccount);
|
|
}
|