2
0

Generic.Unix.Objects.Mod 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938
  1. (* Aos, Copyright 2001, Pieter Muller, ETH Zurich *)
  2. MODULE Objects; (** AUTHOR "pjm, G.F."; PURPOSE "Active object runtime support"; *)
  3. IMPORT S := SYSTEM, Trace, Glue, Unix, Machine, Heaps, Modules;
  4. CONST
  5. (*! Process flags, meaningless in Unix ports !!! *)
  6. PleaseHalt* = 10; (* Process requested to Halt itself soon *)
  7. Unbreakable*= 11; (* FINALLY shall not catch HALT exception (PleaseHalt is also set) *)
  8. SelfTermination*=12; (* Indicates the process has requested to terminate ifself (PleaseHalt is also set) *)
  9. Preempted* = 27; (* Has been preempted. *)
  10. Resistant* = 28; (* Can only be destroyed by itself *)
  11. MinPriority* = Unix.ThreadLow;
  12. Low* = Unix.ThreadLow + 1;
  13. Normal* = Unix.ThreadNormal;
  14. High* = Unix.ThreadHigh - 2;
  15. GCPriority* = Unix.ThreadHigh - 1;
  16. Realtime* = Unix.ThreadHigh;
  17. (* Process flag defined by compiler in OPC.CallRecBody *)
  18. Restart* = 0; (* Restart/Destroy process on exception *)
  19. (* Process modes (in UnixAos Running means Running or Ready!) *)
  20. Unknown* = 0; Ready* = 1; Running* = 2; AwaitingLock* = 3;
  21. AwaitingCond* = 4; AwaitingEvent* = 5; Terminated* = 6;
  22. Second* = 1000; (* frequency of ticks increments in Hz *)
  23. DefaultStacksize = 128*1024;
  24. VAR
  25. (* timer *)
  26. timerActivity : TimerActivity;
  27. clock : Clock;
  28. timers : Timer;
  29. timerListMutex : Unix.Mutex_t;
  30. timerStopped: BOOLEAN;
  31. (* processes *)
  32. SystemA2Up- : BOOLEAN;
  33. root- : Process; (*! Anchor of all instantiated threads in system *)
  34. stacksize: LONGINT; (* stack size of active objects, adjustable via boot parameter *)
  35. processList : Unix.Mutex_t;
  36. createProcess : Unix.Mutex_t;
  37. startProcess : Unix.Mutex_t;
  38. lockMutex : Unix.Mutex_t;
  39. childrunning : Unix.Condition_t;
  40. processPointer : Unix.Key_t;
  41. newProcess: Process;
  42. nextPID: LONGINT;
  43. finalizerCaller : FinalizerCaller;
  44. mainthread: Unix.Thread_t;
  45. TYPE
  46. LockT= POINTER TO RECORD
  47. mtx, enter: ADDRESS;
  48. END;
  49. CpuCyclesArray* = ARRAY Machine.MaxCPU OF HUGEINT;
  50. ProtectedObject = POINTER TO RECORD END;
  51. ObjectHeader = Heaps.ProtRecBlock;
  52. ProcessQueue = Heaps.ProcessQueue;
  53. EventHandler* = PROCEDURE {DELEGATE};
  54. Timer* = OBJECT
  55. VAR
  56. next: Timer;
  57. trigger: LONGINT;
  58. handler: EventHandler
  59. END Timer;
  60. TimerActivity = OBJECT
  61. VAR
  62. t, r: Timer; h: EventHandler; restart: BOOLEAN;
  63. PROCEDURE UpdateTicks;
  64. BEGIN {EXCLUSIVE}
  65. Machine.UpdateTicks
  66. END UpdateTicks;
  67. PROCEDURE Restart;
  68. BEGIN {EXCLUSIVE}
  69. restart := TRUE
  70. END Restart;
  71. BEGIN {ACTIVE, SAFE, PRIORITY(High)}
  72. restart := FALSE;
  73. LOOP
  74. t := timers;
  75. IF t # NIL THEN
  76. h := NIL; r := NIL;
  77. BEGIN {EXCLUSIVE}
  78. AWAIT( (Machine.ticks >= t.trigger) OR restart ); restart := FALSE;
  79. IF Machine.ticks >= t.trigger THEN
  80. h := t.handler; r := t
  81. END
  82. END;
  83. IF r # NIL THEN Remove( r ) END;
  84. IF h # NIL THEN (* not canceled *) h END
  85. ELSE
  86. BEGIN{EXCLUSIVE}
  87. AWAIT( restart ); restart := FALSE;
  88. END
  89. END
  90. END
  91. END TimerActivity;
  92. Clock* = OBJECT
  93. BEGIN {ACTIVE}
  94. LOOP
  95. Unix.ThrSleep( 10 );
  96. IF ~timerStopped THEN timerActivity.UpdateTicks END
  97. END;
  98. END Clock;
  99. FinalizedCollection* = OBJECT (* base type for collection, extended in Kernel.Mod *)
  100. PROCEDURE RemoveAll*(obj: ANY); (** abstract *)
  101. BEGIN HALT(301) END RemoveAll;
  102. END FinalizedCollection;
  103. FinalizerNode* = POINTER TO RECORD (Heaps.FinalizerNode)
  104. c*: FinalizedCollection (* base type for collection containing object *)
  105. END;
  106. FinalizerCaller = OBJECT (* separate active object that calls finalizers *)
  107. VAR
  108. n: Heaps.FinalizerNode; start: BOOLEAN;
  109. PROCEDURE Activate;
  110. BEGIN {EXCLUSIVE}
  111. start := TRUE
  112. END Activate;
  113. BEGIN {ACTIVE, SAFE, PRIORITY(High)}
  114. start := FALSE;
  115. LOOP
  116. BEGIN {EXCLUSIVE} AWAIT( start ) END;
  117. start := FALSE;
  118. LOOP
  119. n := Heaps.GetFinalizer();
  120. IF n = NIL THEN EXIT END;
  121. IF n IS FinalizerNode THEN
  122. n(FinalizerNode).c.RemoveAll(n.objStrong) (* remove it if it is not removed yet *)
  123. END;
  124. IF n.finalizer # NIL THEN
  125. n.finalizer(n.objStrong) (* may acquire locks *)
  126. END;
  127. END;
  128. END
  129. END FinalizerCaller;
  130. Body = PROCEDURE ( self: ProtectedObject );
  131. Condition = PROCEDURE ( slink: ADDRESS ): BOOLEAN;
  132. Process* = OBJECT (Heaps.ProcessLink)
  133. VAR
  134. threadId- : Unix.Thread_t;
  135. nextProcess- : Process; (* next in list of all processes *)
  136. stackBottom - : ADDRESS;
  137. id- : LONGINT;
  138. body : Body;
  139. mode- : LONGINT;
  140. flags- : SET;
  141. priority- : LONGINT; (* only effective if Aos is running SUID root *)
  142. succ : Process; (* in ProcessQueue *)
  143. obj- : ProtectedObject; (* associated active object *)
  144. condition- : Condition; (* awaited process' condition *)
  145. condFP- : ADDRESS; (* awaited process' condition's context *)
  146. continue : Unix.Condition_t; (* gets signaled when condition yields true *)
  147. waitingOn- : ProtectedObject;
  148. procID- : LONGINT; (*! processor ID where running, not used in UnixAos *)
  149. state- : Machine.State;
  150. state0 : ARRAY 2048 OF CHAR; (* thread state at body start, used for restart after trap *)
  151. context: ANY; (* commands context *)
  152. PROCEDURE FindRoots*;
  153. VAR sp, bp, n, a0, a1, adr: ADDRESS; desc: Modules.ProcedureDescPointer; i: LONGINT; p {UNTRACED}: ANY;
  154. BEGIN
  155. IF mode # Terminated THEN
  156. IF SELF = CurrentProcess() THEN
  157. state.SP := Machine.CurrentSP( );
  158. state.BP := Machine.CurrentBP( );
  159. END;
  160. sp := state.SP; bp := state.BP;
  161. IF Heaps.GCType = Heaps.HeuristicStackInspectionGC THEN
  162. IF (stackBottom # 0) & (sp # 0) & (sp <= stackBottom) THEN
  163. Heaps.RegisterCandidates( sp, stackBottom - sp );
  164. END;
  165. ELSIF Heaps.GCType = Heaps.MetaDataForStackGC THEN
  166. IF bp < stackBottom THEN
  167. WHILE (bp # Heaps.NilVal) & (bp > 1024) & (bp < stackBottom) DO (* do not test for bp >= sp: could be wrong temporarily! *)
  168. S.GET( bp, n );
  169. IF ODD( n ) THEN (* procedure descriptor at bp *)
  170. IF n > 1024 THEN
  171. desc := S.VAL( Modules.ProcedureDescPointer, n-1 );
  172. IF desc # NIL THEN
  173. a0 := ADDRESSOF( desc.offsets );
  174. a1 := S.VAL( ADDRESS, desc.offsets );
  175. ASSERT( a0+SIZEOF( ADDRESS ) = a1, 54321 );
  176. FOR i := 0 TO LEN( desc.offsets ) - 1 DO
  177. adr := bp + desc.offsets[i]; (* pointer at offset *)
  178. S.GET( adr, p ); (* load pointer *)
  179. IF p # NIL THEN
  180. Heaps.Mark( p );
  181. END
  182. END
  183. END
  184. END;
  185. S.GET( bp + SIZEOF( ADDRESS ), bp );
  186. ELSE (* classical stack frame *)
  187. bp := n;
  188. END;
  189. END;
  190. ASSERT( (bp = stackBottom) OR (bp < 1024) , 12345 );
  191. END;
  192. END
  193. END;
  194. Heaps.Mark( nextProcess )
  195. END FindRoots;
  196. PROCEDURE Cancel;
  197. VAR pt, t: Process; kt: Unix.Thread_t;
  198. BEGIN
  199. IF SELF = CurrentProcess() THEN Exit
  200. ELSE
  201. Machine.Acquire( Machine.X11 ); (* let the thread to be killed first finish its last I/O, if any *)
  202. Unix.MtxLock( processList );
  203. pt := NIL; t := root; kt := 0;
  204. WHILE (t # NIL ) & (t # SELF) DO pt := t; t := t.nextProcess END;
  205. IF t = SELF THEN
  206. kt := threadId;
  207. IF pt = NIL THEN root := t.nextProcess ELSE pt.nextProcess := t.nextProcess END;
  208. END;
  209. Unix.MtxUnlock( processList );
  210. IF kt # 0 THEN Unix.ThrKill( kt ) END;
  211. Machine.Release( Machine.X11 );
  212. END
  213. END Cancel;
  214. PROCEDURE GetPriority( ): LONGINT;
  215. BEGIN
  216. RETURN Unix.ThrGetPriority( threadId )
  217. END GetPriority;
  218. PROCEDURE SetPriority( prio: LONGINT );
  219. VAR pr: LONGINT;
  220. BEGIN
  221. pr := max( Machine.prioLow, min( prio, Machine.prioHigh ) );
  222. Unix.ThrSetPriority( threadId, pr ); (* works only if SUID root *)
  223. priority := GetPriority( )
  224. END SetPriority;
  225. PROCEDURE & Initialize( obj: ProtectedObject; bodyProc: Body; prio: LONGINT; fl: SET; stacksize: LONGINT);
  226. BEGIN
  227. SELF.obj := obj; condition := NIL; continue := Unix.NewCond( );
  228. flags := fl;
  229. priority := prio;
  230. nextProcess := NIL;
  231. context := CurrentContext();
  232. IF root # NIL THEN
  233. newProcess := SELF;
  234. ASSERT( bodyProc # NIL );
  235. body := bodyProc;
  236. Unix.MtxLock( startProcess );
  237. threadId := Unix.ThrStart( BodyStarter, stacksize );
  238. Unix.CondWait( childrunning, startProcess );
  239. Unix.MtxUnlock( startProcess );
  240. RegisterFinalizer( SELF, FinalizeProcess );
  241. ELSE
  242. (* first process *)
  243. stackBottom := Glue.stackBottom;
  244. threadId := Unix.ThrThis( );
  245. id := 0; nextPID := 1;
  246. root := SELF;
  247. mode := Running;
  248. Unix.WriteKey( processPointer, SELF );
  249. END;
  250. END Initialize;
  251. END Process;
  252. GCStatusExt = OBJECT (Heaps.GCStatus)
  253. (* called from Heaps.InvokeGC, i.e. this is a hidden upcall. However, it is necessary to take the Machine.Objects
  254. lock here since writing the set of variables here must not be interrupted, i.e. atomic writing of the set of variables
  255. is absolutely necessary. They system may hang if the lock is not taken. *)
  256. PROCEDURE SetgcOngoing( value: BOOLEAN );
  257. VAR cur: Process;
  258. BEGIN (* serialize writers *)
  259. cur := CurrentProcess();
  260. IF value THEN
  261. Machine.Acquire( Machine.Objects );
  262. Machine.Acquire( Machine.Heaps );
  263. cur.state.SP := Machine.CurrentSP();
  264. cur.state.BP := Machine.CurrentBP();
  265. cur.state.PC := ADDRESSOF( GCLoop );
  266. SuspendActivities;
  267. Heaps.CollectGarbage( Modules.root );
  268. Machine.Release( Machine.Heaps );
  269. Machine.Release( Machine.Objects );
  270. ResumeActivities;
  271. finalizerCaller.Activate;
  272. END;
  273. END SetgcOngoing;
  274. END GCStatusExt;
  275. PROCEDURE BodyStarter;
  276. VAR p{UNTRACED}: Process; res: LONGINT; prevBP, sp: ADDRESS;
  277. BEGIN
  278. Unix.MtxLock( startProcess );
  279. p := newProcess; newProcess := NIL;
  280. Unix.WriteKey( processPointer, p );
  281. p.id := nextPID; INC( nextPID );
  282. p.stackBottom := Machine.CurrentBP( );
  283. S.GET( p.stackBottom, prevBP );
  284. S.PUT( prevBP, S.VAL( ADDRESS, 0 ) ); (* for terminating Reflection.StackTraceBack *)
  285. Unix.MtxLock( processList );
  286. p.nextProcess := root; root := p;
  287. Unix.MtxUnlock( processList );
  288. Unix.CondSignal( childrunning );
  289. Unix.MtxUnlock( startProcess );
  290. p.SetPriority( p.priority );
  291. IF Restart IN p.flags THEN
  292. (* store and restore stack pointer because it is saved on the stack during SYSVABI calls to ensure stack alignment *)
  293. sp := S.GetStackPointer ();
  294. res := Unix.sigsetjmp( ADDRESSOF( p.state0[0] ), 1 );
  295. S.SetStackPointer (sp);
  296. END;
  297. p.mode := Running;
  298. p.body( p.obj );
  299. p.mode := Terminated;
  300. Exit
  301. END BodyStarter;
  302. (*--------------------- create, lock, await, unlock -------------------------*)
  303. (* initialize the ObjectHeader, requires lockMutex temporarily *)
  304. PROCEDURE InitProtHeader( hdr: ObjectHeader);
  305. VAR lock: LockT;
  306. BEGIN
  307. (* we cannot hold the lockMute here because allocation can trigger the GC that requires the lock when activating the finalizers *)
  308. NEW(lock);
  309. Unix.MtxLock(lockMutex);
  310. IF hdr.lock = NIL THEN
  311. lock.mtx := Unix.NewMtx( ); lock.enter := Unix.NewCond( ); hdr.lockedBy := NIL;
  312. hdr.lock := lock;
  313. END;
  314. Unix.MtxUnlock(lockMutex);
  315. END InitProtHeader;
  316. PROCEDURE CreateProcess*( body: Body; priority: LONGINT; flags: SET; obj: ProtectedObject );
  317. VAR p: Process; hdr: ObjectHeader;
  318. BEGIN
  319. Unix.MtxLock( createProcess );
  320. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr );
  321. InitProtHeader( hdr );
  322. IF priority = 0 THEN priority := Normal END;
  323. NEW( p, obj, body, priority, flags, stacksize ) ; (* execute BodyStarter as new (posix or solaris) thread *)
  324. Unix.MtxUnlock( createProcess );
  325. RegisterFinalizer( obj, FinalizeActiveObj )
  326. END CreateProcess;
  327. PROCEDURE Lock*( obj: ProtectedObject; exclusive: BOOLEAN );
  328. VAR hdr: ObjectHeader; p: Process; lock: LockT;
  329. BEGIN
  330. ASSERT( exclusive ); (* shared not implemented yet *)
  331. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr );
  332. p := CurrentProcess();
  333. p.state.SP := Machine.CurrentSP( );
  334. p.state.BP := Machine.CurrentBP( );
  335. p.state.PC := Machine.CurrentPC( );
  336. p.mode := AwaitingLock;
  337. (*! we might want to replace the lock mutex by a lock free construct *)
  338. IF hdr.lock = NIL THEN InitProtHeader( hdr ) END;
  339. lock := S.VAL(LockT, hdr.lock);
  340. p.mode := AwaitingLock;
  341. Unix.MtxLock( lock.mtx );
  342. WHILE hdr.lockedBy # NIL DO
  343. (* wait until threads with complied AWAIT conditions have left the monitor *)
  344. Unix.CondWait( lock.enter, lock.mtx );
  345. END;
  346. p.mode := Running; hdr.lockedBy := p; p.waitingOn := NIL
  347. END Lock;
  348. PROCEDURE Await*( cond: Condition; slink: ADDRESS; obj: ProtectedObject; flags: SET );
  349. VAR hdr {UNTRACED}: ObjectHeader; p, c: Process; lock: LockT;
  350. BEGIN
  351. IF 1 IN flags THEN (* compiler did not generate IF *)
  352. IF cond( slink ) THEN (* condition already true *) RETURN END
  353. END;
  354. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr ); c := NIL;
  355. lock := S.VAL(LockT, hdr.lock);
  356. IF hdr.awaitingCond.head # NIL THEN c := FindCondition( hdr.awaitingCond ) END;
  357. p := CurrentProcess();
  358. ASSERT( hdr.lockedBy = p, 2204 );
  359. p.succ := NIL; p.condition := cond; p.condFP := slink;
  360. p.waitingOn := obj; p.mode := AwaitingCond;
  361. Put( hdr.awaitingCond, p );
  362. hdr.lockedBy := c;
  363. IF c # NIL THEN Unix.CondSignal( c.continue ) ELSE Unix.CondSignal( lock.enter ) END;
  364. p.state.SP := Machine.CurrentSP( );
  365. p.state.BP := Machine.CurrentBP( );
  366. p.state.PC := Machine.CurrentPC( );
  367. Unix.CondWait( p.continue, lock.mtx );
  368. p.mode := Running; hdr.lockedBy := p; p.waitingOn := NIL
  369. END Await;
  370. PROCEDURE Unlock*( obj: ProtectedObject; dummy: BOOLEAN );
  371. VAR hdr: ObjectHeader; c: Process; lock: LockT;
  372. BEGIN
  373. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr ); c := NIL;
  374. lock := S.VAL(LockT,hdr.lock);
  375. IF hdr.awaitingCond.head # NIL THEN c := FindCondition( hdr.awaitingCond ) END;
  376. hdr.lockedBy := c;
  377. IF c # NIL THEN Unix.CondSignal( c.continue ) ELSE Unix.CondSignal( lock.enter ) END;
  378. Unix.MtxUnlock( lock.mtx );
  379. END Unlock;
  380. PROCEDURE FindCondition( VAR q: ProcessQueue ): Process;
  381. VAR first, cand: Process;
  382. BEGIN
  383. Get( q, first );
  384. IF first.condition( first.condFP ) THEN RETURN first ELSE Put( q, first ) END;
  385. WHILE q.head # first DO
  386. Get( q, cand );
  387. IF cand.condition( cand.condFP ) THEN RETURN cand ELSE Put( q, cand ) END;
  388. END;
  389. RETURN NIL
  390. END FindCondition;
  391. PROCEDURE Get( VAR queue: ProcessQueue; VAR new: Process );
  392. VAR t: Process;
  393. BEGIN
  394. t := queue.head(Process);
  395. IF t # NIL THEN
  396. IF t = queue.tail THEN queue.head := NIL; queue.tail := NIL
  397. ELSE queue.head := t.succ; t.succ := NIL
  398. END
  399. END;
  400. new := t
  401. END Get;
  402. PROCEDURE Put( VAR queue: ProcessQueue; t: Process );
  403. BEGIN
  404. IF queue.head = NIL THEN queue.head := t ELSE queue.tail(Process).succ := t END;
  405. queue.tail := t
  406. END Put;
  407. (*-------------------------------------------------------------------------*)
  408. PROCEDURE Terminate*;
  409. BEGIN
  410. Exit
  411. END Terminate;
  412. PROCEDURE TerminateThis*( p: Process; unbreakable: BOOLEAN );
  413. BEGIN
  414. p.mode := Terminated;
  415. p.Cancel
  416. END TerminateThis;
  417. PROCEDURE SetPriority*( pri: LONGINT ); (* Set the current process' priority. *)
  418. VAR me: Process;
  419. BEGIN
  420. me := CurrentProcess();
  421. me.SetPriority( pri )
  422. END SetPriority;
  423. PROCEDURE Sleep*( ms: LONGINT );
  424. BEGIN
  425. Unix.ThrSleep( ms );
  426. END Sleep;
  427. PROCEDURE Yield*; (* Relinquish control. *)
  428. BEGIN
  429. Unix.ThrYield( );
  430. END Yield;
  431. (* Return current process. (DEPRECATED, use ActiveObject) *)
  432. PROCEDURE CurrentProcess*( ): Process;
  433. BEGIN
  434. RETURN S.VAL( Process, Unix.ReadKey( processPointer ) )
  435. END CurrentProcess;
  436. PROCEDURE CurrentContext*(): ANY;
  437. VAR p: Process;
  438. BEGIN
  439. p := CurrentProcess();
  440. IF p # NIL THEN RETURN p.context
  441. ELSE RETURN NIL
  442. END;
  443. END CurrentContext;
  444. PROCEDURE SetContext*(context: ANY);
  445. VAR p: Process;
  446. BEGIN
  447. p := CurrentProcess();
  448. IF p # NIL THEN p.context := context END;
  449. END SetContext;
  450. (* Return the active object currently executing. *)
  451. PROCEDURE ActiveObject*( ): ANY;
  452. VAR p: Process;
  453. BEGIN
  454. p := CurrentProcess();
  455. RETURN p.obj
  456. END ActiveObject;
  457. (* Return stack bottom of process. For compatibility WinAos/UnixAos/NativeAos *)
  458. PROCEDURE GetStackBottom*(p: Process): ADDRESS;
  459. BEGIN
  460. RETURN p.stackBottom
  461. END GetStackBottom;
  462. PROCEDURE GetProcessID*( ): LONGINT;
  463. VAR p: Process;
  464. BEGIN
  465. p := CurrentProcess();
  466. RETURN p.id;
  467. END GetProcessID;
  468. PROCEDURE GetCpuCycles*( process : Process; VAR cpuCycles: CpuCyclesArray; all: BOOLEAN );
  469. VAR i: LONGINT;
  470. BEGIN
  471. ASSERT( process # NIL );
  472. FOR i := 0 TO Machine.MaxCPU-1 DO cpuCycles[i] := 0 END;
  473. END GetCpuCycles;
  474. (*-----------------------------------------------------------------------*)
  475. PROCEDURE min( a, b: LONGINT ): LONGINT;
  476. BEGIN
  477. IF a <= b THEN RETURN a ELSE RETURN b END
  478. END min;
  479. PROCEDURE max( a, b: LONGINT ): LONGINT;
  480. BEGIN
  481. IF a >= b THEN RETURN a ELSE RETURN b END
  482. END max;
  483. PROCEDURE RegisterFinalizer( obj: ANY; fin: Heaps.Finalizer );
  484. VAR n: Heaps.FinalizerNode;
  485. BEGIN
  486. NEW( n ); n.finalizer := fin; Heaps.AddFinalizer( obj, n );
  487. END RegisterFinalizer;
  488. PROCEDURE FinalizeActiveObj( obj: ANY );
  489. VAR p: Process;
  490. BEGIN
  491. Unix.MtxLock( processList );
  492. p := root;
  493. WHILE (p # NIL) & (p.obj # obj) DO p := p.nextProcess END;
  494. Unix.MtxUnlock( processList );
  495. IF (p # NIL) & (p.obj = obj) THEN
  496. p.mode := Terminated;
  497. Unix.CondDestroy( p.continue ); p.continue := 0;
  498. FinalizeProtObject( obj );
  499. p.Cancel
  500. END;
  501. END FinalizeActiveObj;
  502. PROCEDURE FinalizeProtObject( obj: ANY );
  503. VAR hdr: ObjectHeader; lock: LockT;
  504. BEGIN
  505. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr );
  506. IF hdr.lock # NIL THEN
  507. lock := S.VAL(LockT, hdr.lock);
  508. Unix.MtxDestroy( lock.mtx ); lock.mtx := 0
  509. END
  510. END FinalizeProtObject;
  511. PROCEDURE FinalizeProcess( obj: ANY );
  512. VAR p: Process;
  513. BEGIN
  514. p := obj(Process);
  515. IF p.continue # 0 THEN
  516. Unix.CondDestroy( p.continue ); p.continue := 0
  517. END
  518. END FinalizeProcess;
  519. (* Terminate calling thread. *)
  520. PROCEDURE Exit;
  521. VAR prev, p, me: Process;
  522. BEGIN
  523. me := CurrentProcess();
  524. me.mode := Terminated;
  525. Unix.MtxLock( processList );
  526. prev := NIL; p := root;
  527. WHILE (p # NIL ) & (p # me) DO prev := p; p := p.nextProcess END;
  528. IF p = me THEN
  529. IF prev = NIL THEN root := p.nextProcess ELSE prev.nextProcess := p.nextProcess END;
  530. END;
  531. Unix.MtxUnlock( processList );
  532. Unix.ThrExit( );
  533. END Exit;
  534. PROCEDURE ExitTrap*;
  535. VAR p: Process;
  536. BEGIN
  537. p := CurrentProcess();
  538. (* restart the object body if it was given the SAFE flag *)
  539. IF Restart IN p.flags THEN
  540. Unix.siglongjmp( ADDRESSOF( p.state0[0] ), 1 )
  541. END;
  542. Exit
  543. END ExitTrap;
  544. (*---------------------------- Timer --------------------------------*)
  545. PROCEDURE Remove( t: Timer ); (* remove timer from list of active timers *)
  546. VAR p, x: Timer;
  547. BEGIN
  548. Unix.MtxLock( timerListMutex );
  549. t.trigger := 0; t.handler := NIL;
  550. IF timers # NIL THEN
  551. IF t = timers THEN
  552. timers := t.next
  553. ELSE
  554. p := timers; x := p.next;
  555. WHILE (x # NIL) & (x # t) DO p := x; x := p.next END;
  556. IF x = t THEN p.next := t.next END
  557. END;
  558. t.next := NIL
  559. END;
  560. Unix.MtxUnlock( timerListMutex )
  561. END Remove;
  562. PROCEDURE Insert( t: Timer );
  563. VAR p, x: Timer;
  564. BEGIN
  565. Unix.MtxLock( timerListMutex );
  566. p := NIL; x := timers;
  567. WHILE (x # NIL) & (x.trigger < t.trigger) DO p := x; x := p.next END;
  568. t.next := x;
  569. IF p = NIL THEN timers := t ELSE p.next := t END;
  570. Unix.MtxUnlock( timerListMutex )
  571. END Insert;
  572. PROCEDURE SetTimeout*( t: Timer; h: EventHandler; ms: LONGINT );
  573. BEGIN
  574. ASSERT( ( t # NIL) & ( h # NIL) );
  575. Remove( t );
  576. IF ms < 1 THEN ms := 1 END;
  577. t.trigger := Machine.ticks + ms; t.handler := h;
  578. Insert( t );
  579. timerActivity.Restart
  580. END SetTimeout;
  581. PROCEDURE SetTimeoutAt*( t: Timer; h: EventHandler; ms: LONGINT );
  582. BEGIN
  583. ASSERT( (t # NIL) & (h # NIL) );
  584. Remove( t );
  585. t.trigger := ms; t.handler := h;
  586. Insert( t );
  587. timerActivity.Restart
  588. END SetTimeoutAt;
  589. PROCEDURE CancelTimeout*( t: Timer );
  590. BEGIN
  591. Remove( t )
  592. END CancelTimeout;
  593. (*-------------------- Garbage Collection ------------------------------------*)
  594. PROCEDURE GetContext( ctxt: Unix.Ucontext );
  595. VAR t: Process; context: Unix.McontextDesc;
  596. BEGIN
  597. t := CurrentProcess( );
  598. Unix.CopyContext( ctxt.mc, context );
  599. t.state.PC := context.r_pc;
  600. t.state.BP := context.r_bp;
  601. t.state.SP := context.r_sp
  602. END GetContext;
  603. (* called by WMProcessInfo to obtain the current state of a running process *)
  604. PROCEDURE UpdateProcessState*( p: Process );
  605. BEGIN
  606. IF p.threadId = Unix.ThrThis( ) THEN
  607. p.state.PC := Machine.CurrentPC( );
  608. p.state.BP := Machine.CurrentBP( );
  609. p.state.SP := Machine.CurrentSP( )
  610. ELSE
  611. IF p.mode = Running THEN
  612. timerStopped := TRUE;
  613. Unix.ThrSleep( 3 );
  614. IF p.mode = Running THEN (* still running *)
  615. Unix.ThrSuspend( p.threadId, TRUE );
  616. Unix.ThrResume( p.threadId );
  617. END;
  618. timerStopped := FALSE
  619. END
  620. END
  621. END UpdateProcessState;
  622. PROCEDURE SuspendActivities;
  623. VAR t, me: Process;
  624. BEGIN
  625. me := CurrentProcess();
  626. t := root;
  627. WHILE t # NIL DO
  628. IF t # me THEN
  629. Unix.ThrSuspend( t.threadId, t.mode = Running );
  630. END;
  631. t := t.nextProcess
  632. END;
  633. END SuspendActivities;
  634. PROCEDURE ResumeActivities;
  635. VAR t, me: Process;
  636. BEGIN
  637. me := CurrentProcess();
  638. t := root;
  639. WHILE t # NIL DO
  640. IF (t # me) THEN
  641. Unix.ThrResume( t.threadId );
  642. END;
  643. t := t.nextProcess
  644. END;
  645. END ResumeActivities;
  646. PROCEDURE GCLoop*; (* Timer and GC activity *)
  647. BEGIN
  648. (*
  649. If using BootConsole keep main thread running.
  650. If the thread is blocked by a mutex (MainThreadSleep)
  651. the signals SIGHUP, SIGINT and SIGQUIT don't branch into SignalHandler
  652. but terminate A2 (at least in Solaris).
  653. *)
  654. SystemA2Up := TRUE;
  655. LOOP Sleep( 100 ) END
  656. END GCLoop;
  657. PROCEDURE CurrentProcessTime*(): HUGEINT;
  658. BEGIN
  659. RETURN Machine.GetTimer()
  660. END CurrentProcessTime;
  661. PROCEDURE TimerFrequency*(): HUGEINT;
  662. BEGIN
  663. RETURN Machine.mhz * 1000000
  664. END TimerFrequency;
  665. PROCEDURE LeaveA2;
  666. VAR cur: Process; bp, n: ADDRESS;
  667. BEGIN
  668. IF clock = NIL THEN RETURN END;
  669. cur := CurrentProcess();
  670. IF cur # NIL THEN
  671. bp := Machine.CurrentBP();
  672. S.GET( bp, n );
  673. IF ODD( n ) THEN S.GET( bp + SIZEOF( ADDRESS ), bp ) ELSE bp := n END;
  674. cur.state.BP := bp;
  675. END;
  676. END LeaveA2;
  677. PROCEDURE ReenterA2;
  678. VAR cur: Process;
  679. BEGIN
  680. IF clock = NIL THEN RETURN END;
  681. cur := CurrentProcess();
  682. IF cur # NIL THEN
  683. cur.state.BP := 0;
  684. END;
  685. END ReenterA2;
  686. (*----------------------------- initialization ----------------------------------*)
  687. PROCEDURE StartTimerActivity;
  688. BEGIN
  689. timerListMutex := Unix.NewMtx( ); timers := NIL;
  690. NEW( timerActivity );
  691. END StartTimerActivity;
  692. PROCEDURE GetStacksize;
  693. VAR str: ARRAY 32 OF CHAR; i: LONGINT;
  694. BEGIN
  695. Machine.GetConfig( "StackSize", str );
  696. IF str = "" THEN stacksize := DefaultStacksize
  697. ELSE
  698. i := 0; stacksize := Machine.StrToInt( i, str );
  699. stacksize := stacksize * 1024;
  700. END;
  701. IF Glue.debug # {} THEN
  702. Trace.String( "Stacksize of active objects = " );
  703. Trace.Int( stacksize DIV 1024, 0 ); Trace.StringLn( "K" )
  704. END;
  705. END GetStacksize;
  706. PROCEDURE Convert;
  707. VAR p: Process;
  708. BEGIN
  709. (* make current thread the first active object *)
  710. mainthread := Unix.ThrThis();
  711. NEW( p, NIL, NIL, 0, {}, 0 );
  712. END Convert;
  713. PROCEDURE Init;
  714. BEGIN
  715. Unix.suspendHandler := GetContext;
  716. createProcess := Unix.NewMtx( ); processList := Unix.NewMtx( );
  717. startProcess := Unix.NewMtx( ); childrunning := Unix.NewCond( );
  718. lockMutex := Unix.NewMtx( );
  719. processPointer := Unix.NewKey( );
  720. GetStacksize;
  721. Convert;
  722. NEW( clock ); StartTimerActivity; timerStopped := FALSE;
  723. NEW( finalizerCaller );
  724. Heaps.gcStatus := GCStatusFactory()
  725. END Init;
  726. TYPE
  727. MainThread = OBJECT
  728. VAR exit: BOOLEAN;
  729. PROCEDURE & Init;
  730. BEGIN
  731. exit := FALSE;
  732. END Init;
  733. PROCEDURE Await();
  734. BEGIN {EXCLUSIVE}
  735. AWAIT( exit );
  736. END Await;
  737. END MainThread;
  738. VAR main: MainThread;
  739. PROCEDURE MainThreadSleep;
  740. BEGIN
  741. NEW( main );
  742. main.Await( );
  743. Unix.exit( 0 );
  744. END MainThreadSleep;
  745. PROCEDURE {FINAL} Final;
  746. BEGIN
  747. MainThreadSleep;
  748. END Final;
  749. PROCEDURE GCStatusFactory(): Heaps.GCStatus;
  750. VAR gcStatusExt : GCStatusExt;
  751. BEGIN
  752. ASSERT( Heaps.gcStatus = NIL );
  753. NEW( gcStatusExt );
  754. RETURN gcStatusExt
  755. END GCStatusFactory;
  756. VAR
  757. (* for compatibility and later extension *)
  758. TraceProcessHook*: PROCEDURE (prcoess: Process; pc, bp: ADDRESS; stacklow, stackhigh: ADDRESS);
  759. BEGIN
  760. TraceProcessHook := NIL;
  761. SystemA2Up := FALSE;
  762. Init;
  763. END Objects.