4 * Procedures for interfacing to Open Firmware.
6 * Paul Mackerras August 1996.
7 * Copyright (C) 1996 Paul Mackerras.
9 * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner.
10 * {engebret|bergner}@us.ibm.com
12 * This program is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU General Public License
14 * as published by the Free Software Foundation; either version
15 * 2 of the License, or (at your option) any later version.
21 #include <linux/config.h>
22 #include <linux/kernel.h>
23 #include <linux/string.h>
24 #include <linux/init.h>
25 #include <linux/threads.h>
26 #include <linux/spinlock.h>
27 #include <linux/types.h>
28 #include <linux/pci.h>
29 #include <linux/stringify.h>
30 #include <linux/delay.h>
31 #include <linux/initrd.h>
32 #include <linux/bitops.h>
33 #include <linux/module.h>
38 #include <asm/abs_addr.h>
40 #include <asm/processor.h>
44 #include <asm/system.h>
46 #include <asm/pgtable.h>
48 #include <asm/iommu.h>
49 #include <asm/ppcdebug.h>
50 #include <asm/btext.h>
51 #include <asm/sections.h>
52 #include <asm/machdep.h>
53 #include <asm/pSeries_reconfig.h>
56 #define DBG(fmt...) udbg_printf(fmt)
61 struct pci_reg_property
{
62 struct pci_address addr
;
67 struct isa_reg_property
{
74 typedef int interpret_func(struct device_node
*, unsigned long *,
77 extern struct rtas_t rtas
;
78 extern struct lmb lmb
;
79 extern unsigned long klimit
;
80 extern unsigned long memory_limit
;
82 static int __initdata dt_root_addr_cells
;
83 static int __initdata dt_root_size_cells
;
84 static int __initdata iommu_is_off
;
85 int __initdata iommu_force_on
;
86 unsigned long tce_alloc_start
, tce_alloc_end
;
91 static struct boot_param_header
*initial_boot_params __initdata
;
93 struct boot_param_header
*initial_boot_params
;
96 static struct device_node
*allnodes
= NULL
;
98 /* use when traversing tree through the allnext, child, sibling,
99 * or parent members of struct device_node.
101 static DEFINE_RWLOCK(devtree_lock
);
103 /* export that to outside world */
104 struct device_node
*of_chosen
;
107 * Wrapper for allocating memory for various data that needs to be
108 * attached to device nodes as they are processed at boot or when
109 * added to the device tree later (e.g. DLPAR). At boot there is
110 * already a region reserved so we just increment *mem_start by size;
111 * otherwise we call kmalloc.
113 static void * prom_alloc(unsigned long size
, unsigned long *mem_start
)
118 return kmalloc(size
, GFP_KERNEL
);
126 * Find the device_node with a given phandle.
128 static struct device_node
* find_phandle(phandle ph
)
130 struct device_node
*np
;
132 for (np
= allnodes
; np
!= 0; np
= np
->allnext
)
133 if (np
->linux_phandle
== ph
)
139 * Find the interrupt parent of a node.
141 static struct device_node
* __devinit
intr_parent(struct device_node
*p
)
145 parp
= (phandle
*) get_property(p
, "interrupt-parent", NULL
);
148 return find_phandle(*parp
);
152 * Find out the size of each entry of the interrupts property
155 int __devinit
prom_n_intr_cells(struct device_node
*np
)
157 struct device_node
*p
;
160 for (p
= np
; (p
= intr_parent(p
)) != NULL
; ) {
161 icp
= (unsigned int *)
162 get_property(p
, "#interrupt-cells", NULL
);
165 if (get_property(p
, "interrupt-controller", NULL
) != NULL
166 || get_property(p
, "interrupt-map", NULL
) != NULL
) {
167 printk("oops, node %s doesn't have #interrupt-cells\n",
173 printk("prom_n_intr_cells failed for %s\n", np
->full_name
);
179 * Map an interrupt from a device up to the platform interrupt
182 static int __devinit
map_interrupt(unsigned int **irq
, struct device_node
**ictrler
,
183 struct device_node
*np
, unsigned int *ints
,
186 struct device_node
*p
, *ipar
;
187 unsigned int *imap
, *imask
, *ip
;
188 int i
, imaplen
, match
;
189 int newintrc
= 0, newaddrc
= 0;
193 reg
= (unsigned int *) get_property(np
, "reg", NULL
);
194 naddrc
= prom_n_addr_cells(np
);
197 if (get_property(p
, "interrupt-controller", NULL
) != NULL
)
198 /* this node is an interrupt controller, stop here */
200 imap
= (unsigned int *)
201 get_property(p
, "interrupt-map", &imaplen
);
206 imask
= (unsigned int *)
207 get_property(p
, "interrupt-map-mask", NULL
);
209 printk("oops, %s has interrupt-map but no mask\n",
213 imaplen
/= sizeof(unsigned int);
216 while (imaplen
> 0 && !match
) {
217 /* check the child-interrupt field */
219 for (i
= 0; i
< naddrc
&& match
; ++i
)
220 match
= ((reg
[i
] ^ imap
[i
]) & imask
[i
]) == 0;
221 for (; i
< naddrc
+ nintrc
&& match
; ++i
)
222 match
= ((ints
[i
-naddrc
] ^ imap
[i
]) & imask
[i
]) == 0;
223 imap
+= naddrc
+ nintrc
;
224 imaplen
-= naddrc
+ nintrc
;
225 /* grab the interrupt parent */
226 ipar
= find_phandle((phandle
) *imap
++);
229 printk("oops, no int parent %x in map of %s\n",
230 imap
[-1], p
->full_name
);
233 /* find the parent's # addr and intr cells */
234 ip
= (unsigned int *)
235 get_property(ipar
, "#interrupt-cells", NULL
);
237 printk("oops, no #interrupt-cells on %s\n",
242 ip
= (unsigned int *)
243 get_property(ipar
, "#address-cells", NULL
);
244 newaddrc
= (ip
== NULL
)? 0: *ip
;
245 imap
+= newaddrc
+ newintrc
;
246 imaplen
-= newaddrc
+ newintrc
;
249 printk("oops, error decoding int-map on %s, len=%d\n",
250 p
->full_name
, imaplen
);
255 printk("oops, no match in %s int-map for %s\n",
256 p
->full_name
, np
->full_name
);
263 ints
= imap
- nintrc
;
268 printk("hmmm, int tree for %s doesn't have ctrler\n",
278 static int __devinit
finish_node_interrupts(struct device_node
*np
,
279 unsigned long *mem_start
,
283 int intlen
, intrcells
, intrcount
;
285 unsigned int *irq
, virq
;
286 struct device_node
*ic
;
288 ints
= (unsigned int *) get_property(np
, "interrupts", &intlen
);
291 intrcells
= prom_n_intr_cells(np
);
292 intlen
/= intrcells
* sizeof(unsigned int);
294 np
->intrs
= prom_alloc(intlen
* sizeof(*(np
->intrs
)), mem_start
);
302 for (i
= 0; i
< intlen
; ++i
, ints
+= intrcells
) {
303 n
= map_interrupt(&irq
, &ic
, np
, ints
, intrcells
);
307 /* don't map IRQ numbers under a cascaded 8259 controller */
308 if (ic
&& device_is_compatible(ic
, "chrp,iic")) {
309 np
->intrs
[intrcount
].line
= irq
[0];
311 virq
= virt_irq_create_mapping(irq
[0]);
312 if (virq
== NO_IRQ
) {
313 printk(KERN_CRIT
"Could not allocate interrupt"
314 " number for %s\n", np
->full_name
);
317 np
->intrs
[intrcount
].line
= irq_offset_up(virq
);
320 /* We offset irq numbers for the u3 MPIC by 128 in PowerMac */
321 if (systemcfg
->platform
== PLATFORM_POWERMAC
&& ic
&& ic
->parent
) {
322 char *name
= get_property(ic
->parent
, "name", NULL
);
323 if (name
&& !strcmp(name
, "u3"))
324 np
->intrs
[intrcount
].line
+= 128;
325 else if (!(name
&& !strcmp(name
, "mac-io")))
326 /* ignore other cascaded controllers, such as
330 np
->intrs
[intrcount
].sense
= 1;
332 np
->intrs
[intrcount
].sense
= irq
[1];
334 printk("hmmm, got %d intr cells for %s:", n
,
336 for (j
= 0; j
< n
; ++j
)
337 printk(" %d", irq
[j
]);
342 np
->n_intrs
= intrcount
;
347 static int __devinit
interpret_pci_props(struct device_node
*np
,
348 unsigned long *mem_start
,
349 int naddrc
, int nsizec
,
352 struct address_range
*adr
;
353 struct pci_reg_property
*pci_addrs
;
356 pci_addrs
= (struct pci_reg_property
*)
357 get_property(np
, "assigned-addresses", &l
);
361 n_addrs
= l
/ sizeof(*pci_addrs
);
363 adr
= prom_alloc(n_addrs
* sizeof(*adr
), mem_start
);
371 np
->n_addrs
= n_addrs
;
373 for (i
= 0; i
< n_addrs
; i
++) {
374 adr
[i
].space
= pci_addrs
[i
].addr
.a_hi
;
375 adr
[i
].address
= pci_addrs
[i
].addr
.a_lo
|
376 ((u64
)pci_addrs
[i
].addr
.a_mid
<< 32);
377 adr
[i
].size
= pci_addrs
[i
].size_lo
;
383 static int __init
interpret_dbdma_props(struct device_node
*np
,
384 unsigned long *mem_start
,
385 int naddrc
, int nsizec
,
388 struct reg_property32
*rp
;
389 struct address_range
*adr
;
390 unsigned long base_address
;
392 struct device_node
*db
;
396 for (db
= np
->parent
; db
!= NULL
; db
= db
->parent
) {
397 if (!strcmp(db
->type
, "dbdma") && db
->n_addrs
!= 0) {
398 base_address
= db
->addrs
[0].address
;
404 rp
= (struct reg_property32
*) get_property(np
, "reg", &l
);
405 if (rp
!= 0 && l
>= sizeof(struct reg_property32
)) {
407 adr
= (struct address_range
*) (*mem_start
);
408 while ((l
-= sizeof(struct reg_property32
)) >= 0) {
411 adr
[i
].address
= rp
[i
].address
+ base_address
;
412 adr
[i
].size
= rp
[i
].size
;
418 (*mem_start
) += i
* sizeof(struct address_range
);
424 static int __init
interpret_macio_props(struct device_node
*np
,
425 unsigned long *mem_start
,
426 int naddrc
, int nsizec
,
429 struct reg_property32
*rp
;
430 struct address_range
*adr
;
431 unsigned long base_address
;
433 struct device_node
*db
;
437 for (db
= np
->parent
; db
!= NULL
; db
= db
->parent
) {
438 if (!strcmp(db
->type
, "mac-io") && db
->n_addrs
!= 0) {
439 base_address
= db
->addrs
[0].address
;
445 rp
= (struct reg_property32
*) get_property(np
, "reg", &l
);
446 if (rp
!= 0 && l
>= sizeof(struct reg_property32
)) {
448 adr
= (struct address_range
*) (*mem_start
);
449 while ((l
-= sizeof(struct reg_property32
)) >= 0) {
452 adr
[i
].address
= rp
[i
].address
+ base_address
;
453 adr
[i
].size
= rp
[i
].size
;
459 (*mem_start
) += i
* sizeof(struct address_range
);
465 static int __init
interpret_isa_props(struct device_node
*np
,
466 unsigned long *mem_start
,
467 int naddrc
, int nsizec
,
470 struct isa_reg_property
*rp
;
471 struct address_range
*adr
;
474 rp
= (struct isa_reg_property
*) get_property(np
, "reg", &l
);
475 if (rp
!= 0 && l
>= sizeof(struct isa_reg_property
)) {
477 adr
= (struct address_range
*) (*mem_start
);
478 while ((l
-= sizeof(struct isa_reg_property
)) >= 0) {
480 adr
[i
].space
= rp
[i
].space
;
481 adr
[i
].address
= rp
[i
].address
;
482 adr
[i
].size
= rp
[i
].size
;
488 (*mem_start
) += i
* sizeof(struct address_range
);
494 static int __init
interpret_root_props(struct device_node
*np
,
495 unsigned long *mem_start
,
496 int naddrc
, int nsizec
,
499 struct address_range
*adr
;
502 int rpsize
= (naddrc
+ nsizec
) * sizeof(unsigned int);
504 rp
= (unsigned int *) get_property(np
, "reg", &l
);
505 if (rp
!= 0 && l
>= rpsize
) {
507 adr
= (struct address_range
*) (*mem_start
);
508 while ((l
-= rpsize
) >= 0) {
511 adr
[i
].address
= rp
[naddrc
- 1];
512 adr
[i
].size
= rp
[naddrc
+ nsizec
- 1];
515 rp
+= naddrc
+ nsizec
;
519 (*mem_start
) += i
* sizeof(struct address_range
);
525 static int __devinit
finish_node(struct device_node
*np
,
526 unsigned long *mem_start
,
527 interpret_func
*ifunc
,
528 int naddrc
, int nsizec
,
531 struct device_node
*child
;
534 /* get the device addresses and interrupts */
536 rc
= ifunc(np
, mem_start
, naddrc
, nsizec
, measure_only
);
540 rc
= finish_node_interrupts(np
, mem_start
, measure_only
);
544 /* Look for #address-cells and #size-cells properties. */
545 ip
= (int *) get_property(np
, "#address-cells", NULL
);
548 ip
= (int *) get_property(np
, "#size-cells", NULL
);
552 if (!strcmp(np
->name
, "device-tree") || np
->parent
== NULL
)
553 ifunc
= interpret_root_props
;
554 else if (np
->type
== 0)
556 else if (!strcmp(np
->type
, "pci") || !strcmp(np
->type
, "vci"))
557 ifunc
= interpret_pci_props
;
558 else if (!strcmp(np
->type
, "dbdma"))
559 ifunc
= interpret_dbdma_props
;
560 else if (!strcmp(np
->type
, "mac-io") || ifunc
== interpret_macio_props
)
561 ifunc
= interpret_macio_props
;
562 else if (!strcmp(np
->type
, "isa"))
563 ifunc
= interpret_isa_props
;
564 else if (!strcmp(np
->name
, "uni-n") || !strcmp(np
->name
, "u3"))
565 ifunc
= interpret_root_props
;
566 else if (!((ifunc
== interpret_dbdma_props
567 || ifunc
== interpret_macio_props
)
568 && (!strcmp(np
->type
, "escc")
569 || !strcmp(np
->type
, "media-bay"))))
572 for (child
= np
->child
; child
!= NULL
; child
= child
->sibling
) {
573 rc
= finish_node(child
, mem_start
, ifunc
,
574 naddrc
, nsizec
, measure_only
);
583 * finish_device_tree is called once things are running normally
584 * (i.e. with text and data mapped to the address they were linked at).
585 * It traverses the device tree and fills in some of the additional,
586 * fields in each node like {n_}addrs and {n_}intrs, the virt interrupt
587 * mapping is also initialized at this point.
589 void __init
finish_device_tree(void)
591 unsigned long start
, end
, size
= 0;
593 DBG(" -> finish_device_tree\n");
595 if (ppc64_interrupt_controller
== IC_INVALID
) {
596 DBG("failed to configure interrupt controller type\n");
597 panic("failed to configure interrupt controller type\n");
600 /* Initialize virtual IRQ map */
604 * Finish device-tree (pre-parsing some properties etc...)
605 * We do this in 2 passes. One with "measure_only" set, which
606 * will only measure the amount of memory needed, then we can
607 * allocate that memory, and call finish_node again. However,
608 * we must be careful as most routines will fail nowadays when
609 * prom_alloc() returns 0, so we must make sure our first pass
610 * doesn't start at 0. We pre-initialize size to 16 for that
611 * reason and then remove those additional 16 bytes
614 finish_node(allnodes
, &size
, NULL
, 0, 0, 1);
616 end
= start
= (unsigned long)abs_to_virt(lmb_alloc(size
, 128));
617 finish_node(allnodes
, &end
, NULL
, 0, 0, 0);
618 BUG_ON(end
!= start
+ size
);
620 DBG(" <- finish_device_tree\n");
624 #define printk udbg_printf
627 static inline char *find_flat_dt_string(u32 offset
)
629 return ((char *)initial_boot_params
) +
630 initial_boot_params
->off_dt_strings
+ offset
;
634 * This function is used to scan the flattened device-tree, it is
635 * used to extract the memory informations at boot before we can
638 int __init
of_scan_flat_dt(int (*it
)(unsigned long node
,
639 const char *uname
, int depth
,
643 unsigned long p
= ((unsigned long)initial_boot_params
) +
644 initial_boot_params
->off_dt_struct
;
649 u32 tag
= *((u32
*)p
);
653 if (tag
== OF_DT_END_NODE
) {
657 if (tag
== OF_DT_NOP
)
659 if (tag
== OF_DT_END
)
661 if (tag
== OF_DT_PROP
) {
662 u32 sz
= *((u32
*)p
);
664 if (initial_boot_params
->version
< 0x10)
665 p
= _ALIGN(p
, sz
>= 8 ? 8 : 4);
670 if (tag
!= OF_DT_BEGIN_NODE
) {
671 printk(KERN_WARNING
"Invalid tag %x scanning flattened"
672 " device tree !\n", tag
);
677 p
= _ALIGN(p
+ strlen(pathp
) + 1, 4);
678 if ((*pathp
) == '/') {
680 for (lp
= NULL
, np
= pathp
; *np
; np
++)
686 rc
= it(p
, pathp
, depth
, data
);
695 * This function can be used within scan_flattened_dt callback to get
696 * access to properties
698 void* __init
of_get_flat_dt_prop(unsigned long node
, const char *name
,
701 unsigned long p
= node
;
704 u32 tag
= *((u32
*)p
);
709 if (tag
== OF_DT_NOP
)
711 if (tag
!= OF_DT_PROP
)
715 noff
= *((u32
*)(p
+ 4));
717 if (initial_boot_params
->version
< 0x10)
718 p
= _ALIGN(p
, sz
>= 8 ? 8 : 4);
720 nstr
= find_flat_dt_string(noff
);
722 printk(KERN_WARNING
"Can't find property index"
726 if (strcmp(name
, nstr
) == 0) {
736 static void *__init
unflatten_dt_alloc(unsigned long *mem
, unsigned long size
,
741 *mem
= _ALIGN(*mem
, align
);
748 static unsigned long __init
unflatten_dt_node(unsigned long mem
,
750 struct device_node
*dad
,
751 struct device_node
***allnextpp
,
752 unsigned long fpsize
)
754 struct device_node
*np
;
755 struct property
*pp
, **prev_pp
= NULL
;
758 unsigned int l
, allocl
;
762 tag
= *((u32
*)(*p
));
763 if (tag
!= OF_DT_BEGIN_NODE
) {
764 printk("Weird tag at start of node: %x\n", tag
);
769 l
= allocl
= strlen(pathp
) + 1;
770 *p
= _ALIGN(*p
+ l
, 4);
772 /* version 0x10 has a more compact unit name here instead of the full
773 * path. we accumulate the full path size using "fpsize", we'll rebuild
774 * it later. We detect this because the first character of the name is
777 if ((*pathp
) != '/') {
780 /* root node: special case. fpsize accounts for path
781 * plus terminating zero. root node only has '/', so
782 * fpsize should be 2, but we want to avoid the first
783 * level nodes to have two '/' so we use fpsize 1 here
788 /* account for '/' and path size minus terminal 0
797 np
= unflatten_dt_alloc(&mem
, sizeof(struct device_node
) + allocl
,
798 __alignof__(struct device_node
));
800 memset(np
, 0, sizeof(*np
));
801 np
->full_name
= ((char*)np
) + sizeof(struct device_node
);
803 char *p
= np
->full_name
;
804 /* rebuild full path for new format */
805 if (dad
&& dad
->parent
) {
806 strcpy(p
, dad
->full_name
);
808 if ((strlen(p
) + l
+ 1) != allocl
) {
809 DBG("%s: p: %d, l: %d, a: %d\n",
810 pathp
, strlen(p
), l
, allocl
);
818 memcpy(np
->full_name
, pathp
, l
);
819 prev_pp
= &np
->properties
;
821 *allnextpp
= &np
->allnext
;
824 /* we temporarily use the next field as `last_child'*/
828 dad
->next
->sibling
= np
;
831 kref_init(&np
->kref
);
837 tag
= *((u32
*)(*p
));
838 if (tag
== OF_DT_NOP
) {
842 if (tag
!= OF_DT_PROP
)
846 noff
= *((u32
*)((*p
) + 4));
848 if (initial_boot_params
->version
< 0x10)
849 *p
= _ALIGN(*p
, sz
>= 8 ? 8 : 4);
851 pname
= find_flat_dt_string(noff
);
853 printk("Can't find property name in list !\n");
856 if (strcmp(pname
, "name") == 0)
858 l
= strlen(pname
) + 1;
859 pp
= unflatten_dt_alloc(&mem
, sizeof(struct property
),
860 __alignof__(struct property
));
862 if (strcmp(pname
, "linux,phandle") == 0) {
863 np
->node
= *((u32
*)*p
);
864 if (np
->linux_phandle
== 0)
865 np
->linux_phandle
= np
->node
;
867 if (strcmp(pname
, "ibm,phandle") == 0)
868 np
->linux_phandle
= *((u32
*)*p
);
871 pp
->value
= (void *)*p
;
875 *p
= _ALIGN((*p
) + sz
, 4);
877 /* with version 0x10 we may not have the name property, recreate
878 * it here from the unit name if absent
881 char *p
= pathp
, *ps
= pathp
, *pa
= NULL
;
894 pp
= unflatten_dt_alloc(&mem
, sizeof(struct property
) + sz
,
895 __alignof__(struct property
));
899 pp
->value
= (unsigned char *)(pp
+ 1);
902 memcpy(pp
->value
, ps
, sz
- 1);
903 ((char *)pp
->value
)[sz
- 1] = 0;
904 DBG("fixed up name for %s -> %s\n", pathp
, pp
->value
);
909 np
->name
= get_property(np
, "name", NULL
);
910 np
->type
= get_property(np
, "device_type", NULL
);
917 while (tag
== OF_DT_BEGIN_NODE
) {
918 mem
= unflatten_dt_node(mem
, p
, np
, allnextpp
, fpsize
);
919 tag
= *((u32
*)(*p
));
921 if (tag
!= OF_DT_END_NODE
) {
922 printk("Weird tag at end of node: %x\n", tag
);
931 * unflattens the device-tree passed by the firmware, creating the
932 * tree of struct device_node. It also fills the "name" and "type"
933 * pointers of the nodes so the normal device-tree walking functions
934 * can be used (this used to be done by finish_device_tree)
936 void __init
unflatten_device_tree(void)
938 unsigned long start
, mem
, size
;
939 struct device_node
**allnextp
= &allnodes
;
943 DBG(" -> unflatten_device_tree()\n");
945 /* First pass, scan for size */
946 start
= ((unsigned long)initial_boot_params
) +
947 initial_boot_params
->off_dt_struct
;
948 size
= unflatten_dt_node(0, &start
, NULL
, NULL
, 0);
949 size
= (size
| 3) + 1;
951 DBG(" size is %lx, allocating...\n", size
);
953 /* Allocate memory for the expanded device tree */
954 mem
= lmb_alloc(size
+ 4, __alignof__(struct device_node
));
956 DBG("Couldn't allocate memory with lmb_alloc()!\n");
957 panic("Couldn't allocate memory with lmb_alloc()!\n");
959 mem
= (unsigned long)abs_to_virt(mem
);
961 ((u32
*)mem
)[size
/ 4] = 0xdeadbeef;
963 DBG(" unflattening...\n", mem
);
965 /* Second pass, do actual unflattening */
966 start
= ((unsigned long)initial_boot_params
) +
967 initial_boot_params
->off_dt_struct
;
968 unflatten_dt_node(mem
, &start
, NULL
, &allnextp
, 0);
969 if (*((u32
*)start
) != OF_DT_END
)
970 printk(KERN_WARNING
"Weird tag at end of tree: %08x\n", *((u32
*)start
));
971 if (((u32
*)mem
)[size
/ 4] != 0xdeadbeef)
972 printk(KERN_WARNING
"End of tree marker overwritten: %08x\n",
973 ((u32
*)mem
)[size
/ 4] );
976 /* Get pointer to OF "/chosen" node for use everywhere */
977 of_chosen
= of_find_node_by_path("/chosen");
979 /* Retreive command line */
980 if (of_chosen
!= NULL
) {
981 p
= (char *)get_property(of_chosen
, "bootargs", &l
);
982 if (p
!= NULL
&& l
> 0)
983 strlcpy(cmd_line
, p
, min(l
, COMMAND_LINE_SIZE
));
985 #ifdef CONFIG_CMDLINE
986 if (l
== 0 || (l
== 1 && (*p
) == 0))
987 strlcpy(cmd_line
, CONFIG_CMDLINE
, COMMAND_LINE_SIZE
);
988 #endif /* CONFIG_CMDLINE */
990 DBG("Command line is: %s\n", cmd_line
);
992 DBG(" <- unflatten_device_tree()\n");
996 static int __init
early_init_dt_scan_cpus(unsigned long node
,
997 const char *uname
, int depth
, void *data
)
999 char *type
= of_get_flat_dt_prop(node
, "device_type", NULL
);
1003 /* We are scanning "cpu" nodes only */
1004 if (type
== NULL
|| strcmp(type
, "cpu") != 0)
1007 if (initial_boot_params
&& initial_boot_params
->version
>= 2) {
1008 /* version 2 of the kexec param format adds the phys cpuid
1011 boot_cpuid_phys
= initial_boot_params
->boot_cpuid_phys
;
1014 /* Check if it's the boot-cpu, set it's hw index in paca now */
1015 if (of_get_flat_dt_prop(node
, "linux,boot-cpu", NULL
)
1017 u32
*prop
= of_get_flat_dt_prop(node
, "reg", NULL
);
1018 set_hard_smp_processor_id(0, prop
== NULL
? 0 : *prop
);
1019 boot_cpuid_phys
= get_hard_smp_processor_id(0);
1023 #ifdef CONFIG_ALTIVEC
1024 /* Check if we have a VMX and eventually update CPU features */
1025 prop
= (u32
*)of_get_flat_dt_prop(node
, "ibm,vmx", NULL
);
1026 if (prop
&& (*prop
) > 0) {
1027 cur_cpu_spec
->cpu_features
|= CPU_FTR_ALTIVEC
;
1028 cur_cpu_spec
->cpu_user_features
|= PPC_FEATURE_HAS_ALTIVEC
;
1031 /* Same goes for Apple's "altivec" property */
1032 prop
= (u32
*)of_get_flat_dt_prop(node
, "altivec", NULL
);
1034 cur_cpu_spec
->cpu_features
|= CPU_FTR_ALTIVEC
;
1035 cur_cpu_spec
->cpu_user_features
|= PPC_FEATURE_HAS_ALTIVEC
;
1037 #endif /* CONFIG_ALTIVEC */
1040 * Check for an SMT capable CPU and set the CPU feature. We do
1041 * this by looking at the size of the ibm,ppc-interrupt-server#s
1044 prop
= (u32
*)of_get_flat_dt_prop(node
, "ibm,ppc-interrupt-server#s",
1046 cur_cpu_spec
->cpu_features
&= ~CPU_FTR_SMT
;
1047 if (prop
&& ((size
/ sizeof(u32
)) > 1))
1048 cur_cpu_spec
->cpu_features
|= CPU_FTR_SMT
;
1053 static int __init
early_init_dt_scan_chosen(unsigned long node
,
1054 const char *uname
, int depth
, void *data
)
1059 DBG("search \"chosen\", depth: %d, uname: %s\n", depth
, uname
);
1061 if (depth
!= 1 || strcmp(uname
, "chosen") != 0)
1064 /* get platform type */
1065 prop
= (u32
*)of_get_flat_dt_prop(node
, "linux,platform", NULL
);
1068 systemcfg
->platform
= *prop
;
1070 /* check if iommu is forced on or off */
1071 if (of_get_flat_dt_prop(node
, "linux,iommu-off", NULL
) != NULL
)
1073 if (of_get_flat_dt_prop(node
, "linux,iommu-force-on", NULL
) != NULL
)
1076 prop64
= (u64
*)of_get_flat_dt_prop(node
, "linux,memory-limit", NULL
);
1078 memory_limit
= *prop64
;
1080 prop64
= (u64
*)of_get_flat_dt_prop(node
, "linux,tce-alloc-start",NULL
);
1082 tce_alloc_start
= *prop64
;
1084 prop64
= (u64
*)of_get_flat_dt_prop(node
, "linux,tce-alloc-end", NULL
);
1086 tce_alloc_end
= *prop64
;
1088 #ifdef CONFIG_PPC_RTAS
1089 /* To help early debugging via the front panel, we retreive a minimal
1090 * set of RTAS infos now if available
1093 u64
*basep
, *entryp
;
1095 basep
= (u64
*)of_get_flat_dt_prop(node
,
1096 "linux,rtas-base", NULL
);
1097 entryp
= (u64
*)of_get_flat_dt_prop(node
,
1098 "linux,rtas-entry", NULL
);
1099 prop
= (u32
*)of_get_flat_dt_prop(node
,
1100 "linux,rtas-size", NULL
);
1101 if (basep
&& entryp
&& prop
) {
1103 rtas
.entry
= *entryp
;
1107 #endif /* CONFIG_PPC_RTAS */
1113 static int __init
early_init_dt_scan_root(unsigned long node
,
1114 const char *uname
, int depth
, void *data
)
1121 prop
= (u32
*)of_get_flat_dt_prop(node
, "#size-cells", NULL
);
1122 dt_root_size_cells
= (prop
== NULL
) ? 1 : *prop
;
1123 DBG("dt_root_size_cells = %x\n", dt_root_size_cells
);
1125 prop
= (u32
*)of_get_flat_dt_prop(node
, "#address-cells", NULL
);
1126 dt_root_addr_cells
= (prop
== NULL
) ? 2 : *prop
;
1127 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells
);
1133 static unsigned long __init
dt_mem_next_cell(int s
, cell_t
**cellp
)
1136 unsigned long r
= 0;
1138 /* Ignore more than 2 cells */
1154 static int __init
early_init_dt_scan_memory(unsigned long node
,
1155 const char *uname
, int depth
, void *data
)
1157 char *type
= of_get_flat_dt_prop(node
, "device_type", NULL
);
1161 /* We are scanning "memory" nodes only */
1162 if (type
== NULL
|| strcmp(type
, "memory") != 0)
1165 reg
= (cell_t
*)of_get_flat_dt_prop(node
, "reg", &l
);
1169 endp
= reg
+ (l
/ sizeof(cell_t
));
1171 DBG("memory scan node %s ..., reg size %ld, data: %x %x %x %x, ...\n",
1172 uname
, l
, reg
[0], reg
[1], reg
[2], reg
[3]);
1174 while ((endp
- reg
) >= (dt_root_addr_cells
+ dt_root_size_cells
)) {
1175 unsigned long base
, size
;
1177 base
= dt_mem_next_cell(dt_root_addr_cells
, ®
);
1178 size
= dt_mem_next_cell(dt_root_size_cells
, ®
);
1182 DBG(" - %lx , %lx\n", base
, size
);
1184 if (base
>= 0x80000000ul
)
1186 if ((base
+ size
) > 0x80000000ul
)
1187 size
= 0x80000000ul
- base
;
1189 lmb_add(base
, size
);
1194 static void __init
early_reserve_mem(void)
1197 u64
*reserve_map
= (u64
*)(((unsigned long)initial_boot_params
) +
1198 initial_boot_params
->off_mem_rsvmap
);
1200 base
= *(reserve_map
++);
1201 size
= *(reserve_map
++);
1204 DBG("reserving: %lx -> %lx\n", base
, size
);
1205 lmb_reserve(base
, size
);
1209 DBG("memory reserved, lmbs :\n");
1214 void __init
early_init_devtree(void *params
)
1216 DBG(" -> early_init_devtree()\n");
1218 /* Setup flat device-tree pointer */
1219 initial_boot_params
= params
;
1221 /* Retreive various informations from the /chosen node of the
1222 * device-tree, including the platform type, initrd location and
1223 * size, TCE reserve, and more ...
1225 of_scan_flat_dt(early_init_dt_scan_chosen
, NULL
);
1227 /* Scan memory nodes and rebuild LMBs */
1229 of_scan_flat_dt(early_init_dt_scan_root
, NULL
);
1230 of_scan_flat_dt(early_init_dt_scan_memory
, NULL
);
1231 lmb_enforce_memory_limit(memory_limit
);
1233 systemcfg
->physicalMemorySize
= lmb_phys_mem_size();
1234 lmb_reserve(0, __pa(klimit
));
1236 DBG("Phys. mem: %lx\n", systemcfg
->physicalMemorySize
);
1238 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
1239 early_reserve_mem();
1241 DBG("Scanning CPUs ...\n");
1243 /* Retreive hash table size from flattened tree plus other
1244 * CPU related informations (altivec support, boot CPU ID, ...)
1246 of_scan_flat_dt(early_init_dt_scan_cpus
, NULL
);
1248 DBG(" <- early_init_devtree()\n");
1254 prom_n_addr_cells(struct device_node
* np
)
1260 ip
= (int *) get_property(np
, "#address-cells", NULL
);
1263 } while (np
->parent
);
1264 /* No #address-cells property for the root node, default to 1 */
1269 prom_n_size_cells(struct device_node
* np
)
1275 ip
= (int *) get_property(np
, "#size-cells", NULL
);
1278 } while (np
->parent
);
1279 /* No #size-cells property for the root node, default to 1 */
1284 * Work out the sense (active-low level / active-high edge)
1285 * of each interrupt from the device tree.
1287 void __init
prom_get_irq_senses(unsigned char *senses
, int off
, int max
)
1289 struct device_node
*np
;
1292 /* default to level-triggered */
1293 memset(senses
, 1, max
- off
);
1295 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1296 for (j
= 0; j
< np
->n_intrs
; j
++) {
1297 i
= np
->intrs
[j
].line
;
1298 if (i
>= off
&& i
< max
)
1299 senses
[i
-off
] = np
->intrs
[j
].sense
?
1300 IRQ_SENSE_LEVEL
| IRQ_POLARITY_NEGATIVE
:
1301 IRQ_SENSE_EDGE
| IRQ_POLARITY_POSITIVE
;
1307 * Construct and return a list of the device_nodes with a given name.
1309 struct device_node
*
1310 find_devices(const char *name
)
1312 struct device_node
*head
, **prevp
, *np
;
1315 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1316 if (np
->name
!= 0 && strcasecmp(np
->name
, name
) == 0) {
1324 EXPORT_SYMBOL(find_devices
);
1327 * Construct and return a list of the device_nodes with a given type.
1329 struct device_node
*
1330 find_type_devices(const char *type
)
1332 struct device_node
*head
, **prevp
, *np
;
1335 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1336 if (np
->type
!= 0 && strcasecmp(np
->type
, type
) == 0) {
1344 EXPORT_SYMBOL(find_type_devices
);
1347 * Returns all nodes linked together
1349 struct device_node
*
1350 find_all_nodes(void)
1352 struct device_node
*head
, **prevp
, *np
;
1355 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1362 EXPORT_SYMBOL(find_all_nodes
);
1364 /** Checks if the given "compat" string matches one of the strings in
1365 * the device's "compatible" property
1368 device_is_compatible(struct device_node
*device
, const char *compat
)
1373 cp
= (char *) get_property(device
, "compatible", &cplen
);
1377 if (strncasecmp(cp
, compat
, strlen(compat
)) == 0)
1386 EXPORT_SYMBOL(device_is_compatible
);
1390 * Indicates whether the root node has a given value in its
1391 * compatible property.
1394 machine_is_compatible(const char *compat
)
1396 struct device_node
*root
;
1399 root
= of_find_node_by_path("/");
1401 rc
= device_is_compatible(root
, compat
);
1406 EXPORT_SYMBOL(machine_is_compatible
);
1409 * Construct and return a list of the device_nodes with a given type
1410 * and compatible property.
1412 struct device_node
*
1413 find_compatible_devices(const char *type
, const char *compat
)
1415 struct device_node
*head
, **prevp
, *np
;
1418 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1420 && !(np
->type
!= 0 && strcasecmp(np
->type
, type
) == 0))
1422 if (device_is_compatible(np
, compat
)) {
1430 EXPORT_SYMBOL(find_compatible_devices
);
1433 * Find the device_node with a given full_name.
1435 struct device_node
*
1436 find_path_device(const char *path
)
1438 struct device_node
*np
;
1440 for (np
= allnodes
; np
!= 0; np
= np
->allnext
)
1441 if (np
->full_name
!= 0 && strcasecmp(np
->full_name
, path
) == 0)
1445 EXPORT_SYMBOL(find_path_device
);
1449 * New implementation of the OF "find" APIs, return a refcounted
1450 * object, call of_node_put() when done. The device tree and list
1451 * are protected by a rw_lock.
1453 * Note that property management will need some locking as well,
1454 * this isn't dealt with yet.
1459 * of_find_node_by_name - Find a node by its "name" property
1460 * @from: The node to start searching from or NULL, the node
1461 * you pass will not be searched, only the next one
1462 * will; typically, you pass what the previous call
1463 * returned. of_node_put() will be called on it
1464 * @name: The name string to match against
1466 * Returns a node pointer with refcount incremented, use
1467 * of_node_put() on it when done.
1469 struct device_node
*of_find_node_by_name(struct device_node
*from
,
1472 struct device_node
*np
;
1474 read_lock(&devtree_lock
);
1475 np
= from
? from
->allnext
: allnodes
;
1476 for (; np
!= 0; np
= np
->allnext
)
1477 if (np
->name
!= 0 && strcasecmp(np
->name
, name
) == 0
1482 read_unlock(&devtree_lock
);
1485 EXPORT_SYMBOL(of_find_node_by_name
);
1488 * of_find_node_by_type - Find a node by its "device_type" property
1489 * @from: The node to start searching from or NULL, the node
1490 * you pass will not be searched, only the next one
1491 * will; typically, you pass what the previous call
1492 * returned. of_node_put() will be called on it
1493 * @name: The type string to match against
1495 * Returns a node pointer with refcount incremented, use
1496 * of_node_put() on it when done.
1498 struct device_node
*of_find_node_by_type(struct device_node
*from
,
1501 struct device_node
*np
;
1503 read_lock(&devtree_lock
);
1504 np
= from
? from
->allnext
: allnodes
;
1505 for (; np
!= 0; np
= np
->allnext
)
1506 if (np
->type
!= 0 && strcasecmp(np
->type
, type
) == 0
1511 read_unlock(&devtree_lock
);
1514 EXPORT_SYMBOL(of_find_node_by_type
);
1517 * of_find_compatible_node - Find a node based on type and one of the
1518 * tokens in its "compatible" property
1519 * @from: The node to start searching from or NULL, the node
1520 * you pass will not be searched, only the next one
1521 * will; typically, you pass what the previous call
1522 * returned. of_node_put() will be called on it
1523 * @type: The type string to match "device_type" or NULL to ignore
1524 * @compatible: The string to match to one of the tokens in the device
1525 * "compatible" list.
1527 * Returns a node pointer with refcount incremented, use
1528 * of_node_put() on it when done.
1530 struct device_node
*of_find_compatible_node(struct device_node
*from
,
1531 const char *type
, const char *compatible
)
1533 struct device_node
*np
;
1535 read_lock(&devtree_lock
);
1536 np
= from
? from
->allnext
: allnodes
;
1537 for (; np
!= 0; np
= np
->allnext
) {
1539 && !(np
->type
!= 0 && strcasecmp(np
->type
, type
) == 0))
1541 if (device_is_compatible(np
, compatible
) && of_node_get(np
))
1546 read_unlock(&devtree_lock
);
1549 EXPORT_SYMBOL(of_find_compatible_node
);
1552 * of_find_node_by_path - Find a node matching a full OF path
1553 * @path: The full path to match
1555 * Returns a node pointer with refcount incremented, use
1556 * of_node_put() on it when done.
1558 struct device_node
*of_find_node_by_path(const char *path
)
1560 struct device_node
*np
= allnodes
;
1562 read_lock(&devtree_lock
);
1563 for (; np
!= 0; np
= np
->allnext
) {
1564 if (np
->full_name
!= 0 && strcasecmp(np
->full_name
, path
) == 0
1568 read_unlock(&devtree_lock
);
1571 EXPORT_SYMBOL(of_find_node_by_path
);
1574 * of_find_node_by_phandle - Find a node given a phandle
1575 * @handle: phandle of the node to find
1577 * Returns a node pointer with refcount incremented, use
1578 * of_node_put() on it when done.
1580 struct device_node
*of_find_node_by_phandle(phandle handle
)
1582 struct device_node
*np
;
1584 read_lock(&devtree_lock
);
1585 for (np
= allnodes
; np
!= 0; np
= np
->allnext
)
1586 if (np
->linux_phandle
== handle
)
1590 read_unlock(&devtree_lock
);
1593 EXPORT_SYMBOL(of_find_node_by_phandle
);
1596 * of_find_all_nodes - Get next node in global list
1597 * @prev: Previous node or NULL to start iteration
1598 * of_node_put() will be called on it
1600 * Returns a node pointer with refcount incremented, use
1601 * of_node_put() on it when done.
1603 struct device_node
*of_find_all_nodes(struct device_node
*prev
)
1605 struct device_node
*np
;
1607 read_lock(&devtree_lock
);
1608 np
= prev
? prev
->allnext
: allnodes
;
1609 for (; np
!= 0; np
= np
->allnext
)
1610 if (of_node_get(np
))
1614 read_unlock(&devtree_lock
);
1617 EXPORT_SYMBOL(of_find_all_nodes
);
1620 * of_get_parent - Get a node's parent if any
1621 * @node: Node to get parent
1623 * Returns a node pointer with refcount incremented, use
1624 * of_node_put() on it when done.
1626 struct device_node
*of_get_parent(const struct device_node
*node
)
1628 struct device_node
*np
;
1633 read_lock(&devtree_lock
);
1634 np
= of_node_get(node
->parent
);
1635 read_unlock(&devtree_lock
);
1638 EXPORT_SYMBOL(of_get_parent
);
1641 * of_get_next_child - Iterate a node childs
1642 * @node: parent node
1643 * @prev: previous child of the parent node, or NULL to get first
1645 * Returns a node pointer with refcount incremented, use
1646 * of_node_put() on it when done.
1648 struct device_node
*of_get_next_child(const struct device_node
*node
,
1649 struct device_node
*prev
)
1651 struct device_node
*next
;
1653 read_lock(&devtree_lock
);
1654 next
= prev
? prev
->sibling
: node
->child
;
1655 for (; next
!= 0; next
= next
->sibling
)
1656 if (of_node_get(next
))
1660 read_unlock(&devtree_lock
);
1663 EXPORT_SYMBOL(of_get_next_child
);
1666 * of_node_get - Increment refcount of a node
1667 * @node: Node to inc refcount, NULL is supported to
1668 * simplify writing of callers
1672 struct device_node
*of_node_get(struct device_node
*node
)
1675 kref_get(&node
->kref
);
1678 EXPORT_SYMBOL(of_node_get
);
1680 static inline struct device_node
* kref_to_device_node(struct kref
*kref
)
1682 return container_of(kref
, struct device_node
, kref
);
1686 * of_node_release - release a dynamically allocated node
1687 * @kref: kref element of the node to be released
1689 * In of_node_put() this function is passed to kref_put()
1690 * as the destructor.
1692 static void of_node_release(struct kref
*kref
)
1694 struct device_node
*node
= kref_to_device_node(kref
);
1695 struct property
*prop
= node
->properties
;
1697 if (!OF_IS_DYNAMIC(node
))
1700 struct property
*next
= prop
->next
;
1708 kfree(node
->full_name
);
1714 * of_node_put - Decrement refcount of a node
1715 * @node: Node to dec refcount, NULL is supported to
1716 * simplify writing of callers
1719 void of_node_put(struct device_node
*node
)
1722 kref_put(&node
->kref
, of_node_release
);
1724 EXPORT_SYMBOL(of_node_put
);
1727 * Fix up the uninitialized fields in a new device node:
1728 * name, type, n_addrs, addrs, n_intrs, intrs, and pci-specific fields
1730 * A lot of boot-time code is duplicated here, because functions such
1731 * as finish_node_interrupts, interpret_pci_props, etc. cannot use the
1734 * This should probably be split up into smaller chunks.
1737 static int of_finish_dynamic_node(struct device_node
*node
,
1738 unsigned long *unused1
, int unused2
,
1739 int unused3
, int unused4
)
1741 struct device_node
*parent
= of_get_parent(node
);
1743 phandle
*ibm_phandle
;
1745 node
->name
= get_property(node
, "name", NULL
);
1746 node
->type
= get_property(node
, "device_type", NULL
);
1753 /* We don't support that function on PowerMac, at least
1756 if (systemcfg
->platform
== PLATFORM_POWERMAC
)
1759 /* fix up new node's linux_phandle field */
1760 if ((ibm_phandle
= (unsigned int *)get_property(node
, "ibm,phandle", NULL
)))
1761 node
->linux_phandle
= *ibm_phandle
;
1764 of_node_put(parent
);
1769 * Plug a device node into the tree and global list.
1771 void of_attach_node(struct device_node
*np
)
1773 write_lock(&devtree_lock
);
1774 np
->sibling
= np
->parent
->child
;
1775 np
->allnext
= allnodes
;
1776 np
->parent
->child
= np
;
1778 write_unlock(&devtree_lock
);
1782 * "Unplug" a node from the device tree. The caller must hold
1783 * a reference to the node. The memory associated with the node
1784 * is not freed until its refcount goes to zero.
1786 void of_detach_node(const struct device_node
*np
)
1788 struct device_node
*parent
;
1790 write_lock(&devtree_lock
);
1792 parent
= np
->parent
;
1795 allnodes
= np
->allnext
;
1797 struct device_node
*prev
;
1798 for (prev
= allnodes
;
1799 prev
->allnext
!= np
;
1800 prev
= prev
->allnext
)
1802 prev
->allnext
= np
->allnext
;
1805 if (parent
->child
== np
)
1806 parent
->child
= np
->sibling
;
1808 struct device_node
*prevsib
;
1809 for (prevsib
= np
->parent
->child
;
1810 prevsib
->sibling
!= np
;
1811 prevsib
= prevsib
->sibling
)
1813 prevsib
->sibling
= np
->sibling
;
1816 write_unlock(&devtree_lock
);
1819 static int prom_reconfig_notifier(struct notifier_block
*nb
, unsigned long action
, void *node
)
1824 case PSERIES_RECONFIG_ADD
:
1825 err
= finish_node(node
, NULL
, of_finish_dynamic_node
, 0, 0, 0);
1827 printk(KERN_ERR
"finish_node returned %d\n", err
);
1838 static struct notifier_block prom_reconfig_nb
= {
1839 .notifier_call
= prom_reconfig_notifier
,
1840 .priority
= 10, /* This one needs to run first */
1843 static int __init
prom_reconfig_setup(void)
1845 return pSeries_reconfig_notifier_register(&prom_reconfig_nb
);
1847 __initcall(prom_reconfig_setup
);
1850 * Find a property with a given name for a given node
1851 * and return the value.
1854 get_property(struct device_node
*np
, const char *name
, int *lenp
)
1856 struct property
*pp
;
1858 for (pp
= np
->properties
; pp
!= 0; pp
= pp
->next
)
1859 if (strcmp(pp
->name
, name
) == 0) {
1866 EXPORT_SYMBOL(get_property
);
1869 * Add a property to a node
1872 prom_add_property(struct device_node
* np
, struct property
* prop
)
1874 struct property
**next
= &np
->properties
;
1878 next
= &(*next
)->next
;
1884 print_properties(struct device_node
*np
)
1886 struct property
*pp
;
1890 for (pp
= np
->properties
; pp
!= 0; pp
= pp
->next
) {
1891 printk(KERN_INFO
"%s", pp
->name
);
1892 for (i
= strlen(pp
->name
); i
< 16; ++i
)
1894 cp
= (char *) pp
->value
;
1895 for (i
= pp
->length
; i
> 0; --i
, ++cp
)
1896 if ((i
> 1 && (*cp
< 0x20 || *cp
> 0x7e))
1897 || (i
== 1 && *cp
!= 0))
1899 if (i
== 0 && pp
->length
> 1) {
1900 /* looks like a string */
1901 printk(" %s\n", (char *) pp
->value
);
1903 /* dump it in hex */
1907 if (pp
->length
% 4 == 0) {
1908 unsigned int *p
= (unsigned int *) pp
->value
;
1911 for (i
= 0; i
< n
; ++i
) {
1912 if (i
!= 0 && (i
% 4) == 0)
1914 printk(" %08x", *p
++);
1917 unsigned char *bp
= pp
->value
;
1919 for (i
= 0; i
< n
; ++i
) {
1920 if (i
!= 0 && (i
% 16) == 0)
1922 printk(" %02x", *bp
++);
1926 if (pp
->length
> 64)
1927 printk(" ... (length = %d)\n",