Hello Matthias,

Matthias Trute <mtr...@web.de> writes:
> I think that reparing marker this way is only half of the
> story. IMHO marker became unmaintainable (at least
> for me) so I changed it completely following the idea
> from Michael: keep the whole EEPROM instead of
> a structured dump of it. The eeprom content got slightly
> re-arranged to bundle the to-be-saved data at the 
> beginning and a value is used to determine the amount
> of this data: (marker)

I would like to note that Michael's approach of backing up "everything"
goes beyond the requirement of the current standard:

------------------------------------------------------------------------
6.2.1850 MARKER
Restore all dictionary allocation and search order pointers to the state
they had just prior to the definition of name. Remove the definition of
name and all subsequent definitions.  Restoration of any structures
still existing that could refer to deleted definitions or deal- located
data space is not necessarily provided.
------------------------------------------------------------------------

Thus, I am conflictied in accepting the new implementation. Need to give
it further thought.

>> See: http://pastebin.com/iWp7MRmv
>> 
>> Here's the new REVERSE word for those objecting to pastebins :-)
>
> You yourself fell into that trap as well, IIRC ;) Thanks for using email

Well, an important forum member expressed a strong dislike to using
"perishable" pastebins. I certainly wanted to please him ;-)

> for this definition. I do not yet understand it, but I'm sure it will work ;)

REVERSE ( X1 .. Xn n -- Xn .. X1 n ) is bound to see good use beyond
that original MARKER bug-fix. Collecting data into the stack inherently
reverses its order... hence, this new and efficient REVERSE
implementation can come handy.

Understanding REVERSE requires some kernel knowledge (specifically, how
the data stack is constructed). There's nothing wrong in that -- we do
here AmForth programming, not Forth stuff for the academia :-)

Regards, Enoch.


------------------------------------------------------------------------------
Learn Graph Databases - Download FREE O'Reilly Book
"Graph Databases" is the definitive new guide to graph databases and 
their applications. This 200-page book is written by three acclaimed 
leaders in the field. The early access version is available now. 
Download your free book today! http://p.sf.net/sfu/neotech_d2d_may
_______________________________________________
Amforth-devel mailing list for http://amforth.sf.net/
Amforth-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/amforth-devel

Reply via email to