Generic.Unix.Objects.Mod 24 KB

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