DIRECTORY CD, CDDirectory, Rope; CDBottomUp: CEDAR DEFINITIONS = BEGIN Class: TYPE = REF --READONLY-- ClassRec; ClassRec: TYPE = RECORD [do: DoProc, reUse: ReUseProc, enumerateChildren: EnumChildsProc_NIL, key: REF, classData: REF, xDesign: BOOL]; Handle: TYPE = REF HandleRec; HandleRec: TYPE = RECORD [class: Class, data: REF, invocation: REF, design: CD.Design_NIL, r: Rope.ROPE_NIL, cnt: INT_0]; DoProc: TYPE = PROC [handle: Handle, ob: CD.Object] RETURNS [val: REF_NIL]; ReUseProc: TYPE = PROC [handle: Handle, ob: CD.Object, previousVal: REF] RETURNS [shouldDoAain: BOOL_FALSE]; EnumChildsProc: TYPE = CDDirectory.EnumerateChildObjectsProc; Peek: PROC [key: REF, ob: CD.Object] RETURNS [val: REF]; DoRecurse: PROC [handle: Handle, ob: CD.Object] RETURNS [val: REF, new: BOOL]; MakeHandle: PROC [class: Class, design: CD.Design_NIL, data: REF_NIL, invocation: REF_NIL] RETURNS [handle: Handle]; StartRecurse: PROC [class: Class, ob: CD.Object, design: CD.Design_NIL, data: REF_NIL] RETURNS [val: REF, new: BOOL, handle: Handle]; Register: PROC [do: DoProc, reUse: ReUseProc_NIL, enumerateChildren: EnumChildsProc_NIL, key: REF_NIL, reRegistrationKey: REF_NIL, classData: REF_NIL, xDesign: BOOL_TRUE] RETURNS [class: Class]; END. 2CDBottomUp.mesa Copyright c 1985, 1987 by Xerox Corporation. All rights reserved. Created by Christian Jacobi, December 13, 1985 5:49:59 pm PST Last edited by: Christian Jacobi, April 15, 1987 5:40:47 pm PDT A module which allows easy implementation of bottom up calls which cache the results. Each independent call creates a new invocation key. Results which are created with the same invocation key are allways trusted and taken from the cache. Results with a different invocation key are re-used if all the subcells in the specified hierarchy haven't changed. Calls for each application (class) - design pair should be monitored by the client, to prevent conflicts on the cached results and which invocation is the latest. --A class represents the application program; what analysis procedure should be called --Clients of the actual analysis do not need any field except key and classData; consider --other fields private to the actual analysis package. --A handle represents one bottom up call sequence --data, r, cnt and design are reserved for clients only and not used by CDBottomUpImpl -- (there are never many HandleRec's arround) --Non sequential classes should not use r or cnt; different r might be catenated --A DoProc should not recurse directly but may call DoRecurse to get recursion going --If ~ob.class.mutable then results must NOT depend on design --val: value which will be cached --A ReUseProc should be fast and should not recurse directly nor call DoRecurse --Children enumerator to define hierarchy. --A NIL EnumChildsProc proc causes CDBottomUp to use --CDDirectory.EnumerateChildObjects to find children; the recursion is going --through the physical nesting hierarchy. A client EnumChildsProc proc is --the means to implement going down an icon - implementor hierarchy. --Returns cached result; independent whether valid or not... --key: as in Class registration --Gets value from cache or start recursion if value is not valid --May be called recursively at clients own will; caches results (not slower then Peek) --val: the result which was computed or cached --new: whether a new result was computed this invocation (important for the engine room!) --The automatic recursion calls only objects in the directory; however, if the client himself -- calls DoRecurse for objects not in the directory, the procedures are invoked and the -- results cached. --Creates the handle data structure which will be passed through the recursion. --class: determines application (procedures to be called) --data: reserved for the client (implementor of class) --design: is optional except if required by class --invocation: invocation-key; (NIL for a new invocation-key) --Short cut for DoRecurse[MakeHandle[...], ...] --Registers an application of CDBottomUp --do: to be called bottom up for all objects in the directory. Do will typically -- call DoRecurse to get recursion going; but for objects in the -- directory, recursive calls of DoRecurse might have been precalled and -- the result cached. --reUse: is called to figure out whether objects which are already handled should -- be handled again. It is called only for objects in the directory and -- if do is not called anyway. --enumerateChildren: enumerating children defines the hierarchy; NIL for using -- ChipNDale's physical nesting hierarchy. --key: property used to cache previous results; a NIL value creates a new property key. -- The key property will be registered. -- Clients must not access properties directly, but may use Peek. -- Clients may remove cache by putting NIL on the key property. --reRegistrationKey: property re-registration key; a NIL value ensures a new registration. --xDesign: Continues automatic analysis over design boundaries. -- But client could do that himself anyway, except reUse check. --class: identity of application; reserved for clients. Ê™˜code™Kšœ Ïmœ7™BK™=K™?—K˜šÏk ˜ Kšžœ˜—K˜KšÏn œžœžœ˜ Kšžœ˜K˜K™WK™KšœÏÏbœ9™ŽK™K™¢K˜K˜Kš œžœžœÏcž¡œ ˜(š œ žœžœBžœžœ žœžœ˜‡Kš¡V™VKšœZ™ZKšœ6™6—K˜Kšœžœžœ˜šœžœžœžœžœ žœžœ žœžœžœ˜yKš¡1™1Kš¡W™WKšœ¡*™0Kš¡œ&¡)™QK˜—š œžœžœžœ žœžœžœ˜KKšœT™TKšœ=™=Kšœ!™!—K˜š œžœžœžœžœžœž œ˜lKšœO™O—K˜šœžœ)˜=Kšœ*™*Kšœ4™4KšœL™LKšœJ™JK™D—K˜šŸœžœžœžœ žœžœ˜8Kšœ<™