armedbear-devel January 2011

armedbear-devel@common-lisp.net

17 participants
32 discussions

[armedbear-devel] Memory leak
by Blake McBride 10 Jan '11

10 Jan '11

Greetings, I think there is a memory leak. I constructed the enclosed lisp files and compiled memtest2.lisp. On a clean abcl evocation I load "try.lisp" and run the various tryN functions. I've mainly been using N=10. You can see that there is a leak when running memtest2. This leak would kill my app after ongoing usage. On another note, memtest2.lisp creates 1000 functions. If you change the number to 10,000 it can't be compiled. This speaks to the error that was reported recently. Thanks. Blake McBride

3 2

[armedbear-devel] [CfP] European Lisp Symposium deadline extension
by Didier Verna 10 Jan '11

10 Jan '11

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 4th European Lisp Symposium Special Focus on Parallelism & Efficiency March 31 - April 1st, 2011 TUHH, Hamburg University of Technology Hamburg, Germany http://www.european-lisp-symposium.org/ Sponsored by EPITA, Lispworks, Franz Inc. and Nova Sparks ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Important Dates ~~~~~~~~~~~~~~~~ + Submission Deadline: January 16, 2011 --- EXTENDED + Author Notification: February 06, 2011 + Final Paper Due: February 28, 2011 + Symposium: March 31 - April 1st, 2011 Authors of accepted research contributions will be invited to submit an extended version of their papers for journal publication. Invited Speakers: ~~~~~~~~~~~~~~~~~ Marc Battyani (Nova Sparks) Craig Zilles (University of Illinois) Scope ~~~~~~ The purpose of the European Lisp Symposium is to provide a forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP, Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL and so on. We encourage everyone interested in Lisp to participate. The European Lisp Symposium 2011 invites high quality papers about novel research results, insights and lessons learned from practical applications, and educational perspectives. We also encourage submissions about known ideas as long as they are presented in a new setting and/or in a highly elegant way. This year's focus will be directed towards "Parallelism & Efficiency". We especially invite submissions in the following areas: + Parallel and distributed computing + Code generation for multi-core architectures + Code generation for HTM + Large and ultra-large systems + Optimization techniques + Embedded applications Contributions are also welcome in other areas, including but not limited to: + Context-, aspect-, domain-oriented and generative programming + Macro-, reflective-, meta- and/or rule-based development approaches + Language design and implementation + Language integration, inter-operation and deployment + Development methodologies, support and environments + Educational approaches and perspectives + Experience reports and case studies Technical Program: ~~~~~~~~~~~~~~~~~~ We invite submissions in the following forms: * Papers: Technical papers of up to 15 pages that describe original results or explain known ideas in new and elegant ways. * Demonstrations: Abstracts of up to 4 pages for demonstrations of tools, libraries, and applications. * Tutorials: Abstracts of up to 4 pages for in-depth presentations about topics of special interest for at least 90 minutes and up to 180 minutes. * Lightning talks: Abstracts of up to one page for talks to last for no more than 5 minutes. All submissions should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates http://www.acm.org/about/class/1998 Submissions should be uploaded to Easy Chair, at the following address: http://www.easychair.org/conferences/?conf=els2011 Programme Chair ~~~~~~~~~~~~~~~~ Didier Verna - EPITA Research and Development Laboratory, France Local Chair ~~~~~~~~~~~~ Ralf Moeller - Hamburg University of Technology, Germany Programme Committee ~~~~~~~~~~~~~~~~~~~~ Antonio Leitao - Instituto Superior Tecnico/INESC-ID, Portugal Christophe Rhodes - Goldsmiths College, University of London, UK David Edgar Liebke - Relevance Inc., USA Didier Verna - EPITA Research and Development Laboratory, France Henry Lieberman - MIT Media Laboratory, USA Jay McCarthy - Brigham Young University, USA Jose Luis Ruiz Reina - Universidad de Sevilla, Spain Marco Antoniotti - Universita Milano Bicocca, Italy Manuel Serrano - INRIA, France Michael Sperber - DeinProgramm, Germany Pascal Costanza - Vrije Universiteit of Brussel, Belgium Scott McKay - ITA Software, USA -- Resistance is futile. You will be jazzimilated. Scientific site: http://www.lrde.epita.fr/~didier Music (Jazz) site: http://www.didierverna.com

1 0

[armedbear-devel] Broken link in documentation
by Didier Verna 06 Jan '11

06 Jan '11

The page http://common-lisp.net/project/armedbear/doc/abcl-user.html contains two pointers to files under this directory: http://trac.common-lisp.net/armedbear/browser/trunk/abcl/examples/abcl/java… both are broken links. In fact, it seems that every example pointer to trac is broken. Once in the trac "not found" page, I have a 50% chance to get an Internal Server Error when clinking on Search, but last time, I got to a working page showing this last change: (delete) @12718 [12719] 8 months mevenson Example reorganzation: delete 'abcl' directory. It seems to indicate that the abcl directory under examples/ should be removed in the links, which indeed seems to be the case: I can reach this one instead: http://trac.common-lisp.net/armedbear/browser/trunk/abcl/examples -- Resistance is futile. You will be jazzimilated. Scientific site: http://www.lrde.epita.fr/~didier Music (Jazz) site: http://www.didierverna.com

2 2

[armedbear-devel] JSR-223: path names with spaces and output capturing
by Martin Hepperle 05 Jan '11

05 Jan '11

