EFI.I386.Machine.Mod 117 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750
  1. MODULE Machine; (** AUTHOR "pjm"; PURPOSE "Bootstrapping, configuration and machine interface"; *)
  2. (* The code of this module body must be the first in the statically linked boot file. *)
  3. IMPORT SYSTEM, Trace;
  4. CONST
  5. Version = "A2 Revision 5296 (10.04.2013)";
  6. MaxCPU* = 8; (** maximum number of processors (up to 16) *)
  7. DefaultObjectFileExtension* = ".Gof";
  8. (** bits in features variable *)
  9. MTTR* = 12; MMX* = 23; HTT* = 28;
  10. MaxDisks = 2; (* maximum number of disks with BIOS parameters *)
  11. HeapAdr = 100000H;
  12. MaxMemTop = (80000000H);
  13. DefaultDMASize = 20; (* default size of ISA DMA area in KB *)
  14. IsCooperative*= FALSE;
  15. CONST
  16. StrongChecks = FALSE; (* perform strong checks *)
  17. Stats* = FALSE; (* acquire statistics *)
  18. TimeCount = 0 (* 100000 *); (* number of lock tries before checking timeout - 0 to disable *)
  19. (** standard lock levels (in order) *) (* also refer to Traps.Show *)
  20. TraceOutput* = 0; (* Trace output *)
  21. Memory* = 1; (* Virtual memory management, stack and page allocation *)
  22. Heaps* = 2; (* Storage allocation and Garbage collection *)
  23. Interrupts* = 3 ; (* Interrupt handling. *)
  24. Modules* = 4; (* Module list *)
  25. Objects* = 5; (* Ready queue *)
  26. Processors* = 6; (* Interprocessor interrupts *)
  27. KernelLog* = 7; (* Atomic output *)
  28. (** highest level is all object locks *)
  29. Preemption* = 31; (** flag for BreakAll *)
  30. MaxLocks = 8; (* { <= 32 } *)
  31. LowestLock = 0; HighestLock = MaxLocks-1;
  32. CONST
  33. TraceVerbose = TRUE; (* write out verbose trace info *)
  34. AddressSize = SIZEOF(ADDRESS);
  35. SetSize = MAX (SET) + 1;
  36. (** error codes *)
  37. Ok* = 0;
  38. (* standard multipliers *)
  39. K = 1024; M = 100000H; (* 1K, 1M *)
  40. (* paging sizes *)
  41. PS = 4096; (* page size in bytes *)
  42. PSlog2 = 12; (* ASH(1, PSlog2) = PS *)
  43. RS = 4*M; (* region covered by a page table in bytes *)
  44. PTEs = RS DIV PS; (* number of page table/directory entries *)
  45. ReservedPages = 8; (* pages reserved on page heap (not for normal heap use) *)
  46. NilAdr* = -1; (** nil value for addresses (not same as pointer NIL value) *)
  47. (* free page stack page node layout *)
  48. NodeSP = 0;
  49. NodeNext = AddressSize;
  50. NodePrev = AddressSize*2;
  51. MinSP = AddressSize*3; MaxSP = PS;
  52. (*
  53. 0 sp
  54. AddressSize nextAdr
  55. AddressSize*2 prevAdr
  56. AddressSize*3 first entry
  57. 4092 last entry
  58. *)
  59. (* virtual memory layout. no area will cross the 2G boundary, to avoid LONGINT sign problems. *)
  60. MapAreaAdr = (80000000H); (* dynamic mappings: bottom part of 2G..4G *)
  61. MapAreaSize = 64*M;
  62. IntelAreaAdr = (0FEE00000H); (* reserved by Intel for APIC: 4G-18M..4G-18M+4K *)
  63. IntelAreaSize = 00001000H;
  64. StackAreaAdr = MapAreaAdr+MapAreaSize; (* stacks: middle part of 2G..4G *)
  65. StackAreaSize = IntelAreaAdr-StackAreaAdr;
  66. (* stack sizes *)
  67. KernelStackSize = 2*PS; (* multiple of PS *)
  68. MaxUserStackSize = 128*K; (* multiple of PS *)
  69. InitUserStackSize = PS; (* must be PS (or change NewStack) *)
  70. UserStackGuardSize = PS; (* multiple of PS left unallocated at bottom of stack virtual area *)
  71. MaxUserStacks = StackAreaSize DIV MaxUserStackSize;
  72. (* physical memory layout *)
  73. LowAdr = PS; (* lowest physical address used *)
  74. LinkAdr = M; (* address where kernel is linked, also address where heap begins *)
  75. StaticBlockSize = 32; (* static heap block size *)
  76. BlockHeaderSize = 2 * AddressSize;
  77. RecordDescSize = 4 * AddressSize; (* needs to be adapted in case Heaps.RecordDesc is changed *)
  78. (* gdt indices *)
  79. TSSOfs = 6; (* offset in GDT of TSSs *)
  80. StackOfs = TSSOfs + MaxCPU; (* offset in GDT of stacks *)
  81. GDTSize = StackOfs + MaxCPU;
  82. (* gdt selectors *)
  83. KernelCodeSel = 1*8; (* selector 1 in gdt, RPL 0 *)
  84. KernelStackSel = 2*8; (* selector 2 in gdt, RPL 0 *)
  85. UserCodeSel = 3*8 + 3; (* selector 3 in gdt, RPL 3 *)
  86. DataSel = 4*8; (* selector 4 in gdt, RPL 0 *)
  87. UserStackSel = 5*8 + 3; (* selector 5 in gdt, RPL 3 *)
  88. KernelTR = TSSOfs*8; (* selector in gdt, RPL 0 *)
  89. (* paging flags *)
  90. PageNotPresent = 0; (* not present page *)
  91. KernelPage = 3; (* supervisor, present, r/w *)
  92. UserPage = 7; (* user, present, r/w *)
  93. HeapMin = 50; (* "minimum" heap size as percentage of total memory size (used for heap expansion in scope of GC ) *)
  94. HeapMax = 95; (* "maximum" heap size as percentage of total memory size (used for heap expansion in scope of GC) *)
  95. ExpandRate = 1; (* always extend heap with at least this percentage of total memory size *)
  96. Threshold = 10; (* periodic GC initiated when this percentage of total memory size bytes has "passed through" NewBlock *)
  97. InitialHeapIncrement = 4096;
  98. HeaderSize = 40H; (* cf. Linker0 *)
  99. EndBlockOfs = 38H; (* cf. Linker0 *)
  100. MemoryBlockOfs = BlockHeaderSize + RecordDescSize + BlockHeaderSize; (* memory block (including header) starts at offset HeaderSize *)
  101. CONST
  102. (** pre-defined interrupts 0-31, used with InstallHandler *)
  103. DE* = 0; DB* = 1; NMI* = 2; BP* = 3; OVF* = 4; BR* = 5; UD* = 6; NM* = 7;
  104. DF* = 8; TS* = 10; NP* = 11; SSF* = 12; GP* = 13; PF* = 14; MF*= 16; AC*= 17; MC* = 18;
  105. IRQ0* = 32; (* {IRQ0 MOD 8 = 0} *)
  106. IRQ2 = IRQ0 + 2;
  107. IRQ7 = IRQ0 + 7;
  108. IRQ8 = IRQ0 + 8;
  109. IRQ15 = 47;
  110. MaxIRQ* = IRQ15; (** hardware interrupt numbers *)
  111. MPKC* = 49; (** SMP: kernel call *)
  112. SoftInt* = 58; (** temporary software interrupt *)
  113. MPIPCLocal* = 59; (** SMP: local interprocessor interrupt *)
  114. MPTMR* = 60; (** SMP: timer interrupt *)
  115. MPIPC* = 61; (** SMP: interprocessor interrupt *)
  116. MPERR* = 62; (** SMP: error interrupt *)
  117. MPSPU* = 63; (** SMP: spurious interrupt {MOD 16 = 15} *)
  118. IDTSize = 64;
  119. MaxNumHandlers = 16;
  120. TraceSpurious = FALSE; (* no message on spurious hardware interrupts *)
  121. HandleSpurious = TRUE OR TraceSpurious; (* do not trap on spurious interrupts *)
  122. IntA0 = 020H; IntA1 = 021H; (* Interrupt Controller 1 *)
  123. IntB0 = 0A0H; IntB1 = 0A1H; (* Interrupt Controller 2 *)
  124. (** EFLAGS bits *)
  125. IFBit* = 9; VMBit* = 17;
  126. KernelLevel* = 0; UserLevel* = 3; (** CS MOD 4 *)
  127. Second* = 1000; (* frequency of ticks increments in Hz *)
  128. CONST
  129. Self* = 0; FrontBarrier* = 1; BackBarrier* = 2; (** Broadcast flags. *)
  130. TraceApic = FALSE;
  131. TraceProcessor = FALSE; (* remove this hack! *)
  132. ClockRateDelay = 50; (* ms - delay when timing bus clock rate *)
  133. TimerClock = 1193180; (* timer clock is 1.19318 MHz *)
  134. CONST
  135. (* low level tracing *)
  136. TraceV24 = 2; TraceScreen = 0;
  137. TraceWidth = 80; TraceHeight = 25;
  138. TraceLen = TraceWidth * SIZEOF (INTEGER);
  139. TraceSize = TraceLen * TraceHeight;
  140. TYPE
  141. Vendor* = ARRAY 13 OF CHAR;
  142. IDMap* = ARRAY 16 OF SHORTINT;
  143. TYPE
  144. Stack* = RECORD (** values are read-only *)
  145. low: ADDRESS; (* lowest virtual address that may be allocated for stack *)
  146. adr*: ADDRESS; (* lowest address on allocated stack *) (* exported for Objects only *)
  147. high*: ADDRESS; (* next virtual address after stack *) (* exported for Objects only *)
  148. END;
  149. (* task state segment *)
  150. TSSDesc = RECORD (* 1, p. 485 and p. 612 for required fields *)
  151. Link: LONGINT; (* lower 16 bits significant *)
  152. ESP0: LONGINT;
  153. ESS0: LONGINT; (* lower 16 bits significant *)
  154. ESP1: LONGINT;
  155. ESS1: LONGINT; (* lower 16 bits significant *)
  156. ESP2: LONGINT;
  157. ESS2: LONGINT; (* lower 16 bits significant *)
  158. CR3: LONGINT;
  159. EIP: LONGINT;
  160. EFLAGS: SET;
  161. EAX, ECX, EDX, EBX, ESP, EBP, ESI, EDI: LONGINT;
  162. ES, CS, SS, DS, FS, GS: LONGINT; (* lower 16 bits significant *)
  163. LDT: LONGINT; (* lower 16 bits significant *)
  164. TaskAttributes: INTEGER;
  165. IOBitmapOffset: INTEGER
  166. (* Implicit: IOBitmap: ARRAY 8192 DIV 4 OF SET *)
  167. END;
  168. Startup* = PROCEDURE; (** can not be a method *)
  169. (* global descriptor table *)
  170. SegDesc = RECORD
  171. low, high: LONGINT
  172. END;
  173. GDT = ARRAY GDTSize OF SegDesc;
  174. Range* = RECORD
  175. adr*: ADDRESS; size*: SIZE;
  176. END;
  177. TYPE
  178. (** processor state, ordering of record fields is predefined! *)
  179. State* = RECORD (* offsets used in FieldInterrupt, FieldIRQ and Objects.RestoreState *)
  180. EDI*, ESI*, ERR*, ESP0*, EBX*, EDX*, ECX*, EAX*: LONGINT; (** ESP0 = ADR(s.INT) *)
  181. INT*, BP*, PC*, CS*: LONGINT; (* BP and ERR are exchanged by glue code, for procedure link *)
  182. FLAGS*: SET;
  183. SP*, SS*: LONGINT; (** only valid if (VMBit IN s.EFLAGS) OR (CS MOD 4 < s.CS MOD 4) *)
  184. ES*, DS*, FS*, GS*: LONGINT; (** only valid if (VMBit IN s.FLAGS) *)
  185. END;
  186. (** exception state, ordering of record fields is predefined! *)
  187. ExceptionState* = RECORD
  188. halt*: ADDRESS; (** halt code *)
  189. pf*: ADDRESS; (** page fault address *)
  190. locks*: SET; (** active locks *)
  191. SP*: ADDRESS; (** actual ESP value at time of interrupt *)
  192. SS*, ES*, DS*, FS*, GS*: LONGINT; (** segment registers *)
  193. CR*: ARRAY 5 OF LONGINT; (** control registers *)
  194. DR*: ARRAY 8 OF LONGINT; (** debug registers *)
  195. FPU*: ARRAY 7 OF SET (** floating-point state *)
  196. END;
  197. Handler* = PROCEDURE {DELEGATE} (VAR state: State);
  198. HandlerRec = RECORD
  199. valid: BOOLEAN; (* offset 0 *)
  200. handler: Handler (* offset 4 *)
  201. END;
  202. GateDescriptor = RECORD
  203. offsetBits0to15: INTEGER;
  204. selector: INTEGER;
  205. gateType: INTEGER;
  206. offsetBits16to31: INTEGER
  207. END;
  208. IDT = ARRAY IDTSize OF GateDescriptor;
  209. SSEState* = ARRAY (512+16) OF CHAR;
  210. TYPE
  211. MemoryBlock* = POINTER TO MemoryBlockDesc;
  212. MemoryBlockDesc* = RECORD
  213. next- {UNTRACED}: MemoryBlock;
  214. startAdr-: ADDRESS; (* unused field for I386 *)
  215. size-: SIZE; (* unused field for I386 *)
  216. beginBlockAdr-, endBlockAdr-: ADDRESS
  217. END;
  218. TYPE
  219. EventHandler = PROCEDURE (id: LONGINT; CONST state: State);
  220. Message* = POINTER TO RECORD END; (** Broadcast message. *)
  221. BroadcastHandler = PROCEDURE (id: LONGINT; CONST state: State; msg: Message);
  222. TimeArray = ARRAY MaxCPU OF HUGEINT;
  223. Address32* = LONGINT;
  224. VAR
  225. lowTop*: ADDRESS; (** top of low memory *)
  226. memTop*: ADDRESS; (** top of memory *)
  227. dmaSize*: SIZE; (** size of ISA dma area, above lowTop (for use in Aos.Diskettes) *)
  228. configMP: ADDRESS; (** MP spec config table physical address (outside reported RAM) *)
  229. revMP: CHAR; (** MP spec revision *)
  230. featureMP: ARRAY 5 OF CHAR; (** MP spec feature bytes 1-5 *)
  231. version-: ARRAY 64 OF CHAR; (** Aos version *)
  232. SSESupport-: BOOLEAN;
  233. SSE2Support-: BOOLEAN;
  234. SSE3Support-: BOOLEAN; (* PH 04/11*)
  235. SSSE3Support-: BOOLEAN;
  236. SSE41Support-: BOOLEAN;
  237. SSE42Support-: BOOLEAN;
  238. SSE5Support-: BOOLEAN;
  239. AVXSupport-: BOOLEAN;
  240. features-, features2-: SET; (** processor features *)
  241. fcr*: SET; (** default floating-point control register value (default rounding mode is towards -infinity, for ENTIER) *)
  242. mhz*: HUGEINT; (** clock rate of GetTimer in MHz, or 0 if not known *)
  243. chs: ARRAY MaxDisks OF RECORD cyls, hds, spt: LONGINT END;
  244. initRegs0, initRegs1: LONGINT;
  245. initRegs: ARRAY 2 OF LONGINT; (* kernel parameters *)
  246. fbadr*, fbInfoPtr*: ADDRESS;
  247. config: ARRAY 2048 OF CHAR; (* config strings *)
  248. bootFlag: ADDRESS;
  249. idAdr: ADDRESS; (* address of processor ID register *)
  250. map: IDMap;
  251. bootID: LONGINT; (* ID of boot processor (0) *)
  252. numberOfProcessors: LONGINT; (* number of processors installed during start up *)
  253. coresPerProcessor : LONGINT; (* number of cores per physical package *)
  254. threadsPerCore : LONGINT; (* number of threads per core *)
  255. CONST
  256. CacheLineSize = 128;
  257. TYPE
  258. (* Synchronization variables should reside in own cache line. This data structure should be aligned to CacheLineSize. *)
  259. Lock = RECORD
  260. locked : BOOLEAN;
  261. filler : ARRAY CacheLineSize - 1 OF CHAR;
  262. END;
  263. VAR
  264. lock: ARRAY MaxLocks OF Lock; (** all locks *)
  265. (*
  266. Every element in the proc array belongs to one processor. It is therefore sufficient to disable interrupts to protect the consistency of these elements. Race conditions with interrupts handled on the same processor are avoided by disabling interrupts for the entire time that a lock is held (using locksHeld & state). The data structures are padded to CacheLineSize to separate the locks out on cache lines of their own, to avoid false sharing.
  267. *)
  268. proc-, trapState-: ARRAY MaxCPU OF RECORD
  269. locksHeld-: SET; (** locks held by a processor *)
  270. state-: SET; (** processor flags (interrupt state) at entry to its first lock *)
  271. preemptCount-: LONGINT; (** if 0, preemption is allowed *)
  272. padding : ARRAY CacheLineSize - 12 OF CHAR;
  273. END;
  274. (* the data structures above should be aligned to CacheLineSize *)
  275. padding : ARRAY 92 OF CHAR;
  276. trapLocksBusy-: SET;
  277. maxTime: LONGINT;
  278. VAR
  279. gdt: GDT; (* global descriptor table *)
  280. procm: ARRAY MaxCPU OF RECORD (* indexed by ID () *)
  281. tss: TSSDesc;
  282. sp: ADDRESS; (* snapshot for GC *)
  283. stack: Stack
  284. END;
  285. kernelPD: ADDRESS; (* physical address of page directory *)
  286. freeLowPage: ADDRESS; (* free low page stack pointer (link at offset 0 in page). All addresses physical. NIL = -1 *)
  287. freeLowPages, freeHighPages, totalPages: LONGINT; (* number of free pages and total number of pages *)
  288. mapTop: ADDRESS; (* virtual address of end of memory mapping area *)
  289. heapEndAdr: ADDRESS; (* virtual address of end of heap (page aligned) *)
  290. topPageNum: LONGINT; (* page containing byte memTop-1 *)
  291. pageHeapAdr: ADDRESS; (* address (physical and virtual) of bottom of page heap area *)
  292. pageStackAdr: ADDRESS; (* virtual address of top page of free page stack *)
  293. freeStack: ARRAY (MaxUserStacks+SetSize-1) DIV SetSize OF SET; (* free stack bitmap *)
  294. freeStackIndex: LONGINT; (* current position in bitmap (rotates) *)
  295. Nbigskips-: LONGINT; (* number of times a stack was extended leaving a hole *)
  296. Nfilled-: LONGINT; (* number of times a "hole" in a stack was filled *)
  297. NnewStacks-, NnewStackLoops-, NnewStackInnerLoops-, NdisposeStacks-,
  298. NlostPages-, NreservePagesUsed-, NmaxUserStacks-: LONGINT;
  299. VAR
  300. idt: IDT; (* interrupt descriptor table *)
  301. glue: ARRAY IDTSize OF ARRAY 15 OF CHAR; (* code *)
  302. intHandler: ARRAY IDTSize, MaxNumHandlers OF HandlerRec; (* array of handlers for interrupts, the table is only filled up to MaxNumHandlers - 1, the last element in each row acts as a sentinel *)
  303. stateTag: ADDRESS;
  304. default: HandlerRec;
  305. i, j, ticks*: LONGINT; (** timer ticks. Use Kernel.GetTicks() to read, don't write *)
  306. VAR
  307. ipcBusy, ipcFlags, ipcFrontBarrier, ipcBackBarrier: SET;
  308. ipcHandler: BroadcastHandler;
  309. ipcMessage: Message;
  310. numProcessors-: LONGINT; (* number of processors we attempted to boot (some may have failed) *)
  311. maxProcessors: LONGINT; (* max number of processors we are allowed to boot (-1 for uni) *)
  312. allProcessors-: SET; (* IDs of all successfully booted processors *)
  313. localAPIC: ADDRESS; (* address of local APIC, 0 if not present *)
  314. apicVer: ARRAY MaxCPU OF LONGINT; (* APIC version *)
  315. started: ARRAY MaxCPU OF BOOLEAN; (* CPU started successfully / CPU halted *)
  316. busHz0, busHz1: ARRAY MaxCPU OF LONGINT; (* unrounded and rounded bus speed in Hz *)
  317. timer: EventHandler;
  318. timerRate: LONGINT; (* Hz - rate at which CPU timers run - for timeslicing and profiling *)
  319. stopped: BOOLEAN; (* StopAll was called *)
  320. idMap: IDMap;
  321. revIDmap: ARRAY MaxCPU OF SHORTINT;
  322. time: TimeArray;
  323. eventCount, eventMax: LONGINT;
  324. event: Handler;
  325. expandMin, heapMinKB, heapMaxKB : SIZE;
  326. gcThreshold-: SIZE;
  327. memBlockHead-{UNTRACED}, memBlockTail-{UNTRACED}: MemoryBlock; (* refer to the same memory block for I386, not traced by GC *)
  328. initialMemBlock: MemoryBlockDesc;
  329. traceProcessorProc*: EventHandler; (** temp tracing *)
  330. traceProcessor: BOOLEAN;
  331. Timeslice*: Handler;
  332. start*: PROCEDURE;
  333. VAR
  334. traceMode: SET; (* tracing mode: Screen or V24 *)
  335. traceBase: ADDRESS; (* screen buffer base address *)
  336. tracePos: SIZE; (* current screen cursor *)
  337. tracePort: LONGINT; (* serial base port *)
  338. traceColor: SHORTINT; (* current screen tracing color *)
  339. (** -- Processor identification -- *)
  340. (** Return current processor ID (0 to MaxNum-1). *)
  341. PROCEDURE ID* (): LONGINT;
  342. CODE {SYSTEM.i386}
  343. MOV EAX, idAdr
  344. LEA EBX, map
  345. MOV EAX, [EAX]
  346. SHR EAX, 24
  347. AND EAX, 15
  348. MOV AL, [EBX+EAX]
  349. END ID;
  350. (** -- Miscellaneous -- *)
  351. (** This procedure should be called in all spin loops as a hint to the processor (e.g. Pentium 4). *)
  352. PROCEDURE -SpinHint*;
  353. CODE {SYSTEM.i386}
  354. XOR ECX, ECX ; just in case some processor interprets REP this way
  355. REP NOP ; PAUSE instruction; NOP on pre-P4 processors, Spin Loop Hint on P4 and after
  356. END SpinHint;
  357. (** Fill "size" bytes at "destAdr" with "filler". "size" must be multiple of 4. *)
  358. PROCEDURE Fill32* (destAdr: ADDRESS; size: SIZE; filler: ADDRESS);
  359. CODE {SYSTEM.i386}
  360. MOV EDI, [EBP+destAdr]
  361. MOV ECX, [EBP+size]
  362. MOV EAX, [EBP+filler]
  363. TEST ECX, 3
  364. JZ ok
  365. PUSH 8 ; ASSERT failure
  366. INT 3
  367. ok:
  368. SHR ECX, 2
  369. CLD
  370. REP STOSD
  371. END Fill32;
  372. (** Return timer value of the current processor, or 0 if not available. *)
  373. (* e.g. ARM does not have a fine-grained timer *)
  374. PROCEDURE -GetTimer* (): HUGEINT;
  375. CODE {SYSTEM.Pentium}
  376. RDTSC ; set EDX:EAX
  377. END GetTimer;
  378. (** Disable interrupts and return old interrupt state. *)
  379. PROCEDURE -DisableInterrupts* (): SET;
  380. CODE {SYSTEM.i386}
  381. PUSHFD
  382. CLI
  383. POP EAX
  384. END DisableInterrupts;
  385. (** Restore interrupt state. Parameter s must be return value of earlier DisableInterrupts call on same processor. *)
  386. PROCEDURE -RestoreInterrupts* (s: SET);
  387. CODE {SYSTEM.i386}
  388. POPFD
  389. END RestoreInterrupts;
  390. (** Return TRUE iff interrupts are enabled on the current processor. *)
  391. PROCEDURE -InterruptsEnabled* (): BOOLEAN;
  392. CODE {SYSTEM.i386}
  393. PUSHFD
  394. POP EAX
  395. SHR EAX, 9
  396. AND AL, 1
  397. END InterruptsEnabled;
  398. (** -- Processor initialization -- *)
  399. PROCEDURE -SetFCR (s: SET);
  400. CODE {SYSTEM.i386, SYSTEM.FPU}
  401. FLDCW [ESP] ; parameter s
  402. POP EAX
  403. END SetFCR;
  404. PROCEDURE -FCR (): SET;
  405. CODE {SYSTEM.i386, SYSTEM.FPU}
  406. PUSH 0
  407. FNSTCW [ESP]
  408. FWAIT
  409. POP EAX
  410. END FCR;
  411. PROCEDURE -InitFPU;
  412. CODE {SYSTEM.i386, SYSTEM.FPU}
  413. FNINIT
  414. END InitFPU;
  415. (** Setup FPU control word of current processor. *)
  416. PROCEDURE SetupFPU*;
  417. BEGIN
  418. InitFPU; SetFCR(fcr)
  419. END SetupFPU;
  420. (* Set up flags (3, p. 20)
  421. Bit
  422. 1,3,5,15,19..31 - no change
  423. 0,2,4,6..7,11 - CF,PF,AF,ZF,SF,OF off
  424. 8 - TF off
  425. 9 - IF off (no interrupts)
  426. 10 - DF off
  427. 12..13 - IOPL = 3
  428. 14 - NT off (no Windows)
  429. 16 - RF off (no Interference)
  430. 17- VM off (no virtual 8086 mode)
  431. 18 - AC off (no 486 alignment checks) *)
  432. PROCEDURE -SetupFlags;
  433. CODE {SYSTEM.i386}
  434. PUSHFD
  435. AND DWORD [ESP], 0FFF8802AH
  436. OR DWORD [ESP], 3000H
  437. POPFD
  438. END SetupFlags;
  439. (* Set up various 486-specific flags (3, p. 23)
  440. 1. Enable exception 16 on math errors.
  441. 2. Disable supervisor mode faults on write to read-only pages
  442. (386-compatible for stack checking).
  443. 3. Enable the Alignment Check field in EFLAGS *)
  444. PROCEDURE -Setup486Flags;
  445. CODE {SYSTEM.i386, SYSTEM.Privileged}
  446. MOV EAX, CR0
  447. OR EAX, 00040020H
  448. AND EAX, 0FFFEFFFFH
  449. MOV CR0, EAX
  450. END Setup486Flags;
  451. (* Set up 586-specific things *)
  452. PROCEDURE -Setup586Flags;
  453. CODE {SYSTEM.Pentium, SYSTEM.Privileged}
  454. MOV EAX, CR4
  455. BTR EAX, 2 ; clear TSD
  456. MOV CR4, EAX
  457. END Setup586Flags;
  458. (* setup SSE and SSE2 extension *)
  459. PROCEDURE SetupSSE2Ext;
  460. CONST
  461. FXSRFlag = 24; (*IN features from EBX*)
  462. SSEFlag = 25;
  463. SSE2Flag = 26;
  464. SSE3Flag = 0; (*IN features2 from ECX*) (*PH 04/11*)
  465. SSSE3Flag =9;
  466. SSE41Flag =19;
  467. SSE42Flag =20;
  468. SSE5Flag = 11;
  469. AVXFlag = 28;
  470. BEGIN
  471. SSE2Support := FALSE;
  472. SSE3Support := FALSE;
  473. SSSE3Support := FALSE;
  474. SSE41Support := FALSE;
  475. SSE42Support := FALSE;
  476. SSE5Support := FALSE;
  477. AVXSupport := FALSE;
  478. (* checking for SSE support *)
  479. IF SSEFlag IN features THEN
  480. SSESupport := TRUE;
  481. (* checking for SSE2 support *)
  482. IF SSE2Flag IN features THEN SSE2Support := TRUE;
  483. (* checking for SSE3... support*)(*PH 04/11*)
  484. IF SSE3Flag IN features2 THEN SSE3Support := TRUE;
  485. IF SSSE3Flag IN features2 THEN SSSE3Support := TRUE END;
  486. IF SSE41Flag IN features2 THEN SSE41Support := TRUE;
  487. IF SSE42Flag IN features2 THEN SSE42Support := TRUE END;
  488. END;
  489. IF SSE5Flag IN features2 THEN SSE5Support := TRUE END;
  490. IF AVXFlag IN features2 THEN AVXSupport := TRUE END;
  491. END;
  492. END;
  493. (* checking for support for the FXSAVE and FXRSTOR instruction *)
  494. IF FXSRFlag IN features THEN InitSSE END;
  495. END;
  496. END SetupSSE2Ext;
  497. PROCEDURE -InitSSE;
  498. CODE {SYSTEM.Pentium, SYSTEM.Privileged}
  499. MOV EAX, CR4
  500. OR EAX, 00000200H ; set bit 9 (OSFXSR)
  501. AND EAX, 0FFFFFBFFH ; delete bit 10 (OSXMMEXCPT)
  502. MOV CR4, EAX
  503. END InitSSE;
  504. (* Disable exceptions caused by math in new task. (1, p. 479) *)
  505. PROCEDURE -DisableMathTaskEx;
  506. CODE {SYSTEM.i386, SYSTEM.Privileged}
  507. MOV EAX,CR0
  508. AND AL, 0F5H
  509. MOV CR0, EAX
  510. END DisableMathTaskEx;
  511. (* Disable math emulation (1, p. 479) , bit 2 of CR0 *)
  512. PROCEDURE -DisableEmulation;
  513. CODE {SYSTEM.i386, SYSTEM.Privileged}
  514. MOV EAX, CR0
  515. AND AL, 0FBH
  516. MOV CR0, EAX
  517. END DisableEmulation;
  518. (** CPU identification *)
  519. PROCEDURE CPUID*(function :ADDRESS; VAR eax, ebx, ecx, edx : SET);
  520. CODE {SYSTEM.i386, SYSTEM.Pentium}
  521. MOV EAX, [EBP+function] ; CPUID function parameter
  522. MOV ESI, [EBP+ecx] ; copy ecx into ECX (sometimes used as input parameter)
  523. MOV ECX, [ESI]
  524. CPUID ; execute CPUID
  525. MOV ESI, [EBP+eax] ; copy EAX into eax;
  526. MOV [ESI], EAX
  527. MOV ESI, [EBP+ebx] ; copy EBX into ebx
  528. MOV [ESI], EBX
  529. MOV ESI, [EBP+ecx] ; copy ECX into ecx
  530. MOV [ESI], ECX
  531. MOV ESI, [EBP+edx] ; copy EDX into edx
  532. MOV [ESI], EDX
  533. END CPUID;
  534. (* If the CPUID instruction is supported, the ID flag (bit 21) of the EFLAGS register is r/w *)
  535. PROCEDURE CpuIdSupported*() : BOOLEAN;
  536. CODE {SYSTEM.i386}
  537. PUSHFD ; save EFLAGS
  538. POP EAX ; store EFLAGS in EAX
  539. MOV EBX, EAX ; save EBX for later testing
  540. XOR EAX, 00200000H ; toggle bit 21
  541. PUSH EAX ; push to stack
  542. POPFD ; save changed EAX to EFLAGS
  543. PUSHFD ; push EFLAGS to TOS
  544. POP EAX ; store EFLAGS in EAX
  545. CMP EAX, EBX ; see if bit 21 has changed
  546. SETNE AL; ; return TRUE if bit 21 has changed, FALSE otherwise
  547. END CpuIdSupported;
  548. (** Initialise current processor. Must be called by every processor. *)
  549. PROCEDURE InitProcessor*;
  550. BEGIN
  551. SetupFlags;
  552. Setup486Flags;
  553. Setup586Flags;
  554. DisableMathTaskEx;
  555. DisableEmulation;
  556. SetupFPU;
  557. SetupSSE2Ext
  558. END InitProcessor;
  559. (** Initialize APIC ID address. *)
  560. PROCEDURE InitAPICIDAdr* (adr: ADDRESS; CONST m: IDMap);
  561. VAR s: SET;
  562. BEGIN
  563. s := DisableInterrupts ();
  564. idAdr := adr; map := m;
  565. RestoreInterrupts (s)
  566. END InitAPICIDAdr;
  567. PROCEDURE InitBoot;
  568. VAR
  569. largestFunction, i: LONGINT;
  570. eax, ebx, ecx, edx : SET;
  571. logicalProcessorCount : LONGINT;
  572. u: ARRAY 8 OF CHAR; vendor : Vendor;
  573. PROCEDURE GetString(VAR string : ARRAY OF CHAR; offset : LONGINT; register : SET);
  574. BEGIN
  575. string[offset] :=CHR(SYSTEM.VAL(LONGINT, register * {0..7}));
  576. string[offset+1] := CHR(SYSTEM.VAL(LONGINT, LSH(register * {8..15}, -8)));
  577. string[offset+2] := CHR(SYSTEM.VAL(LONGINT, LSH(register * {16..23}, -16)));
  578. string[offset+3] := CHR(SYSTEM.VAL(LONGINT, LSH(register * {24..31}, -24)));
  579. END GetString;
  580. BEGIN
  581. vendor := "Unknown"; features := {}; features2 := {};
  582. coresPerProcessor := 1; threadsPerCore := 1;
  583. IF CpuIdSupported() THEN
  584. (* Assume that all processors are the same *)
  585. (* CPUID standard function 0 returns: eax: largest CPUID standard function supported, ebx, edx, ecx: vendor string *)
  586. CPUID(0, eax, ebx, ecx, edx);
  587. largestFunction := SYSTEM.VAL(LONGINT, eax);
  588. ASSERT(LEN(vendor) >= 13);
  589. GetString(vendor, 0, ebx); GetString(vendor, 4, edx); GetString(vendor, 8, ecx); vendor[12] := 0X;
  590. IF (largestFunction >= 1) THEN
  591. (* CPUID standard function 1 returns: CPU features in ecx & edx *)
  592. CPUID(1, eax, ebx, ecx, edx);
  593. features := SYSTEM.VAL(SET, edx);
  594. features2 := SYSTEM.VAL(SET, ecx);
  595. (* The code below is used to determine the number of threads per processor core (hyperthreading). This is required
  596. since processors supporting hyperthreading are listed only once in the MP tables, so we need to know the
  597. exact number of threads per processor to start the processor correctly *)
  598. IF (HTT IN features) THEN (* multithreading supported by CPU *)
  599. (* logical processor count = number of cores * number of threads per core = total number of threads supported *)
  600. logicalProcessorCount := SYSTEM.VAL(LONGINT, LSH(ebx * {16..23}, -16));
  601. IF (vendor = "GenuineIntel") THEN
  602. IF (largestFunction >= 4) THEN
  603. (* CPUID standard function 4 returns: number of processor cores -1 on this die eax[26.31] *)
  604. ecx := SYSTEM.VAL(SET, 0); (* input parameter - must be set to 0 *)
  605. CPUID(4, eax, ebx, ecx, edx);
  606. coresPerProcessor := SYSTEM.VAL(LONGINT, LSH(eax * {26..31}, -26)) + 1;
  607. threadsPerCore := logicalProcessorCount DIV coresPerProcessor;
  608. ELSE
  609. threadsPerCore := logicalProcessorCount;
  610. END;
  611. ELSIF (vendor = "AuthenticAMD") THEN
  612. (* CPUID extended function 1 returns: largest extended function *)
  613. CPUID(80000000H, eax, ebx, ecx, edx);
  614. largestFunction := SYSTEM.VAL(LONGINT, eax - {31}); (* remove sign *)
  615. IF (largestFunction >= 8) THEN
  616. (* CPUID extended function 8 returns: *)
  617. CPUID(80000008H, eax, ebx, ecx, edx);
  618. coresPerProcessor := SYSTEM.VAL(LONGINT, ecx * {0..7}) + 1;
  619. threadsPerCore := logicalProcessorCount DIV coresPerProcessor;
  620. ELSIF (largestFunction >= 1) THEN
  621. (* CPUID extended function 1 returns CmpLegacy bit in ecx *)
  622. CPUID(80000001H, eax, ebx, ecx, edx);
  623. IF 1 IN ecx THEN (* CmpLegacy bit set -> no hyperthreading *)
  624. coresPerProcessor := logicalProcessorCount;
  625. threadsPerCore := 1;
  626. END;
  627. ELSE
  628. (* single-core, single-thread *)
  629. END;
  630. ELSE
  631. Trace.String("Machine: "); Trace.Yellow; Trace.String("Warning: Cannot detect hyperthreading, unknown CPU vendor ");
  632. Trace.String(vendor); Trace.Ln; Trace.Default;
  633. END;
  634. END;
  635. END;
  636. END;
  637. Trace.String("Machine: "); Trace.Int(coresPerProcessor, 0); Trace.String(" cores per physical package, ");
  638. Trace.Int(threadsPerCore, 0); Trace.String(" threads per core.");
  639. Trace.Ln;
  640. InitFPU;
  641. fcr := (FCR () - {0, 2, 3, 10, 11}) + {0 .. 5, 8, 9}; (* default FCR RC=00B *)
  642. bootID := 0; map[0] := 0;
  643. idAdr := ADDRESSOF (bootID);
  644. (* allow user to specify GetTimer rate, for tracing purposes *)
  645. GetConfig ("MHz", u);
  646. i := 0; mhz := StrToInt (i, u);
  647. END InitBoot;
  648. (** -- Configuration and bootstrapping -- *)
  649. (** Return the value of the configuration string specified by parameter name in parameter val. Returns val = "" if the string was not found, or has an empty value. *)
  650. PROCEDURE GetConfig* (CONST name: ARRAY OF CHAR; VAR val: ARRAY OF CHAR);
  651. VAR i, src: LONGINT; ch: CHAR;
  652. BEGIN
  653. ASSERT (name[0] # "="); (* no longer supported, use GetInit instead *)
  654. src := 0;
  655. LOOP
  656. ch := config[src];
  657. IF ch = 0X THEN EXIT END;
  658. i := 0;
  659. LOOP
  660. ch := config[src];
  661. IF (ch # name[i]) OR (name[i] = 0X) THEN EXIT END;
  662. INC (i); INC (src)
  663. END;
  664. IF (ch = 0X) & (name[i] = 0X) THEN (* found: (src^ = 0X) & (name[i] = 0X) *)
  665. i := 0;
  666. REPEAT
  667. INC (src); ch := config[src]; val[i] := ch; INC (i);
  668. IF i = LEN(val) THEN val[i - 1] := 0X; RETURN END (* val too short *)
  669. UNTIL ch = 0X;
  670. val[i] := 0X; RETURN
  671. ELSE
  672. WHILE ch # 0X DO (* skip to end of name *)
  673. INC (src); ch := config[src]
  674. END;
  675. INC (src);
  676. REPEAT (* skip to end of value *)
  677. ch := config[src]; INC (src)
  678. UNTIL ch = 0X
  679. END
  680. END;
  681. val[0] := 0X
  682. END GetConfig;
  683. (** Get CHS parameters of first two BIOS-supported hard disks. *)
  684. PROCEDURE GetDiskCHS* (d: LONGINT; VAR cyls, hds, spt: LONGINT);
  685. BEGIN
  686. cyls := chs[d].cyls; hds := chs[d].hds; spt := chs[d].spt
  687. END GetDiskCHS;
  688. (** Get parameter values from Init string. If n = 0, return val = ASH(bx, 16) + ax, and if n = 1, return val = ASH(dx, 16) + cx, where ax, bx, cx, dx are the register values after the OBL boot loader or noboot.exe have executed the 16-bit x86 code in the Init string. *)
  689. PROCEDURE GetInit* (n: LONGINT; VAR val: LONGINT);
  690. BEGIN
  691. val := initRegs[n]
  692. END GetInit;
  693. (** Convert a string to an integer. Parameter i specifies where in the string scanning should begin (usually 0 in the first call). Scanning stops at the first non-valid character, and i returns the updated position. Parameter s is the string to be scanned. The value is returned as result, or 0 if not valid. Syntax: number = ["-"] digit {digit} ["H" | "h"] . digit = "0" | ... "9" | "A" .. "F" | "a" .. "f" . If the number contains any hexdecimal letter, or if it ends in "H" or "h", it is interpreted as hexadecimal. *)
  694. PROCEDURE StrToInt* (VAR i: LONGINT; CONST s: ARRAY OF CHAR): LONGINT;
  695. VAR vd, vh, sgn, d: LONGINT; hex: BOOLEAN;
  696. BEGIN
  697. vd := 0; vh := 0; hex := FALSE;
  698. IF s[i] = "-" THEN sgn := -1; INC (i) ELSE sgn := 1 END;
  699. LOOP
  700. IF (s[i] >= "0") & (s[i] <= "9") THEN d := ORD (s[i])-ORD ("0")
  701. ELSIF (CAP (s[i]) >= "A") & (CAP (s[i]) <= "F") THEN d := ORD (CAP (s[i]))-ORD ("A") + 10; hex := TRUE
  702. ELSE EXIT
  703. END;
  704. vd := 10*vd + d; vh := 16*vh + d;
  705. INC (i)
  706. END;
  707. IF CAP (s[i]) = "H" THEN hex := TRUE; INC (i) END; (* optional H *)
  708. IF hex THEN vd := vh END;
  709. RETURN sgn * vd
  710. END StrToInt;
  711. (* Delay for IO *)
  712. PROCEDURE -Wait*;
  713. CODE {SYSTEM.i386}
  714. JMP 0
  715. JMP 0
  716. JMP 0
  717. END Wait;
  718. (* Reset processor by causing a double fault. *)
  719. PROCEDURE Reboot;
  720. CODE {SYSTEM.i386, SYSTEM.Privileged}
  721. PUSH 0
  722. PUSH 0
  723. LIDT [ESP]
  724. INT 3
  725. END Reboot;
  726. PROCEDURE -Cli*;
  727. CODE{SYSTEM.i386}
  728. CLI
  729. END Cli;
  730. PROCEDURE -Sti*;
  731. CODE{SYSTEM.i386}
  732. STI
  733. END Sti;
  734. (** Shut down the system. If parameter reboot is set, attempt to reboot the system. *)
  735. PROCEDURE Shutdown* (reboot: BOOLEAN);
  736. VAR i: LONGINT;
  737. BEGIN
  738. Cli;
  739. IF reboot THEN (* attempt reboot *)
  740. Portout8 (70H, 8FX); (* Reset type: p. 5-37 AT Tech. Ref. *)
  741. Wait; Portout8 (71H, 0X); (* Note: soft boot flag was set in InitMemory *)
  742. Wait; Portout8 (70H, 0DX);
  743. Wait; Portout8 (64H, 0FEX); (* reset CPU *)
  744. FOR i := 1 TO 10000 DO END;
  745. Reboot
  746. END;
  747. LOOP END
  748. END Shutdown;
  749. (* Get hard disk parameters. *)
  750. PROCEDURE GetPar (p: ADDRESS; ofs: LONGINT): LONGINT;
  751. VAR ch: CHAR;
  752. BEGIN
  753. SYSTEM.GET (p + 12 + ofs, ch);
  754. RETURN ORD (ch)
  755. END GetPar;
  756. (* Read boot table. *)
  757. PROCEDURE ReadBootTable (bt: ADDRESS);
  758. VAR i, p: ADDRESS; j, d, type, addr, size, heapSize: LONGINT; ch: CHAR;
  759. BEGIN
  760. heapSize := 0; lowTop := 0;
  761. p := bt; d := 0;
  762. LOOP
  763. SYSTEM.GET (p, type);
  764. IF type = -1 THEN
  765. EXIT (* end *)
  766. ELSIF type = 3 THEN (* boot memory/top of low memory *)
  767. SYSTEM.GET (p + 8, addr); SYSTEM.GET (p + 12, size);
  768. lowTop := addr + size
  769. ELSIF type = 4 THEN (* free memory/extended memory size *)
  770. SYSTEM.GET (p + 8, addr); SYSTEM.GET (p + 12, size);
  771. IF addr = HeapAdr THEN heapSize := size END
  772. ELSIF type = 5 THEN (* HD config *)
  773. IF d < MaxDisks THEN
  774. chs[d].cyls := GetPar (p, 0) + 100H * GetPar (p, 1);
  775. chs[d].hds := GetPar (p, 2); chs[d].spt := GetPar (p, 14);
  776. INC (d)
  777. END
  778. ELSIF type = 8 THEN (* config strings *)
  779. i := p + 8; j := 0; (* copy the config strings over *)
  780. LOOP
  781. SYSTEM.GET (i, ch); config[j] := ch; INC (i); INC (j);
  782. IF ch = 0X THEN EXIT END;
  783. REPEAT SYSTEM.GET (i, ch); config[j] := ch; INC (i); INC (j) UNTIL ch = 0X; (* end of name *)
  784. REPEAT SYSTEM.GET (i, ch); config[j] := ch; INC (i); INC (j) UNTIL ch = 0X (* end of value *)
  785. END
  786. END;
  787. SYSTEM.GET (p + 4, size); INC (p, size)
  788. END;
  789. ASSERT((heapSize # 0) & (lowTop # 0));
  790. memTop := HeapAdr + heapSize
  791. END ReadBootTable;
  792. (** Read a byte from the non-volatile setup memory. *)
  793. PROCEDURE GetNVByte* (ofs: LONGINT): CHAR;
  794. VAR c: CHAR;
  795. BEGIN
  796. Portout8 (70H, CHR(ofs)); Wait; Portin8(71H, c);
  797. RETURN c
  798. END GetNVByte;
  799. (** Write a byte to the non-volatile setup memory. *)
  800. PROCEDURE PutNVByte* (ofs: LONGINT; val: CHAR);
  801. BEGIN
  802. Portout8 (70H, CHR(ofs)); Wait; Portout8 (71H, val)
  803. END PutNVByte;
  804. (** Compute a checksum for the Intel SMP spec floating pointer structure. *)
  805. PROCEDURE ChecksumMP* (adr: ADDRESS; size: SIZE): LONGINT;
  806. VAR sum: LONGINT; x: ADDRESS; ch: CHAR;
  807. BEGIN
  808. sum := 0;
  809. FOR x := adr TO adr + size-1 DO
  810. SYSTEM.GET (x, ch);
  811. sum := (sum + ORD(ch)) MOD 256
  812. END;
  813. RETURN sum
  814. END ChecksumMP;
  815. (* Search for MP floating pointer structure. *)
  816. PROCEDURE SearchMem (adr: ADDRESS; size: SIZE): ADDRESS;
  817. VAR x, len: LONGINT; ch: CHAR;
  818. BEGIN
  819. WHILE size > 0 DO
  820. SYSTEM.GET (adr, x);
  821. IF x = 05F504D5FH THEN (* "_MP_" found *)
  822. SYSTEM.GET (adr + 8, ch); len := ORD(ch)*16;
  823. IF len > 0 THEN
  824. SYSTEM.GET (adr + 9, ch);
  825. IF (ch = 1X) OR (ch >= 4X) THEN (* version 1.1 or 1.4 or higher *)
  826. IF ChecksumMP(adr, len) = 0 THEN
  827. RETURN adr (* found *)
  828. END
  829. END
  830. END
  831. END;
  832. INC (adr, 16); DEC (size, 16)
  833. END;
  834. RETURN NilAdr (* not found *)
  835. END SearchMem;
  836. (* Search for MP spec info. *)
  837. PROCEDURE SearchMP;
  838. VAR adr: ADDRESS;
  839. BEGIN
  840. adr := 0;
  841. SYSTEM.GET (040EH, SYSTEM.VAL (INTEGER, adr)); (* EBDA address *)
  842. adr := adr*16;
  843. IF adr < 100000H THEN adr := SearchMem(adr, 1024) (* 1. look in EBDA *)
  844. ELSE adr := NilAdr
  845. END;
  846. IF adr = NilAdr THEN (* 2. look in last kb of base memory *)
  847. adr := SearchMem(lowTop + (-lowTop) MOD 10000H - 1024, 1024);
  848. IF adr = NilAdr THEN (* 3. look at top of physical memory *)
  849. adr := SearchMem(memTop - 1024, 1024);
  850. IF adr = NilAdr THEN (* 4. look in BIOS ROM space *)
  851. adr := SearchMem(0E0000H, 20000H)
  852. END
  853. END
  854. END;
  855. IF adr = NilAdr THEN
  856. revMP := 0X; configMP := NilAdr
  857. ELSE
  858. SYSTEM.GET (adr + 9, revMP);
  859. SYSTEM.MOVE(adr + 11, ADDRESSOF(featureMP[0]), 5); (* feature bytes *)
  860. configMP := SYSTEM.GET32 (adr + 4); (* physical address outside reported RAM (spec 1.4 p. 4-2) *)
  861. IF configMP = 0 THEN configMP := NilAdr END
  862. END
  863. END SearchMP;
  864. (* Allocate area for ISA DMA. *)
  865. PROCEDURE AllocateDMA;
  866. VAR old: ADDRESS;
  867. BEGIN
  868. old := lowTop;
  869. dmaSize := DefaultDMASize*1024;
  870. ASSERT((dmaSize >= 0) & (dmaSize <= 65536));
  871. IF (lowTop-dmaSize) DIV 65536 # (lowTop-1) DIV 65536 THEN (* crosses 64KB boundary *)
  872. DEC (lowTop, lowTop MOD 65536) (* round down to 64KB boundary *)
  873. END;
  874. DEC (lowTop, dmaSize); (* allocate memory *)
  875. dmaSize := old - lowTop (* how much was allocated (including rounding) *)
  876. END AllocateDMA;
  877. (* Check if the specified address is RAM. *)
  878. PROCEDURE IsRAM(adr: ADDRESS): BOOLEAN;
  879. CONST Pattern1 = (0BEEFC0DEH); Pattern2 = (0AA55FF00H);
  880. VAR save, x: ADDRESS; ok: BOOLEAN;
  881. BEGIN
  882. ok := FALSE;
  883. SYSTEM.GET (adr, save);
  884. SYSTEM.PUT (adr, Pattern1); (* attempt 1st write *)
  885. x := Pattern2; (* write something else *)
  886. SYSTEM.GET (adr, x); (* attempt 1st read *)
  887. IF x = Pattern1 THEN (* first test passed *)
  888. SYSTEM.PUT (adr, Pattern2); (* attempt 2nd write *)
  889. x := Pattern1; (* write something else *)
  890. SYSTEM.GET (adr, x); (* attempt 2nd read *)
  891. ok := (x = Pattern2)
  892. END;
  893. SYSTEM.PUT (adr, save);
  894. RETURN ok
  895. END IsRAM;
  896. (* Check amount of memory available and update memTop. *)
  897. PROCEDURE CheckMemory;
  898. CONST M = 100000H; ExtMemAdr = M; Step = M;
  899. VAR s: ARRAY 16 OF CHAR; adr: ADDRESS; i: LONGINT;
  900. BEGIN
  901. GetConfig("ExtMemSize", s); (* in MB *)
  902. IF s[0] # 0X THEN (* override detection *)
  903. i := 0; memTop := ExtMemAdr + StrToInt(i, s) * M;
  904. Trace.String("Machine: Memory: ");
  905. ELSE
  906. Trace.String("Machine: Detecting memory... ");
  907. IF memTop >= 15*M THEN (* search for more memory (ignore aliasing) *)
  908. adr := memTop-4;
  909. WHILE (LSH(memTop, -12) < LSH(MaxMemTop, -12)) & IsRAM(adr) DO
  910. memTop := adr + 4;
  911. INC (adr, Step)
  912. END;
  913. IF (memTop <= 0) THEN memTop := 2047 * M ; END;
  914. END
  915. END;
  916. Trace.Green; Trace.IntSuffix(memTop, 0, "B"); Trace.Ln; Trace.Default;
  917. END CheckMemory;
  918. (* Initialize locks. *)
  919. PROCEDURE InitLocks;
  920. VAR i: LONGINT; s: ARRAY 12 OF CHAR;
  921. BEGIN
  922. IF TimeCount # 0 THEN
  923. GetConfig("LockTimeout", s);
  924. i := 0; maxTime := StrToInt(i, s);
  925. IF maxTime > MAX(LONGINT) DIV 1000000 THEN
  926. maxTime := MAX(LONGINT)
  927. ELSE
  928. maxTime := maxTime * 1000000
  929. END
  930. END;
  931. FOR i := 0 TO MaxCPU-1 DO
  932. proc[i].locksHeld := {}; proc[i].preemptCount := 0
  933. END;
  934. FOR i := 0 TO MaxLocks-1 DO
  935. lock[i].locked := FALSE
  936. END
  937. END InitLocks;
  938. (* Return flags state. *)
  939. PROCEDURE -GetFlags (): SET;
  940. CODE {SYSTEM.i386}
  941. PUSHFD
  942. POP EAX
  943. END GetFlags;
  944. (* Set flags state. *)
  945. PROCEDURE -SetFlags (s: SET);
  946. CODE {SYSTEM.i386}
  947. POPFD
  948. END SetFlags;
  949. PROCEDURE -PushFlags*;
  950. CODE {SYSTEM.i386}
  951. PUSHFD
  952. END PushFlags;
  953. PROCEDURE -PopFlags*;
  954. CODE {SYSTEM.i386}
  955. POPFD
  956. END PopFlags;
  957. (** Disable preemption on the current processor (increment the preemption counter). Returns the current processor ID as side effect. *)
  958. PROCEDURE AcquirePreemption* (): LONGINT;
  959. VAR id: LONGINT;
  960. BEGIN
  961. PushFlags; Cli;
  962. id := ID ();
  963. INC (proc[id].preemptCount);
  964. PopFlags;
  965. RETURN id
  966. END AcquirePreemption;
  967. (** Enable preemption on the current processor (decrement the preemption counter). *)
  968. PROCEDURE ReleasePreemption*;
  969. VAR id: LONGINT;
  970. BEGIN
  971. PushFlags; Cli;
  972. id := ID ();
  973. IF StrongChecks THEN
  974. ASSERT(proc[id].preemptCount > 0)
  975. END;
  976. DEC (proc[id].preemptCount);
  977. PopFlags
  978. END ReleasePreemption;
  979. (** Return the preemption counter of the current processor (specified in parameter). *)
  980. PROCEDURE PreemptCount* (id: LONGINT): LONGINT;
  981. BEGIN
  982. IF StrongChecks THEN
  983. (*ASSERT(~(9 IN GetFlags ()));*) (* interrupts off *) (* commented out because check is too strong *)
  984. ASSERT(id = ID ()) (* caller must specify current processor *)
  985. END;
  986. RETURN proc[id].preemptCount
  987. END PreemptCount;
  988. (* Spin waiting for a lock. Return AL = 1X iff timed out. *)
  989. PROCEDURE AcquireSpinTimeout(VAR locked: BOOLEAN; count: LONGINT; flags: SET): CHAR;
  990. CODE {SYSTEM.i386}
  991. MOV ESI, [EBP+flags] ; ESI := flags
  992. MOV EDI, [EBP+count] ; EDI := count
  993. MOV EBX, [EBP+locked] ; EBX := ADR(locked)
  994. MOV AL, 1 ; AL := 1
  995. CLI ; switch interrupts off before acquiring lock
  996. test:
  997. CMP [EBX], AL ; locked? { AL = 1 }
  998. JE wait ; yes, go wait
  999. XCHG [EBX], AL ; set and read the lock atomically. LOCK prefix implicit.
  1000. CMP AL, 1 ; was locked?
  1001. JNE exit ; no, we have it now, interrupts are off, and AL # 1
  1002. wait:
  1003. ; ASSERT(AL = 1)
  1004. XOR ECX, ECX ; just in case some processor interprets REP this way
  1005. REP NOP ; PAUSE instruction; see SpinHint
  1006. TEST ESI, 200H ; bit 9 - IF
  1007. JZ intoff
  1008. STI ; restore interrupt state quickly to allow pending interrupts (e.g. Processors.StopAll/Broadcast)
  1009. NOP ; NOP required, otherwise STI; CLI not interruptable
  1010. CLI ; disable interrupts
  1011. intoff:
  1012. DEC EDI ; counter
  1013. JNZ test ; not timed out yet
  1014. OR EDI, [EBP+count] ; re-fetch original value & set flags
  1015. JZ test ; if count = 0, retry forever
  1016. ; timed out (AL = 1)
  1017. exit:
  1018. END AcquireSpinTimeout;
  1019. (** Acquire a spin-lock and disable interrupts. *)
  1020. PROCEDURE Acquire* (level: LONGINT);
  1021. VAR id, i: LONGINT; flags: SET; start: HUGEINT;
  1022. BEGIN
  1023. id := AcquirePreemption ();
  1024. flags := GetFlags (); (* store state of interrupt flag *)
  1025. IF StrongChecks THEN
  1026. ASSERT(~(9 IN flags) OR (proc[id].locksHeld = {})); (* interrupts enabled => no locks held *)
  1027. ASSERT(~(level IN proc[id].locksHeld)) (* recursive locks not allowed *)
  1028. END;
  1029. IF (TimeCount = 0) OR (maxTime = 0) THEN
  1030. IF AcquireSpinTimeout(lock[level].locked, 0, flags) = 0X THEN END; (* {interrupts off} *)
  1031. ELSE
  1032. start := GetTimer ();
  1033. WHILE AcquireSpinTimeout(lock[level].locked, TimeCount, flags) = 1X DO
  1034. IF GetTimer () - start > maxTime THEN
  1035. trapState := proc;
  1036. trapLocksBusy := {};
  1037. FOR i := 0 TO MaxLocks-1 DO
  1038. IF lock[i].locked THEN INCL(trapLocksBusy, i) END
  1039. END;
  1040. HALT(1301) (* Lock timeout - see Traps *)
  1041. END
  1042. END
  1043. END;
  1044. IF proc[id].locksHeld = {} THEN
  1045. proc[id].state := flags
  1046. END;
  1047. INCL(proc[id].locksHeld, level); (* we now hold the lock *)
  1048. IF StrongChecks THEN (* no lower-level locks currently held by this processor *)
  1049. ASSERT((level = 0) OR (proc[id].locksHeld * {0..level-1} = {}))
  1050. END
  1051. END Acquire;
  1052. (** Release a spin-lock. Switch on interrupts when last lock released. *)
  1053. PROCEDURE Release* (level: LONGINT);
  1054. VAR id: LONGINT; flags: SET;
  1055. BEGIN (* {interrupts off} *)
  1056. id := ID ();
  1057. IF StrongChecks THEN
  1058. ASSERT(~(9 IN GetFlags ())); (* {interrupts off} *)
  1059. ASSERT(lock[level].locked);
  1060. ASSERT(level IN proc[id].locksHeld)
  1061. END;
  1062. EXCL(proc[id].locksHeld, level);
  1063. IF proc[id].locksHeld = {} THEN
  1064. flags := proc[id].state ELSE flags := GetFlags ()
  1065. END;
  1066. lock[level].locked := FALSE;
  1067. SetFlags(flags);
  1068. ReleasePreemption
  1069. END Release;
  1070. (** Acquire all locks. Only for exceptional cases. *)
  1071. PROCEDURE AcquireAll*;
  1072. VAR lock: LONGINT;
  1073. BEGIN
  1074. FOR lock := HighestLock TO LowestLock BY -1 DO Acquire(lock) END
  1075. END AcquireAll;
  1076. (** Release all locks. Reverse of AcquireAll. *)
  1077. PROCEDURE ReleaseAll*;
  1078. VAR lock: LONGINT;
  1079. BEGIN
  1080. FOR lock := LowestLock TO HighestLock DO Release(lock) END
  1081. END ReleaseAll;
  1082. (** Break all locks held by current processor (for exception handling). Returns levels released. *)
  1083. PROCEDURE BreakAll* (): SET;
  1084. VAR id, level: LONGINT; released: SET;
  1085. BEGIN
  1086. id := AcquirePreemption ();
  1087. PushFlags; Cli;
  1088. released := {};
  1089. FOR level := 0 TO MaxLocks-1 DO
  1090. IF level IN proc[id].locksHeld THEN
  1091. lock[level].locked := FALSE; (* break the lock *)
  1092. EXCL(proc[id].locksHeld, level);
  1093. INCL(released, level)
  1094. END
  1095. END;
  1096. IF proc[id].preemptCount > 1 THEN INCL(released, Preemption) END;
  1097. proc[id].preemptCount := 0; (* clear preemption flag *)
  1098. PopFlags;
  1099. RETURN released
  1100. END BreakAll;
  1101. (** Acquire a fine-grained lock on an active object. *)
  1102. PROCEDURE AcquireObject* (VAR locked: BOOLEAN);
  1103. CODE {SYSTEM.i386}
  1104. PUSHFD
  1105. MOV EBX, [EBP+locked] ; EBX := ADR(locked)
  1106. MOV AL, 1
  1107. test:
  1108. CMP [EBX], AL ; locked? { AL = 1 }
  1109. JNE try
  1110. XOR ECX, ECX ; just in case some processor interprets REP this way
  1111. STI
  1112. REP NOP ; PAUSE instruction; see SpinHint
  1113. CLI
  1114. JMP test
  1115. try:
  1116. XCHG [EBX], AL ; set and read the lock atomically. LOCK prefix implicit.
  1117. CMP AL, 1 ; was locked?
  1118. JE test ; yes, try again
  1119. POPFD
  1120. END AcquireObject;
  1121. (** Release an active object lock. *)
  1122. PROCEDURE ReleaseObject* (VAR locked: BOOLEAN);
  1123. CODE {SYSTEM.i386}
  1124. MOV EBX, [EBP+locked] ; EBX := ADR(locked)
  1125. MOV BYTE [EBX], 0
  1126. END ReleaseObject;
  1127. (* Load global descriptor table *)
  1128. PROCEDURE LoadGDT(base: ADDRESS; size: SIZE);
  1129. CODE {SYSTEM.i386, SYSTEM.Privileged}
  1130. SHL DWORD [EBP+size], 16
  1131. MOV EBX, 2
  1132. LGDT [EBP+EBX+size]
  1133. END LoadGDT;
  1134. (* Load segment registers *)
  1135. PROCEDURE LoadSegRegs(data: LONGINT);
  1136. CODE {SYSTEM.i386}
  1137. MOV EAX, [EBP+data]
  1138. MOV DS, AX
  1139. MOV ES, AX
  1140. XOR EAX, EAX
  1141. MOV FS, AX
  1142. MOV GS, AX
  1143. END LoadSegRegs;
  1144. (* Return CS. *)
  1145. PROCEDURE -CS* (): LONGINT;
  1146. CODE {SYSTEM.i386}
  1147. XOR EAX, EAX
  1148. MOV AX, CS
  1149. END CS;
  1150. (** -- Memory management -- *)
  1151. (* Allocate a physical page below 1M. Parameter adr returns physical and virtual address (or NilAdr).*)
  1152. PROCEDURE NewLowPage(VAR adr: ADDRESS);
  1153. BEGIN
  1154. adr := freeLowPage;
  1155. IF freeLowPage # NilAdr THEN
  1156. SYSTEM.GET (freeLowPage, freeLowPage); (* freeLowPage := freeLowPage.next *)
  1157. DEC(freeLowPages)
  1158. END
  1159. END NewLowPage;
  1160. (* Allocate a directly-mapped page. Parameter adr returns physical and virtual address (or NilAdr). *)
  1161. PROCEDURE NewDirectPage(VAR adr: ADDRESS);
  1162. BEGIN
  1163. IF pageHeapAdr # heapEndAdr THEN
  1164. DEC(pageHeapAdr, PS); adr := pageHeapAdr;
  1165. DEC(freeHighPages)
  1166. ELSE
  1167. adr := NilAdr
  1168. END
  1169. END NewDirectPage;
  1170. (* Allocate a physical page. *)
  1171. PROCEDURE NewPage(VAR physAdr: ADDRESS);
  1172. VAR sp, prev: ADDRESS;
  1173. BEGIN
  1174. SYSTEM.GET(pageStackAdr + NodeSP, sp);
  1175. ASSERT((sp >= MinSP) & (sp <= MaxSP) & (sp MOD AddressSize = 0)); (* index check *)
  1176. IF sp > MinSP THEN (* stack not empty, pop entry *)
  1177. DEC(sp, AddressSize);
  1178. SYSTEM.GET (pageStackAdr+sp, physAdr);
  1179. SYSTEM.PUT (pageStackAdr+NodeSP, sp);
  1180. SYSTEM.GET (pageStackAdr+NodePrev, prev);
  1181. IF (sp = MinSP) & (prev # NilAdr) THEN
  1182. pageStackAdr := prev
  1183. END;
  1184. DEC(freeHighPages)
  1185. ELSE
  1186. NewDirectPage(physAdr)
  1187. END
  1188. END NewPage;
  1189. (* Deallocate a physical page. *)
  1190. PROCEDURE DisposePage(physAdr: ADDRESS);
  1191. VAR sp, next, newAdr: ADDRESS;
  1192. BEGIN
  1193. SYSTEM.GET (pageStackAdr + NodeSP, sp);
  1194. ASSERT((sp >= MinSP) & (sp <= MaxSP) & (sp MOD AddressSize = 0)); (* index check *)
  1195. IF sp = MaxSP THEN (* current stack full *)
  1196. SYSTEM.GET (pageStackAdr + NodeNext, next);
  1197. IF next # NilAdr THEN (* next stack exists, make it current *)
  1198. pageStackAdr := next;
  1199. SYSTEM.GET (pageStackAdr+NodeSP, sp);
  1200. ASSERT(sp = MinSP) (* must be empty *)
  1201. ELSE (* allocate next stack *)
  1202. NewDirectPage(newAdr);
  1203. IF newAdr = NilAdr THEN
  1204. NewLowPage(newAdr); (* try again from reserve *)
  1205. IF newAdr = NilAdr THEN
  1206. IF Stats THEN INC(NlostPages) END;
  1207. RETURN (* give up (the disposed page is lost) *)
  1208. ELSE
  1209. IF Stats THEN INC(NreservePagesUsed) END
  1210. END
  1211. END;
  1212. sp := MinSP; (* will be written to NodeSP below *)
  1213. SYSTEM.PUT (newAdr + NodeNext, next);
  1214. SYSTEM.PUT (newAdr + NodePrev, pageStackAdr);
  1215. pageStackAdr := newAdr
  1216. END
  1217. END;
  1218. (* push entry on current stack *)
  1219. SYSTEM.PUT (pageStackAdr + sp, physAdr);
  1220. SYSTEM.PUT (pageStackAdr + NodeSP, sp + AddressSize);
  1221. INC(freeHighPages)
  1222. END DisposePage;
  1223. (* Allocate virtual address space for mapping. Parameter size must be multiple of page size. Parameter virtAdr returns virtual address or NilAdr on failure. *)
  1224. PROCEDURE NewVirtual(VAR virtAdr: ADDRESS; size: SIZE);
  1225. BEGIN
  1226. ASSERT(size MOD PS = 0);
  1227. IF mapTop+size > MapAreaAdr+MapAreaSize THEN
  1228. virtAdr := NilAdr (* out of virtual space *)
  1229. ELSE
  1230. virtAdr := mapTop;
  1231. INC(mapTop, size)
  1232. END
  1233. END NewVirtual;
  1234. PROCEDURE DisposeVirtual(virtAdr: ADDRESS; size: SIZE);
  1235. (* to do *)
  1236. END DisposeVirtual;
  1237. (* Map a physical page into the virtual address space. Parameter virtAdr is mapped address and phys is mapping value. Returns TRUE iff mapping successful. *)
  1238. PROCEDURE MapPage(virtAdr, phys: ADDRESS): BOOLEAN;
  1239. VAR i, pt: ADDRESS;
  1240. BEGIN
  1241. i := virtAdr DIV RS MOD PTEs;
  1242. SYSTEM.GET (kernelPD + AddressSize*i, pt);
  1243. IF ODD(pt) THEN (* pt present *)
  1244. DEC(pt, pt MOD PS)
  1245. ELSE
  1246. NewPage(pt);
  1247. IF pt = NilAdr THEN RETURN FALSE END;
  1248. SYSTEM.PUT (kernelPD + AddressSize*i, pt + UserPage);
  1249. Fill32(pt, PTEs*AddressSize, PageNotPresent)
  1250. END;
  1251. SYSTEM.PUT (pt + AddressSize*(virtAdr DIV PS MOD PTEs), phys);
  1252. RETURN TRUE
  1253. END MapPage;
  1254. (* Return mapped page address for a given virtual address (ODD if mapped) *)
  1255. PROCEDURE MappedPage(virtAdr: ADDRESS): ADDRESS;
  1256. VAR pt: ADDRESS;
  1257. BEGIN
  1258. SYSTEM.GET (kernelPD + AddressSize*(virtAdr DIV RS MOD PTEs), pt);
  1259. IF ODD(pt) THEN (* pt present *)
  1260. SYSTEM.GET (pt - pt MOD PS + AddressSize*(virtAdr DIV PS MOD PTEs), pt);
  1261. RETURN pt
  1262. ELSE
  1263. RETURN 0 (* ~ODD *)
  1264. END
  1265. END MappedPage;
  1266. (* Unmap a page and return the previous mapping, like MappedPage (). Caller must flush TLB. *)
  1267. PROCEDURE UnmapPage(virtAdr: ADDRESS): ADDRESS;
  1268. VAR t, pt: ADDRESS;
  1269. BEGIN
  1270. SYSTEM.GET (kernelPD + AddressSize*(virtAdr DIV RS MOD PTEs), pt);
  1271. IF ODD(pt) THEN (* pt present *)
  1272. pt := pt - pt MOD PS + AddressSize*(virtAdr DIV PS MOD PTEs);
  1273. SYSTEM.GET (pt, t);
  1274. SYSTEM.PUT (pt, NIL); (* unmap *)
  1275. (* could use INVLPG here, but it is not supported equally on all processors *)
  1276. RETURN t
  1277. ELSE
  1278. RETURN 0 (* ~ODD *)
  1279. END
  1280. END UnmapPage;
  1281. (* Map area [virtAdr..virtAdr+size) directly to area [Adr(phys)..Adr(phys)+size). Returns TRUE iff successful. *)
  1282. PROCEDURE MapDirect(virtAdr: ADDRESS; size: SIZE; phys: ADDRESS): BOOLEAN;
  1283. BEGIN
  1284. (*
  1285. Trace.String("MapDirect "); Trace.Address (virtAdr); Trace.Char(' '); Trace.Address (phys); Trace.Char (' '); Trace.Int (size, 0);
  1286. Trace.Int(size DIV PS, 8); Trace.Ln;
  1287. *)
  1288. ASSERT((virtAdr MOD PS = 0) & (size MOD PS = 0));
  1289. WHILE size # 0 DO
  1290. IF ~ODD(MappedPage(virtAdr)) THEN
  1291. IF ~MapPage(virtAdr, phys) THEN RETURN FALSE END
  1292. END;
  1293. INC(virtAdr, PS); INC(phys, PS); DEC(size, PS)
  1294. END;
  1295. RETURN TRUE
  1296. END MapDirect;
  1297. (* Policy decision for heap expansion. NewBlock for the same block has failed try times. *)
  1298. PROCEDURE ExpandNow(try: LONGINT): BOOLEAN;
  1299. VAR size: SIZE;
  1300. BEGIN
  1301. size := LSH(memBlockTail.endBlockAdr - memBlockHead.beginBlockAdr, -10); (* heap size in KB *)
  1302. RETURN (~ODD(try) OR (size < heapMinKB)) & (size < heapMaxKB)
  1303. END ExpandNow;
  1304. (* Try to expand the heap by at least "size" bytes *)
  1305. PROCEDURE ExpandHeap*(try: LONGINT; size: SIZE; VAR memBlock: MemoryBlock; VAR beginBlockAdr, endBlockAdr: ADDRESS);
  1306. BEGIN
  1307. IF ExpandNow(try) THEN
  1308. IF size < expandMin THEN size := expandMin END;
  1309. beginBlockAdr := memBlockHead.endBlockAdr;
  1310. endBlockAdr := beginBlockAdr;
  1311. INC(endBlockAdr, size);
  1312. SetHeapEndAdr(endBlockAdr); (* in/out parameter *)
  1313. memBlock := memBlockHead;
  1314. (* endBlockAdr of memory block is set by caller after free block has been set in memory block - this process is part of lock-free heap expansion *)
  1315. ELSE
  1316. beginBlockAdr := memBlockHead.endBlockAdr;
  1317. endBlockAdr := memBlockHead.endBlockAdr;
  1318. memBlock := NIL
  1319. END
  1320. END ExpandHeap;
  1321. (* Set memory block end address *)
  1322. PROCEDURE SetMemoryBlockEndAddress*(memBlock: MemoryBlock; endBlockAdr: ADDRESS);
  1323. BEGIN
  1324. ASSERT(endBlockAdr >= memBlock.beginBlockAdr);
  1325. memBlock.endBlockAdr := endBlockAdr
  1326. END SetMemoryBlockEndAddress;
  1327. (* Free unused memory block *)
  1328. PROCEDURE FreeMemBlock*(memBlock: MemoryBlock);
  1329. BEGIN
  1330. HALT(515) (* impossible to free heap in I386 native A2 version *)
  1331. END FreeMemBlock;
  1332. (** Attempt to set the heap end address to the specified address. The returned value is the actual new end address (never smaller than previous value). *)
  1333. PROCEDURE SetHeapEndAdr(VAR endAdr: ADDRESS);
  1334. VAR n, m: SIZE;
  1335. BEGIN
  1336. Acquire(Memory);
  1337. n := LSH(endAdr+(PS-1), -PSlog2) - LSH(heapEndAdr, -PSlog2); (* pages requested *)
  1338. m := LSH(pageHeapAdr, -PSlog2) - LSH(heapEndAdr, -PSlog2) - ReservedPages; (* max pages *)
  1339. IF n > m THEN n := m END;
  1340. IF n > 0 THEN INC(heapEndAdr, n*PS); DEC(freeHighPages, n) END;
  1341. endAdr := heapEndAdr;
  1342. Release(Memory)
  1343. END SetHeapEndAdr;
  1344. (** Map a physical memory area (physAdr..physAdr+size-1) into the virtual address space. Parameter virtAdr returns the virtual address of mapped region, or NilAdr on failure. *)
  1345. PROCEDURE MapPhysical*(physAdr: ADDRESS; size: SIZE; VAR virtAdr: ADDRESS);
  1346. VAR ofs: ADDRESS;
  1347. BEGIN
  1348. IF (LSH(physAdr, -PSlog2) <= topPageNum) &
  1349. (LSH(physAdr+size-1, -PSlog2) <= topPageNum) &
  1350. (LSH(physAdr, -PSlog2) >= LSH(LowAdr, -PSlog2)) THEN
  1351. virtAdr := physAdr (* directly mapped *)
  1352. ELSE
  1353. ofs := physAdr MOD PS;
  1354. DEC(physAdr, ofs); INC(size, ofs); (* align start to page boundary *)
  1355. INC(size, (-size) MOD PS); (* align end to page boundary *)
  1356. Acquire(Memory);
  1357. NewVirtual(virtAdr, size);
  1358. IF virtAdr # NilAdr THEN
  1359. IF ~MapDirect(virtAdr, size, physAdr + UserPage) THEN
  1360. DisposeVirtual(virtAdr, size);
  1361. virtAdr := NilAdr
  1362. END
  1363. END;
  1364. Release(Memory);
  1365. IF TraceVerbose THEN
  1366. Acquire (TraceOutput);
  1367. Trace.String("Mapping ");
  1368. Trace.IntSuffix(size, 1, "B"); Trace.String(" at ");
  1369. Trace.Address (physAdr); Trace.String (" - "); Trace.Address (physAdr+size-1);
  1370. IF virtAdr = NilAdr THEN
  1371. Trace.String(" failed")
  1372. ELSE
  1373. Trace.String (" to "); Trace.Address (virtAdr);
  1374. IF ofs # 0 THEN Trace.String (", offset "); Trace.Int(ofs, 0) END
  1375. END;
  1376. Trace.Ln;
  1377. Release (TraceOutput);
  1378. END;
  1379. IF virtAdr # NilAdr THEN INC(virtAdr, ofs) END (* adapt virtual address to correct offset *)
  1380. END
  1381. END MapPhysical;
  1382. (** Unmap an area previously mapped with MapPhysical. *)
  1383. PROCEDURE UnmapPhysical*(virtAdr: ADDRESS; size: SIZE);
  1384. (* to do *)
  1385. END UnmapPhysical;
  1386. (** Return the physical address of the specified range of memory, or NilAdr if the range is not contiguous. It is the caller's responsibility to assure the range remains allocated during the time it is in use. *)
  1387. PROCEDURE PhysicalAdr*(adr: ADDRESS; size: SIZE): ADDRESS;
  1388. VAR physAdr, mapped, expected: ADDRESS;
  1389. BEGIN
  1390. IF (LSH(adr, -PSlog2) <= topPageNum) & (LSH(adr+size-1, -PSlog2) <= topPageNum) THEN
  1391. RETURN adr (* directly mapped *)
  1392. ELSE
  1393. Acquire(Memory);
  1394. mapped := MappedPage(adr);
  1395. Release(Memory);
  1396. IF ODD(mapped) & (size > 0) THEN (* mapped, and range not empty or too big *)
  1397. physAdr := mapped - mapped MOD PS + adr MOD PS; (* strip paging bits and add page offset *)
  1398. (* now check if whole range is physically contiguous *)
  1399. DEC(size, PS - adr MOD PS); (* subtract distance to current page end *)
  1400. IF size > 0 THEN (* range crosses current page end *)
  1401. expected := LSH(mapped, -PSlog2)+1; (* expected physical page *)
  1402. LOOP
  1403. INC(adr, PS); (* step to next page *)
  1404. Acquire(Memory);
  1405. mapped := MappedPage(adr);
  1406. Release(Memory);
  1407. IF ~ODD(mapped) OR (LSH(mapped, -PSlog2) # expected) THEN
  1408. physAdr := NilAdr; EXIT
  1409. END;
  1410. DEC(size, PS);
  1411. IF size <= 0 THEN EXIT END; (* ok *)
  1412. INC(expected)
  1413. END
  1414. ELSE
  1415. (* ok, skip *)
  1416. END
  1417. ELSE
  1418. physAdr := NilAdr
  1419. END;
  1420. RETURN physAdr
  1421. END
  1422. END PhysicalAdr;
  1423. (** Translate a virtual address range to num ranges of physical address. num returns 0 on error. *)
  1424. PROCEDURE TranslateVirtual*(virtAdr: ADDRESS; size: SIZE; VAR num: LONGINT; VAR physAdr: ARRAY OF Range);
  1425. VAR ofs, phys1: ADDRESS; size1: SIZE;
  1426. BEGIN
  1427. Acquire(Memory);
  1428. num := 0;
  1429. LOOP
  1430. IF size = 0 THEN EXIT END;
  1431. IF num = LEN(physAdr) THEN num := 0; EXIT END; (* index check *)
  1432. ofs := virtAdr MOD PS; (* offset in page *)
  1433. size1 := PS - ofs; (* distance to next page boundary *)
  1434. IF size1 > size THEN size1 := size END;
  1435. phys1 := MappedPage(virtAdr);
  1436. IF ~ODD(phys1) THEN num := 0; EXIT END; (* page not present *)
  1437. physAdr[num].adr := phys1 - phys1 MOD PS + ofs;
  1438. physAdr[num].size := size1; INC(num);
  1439. INC(virtAdr, size1); DEC(size, size1)
  1440. END;
  1441. IF num = 0 THEN physAdr[0].adr := NilAdr; physAdr[0].size := 0 END;
  1442. Release(Memory)
  1443. END TranslateVirtual;
  1444. (** Return information on free memory in Kbytes. *)
  1445. PROCEDURE GetFreeK*(VAR total, lowFree, highFree: SIZE);
  1446. CONST KperPage = PS DIV 1024;
  1447. BEGIN
  1448. Acquire(Memory);
  1449. total := totalPages * KperPage;
  1450. lowFree := freeLowPages * KperPage;
  1451. highFree := freeHighPages * KperPage;
  1452. Release(Memory)
  1453. END GetFreeK;
  1454. (** -- Stack -- *)
  1455. (** Extend the stack to include the specified address, if possible. Returns TRUE iff ok. *)
  1456. PROCEDURE ExtendStack*(VAR s: Stack; virtAdr: ADDRESS): BOOLEAN;
  1457. VAR phys: ADDRESS; ok: BOOLEAN;
  1458. BEGIN
  1459. Acquire(Memory);
  1460. ok := FALSE;
  1461. IF (virtAdr < s.high) & (virtAdr >= s.low) THEN
  1462. DEC(virtAdr, virtAdr MOD PS); (* round down to page boundary *)
  1463. IF Stats & (virtAdr < s.adr-PS) THEN INC(Nbigskips) END;
  1464. IF ODD(MappedPage(virtAdr)) THEN (* already mapped *)
  1465. ok := TRUE
  1466. ELSE
  1467. NewPage(phys);
  1468. IF phys # NilAdr THEN
  1469. IF MapPage(virtAdr, phys + UserPage) THEN
  1470. IF virtAdr < s.adr THEN
  1471. s.adr := virtAdr
  1472. ELSE
  1473. IF Stats THEN INC(Nfilled) END
  1474. END;
  1475. ok := TRUE
  1476. ELSE
  1477. DisposePage(phys)
  1478. END
  1479. END
  1480. END
  1481. END;
  1482. Release(Memory);
  1483. RETURN ok
  1484. END ExtendStack;
  1485. (** Allocate a stack. Parameter initSP returns initial stack pointer value. *)
  1486. PROCEDURE NewStack*(VAR s: Stack; process: ANY; VAR initSP: ADDRESS);
  1487. VAR adr, phys: ADDRESS; old: LONGINT; free: SET;
  1488. BEGIN
  1489. ASSERT(InitUserStackSize = PS); (* for now *)
  1490. Acquire(Memory);
  1491. IF Stats THEN INC(NnewStacks) END;
  1492. old := freeStackIndex;
  1493. LOOP
  1494. IF Stats THEN INC(NnewStackLoops) END;
  1495. free := freeStack[freeStackIndex];
  1496. IF free # {} THEN
  1497. adr := 0; WHILE ~(adr IN free) DO INC(adr) END; (* BTW: BSF instruction is not faster *)
  1498. IF Stats THEN INC(NnewStackInnerLoops, adr+1) END;
  1499. EXCL(freeStack[freeStackIndex], SIZE(adr));
  1500. adr := StackAreaAdr + (freeStackIndex*SetSize + adr)*MaxUserStackSize;
  1501. EXIT
  1502. END;
  1503. INC(freeStackIndex);
  1504. IF freeStackIndex = LEN(freeStack) THEN freeStackIndex := 0 END;
  1505. IF freeStackIndex = old THEN HALT(1503) END (* out of stack space *)
  1506. END;
  1507. NewPage(phys); ASSERT(phys # NilAdr); (* allocate one physical page at first *)
  1508. s.high := adr + MaxUserStackSize; s.low := adr + UserStackGuardSize;
  1509. s.adr := s.high - InitUserStackSize; (* at the top of the virtual area *)
  1510. initSP := s.high-AddressSize;
  1511. IF ~MapPage(s.adr, phys + UserPage) THEN HALT(99) END;
  1512. SYSTEM.PUT (initSP, process);
  1513. Release(Memory)
  1514. END NewStack;
  1515. (** Return the process pointer set when the current user stack was created (must be running on user stack). *)
  1516. PROCEDURE -GetProcessPtr* (): ANY;
  1517. CONST Mask = -MaxUserStackSize; Ofs = MaxUserStackSize-4;
  1518. CODE {SYSTEM.i386}
  1519. MOV EAX, Mask
  1520. AND EAX, ESP
  1521. MOV EAX, [EAX+Ofs]
  1522. POP EBX ; pointers are generally passed via stack
  1523. MOV [EBX], EAX
  1524. END GetProcessPtr;
  1525. (** True iff current process works on a kernel stack *)
  1526. PROCEDURE WorkingOnKernelStack* (): BOOLEAN;
  1527. VAR id: LONGINT; sp: ADDRESS;
  1528. BEGIN
  1529. ASSERT(KernelStackSize # MaxUserStackSize - UserStackGuardSize); (* detection does only work with this assumption *)
  1530. sp := CurrentSP ();
  1531. id := ID ();
  1532. RETURN (sp >= procm[id].stack.low) & (sp <= procm[id].stack.high)
  1533. END WorkingOnKernelStack;
  1534. (** Deallocate a stack. Current thread should not dispose its own stack. Uses privileged instructions. *)
  1535. PROCEDURE DisposeStack*(CONST s: Stack);
  1536. VAR adr, phys: ADDRESS;
  1537. BEGIN
  1538. (* First make sure there are no references to virtual addresses of the old stack in the TLBs. This is required because we are freeing the pages, and they could be remapped later at different virtual addresses. DisposeStack will only be called from the thread finalizer, which ensures that the user will no longer be referencing this memory. Therefore we can make this upcall from outside the locked region, avoiding potential deadlock. *)
  1539. GlobalFlushTLB; (* finalizers are only called after Processors has initialized this upcall *)
  1540. Acquire(Memory);
  1541. IF Stats THEN INC(NdisposeStacks) END;
  1542. adr := s.adr; (* unmap and deallocate all pages of stack *)
  1543. REPEAT
  1544. phys := UnmapPage(adr); (* TLB was flushed and no intermediate references possible to unreachable stack *)
  1545. IF ODD(phys) THEN DisposePage(phys - phys MOD PS) END;
  1546. INC(adr, PS)
  1547. UNTIL adr = s.high;
  1548. adr := (adr - MaxUserStackSize - StackAreaAdr) DIV MaxUserStackSize;
  1549. INCL(freeStack[adr DIV 32], SIZE(adr MOD 32));
  1550. Release(Memory)
  1551. END DisposeStack;
  1552. (** Check if the specified stack is valid. *)
  1553. PROCEDURE ValidStack*(CONST s: Stack; sp: ADDRESS): BOOLEAN;
  1554. VAR valid: BOOLEAN;
  1555. BEGIN
  1556. Acquire(Memory);
  1557. valid := (sp MOD 4 = 0) & (sp >= s.adr) & (sp <= s.high);
  1558. WHILE valid & (sp < s.high) DO
  1559. valid := ODD(MappedPage(sp));
  1560. INC(sp, PS)
  1561. END;
  1562. Release(Memory);
  1563. RETURN valid
  1564. END ValidStack;
  1565. (** Update the stack snapshot of the current processor. (for Processors) *)
  1566. PROCEDURE UpdateState*;
  1567. VAR id: LONGINT;
  1568. BEGIN
  1569. ASSERT(CS () MOD 4 = 0); (* to get kernel stack pointer *)
  1570. id := ID ();
  1571. ASSERT(procm[id].stack.high # 0); (* current processor stack has been assigned *)
  1572. procm[id].sp := CurrentBP () (* instead of ESP, just fetch EBP of current procedure (does not contain pointers) *)
  1573. END UpdateState;
  1574. (** Get kernel stack regions for garbage collection. (for Heaps) *)
  1575. PROCEDURE GetKernelStacks*(VAR stack: ARRAY OF Stack);
  1576. VAR i: LONGINT;
  1577. BEGIN (* {UpdateState has been called by each processor} *)
  1578. FOR i := 0 TO MaxCPU-1 DO
  1579. stack[i].adr := procm[i].sp;
  1580. stack[i].high := procm[i].stack.high
  1581. END
  1582. END GetKernelStacks;
  1583. (* Init page tables (paging still disabled until EnableMM is called). *)
  1584. PROCEDURE InitPages;
  1585. VAR i, j, phys, lTop, mTop: ADDRESS;
  1586. BEGIN
  1587. (* get top of high and low memory *)
  1588. mTop := memTop;
  1589. DEC(mTop, mTop MOD PS); (* mTop MOD PS = 0 *)
  1590. topPageNum := LSH(mTop-1, -PSlog2);
  1591. lTop := lowTop;
  1592. DEC(lTop, lTop MOD PS); (* lTop MOD PS = 0 *)
  1593. (* initialize NewDirectPage and SetHeapEndAdr (get kernel range) *)
  1594. (*SYSTEM.GET (LinkAdr + EndBlockOfs, heapEndAdr);*)
  1595. heapEndAdr := 0;
  1596. (* ug *) (*
  1597. SYSTEM.PUT (heapEndAdr, NIL); (* set tag to NIL *)
  1598. INC(heapEndAdr, AddressSize); (* space for NIL *)
  1599. *)
  1600. (* ug: not needed, extension of heap done in GetStaticHeap anyway
  1601. INC(heapEndAdr, K); (* space for free heap block descriptor of type Heaps.HeapBlockDesc at heapEndAdr, initialization is done in Heaps *)
  1602. INC(heapEndAdr, (-heapEndAdr) MOD PS); (* round up to page size *)
  1603. *)
  1604. pageHeapAdr := mTop;
  1605. freeHighPages := LSH(pageHeapAdr, -PSlog2) - LSH(heapEndAdr, -PSlog2);
  1606. IF TraceVerbose THEN
  1607. Trace.String("Kernel: "); Trace.Address (LinkAdr); Trace.String(" .. ");
  1608. Trace.Address (heapEndAdr-1); Trace.Ln;
  1609. Trace.String ("High: "); Trace.Address (heapEndAdr); Trace.String(" .. ");
  1610. Trace.Address (pageHeapAdr-1); Trace.String(" = "); Trace.Int (freeHighPages, 0);
  1611. Trace.StringLn (" free pages")
  1612. END;
  1613. (* initialize empty free page stack *)
  1614. NewDirectPage(pageStackAdr); ASSERT(pageStackAdr # NilAdr);
  1615. SYSTEM.PUT (pageStackAdr+NodeSP, SYSTEM.VAL (ADDRESS, MinSP));
  1616. SYSTEM.PUT (pageStackAdr+NodeNext, SYSTEM.VAL (ADDRESS, NilAdr));
  1617. SYSTEM.PUT (pageStackAdr+NodePrev, SYSTEM.VAL (ADDRESS, NilAdr));
  1618. (* free low pages *)
  1619. freeLowPage := NilAdr; freeLowPages := 0;
  1620. i := lTop DIV PS; j := LowAdr DIV PS;
  1621. IF TraceVerbose THEN
  1622. Trace.String("Low: "); Trace.Address (j*PS); Trace.String (".."); Trace.Address (i*PS-1)
  1623. END;
  1624. REPEAT
  1625. DEC(i); phys := i*PS;
  1626. SYSTEM.PUT (phys, freeLowPage); (* phys.next := freeLowPage *)
  1627. freeLowPage := phys; INC(freeLowPages)
  1628. UNTIL i = j;
  1629. IF TraceVerbose THEN
  1630. Trace.String(" = "); Trace.Int(freeLowPages, 1); Trace.StringLn (" free pages")
  1631. END;
  1632. totalPages := LSH(memTop - M + lowTop + dmaSize + PS, -PSlog2); (* what BIOS gave us *)
  1633. (* stacks *)
  1634. ASSERT((StackAreaAdr MOD MaxUserStackSize = 0) & (StackAreaSize MOD MaxUserStackSize = 0));
  1635. FOR i := 0 TO LEN(freeStack)-1 DO freeStack[i] := {0..SetSize-1} END;
  1636. FOR i := MaxUserStacks TO LEN(freeStack)*SetSize-1 DO EXCL(freeStack[i DIV SetSize], SIZE(i MOD SetSize)) END;
  1637. freeStackIndex := 0;
  1638. (* mappings *)
  1639. mapTop := MapAreaAdr ;
  1640. (*! remove if works
  1641. IF fbadr + 1024 * PS * 10 > mapTop THEN mapTop := fbadr + 1024 * PS * 10 END; (* frame buffer ! *)
  1642. *)
  1643. (* create the address space *)
  1644. NewPage(kernelPD); ASSERT(kernelPD # NilAdr);
  1645. Fill32(kernelPD, PTEs*4, PageNotPresent);
  1646. IF ~MapDirect(LowAdr, mTop-LowAdr, LowAdr + UserPage) THEN HALT(99) END ;(* map heap direct *)
  1647. (*! remove if works
  1648. IF ~MapDirect(fbadr, PS*1024*10, fbadr + UserPage) THEN (* map frame buffer direct *)
  1649. Trace.String("map direct failed at fbadr"); Trace.Address(fbadr); Trace.Ln;
  1650. END;
  1651. *)
  1652. END InitPages;
  1653. (* Generate a memory segment descriptor. type IN {0..7} & dpl IN {0..3}.
  1654. type
  1655. 0 data, expand-up, read-only
  1656. 1 data, expand-up, read-write
  1657. 2 data, expand-down, read-only
  1658. 3 data, expand-down, read-write
  1659. 4 code, non-conforming, execute-only
  1660. 5 code, non-conforming, execute-read
  1661. 6 code, conforming, execute-only
  1662. 7 code, conforming, execute-read
  1663. *)
  1664. PROCEDURE GenMemSegDesc(type, base, limit, dpl: LONGINT; page: BOOLEAN; VAR sd: SegDesc);
  1665. VAR s: SET;
  1666. BEGIN
  1667. sd.low := ASH(base MOD 10000H, 16) + limit MOD 10000H;
  1668. s := SYSTEM.VAL (SET, ASH(ASH(base, -24), 24) + ASH(ASH(limit, -16), 16) +
  1669. ASH(dpl, 13) + ASH(type, 9) + ASH(base, -16) MOD 100H);
  1670. s := s + {12, 15, 22}; (* code/data=1, present=1, 32-bit=1, A=0, AVL=0 *)
  1671. IF page THEN INCL(s, 23) END; (* page granularity *)
  1672. sd.high := SYSTEM.VAL (LONGINT, s)
  1673. END GenMemSegDesc;
  1674. (* Generate a TSS descriptor. *)
  1675. PROCEDURE GenTSSDesc(base: ADDRESS; limit, dpl: LONGINT; VAR sd: SegDesc);
  1676. VAR s: SET;
  1677. BEGIN
  1678. sd.low := ASH(base MOD 10000H, 16) + limit MOD 10000H;
  1679. s := SYSTEM.VAL (SET, ASH(ASH(base, -24), 24) + ASH(ASH(limit, -16), 16) +
  1680. ASH(dpl, 13) + ASH(base, -16) MOD 100H);
  1681. s := s + {8, 11, 15}; (* type=non-busy TSS, present=1, AVL=0, 32-bit=0 *)
  1682. sd.high := SYSTEM.VAL (LONGINT, s)
  1683. END GenTSSDesc;
  1684. (* Initialize segmentation. *)
  1685. PROCEDURE InitSegments;
  1686. VAR i: LONGINT;
  1687. BEGIN
  1688. (* GDT 0: Null segment *)
  1689. gdt[0].low := 0; gdt[0].high := 0;
  1690. (* GDT 1: Kernel code: non-conforming, execute-read, base 0, limit 4G, PL 0 *)
  1691. GenMemSegDesc(5, 0, M-1, 0, TRUE, gdt[1]);
  1692. (* GDT 2: Kernel stack: expand-up, read-write, base 0, limit 4G, PL 0 *)
  1693. GenMemSegDesc(1, 0, M-1, 0, TRUE, gdt[2]);
  1694. (* GDT 3: User code: conforming, execute-read, base 0, limit 4G, PL 0 *)
  1695. GenMemSegDesc(7, 0, M-1, 0, TRUE, gdt[3]);
  1696. (* GDT 4: User/Kernel data: expand-up, read-write, base 0, limit 4G, PL 3 *)
  1697. GenMemSegDesc(1, 0, M-1, 3, TRUE, gdt[4]);
  1698. (* GDT 5: User stack: expand-down, read-write, base 0, limit 1M, PL 3 *)
  1699. GenMemSegDesc(3, 0, M DIV PS, 3, TRUE, gdt[5]);
  1700. (* GDT TSSOfs..n: Kernel TSS *)
  1701. FOR i := 0 TO MaxCPU-1 DO
  1702. GenTSSDesc(ADDRESSOF(procm[i].tss), SIZEOF(TSSDesc)-1, 0, gdt[TSSOfs+i]);
  1703. procm[i].sp := 0; procm[i].stack.high := 0
  1704. END
  1705. END InitSegments;
  1706. (* Enable segmentation on the current processor. *)
  1707. PROCEDURE EnableSegments;
  1708. BEGIN
  1709. LoadGDT(ADDRESSOF(gdt[0]), SIZEOF(GDT)-1);
  1710. LoadSegRegs(DataSel)
  1711. END EnableSegments;
  1712. (* Allocate a kernel stack. *)
  1713. PROCEDURE NewKernelStack(VAR stack: Stack);
  1714. VAR phys, virt: ADDRESS; size: SIZE;
  1715. BEGIN
  1716. size := KernelStackSize;
  1717. NewVirtual(virt, size + PS); (* add one page for overflow protection *)
  1718. ASSERT(virt # NilAdr, 1502);
  1719. INC(virt, PS); (* leave page open at bottom *)
  1720. stack.low := virt;
  1721. stack.adr := virt; (* return stack *)
  1722. REPEAT
  1723. NewPage(phys); ASSERT(phys # NilAdr);
  1724. IF ~MapPage(virt, phys + KernelPage) THEN HALT(99) END;
  1725. DEC(size, PS); INC(virt, PS)
  1726. UNTIL size = 0;
  1727. stack.high := virt
  1728. END NewKernelStack;
  1729. (* Set task register *)
  1730. PROCEDURE -SetTR(tr: ADDRESS);
  1731. CODE {SYSTEM.i386, SYSTEM.Privileged}
  1732. POP EAX
  1733. LTR AX
  1734. END SetTR;
  1735. (* Enable memory management and switch to new stack in virtual space.
  1736. Stack layout:
  1737. caller1 return
  1738. caller1 EBP <-- caller0 EBP
  1739. [caller0 locals]
  1740. 04 caller0 return
  1741. 00 caller0 EBP <-- EBP
  1742. locals <-- ESP
  1743. *)
  1744. PROCEDURE -EnableMM(pd, esp: ADDRESS);
  1745. CODE {SYSTEM.Pentium, SYSTEM.Privileged}
  1746. POP EBX ; esp
  1747. POP EAX ; pd
  1748. MOV CR3, EAX ; page directory ptr
  1749. MOV ECX, [EBP+4] ; caller0 return
  1750. MOV EDX, [EBP] ; caller0 EBP
  1751. MOV EDX, [EDX+4] ; caller1 return
  1752. MOV EAX, CR0
  1753. OR EAX, 80000000H ; set PG bit
  1754. MOV CR0, EAX ; enable virtual addressing (old stack no longer usable)
  1755. JMP 0 ; flush queue
  1756. WBINVD
  1757. MOV DWORD [EBX-4], 0 ; not UserStackSel (cf. GetUserStack)
  1758. MOV [EBX-8], EDX ; caller1 return on new stack
  1759. MOV DWORD [EBX-12], 0 ; caller1 EBP on new stack
  1760. LEA EBP, [EBX-12] ; new stack top
  1761. MOV ESP, EBP
  1762. JMP ECX ; back to caller0 (whose locals are now inaccessible!)
  1763. END EnableMM;
  1764. (** -- Initialization -- *)
  1765. (** Initialize memory management.
  1766. o every processor calls this once during initialization
  1767. o mutual exclusion with other processors must be guaranteed by the caller
  1768. o interrupts must be off
  1769. o segmentation and paging is enabled
  1770. o return is on the new stack => caller must have no local variables
  1771. *)
  1772. PROCEDURE InitMemory*;
  1773. VAR id: LONGINT;
  1774. BEGIN
  1775. EnableSegments;
  1776. (* allocate stack *)
  1777. id := ID ();
  1778. NewKernelStack(procm[id].stack);
  1779. procm[id].sp := 0;
  1780. (* initialize TSS *)
  1781. Fill32(ADDRESSOF(procm[id].tss), SIZEOF(TSSDesc), 0);
  1782. procm[id].tss.ESP0 := procm[id].stack.high; (* kernel stack org *)
  1783. procm[id].tss.ESS0 := KernelStackSel;
  1784. procm[id].tss.IOBitmapOffset := -1; (* no bitmap *)
  1785. (* enable paging and switch stack *)
  1786. SetTR(KernelTR + id*8);
  1787. EnableMM(kernelPD, procm[id].tss.ESP0)
  1788. END InitMemory;
  1789. (** Initialize a boot page for MP booting. Parameter physAdr returns the physical address of a low page. *)
  1790. PROCEDURE InitBootPage*(start: Startup; VAR physAdr: ADDRESS);
  1791. CONST BootOfs = 800H;
  1792. VAR adr, a: ADDRESS;
  1793. BEGIN
  1794. Acquire(Memory);
  1795. NewLowPage(physAdr);
  1796. Release(Memory);
  1797. ASSERT((physAdr # NilAdr) & (physAdr >= 0) & (physAdr < M) & (physAdr MOD PS = 0));
  1798. adr := physAdr + BootOfs;
  1799. a := adr; (* from SMP.Asm - generated with BinToCode.Kernel smp.bin 800H *)
  1800. SYSTEM.PUT32(a, 0100012EBH); INC(a, 4); SYSTEM.PUT32(a, 000080000H); INC(a, 4);
  1801. SYSTEM.PUT32(a, 000000000H); INC(a, 4); SYSTEM.PUT32(a, 000170000H); INC(a, 4);
  1802. SYSTEM.PUT32(a, 000000000H); INC(a, 4); SYSTEM.PUT32(a, 0010F2EFAH); INC(a, 4);
  1803. SYSTEM.PUT32(a, 02E08081EH); INC(a, 4); SYSTEM.PUT32(a, 00E16010FH); INC(a, 4);
  1804. SYSTEM.PUT32(a, 0E0010F08H); INC(a, 4); SYSTEM.PUT32(a, 0010F010CH); INC(a, 4);
  1805. SYSTEM.PUT32(a, 0B800EBF0H); INC(a, 4); SYSTEM.PUT32(a, 0D08E0010H); INC(a, 4);
  1806. SYSTEM.PUT32(a, 0C08ED88EH); INC(a, 4); SYSTEM.PUT32(a, 00800BC66H); INC(a, 4);
  1807. SYSTEM.PUT32(a, 033660000H); INC(a, 4); SYSTEM.PUT32(a, 0FF2E66C0H); INC(a, 4);
  1808. SYSTEM.PUT32(a, 09008022EH); INC(a, 4);
  1809. (* these offsets are from the last two dwords in SMP.Asm *)
  1810. SYSTEM.PUT32(adr+2, SYSTEM.VAL (LONGINT, start)); (* not a method *)
  1811. SYSTEM.PUT32(adr+16, ADDRESSOF(gdt[0]));
  1812. (* jump at start *)
  1813. SYSTEM.PUT8(physAdr, 0EAX); (* jmp far *)
  1814. SYSTEM.PUT32(physAdr + 1, ASH(physAdr, 16-4) + BootOfs) (* seg:ofs *)
  1815. END InitBootPage;
  1816. (** The BP in a MP system calls this to map the APIC physical address directly. *)
  1817. PROCEDURE InitAPICArea*(adr: ADDRESS; size: SIZE);
  1818. BEGIN
  1819. ASSERT((size = PS) & (adr >= IntelAreaAdr) & (adr+size-1 < IntelAreaAdr+IntelAreaSize));
  1820. IF ~MapDirect(adr, size, adr + UserPage) THEN HALT(99) END
  1821. END InitAPICArea;
  1822. (* Set machine-dependent parameters gcThreshold, expandMin, heapMinKB and heapMaxKB *)
  1823. PROCEDURE SetGCParams*;
  1824. VAR size, t: SIZE;
  1825. BEGIN
  1826. GetFreeK(size, t, t); (* size is total memory size in KB *)
  1827. heapMinKB := size * HeapMin DIV 100;
  1828. heapMaxKB := size * HeapMax DIV 100;
  1829. expandMin := size * ExpandRate DIV 100 * 1024;
  1830. IF expandMin < 0 THEN expandMin := MAX(LONGINT) END;
  1831. gcThreshold := size * Threshold DIV 100 * 1024;
  1832. IF gcThreshold < 0 THEN gcThreshold := MAX(LONGINT) END
  1833. END SetGCParams;
  1834. (** Get first memory block and first free address, heap area in first memory block is automatically expanded to account for the first
  1835. few calls to NEW *)
  1836. PROCEDURE GetStaticHeap*(VAR beginBlockAdr, endBlockAdr, freeBlockAdr: ADDRESS);
  1837. BEGIN
  1838. beginBlockAdr := initialMemBlock.beginBlockAdr;
  1839. endBlockAdr := initialMemBlock.endBlockAdr;
  1840. freeBlockAdr := beginBlockAdr;
  1841. END GetStaticHeap;
  1842. PROCEDURE InModuleHeap(p: ADDRESS): BOOLEAN;
  1843. BEGIN
  1844. RETURN (p >= SYSTEM.VAL(ADDRESS, FirstAddress)) & (p <= SYSTEM.VAL(ADDRESS, LastAddress));
  1845. END InModuleHeap;
  1846. (* returns if an address is a currently allocated heap address *)
  1847. PROCEDURE ValidHeapAddress*(p: ADDRESS): BOOLEAN;
  1848. BEGIN
  1849. RETURN
  1850. (p >= memBlockHead.beginBlockAdr) & (p <= memBlockTail.endBlockAdr)
  1851. OR InModuleHeap(p);
  1852. END ValidHeapAddress;
  1853. (** Jump from kernel to user mode. Every processor calls this during initialization. *)
  1854. PROCEDURE JumpToUserLevel*(userEBP: ADDRESS);
  1855. CODE {SYSTEM.i386}
  1856. PUSH UserStackSel ; SS3
  1857. PUSH DWORD [EBP+userEBP] ; ESP3
  1858. PUSHFD ; EFLAGS3
  1859. PUSH UserCodeSel ; CS3
  1860. CALL L1 ; PUSH L1 (EIP3)
  1861. L1:
  1862. ADD DWORD [ESP], BYTE 5; adjust EIP3 to L2 (L2-L1 = 5)
  1863. IRETD ; switch to level 3 and continue at following instruction
  1864. L2:
  1865. POP EBP ; from level 3 stack (refer to Objects.NewProcess)
  1866. RET ; jump to body of first active object
  1867. END JumpToUserLevel;
  1868. PROCEDURE Ensure32BitAddress*(adr: ADDRESS): LONGINT;
  1869. BEGIN
  1870. RETURN adr
  1871. END Ensure32BitAddress;
  1872. PROCEDURE Is32BitAddress*(adr: ADDRESS): BOOLEAN;
  1873. BEGIN RETURN SYSTEM.VAL (Address32, adr) = adr;
  1874. END Is32BitAddress;
  1875. (**
  1876. * Flush Data Cache for the specified virtual address range. If len is negative, flushes the whole cache.
  1877. * This is used on some architecture to interact with DMA hardware (e.g. Ethernet and USB. It can be
  1878. * left empty on Intel architecture.
  1879. *)
  1880. PROCEDURE FlushDCacheRange * (adr: ADDRESS; len: LONGINT);
  1881. END FlushDCacheRange;
  1882. (**
  1883. * Invalidate Data Cache for the specified virtual address range. If len is negative, flushes the whole cache.
  1884. * This is used on some architecture to interact with DMA hardware (e.g. Ethernet and USB. It can be
  1885. * left empty on Intel architecture.
  1886. *)
  1887. PROCEDURE InvalidateDCacheRange * (adr: ADDRESS; len: LONGINT);
  1888. END InvalidateDCacheRange;
  1889. (**
  1890. * Invalidate Instruction Cache for the specified virtual address range. If len is negative, flushes the whole cache.
  1891. * This is used on some architecture to interact with DMA hardware (e.g. Ethernet and USB. It can be
  1892. * left empty on Intel architecture.
  1893. *)
  1894. PROCEDURE InvalidateICacheRange * (adr: ADDRESS; len: LONGINT);
  1895. END InvalidateICacheRange;
  1896. (* Unexpected - Default interrupt handler *)
  1897. PROCEDURE Unexpected(VAR state: State);
  1898. VAR int: LONGINT; isr, irr: CHAR;
  1899. BEGIN
  1900. int := state.INT;
  1901. IF HandleSpurious & ((int >= IRQ0) & (int <= MaxIRQ) OR (int = MPSPU)) THEN (* unexpected IRQ, get more info *)
  1902. IF (int >= IRQ8) & (int <= IRQ15) THEN
  1903. Portout8 (IntB0, 0BX); Portin8(IntB0, isr);
  1904. Portout8 (IntB0, 0AX); Portin8(IntB0, irr)
  1905. ELSIF (int >= IRQ0) & (int <= IRQ7) THEN
  1906. Portout8 (IntA0, 0BX); Portin8(IntA0, isr);
  1907. Portout8 (IntA0, 0AX); Portin8(IntA0, irr)
  1908. ELSE
  1909. isr := 0X; irr := 0X
  1910. END;
  1911. IF TraceSpurious THEN
  1912. Acquire (TraceOutput);
  1913. Trace.String("INT"); Trace.Int(int, 1);
  1914. Trace.Hex(ORD(isr), -3); Trace.Hex(ORD(irr), -2); Trace.Ln;
  1915. Release (TraceOutput);
  1916. END
  1917. ELSE
  1918. Acquire (TraceOutput);
  1919. Trace.StringLn ("Unexpected interrupt");
  1920. Trace.Memory(ADDRESSOF(state), SIZEOF(State)-4*4); (* exclude last 4 fields *)
  1921. IF int = 3 THEN (* was a HALT or ASSERT *)
  1922. (* It seems that no trap handler is installed (Traps not linked), so wait endlessly, while holding trace lock. This should quiten down the system, although other processors may possibly still run processes. *)
  1923. LOOP END
  1924. ELSE
  1925. Release (TraceOutput);
  1926. SetEAX(int);
  1927. HALT(1801) (* unexpected interrupt *)
  1928. END
  1929. END
  1930. END Unexpected;
  1931. (* InEnableIRQ - Enable a hardware interrupt (caller must hold module lock). *)
  1932. PROCEDURE -InEnableIRQ (int: LONGINT);
  1933. CODE {SYSTEM.i386}
  1934. POP EBX
  1935. CMP EBX, IRQ7
  1936. JG cont2
  1937. IN AL, IntA1
  1938. SUB EBX, IRQ0
  1939. BTR EAX, EBX
  1940. OUT IntA1, AL
  1941. JMP end
  1942. cont2:
  1943. IN AL, IntB1
  1944. SUB EBX, IRQ8
  1945. BTR EAX, EBX
  1946. OUT IntB1, AL
  1947. end:
  1948. END InEnableIRQ;
  1949. (* InDisableIRQ - Disable a hardware interrupt (caller must hold module lock). *)
  1950. PROCEDURE -InDisableIRQ (int: LONGINT);
  1951. CODE {SYSTEM.i386}
  1952. POP EBX
  1953. CMP EBX, IRQ7
  1954. JG cont2
  1955. IN AL, IntA1
  1956. SUB EBX, IRQ0
  1957. BTS EAX, EBX
  1958. OUT IntA1, AL
  1959. JMP end
  1960. cont2:
  1961. IN AL, IntB1
  1962. SUB EBX, IRQ8
  1963. BTS EAX, EBX
  1964. OUT IntB1, AL
  1965. end:
  1966. END InDisableIRQ;
  1967. (** EnableIRQ - Enable a hardware interrupt (also done automatically by InstallHandler). *)
  1968. PROCEDURE EnableIRQ* (int: LONGINT);
  1969. BEGIN
  1970. ASSERT((int >= IRQ0) & (int <= IRQ15) & (int # IRQ2));
  1971. Acquire(Interrupts); (* protect interrupt mask register *)
  1972. InEnableIRQ(int);
  1973. Release(Interrupts)
  1974. END EnableIRQ;
  1975. (** DisableIRQ - Disable a hardware interrupt. *)
  1976. PROCEDURE DisableIRQ* (int: LONGINT);
  1977. BEGIN
  1978. ASSERT((int >= IRQ0) & (int <= IRQ15) & (int # IRQ2));
  1979. Acquire(Interrupts); (* protect interrupt mask register *)
  1980. InDisableIRQ(int);
  1981. Release(Interrupts)
  1982. END DisableIRQ;
  1983. (** InstallHandler - Install interrupt handler & enable IRQ if necessary.
  1984. On entry to h interrupts are disabled and may be enabled with Sti. After handling the interrupt
  1985. the state of interrupts are restored. The acknowledgement of a hardware interrupt is done automatically.
  1986. IRQs are mapped from IRQ0 to MaxIRQ. *)
  1987. PROCEDURE InstallHandler* (h: Handler; int: LONGINT);
  1988. VAR (* n: HandlerList; *) i: LONGINT; unexpected: Handler;
  1989. BEGIN
  1990. ASSERT(default.valid); (* initialized *)
  1991. ASSERT(int # IRQ2); (* IRQ2 is used for cascading and remapped to IRQ9 *)
  1992. Acquire(Interrupts);
  1993. (* FieldInterrupt may traverse list while it is being modified *)
  1994. i := 0;
  1995. unexpected := Unexpected;
  1996. IF intHandler[int, 0].handler # unexpected THEN
  1997. WHILE (i < MaxNumHandlers - 1) & intHandler[int, i].valid DO
  1998. INC(i)
  1999. END;
  2000. IF i < MaxNumHandlers - 1 THEN
  2001. intHandler[int, i].valid := TRUE;
  2002. intHandler[int, i].handler := h;
  2003. ELSE
  2004. Acquire(TraceOutput);
  2005. Trace.String("Machine.InstallHandler: handler could not be installed for interrupt "); Trace.Int(int, 0);
  2006. Trace.String(" - too many handlers per interrupt number"); Trace.Ln;
  2007. Release(TraceOutput)
  2008. END
  2009. ELSE
  2010. intHandler[int, 0].handler := h;
  2011. IF (int >= IRQ0) & (int <= IRQ15) THEN InEnableIRQ(int) END
  2012. END;
  2013. Release(Interrupts)
  2014. END InstallHandler;
  2015. (** RemoveHandler - Uninstall interrupt handler & disable IRQ if necessary *)
  2016. PROCEDURE RemoveHandler* (h: Handler; int: LONGINT);
  2017. VAR (* p, c: HandlerList; *) i, j, foundIndex: LONGINT;
  2018. BEGIN
  2019. ASSERT(default.valid); (* initialized *)
  2020. Acquire(Interrupts);
  2021. (* find h *)
  2022. i := 0;
  2023. foundIndex := -1;
  2024. WHILE (i < MaxNumHandlers - 1) & intHandler[int, i].valid DO
  2025. IF intHandler[int, i].handler = h THEN foundIndex := i END;
  2026. INC(i)
  2027. END;
  2028. IF foundIndex # -1 THEN
  2029. (* h found -> copy interrupt handlers higher than foundIndex *)
  2030. FOR j := foundIndex TO i - 2 DO
  2031. intHandler[int, j] := intHandler[int, j + 1]
  2032. END
  2033. END;
  2034. IF ~intHandler[int, 0].valid THEN
  2035. (* handler h was the only interrupt handler for interrupt int -> install the default handler *)
  2036. intHandler[int, 0] := default;
  2037. IF (int >= IRQ0) & (int <= IRQ15) THEN DisableIRQ(int) END
  2038. END;
  2039. Release(Interrupts)
  2040. END RemoveHandler;
  2041. (*
  2042. PROCEDURE ListIntHandlers*;
  2043. VAR i, j, highest: LONGINT; handler: Handler;
  2044. BEGIN
  2045. highest := 0;
  2046. FOR i := 0 TO IDTSize - 1 DO
  2047. j := 0;
  2048. WHILE (j < MaxNumHandlers - 1) & intHandler[i, j].valid DO INC(j) END;
  2049. Trace.String("int = "); Trace.Int(i, 3); Trace.String(" # installed handlers = "); Trace.Int(j, 0);
  2050. IF j = 1 THEN
  2051. handler := Unexpected;
  2052. IF intHandler[i, 0].handler = handler THEN
  2053. Trace.String(" default handler installed")
  2054. END
  2055. END;
  2056. Trace.Ln;
  2057. IF j > highest THEN highest := j END;
  2058. END;
  2059. Trace.String("highest # installed handlers = "); Trace.Int(highest, 0); Trace.Ln
  2060. END ListIntHandlers;
  2061. *)
  2062. (* Get control registers. *)
  2063. PROCEDURE GetCR0to4(VAR cr: ARRAY OF LONGINT);
  2064. CODE {SYSTEM.Pentium, SYSTEM.Privileged}
  2065. MOV EDI, [EBP+cr]
  2066. MOV EAX, CR0
  2067. XOR EBX, EBX ; CR1 is not documented
  2068. MOV ECX, CR2
  2069. MOV EDX, CR3
  2070. MOV [EDI], EAX
  2071. MOV [EDI+4], EBX
  2072. MOV [EDI+8], ECX
  2073. MOV [EDI+12], EDX
  2074. MOV EAX, CR4 ; Pentium only
  2075. MOV [EDI+16], EAX
  2076. END GetCR0to4;
  2077. (* GetDR0to7 - Get debug registers. *)
  2078. PROCEDURE GetDR0to7(VAR dr: ARRAY OF LONGINT);
  2079. CODE {SYSTEM.i386, SYSTEM.Privileged}
  2080. MOV EDI, [EBP+dr]
  2081. MOV EAX, DR0
  2082. MOV EBX, DR1
  2083. MOV ECX, DR2
  2084. MOV EDX, DR3
  2085. MOV [EDI], EAX
  2086. MOV [EDI+4], EBX
  2087. MOV [EDI+8], ECX
  2088. MOV [EDI+12], EDX
  2089. XOR EAX, EAX ; DR4 is not documented
  2090. XOR EBX, EBX ; DR5 is not documented
  2091. MOV ECX, DR6
  2092. MOV EDX, DR7
  2093. MOV [EDI+16], EAX
  2094. MOV [EDI+20], EBX
  2095. MOV [EDI+24], ECX
  2096. MOV [EDI+28], EDX
  2097. END GetDR0to7;
  2098. (* GetSegments - Get segment registers. *)
  2099. PROCEDURE GetSegments(VAR ss, es, ds, fs, gs: LONGINT);
  2100. CODE {SYSTEM.i386}
  2101. XOR EAX, EAX
  2102. MOV EBX, [EBP+ss]
  2103. MOV AX, SS
  2104. MOV [EBX], EAX
  2105. MOV EBX, [EBP+es]
  2106. MOV AX, ES
  2107. MOV [EBX], EAX
  2108. MOV EBX, [EBP+ds]
  2109. MOV AX, DS
  2110. MOV [EBX], EAX
  2111. MOV EBX, [EBP+fs]
  2112. MOV AX, FS
  2113. MOV [EBX], EAX
  2114. MOV EBX, [EBP+gs]
  2115. MOV AX, GS
  2116. MOV [EBX], EAX
  2117. END GetSegments;
  2118. (* CLTS - Clear task-switched flag. *)
  2119. PROCEDURE -CLTS;
  2120. CODE {SYSTEM.i386, SYSTEM.Privileged}
  2121. CLTS
  2122. END CLTS;
  2123. (* GetFPU - Store floating-point environment (28 bytes) and mask all floating-point exceptions. *)
  2124. PROCEDURE -GetFPU(adr: ADDRESS);
  2125. CODE {SYSTEM.i386, SYSTEM.FPU}
  2126. POP EBX
  2127. FNSTENV [EBX] ; also masks all exceptions
  2128. FWAIT
  2129. END GetFPU;
  2130. (* CR2 - Get page fault address. *)
  2131. PROCEDURE -CR2* (): ADDRESS;
  2132. CODE {SYSTEM.i386, SYSTEM.Privileged}
  2133. MOV EAX, CR2
  2134. END CR2;
  2135. (** GetExceptionState - Get exception state from interrupt state (and switch on interrupts). *)
  2136. PROCEDURE GetExceptionState* (VAR int: State; VAR exc: ExceptionState);
  2137. VAR id: LONGINT; level0: BOOLEAN;
  2138. BEGIN
  2139. (* save all state information while interrupts are still disabled *)
  2140. exc.halt := -int.INT; id := ID ();
  2141. IF int.INT = PF THEN exc.pf := CR2 () ELSE exc.pf := 0 END;
  2142. GetCR0to4(exc.CR);
  2143. GetDR0to7(exc.DR);
  2144. CLTS; (* ignore task switch flag *)
  2145. IF int.INT = MF THEN
  2146. GetFPU(ADDRESSOF(exc.FPU[0]));
  2147. int.PC := SYSTEM.VAL (ADDRESS, exc.FPU[3]); (* modify PC according to FPU info *)
  2148. (* set halt code according to FPU info *)
  2149. IF 2 IN exc.FPU[1] THEN exc.halt := -32 (* division by 0 *)
  2150. ELSIF 3 IN exc.FPU[1] THEN exc.halt := -33 (* overflow *)
  2151. ELSIF 0 IN exc.FPU[1] THEN exc.halt := -34 (* operation invalid *)
  2152. ELSIF 6 IN exc.FPU[1] THEN exc.halt := -35 (* stack fault *)
  2153. ELSIF 1 IN exc.FPU[1] THEN exc.halt := -36 (* denormalized *)
  2154. ELSIF 4 IN exc.FPU[1] THEN exc.halt := -37 (* underflow *)
  2155. ELSIF 5 IN exc.FPU[1] THEN exc.halt := -38 (* precision loss *)
  2156. ELSE (* {exc.halt = -16} *)
  2157. END
  2158. ELSE
  2159. Fill32(ADDRESSOF(exc.FPU[0]), LEN(exc.FPU)*SIZEOF(SET), 0)
  2160. END;
  2161. SetupFPU;
  2162. level0 := (int.CS MOD 4 = KernelLevel);
  2163. IF int.INT = BP THEN (* breakpoint (HALT) *)
  2164. IF level0 THEN
  2165. exc.halt := int.SP (* get halt code *)
  2166. (* if HALT(MAX(INTEGER)), leave halt code on stack when returning, but not serious problem.*)
  2167. ELSE
  2168. SYSTEM.GET (int.SP, exc.halt); (* get halt code from outer stack *)
  2169. IF exc.halt >= MAX(INTEGER) THEN INC (int.SP, AddressSize) END (* pop halt code from outer stack *)
  2170. END;
  2171. IF exc.halt < MAX(INTEGER) THEN DEC (int.PC) END; (* point to the INT 3 instruction (assume 0CCX, not 0CDX 3X) *)
  2172. ELSIF int.INT = OVF THEN (* overflow *)
  2173. DEC (int.PC) (* point to the INTO instruction (assume 0CEX, not 0CDX 4X) *)
  2174. ELSIF int.INT = PF THEN (* page fault *)
  2175. IF int.PC = 0 THEN (* reset PC to return address of indirect CALL to 0 *)
  2176. IF level0 THEN int.PC := int.SP (* ret adr *) ELSE SYSTEM.GET (int.SP, int.PC) END
  2177. END
  2178. END;
  2179. (* get segment registers *)
  2180. GetSegments(exc.SS, exc.ES, exc.DS, exc.FS, exc.GS);
  2181. IF level0 THEN (* from same level, no ESP, SS etc. on stack *)
  2182. exc.SP := ADDRESSOF(int.SP) (* stack was here when interrupt happened *)
  2183. ELSE (* from outer level *)
  2184. exc.SP := int.SP; exc.SS := int.SS
  2185. END
  2186. END GetExceptionState;
  2187. (* FieldInterrupt and FieldIRQ *)
  2188. (*
  2189. At entry to a Handler procedure the stack is as follows:
  2190. 72 -- .GS
  2191. 68 -- .FS
  2192. 64 -- .DS
  2193. 60 -- .ES ; or haltcode
  2194. -- if (VMBit IN .FLAGS) --
  2195. 56 -- .SS
  2196. 52 -- .ESP ; or haltcode
  2197. -- (VMBit IN .EFLAGS) OR (CS MOD 4 < .CS MOD 4) --
  2198. 48 -- .EFLAGS
  2199. 44 -- .CS
  2200. 40 -- .EIP ; rest popped by IRETD
  2201. 36 -- .ERR/EBP ; pushed by processor or glue code, popped by POP EBP
  2202. 32 -- .INT <-- .ESP0 ; pushed by glue code, popped by POP EBP
  2203. 28 -- .EAX
  2204. 24 -- .ECX
  2205. 20 -- .EDX
  2206. 16 -- .EBX
  2207. 12 -- .ESP0
  2208. 08 -- .BP/ERR ; exchanged by glue code
  2209. 04 -- .ESI
  2210. 00 24 .EDI <--- state: State
  2211. -- 20 ptr
  2212. -- 16 object pointer for DELEGATE
  2213. -- 12 TAG(state)
  2214. -- 08 ADR(state)
  2215. -- 04 EIP' (RET to FieldInterrupt)
  2216. -- 00 EBP' <-- EBP
  2217. -- -- locals <-- ESP
  2218. *)
  2219. PROCEDURE FieldInterrupt;
  2220. CODE {SYSTEM.i386} ; 3 bytes implicit code skipped: PUSH EBP; MOV EBP, ESP
  2221. entry:
  2222. PUSHAD ; save all registers (EBP = error code)
  2223. LEA EBP, [ESP+36] ; procedure link (for correct tracing of interrupt procedures)
  2224. MOV EBX, [ESP+32] ; EBX = int number
  2225. IMUL EBX, EBX, MaxNumHandlers
  2226. IMUL EBX, EBX, 12
  2227. LEA EAX, intHandler
  2228. ADD EAX, EBX ; address of intHandler[int, 0]
  2229. loop: ; call all handlers for the interrupt
  2230. MOV ECX, ESP
  2231. PUSH EAX ; save ptr for linked list
  2232. PUSH DWORD [EAX+8] ; delegate
  2233. PUSH stateTag ; TAG(state)
  2234. PUSH ECX ; ADR(state)
  2235. CALL DWORD [EAX+4] ; call handler
  2236. ADD ESP, 12
  2237. CLI ; handler may have re-enabled interrupts
  2238. POP EAX
  2239. ADD EAX, 12
  2240. MOV EBX, [EAX]
  2241. CMP EBX, 0
  2242. JNE loop
  2243. POPAD ; now EBP = error code
  2244. POP EBP ; now EBP = INT
  2245. POP EBP ; now EBP = caller EBP
  2246. IRETD
  2247. END FieldInterrupt;
  2248. PROCEDURE FieldIRQ;
  2249. CODE {SYSTEM.i386} ; 3 bytes implicit code skipped: PUSH EBP; MOV EBP, ESP
  2250. entry:
  2251. PUSHAD ; save all registers (EBP = error code)
  2252. LEA EBP, [ESP+36] ; procedure link (for correct tracing of interrupt procedures)
  2253. ; PUSH [ESP+32] ; int number
  2254. ; CALL traceInterruptIn
  2255. MOV EBX, [ESP+32] ; EBX = int number
  2256. CMP BL, IRQ0 + 7 ; if irq=7 then check for spurious interrupt on master
  2257. JNE skip1
  2258. MOV AL, 0BH
  2259. OUT IntA0, AL
  2260. IN AL, IntA0
  2261. BT AX, 7
  2262. JNC end
  2263. skip1:
  2264. CMP BL, IRQ8 + 7 ; if irq=15 then check for spurious interrupt on slave
  2265. JNE skip2
  2266. MOV AL, 0BH
  2267. OUT IntB0, AL
  2268. IN AL, IntB0
  2269. BT AX, 7
  2270. MOV AL, 20H
  2271. JNC irq0 ; acknowledge IRQ on master
  2272. skip2:
  2273. IMUL EBX, EBX, MaxNumHandlers
  2274. IMUL EBX, EBX, 12
  2275. LEA EAX, intHandler
  2276. ADD EAX, EBX ; address of intHandler[int, 0]
  2277. loop: ; call all handlers for the interrupt
  2278. MOV ECX, ESP
  2279. PUSH EAX ; save ptr for linked list
  2280. PUSH DWORD [EAX+8] ; delegate
  2281. PUSH stateTag ; TAG(state)
  2282. PUSH ECX ; ADR(state)
  2283. CALL DWORD [EAX+4] ; call handler
  2284. ADD ESP, 12
  2285. CLI ; handler may have re-enabled interrupts
  2286. POP EAX
  2287. ADD EAX, 12
  2288. MOV EBX, [EAX]
  2289. CMP EBX, 0
  2290. JNE loop
  2291. ; PUSH [ESP+32] ; int number
  2292. ; CALL traceInterruptOut
  2293. ; ack interrupt
  2294. MOV AL, 20H ; undoc PC ed. 2 p. 1018
  2295. CMP BYTE [ESP+32], IRQ8
  2296. JB irq0
  2297. OUT IntB0, AL ; 2nd controller
  2298. irq0:
  2299. OUT IntA0, AL ; 1st controller
  2300. end:
  2301. POPAD ; now EBP = error code
  2302. POP EBP ; now EBP = INT
  2303. POP EBP ; now EBP = caller EBP
  2304. IRETD
  2305. END FieldIRQ;
  2306. (* LoadIDT - Load interrupt descriptor table *)
  2307. PROCEDURE LoadIDT(base: ADDRESS; size: SIZE);
  2308. CODE {SYSTEM.i386, SYSTEM.Privileged}
  2309. SHL DWORD [EBP+size], 16
  2310. MOV EBX, 2
  2311. LIDT [EBP+EBX+size]
  2312. END LoadIDT;
  2313. (** Init - Initialize interrupt handling. Called once during initialization. Uses NEW. *)
  2314. (*
  2315. The glue code is:
  2316. entry0: ; entry point for interrupts without error code
  2317. PUSH 0 ; fake error code
  2318. entry1: ; entry point for interrupts with error code
  2319. XCHG [ESP], EBP ; exchange error code and caller EBP
  2320. PUSH int ; interrupt number
  2321. JMP FieldInterrupt:entry
  2322. *)
  2323. PROCEDURE InitInterrupts*;
  2324. VAR a: ADDRESS; o, i: LONGINT; p: PROCEDURE; mask: SET;
  2325. BEGIN
  2326. stateTag := SYSTEM.TYPECODE(State);
  2327. (* initialise 8259 interrupt controller chips *)
  2328. Portout8 (IntA0, 11X); Portout8 (IntA1, CHR(IRQ0));
  2329. Portout8 (IntA1, 4X); Portout8 (IntA1, 1X); Portout8 (IntA1, 0FFX);
  2330. Portout8 (IntB0, 11X); Portout8 (IntB1, CHR(IRQ8));
  2331. Portout8 (IntB1, 2X); Portout8 (IntB1, 1X); Portout8 (IntB1, 0FFX);
  2332. (* enable interrupts from second interrupt controller, chained to line 2 of controller 1 *)
  2333. Portin8(IntA1, SYSTEM.VAL (CHAR, mask));
  2334. EXCL(mask, IRQ2-IRQ0);
  2335. Portout8 (IntA1, SYSTEM.VAL (CHAR, mask));
  2336. (*
  2337. NEW(default); default.next := NIL; default.handler := Unexpected;
  2338. *)
  2339. (*
  2340. newrec (SYSTEM.VAL (ANY, default), SYSTEM.TYPECODE (HandlerList));
  2341. *)
  2342. (* default.next := NIL; default.handler := Unexpected; *)
  2343. default.valid := TRUE; default.handler := Unexpected;
  2344. FOR i := 0 TO IDTSize-1 DO (* set up glue code *)
  2345. intHandler[i, 0] := default; o := 0;
  2346. (* PUSH error code, int num & regs *)
  2347. glue[i][o] := 6AX; INC (o); glue[i][o] := 0X; INC (o); (* PUSH 0 ; {o = 2} *)
  2348. glue[i][o] := 87X; INC (o); glue[i][o] := 2CX; INC (o); glue[i][o] := 24X; INC (o); (* XCHG [ESP], EBP *)
  2349. glue[i][o] := 6AX; INC (o); glue[i][o] := CHR(i); INC (o); (* PUSH i *)
  2350. IF (i >= IRQ0) & (i <= IRQ15) THEN p := FieldIRQ ELSE p := FieldInterrupt END;
  2351. a := SYSTEM.VAL (ADDRESS, p) + 3 - (ADDRESSOF(glue[i][o]) + 5);
  2352. glue[i][o] := 0E9X; INC (o); (* JMP FieldInterrupt.entry *)
  2353. SYSTEM.PUT32 (ADDRESSOF(glue[i][o]), a);
  2354. (* set up IDT entry *)
  2355. IF (i > 31) OR ~(i IN {8, 10..14, 17}) THEN a := ADDRESSOF(glue[i][0]) (* include PUSH 0 *)
  2356. ELSE a := ADDRESSOF(glue[i][2]) (* skip PUSH 0, processor supplies error code *)
  2357. END;
  2358. idt[i].offsetBits0to15 := INTEGER(a MOD 10000H);
  2359. (* IRQ0 must be at level 0 because time slicing in Objects needs to set interrupted process' ESP *)
  2360. (* all irq's are handled at level 0, because of priority experiment in Objects.FieldIRQ *)
  2361. IF TRUE (* (i < IRQ0) OR (i > IRQ15) OR (i = IRQ0) OR (i = IRQ0 + 1)*) THEN
  2362. idt[i].selector := KernelCodeSel; (* gdt[1] -> non-conformant segment => level 0 *)
  2363. idt[i].gateType := SYSTEM.VAL (INTEGER, 0EE00H) (* present, DPL 3, system, 386 interrupt *)
  2364. ELSE (* {IRQ0..IRQ15} - {IRQ0 + 1} *)
  2365. idt[i].selector := UserCodeSel; (* gdt[3] -> conformant segment => level 0 or 3 *)
  2366. idt[i].gateType := SYSTEM.VAL (INTEGER, 08E00H) (* present, DPL 0, system, 386 interrupt *)
  2367. END;
  2368. idt[i].offsetBits16to31 := INTEGER(a DIV 10000H)
  2369. END
  2370. END InitInterrupts;
  2371. (** Start - Start handling interrupts. Every processor calls this once during initialization. *)
  2372. PROCEDURE Start*;
  2373. BEGIN
  2374. ASSERT(default.valid); (* initialized *)
  2375. LoadIDT(ADDRESSOF(idt[0]), SIZEOF(IDT)-1);
  2376. Sti
  2377. END Start;
  2378. (* Return current instruction pointer *)
  2379. PROCEDURE CurrentPC* (): ADDRESS;
  2380. CODE {SYSTEM.i386}
  2381. MOV EAX, [EBP+4]
  2382. END CurrentPC;
  2383. (* Return current frame pointer *)
  2384. PROCEDURE -CurrentBP* (): ADDRESS;
  2385. CODE {SYSTEM.i386}
  2386. MOV EAX, EBP
  2387. END CurrentBP;
  2388. (* Set current frame pointer *)
  2389. PROCEDURE -SetBP* (bp: ADDRESS);
  2390. CODE {SYSTEM.i386}
  2391. POP EBP
  2392. END SetBP;
  2393. (* Return current stack pointer *)
  2394. PROCEDURE -CurrentSP* (): ADDRESS;
  2395. CODE {SYSTEM.i386}
  2396. MOV EAX, ESP
  2397. END CurrentSP;
  2398. (* Set current stack pointer *)
  2399. PROCEDURE -SetSP* (sp: ADDRESS);
  2400. CODE {SYSTEM.i386}
  2401. POP ESP
  2402. END SetSP;
  2403. (* Save minimal FPU state (for synchronous process switches). *)
  2404. (* saving FPU state takes 108 bytes memory space, no alignment required *)
  2405. PROCEDURE -FPUSaveMin* (VAR state: SSEState);
  2406. CODE {SYSTEM.i386, SYSTEM.FPU}
  2407. POP EAX
  2408. FNSTCW [EAX] ; control word is at state[0]
  2409. FWAIT
  2410. END FPUSaveMin;
  2411. (* Restore minimal FPU state. *)
  2412. PROCEDURE -FPURestoreMin* (VAR state: SSEState);
  2413. CODE {SYSTEM.i386, SYSTEM.FPU}
  2414. POP EAX
  2415. FLDCW [EAX] ; control word is at state[0]
  2416. END FPURestoreMin;
  2417. (* Save full FPU state (for asynchronous process switches). *)
  2418. PROCEDURE -FPUSaveFull* (VAR state: SSEState);
  2419. CODE {SYSTEM.i386, SYSTEM.FPU}
  2420. POP EAX
  2421. FSAVE [EAX]
  2422. END FPUSaveFull;
  2423. (* Restore full FPU state. *)
  2424. PROCEDURE -FPURestoreFull* (VAR state: SSEState);
  2425. CODE {SYSTEM.i386, SYSTEM.FPU}
  2426. POP EAX
  2427. FRSTOR [EAX]
  2428. END FPURestoreFull;
  2429. (* stateAdr must be the address of a 16-byte aligned memory area of at least 512 bytes *)
  2430. PROCEDURE -SSESaveFull* (stateAdr: ADDRESS);
  2431. CODE {SYSTEM.P2, SYSTEM.FPU, SYSTEM.SSE2}
  2432. POP EAX
  2433. FXSAVE [EAX]
  2434. FWAIT
  2435. FNINIT
  2436. END SSESaveFull;
  2437. PROCEDURE -SSERestoreFull* (stateAdr: ADDRESS);
  2438. CODE {SYSTEM.P2, SYSTEM.FPU, SYSTEM.SSE2}
  2439. POP EAX
  2440. FXRSTOR [EAX]
  2441. END SSERestoreFull;
  2442. PROCEDURE -SSESaveMin* (stateAdr: ADDRESS);
  2443. CODE {SYSTEM.i386, SYSTEM.FPU, SYSTEM.SSE2}
  2444. POP EAX
  2445. FNSTCW [EAX]
  2446. FWAIT
  2447. STMXCSR [EAX+24]
  2448. END SSESaveMin;
  2449. PROCEDURE -SSERestoreMin* (stateAdr: ADDRESS);
  2450. CODE {SYSTEM.i386, SYSTEM.FPU, SYSTEM.SSE2}
  2451. POP EAX
  2452. FLDCW [EAX]
  2453. LDMXCSR [EAX+24]
  2454. END SSERestoreMin;
  2455. (* Helper functions for SwitchTo. *)
  2456. PROCEDURE -PushState* (CONST state: State);
  2457. CODE {SYSTEM.i386}
  2458. POP EAX ; ADR (state)
  2459. POP EBX ; TYPECODE (state), ignored
  2460. PUSH DWORD [EAX+48] ; FLAGS
  2461. PUSH DWORD [EAX+44] ; CS
  2462. PUSH DWORD [EAX+40] ; PC
  2463. PUSH DWORD [EAX+28] ; EAX
  2464. PUSH DWORD [EAX+24] ; ECX
  2465. PUSH DWORD [EAX+20] ; EDX
  2466. PUSH DWORD [EAX+16] ; EBX
  2467. PUSH DWORD 0 ; ignored
  2468. PUSH DWORD [EAX+36] ; BP
  2469. PUSH DWORD [EAX+4] ; ESI
  2470. PUSH DWORD [EAX+0] ; EDI
  2471. END PushState;
  2472. PROCEDURE -JumpState*;
  2473. CODE {SYSTEM.i386}
  2474. POPAD
  2475. IRETD
  2476. END JumpState;
  2477. PROCEDURE -CallLocalIPC*;
  2478. CODE {SYSTEM.i386}
  2479. INT MPIPCLocal
  2480. END CallLocalIPC;
  2481. PROCEDURE -HLT*;
  2482. CODE {SYSTEM.i386, SYSTEM.Privileged}
  2483. STI ; (* required according to ACPI 2.0 spec section 8.2.2 *)
  2484. HLT
  2485. END HLT;
  2486. PROCEDURE -GetEAX*(): LONGINT;
  2487. CODE{SYSTEM.i386}
  2488. END GetEAX;
  2489. PROCEDURE -GetECX*(): LONGINT;
  2490. CODE{SYSTEM.i386}
  2491. MOV EAX,ECX
  2492. END GetECX;
  2493. PROCEDURE -GetESI*(): LONGINT;
  2494. CODE{SYSTEM.i386}
  2495. MOV EAX,ESI
  2496. END GetESI;
  2497. PROCEDURE -GetEDI*(): LONGINT;
  2498. CODE{SYSTEM.i386}
  2499. MOV EAX,EDI
  2500. END GetEDI;
  2501. PROCEDURE -SetEAX*(n: LONGINT);
  2502. CODE{SYSTEM.i386} POP EAX
  2503. END SetEAX;
  2504. PROCEDURE -SetEBX*(n: LONGINT);
  2505. CODE{SYSTEM.i386}
  2506. POP EBX
  2507. END SetEBX;
  2508. PROCEDURE -SetECX*(n: LONGINT);
  2509. CODE{SYSTEM.i386}
  2510. POP ECX
  2511. END SetECX;
  2512. PROCEDURE -SetEDX*(n: LONGINT);
  2513. CODE{SYSTEM.i386}
  2514. POP EDX
  2515. END SetEDX;
  2516. PROCEDURE -SetESI*(n: LONGINT);
  2517. CODE{SYSTEM.i386}
  2518. POP ESI
  2519. END SetESI;
  2520. PROCEDURE -SetEDI*(n: LONGINT);
  2521. CODE{SYSTEM.i386}
  2522. POP EDI
  2523. END SetEDI;
  2524. PROCEDURE Portin8*(port: LONGINT; VAR val: CHAR);
  2525. CODE{SYSTEM.i386}
  2526. MOV EDX,[EBP+port]
  2527. IN AL, DX
  2528. MOV ECX, [EBP+val]
  2529. MOV [ECX], AL
  2530. END Portin8;
  2531. PROCEDURE Portin16*(port: LONGINT; VAR val: INTEGER);
  2532. CODE{SYSTEM.i386}
  2533. MOV EDX,[EBP+port]
  2534. IN AX, DX
  2535. MOV ECX, [EBP+val]
  2536. MOV [ECX], AX
  2537. END Portin16;
  2538. PROCEDURE Portin32*(port: LONGINT; VAR val: LONGINT);
  2539. CODE{SYSTEM.i386}
  2540. MOV EDX,[EBP+port]
  2541. IN EAX, DX
  2542. MOV ECX, [EBP+val]
  2543. MOV [ECX], EAX
  2544. END Portin32;
  2545. PROCEDURE Portout8*(port: LONGINT; val: CHAR);
  2546. CODE{SYSTEM.i386}
  2547. MOV AL,[EBP+val]
  2548. MOV EDX,[EBP+port]
  2549. OUT DX,AL
  2550. END Portout8;
  2551. PROCEDURE Portout16*(port: LONGINT; val: INTEGER);
  2552. CODE{SYSTEM.i386}
  2553. MOV AX,[EBP+val]
  2554. MOV EDX,[EBP+port]
  2555. OUT DX,AX
  2556. END Portout16;
  2557. PROCEDURE Portout32*(port: LONGINT; val: LONGINT);
  2558. CODE{SYSTEM.i386}
  2559. MOV EAX,[EBP+val]
  2560. MOV EDX,[EBP+port]
  2561. OUT DX,EAX
  2562. END Portout32;
  2563. (* Kernel mode upcall to perform global processor halt. *)
  2564. PROCEDURE KernelCallHLT*;
  2565. CODE {SYSTEM.i386}
  2566. MOV EAX, 2
  2567. INT MPKC
  2568. END KernelCallHLT;
  2569. (* Parse processor entry in MP config table. *)
  2570. PROCEDURE CPUID1*(): LONGINT;
  2571. CODE {SYSTEM.i386, SYSTEM.Pentium}
  2572. MOV EAX, 1
  2573. CPUID
  2574. MOV EAX, EBX
  2575. END CPUID1;
  2576. (** -- Atomic operations -- *)
  2577. (** Atomic INC(x). *)
  2578. PROCEDURE -AtomicInc*(VAR x: LONGINT);
  2579. CODE {SYSTEM.i386}
  2580. POP EAX
  2581. LOCK
  2582. INC DWORD [EAX]
  2583. END AtomicInc;
  2584. (** Atomic DEC(x). *)
  2585. PROCEDURE -AtomicDec*(VAR x: LONGINT);
  2586. CODE {SYSTEM.i386}
  2587. POP EAX
  2588. LOCK
  2589. DEC DWORD [EAX]
  2590. END AtomicDec;
  2591. (** Atomic EXCL. *)
  2592. PROCEDURE AtomicExcl* (VAR s: SET; bit: LONGINT);
  2593. CODE {SYSTEM.i386}
  2594. MOV EAX, [EBP+bit]
  2595. MOV EBX, [EBP+s]
  2596. LOCK
  2597. BTR [EBX], EAX
  2598. END AtomicExcl;
  2599. (** Atomic INC(x, y). *)
  2600. PROCEDURE -AtomicAdd*(VAR x: LONGINT; y: LONGINT);
  2601. CODE {SYSTEM.i386}
  2602. POP EBX
  2603. POP EAX
  2604. LOCK
  2605. ADD DWORD [EAX], EBX
  2606. END AtomicAdd;
  2607. (** Atomic test-and-set. Set x = TRUE and return old value of x. *)
  2608. PROCEDURE -AtomicTestSet*(VAR x: BOOLEAN): BOOLEAN;
  2609. CODE {SYSTEM.i386}
  2610. POP EBX
  2611. MOV AL, 1
  2612. XCHG [EBX], AL
  2613. END AtomicTestSet;
  2614. (* Atomic compare-and-swap. Set x = new if x = old and return old value of x *)
  2615. PROCEDURE -AtomicCAS* (VAR x: LONGINT; old, new: LONGINT): LONGINT;
  2616. CODE {SYSTEM.i386}
  2617. POP EBX ; new
  2618. POP EAX ; old
  2619. POP ECX ; address of x
  2620. DB 0F0X, 00FX, 0B1X, 019X ; LOCK CMPXCHG [ECX], EBX; atomicly compare x with old and set it to new if equal
  2621. END AtomicCAS;
  2622. PROCEDURE CopyState* (CONST from: State; VAR to: State);
  2623. BEGIN
  2624. to.EDI := from.EDI; to.ESI := from.ESI;
  2625. to.EBX := from.EBX; to.EDX := from.EDX;
  2626. to.ECX := from.ECX; to.EAX := from.EAX;
  2627. to.BP := from.BP; to.PC := from.PC;
  2628. to.CS := from.CS; to.FLAGS := from.FLAGS;
  2629. to.SP := from.SP
  2630. END CopyState;
  2631. (* function returning the number of processors that are available to Aos *)
  2632. PROCEDURE NumberOfProcessors*( ): LONGINT;
  2633. BEGIN
  2634. RETURN numberOfProcessors
  2635. END NumberOfProcessors;
  2636. (*! non portable code, for native Aos only *)
  2637. PROCEDURE SetNumberOfProcessors*(num: LONGINT);
  2638. BEGIN
  2639. numberOfProcessors := num;
  2640. END SetNumberOfProcessors;
  2641. (* function for changing byte order *)
  2642. PROCEDURE ChangeByteOrder* (n: LONGINT): LONGINT;
  2643. CODE { SYSTEM.Pentium }
  2644. MOV EAX, [EBP+n] ; load n in eax
  2645. BSWAP EAX ; swap byte order
  2646. END ChangeByteOrder;
  2647. (* Write a value to the APIC. *)
  2648. PROCEDURE ApicPut(ofs: SIZE; val: SET);
  2649. BEGIN
  2650. IF TraceApic THEN
  2651. Acquire(TraceOutput);
  2652. Trace.Hex(ofs, SIZEOF(SIZE)*2); Trace.String(" := "); Trace.Hex(SYSTEM.VAL (LONGINT, val), 9); Trace.Ln;
  2653. Release(TraceOutput);
  2654. END;
  2655. SYSTEM.PUT(localAPIC+ofs, SYSTEM.VAL (LONGINT, val))
  2656. END ApicPut;
  2657. (* Read a value from the APIC. *)
  2658. PROCEDURE ApicGet(ofs: SIZE): SET;
  2659. VAR val: SET;
  2660. BEGIN
  2661. SYSTEM.GET(localAPIC+ofs, SYSTEM.VAL (LONGINT, val));
  2662. IF TraceApic THEN
  2663. Acquire(TraceOutput);
  2664. Trace.String(" ("); Trace.Hex(ofs, SIZEOF(SIZE)*2); Trace.String(" = ");
  2665. Trace.Hex(SYSTEM.VAL(LONGINT, val), 9); Trace.StringLn (")");
  2666. Release(TraceOutput);
  2667. END;
  2668. RETURN val
  2669. END ApicGet;
  2670. (* Handle interprocessor interrupt. During upcall interrupts are off and processor is at kernel level. *)
  2671. PROCEDURE HandleIPC(VAR state: State);
  2672. VAR id: LONGINT;
  2673. BEGIN
  2674. id := ID();
  2675. IF ~TraceProcessor OR (id IN allProcessors) THEN
  2676. IF FrontBarrier IN ipcFlags THEN
  2677. AtomicExcl(ipcFrontBarrier, id);
  2678. WHILE ipcFrontBarrier # {} DO SpinHint END (* wait for all *)
  2679. END;
  2680. ipcHandler(id, state, ipcMessage); (* interrupts off and at kernel level *)
  2681. IF BackBarrier IN ipcFlags THEN
  2682. AtomicExcl(ipcBackBarrier, id);
  2683. WHILE ipcBackBarrier # {} DO SpinHint END (* wait for all *)
  2684. END;
  2685. AtomicExcl(ipcBusy, id) (* ack - after this point we do not access shared variables for this broadcast *)
  2686. END;
  2687. IF state.INT = MPIPC THEN
  2688. ApicPut(0B0H, {}) (* EOI (not needed for NMI or local call, see 7.4.10.6) *)
  2689. END
  2690. END HandleIPC;
  2691. (* Handle MP error interrupt. *)
  2692. PROCEDURE HandleError(VAR state: State);
  2693. VAR esr: SET; (* int: LONGINT; *)
  2694. BEGIN
  2695. (* int := state.INT; *) esr := ApicGet(280H);
  2696. ApicPut(0B0H, {}); (* EOI *)
  2697. HALT(2302) (* SMP error *)
  2698. END HandleError;
  2699. (* Interprocessor broadcasting. Lock level SMP. *)
  2700. PROCEDURE LocalBroadcast(h: BroadcastHandler; msg: Message; flags: SET);
  2701. BEGIN
  2702. IF Self IN flags THEN ipcBusy := allProcessors
  2703. ELSE ipcBusy := allProcessors - {ID()}
  2704. END;
  2705. ipcFrontBarrier := ipcBusy; ipcBackBarrier := ipcBusy;
  2706. ipcHandler := h; ipcMessage := msg; ipcFlags := flags;
  2707. IF numProcessors > 1 THEN (* ICR: Fixed, Physical, Edge, All Excl. Self, INT IPC *)
  2708. ApicPut(300H, {18..19} + SYSTEM.VAL (SET, MPIPC));
  2709. (*REPEAT UNTIL ~(12 IN ApicGet(300H))*) (* wait for send to finish *)
  2710. END;
  2711. IF Self IN flags THEN CallLocalIPC END; (* "send" to self also *)
  2712. WHILE ipcBusy # {} DO SpinHint END; (* wait for all to ack before we release locks *)
  2713. ipcHandler := NIL; ipcMessage := NIL (* no race, because we have IPC lock *)
  2714. END LocalBroadcast;
  2715. (** Broadcast an operation to all processors. *)
  2716. PROCEDURE Broadcast* (h: BroadcastHandler; msg: Message; flags: SET);
  2717. BEGIN
  2718. Acquire(Processors);
  2719. LocalBroadcast(h, msg, flags);
  2720. Release(Processors)
  2721. END Broadcast;
  2722. (* Start all halted processors. *) (* Lock level Processors. *)
  2723. PROCEDURE StartAll*;
  2724. BEGIN
  2725. Acquire(Processors); (* wait for any pending Stops to finish, and disallow further Stops *)
  2726. ASSERT(stopped & (ipcBusy = {}));
  2727. ipcBusy := allProcessors - {ID()};
  2728. stopped := FALSE;
  2729. WHILE ipcBusy # {} DO SpinHint END; (* wait for all to ack *)
  2730. Release(Processors)
  2731. END StartAll;
  2732. PROCEDURE HandleFlushTLB(id: LONGINT; CONST state: State; msg: Message);
  2733. CODE {SYSTEM.i386, SYSTEM.Privileged}
  2734. MOV EAX, CR3
  2735. MOV CR3, EAX
  2736. END HandleFlushTLB;
  2737. (** Flush the TLBs on all processors (multiprocessor-safe). *)
  2738. PROCEDURE GlobalFlushTLB;
  2739. BEGIN
  2740. Acquire(Processors);
  2741. LocalBroadcast(HandleFlushTLB, NIL, {Self, FrontBarrier, BackBarrier});
  2742. Release(Processors)
  2743. END GlobalFlushTLB;
  2744. PROCEDURE HandleFlushCache(id: LONGINT; CONST state: State; msg: Message);
  2745. CODE {SYSTEM.Pentium, SYSTEM.Privileged}
  2746. WBINVD ; write back and invalidate internal cache and initiate write back and invalidation of external caches
  2747. END HandleFlushCache;
  2748. (** Flush the caches on all processors (multiprocessor-safe). *)
  2749. PROCEDURE GlobalFlushCache;
  2750. BEGIN
  2751. Acquire(Processors);
  2752. LocalBroadcast(HandleFlushCache, NIL, {Self, FrontBarrier, BackBarrier});
  2753. Release(Processors)
  2754. END GlobalFlushCache;
  2755. (* Activate the garbage collector in single-processor mode. Lock level ALL. *)
  2756. PROCEDURE HandleKernelCall(VAR state: State);
  2757. BEGIN (* level 0 *)
  2758. IF IFBit IN state.FLAGS THEN
  2759. Sti (* re-enable interrupts *)
  2760. END;
  2761. CASE state.EAX OF (* see KernelCall* *)
  2762. |2: (* HLT *)
  2763. IF IFBit IN state.FLAGS THEN
  2764. HLT
  2765. END
  2766. END
  2767. END HandleKernelCall;
  2768. (*
  2769. (** Activate the garbage collector immediately (multiprocessor-safe). *)
  2770. PROCEDURE GlobalGC*;
  2771. BEGIN
  2772. Acquire(Processors);
  2773. gcBarrier := allProcessors;
  2774. LocalBroadcast(HandleGC, NIL, {Self, BackBarrier});
  2775. Release(Processors);
  2776. END GlobalGC;
  2777. *)
  2778. PROCEDURE HandleGetTimestamp(id: LONGINT; CONST state: State; msg: Message);
  2779. BEGIN
  2780. time[id] := GetTimer()
  2781. END HandleGetTimestamp;
  2782. (** Get timestamp on all processors (for testing). *)
  2783. PROCEDURE GlobalGetTimestamp;
  2784. VAR t: TimeArray; i: LONGINT; mean, var, n: HUGEINT;
  2785. BEGIN
  2786. Acquire(Processors);
  2787. LocalBroadcast(HandleGetTimestamp, NIL, {Self, FrontBarrier});
  2788. LocalBroadcast(HandleGetTimestamp, NIL, {Self, FrontBarrier});
  2789. t := time;
  2790. Release(Processors);
  2791. Acquire (TraceOutput);
  2792. FOR i := 0 TO numProcessors-1 DO Trace.HIntHex(t[i], 17) END;
  2793. IF numProcessors > 1 THEN
  2794. mean := 0;
  2795. n := numProcessors;
  2796. FOR i := 0 TO numProcessors-1 DO
  2797. INC (mean, t[i])
  2798. END;
  2799. mean := mean DIV n;
  2800. var := 0;
  2801. FOR i := 0 TO numProcessors-1 DO
  2802. n := t[i] - mean;
  2803. INC (var, n * n)
  2804. END;
  2805. var := var DIV (numProcessors - 1);
  2806. Trace.String(" mean="); Trace.HIntHex(mean, 16);
  2807. Trace.String(" var="); Trace.HIntHex(var, 16);
  2808. Trace.String(" var="); Trace.Int(SHORT (var), 1);
  2809. Trace.String(" diff:");
  2810. FOR i := 0 TO numProcessors-1 DO
  2811. Trace.Int(SHORT (t[i] - mean), 1); Trace.Char(" ")
  2812. END
  2813. END;
  2814. Release (TraceOutput);
  2815. END GlobalGetTimestamp;
  2816. PROCEDURE ParseProcessor(adr: ADDRESS);
  2817. VAR id, idx, signature, family, feat, ver, log: LONGINT; flags: SET; string : ARRAY 8 OF CHAR;
  2818. BEGIN
  2819. SYSTEM.GET(adr, SYSTEM.VAL (LONGINT, flags));
  2820. id := ASH(SYSTEM.VAL (LONGINT, flags * {8..15}), -8);
  2821. ver := ASH(SYSTEM.VAL (LONGINT, flags * {16..23}), -16);
  2822. SYSTEM.GET (adr+4, signature);
  2823. family := ASH(signature, -8) MOD 10H;
  2824. SYSTEM.GET (adr+8, feat);
  2825. idx := -1;
  2826. IF (family # 0) & (signature MOD 1000H # 0FFFH) & (24 IN flags) & (id < LEN(idMap)) & (idMap[id] = -1) THEN
  2827. IF 25 IN flags THEN idx := 0 (* boot processor *)
  2828. ELSIF numProcessors < maxProcessors THEN idx := numProcessors; INC(numProcessors)
  2829. ELSE (* skip *)
  2830. END
  2831. END;
  2832. IF idx # -1 THEN apicVer[idx] := ver; idMap[id] := SHORT(SHORT(idx)) END;
  2833. Trace.String(" Processor "); Trace.Int(id, 1);
  2834. Trace.String(", APIC"); Trace.Hex(ver, -3);
  2835. Trace.String(", ver "); Trace.Int(family, 1);
  2836. Trace.Char("."); Trace.Int(ASH(signature, -4) MOD 10H, 1);
  2837. Trace.Char("."); Trace.Int(signature MOD 10H, 1);
  2838. Trace.String(", features "); Trace.Hex(feat, 9);
  2839. Trace.String(", ID "); Trace.Int(idx, 1);
  2840. IF (threadsPerCore > 1) THEN Trace.String(" ("); Trace.Int(threadsPerCore, 0); Trace.String(" threads)"); END;
  2841. Trace.Ln;
  2842. IF (threadsPerCore > 1) THEN
  2843. GetConfig("DisableHyperthreading", string);
  2844. IF (string = "1") THEN
  2845. Trace.String("Machine: Hyperthreading disabled."); Trace.Ln;
  2846. RETURN;
  2847. END;
  2848. log := (LSH(CPUID1(), -16) MOD 256);
  2849. WHILE log > 1 DO
  2850. INC(id); DEC(log);
  2851. IF numProcessors < maxProcessors THEN
  2852. idx := numProcessors; INC(numProcessors);
  2853. apicVer[idx] := ver; idMap[id] := SHORT(SHORT(idx))
  2854. END
  2855. END
  2856. END
  2857. END ParseProcessor;
  2858. (* Parse MP configuration table. *)
  2859. PROCEDURE ParseMPConfig;
  2860. VAR adr, x: ADDRESS; i: LONGINT; entries: INTEGER; ch: CHAR; s: SET; str: ARRAY 8 OF CHAR;
  2861. BEGIN
  2862. localAPIC := 0; numProcessors := 1; allProcessors := {0};
  2863. FOR i := 0 TO LEN(idMap)-1 DO idMap[i] := -1 END; (* all unassigned *)
  2864. FOR i := 0 TO MaxCPU-1 DO started[i] := FALSE END;
  2865. adr := configMP;
  2866. GetConfig("MaxProcs", str);
  2867. i := 0; maxProcessors := StrToInt(i, str);
  2868. IF maxProcessors = 0 THEN maxProcessors := MaxCPU END;
  2869. IF (maxProcessors > 0) & (adr # NilAdr) THEN (* MP config table present, possible multi-processor *)
  2870. Trace.String("Machine: Intel MP Spec "); Trace.Int(ORD(revMP) DIV 10H + 1, 1);
  2871. Trace.Char("."); Trace.Int(ORD(revMP) MOD 10H, 1); Trace.Ln;
  2872. IF TraceVerbose THEN
  2873. IF ODD(ASH(ORD(featureMP[1]), -7)) THEN
  2874. Trace.StringLn (" PIC mode");
  2875. (* to do: enable SymIO *)
  2876. ELSE
  2877. Trace.StringLn (" Virtual wire mode");
  2878. END
  2879. END;
  2880. IF featureMP[0] # 0X THEN (* pre-defined configuration *)
  2881. Trace.String(" Default config "); Trace.Int(ORD(featureMP[0]), 1); Trace.Ln;
  2882. localAPIC := 0FEE00000H;
  2883. apicVer[0] := 0; apicVer[1] := 0
  2884. ELSE (* configuration defined in table *)
  2885. MapPhysical(adr, 68*1024, adr); (* 64K + 4K header *)
  2886. SYSTEM.GET (adr, x); ASSERT(x = 504D4350H); (* check signature *)
  2887. SYSTEM.GET (adr+4, x); (* length *)
  2888. ASSERT(ChecksumMP(adr, x MOD 10000H) = 0);
  2889. IF TraceVerbose THEN
  2890. Trace.String(" ID: ");
  2891. FOR x := adr+8 TO adr+27 DO
  2892. SYSTEM.GET (x, ch); Trace.Char(ch);
  2893. IF x = adr+15 THEN Trace.Char(" ") END
  2894. END;
  2895. Trace.Ln
  2896. END;
  2897. localAPIC := 0; SYSTEM.GET(adr+36, SYSTEM.VAL (LONGINT, localAPIC));
  2898. IF TraceVerbose THEN Trace.String(" Local APIC:"); Trace.Address (localAPIC); Trace.Ln END;
  2899. SYSTEM.GET (adr+34, entries);
  2900. INC(adr, 44); (* skip header *)
  2901. WHILE entries > 0 DO
  2902. SYSTEM.GET (adr, ch); (* type *)
  2903. CASE ORD(ch) OF
  2904. 0: (* processor *)
  2905. ParseProcessor(adr);
  2906. INC(adr, 20)
  2907. |1: (* bus *)
  2908. IF TraceVerbose THEN
  2909. SYSTEM.GET (adr+1, ch);
  2910. Trace.String(" Bus "); Trace.Int(ORD(ch), 1); Trace.String(": ");
  2911. FOR x := adr+2 TO adr+7 DO SYSTEM.GET (x, ch); Trace.Char(ch) END;
  2912. Trace.Ln
  2913. END;
  2914. INC(adr, 8)
  2915. |2: (* IO APIC *)
  2916. IF TraceVerbose THEN
  2917. SYSTEM.GET (adr+1, ch); Trace.String(" IO APIC ID:"); Trace.Hex(ORD(ch), -3);
  2918. SYSTEM.GET (adr+2, ch); Trace.String(", version "); Trace.Int(ORD(ch), 1);
  2919. SYSTEM.GET(adr, SYSTEM.VAL (LONGINT, s)); IF ~(24 IN s) THEN Trace.String(" (disabled)") END;
  2920. Trace.Ln
  2921. END;
  2922. INC(adr, 8)
  2923. |3: (* IO interrupt assignment *)
  2924. INC(adr, 8)
  2925. |4: (* Local interrupt assignment *)
  2926. INC(adr, 8)
  2927. END; (* CASE *)
  2928. DEC(entries)
  2929. END
  2930. END
  2931. END;
  2932. IF localAPIC = 0 THEN (* single processor *)
  2933. Trace.StringLn ("Machine: Single-processor");
  2934. apicVer[0] := 0
  2935. END;
  2936. started[0] := TRUE;
  2937. FOR i := 0 TO MaxCPU-1 DO revIDmap[i] := -1 END;
  2938. FOR i := 0 TO LEN(idMap)-1 DO
  2939. x := idMap[i];
  2940. IF x # -1 THEN
  2941. ASSERT(revIDmap[x] = -1); (* no duplicate APIC ids *)
  2942. revIDmap[x] := SHORT(SHORT(i))
  2943. END
  2944. END;
  2945. (* timer configuration *)
  2946. GetConfig("TimerRate", str);
  2947. i := 0; timerRate := StrToInt(i, str);
  2948. IF timerRate = 0 THEN timerRate := 1000 END;
  2949. IF TraceProcessor THEN
  2950. GetConfig("TraceProc", str);
  2951. i := 0; traceProcessor := StrToInt(i, str) # 0
  2952. END
  2953. END ParseMPConfig;
  2954. (* Return the current average measured bus clock speed in Hz. *)
  2955. PROCEDURE GetBusClockRate(): LONGINT;
  2956. VAR timer: LONGINT; t: LONGINT;
  2957. BEGIN
  2958. t := ticks;
  2959. REPEAT UNTIL ticks # t; (* wait for edge *)
  2960. timer := ticks + ClockRateDelay;
  2961. ApicPut(380H, SYSTEM.VAL (SET, MAX(LONGINT))); (* initial count *)
  2962. REPEAT UNTIL timer - ticks <= 0;
  2963. t := MAX(LONGINT) - SYSTEM.VAL (LONGINT, ApicGet(390H)); (* current count *)
  2964. IF t <= MAX(LONGINT) DIV 1000 THEN
  2965. RETURN 1000 * t DIV ClockRateDelay
  2966. ELSE
  2967. RETURN t DIV ClockRateDelay * 1000
  2968. END
  2969. END GetBusClockRate;
  2970. (* Initialize APIC timer for timeslicing. *)
  2971. PROCEDURE InitMPTimer;
  2972. VAR rate: LONGINT;
  2973. BEGIN
  2974. IF timerRate > 0 THEN
  2975. ApicPut(3E0H, {0,1,3}); (* divide by 1 *)
  2976. ApicPut(320H, {16} + SYSTEM.VAL (SET, MPTMR)); (* masked, one-shot *)
  2977. rate := GetBusClockRate();
  2978. busHz0[ID()] := rate;
  2979. rate := (rate+500000) DIV 1000000 * 1000000; (* round to nearest MHz *)
  2980. busHz1[ID()] := rate;
  2981. ApicPut(320H, {17} + SYSTEM.VAL (SET, MPTMR)); (* unmasked, periodic *)
  2982. ApicPut(380H, SYSTEM.VAL (SET, rate DIV timerRate)) (* initial count *)
  2983. END
  2984. END InitMPTimer;
  2985. (* Handle multiprocessor timer interrupt. *)
  2986. PROCEDURE HandleMPTimer(VAR state: State);
  2987. BEGIN (* {interrupts off} *)
  2988. timer(ID(), state);
  2989. Sti; (* enable interrupts before acquiring locks below - to avoid deadlock with StopAll. *)
  2990. Timeslice(state);
  2991. ApicPut(0B0H, {}); (* EOI *)
  2992. END HandleMPTimer;
  2993. (* Handle uniprocessor timer interrupt. *)
  2994. PROCEDURE HandleUPTimer(VAR state: State);
  2995. BEGIN (* {interrupts off} *)
  2996. timer(0, state);
  2997. Sti; (* enable interrupts before acquiring locks below - to avoid deadlock with StopAll. *)
  2998. Timeslice(state)
  2999. END HandleUPTimer;
  3000. PROCEDURE DummyEvent(id: LONGINT; CONST state: State);
  3001. END DummyEvent;
  3002. (** Install a processor timer event handler. *)
  3003. PROCEDURE InstallEventHandler* (h: EventHandler);
  3004. BEGIN
  3005. IF h # NIL THEN timer := h ELSE timer := DummyEvent END
  3006. END InstallEventHandler;
  3007. (* Initialize APIC for current processor. *)
  3008. PROCEDURE InitAPIC;
  3009. BEGIN
  3010. (* enable APIC, set focus checking & set spurious interrupt handler *)
  3011. ASSERT(MPSPU MOD 16 = 15); (* low 4 bits set, p. 7-29 *)
  3012. ApicPut(0F0H, {8} + SYSTEM.VAL (SET, MPSPU));
  3013. (* set error interrupt handler *)
  3014. ApicPut(370H, SYSTEM.VAL (SET, MPERR));
  3015. InitMPTimer
  3016. END InitAPIC;
  3017. (* Start processor activity. *)
  3018. PROCEDURE StartMP;
  3019. VAR id: LONGINT; state: State;
  3020. BEGIN (* running at kernel level with interrupts on *)
  3021. InitAPIC;
  3022. id := ID(); (* timeslicing is disabled, as we are running at kernel level *)
  3023. Acquire (TraceOutput);
  3024. Trace.String (" P"); Trace.Int(id, 1); Trace.StringLn (" running");
  3025. Release (TraceOutput);
  3026. IF TraceProcessor & traceProcessor & (id = numProcessors-1) THEN
  3027. DEC(numProcessors) (* exclude from rest of activity *)
  3028. ELSE
  3029. INCL(allProcessors, id)
  3030. END;
  3031. (* synchronize with boot processor - end of mutual exclusion *)
  3032. started[id] := TRUE;
  3033. IF TraceProcessor & ~(id IN allProcessors) THEN
  3034. Acquire (TraceOutput);
  3035. Trace.String (" P"); Trace.Int(id, 1); Trace.StringLn (" tracing");
  3036. Release (TraceOutput);
  3037. LOOP
  3038. IF traceProcessorProc # NIL THEN traceProcessorProc(id, state) END;
  3039. SpinHint
  3040. END
  3041. END;
  3042. (* wait until woken up *)
  3043. WHILE stopped DO SpinHint END;
  3044. (* now fully functional, including storage allocation *)
  3045. AtomicExcl(ipcBusy, id); (* ack *)
  3046. Acquire (TraceOutput);
  3047. Trace.String (" P"); Trace.Int(id, 1); Trace.StringLn(" scheduling");
  3048. Release (TraceOutput);
  3049. ASSERT(id = ID()); (* still running on same processor *)
  3050. start;
  3051. END StartMP;
  3052. (* Subsequent processors start executing here. *)
  3053. PROCEDURE EnterMP;
  3054. (* no local variables allowed, because stack is switched. *)
  3055. BEGIN (* running at kernel level with interrupts off *)
  3056. InitProcessor;
  3057. InitMemory; (* switch stack *)
  3058. Start;
  3059. StartMP
  3060. END EnterMP;
  3061. (* Start another processor. *)
  3062. PROCEDURE StartProcessor(phys: ADDRESS; apicid: LONGINT; startup: BOOLEAN);
  3063. VAR j, k: LONGINT; s: SET; timer: LONGINT;
  3064. BEGIN
  3065. (* clear APIC errors *)
  3066. ApicPut(280H, {}); s := ApicGet(280H);
  3067. (* assert INIT *)
  3068. ApicPut(310H, SYSTEM.VAL (SET, ASH(apicid, 24))); (* set destination *)
  3069. ApicPut(300H, {8, 10, 14, 15}); (* set Dest, INIT, Phys, Assert, Level *)
  3070. timer := ticks + 5; (* > 200us *)
  3071. REPEAT UNTIL timer - ticks <= 0;
  3072. (* deassert INIT *)
  3073. ApicPut(310H, SYSTEM.VAL (SET, ASH(apicid, 24))); (* set destination *)
  3074. ApicPut(300H, {8, 10, 15}); (* set Dest, INIT, Deassert, Phys, Level *)
  3075. IF startup THEN (* send STARTUP if required *)
  3076. j := 0; k := 2;
  3077. WHILE j # k DO
  3078. ApicPut(280H, {});
  3079. ApicPut(310H, SYSTEM.VAL (SET, ASH(apicid, 24))); (* set destination *)
  3080. (* set Dest, Startup, Deassert, Phys, Edge *)
  3081. ApicPut(300H, {9, 10} + SYSTEM.VAL (SET, phys DIV 4096 MOD 256));
  3082. timer := ticks + 10; (* ~10ms *)
  3083. REPEAT UNTIL timer - ticks <= 0;
  3084. IF ~(12 IN ApicGet(300H)) THEN (* idle *)
  3085. IF ApicGet(280H) * {0..3, 5..7} = {} THEN k := j (* ESR success, exit *)
  3086. ELSE INC(j) (* retry *)
  3087. END
  3088. ELSE INC(j) (* retry *)
  3089. END
  3090. END
  3091. END
  3092. END StartProcessor;
  3093. (* Boot other processors, one at a time. *)
  3094. PROCEDURE BootMP;
  3095. VAR phys, page0Adr: ADDRESS; i: LONGINT; timer: LONGINT;
  3096. BEGIN
  3097. stopped := TRUE; ipcBusy := {}; (* other processors can be woken with StartAll *)
  3098. InitBootPage(EnterMP, phys);
  3099. MapPhysical(0, 4096, page0Adr); (* map in BIOS data area *)
  3100. Acquire(TraceOutput); Trace.String("Machine: Booting processors... "); Trace.Ln; Release(TraceOutput);
  3101. FOR i := 1 TO numProcessors-1 DO
  3102. (* set up booting for old processor types that reset on INIT & don't understand STARTUP *)
  3103. SYSTEM.PUT (page0Adr + 467H, ASH(phys, 16-4));
  3104. PutNVByte(15, 0AX); (* shutdown status byte *)
  3105. (* attempt to start another processor *)
  3106. Acquire(TraceOutput); Trace.String(" P0 starting P"); Trace.Int(i, 1); Trace.Ln; Release(TraceOutput);
  3107. StartProcessor(phys, revIDmap[i], apicVer[i] >= 10H); (* try booting processor i *)
  3108. (* wait for CPU to become active *)
  3109. timer := ticks + 5000; (* ~5s timeout *)
  3110. REPEAT SpinHint UNTIL started[i] OR (timer - ticks <= 0);
  3111. (* end of mutual exclusion *)
  3112. Acquire(TraceOutput);
  3113. IF started[i] THEN
  3114. Trace.String(" P0 recognized P"); Trace.Int(i, 1);
  3115. ELSE
  3116. Trace.String(" P0 timeout on P"); Trace.Int(i, 1);
  3117. END;
  3118. Trace.Ln;
  3119. Release(TraceOutput);
  3120. END;
  3121. SYSTEM.PUT (page0Adr + 467H, SYSTEM.VAL (LONGINT, 0));
  3122. UnmapPhysical(page0Adr, 4096);
  3123. PutNVByte(15, 0X) (* restore shutdown status *)
  3124. END BootMP;
  3125. (* Timer interrupt handler. *)
  3126. PROCEDURE TimerInterruptHandler(VAR state: State);
  3127. BEGIN
  3128. INC(ticks);
  3129. DEC(eventCount);
  3130. IF eventCount = 0 THEN
  3131. eventCount := eventMax; event(state)
  3132. END
  3133. END TimerInterruptHandler;
  3134. PROCEDURE Dummy(VAR state: State);
  3135. END Dummy;
  3136. PROCEDURE InitTicks;
  3137. CONST Div = (2*TimerClock + Second) DIV (2*Second); (* timer clock divisor *)
  3138. BEGIN
  3139. eventCount := 0; eventMax := 0; event := Dummy;
  3140. (* initialize timer hardware *)
  3141. ASSERT(Div <= 65535);
  3142. Portout8(43H, 34X); Wait; (* mode 2, rate generator *)
  3143. Portout8(40H, CHR(Div MOD 100H)); Wait;
  3144. Portout8(40H, CHR(ASH(Div, -8)));
  3145. InstallHandler(TimerInterruptHandler, IRQ0)
  3146. END InitTicks;
  3147. (* Set timer upcall. The handler procedure will be called at a rate of Second/divisor Hz. *)
  3148. PROCEDURE InstallTickHandler(handler: Handler; divisor: LONGINT);
  3149. BEGIN
  3150. eventMax := divisor; event := handler;
  3151. eventCount := eventMax
  3152. END InstallTickHandler;
  3153. (* Initialize processors *)
  3154. PROCEDURE InitProcessors*;
  3155. BEGIN
  3156. traceProcessor := FALSE; traceProcessorProc := NIL;
  3157. ASSERT(Second = 1000); (* use of Machine.ticks *)
  3158. InitTicks;
  3159. timer := DummyEvent;
  3160. ParseMPConfig;
  3161. InstallHandler(HandleIPC, MPIPCLocal);
  3162. IF localAPIC # 0 THEN (* APIC present *)
  3163. InitAPICArea(localAPIC, 4096);
  3164. InitAPICIDAdr(localAPIC+20H, idMap);
  3165. ASSERT(MPSPU MOD 16 = 15); (* use default handler (see 7.4.11.1) *)
  3166. InstallHandler(HandleError, MPERR);
  3167. InstallHandler(HandleMPTimer, MPTMR);
  3168. InstallHandler(HandleIPC, MPIPC);
  3169. InitAPIC;
  3170. IF numProcessors > 1 THEN BootMP END
  3171. ELSE
  3172. IF timerRate > 0 THEN
  3173. InstallTickHandler(HandleUPTimer, Second DIV timerRate)
  3174. END
  3175. END;
  3176. InstallHandler(HandleKernelCall, MPKC);
  3177. END InitProcessors;
  3178. VAR scrollLines: LONGINT;
  3179. (* Send and print character *)
  3180. PROCEDURE TraceChar (c: CHAR);
  3181. VAR status: SHORTINT;
  3182. (* Scroll the screen by one line. *)
  3183. PROCEDURE Scroll;
  3184. VAR adr: ADDRESS; off: SIZE; i,j: LONGINT;
  3185. BEGIN
  3186. IF (traceDelay > 0) & (scrollLines MOD TraceHeight = 0) THEN
  3187. FOR i := 0 TO traceDelay-1 DO
  3188. FOR j := 0 TO 1000000 DO END;
  3189. END;
  3190. END;
  3191. INC(scrollLines);
  3192. adr := traceBase + TraceLen;
  3193. SYSTEM.MOVE (adr, adr - TraceLen, TraceSize - TraceLen);
  3194. adr := traceBase + TraceSize - TraceLen;
  3195. FOR off := 0 TO TraceLen - SIZEOF(INTEGER) BY SIZEOF(INTEGER) DO SYSTEM.PUT16 (adr + off, 100H * 7H + 32) END
  3196. END Scroll;
  3197. BEGIN
  3198. IF TraceV24 IN traceMode THEN
  3199. REPEAT (* wait until port is ready to accept a character *)
  3200. Portin8 (SHORT(tracePort + 5), SYSTEM.VAL(CHAR,status))
  3201. UNTIL ODD (status DIV 20H); (* THR empty *)
  3202. Portout8 (SHORT(tracePort), c);
  3203. END;
  3204. IF TraceScreen IN traceMode THEN
  3205. IF c = 9X THEN c := 20X END;
  3206. IF c = 0DX THEN (* CR *)
  3207. DEC (tracePos, tracePos MOD TraceLen)
  3208. ELSIF c = 0AX THEN (* LF *)
  3209. IF tracePos < TraceSize THEN
  3210. INC (tracePos, TraceLen) (* down to next line *)
  3211. ELSE
  3212. Scroll
  3213. END
  3214. ELSE
  3215. IF tracePos >= TraceSize THEN
  3216. Scroll;
  3217. DEC (tracePos, TraceLen)
  3218. END;
  3219. SYSTEM.PUT16 (traceBase + tracePos, 100H * traceColor + ORD (c));
  3220. INC (tracePos, SIZEOF(INTEGER))
  3221. END
  3222. END
  3223. END TraceChar;
  3224. (* Change color *)
  3225. PROCEDURE TraceColor (c: SHORTINT);
  3226. BEGIN traceColor := c;
  3227. END TraceColor;
  3228. VAR traceDelay: LONGINT;
  3229. (* Initialise tracing. *)
  3230. PROCEDURE InitTrace;
  3231. CONST MaxPorts = 8;
  3232. VAR i, p, bps: LONGINT; off: SIZE; s, name: ARRAY 32 OF CHAR;
  3233. baselist: ARRAY MaxPorts OF LONGINT;
  3234. BEGIN
  3235. GetConfig ("TraceMode", s);
  3236. p := 0; traceMode := SYSTEM.VAL (SET, StrToInt (p, s));
  3237. IF TraceScreen IN traceMode THEN
  3238. GetConfig ("TraceMem", s);
  3239. p := 0; traceBase := SYSTEM.VAL (ADDRESS, StrToInt (p, s));
  3240. IF traceBase = 0 THEN traceBase := 0B8000H END; (* default screen buffer *)
  3241. FOR off := 0 TO TraceSize - SIZEOF(INTEGER) BY SIZEOF(INTEGER) DO SYSTEM.PUT16 (traceBase + off, 100H * 7H + 32) END;
  3242. tracePos := 0;
  3243. Portout8(3D4H, 0EX);
  3244. Portout8(3D5H, CHR((TraceWidth*TraceHeight) DIV 100H));
  3245. Portout8(3D4H, 0FX);
  3246. Portout8(3D5H, CHR((TraceWidth*TraceHeight) MOD 100H));
  3247. GetConfig("TraceDelay", s);
  3248. p := 0; traceDelay := StrToInt(p, s);
  3249. END;
  3250. IF TraceV24 IN traceMode THEN
  3251. FOR i := 0 TO MaxPorts - 1 DO
  3252. COPY ("COMx", name); name[3] := CHR (ORD ("1") + i);
  3253. GetConfig (name, s); p := 0; baselist[i] := StrToInt (p, s);
  3254. END;
  3255. IF baselist[0] = 0 THEN baselist[0] := 3F8H END; (* COM1 port default values *)
  3256. IF baselist[1] = 0 THEN baselist[1] := 2F8H END; (* COM2 port default values *)
  3257. GetConfig("TracePort", s); p := 0; p := StrToInt(p, s); DEC(p);
  3258. IF (p >= 0) & (p < MaxPorts) THEN tracePort := baselist[p] ELSE tracePort := baselist[0] END;
  3259. ASSERT(tracePort > 0);
  3260. GetConfig("TraceBPS", s); p := 0; bps := StrToInt(p, s);
  3261. IF bps <= 0 THEN bps := 38400 END;
  3262. Portout8 (SHORT(tracePort + 3), 80X); (* Set the Divisor Latch Bit - DLAB = 1 *)
  3263. bps := 115200 DIV bps; (* compiler DIV/PORTOUT bug workaround *)
  3264. Portout8 (SHORT(tracePort + 1), CHR (bps DIV 100H)); (* Set the Divisor Latch MSB *)
  3265. Portout8 (SHORT(tracePort), CHR (bps MOD 100H)); (* Set the Divisor Latch LSB *)
  3266. Portout8 (SHORT(tracePort + 3), 3X); (* 8N1 *)
  3267. Portout8 (SHORT(tracePort + 4), 3X); (* Set DTR, RTS on in the MCR *)
  3268. Portout8 (SHORT(tracePort + 1), 0X); (* Disable receive interrupts *)
  3269. END;
  3270. traceColor := 7; Trace.Char := TraceChar; Trace.Color := TraceColor;
  3271. END InitTrace;
  3272. (* The following procedure is linked as the first block in the bootfile *)
  3273. PROCEDURE {NOPAF, FIXED(0100000H)} FirstAddress;
  3274. (* ; RELOCATION HAS BECOME VOID WITH NEW RELOCATING BOOTLOADER
  3275. ; ; relocate the bootfile from 0x1000 to target address 0x100000
  3276. ; PUSHAD
  3277. ; MOV ESI,1000H
  3278. ; MOV EDI,100000H
  3279. ; MOV ECX, LastAddress
  3280. ; SUB ECX, EDI
  3281. ; CLD
  3282. ; REP MOVSB
  3283. ; POPAD
  3284. ;
  3285. ; ; continue in relocated bootfile
  3286. ; JMP DWORD 100000H - 1000H + Skip
  3287. ;Skip:
  3288. *)
  3289. CODE{SYSTEM.i386}
  3290. ; save arguments passed by bootloader
  3291. MOV bootFlag, EAX
  3292. MOV initRegs0,ESI
  3293. MOV initRegs1, ECX
  3294. MOV fbadr, EDI
  3295. MOV fbInfoPtr, EDX
  3296. END FirstAddress;
  3297. (* empty section allocated at end of bootfile *)
  3298. PROCEDURE {NOPAF, ALIGNED(32)} LastAddress;
  3299. CODE {SYSTEM.i386}
  3300. END LastAddress;
  3301. (* Init code called from OBL. EAX = boot table offset. ESI, EDI=initRegs. 2k stack is available. No trap handling. *)
  3302. (* must be called from module caller chain *)
  3303. PROCEDURE Init*;
  3304. VAR i: LONGINT;
  3305. BEGIN
  3306. initRegs[0] := initRegs0;
  3307. initRegs[1] := initRegs1;
  3308. (* registers 6 and 7 get converted to 32 bit, cf. PCB.Assigne
  3309. SYSTEM.GETREG(6, initRegs[0]); SYSTEM.GETREG(7, initRegs[1]); (* initRegs0 & initRegs1 *)
  3310. *)
  3311. SYSTEM.PUT16(0472H, 01234H); (* soft boot flag, for when we reboot *)
  3312. ReadBootTable(bootFlag);
  3313. InitTrace;
  3314. Trace.String("Machine: "); Trace.Blue;Trace.StringLn (Version); Trace.Default;
  3315. CheckMemory;
  3316. SearchMP;
  3317. AllocateDMA; (* must be called after SearchMP, as lowTop is modified *)
  3318. version := Version;
  3319. InitBoot;
  3320. InitProcessor;
  3321. InitLocks;
  3322. NmaxUserStacks := MaxUserStacks;
  3323. ASSERT(ASH(1, PSlog2) = PS);
  3324. Trace.String("Machine: Enabling MMU... ");
  3325. InitSegments; (* enable flat segments *)
  3326. InitPages; (* create page tables *)
  3327. InitMemory; (* switch on segmentation, paging and switch stack *)
  3328. Trace.Green; Trace.StringLn("Ok"); Trace.Default;
  3329. (*FOR i := 0 TO 1024*128 DO SYSTEM.PUT(fbadr+i, 0X) END;*)
  3330. (* allocate empty memory block with enough space for at least one free block *)
  3331. memBlockHead := SYSTEM.VAL (MemoryBlock, ADDRESSOF (initialMemBlock));
  3332. memBlockTail := memBlockHead;
  3333. initialMemBlock.beginBlockAdr := SYSTEM.VAL (ADDRESS, LastAddress);
  3334. initialMemBlock.endBlockAdr := initialMemBlock.beginBlockAdr + StaticBlockSize;
  3335. initialMemBlock.size := initialMemBlock.endBlockAdr - initialMemBlock.beginBlockAdr;
  3336. FOR i := 0 TO IDTSize - 1 DO
  3337. FOR j := 0 TO MaxNumHandlers - 1 DO
  3338. intHandler[i, j].valid := FALSE;
  3339. intHandler[i, j].handler := NIL
  3340. END
  3341. END;
  3342. Trace.String("Machine done."); Trace.Ln;
  3343. default.valid := FALSE; (* initialized later *)
  3344. END Init;
  3345. BEGIN
  3346. END Machine.
  3347. (*
  3348. 03.03.1998 pjm First version
  3349. 30.06.1999 pjm ProcessorID moved to AosProcessor
  3350. *)
  3351. (**
  3352. Notes
  3353. This module defines an interface to the boot environment of the system. The facilities provided here are only intended for the lowest levels of the system, and should never be directly imported by user modules (exceptions are noted below). They are highly specific to the system hardware and firmware architecture.
  3354. Typically a machine has some type of firmware that performs initial testing and setup of the system. The firmware initiates the operating system bootstrap loader, which loads the boot file. This module is the first module in the statically linked boot file that gets control.
  3355. There are two more-or-less general procedures in this module: GetConfig and StrToInt. GetConfig is used to query low-level system settings, e.g., the location of the boot file system. StrToInt is a utility procedure that parses numeric strings.
  3356. Config strings:
  3357. ExtMemSize Specifies size of extended memory (above 1MB) in MB. This value is not checked for validity. Setting it false may cause the system to fail, possible after running for some time. The memory size is usually detected automatically, but if the detection does not work for some reason, or if you want to limit the amount of memory detected, this string can be set. For example, if the machine has 64MB of memory, this value can be set as ExtMemSize="63".
  3358. *)