EFI.I386.Machine.Mod 116 KB

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