Hello all, hope you had good start into 2011. ABCL via JSR-223 is almost perfect now, but I have two things which do not work perfectly: A) How to handle path names with spaces? When my Java application is installed in a path with spaces (which should be no problem nowadays in 2011), I receive the following error when the ABCL engine is created: ERROR placeholder called with arguments: #<ERROR {590510}> "Failed to find loadable system file in boot classpath 'jar:file:/D:/Programme/MH%20AeroTools/PROPPY/bin/languages/abcl.jar!/org/armedbear/lisp/boot.lisp'" The spaces have been encoded by "%20", but obviously ABCL does not understand this boot path. B) How to redirect I/O of the script engine? If I want to use a scripting engine in my application, the user may make mistakes. OK. For this purpose I have to 1) catch errors in Java, which works by placing the following two lines into "abcl-script-config.lisp" (in-package :abcl-script) (setq *use-throwing-debugger* nil) 2) catch standard error and standatd output. While JSR provides an interface for this vi "setWriter" and "setErrorWriter", I discovered that most JSR-223 engines do not implement this correctly. So I resorted to redirect the system streams via "System.setOut" and "System.setErr", which worked for all JSR-223 implementations so far ... except ABCL. I always reveive error mesages, as well as the initialization message (...ABCL: configured ) on standard output, possibly bypassing the system streams? So how can I capture errors? Is t possible to rediredt errro and output (e.g.of print) to the standard output and standard error streams of the Java system? Maybe there is some extra initialization needed in ABCL to do this in case of the JSR-223 engine. Thanks for listening, Martin

2 2

[armedbear-devel] Several ABCL/Java questions
by Didier Verna 04 Jan '11

04 Jan '11

Hello, I'm trying to port Clon[1] to ABCL, or at least figure out whether it makes sense at all. My Java programming experience boils down to a Hello World program 10 years ago or so, so some questions belong to the Java side of ABCL for sure :-). I would be grateful if somebody can help me answer these. 1/ Is it possible to create standalone ABCL executables and how ? 2/ ABCL doesn't seem to provide a [set|put]env function. From what I can gather from the internet, that would be because there's no such thing in Java. I've seen some nasty tricks around consisting in modifying the (application-local) initial memory mapping of the environment, but that's all. Is this correct ? 3/ It seems that ABCL does not have a complete MOP. In particular, I couldn't find a validate-superclass function. Is this correct ? Does this mean that classes/superclasses are implicitely "validated" ? 4/ There is a place where I need to access low-level information about a stream in order to figure out whether it's connected to a tty, and in that case, what's the tty line-width. In other implementations, I have native support (or cffi support in the case of CLISP) for calling ioctl with the TIOCGWINSZ argument. It either gets me the tty line width or throws me an ENOTTY error in the face which is fine. How can I do something similar in ABCL ? Thank you very much ! Footnotes: [1] http://www.lrde.epita.fr/~didier/software/lisp/clon.php -- Resistance is futile. You will be jazzimilated. Scientific site: http://www.lrde.epita.fr/~didier Music (Jazz) site: http://www.didierverna.com

4 8

Re: [armedbear-devel] Several ABCL/Java questions
by Luís Oliveira 04 Jan '11

04 Jan '11

On 04-01-2011 11:08, Ville Voutilainen wrote: > On 4 January 2011 13:05, Mark Evenson<evenson(a)panix.com> wrote: >> Low level stuff for which you know the local system analogs via ANSI C >> linkage would be well served by using CFFI to wrap calls to >> [abcl-cffi-jna][]. We have a [putative patch to run JNA with the >> callbacks made possible via constructing the necessary Java interfaces >> on-the-fly made possible on abcl-0.24-dev][1] that we welcome feedback >> on esp. wrt. improving the ABCL system interfaces. > > It would surely be neat to have an example of cffi/jna. What kind of example? Once you get it running, it should work as every other CFFI platform and you can following the CFFI User Manual. Cheers, -- Luís Oliveira http://r42.eu/~luis

3 4

[armedbear-devel] [rfc] Preventing stack inconsistencies - structurally
by Erik Huelsmann 01 Jan '11

01 Jan '11

Every now and then (see ticket 117 for a current example), an issue pops up where we fail class file verification with a stack inconsistency error. The problem is that in some specific cases, it's impossible to accumulate function call argument values on the stack: the JVM clears out the stack in these cases. Next to storing values on the stack, the JVM offers local variables. These don't get cleared out. Historically, we have solved the problem by 'rewriting' the code being compiled in a way that made it store its values in local variables. This rewriting happens in pass1 of the compiler, based on the outcome of a the 'safety scanning function' UNSAFE-P. However, this function is overeager (will classify too many cases as unsafe) and it needs to be manually added to all cases which may end up being problematic in pass2. My proposal is now to add infrastructure to pass2 to handle the situation: Some blocks of code need to be marked as "collecting function call arguments". Then, upon the compilation of each argument, the new infrastructure would analyse the form being compiled. If that form will contain 'unsafe' bits, the compiler will automatically switch collection of function call arguments to local variables instead of on the stack. My idea would be to add a macro called WITH-STACK-PARAMETER-COLLECTION and an accompanying COMPILE-STACK-PARAMETER. The macro would set up some special variables for the COMPILE-STACK-PARAMETER to inspect and set. At the end of the macro, code will be emitted to make sure all the values are correctly loaded on the stack, just as if they had always been there. The pass1 form rewriting could be eliminated and our decision rules about what's 'unsafe' and what's not would be completely correct, instead of "overeager, but at least not missing any cases" [the latter it obviously does, since pass1 needs to estimate what pass2 will be compiling]. Any comments? Regards, Erik.

4 12

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

armedbear-devel January 2011