rather often.
I am really looking for better and faster ways to find these, and a
way of working that make it less likely that they happen.
Best regards,
Leon
Quoting "Alexander J. Vondrak" :
> I'm not really sure if there was a question in there...
>
>> Loading
I'm not really sure if there was a question in there...
> Loading all the vocabularies, which all load many other vocabularies,
> is not easy to do.
If you're just sitting down at your editor, typing vocab names into the
`USING:` line, then yeah, it's going to be difficult to know exactly which
I've never used the ui vocabs, so grain of salt, but
1. If you have a particular width in mind,
IN: scratchpad USE: wrap.strings
IN: scratchpad "a long line" 5 wrap-string print
a
long
line
Thus, use `wrap-string`, and build a `` with the result. E.g.,
"a long line" 5 wrap-string
__
From: John Benediktsson [mrj...@gmail.com]
Sent: Sunday, September 09, 2012 6:58 PM
To: factor-talk@lists.sourceforge.net
Subject: Re: [Factor-talk] Out of memory error
I'd love to help you work on merging your GVN patches, where did we leave it?
Best,
John.
On Sat
Tangential thought, but I always loved that Factor's documentation is separate
from the actual source code (i.e., that foo.factor's docs live in
foo-docs.factor). In really any other language I can think of, you have to
clutter what might otherwise be easy-to-read code with gobs of explanations,
e
? It might save memory.
./factor -run=listener
load-all test-all
Doug
On Sat, Aug 25, 2012 at 1:36 PM, Alexander J. Vondrak
wrote:
> Just did a load-all test-all with 0.94, and that crashes, too. I know that
> I've run those tests before without running out of memory, so I suspect it
Just did a load-all test-all with 0.94, and that crashes, too. I know that
I've run those tests before without running out of memory, so I suspect it's
either an OS update issue (who knows?) or how my setup is interacting with my
new hardware (inherited some 64-bit hardware, still using my old 32-
factor-talk@lists.sourceforge.net
Cc: factor-talk@lists.sourceforge.net
Subject: Re: [Factor-talk] Out of memory error
It might be worth only loading and testing vocabularies in core and basis, to
see if GVN works?
On Aug 24, 2012, at 6:50 PM, "Alexander J. Vondrak"
wrote:
> It seems t
@lists.sourceforge.net
Subject: Re: [Factor-talk] Out of memory error
8gb outta be enough for anybody. But It's not, I guess. Try with more RAM or
patch the part that grows to only grow to as much as you have.
Maybe something is using way too much
On Aug 24, 2012 6:01 PM, "Alexander
8 GB.
From: Doug Coleman [doug.cole...@gmail.com]
Sent: Friday, August 24, 2012 6:06 PM
To: factor-talk@lists.sourceforge.net
Subject: Re: [Factor-talk] Out of memory error
How much ram?
On Aug 24, 2012 6:01 PM, "Alexander J. Vondrak"
mai
Hey all,
Mini-update: got the unit tests for the global value numbering pass more
up-to-snuff awhile ago (it's like test-driven development in reverse!). Still
seems like I should be doing more to test the new capabilities, but I'm not
sure if I could do much more than what's there.
My efforts a
In case it helps, I'll also add that chapter 2 of my thesis is an overview of
Factor as a language:
https://github.com/ajvondrak/thesis/blob/master/thesis.pdf?raw=true
> In any case, I would recommend picking a project that you are familiar with
> or interested in and trying to implement it in Fac
pic-tail-reg = polymorphic inline cache tail call register
ds-reg = data stack register
rs-reg = retain stack register
nv-reg: might help to see
https://github.com/slavapestov/factor/blob/master/basis/cpu/x86/bootstrap.factor#L14
link-reg: only place it seems to be used is
https://github.com/
Those look like VM constants. A quick grep yields where an enum is defined in
a header file that has comments about their purposes:
$ find -name \*.hpp | xargs grep -l "RT_DLSYM"
./vm/instruction_operands.hpp
Regards,
--Alex Vondrak
From: Michael Clagett
y
implementations in LLVM and LuaJIT.
Doug and John are the current maintainers, I think they should probably merge
this in after the release they're planning. Or was that supposed to be a secret
:-)
On Fri, Aug 3, 2012 at 6:52 PM, Alexander J. Vondrak
mailto:ajvond...@csupomona.edu>
Thank you very much!
As a minor update: I ported the old units tests to work with the new gvn code.
There are a few possible regressions concerning SIMD instructions, which I hope
will explain the failing math.vectors.simd tests. My next move is to fix those
regressions (or decide if they unit te
http://weknowmemes.com/wp-content/uploads/2012/01/op-will-surely-deliver-lets-just-wait.jpg
Yes, I did actually work on the GVN pass---even got my master's degree. After
finally defending my thesis (available at https://github.com/ajvondrak/thesis),
I started a teaching job at my university, whic
first2: http://docs.factorcode.org/content/word-first2,sequences.html
In general, firstn:
http://docs.factorcode.org/content/word-firstn,sequences.generalizations.html
Regards,
--Alex Vondrak
From: Andrew Pennebaker [andrew.penneba...@gmail.com]
Sent: Sun
Ping,
I haven't checked in for a long time, but I've still been working on
globalizing compiler.cfg.value-numbering (when I get spare time in between
classes). Kind of got side-tracked because I was finding CFGs difficult to
debug. I didn't really like the flat text compiler.cfg.debugger prints,
Hey,
I just pushed a graphviz vocab to https://github.com/ajvondrak/factor (the
'graphviz' branch). If it looks like a good addition, any code review /
testing / proofreading the docs would be welcome.
Regards,
--Alex Vondrak
Okay, I've looked into the things discussed in the IRC session.
First off, my initial idea is ill-defined, not really useful, and Factor's
current DFAs are okay, or at least as efficient as they'd be in the
Lerner/Grove/Chambers framework. Even though it's a little crufty,
compiler.tree should
Hey,
I'm a CS Master's student at Cal Poly Pomona focusing on programming language
theory & implementation -- particularly optimizations. Particularly
optimization "frameworks": ways of simplifying compilers' often repetitive,
ad-hoc code into a single conceptual model.
This summer, I've been
22 matches
Mail list logo
