Generic.Unix.Objects.Mod 24 KB

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