Chameleon

Chameleon Commit Details

Date:2010-09-21 04:00:14 (13 years 6 months ago)
Author:Evan Lojewski
Commit:534
Parents: 533
Message:ACPI Pather is now a module. untested.
Changes:
D/branches/meklort/i386/libsaio/aml_generator.c
D/branches/meklort/i386/libsaio/acpi_patcher.c
D/branches/meklort/i386/libsaio/aml_generator.h
D/branches/meklort/i386/libsaio/acpi_patcher.h
A/branches/meklort/i386/modules/ACPIPatcher/Makefile
A/branches/meklort/i386/modules/ACPIPatcher/aml_generator.c
A/branches/meklort/i386/modules/ACPIPatcher
A/branches/meklort/i386/modules/ACPIPatcher/acpi_patcher.c
A/branches/meklort/i386/modules/ACPIPatcher/ACPIPatcher.c
A/branches/meklort/i386/modules/ACPIPatcher/aml_generator.h
A/branches/meklort/i386/modules/ACPIPatcher/acpi_patcher.h
M/branches/meklort/i386/libsaio/smbios_patcher.c
M/branches/meklort/i386/libsaio/smbios_patcher.h
M/branches/meklort/i386/libsaio/pci_root.c
M/branches/meklort/i386/modules/Makefile
M/branches/meklort/i386/libsaio/pci_root.h
M/branches/meklort/i386/libsaio/fake_efi.c
M/branches/meklort/i386/libsaio/Makefile

File differences

