BIOS.I386.Machine.Mod 117 KB

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