Generic.Unix.Objects.Mod 24 KB

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