
DIRECTORY
ProcessProps USING [],
List USING [AList];

ProcessPropsImpl: CEDAR MONITOR
EXPORTS ProcessProps
= BEGIN OPEN List;

AddPropList: PUBLIC PROC [propList: AList, inner: PROC] = TRUSTED {
old: AList = NARROW[GetProcessProperty[]];
IF old # NIL THEN {
tail: AList м NIL;
FOR each: AList м propList, each.rest WHILE each # NIL DO
new: AList = LIST[each.first];
IF tail = NIL THEN propList м new ELSE tail.rest м new;
tail м new;
ENDLOOP;
IF tail = NIL THEN propList м old ELSE tail.rest м old;
};
SetProcessProperty[propList];
inner[! UNWIND => SetProcessProperty[old]];
SetProcessProperty[old];
};

PushPropList: PUBLIC PROC [propList: AList, inner: PROC] = {
old: AList = NARROW[GetProcessProperty[]];
SetProcessProperty[propList];
inner[! UNWIND => SetProcessProperty[old]];
SetProcessProperty[old];
};
GetPropList: PUBLIC PROC RETURNS [propList: AList м NIL] = TRUSTED {
propList м NARROW[GetProcessProperty[]];
};

GetProp: PUBLIC PROC [key: REF] RETURNS [prop: REF м NIL] = TRUSTED {
propList: AList м NARROW[GetProcessProperty[]];
WHILE propList # NIL DO
IF propList.first.key = key THEN RETURN [propList.first.val];
propList м propList.rest;
ENDLOOP;
};

GetProcessProperty: PROC RETURNS [prop: REF] ~ TRUSTED MACHINE CODE {
"XR_GetThreadProperty"
};

SetProcessProperty: PROC [prop: REF] ~ TRUSTED MACHINE CODE {
"XR_SetThreadProperty"
};


END.

  x  
ProcessPropsImpl.mesa
Copyright ╙ 1985, 1986, 1991 by Xerox Corporation.  All rights reserved.
Russ Atkinson, February 1, 1985 3:53:26 pm PST
Carl Hauser, June 30, 1988 10:30:33 pm PDT
... adds the given properties to the current process for the duration of the call of inner.  The old property list for the process will not be altered, but will be found at the end of the propety list during the call to inner.  The old property list will be restored after the call has completed.  The new propList will be copied if an old property list exists.
... sets the property list for the current process for the duration of the call of inner.  The old property list will be restored after the call has completed.  The new propList will not be copied.  Most applications should use AddPropList to properly inherit properties.

... returns the current property list for the current process.  Although there is no prohibition from altering the returned list, users are encouraged to follow the style of adding new properties, rather than changing old associations.
... returns the current property associated with the given key for the current process.  This procedure is preferred to GetPropList for most applications.
The following two operations are safe, but operations on PROCESS values are, in general, not safe, since processes are reused.  These operations should be regarded as instantaneous samples, where the results are likely to change without notice.  However, statistics-style applications and may find these operations useful despite these caveats.  It is also OK to ask whether a process still has some property if that property will not be reused.

GetSpecificPropList: PUBLIC PROC
[process: PROCESS] RETURNS [propList: AList _ NIL] = TRUSTED {
... returns the current property list for the specified process
entry: ProcessEntry = GetProcessEntry[process];
IF entry # NIL THEN propList _ entry.current;
};

GetNextPropList: PUBLIC ENTRY PROC [process: PROCESS _ NIL] RETURNS [next: PROCESS _ NIL, propList: AList _ NIL] = {
... returns the next process with a non-NIL propList.  Use GetNextPropList[NIL] to start the iteration.  [NIL, NIL] will be returned if no more processes exist.  The processes are produced in increasing order.  There is a very small probability of a race with AddPropList and PushPropList, but it must result in a bounded number of retries.
ENABLE UNWIND => NULL;
DO
best: ProcessEntry _ NIL;
FOR i: NAT IN [0..16) DO
FOR each: ProcessEntry _ processVector[i], each.next UNTIL each = NIL DO
eachProcess: CARDINAL = LOOPHOLE[each.process];
IF each.current = NIL THEN LOOP;
IF eachProcess <= LOOPHOLE[process, CARDINAL] THEN LOOP;
IF best = NIL OR eachProcess < LOOPHOLE[best.process, CARDINAL]
THEN best _ each;
ENDLOOP;
ENDLOOP;
IF best = NIL THEN EXIT;
propList _ best.current;
IF propList = NIL THEN {races _ races + 1; LOOP};  -- rats! a race occurred
next _ best.process;
EXIT;
ENDLOOP;
};

 Э╩j  Ц(cedarcode) styleХNewlineDelimiter
Щ codeЪЬЩKЪЬ
╧eЬ=ЩHKЪЬ.Щ.KЩ*ЧKШ Ъ╧k	Ш	KЪЬЮЬШKЪЬЮЬ	ШKШ ЧЪ╧nЬЮЬЮШKЪЮЬШKЪЬЮЬЮЬШKШ ЧЪЯЬЮЬЮЬЮЬШCKЪЬщЩщKЪЬЮЬШ*ЪЮЬЮЬЮЬШKЪЬЮЬШЪЮЬ#ЮЬЮЬЮШ9KЪЬЮЬШKЪЮЬЮЬЮЬЮЬШ7KЪЬШKЪЮЬШЧKЪЮЬЮЬЮЬЮЬШ7KШЧKЪЬШKЪЬЮЬШ+KЪЬШKШKШ ЧЪЯЬЮЬЮЬЮЬШ<KЪЬПЩПKЪЬЮЬШ*KЪЬШKЪЬЮЬШ+KЪЬШKШKЩ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬШDKЪЬыЩыKЪЬЮЬШ(KШKШ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬШEKЪЬЪЩЪKЪЬЮЬШ/ЪЮЬЮЬЮШKЪЮЬЮЬЮЬШ=KЪЬШKЪЮЬШЧKШKШ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬШEKШKШKШ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬШ=KШKШKШ ЧKЪЬ9ЮЬ¤Щ╜KЩ ЪЯЬЮЬЮЩ KЪ	Ь
ЮЬЮЬЮЬЮЬЩ>KЪЬ?Щ?KЪЬ/Щ/KЪЮЬ	ЮЬЮЬЩ-KЩKЩ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЩtKЪЬ╘Щ╘KЪЮЬЮЬЮЬЩЪЮЩKЪЬЮЬЩЪЮЬЮЬЮЬ	ЮЩЪЮЬ2ЮЬЮЬЮЩHKЪЬЮЬЮЬЩ/KЪЮЬЮЬЮЬЮЬЩ KЪ
ЮЬЮЬ
ЮЬЮЬЮЬЩ8Ъ
ЮЬЮЬЮЬЮЬЮЬЩ?KЪЮЬЩЧKЪЮЬЩЧKЪЮЬЩЧKЪЮЬЮЬЮЬЮЬЩKЪЬЩKЪ	ЮЬЮЬЮЬЮЬ╧cЩKKЪЬЩKЪЮЬЩKЪЮЬЩЧKЩKЩ KШ ЧKЪЮЬШKШ Ч ЕЧ    R  4  