?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Ok. I didn't make 2.4.0 in 2000. Tough. I tried, but we had some
[davej-history.git] / drivers / acpi / resources / rscalc.c
blob2874aa3d05946c0030764b44031ca14032900ef0
1 /*******************************************************************************
2 *
3 * Module Name: rscalc - Acpi_rs_calculate_byte_stream_length
4 * Acpi_rs_calculate_list_length
5 * $Revision: 16 $
6 *
7 ******************************************************************************/
8
9 /*
10 * Copyright (C) 2000 R. Byron Moore
11 *
12 * This program is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
14 * the Free Software Foundation; either version 2 of the License, or
15 * (at your option) any later version.
16 *
17 * This program is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
21 *
22 * You should have received a copy of the GNU General Public License
23 * along with this program; if not, write to the Free Software
24 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
25 */
26
27
28 #include "acpi.h"
29 #include "acresrc.h"
30
31 #define _COMPONENT RESOURCE_MANAGER
32 MODULE_NAME ("rscalc")
33
34
35 /*******************************************************************************
36 *
37 * FUNCTION: Acpi_rs_calculate_byte_stream_length
38 *
39 * PARAMETERS: Linked_list - Pointer to the resource linked list
40 * Size_needed - u32 pointer of the size buffer needed
41 * to properly return the parsed data
42 *
43 * RETURN: Status AE_OK if okay, else a valid ACPI_STATUS code
44 *
45 * DESCRIPTION: Takes the resource byte stream and parses it once, calculating
46 * the size buffer needed to hold the linked list that conveys
47 * the resource data.
48 *
49 ******************************************************************************/
50
51 ACPI_STATUS
52 acpi_rs_calculate_byte_stream_length (
53 RESOURCE *linked_list,
54 u32 *size_needed)
55 {
56 u32 byte_stream_size_needed = 0;
57 u32 segment_size;
58 EXTENDED_IRQ_RESOURCE *ex_irq = NULL;
59 u8 done = FALSE;
60
61
62 while (!done) {
63
64 /*
65 * Init the variable that will hold the size to add to the
66 * total.
67 */
68 segment_size = 0;
69
70 switch (linked_list->id)
71 {
72 case irq:
73 /*
74 * IRQ Resource
75 */
76 /*
77 * For an IRQ Resource, Byte 3, although optional, will
78 * always be created - it holds IRQ information.
79 */
80 segment_size = 4;
81 break;
82
83 case dma:
84 /*
85 * DMA Resource
86 */
87 /*
88 * For this resource the size is static
89 */
90 segment_size = 3;
91 break;
92
93 case start_dependent_functions:
94 /*
95 * Start Dependent Functions Resource
96 */
97 /*
98 * For a Start_dependent_functions Resource, Byte 1,
99 * although optional, will always be created.
100 */
101 segment_size = 2;
102 break;
103
104 case end_dependent_functions:
105 /*
106 * End Dependent Functions Resource
107 */
108 /*
109 * For this resource the size is static
110 */
111 segment_size = 1;
112 break;
113
114 case io:
115 /*
116 * IO Port Resource
117 */
118 /*
119 * For this resource the size is static
120 */
121 segment_size = 8;
122 break;
123
124 case fixed_io:
125 /*
126 * Fixed IO Port Resource
127 */
128 /*
129 * For this resource the size is static
130 */
131 segment_size = 4;
132 break;
133
134 case vendor_specific:
135 /*
136 * Vendor Defined Resource
137 */
138 /*
139 * For a Vendor Specific resource, if the Length is
140 * between 1 and 7 it will be created as a Small
141 * Resource data type, otherwise it is a Large
142 * Resource data type.
143 */
144 if(linked_list->data.vendor_specific.length > 7) {
145 segment_size = 3;
146 }
147 else {
148 segment_size = 1;
149 }
150 segment_size +=
151 linked_list->data.vendor_specific.length;
152 break;
153
154 case end_tag:
155 /*
156 * End Tag
157 */
158 /*
159 * For this resource the size is static
160 */
161 segment_size = 2;
162 done = TRUE;
163 break;
164
165 case memory24:
166 /*
167 * 24-Bit Memory Resource
168 */
169 /*
170 * For this resource the size is static
171 */
172 segment_size = 12;
173 break;
174
175 case memory32:
176 /*
177 * 32-Bit Memory Range Resource
178 */
179 /*
180 * For this resource the size is static
181 */
182 segment_size = 20;
183 break;
184
185 case fixed_memory32:
186 /*
187 * 32-Bit Fixed Memory Resource
188 */
189 /*
190 * For this resource the size is static
191 */
192 segment_size = 12;
193 break;
194
195 case address16:
196 /*
197 * 16-Bit Address Resource
198 */
199 /*
200 * The base size of this byte stream is 16. If a
201 * Resource Source string is not NULL, add 1 for
202 * the Index + the length of the null terminated
203 * string Resource Source + 1 for the null.
204 */
205 segment_size = 16;
206
207 if(NULL != linked_list->data.address16.resource_source) {
208 segment_size += (1 +
209 linked_list->data.address16.resource_source_string_length);
210 }
211 break;
212
213 case address32:
214 /*
215 * 32-Bit Address Resource
216 */
217 /*
218 * The base size of this byte stream is 26. If a Resource
219 * Source string is not NULL, add 1 for the Index + the
220 * length of the null terminated string Resource Source +
221 * 1 for the null.
222 */
223 segment_size = 26;
224
225 if(NULL != linked_list->data.address16.resource_source) {
226 segment_size += (1 +
227 linked_list->data.address16.resource_source_string_length);
228 }
229 break;
230
231 case extended_irq:
232 /*
233 * Extended IRQ Resource
234 */
235 /*
236 * The base size of this byte stream is 9. This is for an
237 * Interrupt table length of 1. For each additional
238 * interrupt, add 4.
239 * If a Resource Source string is not NULL, add 1 for the
240 * Index + the length of the null terminated string
241 * Resource Source + 1 for the null.
242 */
243 segment_size = 9;
244
245 segment_size +=
246 (linked_list->data.extended_irq.number_of_interrupts -
247 1) * 4;
248
249 if(NULL != ex_irq->resource_source) {
250 segment_size += (1 +
251 linked_list->data.extended_irq.resource_source_string_length);
252 }
253 break;
254
255 default:
256 /*
257 * If we get here, everything is out of sync,
258 * so exit with an error
259 */
260 return (AE_AML_ERROR);
261 break;
262
263 } /* switch (Linked_list->Id) */
264
265 /*
266 * Update the total
267 */
268 byte_stream_size_needed += segment_size;
269
270 /*
271 * Point to the next object
272 */
273 linked_list = (RESOURCE *) ((NATIVE_UINT) linked_list +
274 (NATIVE_UINT) linked_list->length);
275 }
276
277 /*
278 * This is the data the caller needs
279 */
280 *size_needed = byte_stream_size_needed;
281
282 return (AE_OK);
283 }
284
285
286 /*******************************************************************************
287 *
288 * FUNCTION: Acpi_rs_calculate_list_length
289 *
290 * PARAMETERS: Byte_stream_buffer - Pointer to the resource byte stream
291 * Byte_stream_buffer_length - Size of Byte_stream_buffer
292 * Size_needed - u32 pointer of the size buffer
293 * needed to properly return the
294 * parsed data
295 *
296 * RETURN: Status AE_OK if okay, else a valid ACPI_STATUS code
297 *
298 * DESCRIPTION: Takes the resource byte stream and parses it once, calculating
299 * the size buffer needed to hold the linked list that conveys
300 * the resource data.
301 *
302 ******************************************************************************/
303
304 ACPI_STATUS
305 acpi_rs_calculate_list_length (
306 u8 *byte_stream_buffer,
307 u32 byte_stream_buffer_length,
308 u32 *size_needed)
309 {
310 u32 buffer_size = 0;
311 u32 bytes_parsed = 0;
312 u8 number_of_interrupts = 0;
313 u8 number_of_channels = 0;
314 u8 resource_type;
315 u32 structure_size;
316 u32 bytes_consumed;
317 u8 *buffer;
318 u8 temp8;
319 u16 temp16;
320 u8 index;
321 u8 additional_bytes;
322
323
324 while (bytes_parsed < byte_stream_buffer_length) {
325 /*
326 * Look at the next byte in the stream
327 */
328 resource_type = *byte_stream_buffer;
329
330 /*
331 * See if this is a small or large resource
332 */
333 if(resource_type & 0x80) {
334 /*
335 * Large Resource Type
336 */
337 switch (resource_type)
338 {
339 case MEMORY_RANGE_24:
340 /*
341 * 24-Bit Memory Resource
342 */
343 bytes_consumed = 12;
344
345 structure_size = sizeof (MEMORY24_RESOURCE) +
346 RESOURCE_LENGTH_NO_DATA;
347 break;
348
349 case LARGE_VENDOR_DEFINED:
350 /*
351 * Vendor Defined Resource
352 */
353 buffer = byte_stream_buffer;
354 ++buffer;
355
356 MOVE_UNALIGNED16_TO_16 (&temp16, buffer);
357 bytes_consumed = temp16 + 3;
358
359 /*
360 * Ensure a 32-bit boundary for the structure
361 */
362 temp16 = (u16) ROUND_UP_TO_32_bITS (temp16);
363
364 structure_size = sizeof (VENDOR_RESOURCE) +
365 RESOURCE_LENGTH_NO_DATA +
366 (temp16 * sizeof (u8));
367 break;
368
369 case MEMORY_RANGE_32:
370 /*
371 * 32-Bit Memory Range Resource
372 */
373
374 bytes_consumed = 20;
375
376 structure_size = sizeof (MEMORY32_RESOURCE) +
377 RESOURCE_LENGTH_NO_DATA;
378 break;
379
380 case FIXED_MEMORY_RANGE_32:
381 /*
382 * 32-Bit Fixed Memory Resource
383 */
384 bytes_consumed = 12;
385
386 structure_size = sizeof(FIXED_MEMORY32_RESOURCE) +
387 RESOURCE_LENGTH_NO_DATA;
388 break;
389
390 case DWORD_ADDRESS_SPACE:
391 /*
392 * 32-Bit Address Resource
393 */
394 buffer = byte_stream_buffer;
395
396 ++buffer;
397 MOVE_UNALIGNED16_TO_16 (&temp16, buffer);
398
399 bytes_consumed = temp16 + 3;
400
401 /*
402 * Resource Source Index and Resource Source are
403 * optional elements. Check the length of the
404 * Bytestream. If it is greater than 23, that
405 * means that an Index exists and is followed by
406 * a null termininated string. Therefore, set
407 * the temp variable to the length minus the minimum
408 * byte stream length plus the byte for the Index to
409 * determine the size of the NULL terminiated string.
410 */
411 if (23 < temp16) {
412 temp8 = (u8) (temp16 - 24);
413 }
414 else {
415 temp8 = 0;
416 }
417
418 /*
419 * Ensure a 32-bit boundary for the structure
420 */
421 temp8 = (u8) ROUND_UP_TO_32_bITS (temp8);
422
423 structure_size = sizeof (ADDRESS32_RESOURCE) +
424 RESOURCE_LENGTH_NO_DATA +
425 (temp8 * sizeof (u8));
426 break;
427
428 case WORD_ADDRESS_SPACE:
429 /*
430 * 16-Bit Address Resource
431 */
432 buffer = byte_stream_buffer;
433
434 ++buffer;
435 MOVE_UNALIGNED16_TO_16 (&temp16, buffer);
436
437 bytes_consumed = temp16 + 3;
438
439 /*
440 * Resource Source Index and Resource Source are
441 * optional elements. Check the length of the
442 * Bytestream. If it is greater than 13, that
443 * means that an Index exists and is followed by
444 * a null termininated string. Therefore, set
445 * the temp variable to the length minus the minimum
446 * byte stream length plus the byte for the Index to
447 * determine the size of the NULL terminiated string.
448 */
449 if (13 < temp16) {
450 temp8 = (u8) (temp16 - 14);
451 }
452 else {
453 temp8 = 0;
454 }
455
456 /*
457 * Ensure a 32-bit boundry for the structure
458 */
459 temp8 = (u8) ROUND_UP_TO_32_bITS (temp8);
460
461 structure_size = sizeof (ADDRESS16_RESOURCE) +
462 RESOURCE_LENGTH_NO_DATA +
463 (temp8 * sizeof (u8));
464 break;
465
466 case EXTENDED_IRQ:
467 /*
468 * Extended IRQ
469 */
470 buffer = byte_stream_buffer;
471
472 ++buffer;
473 MOVE_UNALIGNED16_TO_16 (&temp16, buffer);
474
475 bytes_consumed = temp16 + 3;
476
477 /*
478 * Point past the length field and the
479 * Interrupt vector flags to save off the
480 * Interrupt table length to the Temp8 variable.
481 */
482 buffer += 3;
483 temp8 = *buffer;
484
485 /*
486 * To compensate for multiple interrupt numbers,
487 * Add 4 bytes for each additional interrupts
488 * greater than 1
489 */
490 additional_bytes = (u8) ((temp8 - 1) * 4);
491
492 /*
493 * Resource Source Index and Resource Source are
494 * optional elements. Check the length of the
495 * Bytestream. If it is greater than 9, that
496 * means that an Index exists and is followed by
497 * a null termininated string. Therefore, set
498 * the temp variable to the length minus the minimum
499 * byte stream length plus the byte for the Index to
500 * determine the size of the NULL terminiated string.
501 */
502 if (9 + additional_bytes < temp16) {
503 temp8 = (u8) (temp16 - (9 + additional_bytes));
504 }
505
506 else {
507 temp8 = 0;
508 }
509
510 /*
511 * Ensure a 32-bit boundry for the structure
512 */
513 temp8 = (u8) ROUND_UP_TO_32_bITS (temp8);
514
515 structure_size = sizeof (EXTENDED_IRQ_RESOURCE) +
516 RESOURCE_LENGTH_NO_DATA +
517 (additional_bytes * sizeof (u8)) +
518 (temp8 * sizeof (u8));
519
520 break;
521
522 /* TBD: [Future] 64-bit not currently supported */
523 /*
524 case 0x8A:
525 break;
526 */
527
528 default:
529 /*
530 * If we get here, everything is out of sync,
531 * so exit with an error
532 */
533 return (AE_AML_ERROR);
534 break;
535 }
536 }
537
538 else {
539 /*
540 * Small Resource Type
541 * Only bits 7:3 are valid
542 */
543 resource_type >>= 3;
544
545 switch (resource_type)
546 {
547 case IRQ_FORMAT:
548 /*
549 * IRQ Resource
550 */
551 /*
552 * Determine if it there are two or three
553 * trailing bytes
554 */
555 buffer = byte_stream_buffer;
556 temp8 = *buffer;
557
558 if(temp8 & 0x01) {
559 bytes_consumed = 4;
560 }
561
562 else {
563 bytes_consumed = 3;
564 }
565
566 /*
567 * Point past the descriptor
568 */
569 ++buffer;
570
571 /*
572 * Look at the number of bits set
573 */
574 MOVE_UNALIGNED16_TO_16 (&temp16, buffer);
575
576 for (index = 0; index < 16; index++) {
577 if (temp16 & 0x1) {
578 ++number_of_interrupts;
579 }
580
581 temp16 >>= 1;
582 }
583
584 structure_size = sizeof (IO_RESOURCE) +
585 RESOURCE_LENGTH_NO_DATA +
586 (number_of_interrupts * sizeof (u32));
587 break;
588
589
590 case DMA_FORMAT:
591
592 /*
593 * DMA Resource
594 */
595 buffer = byte_stream_buffer;
596
597 bytes_consumed = 3;
598
599 /*
600 * Point past the descriptor
601 */
602 ++buffer;
603
604 /*
605 * Look at the number of bits set
606 */
607 temp8 = *buffer;
608
609 for(index = 0; index < 8; index++) {
610 if(temp8 & 0x1) {
611 ++number_of_channels;
612 }
613
614 temp8 >>= 1;
615 }
616
617 structure_size = sizeof (DMA_RESOURCE) +
618 RESOURCE_LENGTH_NO_DATA +
619 (number_of_channels * sizeof (u32));
620 break;
621
622
623 case START_DEPENDENT_TAG:
624
625 /*
626 * Start Dependent Functions Resource
627 */
628 /*
629 * Determine if it there are two or three trailing bytes
630 */
631 buffer = byte_stream_buffer;
632 temp8 = *buffer;
633
634 if(temp8 & 0x01) {
635 bytes_consumed = 2;
636 }
637 else {
638 bytes_consumed = 1;
639 }
640
641
642 structure_size =
643 sizeof (START_DEPENDENT_FUNCTIONS_RESOURCE) +
644 RESOURCE_LENGTH_NO_DATA;
645 break;
646
647
648 case END_DEPENDENT_TAG:
649
650 /*
651 * End Dependent Functions Resource
652 */
653 bytes_consumed = 1;
654 structure_size = RESOURCE_LENGTH;
655 break;
656
657
658 case IO_PORT_DESCRIPTOR:
659 /*
660 * IO Port Resource
661 */
662 bytes_consumed = 8;
663 structure_size = sizeof (IO_RESOURCE) +
664 RESOURCE_LENGTH_NO_DATA;
665 break;
666
667
668 case FIXED_LOCATION_IO_DESCRIPTOR:
669
670 /*
671 * Fixed IO Port Resource
672 */
673 bytes_consumed = 4;
674 structure_size = sizeof (FIXED_IO_RESOURCE) +
675 RESOURCE_LENGTH_NO_DATA;
676 break;
677
678
679 case SMALL_VENDOR_DEFINED:
680
681 /*
682 * Vendor Specific Resource
683 */
684 buffer = byte_stream_buffer;
685
686 temp8 = *buffer;
687 temp8 = (u8) (temp8 & 0x7);
688 bytes_consumed = temp8 + 1;
689
690 /*
691 * Ensure a 32-bit boundry for the structure
692 */
693 temp8 = (u8) ROUND_UP_TO_32_bITS (temp8);
694 structure_size = sizeof (VENDOR_RESOURCE) +
695 RESOURCE_LENGTH_NO_DATA +
696 (temp8 * sizeof (u8));
697 break;
698
699
700 case END_TAG:
701
702 /*
703 * End Tag
704 */
705 bytes_consumed = 2;
706 structure_size = RESOURCE_LENGTH;
707 break;
708
709
710 default:
711 /*
712 * If we get here, everything is out of sync,
713 * so exit with an error
714 */
715 return (AE_AML_ERROR);
716 break;
717
718 } /* switch */
719
720 } /* if(Resource_type & 0x80) */
721
722 /*
723 * Update the return value and counter
724 */
725 buffer_size += structure_size;
726 bytes_parsed += bytes_consumed;
727
728 /*
729 * Set the byte stream to point to the next resource
730 */
731 byte_stream_buffer += bytes_consumed;
732
733 }
734
735 /*
736 * This is the data the caller needs
737 */
738 *size_needed = buffer_size;
739
740 return (AE_OK);
741 }
742
743
744 /*******************************************************************************
745 *
746 * FUNCTION: Acpi_rs_calculate_pci_routing_table_length
747 *
748 * PARAMETERS: Package_object - Pointer to the package object
749 * Buffer_size_needed - u32 pointer of the size buffer
750 * needed to properly return the
751 * parsed data
752 *
753 * RETURN: Status AE_OK
754 *
755 * DESCRIPTION: Given a package representing a PCI routing table, this
756 * calculates the size of the corresponding linked list of
757 * descriptions.
758 *
759 ******************************************************************************/
760
761 ACPI_STATUS
762 acpi_rs_calculate_pci_routing_table_length (
763 ACPI_OPERAND_OBJECT *package_object,
764 u32 *buffer_size_needed)
765 {
766 u32 number_of_elements;
767 u32 temp_size_needed = 0;
768 ACPI_OPERAND_OBJECT **top_object_list;
769 u32 index;
770 ACPI_OPERAND_OBJECT *package_element;
771 ACPI_OPERAND_OBJECT **sub_object_list;
772 u8 name_found;
773 u32 table_index;
774
775
776 number_of_elements = package_object->package.count;
777
778 /*
779 * Calculate the size of the return buffer.
780 * The base size is the number of elements * the sizes of the
781 * structures. Additional space for the strings is added below.
782 * The minus one is to subtract the size of the u8 Source[1]
783 * member because it is added below.
784 *
785 * NOTE: The Number_of_elements is incremented by one to add an end
786 * table structure that is essentially a structure of zeros.
787 */
788
789 /*
790 * But each PRT_ENTRY structure has a pointer to a string and
791 * the size of that string must be found.
792 */
793 top_object_list = package_object->package.elements;
794
795 for (index = 0; index < number_of_elements; index++) {
796 /*
797 * Dereference the sub-package
798 */
799 package_element = *top_object_list;
800
801 /*
802 * The Sub_object_list will now point to an array of the
803 * four IRQ elements: Address, Pin, Source and Source_index
804 */
805 sub_object_list = package_element->package.elements;
806
807 /*
808 * Scan the Irq_table_elements for the Source Name String
809 */
810 name_found = FALSE;
811
812 for (table_index = 0; table_index < 4 && !name_found; table_index++) {
813 if (ACPI_TYPE_STRING == (*sub_object_list)->common.type) {
814 name_found = TRUE;
815 }
816
817 else {
818 /*
819 * Look at the next element
820 */
821 sub_object_list++;
822 }
823 }
824
825 temp_size_needed += (sizeof (PCI_ROUTING_TABLE) - 1);
826
827 /*
828 * Was a String type found?
829 */
830 if (TRUE == name_found) {
831 /*
832 * The length String.Length field includes the
833 * terminating NULL
834 */
835 temp_size_needed += (*sub_object_list)->string.length;
836 }
837
838 else {
839 /*
840 * If no name was found, then this is a NULL, which is
841 * translated as a u32 zero.
842 */
843 temp_size_needed += sizeof(u32);
844 }
845
846
847 /* Round up the size since each element must be aligned */
848
849 temp_size_needed = ROUND_UP_TO_64_bITS (temp_size_needed);
850
851 /*
852 * Point to the next ACPI_OPERAND_OBJECT
853 */
854 top_object_list++;
855 }
856
857
858 *buffer_size_needed = temp_size_needed + sizeof (PCI_ROUTING_TABLE);
859
860 return (AE_OK);
861 }
Copy of Dave Jones history.git as used by http://archive.org/details/git-history-of-linux