Win32.Objects.Mod 47 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402
  1. (* Aos, Copyright 2001, Pieter Muller, ETH Zurich; this module ported for the windows version, fof. *)
  2. MODULE Objects; (** AUTHOR "pjm, ejz, fof"; PURPOSE "Active object runtime support"; *)
  3. IMPORT SYSTEM, Trace, Kernel32, Machine, Modules, Heaps;
  4. CONST
  5. HandleExcp = TRUE; (* FALSE -> we asume that it is done correctly by Traps *)
  6. TraceVerbose = FALSE;
  7. StrongChecks = FALSE; defaultStackSize = 0;
  8. TraceOpenClose = FALSE;
  9. CONST
  10. (* Process flags *)
  11. Restart* = 0; (* Restart/Destroy process on exception *)
  12. PleaseHalt* = 10; (* Process requested to Halt itself soon *)
  13. Unbreakable* = 11;
  14. SelfTermination* = 12;
  15. Preempted* = 27; (* Has been preempted. *)
  16. Resistant* = 28; (* Can only be destroyed by itself *)
  17. PleaseStop* = 31; (* Process requested to Terminate or Halt itself soon *)
  18. InActive* = 26; (* needed to prevent processes to call finalizers while in await or lock or unlock, see Kernel.GC *)
  19. (** Process modes *)
  20. Unknown* = 0; Ready* = 1; (* for compatibility with native A2 *)
  21. Running* = 2; AwaitingLock* = 3; AwaitingCond* = 4; AwaitingEvent* = 5; Suspended* = 6; Terminated* = 7;
  22. (** Process priorities *)
  23. MinPriority = 0; (* only system idle processes run at this priority level *)
  24. Low* = 1; Normal* = 2; High* = 3; (* "user" priorities *)
  25. GCPriority* = 4; (* priority of garbage collector *)
  26. Realtime* = 5; (* reserved for interrupt handling and realtime apps, these processes are not allowed to allocate memory *)
  27. (* Process termination halt codes *)
  28. halt* = 2222;
  29. haltUnbreakable* = 2223;
  30. (* constant used in GC Process.FindPointers *)
  31. InitDiff = MAX(LONGINT);
  32. AddressSize = SIZEOF (ADDRESS);
  33. TYPE
  34. CpuCyclesArray* = ARRAY Machine.MaxCPU OF HUGEINT;
  35. ProtectedObject = POINTER TO RECORD END; (* protected object (10000) *)
  36. ProcessQueue = Heaps.ProcessQueue;
  37. Body = PROCEDURE (self: ProtectedObject);
  38. Condition = PROCEDURE (slink: ADDRESS): BOOLEAN;
  39. EventHandler* = PROCEDURE {DELEGATE};
  40. RealtimeEventHandler* = PROCEDURE {DELEGATE, REALTIME};
  41. Timer* = POINTER TO RECORD
  42. next, prev : Timer;
  43. trigger: LONGINT;
  44. handler: EventHandler
  45. END;
  46. RealtimeTimer* = POINTER TO RECORD
  47. next, prev: RealtimeTimer;
  48. trigger: LONGINT;
  49. handler: RealtimeEventHandler
  50. END;
  51. Clock = OBJECT
  52. VAR h: Timer;
  53. ticks: LONGINT;
  54. hevent: Kernel32.HANDLE;
  55. res: Kernel32.BOOL;
  56. mode: LONGINT;
  57. process: Process;
  58. PROCEDURE Wakeup;
  59. VAR res: Kernel32.BOOL;
  60. BEGIN {EXCLUSIVE}
  61. res := Kernel32.SetEvent(hevent)
  62. END Wakeup;
  63. PROCEDURE Finalize(ptr: ANY);
  64. VAR res: Kernel32.BOOL;
  65. BEGIN
  66. IF hevent # 0 THEN res := Kernel32.CloseHandle(hevent); hevent := 0 END
  67. END Finalize;
  68. PROCEDURE &Init*;
  69. VAR fn: Heaps.FinalizerNode;
  70. BEGIN
  71. hevent := Kernel32.CreateEvent(NIL, 0, 0, NIL);
  72. ASSERT(hevent # 0);
  73. NEW(fn); fn.finalizer := SELF.Finalize; Heaps.AddFinalizer(SELF, fn)
  74. END Init;
  75. BEGIN {ACTIVE, SAFE, PRIORITY(High)}
  76. process := CurrentProcess();
  77. mode := process.mode;
  78. LOOP
  79. Machine.Acquire(Machine.Objects);
  80. process.mode := mode;
  81. LOOP
  82. h := event.next; (* event: head of timer event queue *)
  83. ticks := Kernel32.GetTickCount();
  84. IF (h = event) OR (h.trigger - ticks > 0) THEN EXIT END;
  85. event.next := h.next; event.next.prev := event; (* unlink *)
  86. h.next := NIL; h.prev := NIL;
  87. Machine.Release(Machine.Objects);
  88. h.handler(); (* assume handler will return promptly *)
  89. Machine.Acquire(Machine.Objects)
  90. END;
  91. mode := process.mode;
  92. process.mode := AwaitingEvent;
  93. Machine.Release(Machine.Objects);
  94. IF h = event THEN (* sentinel head of timer event queue: wait forever until a new event has been entered in queue *)
  95. res := Kernel32.WaitForSingleObject(hevent, MAX(LONGINT));
  96. ELSE
  97. res := Kernel32.WaitForSingleObject(hevent, h.trigger - ticks);
  98. END;
  99. END
  100. END Clock;
  101. TYPE
  102. Win32Event = Kernel32.HANDLE;
  103. Process* = OBJECT(Heaps.ProcessLink)
  104. VAR
  105. rootedNext : Process; (* to prevent process to be GCed in WinAos *)
  106. obj-: ProtectedObject; (* associated active object *)
  107. state-: Kernel32.Context;
  108. (*
  109. sse: SSEState; (* fpu and sse state of preempted process (only valid if Preempted IN flag) *)
  110. sseAdr: LONGINT;
  111. *)
  112. condition-: Condition; (* awaited process' condition *)
  113. condFP-: LONGINT; (* awaited process' condition's context *)
  114. mode-: LONGINT; (* process state *) (* only changed inside Objects lock ??? *)
  115. procID-: LONGINT; (* processor ID where running, exported for compatibilty , useless in WinAos *)
  116. waitingOn-: ProtectedObject; (* obj this process is waiting on (for lock or condition) *)
  117. id-: LONGINT; (* unique process ID for tracing *)
  118. flags*: SET; (* process flags *)
  119. priority-: LONGINT; (* process priority *)
  120. (*
  121. currPri: LONGINT;
  122. stack*: Machine.Stack; (** user-level stack of process *)
  123. *)
  124. stackBottom: LONGINT;
  125. handle-: Kernel32.HANDLE; (* handle to corresponding Windows thread *)
  126. body: Body;
  127. event: Win32Event;
  128. restartPC-: LONGINT; (** entry point of body, for SAFE exception recovery *)
  129. restartSP-: LONGINT; (** stack level at start of body, for SAFE exception recovery *)
  130. (*
  131. perfCyc*: ARRAY Machine.MaxCPU OF HUGEINT;
  132. priInvCnt: LONGINT; (* counts the nummber of object locks hold that increased currPri of the process *)
  133. exp*: Machine.ExceptionState;
  134. oldReturnPC: LONGINT;
  135. *)
  136. lastThreadTimes: HUGEINT; (*ALEX 2005.12.12*)
  137. PROCEDURE FindRoots; (* override, called while GC, replaces Threads.CheckStacks *)
  138. VAR sp: LONGINT; res: Kernel32.BOOL; pc, bp, curbp: ADDRESS;
  139. n,adr: ADDRESS; desc: Modules.ProcedureDescPointer; i: LONGINT; p {UNTRACED}: ANY;
  140. name: ARRAY 256 OF CHAR;
  141. BEGIN
  142. IF (handle = 0) OR (mode = Terminated) OR (mode < Ready) (* procedure Wrapper not yet started *)
  143. OR (priority > High) (* stack of GC and realtime processes not traced *) THEN
  144. RETURN
  145. END;
  146. state.ContextFlags := Kernel32.ContextControl + Kernel32.ContextInteger;
  147. res := Kernel32.GetThreadContext( handle, state );
  148. IF SYSTEM.VAL( Process, Kernel32.TlsGetValue( tlsIndex ) ) = SELF THEN
  149. Trace.String("bp = "); Trace.Address(state.BP);
  150. Trace.String(" =?= "); Trace.Address(Machine.CurrentBP()); Trace.Ln;
  151. Trace.String("sp = "); Trace.Address(state.SP);
  152. Trace.String(" =?= "); Trace.Address(Machine.CurrentSP()); Trace.Ln;
  153. Trace.String("pc = "); Trace.Address(state.PC);
  154. Trace.String(" =?= "); Trace.Address(Machine.CurrentPC()); Trace.Ln;
  155. sp := Machine.CurrentSP(); bp :=Machine.CurrentBP(); pc := Machine.CurrentPC();
  156. ELSE
  157. sp := state.SP; bp := state.BP; pc := state.PC;
  158. END;
  159. ASSERT ( res # 0, 1004 );
  160. (* stack garbage collection *)
  161. IF Heaps.GCType= Heaps.HeuristicStackInspectionGC THEN
  162. Heaps.Candidate( state.EDI ); Heaps.Candidate( state.ESI );
  163. Heaps.Candidate( state.EBX ); Heaps.Candidate( state.EDX );
  164. Heaps.Candidate( state.ECX ); Heaps.Candidate( state.EAX );
  165. IF (stackBottom # 0) & (sp # 0) THEN
  166. Heaps.RegisterCandidates( sp, stackBottom - sp );
  167. END;
  168. ELSIF Heaps.GCType = Heaps.MetaDataForStackGC THEN
  169. IF WriteProcess # NIL THEN
  170. WriteProcess(SELF);Trace.Ln;
  171. END;
  172. Trace.String("Heuristic:"); Trace.Ln;
  173. Heaps.ReportCandidates(sp, stackBottom-sp);
  174. Trace.String("Metadata:"); Trace.Ln;
  175. Trace.String("sp = "); Trace.Address(sp); Trace.String(" bp= "); Trace.Address(bp);
  176. Trace.String("bot = "); Trace.Address(stackBottom); Trace.Ln;
  177. WHILE (bp # Heaps.NilVal) & (sp <= bp) & (bp <= stackBottom) DO
  178. Trace.String("proc ");
  179. IF WriteProc # NIL THEN
  180. WriteProc(pc); Trace.String("@ ");Trace.Address(bp); Trace.String(":"); Trace.Address(pc);
  181. END;
  182. SYSTEM.GET(bp, n);
  183. IF ODD(n) THEN (* procedure descriptor at bp *)
  184. Trace.String(" has descriptor"); Trace.Ln;
  185. DEC(n);
  186. desc := SYSTEM.VAL(Modules.ProcedureDescPointer, n);
  187. IF desc # NIL THEN
  188. IF WriteProc # NIL THEN
  189. Trace.String("proc from desc: "); WriteProc((desc.pcFrom+desc.pcLimit) DIV 2); Trace.Ln;
  190. END;
  191. FOR i := 0 TO LEN(desc.offsets)-1 DO
  192. adr := bp + desc.offsets[i]; (* pointer at offset *)
  193. SYSTEM.GET(adr, p); (* load pointer *)
  194. IF p # NIL THEN
  195. Trace.Int(desc.offsets[i],1); Trace.String(":"); Trace.Address(adr); Trace.String(":"); Trace.Address(p); Trace.Ln;
  196. Heaps.Mark(p);
  197. END;
  198. END;
  199. ELSE
  200. Trace.String("has nil desc: "); Trace.Ln;
  201. END;
  202. SYSTEM.GET(bp + 2*SIZEOF(ADDRESS), pc); (* next pc for tracing *)
  203. SYSTEM.GET(bp + SIZEOF(ADDRESS), bp);
  204. ELSE (* classical stack frame *)
  205. Trace.String(" has no descriptor"); Trace.Ln;
  206. SYSTEM.GET(bp + SIZEOF(ADDRESS), pc); (* next pc for tracing *)
  207. bp := n;
  208. END;
  209. Trace.String("next bp "); Trace.Address(bp); Trace.Ln;
  210. END;
  211. END;
  212. END FindRoots;
  213. END Process;
  214. VAR
  215. WriteProc* : PROCEDURE (pc: ADDRESS);
  216. WriteProcess*: PROCEDURE(p: Process);
  217. TYPE
  218. ExceptionHandler* = PROCEDURE( VAR context: Kernel32.Context;
  219. VAR excpRec: Kernel32.ExceptionRecord;
  220. VAR handled: BOOLEAN);
  221. GCStatusExt = OBJECT(Heaps.GCStatus)
  222. VAR
  223. (*
  224. gcOngoing: BOOLEAN;
  225. event: Kernel32.HANDLE;
  226. caller: Process;
  227. PROCEDURE &Init;
  228. BEGIN
  229. gcOngoing := FALSE;
  230. event := Kernel32.CreateEvent( NIL, Kernel32.False (* auto-reset *), Kernel32.False, NIL ); (* manual set event with initial state = reset *)
  231. ASSERT(event # 0);
  232. END Init;
  233. *)
  234. (*
  235. (* called from Heaps.InvokeGC, i.e. this is a hidden upcall. However, it is necessary to take the Machine.Objects lock here since writing
  236. 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
  237. if the lock is not taken. *)
  238. PROCEDURE SetgcOngoing(value: BOOLEAN);
  239. VAR p: Heaps.ProcessLink; cur, r: Process; res: Kernel32.BOOL; num: LONGINT;
  240. BEGIN (* serialize writers *)
  241. IF value THEN
  242. (* Low, Medium or High priority process calls this *)
  243. Machine.Acquire(Machine.Objects);
  244. Machine.Acquire(Machine.Heaps); (* to protect agains concurrent LazySweep *)
  245. r := CurrentProcess();
  246. caller := r;
  247. r.mode := AwaitingEvent;
  248. num := 0;
  249. IF ~gcOngoing THEN
  250. gcOngoing := TRUE;
  251. p := ready.head;
  252. WHILE p # NIL DO
  253. cur := p(Process);
  254. IF ((cur.mode = Ready) OR (cur.mode = Running)) & (cur.priority <= High) & (cur # r) THEN
  255. res := Kernel32.SuspendThread(cur.handle);
  256. cur.mode := Suspended
  257. ELSE INC(num);
  258. END;
  259. p := p.next
  260. END;
  261. (* start GC *)
  262. gcActivity.Activate;
  263. END;
  264. Machine.Release(Machine.Heaps);
  265. Machine.Release(Machine.Objects);
  266. (* no process is running except the caller process and the GC process, no race here *)
  267. res := Kernel32.WaitForSingleObject(event, Kernel32.Infinite); (* block execution *)
  268. ASSERT(res = Kernel32.WaitObject0)
  269. ELSE
  270. (* gcProcess calls this *)
  271. Machine.Acquire(Machine.Objects);
  272. gcOngoing := FALSE;
  273. p := ready.head;
  274. WHILE (p # NIL) DO
  275. cur := p(Process);
  276. (* only suspended and awaiting processes of ready queue are resumed *)
  277. IF cur.mode = Suspended THEN
  278. res := Kernel32.ResumeThread(cur.handle);
  279. cur.mode := Running
  280. END;
  281. p := p.next
  282. END;
  283. caller.mode := Running;
  284. Kernel32.SetEvent(event);
  285. r := CurrentProcess();
  286. ASSERT(r = gcActivity.process);
  287. r.mode := AwaitingEvent;
  288. Machine.Release(Machine.Objects);
  289. END;
  290. END SetgcOngoing;
  291. *)
  292. (* called from Heaps.InvokeGC, i.e. this is a hidden upcall. However, it is necessary to take the Machine.Objects lock here since writing
  293. 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
  294. if the lock is not taken. *)
  295. PROCEDURE SetgcOngoing(value: BOOLEAN);
  296. VAR p: Heaps.ProcessLink; cur, r: Process; res: Kernel32.BOOL; num: LONGINT; time: LONGINT;
  297. BEGIN (* serialize writers *)
  298. IF value THEN
  299. (* Low, Medium or High priority process calls this *)
  300. time := Kernel32.GetTickCount();
  301. Machine.Acquire(Machine.Objects);
  302. Machine.Acquire(Machine.Heaps); (* to protect agains concurrent LazySweep *)
  303. r := CurrentProcess();
  304. num := 0;
  305. p := ready.head;
  306. WHILE p # NIL DO
  307. cur := p(Process);
  308. IF ((cur.mode = Ready) OR (cur.mode = Running)) & (cur.priority <= High) & (cur # r) THEN
  309. res := Kernel32.SuspendThread(cur.handle);
  310. cur.mode := Suspended
  311. ELSE INC(num);
  312. END;
  313. p := p.next
  314. END;
  315. Heaps.CollectGarbage(Modules.root);
  316. p := ready.head;
  317. WHILE (p # NIL) DO
  318. cur := p(Process);
  319. (* only suspended and awaiting processes of ready queue are resumed *)
  320. IF cur.mode = Suspended THEN
  321. res := Kernel32.ResumeThread(cur.handle);
  322. cur.mode := Running
  323. END;
  324. p := p.next
  325. END;
  326. Machine.Release(Machine.Heaps);
  327. Machine.Release(Machine.Objects);
  328. time := Kernel32.GetTickCount()-time;
  329. IF Heaps.trace THEN Trace.String("GC Called -- duration "); Trace.Int(time,0); Trace.String(" ms."); Trace.Ln END;
  330. IF finalizerCaller # NIL THEN finalizerCaller.Activate() END;
  331. END;
  332. END SetgcOngoing;
  333. END GCStatusExt;
  334. GCActivity = OBJECT
  335. (*
  336. VAR
  337. res: Kernel32.BOOL;
  338. event: Kernel32.HANDLE;
  339. process: Process;
  340. PROCEDURE &Init;
  341. BEGIN
  342. ASSERT(gcActivity = NIL); (* should only exist once *)
  343. event := Kernel32.CreateEvent( NIL, Kernel32.False (* auto-reset *), Kernel32.False, NIL ); (* manual set event with initial state = reset *)
  344. END Init;
  345. PROCEDURE Activate;
  346. BEGIN
  347. process.mode := Running;
  348. res := Kernel32.SetEvent(event);
  349. END Activate;
  350. PROCEDURE Wait;
  351. BEGIN
  352. process.mode := AwaitingEvent;
  353. res := Kernel32.WaitForSingleObject(event, Kernel32.Infinite); (* block execution *)
  354. ASSERT(res = Kernel32.WaitObject0);
  355. END Wait;
  356. BEGIN {ACTIVE, SAFE, PRIORITY(GCPriority)}
  357. Machine.Acquire(Machine.Objects);
  358. process := CurrentProcess();
  359. process.mode := AwaitingEvent;
  360. Machine.Release(Machine.Objects);
  361. LOOP
  362. Wait;
  363. (* process is scheduled -> perform garbage collection now *)
  364. Heaps.CollectGarbage(Modules.root);
  365. Heaps.gcStatus.SetgcOngoing(FALSE); (* resumes waiting processes and suspends itself *)
  366. IF finalizerCaller # NIL THEN finalizerCaller.Activate() END;
  367. END
  368. *)
  369. END GCActivity;
  370. FinalizedCollection* = OBJECT
  371. PROCEDURE RemoveAll*(obj: ANY); (** abstract *)
  372. BEGIN HALT(301) END RemoveAll;
  373. END FinalizedCollection;
  374. FinalizerNode* = POINTER TO RECORD (Heaps.FinalizerNode)
  375. c*: FinalizedCollection (* base type for collection containing object *)
  376. END;
  377. FinalizerCaller = OBJECT (* separate active object that calls finalizers *)
  378. VAR n: Heaps.FinalizerNode;
  379. event: Kernel32.HANDLE;
  380. process: Process;
  381. PROCEDURE &Init;
  382. BEGIN
  383. event := Kernel32.CreateEvent( NIL, Kernel32.False (* automatic *), Kernel32.False, NIL );
  384. ASSERT(event # 0);
  385. END Init;
  386. PROCEDURE Wait;
  387. VAR res: Kernel32.BOOL; mode: LONGINT;
  388. BEGIN
  389. mode := process.mode;
  390. process.mode := AwaitingEvent;
  391. res := Kernel32.WaitForSingleObject(event, Kernel32.Infinite);
  392. ASSERT(res = Kernel32.WaitObject0);
  393. process.mode := mode;
  394. END Wait;
  395. PROCEDURE Activate;
  396. VAR res: Kernel32.BOOL;
  397. BEGIN
  398. res := Kernel32.SetEvent(event);
  399. END Activate;
  400. BEGIN {ACTIVE, SAFE, PRIORITY(High)}
  401. process := CurrentProcess();
  402. LOOP
  403. Wait;
  404. LOOP
  405. n := Heaps.GetFinalizer();
  406. IF n = NIL THEN EXIT END;
  407. IF n IS FinalizerNode THEN
  408. n( FinalizerNode ).c.RemoveAll( n.objStrong ) (* remove it if it is not removed yet *)
  409. END;
  410. IF n.finalizer # NIL THEN
  411. n.finalizer( n.objStrong ) (* may acquire locks *)
  412. END
  413. END
  414. END;
  415. END FinalizerCaller;
  416. VAR
  417. awc-, awl-: LONGINT;
  418. oberonLoop*: ANY; (* Oberon Loop Process temporary workaround for Threads.oberonLoop *)
  419. break: ARRAY 16 OF CHAR;
  420. terminateProc: PROCEDURE;
  421. ready: ProcessQueue; (* contains running processes in this implementation *)
  422. numberOfProcessors: LONGINT; (* cached value of Machine.NumberOfProcessors() *)
  423. finalizerCaller: FinalizerCaller; (* active object for finalizer process, regarded as aprt of GC *)
  424. gcActivity: GCActivity;
  425. event: Timer; (* list of events *)
  426. clock: Clock;
  427. tlsIndex: LONGINT;
  428. nProcs: LONGINT;
  429. excplock: Kernel32.CriticalSection; exceptionhandler: ExceptionHandler;
  430. (* Set the current process' priority. *)
  431. PROCEDURE SetPriority*( priority: LONGINT );
  432. VAR r: Process; prio: LONGINT; res: Kernel32.BOOL;
  433. BEGIN
  434. ASSERT((priority >= Low) & (priority <= Realtime)); (* priority in bounds *)
  435. r := CurrentProcess(); r.priority := priority;
  436. CASE priority OF
  437. MinPriority:
  438. prio := Kernel32.ThreadPriorityIdle
  439. | Low:
  440. prio := Kernel32.ThreadPriorityBelowNormal
  441. | High:
  442. prio := Kernel32.ThreadPriorityAboveNormal
  443. | GCPriority, Realtime:
  444. prio := Kernel32.ThreadPriorityTimeCritical
  445. ELSE (* Normal *)
  446. prio := Kernel32.ThreadPriorityNormal
  447. END;
  448. res := Kernel32.SetThreadPriority( r.handle, prio );
  449. ASSERT(r.handle # 0);
  450. ASSERT(res # 0)
  451. END SetPriority;
  452. (** Return TRUE iff the specified protected object is locked exclusive to the current process. *)
  453. PROCEDURE LockedByCurrent*( obj: ANY ): BOOLEAN;
  454. VAR hdr {UNTRACED}: Heaps.ProtRecBlock; res: BOOLEAN;
  455. BEGIN
  456. SYSTEM.GET(SYSTEM.VAL(ADDRESS, obj) + Heaps.HeapBlockOffset, hdr);
  457. ASSERT(hdr IS Heaps.ProtRecBlock);
  458. Machine.Acquire(Machine.Objects);
  459. res := (hdr.lockedBy = ActiveObject());
  460. Machine.Release(Machine.Objects);
  461. RETURN res
  462. END LockedByCurrent;
  463. PROCEDURE Yield*;
  464. BEGIN
  465. Kernel32.Sleep(0)
  466. END Yield;
  467. (** Return current process. (DEPRECATED, use ActiveObject) *)
  468. PROCEDURE CurrentProcess*( ): Process;
  469. BEGIN
  470. RETURN SYSTEM.VAL(Process, Kernel32.TlsGetValue(tlsIndex));
  471. END CurrentProcess;
  472. (* Return stack bottom of process. For compatibility WinAos/UnixAos/NativeAos *)
  473. PROCEDURE GetStackBottom*(p: Process): ADDRESS;
  474. BEGIN
  475. RETURN p.stackBottom
  476. END GetStackBottom;
  477. (** Return the active object currently executing. *)
  478. PROCEDURE ActiveObject* (): ANY;
  479. VAR r: Process;
  480. BEGIN
  481. r := SYSTEM.VAL(Process, Kernel32.TlsGetValue(tlsIndex));
  482. RETURN r.obj
  483. END ActiveObject;
  484. (** Return the ID of the active currently executing process. *)
  485. PROCEDURE GetProcessID* (): LONGINT;
  486. VAR r: Process;
  487. BEGIN
  488. r := SYSTEM.VAL (Process, Kernel32.TlsGetValue( tlsIndex ));
  489. RETURN r.id
  490. END GetProcessID;
  491. (* Get a process from a queue (NIL if none). Caller must hold lock for specific queue. *)
  492. PROCEDURE Get(VAR queue: ProcessQueue; VAR new: Process);
  493. VAR t: Heaps.ProcessLink;
  494. BEGIN
  495. t := queue.head;
  496. IF t = NIL THEN (* zero elements in queue *)
  497. (* skip *)
  498. ELSIF t = queue.tail THEN (* one element in queue *)
  499. queue.head := NIL; queue.tail := NIL (* {(t.next = NIL) & (t.prev = NIL)} *)
  500. ELSE (* more than one element in queue *)
  501. queue.head := t.next; t.next := NIL; queue.head.prev := NIL
  502. END;
  503. ASSERT((t = NIL) OR (t.next = NIL ) & (t.prev = NIL)); (* temp strong check *)
  504. IF t = NIL THEN
  505. new := NIL
  506. ELSE
  507. ASSERT(t IS Process);
  508. new := t(Process)
  509. END
  510. END Get;
  511. (* Put a process in a queue. Caller must hold lock for specific queue. *)
  512. (* If t was running, be careful to protect Put and the subsequent SwitchTo with the ready lock. *)
  513. PROCEDURE Put(VAR queue: ProcessQueue; t: Process);
  514. BEGIN (* {t # NIL & t.next = NIL & t.prev = NIL} *)
  515. IF StrongChecks THEN
  516. ASSERT((t.next = NIL) & (t.prev = NIL))
  517. END;
  518. t.next := NIL; t.prev := NIL; (* ug *)
  519. IF queue.head = NIL THEN (* queue empty *)
  520. queue.head := t
  521. ELSE (* queue not empty *)
  522. queue.tail.next := t; t.prev := queue.tail
  523. END;
  524. queue.tail := t
  525. END Put;
  526. (* starting address of user stack for current thread, called stack top in TIB.H *)
  527. PROCEDURE -StackBottom*( ): LONGINT;
  528. CODE {SYSTEM.i386}
  529. DB 064H
  530. DB 08BH
  531. DB 005H
  532. DB 004H
  533. DB 000H
  534. DB 000H
  535. DB 000H
  536. END StackBottom;
  537. PROCEDURE {WINAPI} ExcpFrmHandler( VAR excpRec: Kernel32.ExceptionRecord; excpFrame: Kernel32.ExcpFrmPtr;
  538. VAR context: Kernel32.Context; dispatch: LONGINT ): LONGINT;
  539. VAR m: Modules.Module; eip, ebp, stack: LONGINT; pc, handler, fp, sp: LONGINT; handled: BOOLEAN; t: Process;
  540. BEGIN
  541. handled := FALSE;
  542. Kernel32.EnterCriticalSection( excplock );
  543. (*
  544. fof: commenting this resolved a problem with multiple traps that a are catched with FINALLY statements in Windows Vista
  545. in Windows XP not necessary if Kernel32.SetThreadContext is not used (better to return gracefully from this handler)
  546. SetCurrent(excpFrame);
  547. *)
  548. t := CurrentProcess();
  549. IF exceptionhandler = NIL THEN
  550. Trace.StringLn ( "Objects: No exception handler installed" );
  551. IF HandleExcp THEN
  552. Trace.String( "EXCEPTION " ); Trace.Hex( excpRec.ExceptionCode, 1 );
  553. Trace.String( " at " ); Trace.Hex( excpRec.ExceptionAddress, 1 );
  554. Trace.Ln(); Trace.String( "EAX " ); Trace.Hex( context.EAX, 1 );
  555. Trace.String( " EBX " ); Trace.Hex( context.EBX, 1 ); Trace.Ln();
  556. Trace.String( "ECX " ); Trace.Hex( context.ECX, 1 ); Trace.String( " EDX " );
  557. Trace.Hex( context.EDX, 1 ); Trace.Ln(); Trace.String( "EDI " );
  558. Trace.Hex( context.EDI, 1 ); Trace.String( " ESI " );
  559. Trace.Hex( context.ESI, 1 ); Trace.Ln(); Trace.String( "EBP " );
  560. Trace.Hex( context.BP, 1 ); Trace.String( " ESP " );
  561. Trace.Hex( context.SP, 1 ); Trace.Ln(); Trace.String( "EIP " );
  562. Trace.Hex( context.PC, 1 ); Trace.Ln(); Trace.Ln();
  563. eip := excpRec.ExceptionAddress; ebp := context.BP;
  564. IF eip = 0 THEN SYSTEM.GET( context.SP, eip ) END;
  565. stack := StackBottom();
  566. LOOP
  567. Trace.String( "at ebp= " ); Trace.Hex( ebp, 1 ); Trace.String( "H : " );
  568. m := Modules.ThisModuleByAdr( eip );
  569. IF m # NIL THEN
  570. Trace.String( m.name ); Trace.String( " " );
  571. Trace.Hex( eip - SYSTEM.VAL( LONGINT, ADDRESSOF( m.code[0] ) ), 1 );
  572. ELSE Trace.String( "EIP " ); Trace.Hex( eip, 1 )
  573. END;
  574. Trace.Ln();
  575. IF (ebp # 0) & (ebp < stack) THEN (* if ebp is 0 in first frame *)
  576. SYSTEM.GET( ebp + 4, eip ); (* return addr from stack *)
  577. SYSTEM.GET( ebp, ebp ); (* follow dynamic link *)
  578. ELSE EXIT
  579. END
  580. END;
  581. Trace.Ln();
  582. handled := FALSE; fp := context.BP; sp := context.SP;
  583. pc := context.PC; handler := Modules.GetExceptionHandler( pc );
  584. IF handler # -1 THEN (* Handler in the current PAF *)
  585. context.PC := handler; handled := TRUE;
  586. (*SetTrapVariable(pc, fp); SetLastExceptionState(exc)*)
  587. ELSE
  588. WHILE (fp # 0) & (handler = -1) DO
  589. SYSTEM.GET( fp + 4, pc );
  590. pc := pc - 1; (* CALL instruction, machine dependant!!! *)
  591. handler := Modules.GetExceptionHandler( pc );
  592. sp := fp; (* Save the old framepointer into the stack pointer *)
  593. SYSTEM.GET( fp, fp ) (* Unwind PAF *)
  594. END;
  595. IF handler = -1 THEN handled := FALSE;
  596. ELSE
  597. context.PC := handler; context.BP := fp; context.SP := sp;
  598. (* SetTrapVariable(pc, fp); SetLastExceptionState(exc);*)
  599. handled := TRUE
  600. END
  601. END;
  602. ELSE Trace.StringLn ( "Warning: FINALLY statement cannot be treated !" );
  603. END
  604. ELSE exceptionhandler( context, excpRec, handled );
  605. END;
  606. IF ~handled THEN
  607. context.PC := t.restartPC; context.SP := t.restartSP;
  608. context.BP := t.stackBottom;
  609. ELSIF TraceVerbose THEN Trace.StringLn ( "trying to jump to FINALLY pc..." );
  610. END;
  611. Kernel32.LeaveCriticalSection( excplock );
  612. IF TraceVerbose THEN
  613. Machine.Acquire (Machine.TraceOutput);
  614. Trace.String( "recover process; eip=" ); Trace.Int( context.PC, 10 );
  615. Trace.String( "; sp= " ); Trace.Int( context.SP, 10 ); Trace.String( "; ebp= " );
  616. Trace.Int( context.BP, 10 ); Trace.Ln;
  617. Machine.Release (Machine.TraceOutput);
  618. END;
  619. RETURN Kernel32.ExceptionContinueSearch; (* sets thread context and continues where specified in context *)
  620. END ExcpFrmHandler;
  621. (* get the currently installed execption frame *)
  622. (* PROCEDURE -GetCur 64H, 8BH, 0DH, 0, 0, 0, 0; (* MOV ECX, FS:[0] *) *)
  623. (* Better *)
  624. PROCEDURE -GetCur;
  625. CODE {SYSTEM.i386}
  626. DB 064H, 08BH, 00DH, 000H, 000H, 000H, 000H
  627. END GetCur;
  628. PROCEDURE GetCurrent( ): Kernel32.ExcpFrmPtr;
  629. VAR cur: Kernel32.ExcpFrmPtr;
  630. BEGIN
  631. GetCur;
  632. cur := SYSTEM.VAL(Kernel32.ExcpFrmPtr,Machine.GetECX());
  633. (* RETURN ECX *)
  634. RETURN cur
  635. END GetCurrent;
  636. (* install a new exception frame *)
  637. (* PROCEDURE -SetCur 64H, 0A3H, 0, 0, 0, 0; (* MOV FS:[0], EAX *)*)
  638. (* Better *)
  639. PROCEDURE -SetCur;
  640. CODE {SYSTEM.i386}
  641. DB 064H, 0A3H, 000H, 000H, 000H, 000H
  642. END SetCur;
  643. PROCEDURE SetCurrent( cur: Kernel32.ExcpFrmPtr );
  644. BEGIN
  645. Machine.SetEAX(SYSTEM.VAL(LONGINT,cur));
  646. (* EAX := cur *)
  647. SetCur
  648. END SetCurrent;
  649. PROCEDURE RemoveExcpFrm( VAR excpfrm: Kernel32.ExcpFrm );
  650. VAR this: Kernel32.ExcpFrmPtr;
  651. BEGIN
  652. this := GetCurrent();
  653. (* ASSERT ( this = ADDRESSOF( excpfrm ) ); *)
  654. IF this # ADDRESSOF( excpfrm ) THEN Trace.StringLn ( "RemoveExcpFrm: Problem with excpfrm pointer" );
  655. ELSE SetCurrent( excpfrm.link )
  656. END;
  657. END RemoveExcpFrm;
  658. PROCEDURE InstallExcpFrm( VAR excpfrm: Kernel32.ExcpFrm );
  659. BEGIN
  660. excpfrm.link := GetCurrent(); excpfrm.handler := ExcpFrmHandler;
  661. SetCurrent( ADDRESSOF( excpfrm ) )
  662. END InstallExcpFrm;
  663. PROCEDURE InQueue( queue: ProcessQueue; t: Process ): BOOLEAN;
  664. VAR p: Heaps.ProcessLink;
  665. BEGIN
  666. p := queue.head;
  667. WHILE (p # NIL ) & (p # t) DO p := p.next; END;
  668. RETURN (p = t);
  669. END InQueue;
  670. (* Remove a process from a queue that contains it. Caller must hold lock for specific queue. *)
  671. (* Not intended for frequent use. *)
  672. (* does not check if queue contained t ! *)
  673. PROCEDURE Remove( VAR queue: ProcessQueue; t: Process );
  674. BEGIN
  675. IF StrongChecks THEN
  676. ASSERT(InQueue(queue, t));
  677. ASSERT(t # NIL);
  678. END;
  679. IF t.prev # NIL THEN t.prev.next := t.next END;
  680. IF t.next # NIL THEN t.next.prev := t.prev END;
  681. IF t = queue.head THEN queue.head := t.next END;
  682. IF t = queue.tail THEN queue.tail := t.prev END;
  683. ASSERT((queue.head = NIL) OR (queue.head.prev = NIL) & (queue.tail.next = NIL));
  684. t.prev := NIL; t.next := NIL
  685. END Remove;
  686. PROCEDURE WriteType(obj: ANY);
  687. VAR type: LONGINT;
  688. BEGIN
  689. IF obj = NIL THEN Trace.String(" > NIL");
  690. ELSE
  691. Trace.String(" > "); SYSTEM.GET(SYSTEM.VAL(LONGINT, obj) + Heaps.TypeDescOffset, type);
  692. Heaps.WriteType(type);
  693. END;
  694. END WriteType;
  695. PROCEDURE terminate( t: Process );
  696. VAR hdr {UNTRACED}: Heaps.ProtRecBlock; res: Kernel32.BOOL; shutdown: BOOLEAN;
  697. BEGIN
  698. IF t = NIL THEN RETURN END;
  699. (* see Objects.TerminateThis *)
  700. Machine.Acquire( Machine.Objects );
  701. IF TraceVerbose OR TraceOpenClose THEN
  702. Machine.Acquire (Machine.TraceOutput);
  703. Trace.String( "Terminating process " ); Trace.Int( t.id, 1 ); WriteType( t.obj ); Trace.Ln;
  704. Machine.Release (Machine.TraceOutput);
  705. END;
  706. IF (t.mode = Ready) OR (t.mode = Running) THEN Remove( ready, t );
  707. ELSIF t.mode = AwaitingLock THEN
  708. SYSTEM.GET(SYSTEM.VAL(ADDRESS, t.waitingOn) + Heaps.HeapBlockOffset, hdr);
  709. ASSERT(hdr IS Heaps.ProtRecBlock);
  710. Remove( hdr.awaitingLock, t ); Machine.Release( Machine.Objects );
  711. HALT( 97 )
  712. ELSIF t.mode = AwaitingCond THEN
  713. SYSTEM.GET(SYSTEM.VAL(ADDRESS, t.waitingOn) + Heaps.HeapBlockOffset, hdr);
  714. ASSERT(hdr IS Heaps.ProtRecBlock);
  715. Remove( hdr.awaitingCond, t ); Machine.Release( Machine.Objects );
  716. HALT( 98 )
  717. ELSE Machine.Release( Machine.Objects );
  718. HALT( 99 )
  719. END;
  720. t.mode := Terminated; (* a process can also be "terminated" if the queue containing it is garbage collected *)
  721. t.stackBottom := 0; t.state.SP := 0;
  722. t.restartPC := 0;
  723. IF t.event # 0 THEN res := Kernel32.CloseHandle( t.event ); t.event := 0 END;
  724. DEC( nProcs ); shutdown := (nProcs = 0);
  725. Machine.Release( Machine.Objects );
  726. IF shutdown THEN
  727. Trace.StringLn ( " Objects: shutdown" ); Modules.Shutdown( -1 );
  728. Kernel32.ExitProcess( 0 )
  729. END
  730. END terminate;
  731. PROCEDURE {WINAPI} Wrapper( lpParameter: ANY ): LONGINT;
  732. VAR t: Process; obj: ProtectedObject; res: Kernel32.BOOL; bp,sp: LONGINT;
  733. excpfrm: Kernel32.ExcpFrm;
  734. BEGIN
  735. (* it may happen that the garbage collector runs right here and ignores this procedure.
  736. This is not a problem since lpParameter (being a reference to a process) is protected by the process lists *)
  737. Machine.Acquire(Machine.Objects);
  738. res := Kernel32.TlsSetValue(tlsIndex, SYSTEM.VAL(LONGINT, lpParameter));
  739. t := lpParameter(Process); obj := t.obj;
  740. ASSERT(res # 0);
  741. InstallExcpFrm(excpfrm);
  742. SetPriority(t.priority);
  743. bp := Machine.CurrentBP();
  744. sp := Machine.CurrentSP();
  745. t.restartSP := sp;
  746. t.stackBottom := bp;
  747. IF t.restartPC = SYSTEM.VAL(ADDRESS, terminateProc) THEN DEC(t.restartSP, 4)
  748. ELSE DEC(t.restartSP, 8)
  749. END;
  750. IF TraceVerbose THEN
  751. Machine.Acquire(Machine.TraceOutput);
  752. Trace.String("New process; restartPC= "); Trace.Int(t.restartPC, 15);
  753. Trace.String("; restartSP= "); Trace.Int(t.restartSP, 15); Trace.String("; stackBottom= ");
  754. Trace.Int(t.stackBottom, 15); Trace.Ln;
  755. Machine.Release(Machine.TraceOutput);
  756. END;
  757. t.mode := Running;
  758. (* now gc is enabled for this process stack *)
  759. Machine.Release(Machine.Objects);
  760. (* loop all processes that the GC did not see during process suspending because they were in the very moment being generated (just before the locked section) *)
  761. (*! should not be necessary any more as GC runs immediately and without scheduling decisions
  762. WHILE (gcActivity # NIL) & (gcActivity.process # NIL) & (gcActivity.process.mode = Running) DO END;
  763. *)
  764. t.body(obj);
  765. terminate(t);
  766. RemoveExcpFrm(excpfrm);
  767. RETURN 0
  768. END Wrapper;
  769. PROCEDURE FinalizeProcess(t: ANY);
  770. VAR p: Process; res: Kernel32.BOOL;
  771. BEGIN
  772. p := t(Process);
  773. IF TraceVerbose THEN
  774. Machine.Acquire (Machine.TraceOutput);
  775. Trace.String("Finalizing Process"); Trace.Int(p.id, 1);
  776. WriteType(p.obj); Trace.Ln;
  777. Machine.Release (Machine.TraceOutput);
  778. END;
  779. IF p.mode # Terminated THEN
  780. IF p.mode = AwaitingLock THEN DEC(awl);
  781. ELSIF p.mode = AwaitingCond THEN DEC(awc);
  782. END;
  783. (* no reference to the object any more *)
  784. Trace.String ("Closing unreferenced process"); (*Trace.Int(p.mode,20); Trace.Int( p.id, 20 ); *) Trace.Ln; (* Trace.Ln *)
  785. (* this usually happens, when an objects process waits on its own objtec and no reference exists any more. Then the object is discarded and
  786. consequently the process is unreferenced (except in the object). This cannot happen when there are still other references on the object.
  787. example:
  788. TYPE
  789. Object= OBJECT VAR active: BOOLEAN; BEGIN{ACTIVE} active := FALSE; AWAIT(active) END Object;
  790. VAR o: Object;
  791. BEGIN NEW(o);
  792. END;
  793. *)
  794. END;
  795. p.mode := Terminated; (* fof for GC problem *)
  796. IF p.handle # 0 THEN
  797. res := Kernel32.CloseHandle(p.handle); p.handle := 0
  798. END
  799. END FinalizeProcess;
  800. PROCEDURE TerminateProc;
  801. BEGIN
  802. terminate(CurrentProcess());
  803. Kernel32.ExitThread(0);
  804. Kernel32.Sleep(999999); (* wait until dependent threads terminated *)
  805. END TerminateProc;
  806. (* Allocate a new process associated with "obj". Must be outside lock region, because of potential GC. *)
  807. PROCEDURE NewProcess(body: Body; priority: LONGINT; flags: SET; obj: ProtectedObject; VAR new: Process);
  808. VAR t,r: Process; fn: Heaps.FinalizerNode;
  809. BEGIN
  810. NEW(t);
  811. t.handle := 0;
  812. IF priority = 0 THEN (* no priority specified *)
  813. r := CurrentProcess();
  814. t.priority := r.priority (* inherit priority of creator *)
  815. ELSIF priority > 0 THEN (* positive priority specified *)
  816. t.priority := priority
  817. ELSE (* negative priority specified (only for Idle process) *)
  818. t.priority := MinPriority
  819. END;
  820. NEW(fn); (* implicit call Heaps.NewRec -> might invoke GC *)
  821. Machine.Acquire(Machine.Objects);
  822. t.next := NIL; t.prev := NIL; t.rootedNext := NIL;
  823. t.waitingOn := NIL; t.flags := flags; t.obj := obj; t.mode := Unknown;
  824. t.body := body; t.event := 0; fn.finalizer := FinalizeProcess;
  825. Heaps.AddFinalizer(t, fn);
  826. IF Restart IN flags THEN (* restart object body *)
  827. t.restartPC := SYSTEM.VAL(ADDRESS, body);
  828. ELSE (* terminate process *)
  829. t.restartPC := SYSTEM.VAL(ADDRESS, terminateProc);
  830. END;
  831. t.handle := Kernel32.CreateThread(0, defaultStackSize, Wrapper, t, {}, t.id);
  832. IF TraceVerbose OR TraceOpenClose THEN
  833. Machine.Acquire(Machine.TraceOutput);
  834. Trace.String("NewProcess: " ); Trace.Int(t.id, 1); WriteType(obj); Trace.Ln;
  835. Machine.Release(Machine.TraceOutput);
  836. END;
  837. ASSERT(t.handle # 0);
  838. new := t;
  839. END NewProcess;
  840. (* Create the process associated with an active object (kernel call). *)
  841. PROCEDURE CreateProcess*(body: Body; priority: LONGINT; flags: SET; obj: ProtectedObject);
  842. VAR t : Process; heapBlock {UNTRACED}: Heaps.HeapBlock;
  843. BEGIN
  844. ASSERT(priority >= 0, 1000); ASSERT(priority <=Realtime, 1001);
  845. SYSTEM.GET(SYSTEM.VAL(ADDRESS, obj) + Heaps.HeapBlockOffset, heapBlock);
  846. ASSERT(heapBlock IS Heaps.ProtRecBlock); (* protected object *)
  847. IF Restart IN flags THEN INCL(flags, Resistant) END; (* SAFE => Restart & Resistant *)
  848. NewProcess(body, priority, flags, obj, t); INC(nProcs); (* acquires Machine.Objects lock *)
  849. t.mode := Ready; Put(ready, t);
  850. Machine.Release(Machine.Objects)
  851. END CreateProcess;
  852. (* The procedure Lock, Unlock and Await do not use header locks since it turned out that the header locks sometimes were finalized
  853. too early. *)
  854. PROCEDURE Lock*(obj: ProtectedObject; exclusive: BOOLEAN );
  855. VAR hdr {UNTRACED}: Heaps.ProtRecBlock; r: Process; res: LONGINT;
  856. BEGIN (* {called from user level} *)
  857. SYSTEM.GET(SYSTEM.VAL(ADDRESS, obj) + Heaps.HeapBlockOffset, hdr);
  858. IF StrongChecks THEN
  859. ASSERT(hdr IS Heaps.ProtRecBlock); (* protected object *)
  860. ASSERT(exclusive) (* shared not implemented yet *)
  861. END;
  862. r := CurrentProcess();
  863. IF StrongChecks THEN
  864. ASSERT(hdr # NIL, 1001);
  865. ASSERT(r # NIL, 1002);
  866. END;
  867. Machine.Acquire(Machine.Objects);
  868. IF hdr.count = 0 THEN (* not locked *)
  869. hdr.count := -1; hdr.lockedBy := r;
  870. Machine.Release(Machine.Objects)
  871. ELSE (* already locked *)
  872. IF hdr.lockedBy = r THEN
  873. Machine.Release(Machine.Objects);
  874. HALT(2203) (* nested locks not allowed *)
  875. END;
  876. ASSERT(r.waitingOn = NIL); (* sanity check *)
  877. Remove(ready, r);
  878. IF r.event = 0 THEN
  879. r.event := Kernel32.CreateEvent( NIL, Kernel32.False (* auto *), Kernel32.False, NIL ); (* auto reset event with initial state = reset *)
  880. ASSERT ( r.event # 0, 1239 );
  881. END;
  882. r.waitingOn := obj; r.mode := AwaitingLock;
  883. Put(hdr.awaitingLock, r); INC(awl);
  884. Machine.Release(Machine.Objects);
  885. res := Kernel32.WaitForSingleObject(r.event, Kernel32.Infinite); (* block execution *)
  886. ASSERT(res = Kernel32.WaitObject0);
  887. IF StrongChecks THEN
  888. ASSERT(hdr.lockedBy = r); (* at this moment only this process can own the lock and only this process can release it*)
  889. END;
  890. END
  891. END Lock;
  892. (* Find the first true condition from the queue and remove it. Assume the object is currently locked. *)
  893. PROCEDURE FindCondition( VAR q: ProcessQueue ): Process;
  894. VAR first, cand: Process;
  895. BEGIN
  896. Get( q, first );
  897. IF first.condition( first.condFP ) THEN RETURN first END;
  898. Put( q, first );
  899. WHILE q.head # first DO
  900. Get( q, cand );
  901. IF cand.condition( cand.condFP ) THEN RETURN cand END;
  902. Put( q, cand )
  903. END;
  904. RETURN NIL
  905. END FindCondition;
  906. (* The procedure Lock, Unlock and Await do not use header locks since it turned out that the header locks sometimes were finalized
  907. too early. *)
  908. PROCEDURE Unlock*( obj: ProtectedObject; dummy: BOOLEAN );
  909. VAR hdr {UNTRACED}: Heaps.ProtRecBlock; t, c: Process; res: LONGINT;
  910. BEGIN
  911. SYSTEM.GET(SYSTEM.VAL(ADDRESS, obj) + Heaps.HeapBlockOffset, hdr);
  912. IF StrongChecks THEN
  913. ASSERT(hdr IS Heaps.ProtRecBlock) (* protected object *)
  914. END;
  915. ASSERT(hdr.count = -1); (* exclusive locked *)
  916. Machine.Acquire(Machine.Objects);
  917. IF hdr.awaitingCond.head # NIL THEN (* evaluate the waiting conditions *)
  918. (* we are holding the lock, so the queue can not change (to do: except in TerminateThis) *)
  919. c := FindCondition(hdr.awaitingCond); (* interrupts should be on during this call *)
  920. ELSE
  921. c := NIL
  922. END;
  923. IF c = NIL THEN (* no true condition found, check the lock queue *)
  924. Get(hdr.awaitingLock, t);
  925. IF t # NIL THEN
  926. hdr.lockedBy := t;
  927. t.waitingOn := NIL;
  928. ELSE
  929. hdr.lockedBy := NIL; hdr.count := 0
  930. END
  931. ELSE (* true condition found, transfer the lock *)
  932. c.waitingOn := NIL; hdr.lockedBy := c;
  933. t := NIL
  934. END;
  935. IF c # NIL THEN
  936. Put(ready, c); c.mode := Running; DEC(awc);
  937. res := Kernel32.SetEvent(c.event);
  938. ASSERT (res # 0, 1001);
  939. ELSIF t # NIL THEN
  940. Put(ready, t); t.mode := Running; DEC(awl);
  941. res := Kernel32.SetEvent(t.event);
  942. ASSERT (res # 0, 1002);
  943. END;
  944. Machine.Release( Machine.Objects )
  945. END Unlock;
  946. (* The procedure Lock, Unlock and Await do not use header locks since it turned out that the header locks sometimes were finalized
  947. too early. *)
  948. PROCEDURE Await*( cond: Condition; slink: LONGINT; obj: ProtectedObject; flags: SET );
  949. VAR hdr {UNTRACED}: Heaps.ProtRecBlock; r, c, t: Process; res: LONGINT;
  950. BEGIN
  951. IF 1 IN flags THEN (* compiler did not generate IF *)
  952. IF cond(slink) THEN
  953. RETURN (* condition already true *)
  954. END
  955. END;
  956. SYSTEM.GET(SYSTEM.VAL(ADDRESS, obj) + Heaps.HeapBlockOffset, hdr);
  957. IF StrongChecks THEN
  958. ASSERT(hdr IS Heaps.ProtRecBlock) (* protected object *)
  959. END;
  960. r := CurrentProcess();
  961. Machine.Acquire(Machine.Objects);
  962. IF hdr.lockedBy = r THEN (* current process holds exclusive lock *)
  963. IF StrongChecks THEN ASSERT(hdr.count = -1) END; (* exclusive locked *)
  964. IF hdr.awaitingCond.head # NIL THEN (* evaluate the waiting conditions *)
  965. (* we are holding the lock, so the queue can not change (to do: except in TerminateThis) *)
  966. c := FindCondition(hdr.awaitingCond) (* interrupts should be on during this call *)
  967. ELSE
  968. c := NIL
  969. END;
  970. IF c = NIL THEN
  971. Get(hdr.awaitingLock, t);
  972. IF t = NIL THEN (* none waiting - remove lock *)
  973. hdr.count := 0; hdr.lockedBy := NIL;
  974. ELSE (* transfer lock to first waiting process *)
  975. IF StrongChecks THEN ASSERT(t.mode = AwaitingLock) END;
  976. t.waitingOn := NIL;
  977. hdr.lockedBy := t;
  978. END;
  979. ELSE
  980. c.waitingOn := NIL; hdr.lockedBy := c;
  981. t := NIL;
  982. END;
  983. ELSE (* no lock, or some other process may hold the lock, but that's the user's indaba (may be monotonic condition) *)
  984. Machine.Release(Machine.Objects);
  985. HALT( 2204 ) (* await must be exclusive region *)
  986. END;
  987. r.condition := cond; r.condFP := slink;
  988. r.waitingOn := obj; r.mode := AwaitingCond;
  989. Remove(ready, r);
  990. IF r.event = 0 THEN
  991. r.event := Kernel32.CreateEvent( NIL, Kernel32.False (* auto *), Kernel32.False, NIL ); (* auto-reset event with initial state = reset *)
  992. ASSERT ( r.event # 0, 1239 );
  993. END;
  994. IF c # NIL THEN
  995. DEC(awc); Put(ready, c); c.mode := Running;
  996. res := Kernel32.SetEvent(c.event); (* restart execution *)
  997. ASSERT(res # 0, 1002);
  998. END;
  999. IF t # NIL THEN
  1000. DEC(awl); Put(ready, t); t.mode := Running;
  1001. res := Kernel32.SetEvent( t.event ); (* restart execution *)
  1002. ASSERT(res # 0, 1003);
  1003. END;
  1004. Put(hdr.awaitingCond, r); INC(awc);
  1005. Machine.Release(Machine.Objects);
  1006. res := Kernel32.WaitForSingleObject(r.event, Kernel32.Infinite); (* block execution *)
  1007. ASSERT(res = Kernel32.WaitObject0);
  1008. IF StrongChecks THEN
  1009. ASSERT(cond(slink));
  1010. ASSERT(hdr.lockedBy = r) (* lock held again *)
  1011. END
  1012. END Await;
  1013. PROCEDURE Break*( t: Process );
  1014. CONST MaxTry = 50;
  1015. VAR mod: Modules.Module; try: LONGINT; retBOOL: Kernel32.BOOL; (* Dan 09.11.05 *)
  1016. PROCEDURE SafeForBreak( mod: Modules.Module ): BOOLEAN;
  1017. BEGIN
  1018. Trace.String( "Safe for break?: " );
  1019. IF mod # NIL THEN
  1020. Trace.StringLn ( mod.name );
  1021. IF (mod.name = "Trace") OR (mod.name = "Machine") OR
  1022. (mod.name = "Heaps") OR (mod.name = "Modules") OR
  1023. (mod.name = "Objects") OR (mod.name = "Kernel") THEN
  1024. Trace.StringLn ( " - no" ); RETURN FALSE
  1025. ELSE Trace.StringLn ( " - yes" ); RETURN TRUE
  1026. END
  1027. ELSE Trace.StringLn ( "unknown module" ); RETURN FALSE
  1028. END
  1029. END SafeForBreak;
  1030. BEGIN
  1031. IF CurrentProcess() # t THEN
  1032. Machine.Acquire( Machine.Objects );
  1033. LOOP
  1034. retBOOL := Kernel32.SuspendThread( t.handle );
  1035. t.state.ContextFlags := Kernel32.ContextControl;
  1036. retBOOL := Kernel32.GetThreadContext( t.handle, t.state );
  1037. mod := Modules.ThisModuleByAdr( t.state.PC ); Trace.String( "Objects Break at adr: " );
  1038. Trace.Int( t.state.PC, 5 ); Trace.Ln;
  1039. IF mod # NIL THEN
  1040. Trace.String( "In module: " ); Trace.StringLn ( mod.name );
  1041. END;
  1042. IF ~SafeForBreak( mod ) (* we do not break Kernel modules *) THEN
  1043. retBOOL := Kernel32.ResumeThread( t.handle ); INC( try );
  1044. IF try > MaxTry THEN
  1045. Trace.StringLn ( "Threads.Break: failed " );
  1046. Machine.Release( Machine.Objects );
  1047. RETURN
  1048. END
  1049. ELSE EXIT
  1050. END;
  1051. END;
  1052. (* push cont.Eip *) break[0] := 68X;
  1053. SYSTEM.MOVE( ADDRESSOF( t.state.PC ), ADDRESSOF( break[1] ), 4 );
  1054. (* push ebp *) break[5] := 055X;
  1055. (* mov ebp, esp *) break[6] := 08BX; break[7] := 0ECX;
  1056. (* push 13 *) break[8] := 06AX; break[9] := 0DX;
  1057. (* int 3 *) break[10] := 0CCX;
  1058. (* mov esp, ebp *) break[11] := 08BX; break[12] := 0E5X;
  1059. (* pop ebp *) break[13] := 05DX;
  1060. (* ret *) break[14] := 0C3X; t.state.PC := ADDRESSOF( break[0] );
  1061. retBOOL := Kernel32.SetThreadContext( t.handle, t.state );
  1062. retBOOL := Kernel32.ResumeThread( t.handle ); (* INC( Kernel.GClevel ); *)
  1063. Machine.Release( Machine.Objects );
  1064. ELSE HALT( 99 )
  1065. END;
  1066. END Break;
  1067. (* Attempt to terminate a specific process (mostly ignoring its locks). DEPRECATED *)
  1068. PROCEDURE TerminateThis*( t: Process; halt: BOOLEAN );
  1069. BEGIN
  1070. terminate(t);
  1071. END TerminateThis;
  1072. PROCEDURE Terminate*;
  1073. BEGIN
  1074. TerminateProc();
  1075. END Terminate;
  1076. PROCEDURE Init; (* can not use NEW *)
  1077. VAR lock: PROCEDURE(obj: ProtectedObject; exclusive: BOOLEAN);
  1078. unlock: PROCEDURE(obj: ProtectedObject; dummy: BOOLEAN);
  1079. await: PROCEDURE(cond: Condition; slink: LONGINT; obj: ProtectedObject; flags: SET);
  1080. create: PROCEDURE(body: Body; priority: LONGINT; flags: SET; obj: ProtectedObject);
  1081. VAR t: Process; fn: Heaps.FinalizerNode; proc: Kernel32.HANDLE;
  1082. res: Kernel32.BOOL;
  1083. BEGIN
  1084. Kernel32.InitializeCriticalSection(excplock);
  1085. numberOfProcessors := Machine.NumberOfProcessors();
  1086. lock := Lock; unlock := Unlock; await := Await; create := CreateProcess;
  1087. NEW(t); NEW(fn);
  1088. Machine.Acquire(Machine.Objects);
  1089. nProcs := 1;
  1090. t.next := NIL; t.prev := NIL;
  1091. t.waitingOn := NIL; t.flags := {}; t.obj := NIL;
  1092. t.mode := Unknown; t.body := NIL;
  1093. t.priority := Normal;
  1094. fn.finalizer := FinalizeProcess;
  1095. Heaps.AddFinalizer(t, fn);
  1096. t.handle := Kernel32.GetCurrentThread();
  1097. t.id := Kernel32.GetCurrentThreadId();
  1098. proc := Kernel32.GetCurrentProcess();
  1099. res := Kernel32.DuplicateHandle(proc, t.handle, proc, t.handle, {}, 0, {Kernel32.DuplicateSameAccess});
  1100. ASSERT(res # 0);
  1101. res := Kernel32.TlsSetValue(tlsIndex, SYSTEM.VAL(LONGINT, t));
  1102. ASSERT(res # 0);
  1103. t.stackBottom := StackBottom(); t.mode := Running;
  1104. Put( ready, t );
  1105. ASSERT(t.handle # 0);
  1106. Machine.Release(Machine.Objects);
  1107. InitEventHandling; (* implicit call of NewProcess! *)
  1108. InitGCHandling; (* do. *)
  1109. Heaps.gcStatus := GCStatusFactory()
  1110. END Init;
  1111. (** Set (or reset) an event handler object's timeout value. *)
  1112. PROCEDURE SetTimeout*(t: Timer; h: EventHandler; ms: LONGINT );
  1113. VAR e: Timer; trigger: LONGINT;
  1114. BEGIN
  1115. ASSERT(Machine.Second= 1000); (* assume milliseconds for now *)
  1116. ASSERT((t # NIL) & (h # NIL));
  1117. ASSERT(ms >= 0);
  1118. Machine.Acquire(Machine.Objects);
  1119. trigger := Kernel32.GetTickCount() + ms; (* ignore overflow *)
  1120. IF t.next # NIL THEN (* cancel previous timeout *)
  1121. t.next.prev := t.prev; t.prev.next := t.next
  1122. END;
  1123. t.trigger := trigger; t.handler := h;
  1124. e := event.next; (* performance: linear search! *)
  1125. WHILE (e # event) & (e.trigger - trigger <= 0) DO e := e.next END;
  1126. t.prev := e.prev; e.prev := t; t.next := e; t.prev.next := t;
  1127. Machine.Release(Machine.Objects);
  1128. clock.Wakeup()
  1129. END SetTimeout;
  1130. (** Set (or reset) an event handler object's timeout value. Here ms is absolute *)
  1131. PROCEDURE SetTimeoutAt*(t: Timer; h: EventHandler; ms: LONGINT);
  1132. VAR e: Timer; trigger: LONGINT;
  1133. BEGIN
  1134. ASSERT(Machine.Second= 1000); (* assume milliseconds for now *)
  1135. ASSERT((t # NIL) & (h # NIL));
  1136. Machine.Acquire(Machine.Objects);
  1137. trigger := ms; (* ignore overflow *)
  1138. IF t.next # NIL THEN (* cancel previous timeout *)
  1139. t.next.prev := t.prev; t.prev.next := t.next
  1140. END;
  1141. t.trigger := trigger; t.handler := h;
  1142. e := event.next; (* performance: linear search! *)
  1143. WHILE (e # event) & (e.trigger - trigger <= 0) DO e := e.next END;
  1144. t.prev := e.prev; e.prev := t; t.next := e; t.prev.next := t;
  1145. Machine.Release(Machine.Objects);
  1146. clock.Wakeup()
  1147. END SetTimeoutAt;
  1148. (** Cancel an event handler object's timeout, if any. It is possible that the timer has expired, but not yet been scheduled to run. *)
  1149. PROCEDURE CancelTimeout*( t: Timer );
  1150. BEGIN
  1151. Machine.Acquire(Machine.Objects);
  1152. ASSERT (t # event );
  1153. IF t.next # NIL THEN
  1154. t.next.prev := t.prev; t.prev.next := t.next; t.next := NIL;
  1155. t.prev := NIL
  1156. END;
  1157. Machine.Release(Machine.Objects);
  1158. END CancelTimeout;
  1159. PROCEDURE InitEventHandling;
  1160. BEGIN
  1161. NEW(event); event.next := event; event.prev := event; (* event: head of timer event queue, only a sentinel *)
  1162. NEW(clock)
  1163. END InitEventHandling;
  1164. PROCEDURE InitGCHandling;
  1165. BEGIN
  1166. NEW(gcActivity);
  1167. NEW(finalizerCaller);
  1168. END InitGCHandling;
  1169. PROCEDURE GCStatusFactory(): Heaps.GCStatus;
  1170. VAR gcStatusExt : GCStatusExt;
  1171. BEGIN
  1172. ASSERT(Heaps.gcStatus = NIL);
  1173. NEW(gcStatusExt);
  1174. RETURN gcStatusExt
  1175. END GCStatusFactory;
  1176. PROCEDURE InstallExceptionHandler*( e: ExceptionHandler );
  1177. BEGIN
  1178. exceptionhandler := e;
  1179. END InstallExceptionHandler;
  1180. PROCEDURE UpdateProcessState*( p: Process );
  1181. VAR res: Kernel32.BOOL;
  1182. BEGIN
  1183. res := Kernel32.GetThreadContext( p.handle, p.state );
  1184. ASSERT (p.handle # 0);
  1185. END UpdateProcessState;
  1186. (*ALEX 2005.12.12 added for WMPerfMon needs*)
  1187. PROCEDURE NumReady*( ): LONGINT;
  1188. VAR n: LONGINT; p: Heaps.ProcessLink;
  1189. BEGIN
  1190. n := 0;
  1191. Machine.Acquire( Machine.Objects );
  1192. p := ready.head;
  1193. WHILE p # NIL DO INC( n ); p := p.next END;
  1194. Machine.Release( Machine.Objects );
  1195. RETURN n
  1196. END NumReady;
  1197. (** Return number of CPU cycles consumed by the specified process. If all is TRUE,
  1198. return the number of cycles since the process has been created. If FALSE, return the number of cycles
  1199. consumed since the last time asked. *)
  1200. PROCEDURE GetCpuCycles*(process : Process; VAR cpuCycles : CpuCyclesArray; all : BOOLEAN);
  1201. VAR res : Kernel32.BOOL; temp : HUGEINT; i : LONGINT;
  1202. BEGIN
  1203. ASSERT(process # NIL);
  1204. IF (Kernel32.QueryThreadCycleTime # NIL) THEN
  1205. res := Kernel32.QueryThreadCycleTime(process.handle, cpuCycles[0]);
  1206. ELSE
  1207. cpuCycles[0] := Machine.GetTimer(); res := Kernel32.True;
  1208. END;
  1209. IF ~all & (res = Kernel32.True) THEN
  1210. temp := process.lastThreadTimes;
  1211. process.lastThreadTimes := cpuCycles[0];
  1212. cpuCycles[0] := cpuCycles[0] - temp;
  1213. END;
  1214. END GetCpuCycles;
  1215. PROCEDURE CurrentProcessTime*(): HUGEINT;
  1216. VAR res: LONGINT; result: HUGEINT;
  1217. BEGIN
  1218. res := Kernel32.QueryThreadCycleTime(CurrentProcess().handle, result);
  1219. RETURN result;
  1220. END CurrentProcessTime;
  1221. PROCEDURE TimerFrequency*(): HUGEINT;
  1222. BEGIN
  1223. RETURN 1000000000;
  1224. END TimerFrequency;
  1225. BEGIN
  1226. exceptionhandler := NIL;
  1227. terminateProc := TerminateProc;
  1228. ready.head := NIL; ready.tail := NIL;
  1229. tlsIndex := Kernel32.TlsAlloc();
  1230. ASSERT ( tlsIndex # Kernel32.TLSOutOfIndexes );
  1231. Kernel32.SendToDebugger("Modules.root", ADDRESSOF(Modules.root));
  1232. Init
  1233. END Objects.
  1234. (*
  1235. 24.03.1998 pjm Started
  1236. 06.05.1998 pjm CreateProcess init process, page fault handler
  1237. 06.08.1998 pjm Moved exception interrupt handling here for current process
  1238. 17.08.1998 pjm FindRoots method
  1239. 02.10.1998 pjm Idle process
  1240. 06.11.1998 pjm snapshot
  1241. 25.03.1999 pjm Scope removed
  1242. 28.05.1999 pjm EventHandler object
  1243. 01.06.1999 pjm Fixed InterruptProcess lock error
  1244. 16.06.1999 pjm Flat IRQ priority model to avoid GC deadlock
  1245. 23.06.1999 pjm Flat IRQ priority experiment failed, rather do STI in FieldIRQ to avoid GC deadlock
  1246. 29.06.1999 pjm Timeout in EventHandler object
  1247. 13.01.2000 pjm Overed (Interrupt Objects, Event Handlers, Process ID, Process state, Process mode, Process stack, Await)
  1248. 17.10.2000 pjm Priorities
  1249. 22.10.2003 mib SSE2 extension
  1250. 24.10.2003 phk Priority inversion / cycle counters
  1251. Stack invariant for GC:
  1252. o if process is running, the processor registers contain its state
  1253. o if process is not running, at least state.ESP is valid, and between stack.adr and stack.high (for GC)
  1254. o when releasing the Ready lock, make sure the process state is up to date
  1255. *)
  1256. SystemTools.ShowStacks ~
  1257. Heaps.SetMetaData
  1258. StaticLinker.Link --fileFormat=PE32 --fileName=A2GC.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands FIles WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~