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
|
/* $OpenBSD: optree.c,v 1.2 2007/09/09 14:19:28 fgsch Exp $ */
/*
* Copyright (c) 2007 Federico G. Schwindt <fgsch@openbsd.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
* IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <machine/openpromio.h>
#include <sys/ioctl.h>
#include <err.h>
#include <fcntl.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
extern char *path_openprom;
static void
op_print(struct opiocdesc *opio, int depth)
{
char *p;
int i, special;
opio->op_name[opio->op_namelen] = '\0';
printf("%*s%s: ", depth * 4, " ", opio->op_name);
if (opio->op_buflen > 0) {
opio->op_buf[opio->op_buflen] = '\0';
special = 0;
if (opio->op_buf[0] != '\0') {
for (i = 0; i < opio->op_buflen; i++) {
p = &opio->op_buf[i];
if ((*p < ' ' || *p > '~') && (*p != '\0' ||
(i + 1 < opio->op_buflen &&
(*++p < ' ' || *p > '~')))) {
special = 1;
break;
}
}
} else {
if (opio->op_buflen > 1)
special = 1;
}
if (special) {
for (i = 0; opio->op_buflen - i >= sizeof(int);
i += sizeof(int)) {
if (i)
printf(".");
printf("%08x", *(int *)(long)&opio->op_buf[i]);
}
if (i < opio->op_buflen) {
if (i)
printf(".");
for (; i < opio->op_buflen; i++) {
printf("%02x",
*(u_char *)&opio->op_buf[i]);
}
}
} else {
for (i = 0; i < opio->op_buflen;
i += strlen(&opio->op_buf[i]) + 1) {
if (i)
printf(" + ");
printf("'%s'", &opio->op_buf[i]);
}
}
}
printf("\n");
}
void
op_nodes(int fd, int node, int depth)
{
char op_buf[BUFSIZ * 4];
char op_name[BUFSIZ];
struct opiocdesc opio;
opio.op_nodeid = node;
opio.op_buf = op_buf;
opio.op_name = op_name;
if (!node) {
if (ioctl(fd, OPIOCGETNEXT, &opio) < 0)
err(1, "OPIOCGETNEXT");
node = opio.op_nodeid;
} else
printf("\n%*s", depth * 4, " ");
printf("Node 0x%x\n", node);
for (;;) {
opio.op_buflen = sizeof(op_buf);
opio.op_namelen = sizeof(op_name);
/* Get the next property. */
if (ioctl(fd, OPIOCNEXTPROP, &opio) < 0)
err(1, "OPIOCNEXTPROP");
op_buf[opio.op_buflen] = '\0';
(void)strlcpy(op_name, op_buf, sizeof(op_name));
opio.op_namelen = strlen(op_name);
/* If it's the last, punt. */
if (opio.op_namelen == 0)
break;
bzero(op_buf, sizeof(op_buf));
opio.op_buflen = sizeof(op_buf);
/* And its value. */
if (ioctl(fd, OPIOCGET, &opio) < 0)
err(1, "OPIOCGET");
op_print(&opio, depth + 1);
}
/* Get next child. */
if (ioctl(fd, OPIOCGETCHILD, &opio) < 0)
err(1, "OPIOCGETCHILD");
if (opio.op_nodeid)
op_nodes(fd, opio.op_nodeid, depth + 1);
/* Get next node/sibling. */
opio.op_nodeid = node;
if (ioctl(fd, OPIOCGETNEXT, &opio) < 0)
err(1, "OPIOCGETNEXT");
if (opio.op_nodeid)
op_nodes(fd, opio.op_nodeid, depth);
}
void
op_tree(void)
{
int fd;
if ((fd = open(path_openprom, O_RDONLY, 0640)) < 0)
err(1, "open: %s", path_openprom);
op_nodes(fd, 0, 0);
(void)close(fd);
}
|
