org.armedbear.lisp.function_info Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of abcl Show documentation
Show all versions of abcl Show documentation
Common Lisp implementation running on the JVM
/*
* function_info.java
*
* Copyright (C) 2004-2005 Peter Graves
* $Id$
*
* This program 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 2
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* As a special exception, the copyright holders of this library give you
* permission to link this library with independent modules to produce an
* executable, regardless of the license terms of these independent
* modules, and to copy and distribute the resulting executable under
* terms of your choice, provided that you also meet, for each linked
* independent module, the terms and conditions of the license of that
* module. An independent module is a module which is not derived from
* or based on this library. If you modify this library, you may extend
* this exception to your version of the library, but you are not
* obligated to do so. If you do not wish to do so, delete this
* exception statement from your version.
*/
package org.armedbear.lisp;
import java.util.Map;
import java.util.Collections;
import java.util.WeakHashMap;
import static org.armedbear.lisp.Lisp.*;
public final class function_info
{
// ### TODO: Replace by a concurrent hashmap, with weak keys, ofcourse.
final static Map symbolToFunctionMap =
Collections.synchronizedMap(new WeakHashMap());
// ### function-info name
private static final Primitive FUNCTION_INFO =
new Primitive("function-info", PACKAGE_SYS, false)
{
@Override
public LispObject execute(LispObject arg)
{
LispObject info = symbolToFunctionMap.get(arg);
return info != null ? info : NIL;
}
};
// ### %set-function-info name info
private static final Primitive _SET_FUNCTION_INFO =
new Primitive("%set-function-info", PACKAGE_SYS, false)
{
@Override
public LispObject execute(LispObject name, LispObject info)
{
if (info == NIL)
symbolToFunctionMap.remove(name);
else
symbolToFunctionMap.put(name, info);
return info;
}
};
// ### get-function-info-value name indicator => value
private static final Primitive GET_FUNCTION_INFO_VALUE =
new Primitive("get-function-info-value", PACKAGE_SYS, true,
"name indicator")
{
@Override
public LispObject execute(LispObject name, LispObject indicator)
{
// info is an alist
LispObject info = symbolToFunctionMap.get(name);
if (info != null) {
while (info != NIL) {
LispObject cons = info.car();
if (cons instanceof Cons) {
if (cons.car().eql(indicator)) {
// Found it.
return LispThread.currentThread().setValues(cons.cdr(), T);
}
} else if (cons != NIL)
type_error(cons, Symbol.LIST);
info = info.cdr();
}
}
return LispThread.currentThread().setValues(NIL, NIL);
}
};
// ### set-function-info-value name indicator value => value
private static final Primitive SET_FUNCTION_INFO_VALUE =
new Primitive("set-function-info-value", PACKAGE_SYS, true,
"name indicator value")
{
@Override
public LispObject execute(LispObject name, LispObject indicator,
LispObject value)
{
// info is an alist
LispObject info = symbolToFunctionMap.get(name);
if (info == null)
info = NIL;
LispObject alist = info;
while (alist != NIL) {
LispObject cons = alist.car();
if (cons instanceof Cons) {
if (cons.car().eql(indicator)) {
// Found it.
cons.setCdr(value);
return value;
}
} else if (cons != NIL)
type_error(cons, Symbol.LIST);
alist = alist.cdr();
}
// Not found.
symbolToFunctionMap.put(name, info.push(new Cons(indicator, value)));
return value;
}
};
}