branches/meklort/i386/libsaio/acpi_patcher.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
/*␊
* Copyright 2008 mackerintel␊
*/␊
␊
#include "libsaio.h"␊
#include "boot.h"␊
#include "bootstruct.h"␊
#include "acpi.h"␊
#include "efi_tables.h"␊
#include "fake_efi.h"␊
#include "acpi_patcher.h"␊
#include "platform.h"␊
#include "cpu.h"␊
#include "aml_generator.h"␊
␊
#ifndef DEBUG_ACPI␊
#define DEBUG_ACPI 0␊
#endif␊
␊
#if DEBUG_ACPI==2␊
#define DBG(x...) {printf(x); sleep(1);}␊
#elif DEBUG_ACPI==1␊
#define DBG(x...) printf(x)␊
#else␊
#define DBG(x...)␊
#endif␊
␊
// Slice: New signature compare function␊
boolean_t tableSign(char *table, const char *sgn)␊
{␊
␉int i;␊
␉for (i=0; i<4; i++) {␊
␉␉if ((table[i] &~0x20) != (sgn[i] &~0x20)) {␊
␉␉␉return false;␊
␉␉}␊
␉}␊
␉return true;␊
}␊
␊
/* Gets the ACPI 1.0 RSDP address */␊
static struct acpi_2_rsdp* getAddressOfAcpiTable()␊
{␊
/* TODO: Before searching the BIOS space we are supposed to search the first 1K of the EBDA */␊
␉␊
void *acpi_addr = (void*)ACPI_RANGE_START;␊
for(; acpi_addr <= (void*)ACPI_RANGE_END; acpi_addr += 16)␊
{␊
if(*(uint64_t *)acpi_addr == ACPI_SIGNATURE_UINT64_LE)␊
{␊
uint8_t csum = checksum8(acpi_addr, 20);␊
if(csum == 0)␊
{␊
// Only return the table if it is a true version 1.0 table (Revision 0)␊
if(((struct acpi_2_rsdp*)acpi_addr)->Revision == 0)␊
return acpi_addr;␊
}␊
}␊
}␊
return NULL;␊
}␊
␊
/* Gets the ACPI 2.0 RSDP address */␊
static struct acpi_2_rsdp* getAddressOfAcpi20Table()␊
{␊
/* TODO: Before searching the BIOS space we are supposed to search the first 1K of the EBDA */␊
␉␊
void *acpi_addr = (void*)ACPI_RANGE_START;␊
for(; acpi_addr <= (void*)ACPI_RANGE_END; acpi_addr += 16)␊
{␊
if(*(uint64_t *)acpi_addr == ACPI_SIGNATURE_UINT64_LE)␊
{␊
uint8_t csum = checksum8(acpi_addr, 20);␊
␉␉␉␊
/* Only assume this is a 2.0 or better table if the revision is greater than 0␊
* NOTE: ACPI 3.0 spec only seems to say that 1.0 tables have revision 1␊
* and that the current revision is 2.. I am going to assume that rev > 0 is 2.0.␊
*/␊
␉␉␉␊
if(csum == 0 && (((struct acpi_2_rsdp*)acpi_addr)->Revision > 0))␊
{␊
uint8_t csum2 = checksum8(acpi_addr, sizeof(struct acpi_2_rsdp));␊
if(csum2 == 0)␊
return acpi_addr;␊
}␊
}␊
}␊
return NULL;␊
}␊
/** The folowing ACPI Table search algo. should be reused anywhere needed:*/␊
int search_and_get_acpi_fd(const char * filename, const char ** outDirspec)␊
{␊
␉int fd = 0;␊
␉char dirSpec[512] = "";␊
␉␊
␉// Try finding 'filename' in the usual places␊
␉// Start searching any potential location for ACPI Table␊
␉sprintf(dirSpec, "%s", filename); ␊
␉fd = open(dirSpec, 0);␊
␉if (fd < 0)␊
␉{␉␊
␉␉sprintf(dirSpec, "/Extra/%s", filename); ␊
␉␉fd = open(dirSpec, 0);␊
␉␉if (fd < 0)␊
␉␉{␊
␉␉␉sprintf(dirSpec, "bt(0,0)/Extra/%s", filename);␊
␉␉␉fd = open(dirSpec, 0);␊
␉␉}␊
␉}␊
␊
␉if (fd < 0)␊
␉{␊
␉␉// NOT FOUND:␊
␉␉verbose("ACPI table not found: %s\n", filename);␊
␉␉*dirSpec = '\0';␊
␉}␊
␊
␉if (outDirspec) *outDirspec = dirSpec; ␊
␉return fd;␊
}␊
␊
␊
void *loadACPITable (const char * filename)␊
{␊
␉void *tableAddr;␊
␉const char * dirspec=NULL;␊
␉␊
␉int fd = search_and_get_acpi_fd(filename, &dirspec);␊
␉␊
␉if (fd>=0)␊
␉{␊
␉␉tableAddr=(void*)AllocateKernelMemory(file_size (fd));␊
␉␉if (tableAddr)␊
␉␉{␊
␉␉␉if (read (fd, tableAddr, file_size (fd))!=file_size (fd))␊
␉␉␉{␊
␉␉␉␉printf("Couldn't read table %s\n",dirspec);␊
␉␉␉␉free (tableAddr);␊
␉␉␉␉close (fd);␊
␉␉␉␉return NULL;␊
␉␉␉}␊
␉␉␉␊
␉␉␉DBG("Table %s read and stored at: %x\n", dirspec, tableAddr);␊
␉␉␉close (fd);␊
␉␉␉return tableAddr;␊
␉␉}␊
␉␉close (fd);␊
␉␉printf("Couldn't allocate memory for table \n", dirspec);␊
␉} ␊
␉//printf("Couldn't find table %s\n", filename);␊
␉return NULL;␊
}␊
␊
uint8_t␉acpi_cpu_count = 0;␊
char* acpi_cpu_name[32];␊
␊
void get_acpi_cpu_names(unsigned char* dsdt, uint32_t length)␊
{␊
␉uint32_t i;␊
␉␊
␉for (i=0; i<length-7; i++) ␊
␉{␊
␉␉if (dsdt[i] == 0x5B && dsdt[i+1] == 0x83) // ProcessorOP␊
␉␉{␊
␉␉␉uint32_t offset = i + 3 + (dsdt[i+2] >> 6);␊
␉␉␉␊
␉␉␉bool add_name = true;␊
␊
␉␉␉uint8_t j;␊
␉␉␉␊
␉␉␉for (j=0; j<4; j++) ␊
␉␉␉{␊
␉␉␉␉char c = dsdt[offset+j];␊
␉␉␉␉␊
␉␉␉␉if (!aml_isvalidchar(c)) ␊
␉␉␉␉{␊
␉␉␉␉␉add_name = false;␊
␉␉␉␉␉verbose("Invalid character found in ProcessorOP 0x%x!\n", c);␊
␉␉␉␉␉break;␊
␉␉␉␉}␊
␉␉␉}␊
␉␉␉␊
␉␉␉if (add_name) ␊
␉␉␉{␊
␉␉␉␉acpi_cpu_name[acpi_cpu_count] = malloc(4);␊
␉␉␉␉memcpy(acpi_cpu_name[acpi_cpu_count], dsdt+offset, 4);␊
␉␉␉␉i = offset + 5;␊
␉␉␉␉␊
␉␉␉␉verbose("Found ACPI CPU: %c%c%c%c\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]);␊
␉␉␉␉␊
␉␉␉␉if (++acpi_cpu_count == 32) return;␊
␉␉␉}␊
␉␉}␊
␉}␊
}␊
␊
struct acpi_2_ssdt *generate_cst_ssdt(struct acpi_2_fadt* fadt)␊
{␊
␉char ssdt_header[] =␊
␉{␊
␉␉0x53, 0x53, 0x44, 0x54, 0xE7, 0x00, 0x00, 0x00, /* SSDT.... */␊
␉␉0x01, 0x17, 0x50, 0x6D, 0x52, 0x65, 0x66, 0x41, /* ..PmRefA */␊
␉␉0x43, 0x70, 0x75, 0x43, 0x73, 0x74, 0x00, 0x00, /* CpuCst.. */␊
␉␉0x00, 0x10, 0x00, 0x00, 0x49, 0x4E, 0x54, 0x4C, /* ....INTL */␊
␉␉0x31, 0x03, 0x10, 0x20 ␉␉␉␉␉␉␉/* 1.._␉␉*/␊
␉};␊
␉␊
␉char cstate_resource_template[] = ␊
␉{␊
␉␉0x11, 0x14, 0x0A, 0x11, 0x82, 0x0C, 0x00, 0x7F, ␊
␉␉0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, ␊
␉␉0x00, 0x00, 0x00, 0x79, 0x00␊
␉};␊
␊
␉if (Platform.CPU.Vendor != 0x756E6547) {␊
␉␉verbose ("Not an Intel platform: C-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉if (fadt == NULL) {␊
␉␉verbose ("FACP not exists: C-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉struct acpi_2_dsdt* dsdt = (void*)fadt->DSDT;␊
␉␊
␉if (dsdt == NULL) {␊
␉␉verbose ("DSDT not found: C-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉if (acpi_cpu_count == 0) ␊
␉␉get_acpi_cpu_names((void*)dsdt, dsdt->Length);␊
␉␊
␉if (acpi_cpu_count > 0) ␊
␉{␊
␉␉bool c2_enabled = fadt->C2_Latency < 100;␊
␉␉bool c3_enabled = fadt->C3_Latency < 1000;␊
␉␉bool c4_enabled = false;␊
␉␉␊
␉␉getBoolForKey(kEnableC4States, &c4_enabled, &bootInfo->bootConfig);␊
␊
␉␉unsigned char cstates_count = 1 + (c2_enabled ? 1 : 0) + (c3_enabled ? 1 : 0);␊
␉␉␊
␉␉struct aml_chunk* root = aml_create_node(NULL);␊
␉␉␉aml_add_buffer(root, ssdt_header, sizeof(ssdt_header)); // SSDT header␊
␉␉␉struct aml_chunk* scop = aml_add_scope(root, "\\_PR_");␊
␉␉␉␉struct aml_chunk* name = aml_add_name(scop, "CST_");␊
␉␉␉␉␉struct aml_chunk* pack = aml_add_package(name);␊
␉␉␉␉␉␉aml_add_byte(pack, cstates_count);␊
␉␉␊
␉␉␉␉␉␉struct aml_chunk* tmpl = aml_add_package(pack);␊
␉␉␉␉␉␉␉cstate_resource_template[11] = 0x00; // C1␊
␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x01); // C1␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x01); // Latency␊
␉␉␉␉␉␉␉aml_add_word(tmpl, 0x03e8); // Power␊
␊
␉␉␉␉␉␉// C2␊
␉␉␉␉␉␉if (c2_enabled) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉tmpl = aml_add_package(pack);␊
␉␉␉␉␉␉␉␉cstate_resource_template[11] = 0x10; // C2␊
␉␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊
␉␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x02); // C2␊
␉␉␉␉␉␉␉␉aml_add_byte(tmpl, fadt->C2_Latency);␊
␉␉␉␉␉␉␉␉aml_add_word(tmpl, 0x01f4); // Power␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉// C4␊
␉␉␉␉␉␉if (c4_enabled) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉tmpl = aml_add_package(pack);␊
␉␉␉␉␉␉␉cstate_resource_template[11] = 0x30; // C4␊
␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x04); // C4␊
␉␉␉␉␉␉␉aml_add_word(tmpl, fadt->C3_Latency / 2); // TODO: right latency for C4␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0xfa); // Power␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉else␊
␉␉␉␉␉␉// C3␊
␉␉␉␉␉␉if (c3_enabled) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉tmpl = aml_add_package(pack);␊
␉␉␉␉␉␉␉cstate_resource_template[11] = 0x20; // C3␊
␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x03); // C3␊
␉␉␉␉␉␉␉aml_add_word(tmpl, fadt->C3_Latency);␊
␉␉␉␉␉␉␉aml_add_word(tmpl, 0x015e); // Power␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␊
␉␉␉// Aliaces␊
␉␉␉int i;␊
␉␉␉for (i = 0; i < acpi_cpu_count; i++) ␊
␉␉␉{␊
␉␉␉␉char name[9];␊
␉␉␉␉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]);␊
␉␉␉␉␊
␉␉␉␉scop = aml_add_scope(root, name);␊
␉␉␉␉␉aml_add_alias(scop, "CST_", "_CST");␊
␉␉␉}␊
␉␉␊
␉␉aml_calculate_size(root);␊
␉␉␊
␉␉struct acpi_2_ssdt *ssdt = (struct acpi_2_ssdt *)AllocateKernelMemory(root->Size);␊
␉␊
␉␉aml_write_node(root, (void*)ssdt, 0);␊
␉␉␊
␉␉ssdt->Length = root->Size;␊
␉␉ssdt->Checksum = 0;␊
␉␉ssdt->Checksum = 256 - checksum8(ssdt, ssdt->Length);␊
␉␉␊
␉␉aml_destroy_node(root);␊
␉␉␊
␉␉//dumpPhysAddr("C-States SSDT content: ", ssdt, ssdt->Length);␊
␉␉␉␉␊
␉␉verbose ("SSDT with CPU C-States generated successfully\n");␊
␉␉␊
␉␉return ssdt;␊
␉}␊
␉else ␊
␉{␊
␉␉verbose ("ACPI CPUs not found: C-States not generated !!!\n");␊
␉}␊
␊
␉return NULL;␊
}␊
␊
struct acpi_2_ssdt *generate_pss_ssdt(struct acpi_2_dsdt* dsdt)␊
{␉␊
␉char ssdt_header[] =␊
␉{␊
␉␉0x53, 0x53, 0x44, 0x54, 0x7E, 0x00, 0x00, 0x00, /* SSDT.... */␊
␉␉0x01, 0x6A, 0x50, 0x6D, 0x52, 0x65, 0x66, 0x00, /* ..PmRef. */␊
␉␉0x43, 0x70, 0x75, 0x50, 0x6D, 0x00, 0x00, 0x00, /* CpuPm... */␊
␉␉0x00, 0x30, 0x00, 0x00, 0x49, 0x4E, 0x54, 0x4C, /* .0..INTL */␊
␉␉0x31, 0x03, 0x10, 0x20,␉␉␉␉␉␉␉/* 1.._␉␉*/␊
␉};␊
␉␊
␉if (Platform.CPU.Vendor != 0x756E6547) {␊
␉␉verbose ("Not an Intel platform: P-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉if (!(Platform.CPU.Features & CPU_FEATURE_MSR)) {␊
␉␉verbose ("Unsupported CPU: P-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉if (acpi_cpu_count == 0) ␊
␉␉get_acpi_cpu_names((void*)dsdt, dsdt->Length);␊
␉␊
␉if (acpi_cpu_count > 0) ␊
␉{␊
␉␉struct p_state initial, maximum, minimum, p_states[32];␊
␉␉uint8_t p_states_count = 0;␉␉␊
␉␉␊
␉␉// Retrieving P-States, ported from code by superhai (c)␊
␉␉switch (Platform.CPU.Family) {␊
␉␉␉case 0x06: ␊
␉␉␉{␊
␉␉␉␉switch (Platform.CPU.Model) ␊
␉␉␉␉{␊
␉␉␉␉␉case 0x0D: // ?␊
␉␉␉␉␉case CPU_MODEL_YONAH: // Yonah␊
␉␉␉␉␉case CPU_MODEL_MEROM: // Merom␊
␉␉␉␉␉case CPU_MODEL_PENRYN: // Penryn␊
␉␉␉␉␉case CPU_MODEL_ATOM: // Intel Atom (45nm)␊
␉␉␉␉␉{␊
␉␉␉␉␉␉bool cpu_dynamic_fsb = false;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (rdmsr64(MSR_IA32_EXT_CONFIG) & (1 << 27)) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉wrmsr64(MSR_IA32_EXT_CONFIG, (rdmsr64(MSR_IA32_EXT_CONFIG) | (1 << 28))); ␊
␉␉␉␉␉␉␉delay(1);␊
␉␉␉␉␉␉␉cpu_dynamic_fsb = rdmsr64(MSR_IA32_EXT_CONFIG) & (1 << 28);␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉bool cpu_noninteger_bus_ratio = (rdmsr64(MSR_IA32_PERF_STATUS) & (1ULL << 46));␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉initial.Control = rdmsr64(MSR_IA32_PERF_STATUS);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉maximum.Control = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 32) & 0x1F3F) | (0x4000 * cpu_noninteger_bus_ratio);␊
␉␉␉␉␉␉maximum.CID = ((maximum.FID & 0x1F) << 1) | cpu_noninteger_bus_ratio;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉minimum.FID = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 24) & 0x1F) | (0x80 * cpu_dynamic_fsb);␊
␉␉␉␉␉␉minimum.VID = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 48) & 0x3F);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (minimum.FID == 0) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉uint64_t msr;␊
␉␉␉␉␉␉␉uint8_t i;␊
␉␉␉␉␉␉␉// Probe for lowest fid␊
␉␉␉␉␉␉␉for (i = maximum.FID; i >= 0x6; i--) ␊
␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉msr = rdmsr64(MSR_IA32_PERF_CONTROL);␊
␉␉␉␉␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (msr & 0xFFFFFFFFFFFF0000ULL) | (i << 8) | minimum.VID);␊
␉␉␉␉␉␉␉␉intel_waitforsts();␊
␉␉␉␉␉␉␉␉minimum.FID = (rdmsr64(MSR_IA32_PERF_STATUS) >> 8) & 0x1F; ␊
␉␉␉␉␉␉␉␉delay(1);␊
␉␉␉␉␉␉␉}␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉msr = rdmsr64(MSR_IA32_PERF_CONTROL);␊
␉␉␉␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (msr & 0xFFFFFFFFFFFF0000ULL) | (maximum.FID << 8) | maximum.VID);␊
␉␉␉␉␉␉␉intel_waitforsts();␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (minimum.VID == maximum.VID) ␊
␉␉␉␉␉␉{␉␊
␉␉␉␉␉␉␉uint64_t msr;␊
␉␉␉␉␉␉␉uint8_t i;␊
␉␉␉␉␉␉␉// Probe for lowest vid␊
␉␉␉␉␉␉␉for (i = maximum.VID; i > 0xA; i--) ␊
␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉msr = rdmsr64(MSR_IA32_PERF_CONTROL);␊
␉␉␉␉␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (msr & 0xFFFFFFFFFFFF0000ULL) | (minimum.FID << 8) | i);␊
␉␉␉␉␉␉␉␉intel_waitforsts();␊
␉␉␉␉␉␉␉␉minimum.VID = rdmsr64(MSR_IA32_PERF_STATUS) & 0x3F; ␊
␉␉␉␉␉␉␉␉delay(1);␊
␉␉␉␉␉␉␉}␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉msr = rdmsr64(MSR_IA32_PERF_CONTROL);␊
␉␉␉␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (msr & 0xFFFFFFFFFFFF0000ULL) | (maximum.FID << 8) | maximum.VID);␊
␉␉␉␉␉␉␉intel_waitforsts();␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉minimum.CID = ((minimum.FID & 0x1F) << 1) >> cpu_dynamic_fsb;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉// Sanity check␊
␉␉␉␉␉␉if (maximum.CID < minimum.CID) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉DBG("Insane FID values!");␊
␉␉␉␉␉␉␉p_states_count = 1;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉else␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉// Finalize P-States␊
␉␉␉␉␉␉␉// Find how many P-States machine supports␊
␉␉␉␉␉␉␉p_states_count = maximum.CID - minimum.CID + 1;␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉if (p_states_count > 32) ␊
␉␉␉␉␉␉␉␉p_states_count = 32;␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉uint8_t vidstep;␊
␉␉␉␉␉␉␉uint8_t i = 0, u, invalid = 0;␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉vidstep = ((maximum.VID << 2) - (minimum.VID << 2)) / (p_states_count - 1);␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉for (u = 0; u < p_states_count; u++) ␊
␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉i = u - invalid;␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉p_states[i].CID = maximum.CID - u;␊
␉␉␉␉␉␉␉␉p_states[i].FID = (p_states[i].CID >> 1);␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉if (p_states[i].FID < 0x6) ␊
␉␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉␉if (cpu_dynamic_fsb) ␊
␉␉␉␉␉␉␉␉␉␉p_states[i].FID = (p_states[i].FID << 1) | 0x80;␊
␉␉␉␉␉␉␉␉} ␊
␉␉␉␉␉␉␉␉else if (cpu_noninteger_bus_ratio) ␊
␉␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉␉p_states[i].FID = p_states[i].FID | (0x40 * (p_states[i].CID & 0x1));␊
␉␉␉␉␉␉␉␉}␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉if (i && p_states[i].FID == p_states[i-1].FID)␊
␉␉␉␉␉␉␉␉␉invalid++;␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉p_states[i].VID = ((maximum.VID << 2) - (vidstep * u)) >> 2;␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉uint32_t multiplier = p_states[i].FID & 0x1f;␉␉// = 0x08␊
␉␉␉␉␉␉␉␉bool half = p_states[i].FID & 0x40;␉␉␉␉␉// = 0x01␊
␉␉␉␉␉␉␉␉bool dfsb = p_states[i].FID & 0x80;␉␉␉␉␉// = 0x00␊
␉␉␉␉␉␉␉␉uint32_t fsb = Platform.CPU.FSBFrequency / 1000000; // = 400␊
␉␉␉␉␉␉␉␉uint32_t halffsb = (fsb + 1) >> 1;␉␉␉␉␉// = 200␊
␉␉␉␉␉␉␉␉uint32_t frequency = (multiplier * fsb);␉␉␉// = 3200␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉p_states[i].Frequency = (frequency + (half * halffsb)) >> dfsb;␉// = 3200 + 200 = 3400␊
␉␉␉␉␉␉␉}␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉p_states_count -= invalid;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉} break;␊
␉␉␉␉␉case CPU_MODEL_FIELDS:␊
␉␉␉␉␉case CPU_MODEL_DALES:␊
␉␉␉␉␉case CPU_MODEL_DALES_32NM:␊
␉␉␉␉␉case CPU_MODEL_NEHALEM: ␊
␉␉␉␉␉case CPU_MODEL_NEHALEM_EX:␊
␉␉␉␉␉case CPU_MODEL_WESTMERE:␊
␉␉␉␉␉case CPU_MODEL_WESTMERE_EX:␊
␉␉␉␉␉default:␊
␉␉␉␉␉␉verbose ("Unsupported CPU: P-States not generated !!!\n");␊
␉␉␉␉␉␉break;␊
␉␉␉␉}␊
␉␉␉}␊
␉␉}␊
␉␉␊
␉␉// Generating SSDT␊
␉␉if (p_states_count > 0) ␊
␉␉{␉␊
␉␉␉int i;␊
␉␉␉␊
␉␉␉struct aml_chunk* root = aml_create_node(NULL);␊
␉␉␉␉aml_add_buffer(root, ssdt_header, sizeof(ssdt_header)); // SSDT header␊
␉␉␉␉␉struct aml_chunk* scop = aml_add_scope(root, "\\_PR_");␊
␉␉␉␉␉␉struct aml_chunk* name = aml_add_name(scop, "PSS_");␊
␉␉␉␉␉␉␉struct aml_chunk* pack = aml_add_package(name);␊
␉␉␉␊
␉␉␉␉␉␉␉␉for (i = 0; i < p_states_count; i++) ␊
␉␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉␉struct aml_chunk* pstt = aml_add_package(pack);␊
␉␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, p_states[i].Frequency);␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x00000000); // Power␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x0000000A); // Latency␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x0000000A); // Latency␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, p_states[i].Control);␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, i+1); // Status␊
␉␉␉␉␉␉␉␉}␊
␉␉␉␉␊
␉␉␉// Add aliaces␊
␉␉␉for (i = 0; i < acpi_cpu_count; i++) ␊
␉␉␉{␊
␉␉␉␉char name[9];␊
␉␉␉␉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]);␊
␉␉␉␉␊
␉␉␉␉scop = aml_add_scope(root, name);␊
␉␉␉␉aml_add_alias(scop, "PSS_", "_PSS");␊
␉␉␉}␊
␉␉␉␊
␉␉␉aml_calculate_size(root);␊
␉␉␉␊
␉␉␉struct acpi_2_ssdt *ssdt = (struct acpi_2_ssdt *)AllocateKernelMemory(root->Size);␊
␉␉␉␊
␉␉␉aml_write_node(root, (void*)ssdt, 0);␊
␉␉␉␊
␉␉␉ssdt->Length = root->Size;␊
␉␉␉ssdt->Checksum = 0;␊
␉␉␉ssdt->Checksum = 256 - checksum8(ssdt, ssdt->Length);␊
␉␉␉␊
␉␉␉aml_destroy_node(root);␊
␉␉␉␊
␉␉␉//dumpPhysAddr("P-States SSDT content: ", ssdt, ssdt->Length);␊
␉␉␉␊
␉␉␉verbose ("SSDT with CPU P-States generated successfully\n");␊
␉␉␉␊
␉␉␉return ssdt;␊
␉␉}␊
␉}␊
␉else ␊
␉{␊
␉␉verbose ("ACPI CPUs not found: P-States not generated !!!\n");␊
␉}␊
␉␊
␉return NULL;␊
}␊
␊
struct acpi_2_fadt *patch_fadt(struct acpi_2_fadt *fadt, struct acpi_2_dsdt *new_dsdt)␊
{␊
␉extern void setupSystemType(); ␊
␉␊
␉struct acpi_2_fadt *fadt_mod;␊
␉bool fadt_rev2_needed = false;␊
␉bool fix_restart;␊
␉const char * value;␊
␉␊
␉// Restart Fix␊
␉if (Platform.CPU.Vendor == 0x756E6547) {␉/* Intel */␊
␉␉fix_restart = true;␊
␉␉getBoolForKey(kRestartFix, &fix_restart, &bootInfo->bootConfig);␊
␉} else {␊
␉␉verbose ("Not an Intel platform: Restart Fix not applied !!!\n");␊
␉␉fix_restart = false;␊
␉}␊
␉␊
␉if (fix_restart) fadt_rev2_needed = true;␊
␉␊
␉// Allocate new fadt table␊
␉if (fadt->Length < 0x84 && fadt_rev2_needed)␊
␉{␊
␉␉fadt_mod=(struct acpi_2_fadt *)AllocateKernelMemory(0x84);␊
␉␉memcpy(fadt_mod, fadt, fadt->Length);␊
␉␉fadt_mod->Length = 0x84;␊
␉␉fadt_mod->Revision = 0x02; // FADT rev 2 (ACPI 1.0B MS extensions)␊
␉}␊
␉else␊
␉{␊
␉␉fadt_mod=(struct acpi_2_fadt *)AllocateKernelMemory(fadt->Length);␊
␉␉memcpy(fadt_mod, fadt, fadt->Length);␊
␉}␊
␉// Determine system type / PM_Model␊
␉if ( (value=getStringForKey(kSystemType, &bootInfo->bootConfig))!=NULL)␊
␉{␊
␉␉if (Platform.Type > 6) ␊
␉␉{␊
␉␉␉if(fadt_mod->PM_Profile<=6)␊
␉␉␉␉Platform.Type = fadt_mod->PM_Profile; // get the fadt if correct␊
␉␉␉else ␊
␉␉␉␉Platform.Type = 1;␉␉/* Set a fixed value (Desktop) */␊
␉␉␉verbose("Error: system-type must be 0..6. Defaulting to %d !\n", Platform.Type);␊
␉␉}␊
␉␉else␊
␉␉␉Platform.Type = (unsigned char) strtoul(value, NULL, 10);␊
␉}␊
␉// Set PM_Profile from System-type if only user wanted this value to be forced␊
␉if (fadt_mod->PM_Profile != Platform.Type) ␊
␉{␊
␉ if (value) ␊
␉␉{ // user has overriden the SystemType so take care of it in FACP␊
␉␉␉verbose("FADT: changing PM_Profile from 0x%02x to 0x%02x\n", fadt_mod->PM_Profile, Platform.Type);␊
␉␉␉fadt_mod->PM_Profile = Platform.Type;␊
␉ }␊
␉ else␊
␉ { // PM_Profile has a different value and no override has been set, so reflect the user value to ioregs␊
␉␉␉Platform.Type = fadt_mod->PM_Profile <= 6 ? fadt_mod->PM_Profile : 1;␊
␉ } ␊
␉}␊
␉// We now have to write the systemm-type in ioregs: we cannot do it before in setupDeviceTree()␊
␉// because we need to take care of facp original content, if it is correct.␊
␉setupSystemType();␊
␉␊
␉// Patch FADT to fix restart␊
␉if (fix_restart)␊
␉{␊
␉␉fadt_mod->Flags|= 0x400;␊
␉␉fadt_mod->Reset_SpaceID␉␉= 0x01; // System I/O␊
␉␉fadt_mod->Reset_BitWidth␉= 0x08; // 1 byte␊
␉␉fadt_mod->Reset_BitOffset␉= 0x00; // Offset 0␊
␉␉fadt_mod->Reset_AccessWidth␉= 0x01; // Byte access␊
␉␉fadt_mod->Reset_Address␉␉= 0x0cf9; // Address of the register␊
␉␉fadt_mod->Reset_Value␉␉= 0x06; // Value to write to reset the system␊
␉␉verbose("FADT: Restart Fix applied!\n");␊
␉}␊
␉␊
␉// Patch DSDT Address if we have loaded DSDT.aml␊
␉if(new_dsdt)␊
␉{␊
␉␉DBG("DSDT: Old @%x,%x, ",fadt_mod->DSDT,fadt_mod->X_DSDT);␊
␉␉␊
␉␉fadt_mod->DSDT=(uint32_t)new_dsdt;␊
␉␉if ((uint32_t)(&(fadt_mod->X_DSDT))-(uint32_t)fadt_mod+8<=fadt_mod->Length)␊
␉␉␉fadt_mod->X_DSDT=(uint32_t)new_dsdt;␊
␉␉␊
␉␉DBG("New @%x,%x\n",fadt_mod->DSDT,fadt_mod->X_DSDT);␊
␉␉␊
␉␉verbose("FADT: Using custom DSDT!\n");␊
␉}␊
␉␊
␉// Correct the checksum␊
␉fadt_mod->Checksum=0;␊
␉fadt_mod->Checksum=256-checksum8(fadt_mod,fadt_mod->Length);␊
␉␊
␉return fadt_mod;␊
}␊
␊
/* Setup ACPI without replacing DSDT. */␊
int setupAcpiNoMod()␊
{␊
␉//␉addConfigurationTable(&gEfiAcpiTableGuid, getAddressOfAcpiTable(), "ACPI");␊
␉//␉addConfigurationTable(&gEfiAcpi20TableGuid, getAddressOfAcpi20Table(), "ACPI_20");␊
␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊
␉acpi10_p = (uint32_t)getAddressOfAcpiTable();␊
␉acpi20_p = (uint32_t)getAddressOfAcpi20Table();␊
␉addConfigurationTable(&gEfiAcpiTableGuid, &acpi10_p, "ACPI");␊
␉if(acpi20_p) addConfigurationTable(&gEfiAcpi20TableGuid, &acpi20_p, "ACPI_20");␊
␉return 1;␊
}␊
␊
/* Setup ACPI. Replace DSDT if DSDT.aml is found */␊
int setupAcpi(void)␊
{␊
␉int version;␊
␉void *new_dsdt;␊
␊
␉const char *filename;␊
␉char dirSpec[128];␊
␉int len = 0;␊
␊
␉// Try using the file specified with the DSDT option␊
␉if (getValueForKey(kDSDT, &filename, &len, &bootInfo->bootConfig))␊
␉{␊
␉␉sprintf(dirSpec, filename);␊
␉}␊
␉else␊
␉{␊
␉␉sprintf(dirSpec, "DSDT.aml");␊
␉}␊
␉␊
␉// Load replacement DSDT␊
␉new_dsdt = loadACPITable(dirSpec);␊
␉// Mozodojo: going to patch FACP and load SSDT's even if DSDT.aml is not present␊
␉/*if (!new_dsdt)␊
␉ {␊
␉ return setupAcpiNoMod();␊
␉ }*/␊
␉␊
␉// Mozodojo: Load additional SSDTs␊
␉struct acpi_2_ssdt *new_ssdt[32]; // 30 + 2 additional tables for pss & cst␊
␉int ssdt_count=0;␊
␉␊
␉// SSDT Options␊
␉bool drop_ssdt=false, generate_pstates=false, generate_cstates=false; ␊
␉␊
␉getBoolForKey(kDropSSDT, &drop_ssdt, &bootInfo->bootConfig);␊
␉getBoolForKey(kGeneratePStates, &generate_pstates, &bootInfo->bootConfig);␊
␉getBoolForKey(kGenerateCStates, &generate_cstates, &bootInfo->bootConfig);␊
␉␊
␉{␊
␉␉int i;␊
␉␉␊
␉␉for (i=0; i<30; i++)␊
␉␉{␊
␉␉␉char filename[512];␊
␊
␉␉␉sprintf(filename, i>0?"SSDT-%d.aml":"SSDT.aml", i);␊
␉␉␉␊
␉␉␉if(new_ssdt[ssdt_count] = loadACPITable(filename)) ␊
␉␉␉{␉␉␉␉␊
␉␉␉␉ssdt_count++;␊
␉␉␉}␊
␉␉␉else ␊
␉␉␉{␊
␉␉␉␉break;␊
␉␉␉}␊
␉␉}␊
␉}␊
␉␉␊
␉// Do the same procedure for both versions of ACPI␊
␉for (version=0; version<2; version++) {␊
␉␉struct acpi_2_rsdp *rsdp, *rsdp_mod;␊
␉␉struct acpi_2_rsdt *rsdt, *rsdt_mod;␊
␉␉int rsdplength;␊
␉␉␊
␉␉// Find original rsdp␊
␉␉rsdp=(struct acpi_2_rsdp *)(version?getAddressOfAcpi20Table():getAddressOfAcpiTable());␊
␉␉if (!rsdp)␊
␉␉{␊
␉␉␉DBG("No ACPI version %d found. Ignoring\n", version+1);␊
␉␉␉if (version)␊
␉␉␉␉addConfigurationTable(&gEfiAcpi20TableGuid, NULL, "ACPI_20");␊
␉␉␉else␊
␉␉␉␉addConfigurationTable(&gEfiAcpiTableGuid, NULL, "ACPI");␊
␉␉␉continue;␊
␉␉}␊
␉␉rsdplength=version?rsdp->Length:20;␊
␉␉␊
␉␉DBG("RSDP version %d found @%x. Length=%d\n",version+1,rsdp,rsdplength);␊
␉␉␊
␉␉/* FIXME: no check that memory allocation succeeded ␊
␉␉ * Copy and patch RSDP,RSDT, XSDT and FADT␊
␉␉ * For more info see ACPI Specification pages 110 and following␊
␉␉ */␊
␉␉␊
␉␉rsdp_mod=(struct acpi_2_rsdp *) AllocateKernelMemory(rsdplength);␊
␉␉memcpy(rsdp_mod, rsdp, rsdplength); ␊
␉␉rsdt=(struct acpi_2_rsdt *)(rsdp->RsdtAddress);␊
␉␉␊
␉␉DBG("RSDT @%x, Length %d\n",rsdt, rsdt->Length);␊
␉␉␊
␉␉if (rsdt && (uint32_t)rsdt !=0xffffffff && rsdt->Length<0x10000)␊
␉␉{␊
␉␉␉uint32_t *rsdt_entries;␊
␉␉␉int rsdt_entries_num;␊
␉␉␉int dropoffset=0, i;␊
␉␉␉␊
␉␉␉// mozo: using malloc cos I didn't found how to free already allocated kernel memory␊
␉␉␉rsdt_mod=(struct acpi_2_rsdt *)malloc(rsdt->Length); ␊
␉␉␉memcpy (rsdt_mod, rsdt, rsdt->Length);␊
␉␉␉rsdp_mod->RsdtAddress=(uint32_t)rsdt_mod;␊
␉␉␉rsdt_entries_num=(rsdt_mod->Length-sizeof(struct acpi_2_rsdt))/4;␊
␉␉␉rsdt_entries=(uint32_t *)(rsdt_mod+1);␊
␉␉␉for (i=0;i<rsdt_entries_num;i++)␊
␉␉␉{␊
␉␉␉␉char *table=(char *)(rsdt_entries[i]);␊
␉␉␉␉if (!table)␊
␉␉␉␉␉continue;␊
␉␉␉␉␊
␉␉␉␉DBG("TABLE %c%c%c%c,",table[0],table[1],table[2],table[3]);␊
␉␉␉␉␊
␉␉␉␉rsdt_entries[i-dropoffset]=rsdt_entries[i];␊
␉␉␉␉␊
␉␉␉␉if (drop_ssdt && tableSign(table, "SSDT"))␊
␉␉␉␉{␊
␉␉␉␉␉dropoffset++;␊
␉␉␉␉␉continue;␊
␉␉␉␉}␊
␉␉␉␉if (tableSign(table, "DSDT"))␊
␉␉␉␉{␊
␉␉␉␉␉DBG("DSDT found\n");␊
␉␉␉␉␉␊
␉␉␉␉␉if(new_dsdt)␊
␉␉␉␉␉␉rsdt_entries[i-dropoffset]=(uint32_t)new_dsdt;␊
␉␉␉␉␉␉␉␉␉␉␊
␉␉␉␉␉continue;␊
␉␉␉␉}␊
␉␉␉␉if (tableSign(table, "FACP"))␊
␉␉␉␉{␊
␉␉␉␉␉struct acpi_2_fadt *fadt, *fadt_mod;␊
␉␉␉␉␉fadt=(struct acpi_2_fadt *)rsdt_entries[i];␊
␉␉␉␉␉␊
␉␉␉␉␉DBG("FADT found @%x, Length %d\n",fadt, fadt->Length);␊
␉␉␉␉␉␊
␉␉␉␉␉if (!fadt || (uint32_t)fadt == 0xffffffff || fadt->Length>0x10000)␊
␉␉␉␉␉{␊
␉␉␉␉␉␉printf("FADT incorrect. Not modified\n");␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉}␊
␉␉␉␉␉␊
␉␉␉␉␉fadt_mod = patch_fadt(fadt, new_dsdt);␊
␉␉␉␉␉rsdt_entries[i-dropoffset]=(uint32_t)fadt_mod;␊
␉␉␉␉␉␊
␉␉␉␉␉// Generate _CST SSDT␊
␉␉␉␉␉if (generate_cstates && (new_ssdt[ssdt_count] = generate_cst_ssdt(fadt_mod)))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉generate_cstates = false; // Generate SSDT only once!␊
␉␉␉␉␉␉ssdt_count++;␊
␉␉␉␉␉}␊
␉␉␉␉␉␊
␉␉␉␉␉// Generating _PSS SSDT␊
␉␉␉␉␉if (generate_pstates && (new_ssdt[ssdt_count] = generate_pss_ssdt((void*)fadt_mod->DSDT)))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉generate_pstates = false; // Generate SSDT only once!␊
␉␉␉␉␉␉ssdt_count++;␊
␉␉␉␉␉}␊
␉␉␉␉␉␊
␉␉␉␉␉continue;␊
␉␉␉␉}␊
␉␉␉}␊
␉␉␉DBG("\n");␊
␉␉␉␊
␉␉␉// Allocate rsdt in Kernel memory area␊
␉␉␉rsdt_mod->Length += 4*ssdt_count - 4*dropoffset;␊
␉␉␉struct acpi_2_rsdt *rsdt_copy = (struct acpi_2_rsdt *)AllocateKernelMemory(rsdt_mod->Length);␊
␉␉␉memcpy (rsdt_copy, rsdt_mod, rsdt_mod->Length);␊
␉␉␉free(rsdt_mod); rsdt_mod = rsdt_copy;␊
␉␉␉rsdp_mod->RsdtAddress=(uint32_t)rsdt_mod;␊
␉␉␉rsdt_entries_num=(rsdt_mod->Length-sizeof(struct acpi_2_rsdt))/4;␊
␉␉␉rsdt_entries=(uint32_t *)(rsdt_mod+1);␊
␉␉␉␊
␉␉␉// Mozodojo: Insert additional SSDTs into RSDT␊
␉␉␉if(ssdt_count>0)␊
␉␉␉{␊
␉␉␉␉int j;␊
␉␉␉␉␊
␉␉␉␉for (j=0; j<ssdt_count; j++)␊
␉␉␉␉␉rsdt_entries[i-dropoffset+j]=(uint32_t)new_ssdt[j];␊
␉␉␉␉␉␊
␉␉␉␉verbose("RSDT: Added %d SSDT table(s)\n", ssdt_count);␊
␉␉␉}␊
␊
␉␉␉// Correct the checksum of RSDT␊
␉␉␉DBG("RSDT: Original checksum %d, ", rsdt_mod->Checksum);␊
␉␉␉␊
␉␉␉rsdt_mod->Checksum=0;␊
␉␉␉rsdt_mod->Checksum=256-checksum8(rsdt_mod,rsdt_mod->Length);␊
␉␉␉␊
␉␉␉DBG("New checksum %d at %x\n", rsdt_mod->Checksum,rsdt_mod);␊
␉␉}␊
␉␉else␊
␉␉{␊
␉␉␉rsdp_mod->RsdtAddress=0;␊
␉␉␉printf("RSDT not found or RSDT incorrect\n");␊
␉␉}␊
␉␉␊
␉␉if (version)␊
␉␉{␊
␉␉␉struct acpi_2_xsdt *xsdt, *xsdt_mod;␊
␉␉␉␊
␉␉␉// FIXME: handle 64-bit address correctly␊
␉␉␉␊
␉␉␉xsdt=(struct acpi_2_xsdt*) ((uint32_t)rsdp->XsdtAddress);␊
␉␉␉DBG("XSDT @%x;%x, Length=%d\n", (uint32_t)(rsdp->XsdtAddress>>32),(uint32_t)rsdp->XsdtAddress,␊
␉␉␉␉xsdt->Length);␊
␉␉␉if (xsdt && (uint64_t)rsdp->XsdtAddress<0xffffffff && xsdt->Length<0x10000)␊
␉␉␉{␊
␉␉␉␉uint64_t *xsdt_entries;␊
␉␉␉␉int xsdt_entries_num, i;␊
␉␉␉␉int dropoffset=0;␊
␉␉␉␉␊
␉␉␉␉// mozo: using malloc cos I didn't found how to free already allocated kernel memory␊
␉␉␉␉xsdt_mod=(struct acpi_2_xsdt*)malloc(xsdt->Length); ␊
␉␉␉␉memcpy(xsdt_mod, xsdt, xsdt->Length);␊
␉␉␉␉rsdp_mod->XsdtAddress=(uint32_t)xsdt_mod;␊
␉␉␉␉xsdt_entries_num=(xsdt_mod->Length-sizeof(struct acpi_2_xsdt))/8;␊
␉␉␉␉xsdt_entries=(uint64_t *)(xsdt_mod+1);␊
␉␉␉␉for (i=0;i<xsdt_entries_num;i++)␊
␉␉␉␉{␊
␉␉␉␉␉char *table=(char *)((uint32_t)(xsdt_entries[i]));␊
␉␉␉␉␉if (!table)␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉␊
␉␉␉␉␉xsdt_entries[i-dropoffset]=xsdt_entries[i];␊
␉␉␉␉␉␊
␉␉␉␉␉if (drop_ssdt && tableSign(table, "SSDT"))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉dropoffset++;␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉}␉␉␉␉␉␊
␉␉␉␉␉if (tableSign(table, "DSDT"))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉DBG("DSDT found\n");␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (new_dsdt) ␊
␉␉␉␉␉␉␉xsdt_entries[i-dropoffset]=(uint32_t)new_dsdt;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉}␊
␉␉␉␉␉if (tableSign(table, "FACP"))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉struct acpi_2_fadt *fadt, *fadt_mod;␊
␉␉␉␉␉␉fadt=(struct acpi_2_fadt *)(uint32_t)xsdt_entries[i];␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉DBG("FADT found @%x,%x, Length %d\n",(uint32_t)(xsdt_entries[i]>>32),fadt, ␊
␉␉␉␉␉␉␉fadt->Length);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (!fadt || (uint64_t)xsdt_entries[i] >= 0xffffffff || fadt->Length>0x10000)␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉verbose("FADT incorrect or after 4GB. Dropping XSDT\n");␊
␉␉␉␉␉␉␉goto drop_xsdt;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉fadt_mod = patch_fadt(fadt, new_dsdt);␊
␉␉␉␉␉␉xsdt_entries[i-dropoffset]=(uint32_t)fadt_mod;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉// Generate _CST SSDT␊
␉␉␉␉␉␉if (generate_cstates && (new_ssdt[ssdt_count] = generate_cst_ssdt(fadt_mod))) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉generate_cstates = false; // Generate SSDT only once!␊
␉␉␉␉␉␉␉ssdt_count++;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉// Generating _PSS SSDT␊
␉␉␉␉␉␉if (generate_pstates && (new_ssdt[ssdt_count] = generate_pss_ssdt((void*)fadt_mod->DSDT)))␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉generate_pstates = false; // Generate SSDT only once!␊
␉␉␉␉␉␉␉ssdt_count++;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉}␊
␉␉␉␉␉␊
␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊
␉␉␉␉␉␊
␉␉␉␉}␊
␉␉␉␉␊
␉␉␉␉// Allocate xsdt in Kernel memory area␊
␉␉␉␉xsdt_mod->Length += 8*ssdt_count - 8*dropoffset;␊
␉␉␉␉struct acpi_2_xsdt *xsdt_copy = (struct acpi_2_xsdt *)AllocateKernelMemory(xsdt_mod->Length);␊
␉␉␉␉memcpy(xsdt_copy, xsdt_mod, xsdt_mod->Length);␊
␉␉␉␉free(xsdt_mod); xsdt_mod = xsdt_copy;␊
␉␉␉␉rsdp_mod->XsdtAddress=(uint32_t)xsdt_mod;␊
␉␉␉␉xsdt_entries_num=(xsdt_mod->Length-sizeof(struct acpi_2_xsdt))/8;␊
␉␉␉␉xsdt_entries=(uint64_t *)(xsdt_mod+1);␊
␉␉␉␉␊
␉␉␉␉// Mozodojo: Insert additional SSDTs into XSDT␊
␉␉␉␉if(ssdt_count>0)␊
␉␉␉␉{␊
␉␉␉␉␉int j;␊
␉␉␉␉␉␊
␉␉␉␉␉for (j=0; j<ssdt_count; j++)␊
␉␉␉␉␉␉xsdt_entries[i-dropoffset+j]=(uint32_t)new_ssdt[j];␊
␉␉␉␉␉␉␊
␉␉␉␉␉verbose("Added %d SSDT table(s) into XSDT\n", ssdt_count);␊
␉␉␉␉}␊
␊
␉␉␉␉// Correct the checksum of XSDT␊
␉␉␉␉xsdt_mod->Checksum=0;␊
␉␉␉␉xsdt_mod->Checksum=256-checksum8(xsdt_mod,xsdt_mod->Length);␊
␉␉␉}␊
␉␉␉else␊
␉␉␉{␊
␉␉␉drop_xsdt:␊
␉␉␉␉␊
␉␉␉␉DBG("About to drop XSDT\n");␊
␉␉␉␉␊
␉␉␉␉/*FIXME: Now we just hope that if MacOS doesn't find XSDT it reverts to RSDT. ␊
␉␉␉␉ * A Better strategy would be to generate␊
␉␉␉␉ */␊
␉␉␉␉␊
␉␉␉␉rsdp_mod->XsdtAddress=0xffffffffffffffffLL;␊
␉␉␉␉verbose("XSDT not found or XSDT incorrect\n");␊
␉␉␉}␊
␉␉}␊
␉␉␊
␉␉// Correct the checksum of RSDP ␊
␉␉␊
␉␉DBG("RSDP: Original checksum %d, ", rsdp_mod->Checksum);␊
␉␉␊
␉␉rsdp_mod->Checksum=0;␊
␉␉rsdp_mod->Checksum=256-checksum8(rsdp_mod,20);␊
␉␉␊
␉␉DBG("New checksum %d\n", rsdp_mod->Checksum);␊
␉␉␊
␉␉if (version)␊
␉␉{␊
␉␉␉DBG("RSDP: Original extended checksum %d", rsdp_mod->ExtendedChecksum);␊
␉␉␉␊
␉␉␉rsdp_mod->ExtendedChecksum=0;␊
␉␉␉rsdp_mod->ExtendedChecksum=256-checksum8(rsdp_mod,rsdp_mod->Length);␊
␉␉␉␊
␉␉␉DBG("New extended checksum %d\n", rsdp_mod->ExtendedChecksum);␊
␉␉␉␊
␉␉}␊
␉␉␊
␉␉//verbose("Patched ACPI version %d DSDT\n", version+1);␊
␉␉if (version)␊
␉␉{␊
␉␉␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊
␉␉␉acpi20_p = (uint32_t)rsdp_mod;␊
␉␉␉addConfigurationTable(&gEfiAcpi20TableGuid, &acpi20_p, "ACPI_20");␊
␉␉}␊
␉␉else␊
␉␉{␊
␉␉␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊
␉␉␉acpi10_p = (uint32_t)rsdp_mod;␊
␉␉␉addConfigurationTable(&gEfiAcpiTableGuid, &acpi10_p, "ACPI");␊
␉␉}␊
␉}␊
#if DEBUG_ACPI␊
␉printf("Press a key to continue... (DEBUG_ACPI)\n");␊
␉getc();␊
#endif␊
␉return 1;␊
}␊
branches/meklort/i386/libsaio/acpi_patcher.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/*␊
* Copyright 2008 mackerintel␊
*/␊
␊
#ifndef __LIBSAIO_ACPI_PATCHER_H␊
#define __LIBSAIO_ACPI_PATCHER_H␊
␊
#include "libsaio.h"␊
␊
uint64_t acpi10_p;␊
uint64_t acpi20_p;␊
uint64_t smbios_p;␊
␊
extern int setupAcpi();␊
␊
extern EFI_STATUS addConfigurationTable();␊
␊
extern EFI_GUID gEfiAcpiTableGuid;␊
extern EFI_GUID gEfiAcpi20TableGuid;␊
␊
struct p_state ␊
{␊
␉union ␊
␉{␊
␉␉uint16_t Control;␊
␉␉struct ␊
␉␉{␊
␉␉␉uint8_t VID;␉// Voltage ID␊
␉␉␉uint8_t FID;␉// Frequency ID␊
␉␉};␊
␉};␊
␉␊
␉uint8_t␉␉CID;␉␉// Compare ID␊
␉uint32_t␉Frequency;␊
};␊
␊
#endif /* !__LIBSAIO_ACPI_PATCHER_H */␊
branches/meklort/i386/libsaio/aml_generator.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
/*␊
* aml_generator.c␊
* Chameleon␊
*␊
* Created by Mozodojo on 20/07/10.␊
* Copyright 2010 mozo. All rights reserved.␊
*␊
*/␊
␊
#include "aml_generator.h"␊
␊
bool aml_add_to_parent(struct aml_chunk* parent, struct aml_chunk* node)␊
{␊
␉if (parent && node)␊
␉{␊
␉␉switch (parent->Type) ␊
␉␉{␊
␉␉␉case AML_CHUNK_NONE:␊
␉␉␉case AML_CHUNK_BYTE:␊
␉␉␉case AML_CHUNK_WORD:␊
␉␉␉case AML_CHUNK_DWORD:␊
␉␉␉case AML_CHUNK_QWORD:␊
␉␉␉case AML_CHUNK_ALIAS:␊
␉␉␉␉verbose("aml_add_to_parent: Node isn't supports child nodes!");␊
␉␉␉␉return FALSE;␊
␉␉␉case AML_CHUNK_NAME:␊
␉␉␉␉if (parent->First) ␊
␉␉␉␉{␊
␉␉␉␉␉verbose("aml_add_to_parent: Name node could have only one child node!");␊
␉␉␉␉␉return FALSE;␊
␉␉␉␉}␊
␉␉␉␉break;␊
␊
␉␉␉default:␊
␉␉␉␉break;␊
␉␉}␊
␉␉␊
␉␉if (!parent->First)␊
␉␉␉parent->First = node;␊
␉␉␊
␉␉if (parent->Last)␊
␉␉␉parent->Last->Next = node;␊
␉␉␊
␉␉parent->Last = node;␊
␉␉␊
␉␉return TRUE;␊
␉}␊
␉␊
␉return FALSE;␊
}␊
␊
struct aml_chunk* aml_create_node(struct aml_chunk* parent)␊
{␊
␉struct aml_chunk* node = (struct aml_chunk*)malloc(sizeof(struct aml_chunk));␊
␉␊
␉aml_add_to_parent(parent, node);␊
␉␊
␉return node;␊
}␊
␊
void aml_destroy_node(struct aml_chunk* node)␊
{␊
␉// Delete child nodes␊
␉struct aml_chunk* child = node->First;␊
␉␊
␉while (child) ␊
␉{␊
␉␉struct aml_chunk* next = child->Next;␊
␉␉␊
␉␉if (child->Buffer)␊
␉␉␉free(child->Buffer);␊
␉␉␊
␉␉free(child);␊
␉␉␊
␉␉child = next;␊
␉}␊
␉␊
␉// Free node␊
␉if (node->Buffer)␊
␉␉free(node->Buffer);␊
␉␊
␉free(node);␊
}␊
␊
struct aml_chunk* aml_add_buffer(struct aml_chunk* parent, const char* buffer, unsigned int size)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_NONE;␊
␉␉node->Length = size;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉memcpy(node->Buffer, buffer, node->Length);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_byte(struct aml_chunk* parent, unsigned char value)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_BYTE;␊
␉␉␊
␉␉node->Length = 1;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[0] = value;␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_word(struct aml_chunk* parent, unsigned int value)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_WORD;␊
␉␉node->Length = 2;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[0] = value & 0xff;␊
␉␉node->Buffer[1] = value >> 8;␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_dword(struct aml_chunk* parent, unsigned long value)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_DWORD;␊
␉␉node->Length = 4;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[0] = value & 0xff;␊
␉␉node->Buffer[1] = (value >> 8) & 0xff;␊
␉␉node->Buffer[2] = (value >> 16) & 0xff;␊
␉␉node->Buffer[3] = (value >> 24) & 0xff;␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_qword(struct aml_chunk* parent, unsigned long long value)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_QWORD;␊
␉␉node->Length = 8;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[0] = value & 0xff;␊
␉␉node->Buffer[1] = (value >> 8) & 0xff;␊
␉␉node->Buffer[2] = (value >> 16) & 0xff;␊
␉␉node->Buffer[3] = (value >> 24) & 0xff;␊
␉␉node->Buffer[4] = (value >> 32) & 0xff;␊
␉␉node->Buffer[5] = (value >> 40) & 0xff;␊
␉␉node->Buffer[6] = (value >> 48) & 0xff;␊
␉␉node->Buffer[7] = (value >> 56) & 0xff;␊
␉}␊
␉␊
␉return node;␊
}␊
␊
unsigned int aml_fill_simple_name(char* buffer, const char* name)␊
{␊
␉if (strlen(name) < 4) ␊
␉{␊
␉␉verbose("aml_fill_simple_name: simple name %s has incorrect lengh! Must be 4", name);␊
␉␉return 0;␊
␉}␊
␉␊
␉memcpy(buffer, name, 4);␊
␉return 4;␊
}␊
␊
unsigned int aml_fill_name(struct aml_chunk* node, const char* name)␊
{␊
␉if (!node) ␊
␉␉return 0;␊
␉␊
␉int len = strlen(name), offset = 0, count = len / 4;␊
␉␊
␉if ((len % 4) > 1 || count == 0) ␊
␉{␊
␉␉verbose("aml_fill_name: pathname %s has incorrect length! Must be 4, 8, 12, 16 etc.", name);␊
␉␉return 0;␊
␉}␊
␉␊
␉unsigned int root = 0;␊
␉␊
␉if ((len % 4) == 1 && name[0] == '\\')␊
␉␉root++;␊
␉␉␉␊
␉if (count == 1) ␊
␉{␊
␉␉node->Length = 4 + root;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉memcpy(node->Buffer, name, 4 + root);␊
␉␉return node->Length;␊
␉}␊
␉␊
␉if (count == 2) ␊
␉{␊
␉␉node->Length = 2 + 8;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[offset++] = 0x5c; // Root Char␊
␉␉node->Buffer[offset++] = 0x2e; // Double name␊
␉␉memcpy(node->Buffer+offset, name + root, 8);␊
␉␉return node->Length;␊
␉}␊
␉␊
␉node->Length = 3 + count*4;␊
␉node->Buffer = malloc(node->Length);␊
␉node->Buffer[offset++] = 0x5c; // Root Char␊
␉node->Buffer[offset++] = 0x2f; // Multi name␊
␉node->Buffer[offset++] = count; // Names count␊
␉memcpy(node->Buffer+offset, name + root, count*4);␊
␉␊
␉return node->Length;␊
}␊
␊
struct aml_chunk* aml_add_scope(struct aml_chunk* parent, const char* name)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node)␊
␉{␊
␉␉node->Type = AML_CHUNK_SCOPE;␊
␉␉␊
␉␉aml_fill_name(node, name);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_name(struct aml_chunk* parent, const char* name)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node)␊
␉{␊
␉␉node->Type = AML_CHUNK_NAME;␊
␉␉␊
␉␉aml_fill_name(node, name);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_package(struct aml_chunk* parent)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node)␊
␉{␊
␉␉node->Type = AML_CHUNK_PACKAGE;␊
␉␉␊
␉␉node->Length = 1;␊
␉␉node->Buffer = malloc(node->Length);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_alias(struct aml_chunk* parent, const char* name1, const char* name2)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node)␊
␉{␊
␉␉node->Type = AML_CHUNK_ALIAS;␊
␉␉␊
␉␉node->Length = 8;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉aml_fill_simple_name(node->Buffer, name1);␊
␉␉aml_fill_simple_name(node->Buffer+4, name2);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
unsigned char aml_get_size_length(unsigned int size)␊
{␊
␉if (size + 1 <= 0x3f)␊
␉␉return 1;␊
␉else if (size + 2 <= 0x3fff)␊
␉␉return 2;␊
␉else if (size + 3 <= 0x3fffff)␊
␉␉return 3;␊
␉␊
␉return 4;␊
}␊
␊
unsigned int aml_calculate_size(struct aml_chunk* node)␊
{␊
␉if (node)␊
␉{␊
␉␉node->Size = 0;␊
␉␉␊
␉␉// Calculate child nodes size␊
␉␉struct aml_chunk* child = node->First;␊
␉␉unsigned char child_count = 0;␊
␉␉␊
␉␉while (child) ␊
␉␉{␊
␉␉␉child_count++;␊
␉␉␉␊
␉␉␉node->Size += aml_calculate_size(child);␊
␉␉␉␊
␉␉␉child = child->Next;␊
␉␉}␊
␉␉␊
␉␉switch (node->Type) ␊
␉␉{␊
␉␉␉case AML_CHUNK_NONE:␊
␉␉␉␉node->Size += node->Length;␊
␉␉␉␉break;␊
␉␉␉case AML_CHUNK_SCOPE:␊
␉␉␉␉node->Size += 1 + node->Length;␊
␉␉␉␉node->Size += aml_get_size_length(node->Size);␊
␉␉␉␉break;␊
␉␉␉case AML_CHUNK_PACKAGE:␊
␉␉␉␉node->Buffer[0] = child_count;␊
␉␉␉␉node->Size += 1 + node->Length;␊
␉␉␉␉node->Size += aml_get_size_length(node->Size);␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉case AML_CHUNK_BYTE:␊
␉␉␉␉if (node->Buffer[0] == 0x0 || node->Buffer[0] == 0x1) ␊
␉␉␉␉{␊
␉␉␉␉␉node->Size += node->Length;␊
␉␉␉␉}␊
␉␉␉␉else ␊
␉␉␉␉{␊
␉␉␉␉␉node->Size += 1 + node->Length;␊
␉␉␉␉}␊
␉␉␉␉␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉case AML_CHUNK_WORD:␊
␉␉␉case AML_CHUNK_DWORD:␊
␉␉␉case AML_CHUNK_QWORD:␊
␉␉␉case AML_CHUNK_ALIAS:␊
␉␉␉case AML_CHUNK_NAME:␊
␉␉␉␉node->Size += 1 + node->Length;␊
␉␉␉␉break;␊
␉␉}␊
␉␉␊
␉␉return node->Size;␊
␉}␊
␉␊
␉return 0;␊
}␊
␊
unsigned int aml_write_byte(unsigned char value, char* buffer, unsigned int offset)␊
{␊
␉buffer[offset++] = value;␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_word(unsigned int value, char* buffer, unsigned int offset)␊
{␊
␉buffer[offset++] = value & 0xff;␊
␉buffer[offset++] = value >> 8;␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_dword(unsigned long value, char* buffer, unsigned int offset)␊
{␊
␉buffer[offset++] = value & 0xff;␊
␉buffer[offset++] = (value >> 8) & 0xff;␊
␉buffer[offset++] = (value >> 16) & 0xff;␊
␉buffer[offset++] = (value >> 24) & 0xff;␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_qword(unsigned long long value, char* buffer, unsigned int offset)␊
{␊
␉buffer[offset++] = value & 0xff;␊
␉buffer[offset++] = (value >> 8) & 0xff;␊
␉buffer[offset++] = (value >> 16) & 0xff;␊
␉buffer[offset++] = (value >> 24) & 0xff;␊
␉buffer[offset++] = (value >> 32) & 0xff;␊
␉buffer[offset++] = (value >> 40) & 0xff;␊
␉buffer[offset++] = (value >> 48) & 0xff;␊
␉buffer[offset++] = (value >> 56) & 0xff;␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_buffer(const char* value, unsigned int size, char* buffer, unsigned int offset)␊
{␊
␉if (size > 0)␊
␉{␊
␉␉memcpy(buffer + offset, value, size);␊
␉}␊
␉␊
␉return offset + size;␊
}␊
␊
unsigned int aml_write_size(unsigned int size, char* buffer, unsigned int offset)␊
{␊
␉if (size <= 0x3f)␊
␉{␊
␉␉buffer[offset++] = size;␊
␉}␊
␉else if (size <= 0x3fff) ␊
␉{␊
␉␉buffer[offset++] = 0x40 | (size & 0xf);␊
␉␉buffer[offset++] = (size >> 4) & 0xff;␊
␉}␊
␉else if (size <= 0x3fffff) ␊
␉{␊
␉␉buffer[offset++] = 0x80 | (size & 0xf);␊
␉␉buffer[offset++] = (size >> 4) & 0xff;␊
␉␉buffer[offset++] = (size >> 12) & 0xff;␊
␉}␊
else ␊
␉{␊
␉␉buffer[offset++] = 0xc0 | (size & 0xf);␊
␉␉buffer[offset++] = (size >> 4) & 0xff;␊
␉␉buffer[offset++] = (size >> 12) & 0xff;␊
␉␉buffer[offset++] = (size >> 20) & 0xff;␊
␉}␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_node(struct aml_chunk* node, char* buffer, unsigned int offset)␊
{␊
␉if (node && buffer) ␊
␉{␊
␉␉unsigned int old = offset;␊
␉␉␊
␉␉switch (node->Type) ␊
␉␉{␊
␉␉␉case AML_CHUNK_NONE:␊
␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉break;␊
␊
␉␉␉case AML_CHUNK_SCOPE:␊
␉␉␉case AML_CHUNK_PACKAGE:␊
␉␉␉␉offset = aml_write_byte(node->Type, buffer, offset);␊
␉␉␉␉offset = aml_write_size(node->Size-1, buffer, offset);␊
␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉case AML_CHUNK_BYTE:␊
␉␉␉␉if (node->Buffer[0] == 0x0 || node->Buffer[0] == 0x1) ␊
␉␉␉␉{␊
␉␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉}␊
␉␉␉␉else ␊
␉␉␉␉{␊
␉␉␉␉␉offset = aml_write_byte(node->Type, buffer, offset);␊
␉␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉}␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉case AML_CHUNK_WORD:␊
␉␉␉case AML_CHUNK_DWORD:␊
␉␉␉case AML_CHUNK_QWORD:␊
␉␉␉case AML_CHUNK_ALIAS:␊
␉␉␉case AML_CHUNK_NAME:␊
␉␉␉␉offset = aml_write_byte(node->Type, buffer, offset);␊
␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉default:␊
␉␉␉␉break;␊
␉␉}␊
␊
␉␉struct aml_chunk* child = node->First;␊
␉␉␊
␉␉while (child) ␊
␉␉{␊
␉␉␉offset = aml_write_node(child, buffer, offset);␊
␉␉␉␊
␉␉␉child = child->Next;␊
␉␉}␊
␉␉␊
␉␉if (offset - old != node->Size) ␊
␉␉␉verbose("Node size incorrect: 0x%x\n", node->Type);␊
␉}␊
␉␊
␉return offset;␊
}
branches/meklort/i386/libsaio/aml_generator.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/*␊
* aml_generator.h␊
* Chameleon␊
*␊
* Created by Mozodojo on 20/07/10.␊
* Copyright 2010 mozo. All rights reserved.␊
*␊
*/␊
␊
#ifndef __LIBSAIO_AML_GENERATOR_H␊
#define __LIBSAIO_AML_GENERATOR_H␊
␊
#include "libsaio.h"␊
␊
#define␉AML_CHUNK_NONE␉␉0xff␊
#define␉AML_CHUNK_ZERO␉␉0x00␊
#define␉AML_CHUNK_ONE␉␉0x01␊
#define␉AML_CHUNK_ALIAS␉␉0x06␊
#define␉AML_CHUNK_NAME␉␉0x08␊
#define␉AML_CHUNK_BYTE␉␉0x0A␊
#define␉AML_CHUNK_WORD␉␉0x0B␊
#define␉AML_CHUNK_DWORD␉␉0x0C␊
#define␉AML_CHUNK_STRING␉0x0D␊
#define␉AML_CHUNK_QWORD␉␉0x0E␊
#define␉AML_CHUNK_SCOPE␉␉0x10␊
#define␉AML_CHUNK_PACKAGE␉0x12␊
␊
struct aml_chunk ␊
{␊
␉unsigned char␉␉Type;␊
␉unsigned int␉␉Length;␊
␉char*␉␉␉␉Buffer;␊
␉␊
␉unsigned int␉␉Size;␊
␉␊
␉struct aml_chunk*␉Next;␊
␉struct aml_chunk*␉First;␊
␉struct aml_chunk*␉Last;␊
};␊
␊
static inline bool aml_isvalidchar(char c)␊
{␊
␉return isupper(c) || isdigit(c) || c == '_';␊
};␊
␊
bool aml_add_to_parent(struct aml_chunk* parent, struct aml_chunk* node);␊
struct aml_chunk* aml_create_node(struct aml_chunk* parent);␊
void aml_destroy_node(struct aml_chunk* node);␊
struct aml_chunk* aml_add_buffer(struct aml_chunk* parent, const char* buffer, unsigned int size);␊
struct aml_chunk* aml_add_byte(struct aml_chunk* parent, unsigned char value);␊
struct aml_chunk* aml_add_word(struct aml_chunk* parent, unsigned int value);␊
struct aml_chunk* aml_add_dword(struct aml_chunk* parent, unsigned long value);␊
struct aml_chunk* aml_add_qword(struct aml_chunk* parent, unsigned long long value);␊
struct aml_chunk* aml_add_scope(struct aml_chunk* parent, const char* name);␊
struct aml_chunk* aml_add_name(struct aml_chunk* parent, const char* name);␊
struct aml_chunk* aml_add_package(struct aml_chunk* parent);␊
struct aml_chunk* aml_add_alias(struct aml_chunk* parent, const char* name1, const char* name2);␊
unsigned int aml_calculate_size(struct aml_chunk* node);␊
unsigned int aml_write_node(struct aml_chunk* node, char* buffer, unsigned int offset);␊
␊
#endif /* !__LIBSAIO_AML_GENERATOR_H */
branches/meklort/i386/libsaio/Makefile
3939
4040
4141
42
42
4343
4444
4545
46
46
4747
4848
4949
␉ufs.o ufs_byteorder.o \␊
␉vbe.o nbp.o hfs.o hfs_compare.o \␊
␉xml.o ntfs.o msdos.o md5c.o device_tree.o \␊
␉cpu.o platform.o acpi_patcher.o \␊
␉cpu.o platform.o \␊
␉smbios_patcher.o fake_efi.o ext2fs.o \␊
␉hpet.o usb.o pci_setup.o \␊
␉device_inject.o pci_root.o \␊
␉convert.o aml_generator.o␊
␉convert.o␊
␊
␊
SAIO_EXTERN_OBJS = console.o␊
branches/meklort/i386/libsaio/smbios_patcher.c
2222
2323
2424
25
26
27
2528
2629
2730
#define DBG(x...)␊
#endif␊
␊
uint64_t smbios_p;␊
␊
␊
typedef struct {␊
const char* key;␊
const char* value;␊
branches/meklort/i386/libsaio/smbios_patcher.h
1111
1212
1313
14
15
16
1417
1518
1619
#include "libsaio.h"␊
#include "SMBIOS.h"␊
␊
extern uint64_t smbios_p;␊
␊
␊
/* From Foundation/Efi/Guid/Smbios/SmBios.h */␊
/* Modified to wrap Data4 array init with {} */␊
#define EFI_SMBIOS_TABLE_GUID {0xeb9d2d31, 0x2d88, 0x11d3, {0x9a, 0x16, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d}}␊
branches/meklort/i386/libsaio/pci_root.c
3131
3232
3333
34
34
3535
3636
3737
......
4545
4646
4747
48
4948
50
51
49
5250
5351
5452
......
5654
5755
5856
59
6057
6158
6259
6360
64
6561
6662
6763
6864
69
7065
7166
7267
73
7468
7569
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
11170
11271
11372
␉return 11;␊
}␊
␊
static unsigned int findpciroot(unsigned char * dsdt,int len)␊
unsigned int findpciroot(unsigned char * dsdt,int len)␊
{␊
␉int i;␊
␊
␊
int getPciRootUID(void)␊
{␊
␉void *new_dsdt;␊
␉const char *val;␊
␉int len,fsize;␊
␉const char * dsdt_filename=NULL;␊
␉int len;␊
␉extern int search_and_get_acpi_fd(const char *, const char **);␊
␊
␉if (rootuid < 10) return rootuid;␊
␊
␉if (getValueForKey(kPCIRootUID, &val, &len, &bootInfo->bootConfig)) {␊
␉␉if (isdigit(val[0])) rootuid = val[0] - '0';␊
␉␉goto out;␊
␉}␊
␉/* Chameleon compatibility */␊
␉else if (getValueForKey("PciRoot", &val, &len, &bootInfo->bootConfig)) {␊
␉␉if (isdigit(val[0])) rootuid = val[0] - '0';␊
␉␉goto out;␊
␉}␊
␉/* PCEFI compatibility */␊
␉else if (getValueForKey("-pci0", &val, &len, &bootInfo->bootConfig)) {␊
␉␉rootuid = 0;␊
␉␉goto out;␊
␉}␊
␉else if (getValueForKey("-pci1", &val, &len, &bootInfo->bootConfig)) {␊
␉␉rootuid = 1;␊
␉␉goto out;␊
␉}␊
␊
␉int fd = search_and_get_acpi_fd("DSDT.aml", &dsdt_filename);␊
␊
␉// Check booting partition␊
␉if (fd<0)␊
␉{␉ ␊
␉ verbose("No DSDT found, using 0 as uid value.\n");␊
␉ rootuid = 0;␊
␉ goto out;␊
␉}␊
␉␊
␉fsize = file_size(fd);␊
␊
␉if ((new_dsdt = malloc(fsize)) == NULL) {␊
␉␉verbose("[ERROR] alloc DSDT memory failed\n");␊
␉␉close (fd);␊
␉␉goto out;␊
␉}␊
␉if (read (fd, new_dsdt, fsize) != fsize) {␊
␉␉verbose("[ERROR] read %s failed\n", dsdt_filename);␊
␉␉close (fd);␊
␉␉goto out;␊
␉}␊
␉close (fd);␊
␊
␉rootuid = findpciroot(new_dsdt, fsize);␊
␉free(new_dsdt);␊
␊
␉// make sure it really works: ␊
␉if (rootuid == 11) rootuid=0; //usually when _UID isnt present, it means uid is zero␊
␉else if (rootuid < 0 || rootuid > 9) ␊
␉{␊
␉␉printf("PciRoot uid value wasnt found, using 0, if you want it to be 1, use -PciRootUID flag");␊
␉␉rootuid = 0;␊
␉}␊
out:␊
␉verbose("Using PCI-Root-UID value: %d\n", rootuid);␊
␉return rootuid;␊
}␊
branches/meklort/i386/libsaio/pci_root.h
99
1010
1111
12
1213
1314
␊
␊
extern int getPciRootUID(void);␊
unsigned int findpciroot(unsigned char * dsdt,int len);␊
␊
#endif /* !__LIBSAIO_DSDT_PATCHER_H */␊
branches/meklort/i386/libsaio/fake_efi.c
1111
1212
1313
14
1514
1615
1716
1817
1918
19
2020
2121
2222
......
672672
673673
674674
675
676
677675
678676
679677
......
713711
714712
715713
714
715
716
716717
717718
718719
#include "fake_efi.h"␊
#include "efi_tables.h"␊
#include "platform.h"␊
#include "acpi_patcher.h"␊
#include "smbios_patcher.h"␊
#include "device_inject.h"␊
#include "convert.h"␊
#include "pci.h"␊
#include "sl.h"␊
#include "modules.h"␊
␊
extern struct SMBEntryPoint * getSmbios(int which); // now cached␊
extern void setup_pci_devs(pci_dt_t *pci_dt);␊
␉smbios_p = (EFI_PTR32)getSmbios(SMBIOS_PATCHED);␊
␉addConfigurationTable(&gEfiSmbiosTableGuid, &smbios_p, NULL);␊
␉␊
␉// Setup ACPI with DSDT overrides (mackerintel's patch)␊
␉setupAcpi();␊
␉␊
␉// We've obviously changed the count.. so fix up the CRC32␊
␉if (archCpuType == CPU_TYPE_I386)␊
␉// Initialize the device tree␊
␉setupEfiDeviceTree();␊
␉␊
␉␊
␉execute_hook("setupEfiConfigurationTable", NULL, NULL, NULL, NULL);␊
␉␊
␉// Add configuration table entries to both the services table and the device tree␊
␉setupEfiConfigurationTable();␊
}␊
branches/meklort/i386/modules/ACPIPatcher/aml_generator.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
/*␊
* aml_generator.c␊
* Chameleon␊
*␊
* Created by Mozodojo on 20/07/10.␊
* Copyright 2010 mozo. All rights reserved.␊
*␊
*/␊
␊
#include "aml_generator.h"␊
␊
bool aml_add_to_parent(struct aml_chunk* parent, struct aml_chunk* node)␊
{␊
␉if (parent && node)␊
␉{␊
␉␉switch (parent->Type) ␊
␉␉{␊
␉␉␉case AML_CHUNK_NONE:␊
␉␉␉case AML_CHUNK_BYTE:␊
␉␉␉case AML_CHUNK_WORD:␊
␉␉␉case AML_CHUNK_DWORD:␊
␉␉␉case AML_CHUNK_QWORD:␊
␉␉␉case AML_CHUNK_ALIAS:␊
␉␉␉␉verbose("aml_add_to_parent: Node isn't supports child nodes!");␊
␉␉␉␉return FALSE;␊
␉␉␉case AML_CHUNK_NAME:␊
␉␉␉␉if (parent->First) ␊
␉␉␉␉{␊
␉␉␉␉␉verbose("aml_add_to_parent: Name node could have only one child node!");␊
␉␉␉␉␉return FALSE;␊
␉␉␉␉}␊
␉␉␉␉break;␊
␊
␉␉␉default:␊
␉␉␉␉break;␊
␉␉}␊
␉␉␊
␉␉if (!parent->First)␊
␉␉␉parent->First = node;␊
␉␉␊
␉␉if (parent->Last)␊
␉␉␉parent->Last->Next = node;␊
␉␉␊
␉␉parent->Last = node;␊
␉␉␊
␉␉return TRUE;␊
␉}␊
␉␊
␉return FALSE;␊
}␊
␊
struct aml_chunk* aml_create_node(struct aml_chunk* parent)␊
{␊
␉struct aml_chunk* node = (struct aml_chunk*)malloc(sizeof(struct aml_chunk));␊
␉␊
␉aml_add_to_parent(parent, node);␊
␉␊
␉return node;␊
}␊
␊
void aml_destroy_node(struct aml_chunk* node)␊
{␊
␉// Delete child nodes␊
␉struct aml_chunk* child = node->First;␊
␉␊
␉while (child) ␊
␉{␊
␉␉struct aml_chunk* next = child->Next;␊
␉␉␊
␉␉if (child->Buffer)␊
␉␉␉free(child->Buffer);␊
␉␉␊
␉␉free(child);␊
␉␉␊
␉␉child = next;␊
␉}␊
␉␊
␉// Free node␊
␉if (node->Buffer)␊
␉␉free(node->Buffer);␊
␉␊
␉free(node);␊
}␊
␊
struct aml_chunk* aml_add_buffer(struct aml_chunk* parent, const char* buffer, unsigned int size)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_NONE;␊
␉␉node->Length = size;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉memcpy(node->Buffer, buffer, node->Length);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_byte(struct aml_chunk* parent, unsigned char value)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_BYTE;␊
␉␉␊
␉␉node->Length = 1;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[0] = value;␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_word(struct aml_chunk* parent, unsigned int value)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_WORD;␊
␉␉node->Length = 2;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[0] = value & 0xff;␊
␉␉node->Buffer[1] = value >> 8;␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_dword(struct aml_chunk* parent, unsigned long value)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_DWORD;␊
␉␉node->Length = 4;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[0] = value & 0xff;␊
␉␉node->Buffer[1] = (value >> 8) & 0xff;␊
␉␉node->Buffer[2] = (value >> 16) & 0xff;␊
␉␉node->Buffer[3] = (value >> 24) & 0xff;␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_qword(struct aml_chunk* parent, unsigned long long value)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node) ␊
␉{␊
␉␉node->Type = AML_CHUNK_QWORD;␊
␉␉node->Length = 8;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[0] = value & 0xff;␊
␉␉node->Buffer[1] = (value >> 8) & 0xff;␊
␉␉node->Buffer[2] = (value >> 16) & 0xff;␊
␉␉node->Buffer[3] = (value >> 24) & 0xff;␊
␉␉node->Buffer[4] = (value >> 32) & 0xff;␊
␉␉node->Buffer[5] = (value >> 40) & 0xff;␊
␉␉node->Buffer[6] = (value >> 48) & 0xff;␊
␉␉node->Buffer[7] = (value >> 56) & 0xff;␊
␉}␊
␉␊
␉return node;␊
}␊
␊
unsigned int aml_fill_simple_name(char* buffer, const char* name)␊
{␊
␉if (strlen(name) < 4) ␊
␉{␊
␉␉verbose("aml_fill_simple_name: simple name %s has incorrect lengh! Must be 4", name);␊
␉␉return 0;␊
␉}␊
␉␊
␉memcpy(buffer, name, 4);␊
␉return 4;␊
}␊
␊
unsigned int aml_fill_name(struct aml_chunk* node, const char* name)␊
{␊
␉if (!node) ␊
␉␉return 0;␊
␉␊
␉int len = strlen(name), offset = 0, count = len / 4;␊
␉␊
␉if ((len % 4) > 1 || count == 0) ␊
␉{␊
␉␉verbose("aml_fill_name: pathname %s has incorrect length! Must be 4, 8, 12, 16 etc.", name);␊
␉␉return 0;␊
␉}␊
␉␊
␉unsigned int root = 0;␊
␉␊
␉if ((len % 4) == 1 && name[0] == '\\')␊
␉␉root++;␊
␉␉␉␊
␉if (count == 1) ␊
␉{␊
␉␉node->Length = 4 + root;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉memcpy(node->Buffer, name, 4 + root);␊
␉␉return node->Length;␊
␉}␊
␉␊
␉if (count == 2) ␊
␉{␊
␉␉node->Length = 2 + 8;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉node->Buffer[offset++] = 0x5c; // Root Char␊
␉␉node->Buffer[offset++] = 0x2e; // Double name␊
␉␉memcpy(node->Buffer+offset, name + root, 8);␊
␉␉return node->Length;␊
␉}␊
␉␊
␉node->Length = 3 + count*4;␊
␉node->Buffer = malloc(node->Length);␊
␉node->Buffer[offset++] = 0x5c; // Root Char␊
␉node->Buffer[offset++] = 0x2f; // Multi name␊
␉node->Buffer[offset++] = count; // Names count␊
␉memcpy(node->Buffer+offset, name + root, count*4);␊
␉␊
␉return node->Length;␊
}␊
␊
struct aml_chunk* aml_add_scope(struct aml_chunk* parent, const char* name)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node)␊
␉{␊
␉␉node->Type = AML_CHUNK_SCOPE;␊
␉␉␊
␉␉aml_fill_name(node, name);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_name(struct aml_chunk* parent, const char* name)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node)␊
␉{␊
␉␉node->Type = AML_CHUNK_NAME;␊
␉␉␊
␉␉aml_fill_name(node, name);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_package(struct aml_chunk* parent)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node)␊
␉{␊
␉␉node->Type = AML_CHUNK_PACKAGE;␊
␉␉␊
␉␉node->Length = 1;␊
␉␉node->Buffer = malloc(node->Length);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
struct aml_chunk* aml_add_alias(struct aml_chunk* parent, const char* name1, const char* name2)␊
{␊
␉struct aml_chunk* node = aml_create_node(parent);␊
␉␊
␉if (node)␊
␉{␊
␉␉node->Type = AML_CHUNK_ALIAS;␊
␉␉␊
␉␉node->Length = 8;␊
␉␉node->Buffer = malloc(node->Length);␊
␉␉aml_fill_simple_name(node->Buffer, name1);␊
␉␉aml_fill_simple_name(node->Buffer+4, name2);␊
␉}␊
␉␊
␉return node;␊
}␊
␊
unsigned char aml_get_size_length(unsigned int size)␊
{␊
␉if (size + 1 <= 0x3f)␊
␉␉return 1;␊
␉else if (size + 2 <= 0x3fff)␊
␉␉return 2;␊
␉else if (size + 3 <= 0x3fffff)␊
␉␉return 3;␊
␉␊
␉return 4;␊
}␊
␊
unsigned int aml_calculate_size(struct aml_chunk* node)␊
{␊
␉if (node)␊
␉{␊
␉␉node->Size = 0;␊
␉␉␊
␉␉// Calculate child nodes size␊
␉␉struct aml_chunk* child = node->First;␊
␉␉unsigned char child_count = 0;␊
␉␉␊
␉␉while (child) ␊
␉␉{␊
␉␉␉child_count++;␊
␉␉␉␊
␉␉␉node->Size += aml_calculate_size(child);␊
␉␉␉␊
␉␉␉child = child->Next;␊
␉␉}␊
␉␉␊
␉␉switch (node->Type) ␊
␉␉{␊
␉␉␉case AML_CHUNK_NONE:␊
␉␉␉␉node->Size += node->Length;␊
␉␉␉␉break;␊
␉␉␉case AML_CHUNK_SCOPE:␊
␉␉␉␉node->Size += 1 + node->Length;␊
␉␉␉␉node->Size += aml_get_size_length(node->Size);␊
␉␉␉␉break;␊
␉␉␉case AML_CHUNK_PACKAGE:␊
␉␉␉␉node->Buffer[0] = child_count;␊
␉␉␉␉node->Size += 1 + node->Length;␊
␉␉␉␉node->Size += aml_get_size_length(node->Size);␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉case AML_CHUNK_BYTE:␊
␉␉␉␉if (node->Buffer[0] == 0x0 || node->Buffer[0] == 0x1) ␊
␉␉␉␉{␊
␉␉␉␉␉node->Size += node->Length;␊
␉␉␉␉}␊
␉␉␉␉else ␊
␉␉␉␉{␊
␉␉␉␉␉node->Size += 1 + node->Length;␊
␉␉␉␉}␊
␉␉␉␉␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉case AML_CHUNK_WORD:␊
␉␉␉case AML_CHUNK_DWORD:␊
␉␉␉case AML_CHUNK_QWORD:␊
␉␉␉case AML_CHUNK_ALIAS:␊
␉␉␉case AML_CHUNK_NAME:␊
␉␉␉␉node->Size += 1 + node->Length;␊
␉␉␉␉break;␊
␉␉}␊
␉␉␊
␉␉return node->Size;␊
␉}␊
␉␊
␉return 0;␊
}␊
␊
unsigned int aml_write_byte(unsigned char value, char* buffer, unsigned int offset)␊
{␊
␉buffer[offset++] = value;␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_word(unsigned int value, char* buffer, unsigned int offset)␊
{␊
␉buffer[offset++] = value & 0xff;␊
␉buffer[offset++] = value >> 8;␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_dword(unsigned long value, char* buffer, unsigned int offset)␊
{␊
␉buffer[offset++] = value & 0xff;␊
␉buffer[offset++] = (value >> 8) & 0xff;␊
␉buffer[offset++] = (value >> 16) & 0xff;␊
␉buffer[offset++] = (value >> 24) & 0xff;␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_qword(unsigned long long value, char* buffer, unsigned int offset)␊
{␊
␉buffer[offset++] = value & 0xff;␊
␉buffer[offset++] = (value >> 8) & 0xff;␊
␉buffer[offset++] = (value >> 16) & 0xff;␊
␉buffer[offset++] = (value >> 24) & 0xff;␊
␉buffer[offset++] = (value >> 32) & 0xff;␊
␉buffer[offset++] = (value >> 40) & 0xff;␊
␉buffer[offset++] = (value >> 48) & 0xff;␊
␉buffer[offset++] = (value >> 56) & 0xff;␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_buffer(const char* value, unsigned int size, char* buffer, unsigned int offset)␊
{␊
␉if (size > 0)␊
␉{␊
␉␉memcpy(buffer + offset, value, size);␊
␉}␊
␉␊
␉return offset + size;␊
}␊
␊
unsigned int aml_write_size(unsigned int size, char* buffer, unsigned int offset)␊
{␊
␉if (size <= 0x3f)␊
␉{␊
␉␉buffer[offset++] = size;␊
␉}␊
␉else if (size <= 0x3fff) ␊
␉{␊
␉␉buffer[offset++] = 0x40 | (size & 0xf);␊
␉␉buffer[offset++] = (size >> 4) & 0xff;␊
␉}␊
␉else if (size <= 0x3fffff) ␊
␉{␊
␉␉buffer[offset++] = 0x80 | (size & 0xf);␊
␉␉buffer[offset++] = (size >> 4) & 0xff;␊
␉␉buffer[offset++] = (size >> 12) & 0xff;␊
␉}␊
else ␊
␉{␊
␉␉buffer[offset++] = 0xc0 | (size & 0xf);␊
␉␉buffer[offset++] = (size >> 4) & 0xff;␊
␉␉buffer[offset++] = (size >> 12) & 0xff;␊
␉␉buffer[offset++] = (size >> 20) & 0xff;␊
␉}␊
␉␊
␉return offset;␊
}␊
␊
unsigned int aml_write_node(struct aml_chunk* node, char* buffer, unsigned int offset)␊
{␊
␉if (node && buffer) ␊
␉{␊
␉␉unsigned int old = offset;␊
␉␉␊
␉␉switch (node->Type) ␊
␉␉{␊
␉␉␉case AML_CHUNK_NONE:␊
␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉break;␊
␊
␉␉␉case AML_CHUNK_SCOPE:␊
␉␉␉case AML_CHUNK_PACKAGE:␊
␉␉␉␉offset = aml_write_byte(node->Type, buffer, offset);␊
␉␉␉␉offset = aml_write_size(node->Size-1, buffer, offset);␊
␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉case AML_CHUNK_BYTE:␊
␉␉␉␉if (node->Buffer[0] == 0x0 || node->Buffer[0] == 0x1) ␊
␉␉␉␉{␊
␉␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉}␊
␉␉␉␉else ␊
␉␉␉␉{␊
␉␉␉␉␉offset = aml_write_byte(node->Type, buffer, offset);␊
␉␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉}␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉case AML_CHUNK_WORD:␊
␉␉␉case AML_CHUNK_DWORD:␊
␉␉␉case AML_CHUNK_QWORD:␊
␉␉␉case AML_CHUNK_ALIAS:␊
␉␉␉case AML_CHUNK_NAME:␊
␉␉␉␉offset = aml_write_byte(node->Type, buffer, offset);␊
␉␉␉␉offset = aml_write_buffer(node->Buffer, node->Length, buffer, offset);␊
␉␉␉␉break;␊
␉␉␉␉␊
␉␉␉default:␊
␉␉␉␉break;␊
␉␉}␊
␊
␉␉struct aml_chunk* child = node->First;␊
␉␉␊
␉␉while (child) ␊
␉␉{␊
␉␉␉offset = aml_write_node(child, buffer, offset);␊
␉␉␉␊
␉␉␉child = child->Next;␊
␉␉}␊
␉␉␊
␉␉if (offset - old != node->Size) ␊
␉␉␉verbose("Node size incorrect: 0x%x\n", node->Type);␊
␉}␊
␉␊
␉return offset;␊
}
branches/meklort/i386/modules/ACPIPatcher/acpi_patcher.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
/*␊
* Copyright 2008 mackerintel␊
*/␊
␊
#include "libsaio.h"␊
#include "boot.h"␊
#include "bootstruct.h"␊
#include "acpi.h"␊
#include "efi_tables.h"␊
#include "fake_efi.h"␊
#include "acpi_patcher.h"␊
#include "platform.h"␊
#include "cpu.h"␊
#include "aml_generator.h"␊
␊
#ifndef DEBUG_ACPI␊
#define DEBUG_ACPI 0␊
#endif␊
␊
#if DEBUG_ACPI==2␊
#define DBG(x...) {printf(x); sleep(1);}␊
#elif DEBUG_ACPI==1␊
#define DBG(x...) printf(x)␊
#else␊
#define DBG(x...)␊
#endif␊
␊
uint64_t acpi10_p;␊
uint64_t acpi20_p;␊
␊
␊
// Slice: New signature compare function␊
boolean_t tableSign(char *table, const char *sgn)␊
{␊
␉int i;␊
␉for (i=0; i<4; i++) {␊
␉␉if ((table[i] &~0x20) != (sgn[i] &~0x20)) {␊
␉␉␉return false;␊
␉␉}␊
␉}␊
␉return true;␊
}␊
␊
/* Gets the ACPI 1.0 RSDP address */␊
static struct acpi_2_rsdp* getAddressOfAcpiTable()␊
{␊
/* TODO: Before searching the BIOS space we are supposed to search the first 1K of the EBDA */␊
␉␊
void *acpi_addr = (void*)ACPI_RANGE_START;␊
for(; acpi_addr <= (void*)ACPI_RANGE_END; acpi_addr += 16)␊
{␊
if(*(uint64_t *)acpi_addr == ACPI_SIGNATURE_UINT64_LE)␊
{␊
uint8_t csum = checksum8(acpi_addr, 20);␊
if(csum == 0)␊
{␊
// Only return the table if it is a true version 1.0 table (Revision 0)␊
if(((struct acpi_2_rsdp*)acpi_addr)->Revision == 0)␊
return acpi_addr;␊
}␊
}␊
}␊
return NULL;␊
}␊
␊
/* Gets the ACPI 2.0 RSDP address */␊
static struct acpi_2_rsdp* getAddressOfAcpi20Table()␊
{␊
/* TODO: Before searching the BIOS space we are supposed to search the first 1K of the EBDA */␊
␉␊
void *acpi_addr = (void*)ACPI_RANGE_START;␊
for(; acpi_addr <= (void*)ACPI_RANGE_END; acpi_addr += 16)␊
{␊
if(*(uint64_t *)acpi_addr == ACPI_SIGNATURE_UINT64_LE)␊
{␊
uint8_t csum = checksum8(acpi_addr, 20);␊
␉␉␉␊
/* Only assume this is a 2.0 or better table if the revision is greater than 0␊
* NOTE: ACPI 3.0 spec only seems to say that 1.0 tables have revision 1␊
* and that the current revision is 2.. I am going to assume that rev > 0 is 2.0.␊
*/␊
␉␉␉␊
if(csum == 0 && (((struct acpi_2_rsdp*)acpi_addr)->Revision > 0))␊
{␊
uint8_t csum2 = checksum8(acpi_addr, sizeof(struct acpi_2_rsdp));␊
if(csum2 == 0)␊
return acpi_addr;␊
}␊
}␊
}␊
return NULL;␊
}␊
/** The folowing ACPI Table search algo. should be reused anywhere needed:*/␊
int search_and_get_acpi_fd(const char * filename, const char ** outDirspec)␊
{␊
␉int fd = 0;␊
␉char dirSpec[512] = "";␊
␉␊
␉// Try finding 'filename' in the usual places␊
␉// Start searching any potential location for ACPI Table␊
␉sprintf(dirSpec, "%s", filename); ␊
␉fd = open(dirSpec, 0);␊
␉if (fd < 0)␊
␉{␉␊
␉␉sprintf(dirSpec, "/Extra/%s", filename); ␊
␉␉fd = open(dirSpec, 0);␊
␉␉if (fd < 0)␊
␉␉{␊
␉␉␉sprintf(dirSpec, "bt(0,0)/Extra/%s", filename);␊
␉␉␉fd = open(dirSpec, 0);␊
␉␉}␊
␉}␊
␊
␉if (fd < 0)␊
␉{␊
␉␉// NOT FOUND:␊
␉␉verbose("ACPI table not found: %s\n", filename);␊
␉␉*dirSpec = '\0';␊
␉}␊
␊
␉if (outDirspec) *outDirspec = dirSpec; ␊
␉return fd;␊
}␊
␊
␊
void *loadACPITable (const char * filename)␊
{␊
␉void *tableAddr;␊
␉const char * dirspec=NULL;␊
␉␊
␉int fd = search_and_get_acpi_fd(filename, &dirspec);␊
␉␊
␉if (fd>=0)␊
␉{␊
␉␉tableAddr=(void*)AllocateKernelMemory(file_size (fd));␊
␉␉if (tableAddr)␊
␉␉{␊
␉␉␉if (read (fd, tableAddr, file_size (fd))!=file_size (fd))␊
␉␉␉{␊
␉␉␉␉printf("Couldn't read table %s\n",dirspec);␊
␉␉␉␉free (tableAddr);␊
␉␉␉␉close (fd);␊
␉␉␉␉return NULL;␊
␉␉␉}␊
␉␉␉␊
␉␉␉DBG("Table %s read and stored at: %x\n", dirspec, tableAddr);␊
␉␉␉close (fd);␊
␉␉␉return tableAddr;␊
␉␉}␊
␉␉close (fd);␊
␉␉printf("Couldn't allocate memory for table \n", dirspec);␊
␉} ␊
␉//printf("Couldn't find table %s\n", filename);␊
␉return NULL;␊
}␊
␊
uint8_t␉acpi_cpu_count = 0;␊
char* acpi_cpu_name[32];␊
␊
void get_acpi_cpu_names(unsigned char* dsdt, uint32_t length)␊
{␊
␉uint32_t i;␊
␉␊
␉for (i=0; i<length-7; i++) ␊
␉{␊
␉␉if (dsdt[i] == 0x5B && dsdt[i+1] == 0x83) // ProcessorOP␊
␉␉{␊
␉␉␉uint32_t offset = i + 3 + (dsdt[i+2] >> 6);␊
␉␉␉␊
␉␉␉bool add_name = true;␊
␊
␉␉␉uint8_t j;␊
␉␉␉␊
␉␉␉for (j=0; j<4; j++) ␊
␉␉␉{␊
␉␉␉␉char c = dsdt[offset+j];␊
␉␉␉␉␊
␉␉␉␉if (!aml_isvalidchar(c)) ␊
␉␉␉␉{␊
␉␉␉␉␉add_name = false;␊
␉␉␉␉␉verbose("Invalid character found in ProcessorOP 0x%x!\n", c);␊
␉␉␉␉␉break;␊
␉␉␉␉}␊
␉␉␉}␊
␉␉␉␊
␉␉␉if (add_name) ␊
␉␉␉{␊
␉␉␉␉acpi_cpu_name[acpi_cpu_count] = malloc(4);␊
␉␉␉␉memcpy(acpi_cpu_name[acpi_cpu_count], dsdt+offset, 4);␊
␉␉␉␉i = offset + 5;␊
␉␉␉␉␊
␉␉␉␉verbose("Found ACPI CPU: %c%c%c%c\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]);␊
␉␉␉␉␊
␉␉␉␉if (++acpi_cpu_count == 32) return;␊
␉␉␉}␊
␉␉}␊
␉}␊
}␊
␊
struct acpi_2_ssdt *generate_cst_ssdt(struct acpi_2_fadt* fadt)␊
{␊
␉char ssdt_header[] =␊
␉{␊
␉␉0x53, 0x53, 0x44, 0x54, 0xE7, 0x00, 0x00, 0x00, /* SSDT.... */␊
␉␉0x01, 0x17, 0x50, 0x6D, 0x52, 0x65, 0x66, 0x41, /* ..PmRefA */␊
␉␉0x43, 0x70, 0x75, 0x43, 0x73, 0x74, 0x00, 0x00, /* CpuCst.. */␊
␉␉0x00, 0x10, 0x00, 0x00, 0x49, 0x4E, 0x54, 0x4C, /* ....INTL */␊
␉␉0x31, 0x03, 0x10, 0x20 ␉␉␉␉␉␉␉/* 1.._␉␉*/␊
␉};␊
␉␊
␉char cstate_resource_template[] = ␊
␉{␊
␉␉0x11, 0x14, 0x0A, 0x11, 0x82, 0x0C, 0x00, 0x7F, ␊
␉␉0x01, 0x02, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, ␊
␉␉0x00, 0x00, 0x00, 0x79, 0x00␊
␉};␊
␊
␉if (Platform.CPU.Vendor != 0x756E6547) {␊
␉␉verbose ("Not an Intel platform: C-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉if (fadt == NULL) {␊
␉␉verbose ("FACP not exists: C-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉struct acpi_2_dsdt* dsdt = (void*)fadt->DSDT;␊
␉␊
␉if (dsdt == NULL) {␊
␉␉verbose ("DSDT not found: C-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉if (acpi_cpu_count == 0) ␊
␉␉get_acpi_cpu_names((void*)dsdt, dsdt->Length);␊
␉␊
␉if (acpi_cpu_count > 0) ␊
␉{␊
␉␉bool c2_enabled = fadt->C2_Latency < 100;␊
␉␉bool c3_enabled = fadt->C3_Latency < 1000;␊
␉␉bool c4_enabled = false;␊
␉␉␊
␉␉getBoolForKey(kEnableC4States, &c4_enabled, &bootInfo->bootConfig);␊
␊
␉␉unsigned char cstates_count = 1 + (c2_enabled ? 1 : 0) + (c3_enabled ? 1 : 0);␊
␉␉␊
␉␉struct aml_chunk* root = aml_create_node(NULL);␊
␉␉␉aml_add_buffer(root, ssdt_header, sizeof(ssdt_header)); // SSDT header␊
␉␉␉struct aml_chunk* scop = aml_add_scope(root, "\\_PR_");␊
␉␉␉␉struct aml_chunk* name = aml_add_name(scop, "CST_");␊
␉␉␉␉␉struct aml_chunk* pack = aml_add_package(name);␊
␉␉␉␉␉␉aml_add_byte(pack, cstates_count);␊
␉␉␊
␉␉␉␉␉␉struct aml_chunk* tmpl = aml_add_package(pack);␊
␉␉␉␉␉␉␉cstate_resource_template[11] = 0x00; // C1␊
␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x01); // C1␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x01); // Latency␊
␉␉␉␉␉␉␉aml_add_word(tmpl, 0x03e8); // Power␊
␊
␉␉␉␉␉␉// C2␊
␉␉␉␉␉␉if (c2_enabled) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉tmpl = aml_add_package(pack);␊
␉␉␉␉␉␉␉␉cstate_resource_template[11] = 0x10; // C2␊
␉␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊
␉␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x02); // C2␊
␉␉␉␉␉␉␉␉aml_add_byte(tmpl, fadt->C2_Latency);␊
␉␉␉␉␉␉␉␉aml_add_word(tmpl, 0x01f4); // Power␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉// C4␊
␉␉␉␉␉␉if (c4_enabled) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉tmpl = aml_add_package(pack);␊
␉␉␉␉␉␉␉cstate_resource_template[11] = 0x30; // C4␊
␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x04); // C4␊
␉␉␉␉␉␉␉aml_add_word(tmpl, fadt->C3_Latency / 2); // TODO: right latency for C4␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0xfa); // Power␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉else␊
␉␉␉␉␉␉// C3␊
␉␉␉␉␉␉if (c3_enabled) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉tmpl = aml_add_package(pack);␊
␉␉␉␉␉␉␉cstate_resource_template[11] = 0x20; // C3␊
␉␉␉␉␉␉␉aml_add_buffer(tmpl, cstate_resource_template, sizeof(cstate_resource_template));␊
␉␉␉␉␉␉␉aml_add_byte(tmpl, 0x03); // C3␊
␉␉␉␉␉␉␉aml_add_word(tmpl, fadt->C3_Latency);␊
␉␉␉␉␉␉␉aml_add_word(tmpl, 0x015e); // Power␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␊
␉␉␉// Aliaces␊
␉␉␉int i;␊
␉␉␉for (i = 0; i < acpi_cpu_count; i++) ␊
␉␉␉{␊
␉␉␉␉char name[9];␊
␉␉␉␉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]);␊
␉␉␉␉␊
␉␉␉␉scop = aml_add_scope(root, name);␊
␉␉␉␉␉aml_add_alias(scop, "CST_", "_CST");␊
␉␉␉}␊
␉␉␊
␉␉aml_calculate_size(root);␊
␉␉␊
␉␉struct acpi_2_ssdt *ssdt = (struct acpi_2_ssdt *)AllocateKernelMemory(root->Size);␊
␉␊
␉␉aml_write_node(root, (void*)ssdt, 0);␊
␉␉␊
␉␉ssdt->Length = root->Size;␊
␉␉ssdt->Checksum = 0;␊
␉␉ssdt->Checksum = 256 - checksum8(ssdt, ssdt->Length);␊
␉␉␊
␉␉aml_destroy_node(root);␊
␉␉␊
␉␉//dumpPhysAddr("C-States SSDT content: ", ssdt, ssdt->Length);␊
␉␉␉␉␊
␉␉verbose ("SSDT with CPU C-States generated successfully\n");␊
␉␉␊
␉␉return ssdt;␊
␉}␊
␉else ␊
␉{␊
␉␉verbose ("ACPI CPUs not found: C-States not generated !!!\n");␊
␉}␊
␊
␉return NULL;␊
}␊
␊
struct acpi_2_ssdt *generate_pss_ssdt(struct acpi_2_dsdt* dsdt)␊
{␉␊
␉char ssdt_header[] =␊
␉{␊
␉␉0x53, 0x53, 0x44, 0x54, 0x7E, 0x00, 0x00, 0x00, /* SSDT.... */␊
␉␉0x01, 0x6A, 0x50, 0x6D, 0x52, 0x65, 0x66, 0x00, /* ..PmRef. */␊
␉␉0x43, 0x70, 0x75, 0x50, 0x6D, 0x00, 0x00, 0x00, /* CpuPm... */␊
␉␉0x00, 0x30, 0x00, 0x00, 0x49, 0x4E, 0x54, 0x4C, /* .0..INTL */␊
␉␉0x31, 0x03, 0x10, 0x20,␉␉␉␉␉␉␉/* 1.._␉␉*/␊
␉};␊
␉␊
␉if (Platform.CPU.Vendor != 0x756E6547) {␊
␉␉verbose ("Not an Intel platform: P-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉if (!(Platform.CPU.Features & CPU_FEATURE_MSR)) {␊
␉␉verbose ("Unsupported CPU: P-States will not be generated !!!\n");␊
␉␉return NULL;␊
␉}␊
␉␊
␉if (acpi_cpu_count == 0) ␊
␉␉get_acpi_cpu_names((void*)dsdt, dsdt->Length);␊
␉␊
␉if (acpi_cpu_count > 0) ␊
␉{␊
␉␉struct p_state initial, maximum, minimum, p_states[32];␊
␉␉uint8_t p_states_count = 0;␉␉␊
␉␉␊
␉␉// Retrieving P-States, ported from code by superhai (c)␊
␉␉switch (Platform.CPU.Family) {␊
␉␉␉case 0x06: ␊
␉␉␉{␊
␉␉␉␉switch (Platform.CPU.Model) ␊
␉␉␉␉{␊
␉␉␉␉␉case 0x0D: // ?␊
␉␉␉␉␉case CPU_MODEL_YONAH: // Yonah␊
␉␉␉␉␉case CPU_MODEL_MEROM: // Merom␊
␉␉␉␉␉case CPU_MODEL_PENRYN: // Penryn␊
␉␉␉␉␉case CPU_MODEL_ATOM: // Intel Atom (45nm)␊
␉␉␉␉␉{␊
␉␉␉␉␉␉bool cpu_dynamic_fsb = false;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (rdmsr64(MSR_IA32_EXT_CONFIG) & (1 << 27)) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉wrmsr64(MSR_IA32_EXT_CONFIG, (rdmsr64(MSR_IA32_EXT_CONFIG) | (1 << 28))); ␊
␉␉␉␉␉␉␉delay(1);␊
␉␉␉␉␉␉␉cpu_dynamic_fsb = rdmsr64(MSR_IA32_EXT_CONFIG) & (1 << 28);␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉bool cpu_noninteger_bus_ratio = (rdmsr64(MSR_IA32_PERF_STATUS) & (1ULL << 46));␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉initial.Control = rdmsr64(MSR_IA32_PERF_STATUS);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉maximum.Control = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 32) & 0x1F3F) | (0x4000 * cpu_noninteger_bus_ratio);␊
␉␉␉␉␉␉maximum.CID = ((maximum.FID & 0x1F) << 1) | cpu_noninteger_bus_ratio;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉minimum.FID = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 24) & 0x1F) | (0x80 * cpu_dynamic_fsb);␊
␉␉␉␉␉␉minimum.VID = ((rdmsr64(MSR_IA32_PERF_STATUS) >> 48) & 0x3F);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (minimum.FID == 0) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉uint64_t msr;␊
␉␉␉␉␉␉␉uint8_t i;␊
␉␉␉␉␉␉␉// Probe for lowest fid␊
␉␉␉␉␉␉␉for (i = maximum.FID; i >= 0x6; i--) ␊
␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉msr = rdmsr64(MSR_IA32_PERF_CONTROL);␊
␉␉␉␉␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (msr & 0xFFFFFFFFFFFF0000ULL) | (i << 8) | minimum.VID);␊
␉␉␉␉␉␉␉␉intel_waitforsts();␊
␉␉␉␉␉␉␉␉minimum.FID = (rdmsr64(MSR_IA32_PERF_STATUS) >> 8) & 0x1F; ␊
␉␉␉␉␉␉␉␉delay(1);␊
␉␉␉␉␉␉␉}␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉msr = rdmsr64(MSR_IA32_PERF_CONTROL);␊
␉␉␉␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (msr & 0xFFFFFFFFFFFF0000ULL) | (maximum.FID << 8) | maximum.VID);␊
␉␉␉␉␉␉␉intel_waitforsts();␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (minimum.VID == maximum.VID) ␊
␉␉␉␉␉␉{␉␊
␉␉␉␉␉␉␉uint64_t msr;␊
␉␉␉␉␉␉␉uint8_t i;␊
␉␉␉␉␉␉␉// Probe for lowest vid␊
␉␉␉␉␉␉␉for (i = maximum.VID; i > 0xA; i--) ␊
␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉msr = rdmsr64(MSR_IA32_PERF_CONTROL);␊
␉␉␉␉␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (msr & 0xFFFFFFFFFFFF0000ULL) | (minimum.FID << 8) | i);␊
␉␉␉␉␉␉␉␉intel_waitforsts();␊
␉␉␉␉␉␉␉␉minimum.VID = rdmsr64(MSR_IA32_PERF_STATUS) & 0x3F; ␊
␉␉␉␉␉␉␉␉delay(1);␊
␉␉␉␉␉␉␉}␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉msr = rdmsr64(MSR_IA32_PERF_CONTROL);␊
␉␉␉␉␉␉␉wrmsr64(MSR_IA32_PERF_CONTROL, (msr & 0xFFFFFFFFFFFF0000ULL) | (maximum.FID << 8) | maximum.VID);␊
␉␉␉␉␉␉␉intel_waitforsts();␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉minimum.CID = ((minimum.FID & 0x1F) << 1) >> cpu_dynamic_fsb;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉// Sanity check␊
␉␉␉␉␉␉if (maximum.CID < minimum.CID) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉DBG("Insane FID values!");␊
␉␉␉␉␉␉␉p_states_count = 1;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉else␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉// Finalize P-States␊
␉␉␉␉␉␉␉// Find how many P-States machine supports␊
␉␉␉␉␉␉␉p_states_count = maximum.CID - minimum.CID + 1;␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉if (p_states_count > 32) ␊
␉␉␉␉␉␉␉␉p_states_count = 32;␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉uint8_t vidstep;␊
␉␉␉␉␉␉␉uint8_t i = 0, u, invalid = 0;␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉vidstep = ((maximum.VID << 2) - (minimum.VID << 2)) / (p_states_count - 1);␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉for (u = 0; u < p_states_count; u++) ␊
␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉i = u - invalid;␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉p_states[i].CID = maximum.CID - u;␊
␉␉␉␉␉␉␉␉p_states[i].FID = (p_states[i].CID >> 1);␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉if (p_states[i].FID < 0x6) ␊
␉␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉␉if (cpu_dynamic_fsb) ␊
␉␉␉␉␉␉␉␉␉␉p_states[i].FID = (p_states[i].FID << 1) | 0x80;␊
␉␉␉␉␉␉␉␉} ␊
␉␉␉␉␉␉␉␉else if (cpu_noninteger_bus_ratio) ␊
␉␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉␉p_states[i].FID = p_states[i].FID | (0x40 * (p_states[i].CID & 0x1));␊
␉␉␉␉␉␉␉␉}␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉if (i && p_states[i].FID == p_states[i-1].FID)␊
␉␉␉␉␉␉␉␉␉invalid++;␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉p_states[i].VID = ((maximum.VID << 2) - (vidstep * u)) >> 2;␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉uint32_t multiplier = p_states[i].FID & 0x1f;␉␉// = 0x08␊
␉␉␉␉␉␉␉␉bool half = p_states[i].FID & 0x40;␉␉␉␉␉// = 0x01␊
␉␉␉␉␉␉␉␉bool dfsb = p_states[i].FID & 0x80;␉␉␉␉␉// = 0x00␊
␉␉␉␉␉␉␉␉uint32_t fsb = Platform.CPU.FSBFrequency / 1000000; // = 400␊
␉␉␉␉␉␉␉␉uint32_t halffsb = (fsb + 1) >> 1;␉␉␉␉␉// = 200␊
␉␉␉␉␉␉␉␉uint32_t frequency = (multiplier * fsb);␉␉␉// = 3200␊
␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉p_states[i].Frequency = (frequency + (half * halffsb)) >> dfsb;␉// = 3200 + 200 = 3400␊
␉␉␉␉␉␉␉}␊
␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉p_states_count -= invalid;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉} break;␊
␉␉␉␉␉case CPU_MODEL_FIELDS:␊
␉␉␉␉␉case CPU_MODEL_DALES:␊
␉␉␉␉␉case CPU_MODEL_DALES_32NM:␊
␉␉␉␉␉case CPU_MODEL_NEHALEM: ␊
␉␉␉␉␉case CPU_MODEL_NEHALEM_EX:␊
␉␉␉␉␉case CPU_MODEL_WESTMERE:␊
␉␉␉␉␉case CPU_MODEL_WESTMERE_EX:␊
␉␉␉␉␉default:␊
␉␉␉␉␉␉verbose ("Unsupported CPU: P-States not generated !!!\n");␊
␉␉␉␉␉␉break;␊
␉␉␉␉}␊
␉␉␉}␊
␉␉}␊
␉␉␊
␉␉// Generating SSDT␊
␉␉if (p_states_count > 0) ␊
␉␉{␉␊
␉␉␉int i;␊
␉␉␉␊
␉␉␉struct aml_chunk* root = aml_create_node(NULL);␊
␉␉␉␉aml_add_buffer(root, ssdt_header, sizeof(ssdt_header)); // SSDT header␊
␉␉␉␉␉struct aml_chunk* scop = aml_add_scope(root, "\\_PR_");␊
␉␉␉␉␉␉struct aml_chunk* name = aml_add_name(scop, "PSS_");␊
␉␉␉␉␉␉␉struct aml_chunk* pack = aml_add_package(name);␊
␉␉␉␊
␉␉␉␉␉␉␉␉for (i = 0; i < p_states_count; i++) ␊
␉␉␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉␉␉struct aml_chunk* pstt = aml_add_package(pack);␊
␉␉␉␉␉␉␉␉␉␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, p_states[i].Frequency);␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x00000000); // Power␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x0000000A); // Latency␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, 0x0000000A); // Latency␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, p_states[i].Control);␊
␉␉␉␉␉␉␉␉␉aml_add_dword(pstt, i+1); // Status␊
␉␉␉␉␉␉␉␉}␊
␉␉␉␉␊
␉␉␉// Add aliaces␊
␉␉␉for (i = 0; i < acpi_cpu_count; i++) ␊
␉␉␉{␊
␉␉␉␉char name[9];␊
␉␉␉␉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]);␊
␉␉␉␉␊
␉␉␉␉scop = aml_add_scope(root, name);␊
␉␉␉␉aml_add_alias(scop, "PSS_", "_PSS");␊
␉␉␉}␊
␉␉␉␊
␉␉␉aml_calculate_size(root);␊
␉␉␉␊
␉␉␉struct acpi_2_ssdt *ssdt = (struct acpi_2_ssdt *)AllocateKernelMemory(root->Size);␊
␉␉␉␊
␉␉␉aml_write_node(root, (void*)ssdt, 0);␊
␉␉␉␊
␉␉␉ssdt->Length = root->Size;␊
␉␉␉ssdt->Checksum = 0;␊
␉␉␉ssdt->Checksum = 256 - checksum8(ssdt, ssdt->Length);␊
␉␉␉␊
␉␉␉aml_destroy_node(root);␊
␉␉␉␊
␉␉␉//dumpPhysAddr("P-States SSDT content: ", ssdt, ssdt->Length);␊
␉␉␉␊
␉␉␉verbose ("SSDT with CPU P-States generated successfully\n");␊
␉␉␉␊
␉␉␉return ssdt;␊
␉␉}␊
␉}␊
␉else ␊
␉{␊
␉␉verbose ("ACPI CPUs not found: P-States not generated !!!\n");␊
␉}␊
␉␊
␉return NULL;␊
}␊
␊
struct acpi_2_fadt *patch_fadt(struct acpi_2_fadt *fadt, struct acpi_2_dsdt *new_dsdt)␊
{␊
␉extern void setupSystemType(); ␊
␉␊
␉struct acpi_2_fadt *fadt_mod;␊
␉bool fadt_rev2_needed = false;␊
␉bool fix_restart;␊
␉const char * value;␊
␉␊
␉// Restart Fix␊
␉if (Platform.CPU.Vendor == 0x756E6547) {␉/* Intel */␊
␉␉fix_restart = true;␊
␉␉getBoolForKey(kRestartFix, &fix_restart, &bootInfo->bootConfig);␊
␉} else {␊
␉␉verbose ("Not an Intel platform: Restart Fix not applied !!!\n");␊
␉␉fix_restart = false;␊
␉}␊
␉␊
␉if (fix_restart) fadt_rev2_needed = true;␊
␉␊
␉// Allocate new fadt table␊
␉if (fadt->Length < 0x84 && fadt_rev2_needed)␊
␉{␊
␉␉fadt_mod=(struct acpi_2_fadt *)AllocateKernelMemory(0x84);␊
␉␉memcpy(fadt_mod, fadt, fadt->Length);␊
␉␉fadt_mod->Length = 0x84;␊
␉␉fadt_mod->Revision = 0x02; // FADT rev 2 (ACPI 1.0B MS extensions)␊
␉}␊
␉else␊
␉{␊
␉␉fadt_mod=(struct acpi_2_fadt *)AllocateKernelMemory(fadt->Length);␊
␉␉memcpy(fadt_mod, fadt, fadt->Length);␊
␉}␊
␉// Determine system type / PM_Model␊
␉if ( (value=getStringForKey(kSystemType, &bootInfo->bootConfig))!=NULL)␊
␉{␊
␉␉if (Platform.Type > 6) ␊
␉␉{␊
␉␉␉if(fadt_mod->PM_Profile<=6)␊
␉␉␉␉Platform.Type = fadt_mod->PM_Profile; // get the fadt if correct␊
␉␉␉else ␊
␉␉␉␉Platform.Type = 1;␉␉/* Set a fixed value (Desktop) */␊
␉␉␉verbose("Error: system-type must be 0..6. Defaulting to %d !\n", Platform.Type);␊
␉␉}␊
␉␉else␊
␉␉␉Platform.Type = (unsigned char) strtoul(value, NULL, 10);␊
␉}␊
␉// Set PM_Profile from System-type if only user wanted this value to be forced␊
␉if (fadt_mod->PM_Profile != Platform.Type) ␊
␉{␊
␉ if (value) ␊
␉␉{ // user has overriden the SystemType so take care of it in FACP␊
␉␉␉verbose("FADT: changing PM_Profile from 0x%02x to 0x%02x\n", fadt_mod->PM_Profile, Platform.Type);␊
␉␉␉fadt_mod->PM_Profile = Platform.Type;␊
␉ }␊
␉ else␊
␉ { // PM_Profile has a different value and no override has been set, so reflect the user value to ioregs␊
␉␉␉Platform.Type = fadt_mod->PM_Profile <= 6 ? fadt_mod->PM_Profile : 1;␊
␉ } ␊
␉}␊
␉// We now have to write the systemm-type in ioregs: we cannot do it before in setupDeviceTree()␊
␉// because we need to take care of facp original content, if it is correct.␊
␉setupSystemType();␊
␉␊
␉// Patch FADT to fix restart␊
␉if (fix_restart)␊
␉{␊
␉␉fadt_mod->Flags|= 0x400;␊
␉␉fadt_mod->Reset_SpaceID␉␉= 0x01; // System I/O␊
␉␉fadt_mod->Reset_BitWidth␉= 0x08; // 1 byte␊
␉␉fadt_mod->Reset_BitOffset␉= 0x00; // Offset 0␊
␉␉fadt_mod->Reset_AccessWidth␉= 0x01; // Byte access␊
␉␉fadt_mod->Reset_Address␉␉= 0x0cf9; // Address of the register␊
␉␉fadt_mod->Reset_Value␉␉= 0x06; // Value to write to reset the system␊
␉␉verbose("FADT: Restart Fix applied!\n");␊
␉}␊
␉␊
␉// Patch DSDT Address if we have loaded DSDT.aml␊
␉if(new_dsdt)␊
␉{␊
␉␉DBG("DSDT: Old @%x,%x, ",fadt_mod->DSDT,fadt_mod->X_DSDT);␊
␉␉␊
␉␉fadt_mod->DSDT=(uint32_t)new_dsdt;␊
␉␉if ((uint32_t)(&(fadt_mod->X_DSDT))-(uint32_t)fadt_mod+8<=fadt_mod->Length)␊
␉␉␉fadt_mod->X_DSDT=(uint32_t)new_dsdt;␊
␉␉␊
␉␉DBG("New @%x,%x\n",fadt_mod->DSDT,fadt_mod->X_DSDT);␊
␉␉␊
␉␉verbose("FADT: Using custom DSDT!\n");␊
␉}␊
␉␊
␉// Correct the checksum␊
␉fadt_mod->Checksum=0;␊
␉fadt_mod->Checksum=256-checksum8(fadt_mod,fadt_mod->Length);␊
␉␊
␉return fadt_mod;␊
}␊
␊
/* Setup ACPI without replacing DSDT. */␊
int setupAcpiNoMod()␊
{␊
␉//␉addConfigurationTable(&gEfiAcpiTableGuid, getAddressOfAcpiTable(), "ACPI");␊
␉//␉addConfigurationTable(&gEfiAcpi20TableGuid, getAddressOfAcpi20Table(), "ACPI_20");␊
␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊
␉acpi10_p = (uint32_t)getAddressOfAcpiTable();␊
␉acpi20_p = (uint32_t)getAddressOfAcpi20Table();␊
␉addConfigurationTable(&gEfiAcpiTableGuid, &acpi10_p, "ACPI");␊
␉if(acpi20_p) addConfigurationTable(&gEfiAcpi20TableGuid, &acpi20_p, "ACPI_20");␊
␉return 1;␊
}␊
␊
/* Setup ACPI. Replace DSDT if DSDT.aml is found */␊
int setupAcpi(void)␊
{␊
␉int version;␊
␉void *new_dsdt;␊
␊
␉const char *filename;␊
␉char dirSpec[128];␊
␉int len = 0;␊
␊
␉// Try using the file specified with the DSDT option␊
␉if (getValueForKey(kDSDT, &filename, &len, &bootInfo->bootConfig))␊
␉{␊
␉␉sprintf(dirSpec, filename);␊
␉}␊
␉else␊
␉{␊
␉␉sprintf(dirSpec, "DSDT.aml");␊
␉}␊
␉␊
␉// Load replacement DSDT␊
␉new_dsdt = loadACPITable(dirSpec);␊
␉// Mozodojo: going to patch FACP and load SSDT's even if DSDT.aml is not present␊
␉/*if (!new_dsdt)␊
␉ {␊
␉ return setupAcpiNoMod();␊
␉ }*/␊
␉␊
␉// Mozodojo: Load additional SSDTs␊
␉struct acpi_2_ssdt *new_ssdt[32]; // 30 + 2 additional tables for pss & cst␊
␉int ssdt_count=0;␊
␉␊
␉// SSDT Options␊
␉bool drop_ssdt=false, generate_pstates=false, generate_cstates=false; ␊
␉␊
␉getBoolForKey(kDropSSDT, &drop_ssdt, &bootInfo->bootConfig);␊
␉getBoolForKey(kGeneratePStates, &generate_pstates, &bootInfo->bootConfig);␊
␉getBoolForKey(kGenerateCStates, &generate_cstates, &bootInfo->bootConfig);␊
␉␊
␉{␊
␉␉int i;␊
␉␉␊
␉␉for (i=0; i<30; i++)␊
␉␉{␊
␉␉␉char filename[512];␊
␊
␉␉␉sprintf(filename, i>0?"SSDT-%d.aml":"SSDT.aml", i);␊
␉␉␉␊
␉␉␉if(new_ssdt[ssdt_count] = loadACPITable(filename)) ␊
␉␉␉{␉␉␉␉␊
␉␉␉␉ssdt_count++;␊
␉␉␉}␊
␉␉␉else ␊
␉␉␉{␊
␉␉␉␉break;␊
␉␉␉}␊
␉␉}␊
␉}␊
␉␉␊
␉// Do the same procedure for both versions of ACPI␊
␉for (version=0; version<2; version++) {␊
␉␉struct acpi_2_rsdp *rsdp, *rsdp_mod;␊
␉␉struct acpi_2_rsdt *rsdt, *rsdt_mod;␊
␉␉int rsdplength;␊
␉␉␊
␉␉// Find original rsdp␊
␉␉rsdp=(struct acpi_2_rsdp *)(version?getAddressOfAcpi20Table():getAddressOfAcpiTable());␊
␉␉if (!rsdp)␊
␉␉{␊
␉␉␉DBG("No ACPI version %d found. Ignoring\n", version+1);␊
␉␉␉if (version)␊
␉␉␉␉addConfigurationTable(&gEfiAcpi20TableGuid, NULL, "ACPI_20");␊
␉␉␉else␊
␉␉␉␉addConfigurationTable(&gEfiAcpiTableGuid, NULL, "ACPI");␊
␉␉␉continue;␊
␉␉}␊
␉␉rsdplength=version?rsdp->Length:20;␊
␉␉␊
␉␉DBG("RSDP version %d found @%x. Length=%d\n",version+1,rsdp,rsdplength);␊
␉␉␊
␉␉/* FIXME: no check that memory allocation succeeded ␊
␉␉ * Copy and patch RSDP,RSDT, XSDT and FADT␊
␉␉ * For more info see ACPI Specification pages 110 and following␊
␉␉ */␊
␉␉␊
␉␉rsdp_mod=(struct acpi_2_rsdp *) AllocateKernelMemory(rsdplength);␊
␉␉memcpy(rsdp_mod, rsdp, rsdplength); ␊
␉␉rsdt=(struct acpi_2_rsdt *)(rsdp->RsdtAddress);␊
␉␉␊
␉␉DBG("RSDT @%x, Length %d\n",rsdt, rsdt->Length);␊
␉␉␊
␉␉if (rsdt && (uint32_t)rsdt !=0xffffffff && rsdt->Length<0x10000)␊
␉␉{␊
␉␉␉uint32_t *rsdt_entries;␊
␉␉␉int rsdt_entries_num;␊
␉␉␉int dropoffset=0, i;␊
␉␉␉␊
␉␉␉// mozo: using malloc cos I didn't found how to free already allocated kernel memory␊
␉␉␉rsdt_mod=(struct acpi_2_rsdt *)malloc(rsdt->Length); ␊
␉␉␉memcpy (rsdt_mod, rsdt, rsdt->Length);␊
␉␉␉rsdp_mod->RsdtAddress=(uint32_t)rsdt_mod;␊
␉␉␉rsdt_entries_num=(rsdt_mod->Length-sizeof(struct acpi_2_rsdt))/4;␊
␉␉␉rsdt_entries=(uint32_t *)(rsdt_mod+1);␊
␉␉␉for (i=0;i<rsdt_entries_num;i++)␊
␉␉␉{␊
␉␉␉␉char *table=(char *)(rsdt_entries[i]);␊
␉␉␉␉if (!table)␊
␉␉␉␉␉continue;␊
␉␉␉␉␊
␉␉␉␉DBG("TABLE %c%c%c%c,",table[0],table[1],table[2],table[3]);␊
␉␉␉␉␊
␉␉␉␉rsdt_entries[i-dropoffset]=rsdt_entries[i];␊
␉␉␉␉␊
␉␉␉␉if (drop_ssdt && tableSign(table, "SSDT"))␊
␉␉␉␉{␊
␉␉␉␉␉dropoffset++;␊
␉␉␉␉␉continue;␊
␉␉␉␉}␊
␉␉␉␉if (tableSign(table, "DSDT"))␊
␉␉␉␉{␊
␉␉␉␉␉DBG("DSDT found\n");␊
␉␉␉␉␉␊
␉␉␉␉␉if(new_dsdt)␊
␉␉␉␉␉␉rsdt_entries[i-dropoffset]=(uint32_t)new_dsdt;␊
␉␉␉␉␉␉␉␉␉␉␊
␉␉␉␉␉continue;␊
␉␉␉␉}␊
␉␉␉␉if (tableSign(table, "FACP"))␊
␉␉␉␉{␊
␉␉␉␉␉struct acpi_2_fadt *fadt, *fadt_mod;␊
␉␉␉␉␉fadt=(struct acpi_2_fadt *)rsdt_entries[i];␊
␉␉␉␉␉␊
␉␉␉␉␉DBG("FADT found @%x, Length %d\n",fadt, fadt->Length);␊
␉␉␉␉␉␊
␉␉␉␉␉if (!fadt || (uint32_t)fadt == 0xffffffff || fadt->Length>0x10000)␊
␉␉␉␉␉{␊
␉␉␉␉␉␉printf("FADT incorrect. Not modified\n");␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉}␊
␉␉␉␉␉␊
␉␉␉␉␉fadt_mod = patch_fadt(fadt, new_dsdt);␊
␉␉␉␉␉rsdt_entries[i-dropoffset]=(uint32_t)fadt_mod;␊
␉␉␉␉␉␊
␉␉␉␉␉// Generate _CST SSDT␊
␉␉␉␉␉if (generate_cstates && (new_ssdt[ssdt_count] = generate_cst_ssdt(fadt_mod)))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉generate_cstates = false; // Generate SSDT only once!␊
␉␉␉␉␉␉ssdt_count++;␊
␉␉␉␉␉}␊
␉␉␉␉␉␊
␉␉␉␉␉// Generating _PSS SSDT␊
␉␉␉␉␉if (generate_pstates && (new_ssdt[ssdt_count] = generate_pss_ssdt((void*)fadt_mod->DSDT)))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉generate_pstates = false; // Generate SSDT only once!␊
␉␉␉␉␉␉ssdt_count++;␊
␉␉␉␉␉}␊
␉␉␉␉␉␊
␉␉␉␉␉continue;␊
␉␉␉␉}␊
␉␉␉}␊
␉␉␉DBG("\n");␊
␉␉␉␊
␉␉␉// Allocate rsdt in Kernel memory area␊
␉␉␉rsdt_mod->Length += 4*ssdt_count - 4*dropoffset;␊
␉␉␉struct acpi_2_rsdt *rsdt_copy = (struct acpi_2_rsdt *)AllocateKernelMemory(rsdt_mod->Length);␊
␉␉␉memcpy (rsdt_copy, rsdt_mod, rsdt_mod->Length);␊
␉␉␉free(rsdt_mod); rsdt_mod = rsdt_copy;␊
␉␉␉rsdp_mod->RsdtAddress=(uint32_t)rsdt_mod;␊
␉␉␉rsdt_entries_num=(rsdt_mod->Length-sizeof(struct acpi_2_rsdt))/4;␊
␉␉␉rsdt_entries=(uint32_t *)(rsdt_mod+1);␊
␉␉␉␊
␉␉␉// Mozodojo: Insert additional SSDTs into RSDT␊
␉␉␉if(ssdt_count>0)␊
␉␉␉{␊
␉␉␉␉int j;␊
␉␉␉␉␊
␉␉␉␉for (j=0; j<ssdt_count; j++)␊
␉␉␉␉␉rsdt_entries[i-dropoffset+j]=(uint32_t)new_ssdt[j];␊
␉␉␉␉␉␊
␉␉␉␉verbose("RSDT: Added %d SSDT table(s)\n", ssdt_count);␊
␉␉␉}␊
␊
␉␉␉// Correct the checksum of RSDT␊
␉␉␉DBG("RSDT: Original checksum %d, ", rsdt_mod->Checksum);␊
␉␉␉␊
␉␉␉rsdt_mod->Checksum=0;␊
␉␉␉rsdt_mod->Checksum=256-checksum8(rsdt_mod,rsdt_mod->Length);␊
␉␉␉␊
␉␉␉DBG("New checksum %d at %x\n", rsdt_mod->Checksum,rsdt_mod);␊
␉␉}␊
␉␉else␊
␉␉{␊
␉␉␉rsdp_mod->RsdtAddress=0;␊
␉␉␉printf("RSDT not found or RSDT incorrect\n");␊
␉␉}␊
␉␉␊
␉␉if (version)␊
␉␉{␊
␉␉␉struct acpi_2_xsdt *xsdt, *xsdt_mod;␊
␉␉␉␊
␉␉␉// FIXME: handle 64-bit address correctly␊
␉␉␉␊
␉␉␉xsdt=(struct acpi_2_xsdt*) ((uint32_t)rsdp->XsdtAddress);␊
␉␉␉DBG("XSDT @%x;%x, Length=%d\n", (uint32_t)(rsdp->XsdtAddress>>32),(uint32_t)rsdp->XsdtAddress,␊
␉␉␉␉xsdt->Length);␊
␉␉␉if (xsdt && (uint64_t)rsdp->XsdtAddress<0xffffffff && xsdt->Length<0x10000)␊
␉␉␉{␊
␉␉␉␉uint64_t *xsdt_entries;␊
␉␉␉␉int xsdt_entries_num, i;␊
␉␉␉␉int dropoffset=0;␊
␉␉␉␉␊
␉␉␉␉// mozo: using malloc cos I didn't found how to free already allocated kernel memory␊
␉␉␉␉xsdt_mod=(struct acpi_2_xsdt*)malloc(xsdt->Length); ␊
␉␉␉␉memcpy(xsdt_mod, xsdt, xsdt->Length);␊
␉␉␉␉rsdp_mod->XsdtAddress=(uint32_t)xsdt_mod;␊
␉␉␉␉xsdt_entries_num=(xsdt_mod->Length-sizeof(struct acpi_2_xsdt))/8;␊
␉␉␉␉xsdt_entries=(uint64_t *)(xsdt_mod+1);␊
␉␉␉␉for (i=0;i<xsdt_entries_num;i++)␊
␉␉␉␉{␊
␉␉␉␉␉char *table=(char *)((uint32_t)(xsdt_entries[i]));␊
␉␉␉␉␉if (!table)␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉␊
␉␉␉␉␉xsdt_entries[i-dropoffset]=xsdt_entries[i];␊
␉␉␉␉␉␊
␉␉␉␉␉if (drop_ssdt && tableSign(table, "SSDT"))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉dropoffset++;␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉}␉␉␉␉␉␊
␉␉␉␉␉if (tableSign(table, "DSDT"))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉DBG("DSDT found\n");␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (new_dsdt) ␊
␉␉␉␉␉␉␉xsdt_entries[i-dropoffset]=(uint32_t)new_dsdt;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉}␊
␉␉␉␉␉if (tableSign(table, "FACP"))␊
␉␉␉␉␉{␊
␉␉␉␉␉␉struct acpi_2_fadt *fadt, *fadt_mod;␊
␉␉␉␉␉␉fadt=(struct acpi_2_fadt *)(uint32_t)xsdt_entries[i];␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉DBG("FADT found @%x,%x, Length %d\n",(uint32_t)(xsdt_entries[i]>>32),fadt, ␊
␉␉␉␉␉␉␉fadt->Length);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉if (!fadt || (uint64_t)xsdt_entries[i] >= 0xffffffff || fadt->Length>0x10000)␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉verbose("FADT incorrect or after 4GB. Dropping XSDT\n");␊
␉␉␉␉␉␉␉goto drop_xsdt;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉fadt_mod = patch_fadt(fadt, new_dsdt);␊
␉␉␉␉␉␉xsdt_entries[i-dropoffset]=(uint32_t)fadt_mod;␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉// Generate _CST SSDT␊
␉␉␉␉␉␉if (generate_cstates && (new_ssdt[ssdt_count] = generate_cst_ssdt(fadt_mod))) ␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉generate_cstates = false; // Generate SSDT only once!␊
␉␉␉␉␉␉␉ssdt_count++;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉// Generating _PSS SSDT␊
␉␉␉␉␉␉if (generate_pstates && (new_ssdt[ssdt_count] = generate_pss_ssdt((void*)fadt_mod->DSDT)))␊
␉␉␉␉␉␉{␊
␉␉␉␉␉␉␉generate_pstates = false; // Generate SSDT only once!␊
␉␉␉␉␉␉␉ssdt_count++;␊
␉␉␉␉␉␉}␊
␉␉␉␉␉␉␊
␉␉␉␉␉␉continue;␊
␉␉␉␉␉}␊
␉␉␉␉␉␊
␉␉␉␉␉DBG("TABLE %c%c%c%c@%x,",table[0],table[1],table[2],table[3],xsdt_entries[i]);␊
␉␉␉␉␉␊
␉␉␉␉}␊
␉␉␉␉␊
␉␉␉␉// Allocate xsdt in Kernel memory area␊
␉␉␉␉xsdt_mod->Length += 8*ssdt_count - 8*dropoffset;␊
␉␉␉␉struct acpi_2_xsdt *xsdt_copy = (struct acpi_2_xsdt *)AllocateKernelMemory(xsdt_mod->Length);␊
␉␉␉␉memcpy(xsdt_copy, xsdt_mod, xsdt_mod->Length);␊
␉␉␉␉free(xsdt_mod); xsdt_mod = xsdt_copy;␊
␉␉␉␉rsdp_mod->XsdtAddress=(uint32_t)xsdt_mod;␊
␉␉␉␉xsdt_entries_num=(xsdt_mod->Length-sizeof(struct acpi_2_xsdt))/8;␊
␉␉␉␉xsdt_entries=(uint64_t *)(xsdt_mod+1);␊
␉␉␉␉␊
␉␉␉␉// Mozodojo: Insert additional SSDTs into XSDT␊
␉␉␉␉if(ssdt_count>0)␊
␉␉␉␉{␊
␉␉␉␉␉int j;␊
␉␉␉␉␉␊
␉␉␉␉␉for (j=0; j<ssdt_count; j++)␊
␉␉␉␉␉␉xsdt_entries[i-dropoffset+j]=(uint32_t)new_ssdt[j];␊
␉␉␉␉␉␉␊
␉␉␉␉␉verbose("Added %d SSDT table(s) into XSDT\n", ssdt_count);␊
␉␉␉␉}␊
␊
␉␉␉␉// Correct the checksum of XSDT␊
␉␉␉␉xsdt_mod->Checksum=0;␊
␉␉␉␉xsdt_mod->Checksum=256-checksum8(xsdt_mod,xsdt_mod->Length);␊
␉␉␉}␊
␉␉␉else␊
␉␉␉{␊
␉␉␉drop_xsdt:␊
␉␉␉␉␊
␉␉␉␉DBG("About to drop XSDT\n");␊
␉␉␉␉␊
␉␉␉␉/*FIXME: Now we just hope that if MacOS doesn't find XSDT it reverts to RSDT. ␊
␉␉␉␉ * A Better strategy would be to generate␊
␉␉␉␉ */␊
␉␉␉␉␊
␉␉␉␉rsdp_mod->XsdtAddress=0xffffffffffffffffLL;␊
␉␉␉␉verbose("XSDT not found or XSDT incorrect\n");␊
␉␉␉}␊
␉␉}␊
␉␉␊
␉␉// Correct the checksum of RSDP ␊
␉␉␊
␉␉DBG("RSDP: Original checksum %d, ", rsdp_mod->Checksum);␊
␉␉␊
␉␉rsdp_mod->Checksum=0;␊
␉␉rsdp_mod->Checksum=256-checksum8(rsdp_mod,20);␊
␉␉␊
␉␉DBG("New checksum %d\n", rsdp_mod->Checksum);␊
␉␉␊
␉␉if (version)␊
␉␉{␊
␉␉␉DBG("RSDP: Original extended checksum %d", rsdp_mod->ExtendedChecksum);␊
␉␉␉␊
␉␉␉rsdp_mod->ExtendedChecksum=0;␊
␉␉␉rsdp_mod->ExtendedChecksum=256-checksum8(rsdp_mod,rsdp_mod->Length);␊
␉␉␉␊
␉␉␉DBG("New extended checksum %d\n", rsdp_mod->ExtendedChecksum);␊
␉␉␉␊
␉␉}␊
␉␉␊
␉␉//verbose("Patched ACPI version %d DSDT\n", version+1);␊
␉␉if (version)␊
␉␉{␊
␉␉␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊
␉␉␉acpi20_p = (uint32_t)rsdp_mod;␊
␉␉␉addConfigurationTable(&gEfiAcpi20TableGuid, &acpi20_p, "ACPI_20");␊
␉␉}␊
␉␉else␊
␉␉{␊
␉␉␉/* XXX aserebln why uint32 cast if pointer is uint64 ? */␊
␉␉␉acpi10_p = (uint32_t)rsdp_mod;␊
␉␉␉addConfigurationTable(&gEfiAcpiTableGuid, &acpi10_p, "ACPI");␊
␉␉}␊
␉}␊
#if DEBUG_ACPI␊
␉printf("Press a key to continue... (DEBUG_ACPI)\n");␊
␉getc();␊
#endif␊
␉return 1;␊
}␊
branches/meklort/i386/modules/ACPIPatcher/ACPIPatcher.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
/*␊
* Copyright (c) 2009 Evan Lojewski. All rights reserved.␊
*␊
*/␊
␊
#include "libsaio.h"␊
#include "modules.h"␊
#include "boot.h"␊
#include "bootstruct.h"␊
#include "pci_root.h"␊
#include "acpi_patcher.h"␊
␊
int ACPIPatcher_getPciRootUID(void);␊
␊
void ACPIPatcher_setupEfiConfigurationTable_hook(void* binary, void* arg2, void* arg3, void* arg4)␊
{␊
␉// Setup ACPI with DSDT overrides (mackerintel's patch)␊
␉setupAcpi();␊
}␊
␊
void ACPIPatcher_start()␊
{␊
␉replace_function("getPciRootUID", &ACPIPatcher_getPciRootUID);␊
␉register_hook_callback("setupEfiConfigurationTable", &ACPIPatcher_setupEfiConfigurationTable_hook);␊
}␊
␊
int ACPIPatcher_rootuid = 10; //value means function wasnt ran yet␊
␊
int ACPIPatcher_getPciRootUID(void)␊
{␊
␉void *new_dsdt;␊
␉const char *val;␊
␉int len,fsize;␊
␉const char * dsdt_filename=NULL;␊
␉extern int search_and_get_acpi_fd(const char *, const char **);␊
␉␊
␉if (ACPIPatcher_rootuid < 10) return ACPIPatcher_rootuid;␊
␉ACPIPatcher_rootuid = 0;␉/* default uid = 0 */␊
␉␊
␉if (getValueForKey(kPCIRootUID, &val, &len, &bootInfo->bootConfig)) {␊
␉␉if (isdigit(val[0])) ACPIPatcher_rootuid = val[0] - '0';␊
␉␉goto out;␊
␉}␊
␉/* Chameleon compatibility */␊
␉else if (getValueForKey("PciRoot", &val, &len, &bootInfo->bootConfig)) {␊
␉␉if (isdigit(val[0])) ACPIPatcher_rootuid = val[0] - '0';␊
␉␉goto out;␊
␉}␊
␉/* PCEFI compatibility */␊
␉else if (getValueForKey("-pci0", &val, &len, &bootInfo->bootConfig)) {␊
␉␉ACPIPatcher_rootuid = 0;␊
␉␉goto out;␊
␉}␊
␉else if (getValueForKey("-pci1", &val, &len, &bootInfo->bootConfig)) {␊
␉␉ACPIPatcher_rootuid = 1;␊
␉␉goto out;␊
␉}␊
␉␊
␉int fd = search_and_get_acpi_fd("DSDT.aml", &dsdt_filename);␊
␉␊
␉// Check booting partition␊
␉if (fd<0)␊
␉{␉ ␊
␉␉verbose("No DSDT found, using 0 as uid value.\n");␊
␉␉ACPIPatcher_rootuid = 0;␊
␉␉goto out;␊
␉}␊
␉␊
␉fsize = file_size(fd);␊
␉␊
␉if ((new_dsdt = malloc(fsize)) == NULL) {␊
␉␉verbose("[ERROR] alloc DSDT memory failed\n");␊
␉␉close (fd);␊
␉␉goto out;␊
␉}␊
␉if (read (fd, new_dsdt, fsize) != fsize) {␊
␉␉verbose("[ERROR] read %s failed\n", dsdt_filename);␊
␉␉close (fd);␊
␉␉goto out;␊
␉}␊
␉close (fd);␊
␉␊
␉ACPIPatcher_rootuid = findpciroot(new_dsdt, fsize);␊
␉free(new_dsdt);␊
␉␊
␉// make sure it really works: ␊
␉if (ACPIPatcher_rootuid == 11) ACPIPatcher_rootuid=0; //usually when _UID isnt present, it means uid is zero␊
␉else if (ACPIPatcher_rootuid < 0 || ACPIPatcher_rootuid > 9) ␊
␉{␊
␉␉printf("PciRoot uid value wasnt found, using 0, if you want it to be 1, use -PciRootUID flag");␊
␉␉ACPIPatcher_rootuid = 0;␊
␉}␊
out:␊
␉verbose("Using PCI-Root-UID value: %d\n", ACPIPatcher_rootuid);␊
␉return ACPIPatcher_rootuid;␊
}␊
branches/meklort/i386/modules/ACPIPatcher/aml_generator.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/*␊
* aml_generator.h␊
* Chameleon␊
*␊
* Created by Mozodojo on 20/07/10.␊
* Copyright 2010 mozo. All rights reserved.␊
*␊
*/␊
␊
#ifndef __LIBSAIO_AML_GENERATOR_H␊
#define __LIBSAIO_AML_GENERATOR_H␊
␊
#include "libsaio.h"␊
␊
#define␉AML_CHUNK_NONE␉␉0xff␊
#define␉AML_CHUNK_ZERO␉␉0x00␊
#define␉AML_CHUNK_ONE␉␉0x01␊
#define␉AML_CHUNK_ALIAS␉␉0x06␊
#define␉AML_CHUNK_NAME␉␉0x08␊
#define␉AML_CHUNK_BYTE␉␉0x0A␊
#define␉AML_CHUNK_WORD␉␉0x0B␊
#define␉AML_CHUNK_DWORD␉␉0x0C␊
#define␉AML_CHUNK_STRING␉0x0D␊
#define␉AML_CHUNK_QWORD␉␉0x0E␊
#define␉AML_CHUNK_SCOPE␉␉0x10␊
#define␉AML_CHUNK_PACKAGE␉0x12␊
␊
struct aml_chunk ␊
{␊
␉unsigned char␉␉Type;␊
␉unsigned int␉␉Length;␊
␉char*␉␉␉␉Buffer;␊
␉␊
␉unsigned int␉␉Size;␊
␉␊
␉struct aml_chunk*␉Next;␊
␉struct aml_chunk*␉First;␊
␉struct aml_chunk*␉Last;␊
};␊
␊
static inline bool aml_isvalidchar(char c)␊
{␊
␉return isupper(c) || isdigit(c) || c == '_';␊
};␊
␊
bool aml_add_to_parent(struct aml_chunk* parent, struct aml_chunk* node);␊
struct aml_chunk* aml_create_node(struct aml_chunk* parent);␊
void aml_destroy_node(struct aml_chunk* node);␊
struct aml_chunk* aml_add_buffer(struct aml_chunk* parent, const char* buffer, unsigned int size);␊
struct aml_chunk* aml_add_byte(struct aml_chunk* parent, unsigned char value);␊
struct aml_chunk* aml_add_word(struct aml_chunk* parent, unsigned int value);␊
struct aml_chunk* aml_add_dword(struct aml_chunk* parent, unsigned long value);␊
struct aml_chunk* aml_add_qword(struct aml_chunk* parent, unsigned long long value);␊
struct aml_chunk* aml_add_scope(struct aml_chunk* parent, const char* name);␊
struct aml_chunk* aml_add_name(struct aml_chunk* parent, const char* name);␊
struct aml_chunk* aml_add_package(struct aml_chunk* parent);␊
struct aml_chunk* aml_add_alias(struct aml_chunk* parent, const char* name1, const char* name2);␊
unsigned int aml_calculate_size(struct aml_chunk* node);␊
unsigned int aml_write_node(struct aml_chunk* node, char* buffer, unsigned int offset);␊
␊
#endif /* !__LIBSAIO_AML_GENERATOR_H */
branches/meklort/i386/modules/ACPIPatcher/acpi_patcher.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/*␊
* Copyright 2008 mackerintel␊
*/␊
␊
#ifndef __LIBSAIO_ACPI_PATCHER_H␊
#define __LIBSAIO_ACPI_PATCHER_H␊
␊
#include "libsaio.h"␊
#include "efi.h"␊
␊
extern uint64_t acpi10_p;␊
extern uint64_t acpi20_p;␊
extern uint64_t smbios_p;␊
␊
extern int setupAcpi();␊
␊
extern EFI_STATUS addConfigurationTable();␊
␊
extern EFI_GUID gEfiAcpiTableGuid;␊
extern EFI_GUID gEfiAcpi20TableGuid;␊
␊
struct p_state ␊
{␊
␉union ␊
␉{␊
␉␉uint16_t Control;␊
␉␉struct ␊
␉␉{␊
␉␉␉uint8_t VID;␉// Voltage ID␊
␉␉␉uint8_t FID;␉// Frequency ID␊
␉␉};␊
␉};␊
␉␊
␉uint8_t␉␉CID;␉␉// Compare ID␊
␉uint32_t␉Frequency;␊
};␊
␊
#endif /* !__LIBSAIO_ACPI_PATCHER_H */␊
branches/meklort/i386/modules/ACPIPatcher/Makefile
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
␊
MODULE_NAME = ACPIPatcher␊
MODULE_VERSION = "1.0.0"␊
MODULE_COMPAT_VERSION = "1.0.0"␊
MODULE_START = _$(MODULE_NAME)_start␊
MODULE_DEPENDENCIES = ␊
␊
DIR = ACPIPatcher␊
␊
include ../../MakePaths.dir␊
␊
OBJROOT=../../../obj/i386/modules/$(DIR)␊
SYMROOT=../../../sym/i386/modules/␊
DSTROOT=../../../dst/i386/modules/␊
␊
␊
UTILDIR = ../../util␊
LIBSADIR = ../../libsa␊
LIBSAIODIR = ../../libsaio␊
BOOT2DIR = ../../boot2␊
␊
INSTALLDIR = $(DSTROOT)/System/Library/Frameworks/System.framework/Versions/B/PrivateHeaders/standalone␊
␊
OPTIM = -Os -Oz␊
DEBUG = -DNOTHING␊
#DEBUG = -DDEBUG_HELLO_WORLD=1␊
CFLAGS␉= $(RC_CFLAGS) $(OPTIM) $(MORECPP) -arch i386 -g -Wmost \␊
-D__ARCHITECTURE__=\"i386\" -DSAIO_INTERNAL_USER \␊
-DRCZ_COMPRESSED_FILE_SUPPORT $(DEBUG) \␊
-fno-builtin $(OMIT_FRAME_POINTER_CFLAG) \␊
-mpreferred-stack-boundary=2 -fno-align-functions -fno-stack-protector \␊
-march=pentium4 -msse2 -mfpmath=sse -msoft-float -fno-common -mdynamic-no-pic␊
␊
DEFINES=␊
CONFIG = hd␊
INC = -I. -I.. -I$(SYMROOT) -I$(UTILDIR) -I$(LIBSADIR) -I$(LIBSAIODIR) -I$(BOOT2DIR)␊
ifneq "" "$(wildcard /bin/mkdirs)"␊
MKDIRS = /bin/mkdirs␊
else␊
MKDIRS = /bin/mkdir -p␊
endif␊
AS = as␊
LD = ld␊
# LIBS= -lc_static␊
LIBS=␊
␊
VPATH = $(OBJROOT):$(SYMROOT)␊
␊
HELLO_WORLD_OBJS = ACPIPatcher.o aml_generator.o acpi_patcher.o␊
␊
␊
SFILES =␊
CFILES = ␊
HFILES = ␊
EXPORTED_HFILES =␊
INSTALLED_HFILES =␊
OTHERFILES = Makefile␊
ALLSRC = $(SFILES) $(CFILES) \␊
␉$(HFILES) $(OTHERFILES)␊
DIRS_NEEDED = $(OBJROOT) $(SYMROOT)␊
␊
all embedtheme optionrom: ${HELLO_WORLD_OBJS} dylib␊
␊
␊
dylib: ${HELLO_WORLD_OBJS}␊
␉ld -flat_namespace -arch i386 \␊
␉-undefined suppress \␊
␉-alias $(MODULE_START) start \␊
␉-dylib -read_only_relocs suppress \␊
␉-S -x -Z -dead_strip_dylibs \␊
␉-no_uuid \␊
␉-current_version $(MODULE_VERSION) -compatibility_version $(MODULE_COMPAT_VERSION) \␊
␉-final_output $(MODULE_NAME) \␊
␉$(OBJROOT)/ACPIPatcher.o \␊
␉$(OBJROOT)/aml_generator.o \␊
␉$(OBJROOT)/acpi_patcher.o \␊
␉-o $(SYMROOT)/$(MODULE_NAME).dylib␊
␊
␊
␊
ACPIPatcher.o: ␉␊
␉$(CC) $(CPPFLAGS) $(CFLAGS) $(DEFINES) -c "ACPIPatcher.c" $(INC) -o "$(OBJROOT)/ACPIPatcher.o"␊
␊
aml_generator.o: ␉␊
␉$(CC) $(CPPFLAGS) $(CFLAGS) $(DEFINES) -c "aml_generator.c" $(INC) -o "$(OBJROOT)/aml_generator.o"␊
␊
acpi_patcher.c: ␉␊
␉$(CC) $(CPPFLAGS) $(CFLAGS) $(DEFINES) -c "acpi_patcher.c" $(INC) -o "$(OBJROOT)/ACPIPatcher.o"␊
␊
␊
include ../../MakeInc.dir␊
␊
# dependencies␊
-include $(OBJROOT)/Makedep␊
branches/meklort/i386/modules/Makefile
2727
2828
2929
30
30
3131
3232
3333
␊
# The order of building is important.␊
# TODO: exclude Symbols from find so it isn't compiled twice␊
SUBDIRS = Symbols Resolution Memory KernelPatcher KextPatcher HelloWorld GUI GraphicsEnabler␊
SUBDIRS = Symbols Resolution Memory KernelPatcher KextPatcher HelloWorld GUI GraphicsEnabler ACPIPatcher␊
␊
all embedtheme optionrom tags debug install installhdrs:␊
␉@rm -rf $(OBJROOT)␊

Archive Download the corresponding diff file

Revision: 534