Home My Page Projects Code Snippets Project Openings SML/NJ
Summary Activity Forums Tracker Lists Tasks Docs Surveys News SCM Files

SCM Repository

[smlnj] Diff of /sml/trunk/HISTORY
ViewVC logotype

Diff of /sml/trunk/HISTORY

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1044, Mon Jan 28 21:36:08 2002 UTC revision 1183, Fri Mar 29 19:09:48 2002 UTC
# Line 14  Line 14 
14    
15  ----------------------------------------------------------------------  ----------------------------------------------------------------------
16  Name: Matthias Blume  Name: Matthias Blume
17    Date: 2002/03/29 14:10:00 EST
18    Tag: blume-20020329-inlprims
19    Description:
20    
21    NEW BOOTFILES!!!    Version number bumped to 110.39.3.
22    
23    Primops have changed. This means that the bin/boot-file formats have
24    changed as well.
25    
26    To make sure that there is no confusion, I made a new version.
27    
28    
29    CHANGES:
30    
31    * removed REMT from mltree (remainder should never overflow).
32    
33    * added primops to deal with divisions of all flavors to the frontend
34    
35    * handled these primops all the way through so they map to their respective
36      MLRISC support
37    
38    * used these primops in the implementation of Int, Int32, Word, Word32
39    
40    * removed INLDIV, INLMOD, and INLREM as they are no longer necessary
41    
42    * parameterized INLMIN, INLMAX, and INLABS by a numkind
43    
44    * translate.sml now deals with all flavors of INL{MIN,MAX,ABS}, including
45      floating point
46    
47    * used INL{MIN,MAX,ABS} in the implementation of Int, Int32, Word, Word32,
48      and Real (but Real.abs maps to a separate floating-point-only primop)
49    
50    
51    TODO items:
52    
53    * Hacked Alpha32 instruction selection, disabling the selection of REMx
54      instructions because the machine instruction encoder cannot handle
55      them.  (Hppa, PPC, and Sparc instruction selection did not handle
56      REM in the first place, and REM is supported by the x86 machine coder.)
57    
58    * Handle DIV and MOD with DIV_TO_NEGINF directly in the x86 instruction
59      selection phase.  (The two can be streamlined because the hardware
60      delivers both quotient and remainder at the same time anyway.)
61    
62    * Think about what to do with "valOf(Int32.minInt) div ~1" and friends.
63      (Currently the behavior is inconsistent both across architectures and
64      wrt. the draft Basis spec.)
65    
66    * Word8 should eventually be handled natively, too.
67    
68    * There seems to be one serious bug in mltree-gen.sml.  It appears, though,
69      as if there currently is no execution path that could trigger it in
70      SML/NJ.  (The assumptions underlying functions arith and promotable do not
71      hold for things like multiplication and division.)
72    
73    ----------------------------------------------------------------------
74    Name: Matthias Blume
75    Date: 2002/03/27 16:27:00 EST
76    Tag: blume-20020327-mlrisc-divisions
77    Description:
78    
79    Added support for all four division operations (ML's div, mod, quot,
80    and rem) to MLRISC.  In the course of doing so, I also rationalized
81    the naming (no more annoying switch-around of DIV and QUOT), by
82    parameterizing the operation by div_rounding_mode (which can be either
83    DIV_TO_ZERO or DIV_TO_NEGINF).
84    
85    The generic MLTreeGen functor takes care of compiling all four
86    operations down to only round-to-zero div.
87    
88    Missing pieces:
89    
90      * Doing something smarter than relying on MLTreeGen on architectures
91        like, e.g., the x86 where hardware division delivers both quotient and
92        remainder at the same time.  With this, the implementation of the
93        round-to-neginf operations could be further streamlined.
94    
95      * Remove inlining support for div/mod/rem from the frontend and replace it
96        with primops that get carried through to the backend.  Do this for all
97        int and word types.
98    
99    ----------------------------------------------------------------------
100    Name: Matthias Blume
101    Date: 2002/03/25 17:25:00 EST
102    Tag: blume-20020325-divmod
103    Description:
104    
105    I improved (hopefully without breaking them) the implementation of Int.div,
106    Int.mod, and Int.rem.   For this, the code in translate.sml now takes
107    advantage of the following observations:
108    
109      Let  q = x quot y      r = x rem y
110           d = x div  y      m = x mod y
111    
112    where "quot" is the round-to-zero version of integer division that
113    hardware usually provides.  Then we have:
114    
115         r = x - q * y        where neither the * nor the - will overflow
116         d = if q >= 0 orelse x = q * y then q else q - 1
117                              where neither the * nor the - will overflow
118         m = if q >= 0 orelse r = 0 then r else r + y
119                              where the + will not overflow
120    
121    This results in substantial simplification of the generated code.
122    The following table shows the number of CFG nodes and edges generated
123    for
124            fun f (x, y) = x OPER y
125            (* with OPER \in div, mod, quot, rem *)
126    
127    
128        OPER | nodes(old) | edges(old) | nodes(new) | edges(new)
129        --------------------------------------------------------
130         div |         24 |         39 |         12 |         16
131         mod |         41 |         71 |         12 |         16
132        quot |          8 |         10 |          8 |         10
133         rem |         10 |         14 |          8 |         10
134    
135    
136    ----------------------------------------------------------------------
137    Name: Matthias Blume
138    Date: 2002/03/25 22:06:00 EST
139    Tag: blume-20020325-cprotobug
140    Description:
141    
142    Fixed a bug in cproto (c prototype decoder).
143    
144    ----------------------------------------------------------------------
145    Name: Matthias Blume
146    Date: 2002/03/25 16:00:00 EST
147    Tag: blume-20020325-raw-primops
148    Description:
149    
150    I did some cleanup to Allen's new primop code and
151    replaced yesterday's bootfiles with new ones.
152    (But they are stored in the same place.)
153    
154    ----------------------------------------------------------------------
155    Name: Matthias Blume
156    Date: 2002/03/24 22:40:00 EST
157    Tag: blume-20020324-bootfiles
158    Description:
159    
160    Made the bootfiles that Allen asked for.
161    
162    ----------------------------------------------------------------------
163    Name: Allen Leung
164    Date: 2002/03/23 15:50:00 EST
165    Tag: leunga-20020323-flint-cps-rcc-primops
166    Description:
167    
168      1. Changes to FLINT primops:
169    
170        (* make a call to a C-function;
171         * The primop carries C function prototype information and specifies
172         * which of its (ML-) arguments are floating point. C prototype
173         * information is for use by the backend, ML information is for
174         * use by the CPS converter. *)
175      | RAW_CCALL of { c_proto: CTypes.c_proto,
176                       ml_args: ccall_type list,
177                       ml_res_opt: ccall_type option,
178                       reentrant : bool
179                     } option
180       (* Allocate uninitialized storage on the heap.
181        * The record is meant to hold short-lived C objects, i.e., they
182        * are not ML pointers.  With the tag, the representation is
183        * the same as RECORD with tag tag_raw32 (sz=4), or tag_fblock (sz=8)
184        *)
185      | RAW_RECORD of {tag:bool,sz:int}
186      and ccall_type = CCALL_INT32 | CCALL_REAL64 | CCALL_ML_PTR
187    
188      2.  These CPS primops are now overloaded:
189    
190           rawload of {kind:numkind}
191           rawstore of {kind:numkind}
192    
193          The one argument form is:
194    
195             rawload {kind} address
196    
197          The two argument form is:
198    
199             rawload {kind} [ml object, byte-offset]
200    
201      3. RAW_CCALL/RCC now takes two extra arguments:
202    
203         a. The first is whether the C call is reentrant, i.e., whether
204            ML state should be saved and restored.
205         b. The second argument is a string argument specifying the name of
206            library and the C function.
207    
208         These things are currently not handled in the code generator, yet.
209    
210      4. In CProto,
211    
212         An encoding type of "bool" means "ml object" and is mapped into
213         C prototype of PTR.  Note that "bool" is different than "string",
214         even though "string" is also mapped into PTR, because "bool"
215         is assigned an CPS type of BOGt, while "string" is assigned INT32t.
216    
217      5. Pickler/unpicker
218    
219         Changed to handle RAW_RECORD and newest RAW_CCALL
220    
221      6. MLRiscGen,
222    
223         1. Changed to handle the new rawload/rawstore/rawrecord operators.
224         2. Code for handling C Calls has been moved to a new module CPSCCalls,
225            in the file CodeGen/cpscompile/cps-c-calls.sml
226    
227      7. Added the conditional move operator
228    
229             condmove of branch
230    
231         to cps.  Generation of this is still buggy so it is currently
232         disabled.
233    
234    ----------------------------------------------------------------------
235    Name: Lal George
236    Date: 2002/03/22 14:18:25 EST
237    Tag: george-20020322-cps-branch-prob
238    Description:
239    
240    Implemented the Ball-Larus branch prediction-heuristics, and
241    incorporated graphical viewers for control flow graphs.
242    
243    Ball-Larus Heuristics:
244    ---------------------
245    See the file compiler/CodeGen/cpscompile/cpsBranchProb.sml.
246    
247    By design it uses the Dempster-Shafer theory for combining
248    probabilities.  For example, in the function:
249    
250        fun f(n,acc) = if n = 0 then acc else f(n-1, n*acc)
251    
252    the ball-larus heuristics predicts that the n=0 is unlikely
253    (OH-heuristic), and the 'then' branch is unlikely because of the
254    RH-heuristic -- giving the 'then' branch an even lower combined
255    probability using the Dempster-Shafer theory.
256    
257    Finally, John Reppy's loop analysis in MLRISC, further lowers the
258    probability of the 'then' branch because of the loop in the else
259    branch.
260    
261    
262    Graphical Viewing:
263    ------------------
264    I merely plugged in Allen's graphical viewers into the compiler. The
265    additional code is not much. At the top level, saying:
266    
267            Control.MLRISC.getFlag "cfg-graphical-view" := true;
268    
269    will display the graphical view of the control flow graph just before
270    back-patching.  daVinci must be in your path for this to work. If
271    daVinci is not available, then the default viewer can be changed
272    using:
273    
274            Control.MLRISC.getString "viewer"
275    
276    which can be set to "dot" or "vcg" for the corresponding viewers. Of
277    course, these viewers must be in your path.
278    
279    The above will display the compilation unit at the level of clusters,
280    many of which are small, boring, and un-interesting. Also setting:
281    
282            Control.MLRISC.getInt "cfg-graphical-view_size"
283    
284    will display clusters that are larger than the value set by the above.
285    
286    
287    ----------------------------------------------------------------------
288    Name: Matthias Blume
289    Date: 2002/03/21 22:20:00 EST
290    Tag: blume-20020321-kmp-bugfix
291    Description:
292    
293    Changed the interface to the KMP routine in PreString and fixed
294    a minor bug in one place where it was used.
295    
296    ----------------------------------------------------------------------
297    Name: Allen Leung
298    Date: 2002/03/21 20:30:00 EST
299    Tag: leunga-20020321-cfg
300    Description:
301    
302      Fixed a potential problem in cfg edge splitting.
303    
304    ----------------------------------------------------------------------
305    Name: Allen Leung
306    Date: 2002/03/21 17:15:00 EST
307    Tag: leunga-20020321-x86-fp-cfg
308    Description:
309    
310      1. Recoded the buggy parts of x86-fp.
311    
312         a. All the block reordering code has been removed.
313            We now depend on the block placement phases to do this work.
314    
315         b. Critical edge splitting code has been simplified and moved into the
316            CFG modules, as where they belong.
317    
318         Both of these were quite buggy and complex.  The code is now much, much
319         simpler.
320    
321      2. X86 backend.
322    
323         a. Added instructions for 64-bit support.  Instruction selection for
324            64-bit has not been committed, however, since that
325            requires changes to MLTREE which haven't been approved by
326            Lal and John.
327    
328         b. Added support for FUCOMI and FUCOMIP when generating code for
329            PentiumPro and above.  We only generate these instructions in
330            the fast-fp mode.
331    
332         c. Added cases for JP and JNP in X86FreqProps.
333    
334      3. CFG
335    
336         CFG now has a bunch of methods for edge splitting and merging.
337    
338      4. Machine description.
339    
340         John's simplification of MLTREE_BASIS.fcond broke a few machine
341         description things:
342    
343         rtl-build.{sig,sml} and hppa.mdl fixed.
344    
345         NOTE: the machine description stuff in the repository is still broken.
346               Again, I can't put my fixes in because that involves
347               changes to MLTREE.
348    
349    ----------------------------------------------------------------------
350    Name: Matthias Blume
351    Date: 2002/03/20 15:55:00 EST
352    Tag: blume-20020320-kmp
353    Description:
354    
355    Implemented Knuth-Morris-Pratt string matching in PreString and used
356    it for String.isSubstring, Substring.isSubstring, and
357    Substring.position.
358    
359    (Might need some stress-testing.  Simple examples worked fine.)
360    
361    ----------------------------------------------------------------------
362    Name: Matthias Blume
363    Date: 2002/03/19 16:37:00 EST
364    Tag: blume-20020319-witnesses
365    Description:
366    
367    Added a structure C.W and functions convert/Ptr.convert to ml-nlffi-lib.
368    
369    This implements a generic mechanism for changing constness qualifiers
370    anywhere within big C types without resorting to outright "casts".
371    (So far, functions such as C.rw/C.ro or C.Ptr.rw/C.Ptr.ro only let you
372    modify the constness at the outermost level.)
373    The implementation of "convert" is based on the idea of "witness"
374    values -- values that are not used by the operation but whose types
375    "testify" to their applicability.  On the implementation side, "convert"
376    is simply a projection (returning its second curried argument).  With
377    cross-module inlining, it should not result in any machine code being
378    generated.
379    
380    ----------------------------------------------------------------------
381    Name: Matthias Blume
382    Date: 2002/03/15 16:40:00 EST
383    Tag: blume-20020315-basis
384    Description:
385    
386    Provided (preliminary?) implementations for
387    
388      {String,Substring}.{concatWith,isSuffix,isSubstring}
389    
390    and
391    
392      Substring.full
393    
394    Those are in the Basis spec but they were missing in SML/NJ.
395    
396    ----------------------------------------------------------------------
397    Name: Matthias Blume
398    Date: 2002/03/14 21:30:00 EST
399    Tag: blume-20020314-controls
400    Description:
401    
402    Controls:
403    ---------
404    
405    1. Factored out the recently-added Controls : CONTROLS stuff and put
406       it into its own library $/controls-lib.cm.  The source tree for
407       this is under src/smlnj-lib/Controls.
408    
409    2. Changed the names of types and functions in this interface, so they
410       make a bit more "sense":
411    
412          module -> registry
413          'a registry -> 'a group
414    
415    3. The interface now deals in ref cells only.  The getter/setter interface
416       is (mostly) gone.
417    
418    4. Added a function that lets one register an already-existing ref cell.
419    
420    5. Made the corresponding modifications to the rest of the code so that
421       everything compiles again.
422    
423    6. Changed the implementation of Controls.MLRISC back to something closer
424       to the original.  In particular, this module (and therefore MLRISC)
425       does not depend on Controls.  There now is some link-time code in
426       int-sys.sml that registers the MLRISC controls with the Controls
427       module.
428    
429    CM:
430    ---
431    
432      * One can now specify the lambda-split aggressiveness in init.cmi.
433    
434    ----------------------------------------------------------------------
435    Name: Allen Leung
436    Date: 2002/03/13 17:30:00 EST
437    Tag: leunga-20020313-x86-fp-unary
438    Description:
439    
440    Bug fix for:
441    
442    > leunga@weaselbane:~/Yale/tmp/sml-dist{21} bin/sml
443    > Standard ML of New Jersey v110.39.1 [FLINT v1.5], March 08, 2002
444    > - fun f(x,(y,z)) = Real.~ y;
445    > [autoloading]
446    > [autoloading done]
447    >       fchsl   (%eax), 184(%esp)
448    > Error: MLRisc bug: X86MCEmitter.emitInstr
449    >
450    > uncaught exception Error
451    >   raised at: ../MLRISC/control/mlriscErrormsg.sml:16.14-16.19
452    
453    The problem was that the code generator did not generate any fp registers
454    in this case, and the ra didn't know that it needed to run the X86FP phase to
455    translate the pseudo fp instruction.   This only happened with unary fp
456    operators in certain situations.
457    
458    ----------------------------------------------------------------------
459    Name: Matthias Blume
460    Date: 2002/03/13 14:00:00 EST
461    Tag: blume-20020313-overload-etc
462    Description:
463    
464    1. Added _overload as a synonym for overload for backward compatibility.
465       (Control.overloadKW must be true for either version to be accepted.)
466    
467    2. Fixed bug in install script that caused more things to be installed
468       than what was requested in config/targets.
469    
470    3. Made CM aware of the (_)overload construct so that autoloading
471       works.
472    
473    ----------------------------------------------------------------------
474    Name: Matthias Blume
475    Date: 2002/03/12 22:03:00 EST
476    Tag: blume-20020312-url
477    Description:
478    
479    Forgot to update BOOT and srcarchiveurl.
480    
481    ----------------------------------------------------------------------
482    Name: Matthias Blume
483    Date: 2002/03/12 17:30:00 EST
484    Tag: blume-20020312-version110392
485    Description:
486    
487    Yet another version number bump (because of small changes to the
488    binfile format).  Version number is now 110.39.2.  NEW BOOTFILES!
489    
490    Changes:
491    
492      The new pid generation scheme described a few weeks ago was overly
493      complicated.  I implemented a new mechanism that is simpler and
494      provides a bit more "stability":  Once CM has seen a compilation
495      unit, it keeps its identity constant (as long as you do not delete
496      those crucial CM/GUID/* files).  This means that when you change
497      an interface, compile, then go back to the old interface, and
498      compile again, you arrive at the original pid.
499    
500      There now also is a mechanism that instructs CM to use the plain
501      environment hash as a module's pid (effectively making its GUID
502      the empty string).  For this, "noguid" must be specified as an
503      option to the .sml file in question within its .cm file.
504      This is most useful for code that is being generated by tools such
505      as ml-nlffigen (because during development programmers tend to
506      erase the tool's entire output directory tree including CM's cached
507      GUIDs).  "noguid" is somewhat dangerous (since it can be used to locally
508      revert to the old, broken behavior of SML/NJ, but in specific cases
509      where there is no danger of interface confusion, its use is ok
510      (I think).
511    
512      ml-nlffigen by default generates "noguid" annotations.  They can be
513      turned off by specifying -guid in its command line.
514    
515    ----------------------------------------------------------------------
516    Name: Lal George
517    Date: 2002/03/12 12 14:42:36 EST
518    Tag: george-20020312-frequency-computation
519    Description:
520    
521    Integrated jump chaining and static block frequency into the
522    compiler. More details and numbers later.
523    
524    ----------------------------------------------------------------------
525    Name: Lal George
526    Date: 2002/03/11 11 22:38:53 EST
527    Tag: george-20020311-jump-chain-elim
528    Description:
529    
530    Tested the jump chain elimination on all architectures (except the
531    hppa).  This is on by default right now and is profitable for the
532    alpha and x86, however, it may not be profitable for the sparc and ppc
533    when compiling the compiler.
534    
535    The gc test will typically jump to a label at the end of the cluster,
536    where there is another jump to an external cluster containing the actual
537    code to invoke gc. This is to allow factoring of common gc invocation
538    sequences. That is to say, we generate:
539    
540            f:
541               testgc
542               ja   L1      % jump if above to L1
543    
544            L1:
545               jmp L2
546    
547    
548    After jump chain elimination the 'ja L1' instructions is converted to
549    'ja L2'. On the sparc and ppc, many of the 'ja L2' instructions may end
550    up being implemented in their long form (if L2 is far away) using:
551    
552            jbe     L3      % jump if below or equal to L3
553            jmp     L2
554         L3:
555            ...
556    
557    
558    For large compilation units L2  may be far away.
559    
560    
561    ----------------------------------------------------------------------
562    Name: Matthias Blume
563    Date: 2002/03/11 13:30:00 EST
564    Tag: blume-20020311-mltreeeval
565    Description:
566    
567    A functor parameter was missing.
568    
569    ----------------------------------------------------------------------
570    Name: Allen Leung
571    Date: 2002/03/11 10:30:00 EST
572    Tag: leunga-20020311-runtime-string0
573    Description:
574    
575       The representation of the empty string now points to a
576    legal null terminated C string instead of unit.  It is now possible
577    to convert an ML string into C string with InlineT.CharVector.getData.
578    This compiles into one single machine instruction.
579    
580    ----------------------------------------------------------------------
581    Name: Allen Leung
582    Date: 2002/03/10 23:55:00 EST
583    Tag: leunga-20020310-x86-call
584    Description:
585    
586       Added machine generation for CALL instruction (relative displacement mode)
587    
588    ----------------------------------------------------------------------
589    Name: Matthias Blume
590    Date: 2002/03/08 16:05:00
591    Tag: blume-20020308-entrypoints
592    Description:
593    
594    Version number bumped to 110.39.1.  NEW BOOTFILES!
595    
596    Entrypoints: non-zero offset into a code object where execution should begin.
597    
598    - Added the notion of an entrypoint to CodeObj.
599    - Added reading/writing of entrypoint info to Binfile.
600    - Made runtime system bootloader aware of entrypoints.
601    - Use the address of the label of the first function given to mlriscGen
602      as the entrypoint.  This address is currently always 0, but it will
603      not be 0 once we turn on block placement.
604    - Removed the linkage cluster code (which was The Other Way(tm) of dealing
605      with entry points) from mlriscGen.
606    
607    ----------------------------------------------------------------------
608    Name: Allen Leung
609    Date: 2002/03/07 20:45:00 EST
610    Tag: leunga-20020307-x86-cmov
611    Description:
612    
613       Bug fixes for CMOVcc on x86.
614    
615       1. Added machine code generation for CMOVcc
616       2. CMOVcc is now generated in preference over SETcc on PentiumPro or above.
617       3. CMOVcc cannot have an immediate operand as argument.
618    
619    ----------------------------------------------------------------------
620    Name: Matthias Blume
621    Date: 2002/03/07 16:15:00 EST
622    Tag: blume-20020307-controls
623    Description:
624    
625    This is a very large but mostly boring patch which makes (almost)
626    every tuneable compiler knob (i.e., pretty much everything under
627    Control.* plus a few other things) configurable via both the command
628    line and environment variables in the style CM did its configuration
629    until now.
630    
631    Try starting sml with '-h' (or, if you are brave, '-H')
632    
633    To this end, I added a structure Controls : CONTROLS to smlnj-lib.cm which
634    implements the underlying generic mechanism.
635    
636    The interface to some of the existing such facilities has changed somewhat.
637    For example, the MLRiscControl module now provides mkFoo instead of getFoo.
638    (The getFoo interface is still there for backward-compatibility, but its
639    use is deprecated.)
640    
641    The ml-build script passes -Cxxx=yyy command-line arguments through so
642    that one can now twiddle the compiler settings when using this "batch"
643    compiler.
644    
645    TODO items:
646    
647    We should go through and throw out all controls that are no longer
648    connected to anything.  Moreover, we should go through and provide
649    meaningful (and correct!) documentation strings for those controls
650    that still are connected.
651    
652    Currently, multiple calls to Controls.new are accepted (only the first
653    has any effect).  Eventually we should make sure that every control
654    is being made (via Controls.new) exactly once.  Future access can then
655    be done using Controls.acc.
656    
657    Finally, it would probably be a good idea to use the getter-setter
658    interface to controls rather than ref cells.  For the time being, both
659    styles are provided by the Controls module, but getter-setter pairs are
660    better if thread-safety is of any concern because they can be wrapped.
661    
662    *****************************************
663    
664    One bug fix: The function blockPlacement in three of the MLRISC
665    backpatch files used to be hard-wired to one of two possibilities at
666    link time (according to the value of the placementFlag).  But (I
667    think) it should rather sense the flag every time.
668    
669    *****************************************
670    
671    Other assorted changes (by other people who did not supply a HISTORY entry):
672    
673    1. the cross-module inliner now works much better (Monnier)
674    2. representation of weights, frequencies, and probabilities in MLRISC
675       changed in preparation of using those for weighted block placement
676       (Reppy, George)
677    
678    ----------------------------------------------------------------------
679    Name: Lal George
680    Date: 2002/03/07 14:44:24 EST 2002
681    Tag: george-20020307-weighted-block-placement
682    
683    Tested the weighted block placement optimization on all architectures
684    (except the hppa) using AMPL to generate the block and edge frequencies.
685    Changes were required in the machine properties to correctly
686    categorize trap instructions. There is an MLRISC flag
687    "weighted-block-placement" that can be used to enable weighted block
688    placement, but this will be ineffective without block/edge
689    frequencies (coming soon).
690    
691    
692    ----------------------------------------------------------------------
693    Name: Lal George
694    Date: 2002/03/05 17:24:48 EST
695    Tag: george-20020305-linkage-cluster
696    
697    In order to support the block placement optimization, a new cluster
698    is generated as the very first cluster (called the linkage cluster).
699    It contains a single jump to the 'real' entry point for the compilation
700    unit. Block placement has no effect on the linkage cluster itself, but
701    all the other clusters  have full freedom in the manner in which they
702    reorder blocks or functions.
703    
704    On the x86 the typical linkage code that is generated is:
705       ----------------------
706            .align 2
707       L0:
708            addl    $L1-L0, 72(%esp)
709            jmp     L1
710    
711    
712            .align  2
713       L1:
714       ----------------------
715    
716    72(%esp) is the memory location for the stdlink register. This
717    must contain the address of the CPS function being called. In the
718    above example, it contains the address of  L0; before
719    calling L1 (the real entry point for the compilation unit), it
720    must contain the address for L1, and hence
721    
722            addl $L1-L0, 72(%esp)
723    
724    I have tested this on all architectures except the hppa.The increase
725    in code size is of course negligible
726    
727    ----------------------------------------------------------------------
728    Name: Allen Leung
729    Date: 2002/03/03 13:20:00 EST
730    Tag: leunga-20020303-mlrisc-tools
731    
732      Added #[ ... ] expressions to mlrisc tools
733    
734    ----------------------------------------------------------------------
735    Name: Matthias Blume
736    Date: 2002/02/27 12:29:00 EST
737    Tag: blume-20020227-cdebug
738    Description:
739    
740    - made types in structure C and C_Debug to be equal
741    - got rid of code duplication (c-int.sml vs. c-int-debug.sml)
742    - there no longer is a C_Int_Debug (C_Debug is directly derived from C)
743    
744    ----------------------------------------------------------------------
745    Name: Matthias Blume
746    Date: 2002/02/26 12:00:00 EST
747    Tag: blume-20020226-ffi
748    Description:
749    
750    1. Fixed a minor bug in CM's "noweb" tool:
751       If numbering is turned off, then truly don't number (i.e., do not
752       supply the -L option to noweb).  The previous behavior was to supply
753       -L'' -- which caused noweb to use the "default" line numbering scheme.
754       Thanks to Chris Richards for pointing this out (and supplying the fix).
755    
756    2. Once again, I reworked some aspects of the FFI:
757    
758       A. The incomplete/complete type business:
759    
760       - Signatures POINTER_TO_INCOMPLETE_TYPE and accompanying functors are
761         gone!
762       - ML types representing an incomplete type are now *equal* to
763         ML types representing their corresponding complete types (just like
764         in C).  This is still safe because ml-nlffigen will not generate
765         RTTI for incomplete types, nor will it generate functions that
766         require access to such RTTI.   But when ML code generated from both
767         incomplete and complete versions of the C type meet, the ML types
768         are trivially interoperable.
769    
770         NOTE:  These changes restore the full generality of the translation
771         (which was previously lost when I eliminated functorization)!
772    
773       B. Enum types:
774    
775       - Structure C now has a type constructor "enum" that is similar to
776         how the "su" constructor works.  However, "enum" is not a phantom
777         type because each "T enum" has values (and is isomorphic to
778         MLRep.Signed.int).
779       - There are generic access operations for enum objects (using
780         MLRep.Signed.int).
781       - ml-nlffigen will generate a structure E_foo for each "enum foo".
782         * The structure contains the definition of type "mlrep" (the ML-side
783         representation type of the enum).  Normally, mlrep is the same
784         as "MLRep.Signed.int", but if ml-nlffigen was invoked with "-ec",
785         then mlrep will be defined as a datatype -- thus facilitating
786         pattern matching on mlrep values.
787         ("-ec" will be suppressed if there are duplicate values in an
788          enumeration.)
789         * Constructors ("-ec") or values (no "-ec") e_xxx of type mlrep
790         will be generated for each C enum constant xxx.
791         * Conversion functions m2i and i2m convert between mlrep and
792         MLRep.Signed.int.  (Without "-ec", these functions are identities.)
793         * Coversion functions c and ml convert between mlrep and "tag enum".
794         * Access functions (get/set) fetch and store mlrep values.
795       - By default (unless ml-nlffigen was invoked with "-nocollect"), unnamed
796         enumerations are merged into one single enumeration represented by
797         structure E_'.
798    
799    ----------------------------------------------------------------------
800    Name: Allen Leung
801    Date: 2002/02/25 04:45:00 EST
802    Tag: leunga-20020225-cps-spill
803    
804    This is a new implementation of the CPS spill phase.
805    The new phase is in the new file compiler/CodeGen/cpscompile/spill-new.sml
806    In case of problems, replace it with the old file spill.sml
807    
808    The current compiler runs into some serious performance problems when
809    constructing a large record.  This can happen when we try to compile a
810    structure with many items.  Even a very simple structure like the following
811    makes the compiler slow down.
812    
813        structure Foo = struct
814           val x_1 = 0w1 : Word32.int
815           val x_2 = 0w2 : Word32.int
816           val x_3 = 0w3 : Word32.int
817           ...
818           val x_N = 0wN : Word32.int
819        end
820    
821    The following table shows the compile time, from N=1000 to N=4000,
822    with the old compiler:
823    
824    N
825    1000   CPS 100 spill                           0.04u  0.00s  0.00g
826           MLRISC ra                               0.06u  0.00s  0.05g
827              (spills = 0 reloads = 0)
828           TOTAL                                   0.63u  0.07s  0.21g
829    
830    1100   CPS 100 spill                           8.25u  0.32s  0.64g
831           MLRISC ra                               5.68u  0.59s  3.93g
832              (spills = 0 reloads = 0)
833           TOTAL                                   14.71u  0.99s  4.81g
834    
835    1500   CPS 100 spill                           58.55u  2.34s  1.74g
836           MLRISC ra                               5.54u  0.65s  3.91g
837              (spills = 543 reloads = 1082)
838           TOTAL                                   65.40u  3.13s  6.00g
839    
840    2000   CPS 100 spill                           126.69u  4.84s  3.08g
841           MLRISC ra                               0.80u  0.10s  0.55g
842              (spills = 42 reloads = 84)
843           TOTAL                                   129.42u  5.10s  4.13g
844    
845    3000   CPS 100 spill                           675.59u  19.03s  11.64g
846           MLRISC ra                               2.69u  0.27s  1.38g
847              (spills = 62 reloads = 124)
848           TOTAL                                   682.48u  19.61s  13.99g
849    
850    4000   CPS 100 spill                           2362.82u  56.28s  43.60g
851           MLRISC ra                               4.96u  0.27s  2.72g
852              (spills = 85 reloads = 170)
853           TOTAL                                   2375.26u  57.21s  48.00g
854    
855    As you can see the old cps spill module suffers from some serious
856    performance problem.  But since I cannot decipher the old code fully,
857    instead of patching the problems up, I'm reimplementing it
858    with a different algorithm.  The new code is more modular,
859    smaller when compiled, and substantially faster
860    (O(n log n) time and O(n) space).  Timing of the new spill module:
861    
862    4000  CPS 100 spill                           0.02u  0.00s  0.00g
863          MLRISC ra                               0.25u  0.02s  0.15g
864             (spills=1 reloads=3)
865          TOTAL                                   7.74u  0.34s  1.62g
866    
867    Implementation details:
868    
869    As far as I can tell, the purpose of the CPS spill module is to make sure the
870    number of live variables at any program point (the bandwidth)
871    does not exceed a certain limit, which is determined by the
872    size of the spill area.
873    
874    When the bandwidth is too large, we decrease the register pressure by
875    packing live variables into spill records.  How we achieve this is
876    completely different than what we did in the old code.
877    
878    First, there is something about the MLRiscGen code generator
879    that we should be aware of:
880    
881    o MLRiscGen performs code motion!
882    
883       In particular, it will move floating point computations and
884       address computations involving only the heap pointer to
885       their use sites (if there is only a single use).
886       What this means is that if we have a CPS record construction
887       statement
888    
889           RECORD(k,vl,w,e)
890    
891       we should never count the new record address w as live if w
892       has only one use (which is often the case).
893    
894       We should do something similar to floating point, but the transformation
895       there is much more complex, so I won't deal with that.
896    
897    Secondly, there are now two new cps primops at our disposal:
898    
899     1. rawrecord of record_kind option
900        This pure operator allocates some uninitialized storage from the heap.
901        There are two forms:
902    
903         rawrecord NONE [INT n]  allocates a tagless record of length n
904         rawrecord (SOME rk) [INT n] allocates a tagged record of length n
905                                     and initializes the tag.
906    
907     2. rawupdate of cty
908          rawupdate cty (v,i,x)
909          Assigns to x to the ith component of record v.
910          The storelist is not updated.
911    
912    We use these new primops for both spilling and increment record construction.
913    
914     1. Spilling.
915    
916        This is implemented with a linear scan algorithm (but generalized
917        to trees).  The algorithm will create a single spill record at the
918        beginning of the cps function and use rawupdate to spill to it,
919        and SELECT or SELp to reload from it.  So both spills and reloads
920        are fine-grain operations.  In contrast, in the old algorithm
921        "spills" have to be bundled together in records.
922    
923        Ideally, we should sink the spill record construction to where
924        it is needed.  We can even split the spill record into multiple ones
925        at the places where they are needed.  But CPS is not a good
926        representation for global code motion, so I'll keep it simple and
927        am not attempting this.
928    
929     2. Incremental record construction (aka record splitting).
930    
931        Long records with many component values which are simulatenously live
932        (recall that single use record addresses are not considered to
933         be live) are constructed with rawrecord and rawupdate.
934        We allocate space on the heap with rawrecord first, then gradually
935        fill it in with rawupdate.  This is the technique suggested to me
936        by Matthias.
937    
938        Some restrictions on when this is applicable:
939        1. It is not a VECTOR record.  The code generator currently does not handle
940           this case. VECTOR record uses double indirection like arrays.
941        2. All the record component values are defined in the same "basic block"
942           as the record constructor.  This is to prevent speculative
943           record construction.
944    
945    ----------------------------------------------------------------------
946    Name: Allen Leung
947    Date: 2002/02/22 01:02:00 EST
948    Tag: leunga-20020222-mlrisc-tools
949    
950    Minor bug fixes in the parser and rewriter
951    
952    ----------------------------------------------------------------------
953    Name: Allen Leung
954    Date: 2002/02/21 20:20:00 EST
955    Tag: leunga-20020221-peephole
956    
957    Regenerated the peephole files.  Some contained typos in the specification
958    and some didn't compile because of pretty printing bugs in the old version
959    of 'nowhere'.
960    
961    ----------------------------------------------------------------------
962    Name: Allen Leung
963    Date: 2002/02/19 20:20:00 EST
964    Tag: leunga-20020219-mlrisc-tools
965    Description:
966    
967       Minor bug fixes to the mlrisc-tools library:
968    
969       1.  Fixed up parsing colon suffixed keywords
970       2.  Added the ability to shut the error messages up
971       3.  Reimplemented the pretty printer and fixed up/improved
972           the pretty printing of handle and -> types.
973       4.  Fixed up generation of literal symbols in the nowhere tool.
974       5.  Added some SML keywords to to sml.sty
975    
976    ----------------------------------------------------------------------
977    Name: Matthias Blume
978    Date: 2002/02/19 16:20:00 EST
979    Tag: blume-20020219-cmffi
980    Description:
981    
982    A wild mix of changes, some minor, some major:
983    
984    * All C FFI-related libraries are now anchored under $c:
985        $/c.cm      --> $c/c.cm
986        $/c-int.cm  --> $c/internals/c-int.cm
987        $/memory.cm --> $c/memory/memory.cm
988    
989    * "make" tool (in CM) now treats its argument pathname slightly
990      differently:
991        1. If the native expansion is an absolute name, then before invoking
992           the "make" command on it, CM will apply OS.Path.mkRelative
993           (with relativeTo = OS.FileSys.getDir()) to it.
994        2. The argument will be passed through to subsequent phases of CM
995           processing without "going native".  In particular, if the argument
996           was an anchored path, then "make" will not lose track of that anchor.
997    
998    * Compiler backends now "know" their respective C calling conventions
999      instead of having to be told about it by ml-nlffigen.  This relieves
1000      ml-nlffigen from one of its burdens.
1001    
1002    * The X86Backend has been split into X86CCallBackend and X86StdCallBackend.
1003    
1004    * Export C_DEBUG and C_Debug from $c/c.cm.
1005    
1006    * C type encoding in ml-nlffi-lib has been improved to model the conceptual
1007      subtyping relationship between incomplete pointers and their complete
1008      counterparts.  For this, ('t, 'c) ptr has been changed to 'o ptr --
1009      with the convention of instantiating 'o with ('t, 'c) obj whenever
1010      the pointer target type is complete.  In the incomplete case, 'o
1011      will be instantiated with some "'c iobj" -- a type obtained by
1012      using one of the functors PointerToIncompleteType or PointerToCompleteType.
1013    
1014      Operations that work on both incomplete and complete pointer types are
1015      typed as taking an 'o ptr while operations that require the target to
1016      be known are typed as taking some ('t, 'c) obj ptr.
1017    
1018      voidptr is now a bit "more concrete", namely "type voidptr = void ptr'"
1019      where void is an eqtype without any values.  This makes it possible
1020      to work on voidptr values using functions meant to operate on light
1021      incomplete pointers.
1022    
1023    * As a result of the above, signature POINTER_TO_INCOMPLETE_TYPE has
1024      been vastly simplified.
1025    
1026    ----------------------------------------------------------------------
1027    Name: Matthias Blume
1028    Date: 2002/02/19 10:48:00 EST
1029    Tag: blume-20020219-pqfix
1030    Description:
1031    
1032    Applied Chris Okasaki's bug fix for priority queues.
1033    
1034    ----------------------------------------------------------------------
1035    Name: Matthias Blume
1036    Date: 2002/02/15 17:05:00
1037    Tag: Release_110_39
1038    Description:
1039    
1040    Last-minute retagging is becoming a tradition... :-(
1041    
1042    This is the working release 110.39.
1043    
1044    ----------------------------------------------------------------------
1045    Name: Matthias Blume
1046    Date: 2002/02/15 16:00:00 EST
1047    Tag: Release_110_39-orig
1048    Description:
1049    
1050    Working release 110.39.  New bootfiles.
1051    
1052    (Update: There was a small bug in the installer so it wouldn't work
1053    with all shells.  So I retagged. -Matthias)
1054    
1055    ----------------------------------------------------------------------
1056    Name: Matthias Blume
1057    Date: 2002/02/15 14:17:00 EST
1058    Tag: blume-20020215-showbindings
1059    Description:
1060    
1061    Added EnvRef.listBoundSymbols and CM.State.showBindings.  Especially
1062    the latter can be useful for exploring what bindings are available at
1063    the interactive prompt.  (The first function returns only the list
1064    of symbols that are really bound, the second prints those but also the
1065    ones that CM's autoloading mechanism knows about.)
1066    
1067    ----------------------------------------------------------------------
1068    Name: Matthias Blume
1069    Date: 2002/02/15 12:08:00 EST
1070    Tag: blume-20020215-iptrs
1071    Description:
1072    
1073    Two improvements to ml-nlffigen:
1074    
1075      1. Write files only if they do not exist or if their current contents
1076         do not coincide with what's being written.  (That is, avoid messing
1077         with the time stamps unless absolutely necessary.)
1078    
1079      2. Implement a "repository" mechanism for generated files related
1080         to "incomplete pointer types".   See the README file for details.
1081    
1082    ----------------------------------------------------------------------
1083    Name: Matthias Blume
1084    Date: 2002/02/14 11:50:00 EST
1085    Tag: blume-20020214-quote
1086    Description:
1087    
1088    Added a type 't t_' to tag.sml (in ml-nlffi-lib.cm).  This is required
1089    because of the new and improved tag generation scheme.  (Thanks to Allen
1090    Leung for pointing it out.)
1091    
1092    ----------------------------------------------------------------------
1093    Name: Lal George
1094    Date: 2002/02/14 09:55:27 EST 2002
1095    Tag: george-20020214-isabelle-bug
1096    Description:
1097    
1098    Fixed the MLRISC bug sent by Markus Wenzel regarding the compilation
1099    of Isabelle on the x86.
1100    
1101    From Allen:
1102    -----------
1103     I've found the problem:
1104    
1105         in ra-core.sml, I use the counter "blocked" to keep track of the
1106         true number of elements in the freeze queue.  When the counter goes
1107         to zero, I skip examining the queue.  But I've messed up the
1108         bookkeeping in combine():
1109    
1110             else ();
1111             case !ucol of
1112               PSEUDO => (if !cntv > 0 then
1113                     (if !cntu > 0 then blocked := !blocked - 1 else ();
1114                                        ^^^^^^^^^^^^^^^^^^^^^^^
1115                      moveu := mergeMoveList(!movev, !moveu)
1116                     )
1117                  else ();
1118    
1119         combine() is called to coalesce two nodes u and v.
1120         I think I was thinking that if the move counts of u and v are both
1121         greater than zero then after they are coalesced then one node is
1122         removed from the freeze queue.  Apparently I was thinking that
1123         both u and v are of low degree, but that's clearly not necessarily true.
1124    
1125    
1126    02/12/2002:
1127        Here's the patch.  HOL now compiles.
1128    
1129        I don't know how this impact on performance (compile
1130        time or runtime).  This bug caused the RA (especially on the x86)
1131        to go thru the potential spill phase when there are still nodes on the
1132        freeze queue.
1133    
1134    
1135    
1136    
1137    ----------------------------------------------------------------------
1138    Name: Matthias Blume
1139    Date: 2002/02/13 22:40:00 EST
1140    Tag: blume-20020213-fptr-rtti
1141    Description:
1142    
1143    Fixed a bug in ml-nlffigen that was introduced with one of the previous
1144    updates.
1145    
1146    ----------------------------------------------------------------------
1147    Name: Matthias Blume
1148    Date: 2002/02/13 16:41:00 EST
1149    Tag: blume-20020213-cmlpq
1150    Description:
1151    
1152    Added new priority queue export symbols (which have just been added to
1153    smlnj-lib.cm) to CML's version of smlnj-lib.cm.  (Otherwise CML would
1154    not compile and the installer would choke.)
1155    
1156    ----------------------------------------------------------------------
1157    Name: Matthias Blume
1158    Date: 2002/02/13 16:15:00 EST
1159    Tag: blume-20020213-various
1160    Description:
1161    
1162    1. More tweaks to ml-nlffigen:
1163    
1164       - better internal datastructures (resulting in slight speedup)
1165       - "-match" option requires exact match
1166       - "localized" gensym counters (untagged structs/unions nested within
1167         other structs/unions or within typedefs get a fresh counter; their
1168         tag will be prefixed by a concatenation of their parents' tags)
1169       - bug fixes (related to calculation of transitive closure of types
1170         to be included in the output)
1171    
1172    2. Minor Basis updates:
1173    
1174       - added implementations for List.collate and Option.app
1175    
1176    ----------------------------------------------------------------------
1177    Name: Matthias Blume
1178    Date: 2002/02/11 15:55:00 EST
1179    Tag: blume-20020211-gensym
1180    Description:
1181    
1182    Added a "-gensym" option to command line of ml-nlffigen.  This can be
1183    used to specify a "stem" -- a string that is inserted in all "gensym'd"
1184    names (ML structure names that correspond to unnamed C structs, unions,
1185    and enums), so that separate runs of ml-nlffigen do not clash.
1186    
1187    ----------------------------------------------------------------------
1188    Name: Matthias Blume
1189    Date: 2002/02/11 12:05:00 EST
1190    Tag: blume-20020211-gensml
1191    Description:
1192    
1193    A quick fix for a problem with GenSML (in the pgraph-util library):
1194    Make generation of toplevel "local" optional.  (Strictly speaking,
1195    signature definitions within "local" are not legal SML.)
1196    
1197    Other than that: updates to INSTALL and cm/TODO.
1198    
1199    ----------------------------------------------------------------------
1200    Name: Matthias Blume
1201    Date: 2002/02/08 15:00:00 EST
1202    Tag: blume-20020208-uniquepid
1203    Description:
1204    
1205    0. Version number has been bumped to 110.38.1.  NEW BOOTFILES!!!
1206    
1207    1. The installer (config/install.sh) has gotten smarter:
1208    
1209         - Configuration options are a bit easier to specify now
1210           (in config/targets).
1211         - Bug in recognizing .tar.bz2 files fixed.
1212         - Installer automatically resolves dependencies between
1213           configuration options (e.g., if you ask for eXene, you will
1214           also get cml -- regardless whether you asked for it or not).
1215         - Installer can run in "quieter mode" by setting the environment
1216           variable INSTALL_QUIETLY to "true".  "Quieter" does not mean
1217           "completely silent", though.
1218         - Build HashCons library as part of smlnj-lib.
1219    
1220    2. A new scheme for assigning persistent identifiers to compilation
1221       units (and, by extension, to types etc.) has been put into place.
1222       This fixes a long-standing bug where types and even dynamic values
1223       can get internally confused, thereby compromising type safety
1224       (abstraction) and dynamic correctness.  See
1225    
1226         http://cm.bell-labs.com/cm/cs/who/blume/pid-confusion.tgz
1227    
1228       for an example of how things could go wrong until now.
1229    
1230       The downside of the new scheme is that pids are not quite as
1231       persistent as they used to be: CM will generate a fresh pid
1232       for every compilation unit that it thinks it sees for the first
1233       time.  That means that if you compile starting from a clean, fresh
1234       source tree at two different times, you end up with different
1235       binaries.
1236    
1237       Cutoff recompilation, however, has not been compromised because
1238       CM keeps pid information in special caches between runs.
1239    
1240    ----------------------------------------------------------------------
1241    Name: Lal George
1242    Date: 2002/02/07 15:34:13 EST 2002
1243    Tag: <none>
1244    Description:
1245    
1246    Compilers that generate assembly code may produce  global labels
1247    whose value is resolved at link time. The various peephole optimization
1248    modules did not take this in account.
1249    
1250    TODO. The Labels.addrOf function should really return an option
1251    type so that clients are forced to deal with this issue, rather
1252    than an exception being raised.
1253    
1254    ----------------------------------------------------------------------
1255    Name: Lal George
1256    Date: 2002/02/06 13:55:02 EST
1257    Tag: george-20020206-ra-breakup
1258    Description:
1259    
1260    1. A bug fix from Allen.
1261    
1262        A typo causes extra fstp %st(0)'s to be generated at compensation
1263        edges, which might cause stack underflow traps at runtime.  This
1264        occurs in fft where there are extraneous fstps right before the 'into'
1265        trap instruction (in this case they are harmless since none of the
1266        integers overflow.)
1267    
1268    2. Pulled out various utility modules that were embedded in the modules
1269       of the register allocator. I need these modules for other purposes, but
1270       they are not complete enough to put into a library (just yet).
1271    ----------------------------------------------------------------------
1272    Name: Matthias Blume
1273    Date: 2002/01/31 16:05:00 EST
1274    Tag: blume-20020131-sparc-ccalls
1275    Description:
1276    
1277    1. C-calls on Sparc needlessly allocated a huge chunk (96 bytes)
1278       of extra stack space by mistake.  Fixed.
1279    
1280    2. Bug in logic of handling of command-line options in ml-nlffigen fixed.
1281    
1282    ----------------------------------------------------------------------
1283    Name: Allen Leung
1284    Date: 2002/01/30
1285    Tag: leunga-20020130-nowhere-bug-fix
1286    Description:
1287    
1288       MLRISC bug fixes:
1289       1. Fixed a bindings computation bug in the 'nowhere' program generator tool.
1290       2. MachineInt.fromString was negating its value.
1291    
1292    ----------------------------------------------------------------------
1293    Name: Matthias Blume
1294    Date: 2002/01/29
1295    Tag: blume-20020129-INSTALL
1296    Description:
1297    
1298    - Added somewhat detailed installation instructions (file INSTALL).
1299    - Fixed curl-detection bug in config/install.sh.
1300    - It is now possible to select the URL getter using the URLGETTER
1301      environment variable:
1302    
1303          not set / "unknown"      --> automatic detection (script tries wget,
1304                                       curl, and lynx)
1305          "wget" / "curl" / "lynx" --> use the specified program (script "knows"
1306                                       how to properly invoke them)
1307          other                    --> use $URLGETTER directly, it must take
1308                                       precisely two command-line arguments
1309                                       (source URL and destination file name)
1310    
1311    ----------------------------------------------------------------------
1312    Name: Matthias Blume
1313    Date: 2002/01/28
1314    Tag: blume-20020128-sparc-ccalls
1315    Description:
1316    
1317    - Fixed problem with calculation of "used" registers in sparc-c-calls.
1318    - Make use of the allocParam argument in sparc-c-calls.
1319    
1320    ----------------------------------------------------------------------
1321    Name: Matthias Blume
1322  Date: 2002/01/28  Date: 2002/01/28
1323  Tag: blume-20020128-allocParam  Tag: blume-20020128-allocParam
1324  Description:  Description:
# Line 584  Line 1889 
1889    
1890  ----------------------------------------------------------------------  ----------------------------------------------------------------------
1891  Name: Matthias Blume  Name: Matthias Blume
 >>>>>>> 1.169  
1892  Date: 2001/09/18 15:35:00 EDT  Date: 2001/09/18 15:35:00 EDT
1893  Tag: blume-20010918-readme11036  Tag: blume-20010918-readme11036
1894  Description:  Description:

Legend:
Removed from v.1044  
changed lines
  Added in v.1183

root@smlnj-gforge.cs.uchicago.edu
ViewVC Help
Powered by ViewVC 1.0.0