Generic.Unix.Objects.Mod 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920
  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 > 1024) & (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<1024) ,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.Objects);
  273. Machine.Acquire( Machine.Heaps );
  274. cur.context.r_sp := Machine.CurrentSP();
  275. cur.context.r_bp := Machine.CurrentBP();
  276. cur.context.r_pc := ADDRESS OF GCLoop;
  277. TRACE(cur, cur.threadId, cur.context.r_sp, cur.context.r_bp, cur.context.r_pc);
  278. SuspendActivities;
  279. Heaps.CollectGarbage( Modules.root );
  280. Machine.Release( Machine.Heaps );
  281. Machine.Release(Machine.Objects);
  282. ResumeActivities;
  283. finalizerCaller.Activate;
  284. END;
  285. END SetgcOngoing;
  286. END GCStatusExt;
  287. PROCEDURE BodyStarter;
  288. VAR p{UNTRACED}: Process; res: LONGINT; prevBP: ADDRESS; i: LONGINT;
  289. BEGIN
  290. Unix.MtxLock( startProcess );
  291. p := newProcess; newProcess := NIL;
  292. p.threadId := Unix.ThrThis(0);
  293. p.id := nextPID; INC( nextPID );
  294. p.stackBottom := Machine.CurrentBP( );
  295. S.GET( p.stackBottom, prevBP );
  296. S.PUT( prevBP, S.VAL( ADDRESS, 0 ) ); (* for terminating Reflection.StackTraceBack *)
  297. Unix.MtxLock( processList );
  298. p.nextProcess := root; root := p;
  299. Unix.MtxUnlock( processList );
  300. Unix.ConSignal( childrunning );
  301. Unix.MtxUnlock( startProcess );
  302. p.SetPriority( p.priority );
  303. (*!
  304. IF Restart IN p.flags THEN
  305. res := Unix.sigsetjmp( ADDRESSOF( p.state0[0] ), 1 );
  306. END;
  307. *)
  308. p.mode := Running;
  309. p.body( p.obj );
  310. p.mode := Terminated;
  311. Exit
  312. END BodyStarter;
  313. (*--------------------- create, lock, await, unlock -------------------------*)
  314. PROCEDURE InitProtHeader( hdr: ObjectHeader );
  315. VAR lock: LockT;
  316. BEGIN
  317. NEW(lock);
  318. hdr.lock := lock;
  319. lock.mtx := Unix.MtxInit( 0 ); lock.enter := Unix.ConInit( 0 ); hdr.lockedBy := NIL;
  320. END InitProtHeader;
  321. PROCEDURE CreateProcess*( body: Body; priority: LONGINT; flags: SET; obj: ProtectedObject );
  322. VAR p: Process; hdr: ObjectHeader;
  323. BEGIN
  324. Unix.MtxLock( createProcess );
  325. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr ); InitProtHeader( hdr );
  326. IF priority = 0 THEN priority := Normal END;
  327. NEW( p, obj, body, priority, flags, stacksize ) ; (* execute BodyStarter as new (posix or solaris) thread *)
  328. Unix.MtxUnlock( createProcess );
  329. RegisterFinalizer( obj, FinalizeActiveObj )
  330. END CreateProcess;
  331. PROCEDURE Lock*( obj: ProtectedObject; exclusive: BOOLEAN );
  332. VAR hdr: ObjectHeader; p: Process; lock: LockT;
  333. BEGIN
  334. ASSERT( exclusive ); (* shared not implemented yet *)
  335. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr );
  336. p := CurrentProcess();
  337. p.mode := AwaitingLock;
  338. IF hdr.lock = NIL THEN InitProtHeader( hdr ) END;
  339. lock := S.VAL(LockT, hdr.lock);
  340. Unix.MtxLock( lock.mtx );
  341. WHILE hdr.lockedBy # NIL DO
  342. (* wait until threads with complied AWAIT conditions have left the monitor *)
  343. Unix.ConWait( lock.enter, lock.mtx );
  344. END;
  345. p.mode := Running; hdr.lockedBy := p; p.waitingOn := NIL
  346. END Lock;
  347. PROCEDURE Await*( cond: Condition; slink: ADDRESS; obj: ProtectedObject; flags: SET );
  348. VAR hdr: ObjectHeader; p, c: Process; lock: LockT;
  349. BEGIN
  350. IF 1 IN flags THEN (* compiler did not generate IF *)
  351. IF cond( slink ) THEN (* condition already true *) RETURN END
  352. END;
  353. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr ); c := NIL;
  354. lock := S.VAL(LockT, hdr.lock);
  355. IF hdr.awaitingCond.head # NIL THEN c := FindCondition( hdr.awaitingCond ) END;
  356. p := CurrentProcess(); p.succ := NIL; p.condition := cond; p.condFP := slink;
  357. p.waitingOn := obj; p.mode := AwaitingCond;
  358. Put( hdr.awaitingCond, p );
  359. hdr.lockedBy := c;
  360. IF c # NIL THEN Unix.ConSignal( c.continue ) ELSE Unix.ConSignal( lock.enter ) END;
  361. Unix.ConWait( p.continue, lock.mtx );
  362. p.mode := Running; hdr.lockedBy := p; p.waitingOn := NIL
  363. END Await;
  364. PROCEDURE Unlock*( obj: ProtectedObject; dummy: BOOLEAN );
  365. VAR hdr: ObjectHeader; c: Process; lock: LockT;
  366. BEGIN
  367. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr ); c := NIL;
  368. lock := S.VAL(LockT,hdr.lock);
  369. IF hdr.awaitingCond.head # NIL THEN c := FindCondition( hdr.awaitingCond ) END;
  370. hdr.lockedBy := c;
  371. IF c # NIL THEN Unix.ConSignal( c.continue ) ELSE Unix.ConSignal( lock.enter ) END;
  372. Unix.MtxUnlock( lock.mtx );
  373. END Unlock;
  374. PROCEDURE FindCondition( VAR q: ProcessQueue ): Process;
  375. VAR first, cand: Process;
  376. BEGIN
  377. Get( q, first );
  378. IF first.condition( first.condFP ) THEN RETURN first ELSE Put( q, first ) END;
  379. WHILE q.head # first DO
  380. Get( q, cand );
  381. IF cand.condition( cand.condFP ) THEN RETURN cand ELSE Put( q, cand ) END;
  382. END;
  383. RETURN NIL
  384. END FindCondition;
  385. PROCEDURE Get( VAR queue: ProcessQueue; VAR new: Process );
  386. VAR t: Process;
  387. BEGIN
  388. t := queue.head(Process);
  389. IF t # NIL THEN
  390. IF t = queue.tail THEN queue.head := NIL; queue.tail := NIL
  391. ELSE queue.head := t.succ; t.succ := NIL
  392. END
  393. END;
  394. new := t
  395. END Get;
  396. PROCEDURE Put( VAR queue: ProcessQueue; t: Process );
  397. BEGIN
  398. IF queue.head = NIL THEN queue.head := t ELSE queue.tail(Process).succ := t END;
  399. queue.tail := t
  400. END Put;
  401. (*-------------------------------------------------------------------------*)
  402. PROCEDURE Terminate*;
  403. BEGIN
  404. Exit
  405. END Terminate;
  406. PROCEDURE TerminateThis*( p: Process; unbreakable: BOOLEAN );
  407. BEGIN
  408. p.mode := Terminated;
  409. p.Cancel
  410. END TerminateThis;
  411. PROCEDURE SetPriority*( pri: LONGINT ); (* Set the current process' priority. *)
  412. VAR me: Process;
  413. BEGIN
  414. me := CurrentProcess();
  415. me.SetPriority( pri )
  416. END SetPriority;
  417. PROCEDURE Sleep*( ms: LONGINT );
  418. BEGIN
  419. Unix.ThrSleep( ms )
  420. END Sleep;
  421. PROCEDURE Yield*; (* Relinquish control. *)
  422. BEGIN
  423. Unix.ThrYield(0);
  424. END Yield;
  425. (* Return current process. (DEPRECATED, use ActiveObject) *)
  426. PROCEDURE CurrentProcess*( ): Process;
  427. VAR me: Unix.Thread_t; p: Process;
  428. BEGIN
  429. me := Unix.ThrThis(0);
  430. Unix.MtxLock( processList );
  431. p := root;
  432. WHILE (p # NIL) & (p.threadId # me) DO p := p.nextProcess END;
  433. Unix.MtxUnlock( processList );
  434. RETURN p
  435. END CurrentProcess;
  436. (* Return the active object currently executing. *)
  437. PROCEDURE ActiveObject*( ): ANY;
  438. VAR p: Process;
  439. BEGIN
  440. p := CurrentProcess();
  441. RETURN p.obj
  442. END ActiveObject;
  443. (* Return stack bottom of process. For compatibility WinAos/UnixAos/NativeAos *)
  444. PROCEDURE GetStackBottom*(p: Process): ADDRESS;
  445. BEGIN
  446. RETURN p.stackBottom
  447. END GetStackBottom;
  448. PROCEDURE GetProcessID*( ): LONGINT;
  449. VAR p: Process;
  450. BEGIN
  451. p := CurrentProcess();
  452. RETURN p.id;
  453. END GetProcessID;
  454. PROCEDURE GetCpuCycles*( process : Process; VAR cpuCycles: CpuCyclesArray; all: BOOLEAN );
  455. VAR i: LONGINT;
  456. BEGIN
  457. ASSERT( process # NIL );
  458. FOR i := 0 TO Machine.MaxCPU-1 DO cpuCycles[i] := 0 END;
  459. END GetCpuCycles;
  460. (*-----------------------------------------------------------------------*)
  461. PROCEDURE min( a, b: LONGINT ): LONGINT;
  462. BEGIN
  463. IF a <= b THEN RETURN a ELSE RETURN b END
  464. END min;
  465. PROCEDURE max( a, b: LONGINT ): LONGINT;
  466. BEGIN
  467. IF a >= b THEN RETURN a ELSE RETURN b END
  468. END max;
  469. PROCEDURE RegisterFinalizer( obj: ANY; fin: Heaps.Finalizer );
  470. VAR n: Heaps.FinalizerNode;
  471. BEGIN
  472. NEW( n ); n.finalizer := fin; Heaps.AddFinalizer( obj, n );
  473. END RegisterFinalizer;
  474. PROCEDURE FinalizeActiveObj( obj: ANY );
  475. VAR p: Process;
  476. BEGIN
  477. Unix.MtxLock( processList );
  478. p := root;
  479. WHILE (p # NIL) & (p.obj # obj) DO p := p.nextProcess END;
  480. Unix.MtxUnlock( processList );
  481. IF (p # NIL) & (p.obj = obj) THEN
  482. p.mode := Terminated;
  483. Unix.ConDestroy( p.continue ); p.continue := 0;
  484. FinalizeProtObject( obj );
  485. p.Cancel
  486. END;
  487. END FinalizeActiveObj;
  488. PROCEDURE FinalizeProtObject( obj: ANY );
  489. VAR hdr: ObjectHeader; lock: LockT;
  490. BEGIN
  491. S.GET( S.VAL( ADDRESS, obj ) + Heaps.HeapBlockOffset, hdr );
  492. IF hdr.lock # NIL THEN
  493. lock := S.VAL(LockT, hdr.lock);
  494. Unix.MtxDestroy( lock.mtx ); lock.mtx := 0
  495. END
  496. END FinalizeProtObject;
  497. PROCEDURE FinalizeProcess( obj: ANY );
  498. VAR p: Process;
  499. BEGIN
  500. p := obj(Process);
  501. IF p.continue # 0 THEN
  502. Unix.ConDestroy( p.continue ); p.continue := 0
  503. END
  504. END FinalizeProcess;
  505. (* Terminate calling thread. *)
  506. PROCEDURE Exit;
  507. VAR prev, p, me: Process;
  508. BEGIN
  509. me := CurrentProcess();
  510. me.mode := Terminated;
  511. Unix.MtxLock( processList );
  512. prev := NIL; p := root;
  513. WHILE (p # NIL ) & (p # me) DO prev := p; p := p.nextProcess END;
  514. IF p = me THEN
  515. IF prev = NIL THEN root := p.nextProcess ELSE prev.nextProcess := p.nextProcess END;
  516. END;
  517. Unix.MtxUnlock( processList );
  518. Unix.ThrExit(0);
  519. END Exit;
  520. PROCEDURE ExitTrap*;
  521. VAR p: Process;
  522. BEGIN
  523. p := CurrentProcess();
  524. (* restart the object body if it was given the SAFE flag *)
  525. IF Restart IN p.flags THEN
  526. Unix.siglongjmp( ADDRESSOF( p.state0[0] ), 1 )
  527. END;
  528. Exit
  529. END ExitTrap;
  530. (*---------------------------- Timer --------------------------------*)
  531. PROCEDURE Remove( t: Timer ); (* remove timer from list of active timers *)
  532. VAR p, x: Timer;
  533. BEGIN
  534. Unix.MtxLock( timerListMutex );
  535. t.trigger := 0; t.handler := NIL;
  536. IF timers # NIL THEN
  537. IF t = timers THEN
  538. timers := t.next
  539. ELSE
  540. p := timers; x := p.next;
  541. WHILE (x # NIL) & (x # t) DO p := x; x := p.next END;
  542. IF x = t THEN p.next := t.next END
  543. END;
  544. t.next := NIL
  545. END;
  546. Unix.MtxUnlock( timerListMutex )
  547. END Remove;
  548. PROCEDURE Insert( t: Timer );
  549. VAR p, x: Timer;
  550. BEGIN
  551. Unix.MtxLock( timerListMutex );
  552. p := NIL; x := timers;
  553. WHILE (x # NIL) & (x.trigger < t.trigger) DO p := x; x := p.next END;
  554. t.next := x;
  555. IF p = NIL THEN timers := t ELSE p.next := t END;
  556. Unix.MtxUnlock( timerListMutex )
  557. END Insert;
  558. PROCEDURE SetTimeout*( t: Timer; h: EventHandler; ms: LONGINT );
  559. BEGIN
  560. ASSERT( ( t # NIL) & ( h # NIL) );
  561. Remove( t );
  562. IF ms < 1 THEN ms := 1 END;
  563. t.trigger := Machine.ticks + ms; t.handler := h;
  564. Insert( t );
  565. timerActivity.Restart
  566. END SetTimeout;
  567. PROCEDURE SetTimeoutAt*( t: Timer; h: EventHandler; ms: LONGINT );
  568. BEGIN
  569. ASSERT( (t # NIL) & (h # NIL) );
  570. Remove( t );
  571. t.trigger := ms; t.handler := h;
  572. Insert( t );
  573. timerActivity.Restart
  574. END SetTimeoutAt;
  575. PROCEDURE CancelTimeout*( t: Timer );
  576. BEGIN
  577. Remove( t )
  578. END CancelTimeout;
  579. (*-------------------- Garbage Collection ------------------------------------*)
  580. PROCEDURE GetContext(ctxt: Unix.Ucontext);
  581. VAR t: Process;
  582. BEGIN
  583. t := CurrentProcess();
  584. TRACE(t, t.threadId);
  585. Unix.CopyContext(ctxt.mc, t.context);
  586. END GetContext;
  587. PROCEDURE SuspendActivities;
  588. VAR t,me: Process; res: LONGINT;
  589. BEGIN
  590. me := CurrentProcess();
  591. t := root;
  592. WHILE t # NIL DO
  593. IF (t # me) THEN
  594. Unix.ThrSuspend(t.threadId );
  595. END;
  596. t := t.nextProcess
  597. END;
  598. (*
  599. VAR t, me: Process;
  600. BEGIN
  601. t := root;
  602. WHILE t # NIL DO
  603. IF (t # mainProcess) & (t # finCaller) THEN Unix.ThrSuspend( t.threadId ) END;
  604. t := t.nextProcess
  605. END;
  606. *)
  607. END SuspendActivities;
  608. PROCEDURE ResumeActivities;
  609. VAR t, me: Process;
  610. BEGIN
  611. me := CurrentProcess();
  612. t := root;
  613. WHILE t # NIL DO
  614. IF (t # me) (* (t # mainProcess) & (t # finCaller)*) THEN Unix.ThrResume( t.threadId ) END;
  615. t := t.nextProcess
  616. END;
  617. END ResumeActivities;
  618. (*
  619. PROCEDURE InvokeGC;
  620. BEGIN
  621. IF Machine.AcquireGC() THEN (* gets released by FinalizerCaller *)
  622. collect := TRUE;
  623. Unix.ConWait( gcFinished, igc )
  624. END;
  625. END InvokeGC;
  626. *)
  627. (*! GCLoop gets called as last procedure in BootConsole (main thread).
  628. The stack of the main thread is not limited by the boot parameter 'StackSize' !!
  629. *)
  630. PROCEDURE GCLoop*; (* Timer and GC activity *)
  631. VAR cur: Process;
  632. BEGIN
  633. RETURN;
  634. (*
  635. cur:= CurrentProcess();
  636. SetPriority( GCPriority );
  637. LOOP
  638. IF collect THEN
  639. TRACE(collect);
  640. collect := FALSE;
  641. Machine.Acquire( Machine.Heaps );
  642. cur.context.r_sp := Machine.CurrentSP();
  643. cur.context.r_bp := Machine.CurrentBP();
  644. cur.context.r_sp := ADDRESS OF GCLoop;
  645. SuspendActivities;
  646. Heaps.CollectGarbage( Modules.root );
  647. Machine.Release( Machine.Heaps );
  648. ResumeActivities;
  649. finalizerCaller.Activate;
  650. (*Unix.ConSignal( gcFinished );*)
  651. ELSE
  652. Unix.ThrSleep( 10 );
  653. END;
  654. timerActivity.UpdateTicks
  655. END
  656. *)
  657. END GCLoop;
  658. PROCEDURE CurrentProcessTime*(): HUGEINT;
  659. BEGIN
  660. RETURN Machine.GetTimer()
  661. END CurrentProcessTime;
  662. PROCEDURE TimerFrequency*(): HUGEINT;
  663. BEGIN
  664. RETURN Machine.mhz * 1000000
  665. END TimerFrequency;
  666. (*----------------------------- initialization ----------------------------------*)
  667. PROCEDURE StartTimerActivity;
  668. BEGIN
  669. timerListMutex := Unix.MtxInit(0); timers := NIL;
  670. NEW( timerActivity );
  671. END StartTimerActivity;
  672. PROCEDURE GetStacksize;
  673. VAR str: ARRAY 32 OF CHAR; i: LONGINT;
  674. BEGIN
  675. Machine.GetConfig( "StackSize", str );
  676. IF str = "" THEN stacksize := DefaultStacksize
  677. ELSE
  678. i := 0; stacksize := Machine.StrToInt( i, str );
  679. stacksize := stacksize * 1024;
  680. END;
  681. IF Glue.debug # {} THEN
  682. Trace.String( "Stacksize of active objects = " );
  683. Trace.Int( stacksize DIV 1024, 0 ); Trace.StringLn( "K" )
  684. END;
  685. END GetStacksize;
  686. PROCEDURE Convert;
  687. VAR p: Process;
  688. BEGIN
  689. (* make current thread the first active object *)
  690. NEW( p, NIL, NIL, 0, {}, 0 );
  691. END Convert;
  692. PROCEDURE Init;
  693. BEGIN
  694. TRACE("Init");
  695. Unix.suspendHandler := GetContext;
  696. (*
  697. Unix.Dlsym( 0, "Unix.MtxInit", ADDRESSOF( Unix.MtxInit ) );
  698. Unix.Dlsym( 0, "Unix.MtxDestroy", ADDRESSOF( Unix.MtxDestroy ) );
  699. Unix.Dlsym( 0, "Unix.MtxLock", ADDRESSOF( Unix.MtxLock ) );
  700. Unix.Dlsym( 0, "Unix.MtxUnlock", ADDRESSOF( Unix.MtxUnlock ) );
  701. Unix.Dlsym( 0, "Unix.ConInit", ADDRESSOF( Unix.ConInit ) );
  702. Unix.Dlsym( 0, "Unix.ConDestroy", ADDRESSOF( Unix.ConDestroy ) );
  703. Unix.Dlsym( 0, "Unix.ConWait", ADDRESSOF( Unix.ConWait ) );
  704. Unix.Dlsym( 0, "Unix.ConSignal", ADDRESSOF( Unix.ConSignal ) );
  705. Unix.Dlsym( 0, "thrStart", ADDRESSOF( thrStart ) );
  706. Unix.Dlsym( 0, "Unix.ThrThis", ADDRESSOF( Unix.ThrThis ) );
  707. Unix.Dlsym( 0, "Unix.ThrSleep", ADDRESSOF( Unix.ThrSleep ) );
  708. Unix.Dlsym( 0, "Unix.ThrYield", ADDRESSOF( Unix.ThrYield ) );
  709. Unix.Dlsym( 0, "Unix.ThrExit", ADDRESSOF( Unix.ThrExit ) );
  710. Unix.Dlsym( 0, "Unix.ThrSuspend", ADDRESSOF( Unix.ThrSuspend ) );
  711. Unix.Dlsym( 0, "Unix.ThrResume", ADDRESSOF( Unix.ThrResume ) );
  712. Unix.Dlsym( 0, "Unix.ThrGetPriority", ADDRESSOF( Unix.ThrGetPriority ) );
  713. Unix.Dlsym( 0, "Unix.ThrSetPriority", ADDRESSOF( Unix.ThrSetPriority ) );
  714. Unix.Dlsym( 0, "thrKill", ADDRESSOF( thrKill ) );
  715. *)
  716. createProcess := Unix.MtxInit( 0 ); processList := Unix.MtxInit( 0 );
  717. startProcess := Unix.MtxInit(0); childrunning := Unix.ConInit(0);
  718. collect := FALSE;
  719. igc := Unix.MtxInit( 0 ); gcFinished := Unix.ConInit( 0 );
  720. GetStacksize;
  721. Convert;
  722. StartTimerActivity;
  723. NEW( finalizerCaller );
  724. (*
  725. Heaps.saveSP := SaveSP;
  726. *)
  727. Heaps.gcStatus := GCStatusFactory()
  728. (*
  729. Heaps.GC := InvokeGC;
  730. Heaps.InvokeGC := InvokeGC;
  731. *)
  732. END Init;
  733. PROCEDURE {FINAL} Final;
  734. BEGIN
  735. TRACE("FINAL END ");
  736. LOOP Unix.ThrSleep( 10 ) END;
  737. Machine.Shutdown(FALSE);
  738. END Final;
  739. PROCEDURE GCStatusFactory(): Heaps.GCStatus;
  740. VAR gcStatusExt : GCStatusExt;
  741. BEGIN
  742. ASSERT(Heaps.gcStatus = NIL);
  743. NEW(gcStatusExt);
  744. RETURN gcStatusExt
  745. END GCStatusFactory;
  746. BEGIN
  747. TRACE("Objects.Body1");
  748. Init;
  749. TRACE("Objects.Body2");
  750. END Objects.