| 1 | /*␊ |
| 2 | * Copyright 2008 mackerintel␊ |
| 3 | */␊ |
| 4 | ␊ |
| 5 | #include "libsaio.h"␊ |
| 6 | #include "boot.h"␊ |
| 7 | #include "bootstruct.h"␊ |
| 8 | #include "acpi.h"␊ |
| 9 | #include "efi_tables.h"␊ |
| 10 | #include "fake_efi.h"␊ |
| 11 | #include "acpi_patcher.h"␊ |
| 12 | #include "platform.h"␊ |
| 13 | #include "cpu.h"␊ |
| 14 | #include "aml_generator.h"␊ |
| 15 | ␊ |
| 16 | #ifndef DEBUG_ACPI␊ |
| 17 | #define DEBUG_ACPI 0␊ |
| 18 | #endif␊ |
| 19 | ␊ |
| 20 | #if DEBUG_ACPI==2␊ |
| 21 | #define DBG(x...) {printf(x); sleep(1);}␊ |
| 22 | #elif DEBUG_ACPI==1␊ |
| 23 | #define DBG(x...) printf(x)␊ |
| 24 | #else␊ |
| 25 | #define DBG(x...)␊ |
| 26 | #endif␊ |
| 27 | ␊ |
| 28 | // Slice: New signature compare function␊ |
| 29 | boolean_t tableSign(char *table, const char *sgn)␊ |
| 30 | {␊ |
| 31 | ␉int i;␊ |
| 32 | ␉for (i=0; i<4; i++) {␊ |
| 33 | ␉␉if ((table[i] &~0x20) != (sgn[i] &~0x20)) {␊ |
| 34 | ␉␉␉return FALSE;␊ |
| 35 | ␉␉}␊ |
| 36 | ␉}␊ |
| 37 | ␉return TRUE;␊ |
| 38 | }␊ |
| 39 | ␊ |
| 40 | /* Gets the ACPI 1.0 RSDP address */␊ |
| 41 | static struct acpi_2_rsdp* getAddressOfAcpiTable()␊ |
| 42 | {␊ |
| 43 | /* TODO: Before searching the BIOS space we are supposed to search the first 1K of the EBDA */␊ |
| 44 | ␉␊ |
| 45 | void *acpi_addr = (void*)ACPI_RANGE_START;␊ |
| 46 | for(; acpi_addr <= (void*)ACPI_RANGE_END; acpi_addr += 16)␊ |
| 47 | {␊ |
| 48 | if(*(uint64_t *)acpi_addr == ACPI_SIGNATURE_UINT64_LE)␊ |
| 49 | {␊ |
| 50 | uint8_t csum = checksum8(acpi_addr, 20);␊ |
| 51 | if(csum == 0)␊ |
| 52 | {␊ |
| 53 | // Only return the table if it is a true version 1.0 table (Revision 0)␊ |
| 54 | if(((struct acpi_2_rsdp*)acpi_addr)->Revision == 0)␊ |
| 55 | return acpi_addr;␊ |
| 56 | }␊ |
| 57 | }␊ |
| 58 | }␊ |
| 59 | return NULL;␊ |
| 60 | }␊ |
| 61 | ␊ |
| 62 | /* Gets the ACPI 2.0 RSDP address */␊ |
| 63 | static struct acpi_2_rsdp* getAddressOfAcpi20Table()␊ |
| 64 | {␊ |
| 65 | /* TODO: Before searching the BIOS space we are supposed to search the first 1K of the EBDA */␊ |
| 66 | ␉␊ |
| 67 | void *acpi_addr = (void*)ACPI_RANGE_START;␊ |
| 68 | for(; acpi_addr <= (void*)ACPI_RANGE_END; acpi_addr += 16)␊ |
| 69 | {␊ |
| 70 | if(*(uint64_t *)acpi_addr == ACPI_SIGNATURE_UINT64_LE)␊ |
| 71 | {␊ |
| 72 | uint8_t csum = checksum8(acpi_addr, 20);␊ |
| 73 | ␉␉␉␊ |
| 74 | /* Only assume this is a 2.0 or better table if the revision is greater than 0␊ |
| 75 | * NOTE: ACPI 3.0 spec only seems to say that 1.0 tables have revision 1␊ |
| 76 | * and that the current revision is 2.. I am going to assume that rev > 0 is 2.0.␊ |
| 77 | */␊ |
| 78 | ␉␉␉␊ |
| 79 | if(csum == 0 && (((struct acpi_2_rsdp*)acpi_addr)->Revision > 0))␊ |
| 80 | {␊ |
| 81 | uint8_t csum2 = checksum8(acpi_addr, sizeof(struct acpi_2_rsdp));␊ |
| 82 | if(csum2 == 0)␊ |
| 83 | return acpi_addr;␊ |
| 84 | }␊ |
| 85 | }␊ |
| 86 | }␊ |
| 87 | return NULL;␊ |
| 88 | }␊ |
| 89 | /** The folowing ACPI Table search algo. should be reused anywhere needed:*/␊ |
| 90 | int search_and_get_acpi_fd(const char * filename, const char ** outDirspec)␊ |
| 91 | {␊ |
| 92 | ␉int fd=0;␊ |
| 93 | ␉const char * overriden_pathname=NULL;␊ |
| 94 | ␉static char dirspec[512]="";␊ |
| 95 | ␉static bool first_time =true; ␊ |
| 96 | ␉int len=0;␊ |
| 97 | ␉␊ |
| 98 | ␉/// Take in accound user overriding if it's DSDT only␊ |
| 99 | ␉if (strstr(filename, "DSDT") && ␊ |
| 100 | ␉␉getValueForKey(kDSDT, &overriden_pathname, &len, ␊ |
| 101 | ␉␉␉␉␉ &bootInfo->bootConfig))␊ |
| 102 | {␊ |
| 103 | ␉␉sprintf(dirspec, "%s", overriden_pathname);␊ |
| 104 | ␉␉fd=open (dirspec,0);␊ |
| 105 | ␉␉if (fd>=0) goto success_fd;␊ |
| 106 | }␊ |
| 107 | ␉// Check that dirspec is not already assigned with a path␊ |
| 108 | ␉if (!first_time && *dirspec) ␊ |
| 109 | ␉{ // it is so start searching this cached patch first␊ |
| 110 | ␉␉//extract path␊ |
| 111 | ␉␉for (len=strlen(dirspec)-1; len; len--)␊ |
| 112 | ␉␉␉if (dirspec[len]=='/' || len==0)␊ |
| 113 | ␉␉␉{␊ |
| 114 | ␉␉␉␉dirspec[len]='\0';␊ |
| 115 | ␉␉␉␉break;␊ |
| 116 | ␉␉␉}␊ |
| 117 | ␉␉// now concat with the filename␊ |
| 118 | ␉␉strncat(dirspec, "/", sizeof(dirspec));␊ |
| 119 | ␉␉strncat(dirspec, filename, sizeof(dirspec));␊ |
| 120 | ␉␉// and test to see if we don't have our big boy here:␊ |
| 121 | ␉␉fd=open (dirspec,0);␊ |
| 122 | ␉␉if (fd>=0) ␊ |
| 123 | ␉␉{␊ |
| 124 | ␉␉␉// printf("ACPI file search cache hit: file found at %s\n", dirspec);␊ |
| 125 | ␉␉␉goto success_fd;␊ |
| 126 | ␉␉}␊ |
| 127 | ␉}␊ |
| 128 | ␉// Start searching any potential location for ACPI Table␊ |
| 129 | ␉// search the Extra folders first␊ |
| 130 | ␉sprintf(dirspec,"/Extra/%s",filename); ␊ |
| 131 | ␉fd=open (dirspec,0);␊ |
| 132 | ␉if (fd>=0) goto success_fd;␊ |
| 133 | ␉␊ |
| 134 | ␉sprintf(dirspec,"bt(0,0)/Extra/%s",filename);␊ |
| 135 | ␉fd=open (dirspec,0);␊ |
| 136 | ␉if (fd>=0) goto success_fd;␊ |
| 137 | ␉␊ |
| 138 | ␉sprintf(dirspec, "%s", filename); // search current dir␊ |
| 139 | ␉fd=open (dirspec,0);␊ |
| 140 | ␉if (fd>=0) goto success_fd;␊ |
| 141 | ␉␊ |
| 142 | ␉sprintf(dirspec, "/%s", filename); // search root␊ |
| 143 | ␉fd=open (dirspec,0);␊ |
| 144 | ␉if (fd>=0) goto success_fd;␊ |
| 145 | ␉␊ |
| 146 | ␉// NOT FOUND:␊ |
| 147 | ␉//verbose("ACPI Table not found: %s\n", filename);␊ |
| 148 | ␉if (outDirspec) *outDirspec = "";␊ |
| 149 | ␉first_time = false;␊ |
| 150 | ␉return -1;␊ |
| 151 | ␉// FOUND␊ |
| 152 | success_fd:␊ |
| 153 | ␉first_time = false;␊ |
| 154 | ␉if (outDirspec) *outDirspec = dirspec; ␊ |
| 155 | ␉return fd;␊ |
| 156 | }␊ |
| 157 | ␊ |
| 158 | void *loadACPITable (const char * filename)␊ |
| 159 | {␊ |
| 160 | ␉void *tableAddr;␊ |
| 161 | ␉const char * dirspec=NULL;␊ |
| 162 | ␉␊ |
| 163 | ␉int fd = search_and_get_acpi_fd(filename, &dirspec);␊ |
| 164 | ␉␊ |
| 165 | ␉if (fd>=0)␊ |
| 166 | ␉{␊ |
| 167 | ␉␉tableAddr=(void*)AllocateKernelMemory(file_size (fd));␊ |
| 168 | ␉␉if (tableAddr)␊ |
| 169 | ␉␉{␊ |
| 170 | ␉␉␉if (read (fd, tableAddr, file_size (fd))!=file_size (fd))␊ |
| 171 | ␉␉␉{␊ |
| 172 | ␉␉␉␉printf("Couldn't read table %s\n",dirspec);␊ |
| 173 | ␉␉␉␉free (tableAddr);␊ |
| 174 | ␉␉␉␉close (fd);␊ |
| 175 | ␉␉␉␉return NULL;␊ |
| 176 | ␉␉␉}␊ |
| 177 | ␉␉␉␊ |
| 178 | ␉␉␉DBG("Table %s read and stored at: %x\n", dirspec, tableAddr);␊ |
| 179 | ␉␉␉close (fd);␊ |
| 180 | ␉␉␉return tableAddr;␊ |
| 181 | ␉␉}␊ |
| 182 | ␉␉close (fd);␊ |
| 183 | ␉␉printf("Couldn't allocate memory for table \n", dirspec);␊ |
| 184 | ␉} ␊ |
| 185 | ␉//printf("Couldn't find table %s\n", filename);␊ |
| 186 | ␉return NULL;␊ |
| 187 | }␊ |
| 188 | ␊ |
| 189 | uint8_t␉acpi_cpu_count = 0;␊ |
| 190 | char* acpi_cpu_name[32];␊ |
| 191 | ␊ |
| 192 | void get_acpi_cpu_names(unsigned char* dsdt, int length)␊ |
| 193 | {␊ |
| 194 | ␉int i;␊ |
| 195 | ␉␊ |
| 196 | ␉for (i=0; i<length-7; i++) ␊ |
| 197 | ␉{␊ |
| 198 | ␉␉if (dsdt[i] == 0x5B && dsdt[i+1] == 0x83) // ProcessorOP␊ |
| 199 | ␉␉{␊ |
| 200 | ␉␉␉uint8_t offset = i+2+(dsdt[i+2] >> 6) + 1, j;␊ |
| 201 | ␉␉␉bool add_name = TRUE;␊ |
| 202 | ␊ |
| 203 | ␉␉␉for (j=0; j<4; j++) ␊ |
| 204 | ␉␉␉{␊ |
| 205 | ␉␉␉␉char c = dsdt[offset+j];␊ |
| 206 | ␉␉␉␉␊ |
| 207 | ␉␉␉␉if (!aml_isvalidchar(c)) ␊ |
| 208 | ␉␉␉␉{␊ |
| 209 | ␉␉␉␉␉add_name = FALSE;␊ |
| 210 | ␉␉␉␉␉verbose("Invalid characters found in ProcessorOP!\n");␊ |
| 211 | ␉␉␉␉␉break;␊ |
| 212 | ␉␉␉␉}␊ |
| 213 | ␉␉␉}␊ |
| 214 | ␉␉␉␊ |
| 215 | ␉␉␉if (add_name && dsdt[offset+4] < 32 ) ␊ |
| 216 | ␉␉␉{␊ |
| 217 | ␉␉␉␉acpi_cpu_name[acpi_cpu_count] = malloc(4);␊ |
| 218 | ␉␉␉␉memcpy(acpi_cpu_name[acpi_cpu_count], dsdt+offset, 4);␊ |
| 219 | ␉␉␉␉i = offset + 5;␊ |
| 220 | ␉␉␉␉␊ |
| 221 | ␉␉␉␉verbose("Found %c%c%c%c (from DSDT)\n", acpi_cpu_name[acpi_cpu_count][0], acpi_cpu_name[acpi_cpu_count][1], acpi_cpu_name[acpi_cpu_count][2], acpi_cpu_name[acpi_cpu_count][3]);␊ |
| 222 | ␉␉␉␉␊ |
| 223 | ␉␉␉␉if (++acpi_cpu_count == 32) return;␊ |
| 224 | ␉␉␉}␊ |
| 225 | ␉␉}␊ |
| 226 | ␉}␊ |
| 227 | }␊ |
| 228 | ␊ |
| 229 | struct acpi_2_ssdt *generate_cst_ssdt(struct acpi_2_fadt* fadt)␊ |
| 230 | {␊ |
| 231 | ␉char ssdt_header[] =␊ |
| 232 | ␉{␊ |
| 233 | ␉␉0x53, 0x53, 0x44, 0x54, 0xE7, 0x00, 0x00, 0x00, /* SSDT.... */␊ |
| 234 | ␉␉0x01, 0x17, 0x50, 0x6D, 0x52, 0x65, 0x66, 0x41, /* ..PmRefA */␊ |
| 235 | ␉␉0x43, 0x70, 0x75, 0x43, 0x73, 0x74, 0x00, 0x00, /* CpuCst.. */␊ |
| 236 | ␉␉0x00, 0x10, 0x00, 0x00, 0x49, 0x4E, 0x54, 0x4C, /* ....INTL */␊ |
| 237 | ␉␉0x31, 0x03, 0x10, 0x20 ␉␉␉␉␉␉␉/* 1.._␉␉*/␊ |
| 238 | ␉};␊ |
| 239 | ␉␊ |
| 240 | ␉char cstate_resource_template[] = ␊ |
| 241 | ␉{␊ |
| 242 | ␉␉0x11, 0x14, 0x0A, 0x11, 0x82, 0x0C, 0x00, 0x7F, ␊ |
| 243 | ␉␉0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, ␊ |
| 244 | ␉␉0x00, 0x00, 0x00, 0x79, 0x00␊ |
| 245 | ␉};␊ |
| 246 | ␊ |
| 247 | ␉if (Platform.CPU.Vendor != 0x756E6547) {␊ |
| 248 | ␉␉verbose ("Not an Intel platform: C-States will not be generated !!!\n");␊ |
| 249 | ␉␉return NULL;␊ |
| 250 | ␉}␊ |
| 251 | ␉␊ |
| 252 | ␉if (fadt == NULL) {␊ |
| 253 | ␉␉verbose ("FACP not exists: C-States not generated !!!\n");␊ |
| 254 | ␉␉return NULL;␊ |
| 255 | ␉}␊ |
| 256 | ␉␊ |
| 257 | ␉struct acpi_2_dsdt* dsdt = (void*)fadt->DSDT;␊ |
| 258 | ␉␊ |
| 259 | ␉if (dsdt == NULL) {␊ |
| 260 | ␉␉verbose ("DSDT not found: C-States not generated !!!\n");␊ |
| 261 | ␉␉return NULL;␊ |
| 262 | ␉}␊ |
| 263 | ␉␊ |
| 264 | ␉if (acpi_cpu_count == 0) ␊ |
| 265 | ␉␉get_acpi_cpu_names((void*)dsdt, dsdt->Length);␊ |
| 266 | ␉␊ |
| 267 | ␉if (acpi_cpu_count > 0) ␊ |
| 268 | ␉{␊ |
| 269 | ␉␉bool c2_enabled = fadt->C2_Latency < 100;␊ |
| 270 | ␉␉bool c3_enabled = fadt->C3_Latency < 1000;␊ |
| 271 | ␊ |
| 272 | ␉␉unsigned char cstates_count = 1 + (c2_enabled ? 1 : 0) + (c3_enabled ? 1 : 0);␊ |
| 273 | ␉␉␊ |
| 274 | ␉␉struct aml_chunk* root = aml_create_node(NULL);␊ |
| 275 | ␉␉␉aml_add_buffer(root, ssdt_header, sizeof(ssdt_header)); // SSDT header␊ |
| 276 | ␉␉␉struct aml_chunk* scop = aml_add_scope(root, "\\_PR_");␊ |
| 277 | ␉␉␉␉struct aml_chunk* name = aml_add_name(scop, "CST_");␊ |
| 278 | ␉␉␉␉␉struct aml_chunk* pack = aml_add_package(name);␊ |
| 279 | ␉␉␉␉␉␉aml_add_byte(pack, cstates_count);␊ |
| 280 | ␉␉␊ |
| 281 | ␉␉␉␉␉␉struct aml_chunk* tmpl = aml_add_package(pack);␊ |
| 282 | ␉␉␉␉␉␉␉cstate_resource_template[11] = 0x10; // C1␊ |
| 283 | ␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊ |
| 284 | ␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x01); // C1␊ |
| 285 | ␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x01); // Latency␊ |
| 286 | ␉␉␉␉␉␉␉aml_add_word(tmpl, 0x03e8); // Power␊ |
| 287 | ␊ |
| 288 | ␉␉␉␉␉␉// C2␊ |
| 289 | ␉␉␉␉␉␉if (c2_enabled) ␊ |
| 290 | ␉␉␉␉␉␉{␊ |
| 291 | ␉␉␉␉␉␉␉tmpl = aml_add_package(pack);␊ |
| 292 | ␉␉␉␉␉␉␉␉cstate_resource_template[11] = 0x20; // C2␊ |
| 293 | ␉␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊ |
| 294 | ␉␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x02); // C2␊ |
| 295 | ␉␉␉␉␉␉␉␉aml_add_byte(tmpl, fadt->C2_Latency);␊ |
| 296 | ␉␉␉␉␉␉␉␉aml_add_word(tmpl, 0x01f4); // Power␊ |
| 297 | ␉␉␉␉␉␉}␊ |
| 298 | ␉␉␉␉␉␉// C3␊ |
| 299 | ␉␉␉␉␉␉if (c3_enabled) ␊ |
| 300 | ␉␉␉␉␉␉{␊ |
| 301 | ␉␉␉␉␉␉␉tmpl = aml_add_package(pack);␊ |
| 302 | ␉␉␉␉␉␉␉cstate_resource_template[11] = 0x30; // C3␊ |
| 303 | ␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊ |
| 304 | ␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x03); // C3␊ |
| 305 | ␉␉␉␉␉␉␉aml_add_word(tmpl, fadt->C3_Latency);␊ |
| 306 | ␉␉␉␉␉␉␉aml_add_word(tmpl, 0x015e); // Power␊ |
| 307 | ␉␉␉␉␉␉}␊ |
| 308 | ␉␉␉␊ |
| 309 | ␉␉␉// Aliaces␊ |
| 310 | ␉␉␉int i;␊ |
| 311 | ␉␉␉for (i = 0; i < acpi_cpu_count; i++) ␊ |
| 312 | ␉␉␉{␊ |
| 313 | ␉␉␉␉char name[9];␊ |
| 314 | ␉␉␉␉sprintf(name, "_PR_%c%c%c%c", acpi_cpu_name[i][0], acpi_cpu_name[i][1], acpi_cpu_name[i][2], acpi_cpu_name[i][3]);␊ |
| 315 | ␉␉␉␉␊ |
| 316 | ␉␉␉␉scop = aml_add_scope(root, name);␊ |
| 317 | ␉␉␉␉␉aml_add_alias(scop, "CST_", "_CST");␊ |
| 318 | ␉␉␉}␊ |
| 319 | ␉␉␊ |
| 320 | ␉␉␊ |
| 321 | ␉␉aml_calculate_size(root);␊ |
| 322 | ␉␉␊ |
| 323 | ␉␉struct acpi_2_ssdt *ssdt = (struct acpi_2_ssdt *)AllocateKernelMemory(root->Size);␊ |
| 324 | ␉␊ |
| 325 | ␉␉aml_write_node(root, (void*)ssdt, 0);␊ |
| 326 | ␉␉aml_destroy_node(root);␊ |
| 327 | ␉␉␊ |
| 328 | ␉␉ssdt->Length = root->Size;␊ |
| 329 | ␉␉ssdt->Checksum = 0;␊ |
| 330 | ␉␉ssdt->Checksum = 256 - checksum8(ssdt, ssdt->Length);␊ |
| 331 | ␉␉␊ |
| 332 | ␉␉//dumpPhysAddr("C-States SSDT content: ", ssdt, ssdt->Length);␊ |
| 333 | ␉␉␉␉␊ |
| 334 | ␉␉verbose ("SSDT with CPU C-States generated successfully\n");␊ |
| 335 | ␉␉␊ |
| 336 | ␉␉return ssdt;␊ |
| 337 | ␉}␊ |
| 338 | ␉else ␊ |
| 339 | ␉{␊ |
| 340 | ␉␉verbose ("DSDT CPUs not found: C-States not generated !!!\n");␊ |
| 341 | ␉}␊ |
| 342 | ␊ |
| 343 | ␉return NULL;␊ |
| 344 | }␊ |
| 345 | ␊ |
| 346 | struct acpi_2_ssdt *generate_pss_ssdt(struct acpi_2_dsdt* dsdt)␊ |
| 347 | {␉␊ |
| 348 | ␉char ssdt_header[] =␊ |
| 349 | ␉{␊ |
| 350 | ␉␉0x53, 0x53, 0x44, 0x54, 0x7E, 0x00, 0x00, 0x00, /* SSDT.... */␊ |
| 351 | ␉␉0x01, 0x6A, 0x50, 0x6D, 0x52, 0x65, 0x66, 0x00, /* ..PmRef. */␊ |
| 352 | ␉␉0x43, 0x70, 0x75, 0x50, 0x6D, 0x00, 0x00, 0x00, /* CpuPm... */␊ |
| 353 | ␉␉0x00, 0x30, 0x00, 0x00, 0x49, 0x4E, 0x54, 0x4C, /* .0..INTL */␊ |
| 354 | ␉␉0x31, 0x03, 0x10, 0x20,␉␉␉␉␉␉␉/* 1.._␉␉*/␊ |
| 355 | ␉};␊ |
| 356 | ␉␊ |
| 357 | ␉if (Platform.CPU.Vendor != 0x756E6547) {␊ |
| 358 | ␉␉verbose ("Not an Intel platform: P-States will not be generated !!!\n");␊ |
| 359 | ␉␉return NULL;␊ |
| 360 | ␉}␊ |
| 361 | ␉␊ |
| 362 | ␉if (!(Platform.CPU.Features & CPU_FEATURE_MSR)) {␊ |
| 363 | ␉␉verbose ("Unsupported CPU: P-States will not be generated !!!\n");␊ |
| 364 | ␉␉return NULL;␊ |
| 365 | ␉}␊ |
| 366 | ␉␊ |
| 367 | ␉if (acpi_cpu_count == 0) ␊ |
| 368 | ␉␉get_acpi_cpu_names((void*)dsdt, dsdt->Length);␊ |
| 369 | ␉␊ |
| 370 | ␉if (acpi_cpu_count > 0) ␊ |
| 371 | ␉{␉␊ |
| 372 | ␉␉bool cpu_dynamic_fsb = false, cpu_noninteger_bus_ratio = (rdmsr64(MSR_IA32_PERF_STATUS) & (1ULL << 46));␊ |
| 373 | ␉␉struct p_state initial, maximum, minimum, p_states[32];␊ |
| 374 | ␉␉uint8_t p_states_count;␉␉␊ |
| 375 | ␉␉␊ |
| 376 | ␉␉// Retrieving P-States, ported from code by superhai (c)␊ |
| 377 | ␉␉switch (Platform.CPU.Family) {␊ |
| 378 | ␉␉␉case 0x06: ␊ |
| 379 | ␉␉␉{␊ |
| 380 | ␉␉␉␉switch (Platform.CPU.Model) ␊ |
| 381 | ␉␉␉␉{␊ |
| 382 | ␉␉␉␉␉case 0x0F: // Intel Core (65nm)␊ |
| 383 | ␉␉␉␉␉case 0x17: // Intel Core (45nm)␊ |
| 384 | ␉␉␉␉␉case 0x1C: // Intel Atom (45nm)␊ |
| 385 | ␉␉␉␉␉case 0x1A: // Intel Core i7 LGA1366 (45nm)␊ |
| 386 | ␉␉␉␉␉case 0x1E: // Intel Core i5, i7 LGA1156 (45nm)␊ |
| 387 | ␉␉␉␉␉case 0x1F:␊ |
| 388 | ␉␉␉␉␉case 0x25: // Intel Core i3, i5, i7 LGA1156 (32nm)␊ |
| 389 | ␉␉␉␉␉case 0x2C: // Intel Core i7 LGA1366 (32nm) 6 Core␊ |
| 390 | ␉␉␉␉␉case 0x2F:␊ |
| 391 | ␉␉␉␉␉␉if (rdmsr64(MSR_IA32_EXT_CONFIG) & (1 << 27)) ␊ |
| 392 | ␉␉␉␉␉␉{␊ |
| 393 | ␉␉␉␉␉␉␉wrmsr64(MSR_IA32_EXT_CONFIG, (rdmsr64(MSR_IA32_EXT_CONFIG) | (1 << 28))); ␊ |
| 394 | ␉␉␉␉␉␉␉delay(1);␊ |
| 395 | ␉␉␉␉␉␉␉cpu_dynamic_fsb = rdmsr64(MSR_IA32_EXT_CONFIG) & (1 << 28);␊ |
| 396 | ␉␉␉␉␉␉}␊ |
| 397 | ␉␉␉␉␉␉break;␊ |
| 398 | ␉␉␉␉}␊ |
| 399 | ␉␉␉}␊ |
| 400 | ␉␉}␊ |
| 401 | ␉␉␊ |
| 402 | ␉␉initial.Control = rdmsr64(MSR_IA32_PERF_STATUS);␊ |
| 403 | ␉␉␊ |
| 404 | ␉␉maximum.Control = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 32) & 0x1F3F) | (0x4000 * cpu_noninteger_bus_ratio);␊ |
| 405 | ␉␉maximum.CID = ((maximum.FID & 0x1F) << 1) | cpu_noninteger_bus_ratio;␊ |
| 406 | ␉␉␊ |
| 407 | ␉␉minimum.FID = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 24) & 0x1F) | (0x80 * cpu_dynamic_fsb);␊ |
| 408 | ␉␉minimum.VID = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 48) & 0x3F);␊ |
| 409 | ␉␉␊ |
| 410 | ␉␉if (minimum.FID == 0) ␊ |
| 411 | ␉␉{␊ |
| 412 | ␉␉␉uint8_t i;␊ |
| 413 | ␉␉␉// Probe for lowest fid␊ |
| 414 | ␉␉␉for (i = maximum.FID; i >= 0x6; i--) ␊ |
| 415 | ␉␉␉{␊ |
| 416 | ␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (rdmsr64(MSR_IA32_PERF_CONTROL) & 0xFFFFFFFFFFFF0000ULL) | (i << 8) | minimum.VID);␊ |
| 417 | ␉␉␉␉intel_waitforsts();␊ |
| 418 | ␉␉␉␉minimum.FID = (rdmsr64(MSR_IA32_PERF_STATUS) >> 8) & 0x1F; ␊ |
| 419 | ␉␉␉␉delay(1);␊ |
| 420 | ␉␉␉}␊ |
| 421 | ␉␉␉␊ |
| 422 | ␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (rdmsr64(MSR_IA32_PERF_CONTROL) & 0xFFFFFFFFFFFF0000ULL) | (maximum.FID << 8) | maximum.VID);␊ |
| 423 | ␉␉␉intel_waitforsts();␊ |
| 424 | ␉␉}␊ |
| 425 | ␉␉␊ |
| 426 | ␉␉if (minimum.VID == maximum.VID) ␊ |
| 427 | ␉␉{␉␊ |
| 428 | ␉␉␉uint8_t i;␊ |
| 429 | ␉␉␉// Probe for lowest vid␊ |
| 430 | ␉␉␉for (i = maximum.VID; i > 0xA; i--) ␊ |
| 431 | ␉␉␉{␊ |
| 432 | ␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (rdmsr64(MSR_IA32_PERF_CONTROL) & 0xFFFFFFFFFFFF0000ULL) | (minimum.FID << 8) | i);␊ |
| 433 | ␉␉␉␉intel_waitforsts();␊ |
| 434 | ␉␉␉␉minimum.VID = rdmsr64(MSR_IA32_PERF_STATUS) & 0x3F; ␊ |
| 435 | ␉␉␉␉delay(1);␊ |
| 436 | ␉␉␉}␊ |
| 437 | ␉␉␉␊ |
| 438 | ␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (rdmsr64(MSR_IA32_PERF_CONTROL) & 0xFFFFFFFFFFFF0000ULL) | (maximum.FID << 8) | maximum.VID);␊ |
| 439 | ␉␉␉intel_waitforsts();␊ |
| 440 | ␉␉}␊ |
| 441 | ␉␉␊ |
| 442 | ␉␉minimum.CID = ((minimum.FID & 0x1F) << 1) >> cpu_dynamic_fsb;␊ |
| 443 | ␉␉␊ |
| 444 | ␉␉// Sanity check␊ |
| 445 | ␉␉if (maximum.CID < minimum.CID) ␊ |
| 446 | ␉␉{␊ |
| 447 | ␉␉␉DBG("Insane FID values!");␊ |
| 448 | ␉␉␉p_states_count = 1;␊ |
| 449 | ␉␉}␊ |
| 450 | ␉␉else␊ |
| 451 | ␉␉{␊ |
| 452 | ␉␉␉// Finalize P-States␊ |
| 453 | ␉␉␉// Find how many P-States machine supports␊ |
| 454 | ␉␉␉p_states_count = maximum.CID - minimum.CID + 1;␊ |
| 455 | ␉␉␉␊ |
| 456 | ␉␉␉if (p_states_count > 32) ␊ |
| 457 | ␉␉␉␉p_states_count = 32;␊ |
| 458 | ␉␉␉␊ |
| 459 | ␉␉␉uint8_t vidstep;␊ |
| 460 | ␉␉␉uint8_t i = 0, u, invalid = 0;␊ |
| 461 | ␉␉␉␊ |
| 462 | ␉␉␉vidstep = ((maximum.VID << 2) - (minimum.VID << 2)) / (p_states_count - 1);␊ |
| 463 | ␉␉␉␊ |
| 464 | ␉␉␉for (u = 0; u < p_states_count; u++) ␊ |
| 465 | ␉␉␉{␊ |
| 466 | ␉␉␉␉i = u - invalid;␊ |
| 467 | ␉␉␉␉␊ |
| 468 | ␉␉␉␉p_states[i].CID = maximum.CID - u;␊ |
| 469 | ␉␉␉␉p_states[i].FID = (p_states[i].CID >> 1);␊ |
| 470 | ␉␉␉␉␊ |
| 471 | ␉␉␉␉if (p_states[i].FID < 0x6) ␊ |
| 472 | ␉␉␉␉{␊ |
| 473 | ␉␉␉␉␉if (cpu_dynamic_fsb) ␊ |
| 474 | ␉␉␉␉␉␉p_states[i].FID = (p_states[i].FID << 1) | 0x80;␊ |
| 475 | ␉␉␉␉} ␊ |
| 476 | ␉␉␉␉else if (cpu_noninteger_bus_ratio) ␊ |
| 477 | ␉␉␉␉{␊ |
| 478 | ␉␉␉␉␉p_states[i].FID = p_states[i].FID | (0x40 * (p_states[i].CID & 0x1));␊ |
| 479 | ␉␉␉␉}␊ |
| 480 | ␉␉␉␉␊ |
| 481 | ␉␉␉␉if (i && p_states[i].FID == p_states[i-1].FID)␊ |
| 482 | ␉␉␉␉␉invalid++;␊ |
| 483 | ␉␉␉␉␊ |
| 484 | ␉␉␉␉p_states[i].VID = ((maximum.VID << 2) - (vidstep * u)) >> 2;␊ |
| 485 | ␉␉␉␉␊ |
| 486 | ␉␉␉␉uint32_t multiplier = p_states[i].FID & 0x1f;␉␉// = 0x08␊ |
| 487 | ␉␉␉␉bool half = p_states[i].FID & 0x40;␉␉␉␉␉// = 0x01␊ |
| 488 | ␉␉␉␉bool dfsb = p_states[i].FID & 0x80;␉␉␉␉␉// = 0x00␊ |
| 489 | ␉␉␉␉uint32_t fsb = Platform.CPU.FSBFrequency / 1000000; // = 400␊ |
| 490 | ␉␉␉␉uint32_t halffsb = (fsb + 1) >> 1;␉␉␉␉␉// = 200␊ |
| 491 | ␉␉␉␉uint32_t frequency = (multiplier * fsb);␉␉␉// = 3200␊ |
| 492 | ␉␉␉␉␊ |
| 493 | ␉␉␉␉p_states[i].Frequency = (frequency + (half * halffsb)) >> dfsb;␉// = 3200 + 200 = 3400␊ |
| 494 | ␉␉␉}␊ |
| 495 | ␉␉␉␊ |
| 496 | ␉␉␉p_states_count -= invalid;␊ |
| 497 | ␉␉}␊ |
| 498 | ␉␉␊ |
| 499 | ␉␉// Generating SSDT␊ |
| 500 | ␉␉␊ |
| 501 | ␉␉if (p_states_count > 0) ␊ |
| 502 | ␉␉{␉␊ |
| 503 | ␉␉␉int i;␊ |
| 504 | ␉␉␉␊ |
| 505 | ␉␉␉struct aml_chunk* root = aml_create_node(NULL);␊ |
| 506 | ␉␉␉␉aml_add_buffer(root, ssdt_header, sizeof(ssdt_header)); // SSDT header␊ |
| 507 | ␉␉␉␉␉struct aml_chunk* scop = aml_add_scope(root, "\\_PR_");␊ |
| 508 | ␉␉␉␉␉␉struct aml_chunk* name = aml_add_name(scop, "PSS_");␊ |
| 509 | ␉␉␉␉␉␉␉struct aml_chunk* pack = aml_add_package(name);␊ |
| 510 | ␉␉␉␊ |
| 511 | ␉␉␉␉␉␉␉␉for (i = 0; i < p_states_count; i++) ␊ |
| 512 | ␉␉␉␉␉␉␉␉{␊ |
| 513 | ␉␉␉␉␉␉␉␉␉struct aml_chunk* pstt = aml_add_package(pack);␊ |
| 514 | ␉␉␉␉␉␉␉␉␉␊ |
| 515 | ␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, p_states[i].Frequency);␊ |
| 516 | ␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x00000000); // Power␊ |
| 517 | ␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x0000000A); // Latency␊ |
| 518 | ␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x0000000A); // Latency␊ |
| 519 | ␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, p_states[i].Control);␊ |
| 520 | ␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, i+1); // Status␊ |
| 521 | ␉␉␉␉␉␉␉␉}␊ |
| 522 | ␉␉␉␉␊ |
| 523 | ␉␉␉// Add aliaces␊ |
| 524 | ␉␉␉for (i = 0; i < acpi_cpu_count; i++) ␊ |
| 525 | ␉␉␉{␊ |
| 526 | ␉␉␉␉char name[9];␊ |
| 527 | ␉␉␉␉sprintf(name, "_PR_%c%c%c%c", acpi_cpu_name[i][0], acpi_cpu_name[i][1], acpi_cpu_name[i][2], acpi_cpu_name[i][3]);␊ |
| 528 | ␉␉␉␉␊ |
| 529 | ␉␉␉␉scop = aml_add_scope(root, name);␊ |
| 530 | ␉␉␉␉aml_add_alias(scop, "PSS_", "_PSS");␊ |
| 531 | ␉␉␉}␊ |
| 532 | ␉␉␉␊ |
| 533 | ␉␉␉aml_calculate_size(root);␊ |
| 534 | ␉␉␉␊ |
| 535 | ␉␉␉struct acpi_2_ssdt *ssdt = (struct acpi_2_ssdt *)AllocateKernelMemory(root->Size);␊ |
| 536 | ␉␉␉␊ |
| 537 | ␉␉␉aml_write_node(root, (void*)ssdt, 0);␊ |
| 538 | ␉␉␉aml_destroy_node(root);␊ |
| 539 | ␉␉␉␊ |
| 540 | ␉␉␉ssdt->Length = root->Size;␊ |
| 541 | ␉␉␉ssdt->Checksum = 0;␊ |
| 542 | ␉␉␉ssdt->Checksum = 256 - checksum8(ssdt, ssdt->Length);␊ |
| 543 | ␉␉␉␊ |
| 544 | ␉␉␉//dumpPhysAddr("P-States SSDT content: ", ssdt, ssdt->Length);␊ |
| 545 | ␉␉␉␊ |
| 546 | ␉␉␉verbose ("SSDT with CPU P-States generated successfully\n");␊ |
| 547 | ␉␉␉␊ |
| 548 | ␉␉␉return ssdt;␊ |
| 549 | ␉␉}␊ |
| 550 | ␉}␊ |
| 551 | ␉else {␊ |
| 552 | ␉␉verbose ("DSDT CPUs not found: P-States not generated !!!\n");␊ |
| 553 | ␉}␊ |
| 554 | ␉␊ |
| 555 | ␉return NULL;␊ |
| 556 | }␊ |
| 557 | ␊ |
| 558 | struct acpi_2_fadt *patch_fadt(struct acpi_2_fadt *fadt, struct acpi_2_dsdt *new_dsdt)␊ |
| 559 | {␊ |
| 560 | ␉extern void setupSystemType(); ␊ |
| 561 | ␉␊ |
| 562 | ␉struct acpi_2_fadt *fadt_mod;␊ |
| 563 | ␉bool fadt_rev2_needed = false;␊ |
| 564 | ␉bool fix_restart;␊ |
| 565 | ␉const char * value;␊ |
| 566 | ␉␊ |
| 567 | ␉// Restart Fix␊ |
| 568 | ␉if (Platform.CPU.Vendor == 0x756E6547) {␉/* Intel */␊ |
| 569 | ␉␉fix_restart = true;␊ |
| 570 | ␉␉getBoolForKey(kRestartFix, &fix_restart, &bootInfo->bootConfig);␊ |
| 571 | ␉} else {␊ |
| 572 | ␉␉verbose ("Not an Intel platform: Restart Fix not applied !!!\n");␊ |
| 573 | ␉␉fix_restart = false;␊ |
| 574 | ␉}␊ |
| 575 | ␉␊ |
| 576 | ␉if (fix_restart) fadt_rev2_needed = true;␊ |
| 577 | ␉␊ |
| 578 | ␉// Allocate new fadt table␊ |
| 579 | ␉if (fadt->Length < 0x84 && fadt_rev2_needed)␊ |
| 580 | ␉{␊ |
| 581 | ␉␉fadt_mod=(struct acpi_2_fadt *)AllocateKernelMemory(0x84);␊ |
| 582 | ␉␉memcpy(fadt_mod, fadt, fadt->Length);␊ |
| 583 | ␉␉fadt_mod->Length = 0x84;␊ |
| 584 | ␉␉fadt_mod->Revision = 0x02; // FADT rev 2 (ACPI 1.0B MS extensions)␊ |
| 585 | ␉}␊ |
| 586 | ␉else␊ |
| 587 | ␉{␊ |
| 588 | ␉␉fadt_mod=(struct acpi_2_fadt *)AllocateKernelMemory(fadt->Length);␊ |
| 589 | ␉␉memcpy(fadt_mod, fadt, fadt->Length);␊ |
| 590 | ␉}␊ |
| 591 | ␉// Determine system type / PM_Model␊ |
| 592 | ␉if ( (value=getStringForKey(kSystemType, &bootInfo->bootConfig))!=NULL)␊ |
| 593 | ␉{␊ |
| 594 | ␉␉if (Platform.Type > 6) ␊ |
| 595 | ␉␉{␊ |
| 596 | ␉␉␉if(fadt_mod->PM_Profile<=6)␊ |
| 597 | ␉␉␉␉Platform.Type = fadt_mod->PM_Profile; // get the fadt if correct␊ |
| 598 | ␉␉␉else ␊ |
| 599 | ␉␉␉␉Platform.Type = 1;␉␉/* Set a fixed value (Desktop) */␊ |
| 600 | ␉␉␉verbose("Error: system-type must be 0..6. Defaulting to %d !\n", Platform.Type);␊ |
| 601 | ␉␉}␊ |
| 602 | ␉␉else␊ |
| 603 | ␉␉␉Platform.Type = (unsigned char) strtoul(value, NULL, 10);␊ |
| 604 | ␉}␊ |
| 605 | ␉// Set PM_Profile from System-type if only if user wanted this value to be forced␊ |
| 606 | ␉if (fadt_mod->PM_Profile != Platform.Type) ␊ |
| 607 | ␉{␊ |
| 608 | ␉ if (value) ␊ |
| 609 | ␉␉{ // user has overriden the SystemType so take care of it in FACP␊ |
| 610 | ␉␉␉verbose("FADT: changing PM_Profile from 0x%02x to 0x%02x\n", fadt_mod->PM_Profile, Platform.Type);␊ |
| 611 | ␉␉␉fadt_mod->PM_Profile = Platform.Type;␊ |
| 612 | ␉ }␊ |
| 613 | ␉ else␊ |
| 614 | ␉ { // PM_Profile has a different value and no override has been set, so reflect the user value to ioregs␊ |
| 615 | ␉␉␉Platform.Type = fadt_mod->PM_Profile <= 6 ? fadt_mod->PM_Profile : 1;␊ |
| 616 | ␉ } ␊ |
| 617 | ␉}␊ |
| 618 | ␉// We now have to write the systemm-type in ioregs: we cannot do it before in setupDeviceTree()␊ |
| 619 | ␉// because we need to take care of facp original content, if it is correct.␊ |
| 620 | ␉setupSystemType();␊ |
| 621 | ␉␊ |
| 622 | ␉// Patch FADT to fix restart␊ |
| 623 | ␉if (fix_restart)␊ |
| 624 | ␉{␊ |
| 625 | ␉␉fadt_mod->Flags|= 0x400;␊ |
| 626 | ␉␉fadt_mod->Reset_SpaceID␉␉= 0x01; // System I/O␊ |
| 627 | ␉␉fadt_mod->Reset_BitWidth␉= 0x08; // 1 byte␊ |
| 628 | ␉␉fadt_mod->Reset_BitOffset␉= 0x00; // Offset 0␊ |
| 629 | ␉␉fadt_mod->Reset_AccessWidth␉= 0x01; // Byte access␊ |
| 630 | ␉␉fadt_mod->Reset_Address␉␉= 0x0cf9; // Address of the register␊ |
| 631 | ␉␉fadt_mod->Reset_Value␉␉= 0x06; // Value to write to reset the system␊ |
| 632 | ␉␉verbose("FADT: Restart Fix applied!\n");␊ |
| 633 | ␉}␊ |
| 634 | ␉␊ |
| 635 | ␉// Patch DSDT Address if we have loaded DSDT.aml␊ |
| 636 | ␉if(new_dsdt)␊ |
| 637 | ␉{␊ |
| 638 | ␉␉DBG("DSDT: Old @%x,%x, ",fadt_mod->DSDT,fadt_mod->X_DSDT);␊ |
| 639 | ␉␉␊ |
| 640 | ␉␉fadt_mod->DSDT=(uint32_t)new_dsdt;␊ |
| 641 | ␉␉if ((uint32_t)(&(fadt_mod->X_DSDT))-(uint32_t)fadt_mod+8<=fadt_mod->Length)␊ |
| 642 | ␉␉␉fadt_mod->X_DSDT=(uint32_t)new_dsdt;␊ |
| 643 | ␉␉␊ |
| 644 | ␉␉DBG("New @%x,%x\n",fadt_mod->DSDT,fadt_mod->X_DSDT);␊ |
| 645 | ␉␉␊ |
| 646 | ␉␉verbose("FADT: Using custom DSDT!\n");␊ |
| 647 | ␉}␊ |
| 648 | ␉␊ |
| 649 | ␉// Correct the checksum␊ |
| 650 | ␉fadt_mod->Checksum=0;␊ |
| 651 | ␉fadt_mod->Checksum=256-checksum8(fadt_mod,fadt_mod->Length);␊ |
| 652 | ␉␊ |
| 653 | ␉return fadt_mod;␊ |
| 654 | }␊ |
| 655 | ␊ |
| 656 | /* Setup ACPI without replacing DSDT. */␊ |
| 657 | int setupAcpiNoMod()␊ |
| 658 | {␊ |
| 659 | ␉//␉addConfigurationTable(&gEfiAcpiTableGuid, getAddressOfAcpiTable(), "ACPI");␊ |
| 660 | ␉//␉addConfigurationTable(&gEfiAcpi20TableGuid, getAddressOfAcpi20Table(), "ACPI_20");␊ |
| 661 | ␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊ |
| 662 | ␉acpi10_p = (uint32_t)getAddressOfAcpiTable();␊ |
| 663 | ␉acpi20_p = (uint32_t)getAddressOfAcpi20Table();␊ |
| 664 | ␉addConfigurationTable(&gEfiAcpiTableGuid, &acpi10_p, "ACPI");␊ |
| 665 | ␉if(acpi20_p) addConfigurationTable(&gEfiAcpi20TableGuid, &acpi20_p, "ACPI_20");␊ |
| 666 | ␉return 1;␊ |
| 667 | }␊ |
| 668 | ␊ |
| 669 | /* Setup ACPI. Replace DSDT if DSDT.aml is found */␊ |
| 670 | int setupAcpi(void)␊ |
| 671 | {␊ |
| 672 | ␉int version;␊ |
| 673 | ␉void *new_dsdt;␊ |
| 674 | ␉␊ |
| 675 | ␉// Load replacement DSDT␊ |
| 676 | ␉new_dsdt=loadACPITable("DSDT.aml");␊ |
| 677 | ␉// Mozodojo: going to patch FACP and load SSDT's even if DSDT.aml is not present␊ |
| 678 | ␉/*if (!new_dsdt)␊ |
| 679 | ␉ {␊ |
| 680 | ␉ return setupAcpiNoMod();␊ |
| 681 | ␉ }*/␊ |
| 682 | ␉␊ |
| 683 | ␉// Mozodojo: Load additional SSDTs␊ |
| 684 | ␉struct acpi_2_ssdt *new_ssdt[32]; // 30 + 2 additional tables for pss & cst␊ |
| 685 | ␉int ssdt_count=0;␊ |
| 686 | ␉␊ |
| 687 | ␉// TEST!␊ |
| 688 | ␉/*if(new_ssdt[ssdt_count] = generate_test_ssdt())␊ |
| 689 | ␉␉ssdt_count++;*/␊ |
| 690 | ␉␊ |
| 691 | ␉// SSDT Options␊ |
| 692 | ␉bool drop_ssdt=false, generate_pstates=false, generate_cstates=false; ␊ |
| 693 | ␉␊ |
| 694 | ␉getBoolForKey(kDropSSDT, &drop_ssdt, &bootInfo->bootConfig);␊ |
| 695 | ␉getBoolForKey(kGeneratePStates, &generate_pstates, &bootInfo->bootConfig);␊ |
| 696 | ␉getBoolForKey(kGenerateCStates, &generate_cstates, &bootInfo->bootConfig);␊ |
| 697 | ␉␊ |
| 698 | ␉{␊ |
| 699 | ␉␉int i;␊ |
| 700 | ␉␉␊ |
| 701 | ␉␉for (i=0; i<30; i++)␊ |
| 702 | ␉␉{␊ |
| 703 | ␉␉␉char filename[512];␊ |
| 704 | ␊ |
| 705 | ␉␉␉sprintf(filename, i>0?"SSDT-%d.aml":"SSDT.aml", i);␊ |
| 706 | ␉␉␉␊ |
| 707 | ␉␉␉if(new_ssdt[ssdt_count] = loadACPITable(filename)) ␊ |
| 708 | ␉␉␉{␉␉␉␉␊ |
| 709 | ␉␉␉␉ssdt_count++;␊ |
| 710 | ␉␉␉}␊ |
| 711 | ␉␉␉else ␊ |
| 712 | ␉␉␉{␊ |
| 713 | ␉␉␉␉break;␊ |
| 714 | ␉␉␉}␊ |
| 715 | ␉␉}␊ |
| 716 | ␉}␊ |
| 717 | ␉␉␊ |
| 718 | ␉// Do the same procedure for both versions of ACPI␊ |
| 719 | ␉for (version=0; version<2; version++) {␊ |
| 720 | ␉␉struct acpi_2_rsdp *rsdp, *rsdp_mod;␊ |
| 721 | ␉␉struct acpi_2_rsdt *rsdt, *rsdt_mod;␊ |
| 722 | ␉␉int rsdplength;␊ |
| 723 | ␉␉␊ |
| 724 | ␉␉// Find original rsdp␊ |
| 725 | ␉␉rsdp=(struct acpi_2_rsdp *)(version?getAddressOfAcpi20Table():getAddressOfAcpiTable());␊ |
| 726 | ␉␉if (!rsdp)␊ |
| 727 | ␉␉{␊ |
| 728 | ␉␉␉DBG("No ACPI version %d found. Ignoring\n", version+1);␊ |
| 729 | ␉␉␉if (version)␊ |
| 730 | ␉␉␉␉addConfigurationTable(&gEfiAcpi20TableGuid, NULL, "ACPI_20");␊ |
| 731 | ␉␉␉else␊ |
| 732 | ␉␉␉␉addConfigurationTable(&gEfiAcpiTableGuid, NULL, "ACPI");␊ |
| 733 | ␉␉␉continue;␊ |
| 734 | ␉␉}␊ |
| 735 | ␉␉rsdplength=version?rsdp->Length:20;␊ |
| 736 | ␉␉␊ |
| 737 | ␉␉DBG("RSDP version %d found @%x. Length=%d\n",version+1,rsdp,rsdplength);␊ |
| 738 | ␉␉␊ |
| 739 | ␉␉/* FIXME: no check that memory allocation succeeded ␊ |
| 740 | ␉␉ * Copy and patch RSDP,RSDT, XSDT and FADT␊ |
| 741 | ␉␉ * For more info see ACPI Specification pages 110 and following␊ |
| 742 | ␉␉ */␊ |
| 743 | ␉␉␊ |
| 744 | ␉␉rsdp_mod=(struct acpi_2_rsdp *) AllocateKernelMemory(rsdplength);␊ |
| 745 | ␉␉memcpy(rsdp_mod, rsdp, rsdplength); ␊ |
| 746 | ␉␉rsdt=(struct acpi_2_rsdt *)(rsdp->RsdtAddress);␊ |
| 747 | ␉␉␊ |
| 748 | ␉␉DBG("RSDT @%x, Length %d\n",rsdt, rsdt->Length);␊ |
| 749 | ␉␉␊ |
| 750 | ␉␉if (rsdt && (uint32_t)rsdt !=0xffffffff && rsdt->Length<0x10000)␊ |
| 751 | ␉␉{␊ |
| 752 | ␉␉␉uint32_t *rsdt_entries;␊ |
| 753 | ␉␉␉int rsdt_entries_num;␊ |
| 754 | ␉␉␉int dropoffset=0, i;␊ |
| 755 | ␉␉␉␊ |
| 756 | ␉␉␉// mozo: using malloc cos I didn't found how to free already allocated kernel memory␊ |
| 757 | ␉␉␉rsdt_mod=(struct acpi_2_rsdt *)malloc(rsdt->Length); ␊ |
| 758 | ␉␉␉memcpy (rsdt_mod, rsdt, rsdt->Length);␊ |
| 759 | ␉␉␉rsdp_mod->RsdtAddress=(uint32_t)rsdt_mod;␊ |
| 760 | ␉␉␉rsdt_entries_num=(rsdt_mod->Length-sizeof(struct acpi_2_rsdt))/4;␊ |
| 761 | ␉␉␉rsdt_entries=(uint32_t *)(rsdt_mod+1);␊ |
| 762 | ␉␉␉for (i=0;i<rsdt_entries_num;i++)␊ |
| 763 | ␉␉␉{␊ |
| 764 | ␉␉␉␉char *table=(char *)(rsdt_entries[i]);␊ |
| 765 | ␉␉␉␉if (!table)␊ |
| 766 | ␉␉␉␉␉continue;␊ |
| 767 | ␉␉␉␉␊ |
| 768 | ␉␉␉␉DBG("TABLE %c%c%c%c,",table[0],table[1],table[2],table[3]);␊ |
| 769 | ␉␉␉␉␊ |
| 770 | ␉␉␉␉rsdt_entries[i-dropoffset]=rsdt_entries[i];␊ |
| 771 | ␉␉␉␉␊ |
| 772 | ␉␉␉␉if (drop_ssdt && tableSign(table, "SSDT"))␊ |
| 773 | ␉␉␉␉{␊ |
| 774 | ␉␉␉␉␉dropoffset++;␊ |
| 775 | ␉␉␉␉␉continue;␊ |
| 776 | ␉␉␉␉}␊ |
| 777 | ␉␉␉␉if (tableSign(table, "DSDT"))␊ |
| 778 | ␉␉␉␉{␊ |
| 779 | ␉␉␉␉␉DBG("DSDT found\n");␊ |
| 780 | ␉␉␉␉␉␊ |
| 781 | ␉␉␉␉␉if(new_dsdt)␊ |
| 782 | ␉␉␉␉␉␉rsdt_entries[i-dropoffset]=(uint32_t)new_dsdt;␊ |
| 783 | ␉␉␉␉␉␉␉␉␉␉␊ |
| 784 | ␉␉␉␉␉continue;␊ |
| 785 | ␉␉␉␉}␊ |
| 786 | ␉␉␉␉if (tableSign(table, "FACP"))␊ |
| 787 | ␉␉␉␉{␊ |
| 788 | ␉␉␉␉␉struct acpi_2_fadt *fadt, *fadt_mod;␊ |
| 789 | ␉␉␉␉␉fadt=(struct acpi_2_fadt *)rsdt_entries[i];␊ |
| 790 | ␉␉␉␉␉␊ |
| 791 | ␉␉␉␉␉DBG("FADT found @%x, Length %d\n",fadt, fadt->Length);␊ |
| 792 | ␉␉␉␉␉␊ |
| 793 | ␉␉␉␉␉if (!fadt || (uint32_t)fadt == 0xffffffff || fadt->Length>0x10000)␊ |
| 794 | ␉␉␉␉␉{␊ |
| 795 | ␉␉␉␉␉␉printf("FADT incorrect. Not modified\n");␊ |
| 796 | ␉␉␉␉␉␉continue;␊ |
| 797 | ␉␉␉␉␉}␊ |
| 798 | ␉␉␉␉␉␊ |
| 799 | ␉␉␉␉␉fadt_mod = patch_fadt(fadt, new_dsdt);␊ |
| 800 | ␉␉␉␉␉rsdt_entries[i-dropoffset]=(uint32_t)fadt_mod;␊ |
| 801 | ␉␉␉␉␉␊ |
| 802 | ␉␉␉␉␉// Generate _CST SSDT␊ |
| 803 | ␉␉␉␉␉if (generate_cstates && (new_ssdt[ssdt_count] = generate_cst_ssdt(fadt_mod)))␊ |
| 804 | ␉␉␉␉␉{␊ |
| 805 | ␉␉␉␉␉␉generate_cstates = FALSE; // Generate SSDT only once!␊ |
| 806 | ␉␉␉␉␉␉ssdt_count++;␊ |
| 807 | ␉␉␉␉␉}␊ |
| 808 | ␉␉␉␉␉␊ |
| 809 | ␉␉␉␉␉// Generating _PSS SSDT␊ |
| 810 | ␉␉␉␉␉if (generate_pstates && (new_ssdt[ssdt_count] = generate_pss_ssdt((void*)fadt_mod->DSDT)))␊ |
| 811 | ␉␉␉␉␉{␊ |
| 812 | ␉␉␉␉␉␉generate_pstates = FALSE; // Generate SSDT only once!␊ |
| 813 | ␉␉␉␉␉␉ssdt_count++;␊ |
| 814 | ␉␉␉␉␉}␊ |
| 815 | ␉␉␉␉␉␊ |
| 816 | ␉␉␉␉␉continue;␊ |
| 817 | ␉␉␉␉}␊ |
| 818 | ␉␉␉}␊ |
| 819 | ␉␉␉DBG("\n");␊ |
| 820 | ␉␉␉␊ |
| 821 | ␉␉␉// Allocate rsdt in Kernel memory area␊ |
| 822 | ␉␉␉rsdt_mod->Length += 4*ssdt_count - 4*dropoffset;␊ |
| 823 | ␉␉␉struct acpi_2_rsdt *rsdt_copy = (struct acpi_2_rsdt *)AllocateKernelMemory(rsdt_mod->Length);␊ |
| 824 | ␉␉␉memcpy (rsdt_copy, rsdt_mod, rsdt_mod->Length);␊ |
| 825 | ␉␉␉free(rsdt_mod); rsdt_mod = rsdt_copy;␊ |
| 826 | ␉␉␉rsdp_mod->RsdtAddress=(uint32_t)rsdt_mod;␊ |
| 827 | ␉␉␉rsdt_entries_num=(rsdt_mod->Length-sizeof(struct acpi_2_rsdt))/4;␊ |
| 828 | ␉␉␉rsdt_entries=(uint32_t *)(rsdt_mod+1);␊ |
| 829 | ␉␉␉␊ |
| 830 | ␉␉␉// Mozodojo: Insert additional SSDTs into RSDT␊ |
| 831 | ␉␉␉if(ssdt_count>0)␊ |
| 832 | ␉␉␉{␊ |
| 833 | ␉␉␉␉int j;␊ |
| 834 | ␉␉␉␉␊ |
| 835 | ␉␉␉␉for (j=0; j<ssdt_count; j++)␊ |
| 836 | ␉␉␉␉␉rsdt_entries[i-dropoffset+j]=(uint32_t)new_ssdt[j];␊ |
| 837 | ␉␉␉␉␉␊ |
| 838 | ␉␉␉␉verbose("RSDT: Added %d SSDT table(s)\n", ssdt_count);␊ |
| 839 | ␉␉␉}␊ |
| 840 | ␊ |
| 841 | ␉␉␉// Correct the checksum of RSDT␊ |
| 842 | ␉␉␉DBG("RSDT: Original checksum %d, ", rsdt_mod->Checksum);␊ |
| 843 | ␉␉␉␊ |
| 844 | ␉␉␉rsdt_mod->Checksum=0;␊ |
| 845 | ␉␉␉rsdt_mod->Checksum=256-checksum8(rsdt_mod,rsdt_mod->Length);␊ |
| 846 | ␉␉␉␊ |
| 847 | ␉␉␉DBG("New checksum %d at %x\n", rsdt_mod->Checksum,rsdt_mod);␊ |
| 848 | ␉␉}␊ |
| 849 | ␉␉else␊ |
| 850 | ␉␉{␊ |
| 851 | ␉␉␉rsdp_mod->RsdtAddress=0;␊ |
| 852 | ␉␉␉printf("RSDT not found or RSDT incorrect\n");␊ |
| 853 | ␉␉}␊ |
| 854 | ␉␉␊ |
| 855 | ␉␉if (version)␊ |
| 856 | ␉␉{␊ |
| 857 | ␉␉␉struct acpi_2_xsdt *xsdt, *xsdt_mod;␊ |
| 858 | ␉␉␉␊ |
| 859 | ␉␉␉// FIXME: handle 64-bit address correctly␊ |
| 860 | ␉␉␉␊ |
| 861 | ␉␉␉xsdt=(struct acpi_2_xsdt*) ((uint32_t)rsdp->XsdtAddress);␊ |
| 862 | ␉␉␉DBG("XSDT @%x;%x, Length=%d\n", (uint32_t)(rsdp->XsdtAddress>>32),(uint32_t)rsdp->XsdtAddress,␊ |
| 863 | ␉␉␉␉xsdt->Length);␊ |
| 864 | ␉␉␉if (xsdt && (uint64_t)rsdp->XsdtAddress<0xffffffff && xsdt->Length<0x10000)␊ |
| 865 | ␉␉␉{␊ |
| 866 | ␉␉␉␉uint64_t *xsdt_entries;␊ |
| 867 | ␉␉␉␉int xsdt_entries_num, i;␊ |
| 868 | ␉␉␉␉int dropoffset=0;␊ |
| 869 | ␉␉␉␉␊ |
| 870 | ␉␉␉␉// mozo: using malloc cos I didn't found how to free already allocated kernel memory␊ |
| 871 | ␉␉␉␉xsdt_mod=(struct acpi_2_xsdt*)malloc(xsdt->Length); ␊ |
| 872 | ␉␉␉␉memcpy(xsdt_mod, xsdt, xsdt->Length);␊ |
| 873 | ␉␉␉␉rsdp_mod->XsdtAddress=(uint32_t)xsdt_mod;␊ |
| 874 | ␉␉␉␉xsdt_entries_num=(xsdt_mod->Length-sizeof(struct acpi_2_xsdt))/8;␊ |
| 875 | ␉␉␉␉xsdt_entries=(uint64_t *)(xsdt_mod+1);␊ |
| 876 | ␉␉␉␉for (i=0;i<xsdt_entries_num;i++)␊ |
| 877 | ␉␉␉␉{␊ |
| 878 | ␉␉␉␉␉char *table=(char *)((uint32_t)(xsdt_entries[i]));␊ |
| 879 | ␉␉␉␉␉if (!table)␊ |
| 880 | ␉␉␉␉␉␉continue;␊ |
| 881 | ␉␉␉␉␉␊ |
| 882 | ␉␉␉␉␉xsdt_entries[i-dropoffset]=xsdt_entries[i];␊ |
| 883 | ␉␉␉␉␉␊ |
| 884 | ␉␉␉␉␉if (drop_ssdt && tableSign(table, "SSDT"))␊ |
| 885 | ␉␉␉␉␉{␊ |
| 886 | ␉␉␉␉␉␉dropoffset++;␊ |
| 887 | ␉␉␉␉␉␉continue;␊ |
| 888 | ␉␉␉␉␉}␉␉␉␉␉␊ |
| 889 | ␉␉␉␉␉if (tableSign(table, "DSDT"))␊ |
| 890 | ␉␉␉␉␉{␊ |
| 891 | ␉␉␉␉␉␉DBG("DSDT found\n");␊ |
| 892 | ␉␉␉␉␉␉␊ |
| 893 | ␉␉␉␉␉␉if (new_dsdt) ␊ |
| 894 | ␉␉␉␉␉␉␉xsdt_entries[i-dropoffset]=(uint32_t)new_dsdt;␊ |
| 895 | ␉␉␉␉␉␉␊ |
| 896 | ␉␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊ |
| 897 | ␉␉␉␉␉␉␊ |
| 898 | ␉␉␉␉␉␉continue;␊ |
| 899 | ␉␉␉␉␉}␊ |
| 900 | ␉␉␉␉␉if (tableSign(table, "FACP"))␊ |
| 901 | ␉␉␉␉␉{␊ |
| 902 | ␉␉␉␉␉␉struct acpi_2_fadt *fadt, *fadt_mod;␊ |
| 903 | ␉␉␉␉␉␉fadt=(struct acpi_2_fadt *)(uint32_t)xsdt_entries[i];␊ |
| 904 | ␉␉␉␉␉␉␊ |
| 905 | ␉␉␉␉␉␉DBG("FADT found @%x,%x, Length %d\n",(uint32_t)(xsdt_entries[i]>>32),fadt, ␊ |
| 906 | ␉␉␉␉␉␉␉fadt->Length);␊ |
| 907 | ␉␉␉␉␉␉␊ |
| 908 | ␉␉␉␉␉␉if (!fadt || (uint64_t)xsdt_entries[i] >= 0xffffffff || fadt->Length>0x10000)␊ |
| 909 | ␉␉␉␉␉␉{␊ |
| 910 | ␉␉␉␉␉␉␉verbose("FADT incorrect or after 4GB. Dropping XSDT\n");␊ |
| 911 | ␉␉␉␉␉␉␉goto drop_xsdt;␊ |
| 912 | ␉␉␉␉␉␉}␊ |
| 913 | ␉␉␉␉␉␉␊ |
| 914 | ␉␉␉␉␉␉fadt_mod = patch_fadt(fadt, new_dsdt);␊ |
| 915 | ␉␉␉␉␉␉xsdt_entries[i-dropoffset]=(uint32_t)fadt_mod;␊ |
| 916 | ␉␉␉␉␉␉␊ |
| 917 | ␉␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊ |
| 918 | ␉␉␉␉␉␉␊ |
| 919 | ␉␉␉␉␉␉// Generate _CST SSDT␊ |
| 920 | ␉␉␉␉␉␉if (generate_cstates && (new_ssdt[ssdt_count] = generate_cst_ssdt(fadt_mod))) ␊ |
| 921 | ␉␉␉␉␉␉{␊ |
| 922 | ␉␉␉␉␉␉␉generate_cstates = FALSE; // Generate SSDT only once!␊ |
| 923 | ␉␉␉␉␉␉␉ssdt_count++;␊ |
| 924 | ␉␉␉␉␉␉}␊ |
| 925 | ␉␉␉␉␉␉␊ |
| 926 | ␉␉␉␉␉␉// Generating _PSS SSDT␊ |
| 927 | ␉␉␉␉␉␉if (generate_pstates && (new_ssdt[ssdt_count] = generate_pss_ssdt((void*)fadt_mod->DSDT)))␊ |
| 928 | ␉␉␉␉␉␉{␊ |
| 929 | ␉␉␉␉␉␉␉generate_pstates = FALSE; // Generate SSDT only once!␊ |
| 930 | ␉␉␉␉␉␉␉ssdt_count++;␊ |
| 931 | ␉␉␉␉␉␉}␊ |
| 932 | ␉␉␉␉␉␉␊ |
| 933 | ␉␉␉␉␉␉continue;␊ |
| 934 | ␉␉␉␉␉}␊ |
| 935 | ␉␉␉␉␉␊ |
| 936 | ␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊ |
| 937 | ␉␉␉␉␉␊ |
| 938 | ␉␉␉␉}␊ |
| 939 | ␉␉␉␉␊ |
| 940 | ␉␉␉␉// Allocate xsdt in Kernel memory area␊ |
| 941 | ␉␉␉␉xsdt_mod->Length += 8*ssdt_count - 8*dropoffset;␊ |
| 942 | ␉␉␉␉struct acpi_2_xsdt *xsdt_copy = (struct acpi_2_xsdt *)AllocateKernelMemory(xsdt_mod->Length);␊ |
| 943 | ␉␉␉␉memcpy(xsdt_copy, xsdt_mod, xsdt_mod->Length);␊ |
| 944 | ␉␉␉␉free(xsdt_mod); xsdt_mod = xsdt_copy;␊ |
| 945 | ␉␉␉␉rsdp_mod->XsdtAddress=(uint32_t)xsdt_mod;␊ |
| 946 | ␉␉␉␉xsdt_entries_num=(xsdt_mod->Length-sizeof(struct acpi_2_xsdt))/8;␊ |
| 947 | ␉␉␉␉xsdt_entries=(uint64_t *)(xsdt_mod+1);␊ |
| 948 | ␉␉␉␉␊ |
| 949 | ␉␉␉␉// Mozodojo: Insert additional SSDTs into XSDT␊ |
| 950 | ␉␉␉␉if(ssdt_count>0)␊ |
| 951 | ␉␉␉␉{␊ |
| 952 | ␉␉␉␉␉int j;␊ |
| 953 | ␉␉␉␉␉␊ |
| 954 | ␉␉␉␉␉for (j=0; j<ssdt_count; j++)␊ |
| 955 | ␉␉␉␉␉␉xsdt_entries[i-dropoffset+j]=(uint32_t)new_ssdt[j];␊ |
| 956 | ␉␉␉␉␉␉␊ |
| 957 | ␉␉␉␉␉verbose("Added %d SSDT table(s) into XSDT\n", ssdt_count);␊ |
| 958 | ␉␉␉␉}␊ |
| 959 | ␊ |
| 960 | ␉␉␉␉// Correct the checksum of XSDT␊ |
| 961 | ␉␉␉␉xsdt_mod->Checksum=0;␊ |
| 962 | ␉␉␉␉xsdt_mod->Checksum=256-checksum8(xsdt_mod,xsdt_mod->Length);␊ |
| 963 | ␉␉␉}␊ |
| 964 | ␉␉␉else␊ |
| 965 | ␉␉␉{␊ |
| 966 | ␉␉␉drop_xsdt:␊ |
| 967 | ␉␉␉␉␊ |
| 968 | ␉␉␉␉DBG("About to drop XSDT\n");␊ |
| 969 | ␉␉␉␉␊ |
| 970 | ␉␉␉␉/*FIXME: Now we just hope that if MacOS doesn't find XSDT it reverts to RSDT. ␊ |
| 971 | ␉␉␉␉ * A Better strategy would be to generate␊ |
| 972 | ␉␉␉␉ */␊ |
| 973 | ␉␉␉␉␊ |
| 974 | ␉␉␉␉rsdp_mod->XsdtAddress=0xffffffffffffffffLL;␊ |
| 975 | ␉␉␉␉verbose("XSDT not found or XSDT incorrect\n");␊ |
| 976 | ␉␉␉}␊ |
| 977 | ␉␉}␊ |
| 978 | ␉␉␊ |
| 979 | ␉␉// Correct the checksum of RSDP ␊ |
| 980 | ␉␉␊ |
| 981 | ␉␉DBG("RSDP: Original checksum %d, ", rsdp_mod->Checksum);␊ |
| 982 | ␉␉␊ |
| 983 | ␉␉rsdp_mod->Checksum=0;␊ |
| 984 | ␉␉rsdp_mod->Checksum=256-checksum8(rsdp_mod,20);␊ |
| 985 | ␉␉␊ |
| 986 | ␉␉DBG("New checksum %d\n", rsdp_mod->Checksum);␊ |
| 987 | ␉␉␊ |
| 988 | ␉␉if (version)␊ |
| 989 | ␉␉{␊ |
| 990 | ␉␉␉DBG("RSDP: Original extended checksum %d", rsdp_mod->ExtendedChecksum);␊ |
| 991 | ␉␉␉␊ |
| 992 | ␉␉␉rsdp_mod->ExtendedChecksum=0;␊ |
| 993 | ␉␉␉rsdp_mod->ExtendedChecksum=256-checksum8(rsdp_mod,rsdp_mod->Length);␊ |
| 994 | ␉␉␉␊ |
| 995 | ␉␉␉DBG("New extended checksum %d\n", rsdp_mod->ExtendedChecksum);␊ |
| 996 | ␉␉␉␊ |
| 997 | ␉␉}␊ |
| 998 | ␉␉␊ |
| 999 | ␉␉//verbose("Patched ACPI version %d DSDT\n", version+1);␊ |
| 1000 | ␉␉if (version)␊ |
| 1001 | ␉␉{␊ |
| 1002 | ␉␉␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊ |
| 1003 | ␉␉␉acpi20_p = (uint32_t)rsdp_mod;␊ |
| 1004 | ␉␉␉addConfigurationTable(&gEfiAcpi20TableGuid, &acpi20_p, "ACPI_20");␊ |
| 1005 | ␉␉}␊ |
| 1006 | ␉␉else␊ |
| 1007 | ␉␉{␊ |
| 1008 | ␉␉␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊ |
| 1009 | ␉␉␉acpi10_p = (uint32_t)rsdp_mod;␊ |
| 1010 | ␉␉␉addConfigurationTable(&gEfiAcpiTableGuid, &acpi10_p, "ACPI");␊ |
| 1011 | ␉␉}␊ |
| 1012 | ␉}␊ |
| 1013 | #if DEBUG_ACPI␊ |
| 1014 | ␉printf("Press a key to continue... (DEBUG_ACPI)\n");␊ |
| 1015 | ␉getc();␊ |
| 1016 | #endif␊ |
| 1017 | ␉return 1;␊ |
| 1018 | }␊ |
| 1019 | |
