summaryrefslogtreecommitdiffstats
path: root/scripts/dtc/dtc.h
diff options
context:
space:
mode:
Diffstat (limited to 'scripts/dtc/dtc.h')
-rw-r--r--scripts/dtc/dtc.h18
1 files changed, 9 insertions, 9 deletions
diff --git a/scripts/dtc/dtc.h b/scripts/dtc/dtc.h
index 264a20cf66a8..56212c8df660 100644
--- a/scripts/dtc/dtc.h
+++ b/scripts/dtc/dtc.h
@@ -38,9 +38,9 @@
38#include "util.h" 38#include "util.h"
39 39
40#ifdef DEBUG 40#ifdef DEBUG
41#define debug(fmt,args...) printf(fmt, ##args) 41#define debug(...) printf(__VA_ARGS__)
42#else 42#else
43#define debug(fmt,args...) 43#define debug(...)
44#endif 44#endif
45 45
46 46
@@ -88,7 +88,7 @@ struct data {
88}; 88};
89 89
90 90
91#define empty_data ((struct data){ /* all .members = 0 or NULL */ }) 91#define empty_data ((struct data){ 0 /* all .members = 0 or NULL */ })
92 92
93#define for_each_marker(m) \ 93#define for_each_marker(m) \
94 for (; (m); (m) = (m)->next) 94 for (; (m); (m) = (m)->next)
@@ -118,7 +118,7 @@ struct data data_append_align(struct data d, int align);
118 118
119struct data data_add_marker(struct data d, enum markertype type, char *ref); 119struct data data_add_marker(struct data d, enum markertype type, char *ref);
120 120
121int data_is_one_string(struct data d); 121bool data_is_one_string(struct data d);
122 122
123/* DT constraints */ 123/* DT constraints */
124 124
@@ -127,13 +127,13 @@ int data_is_one_string(struct data d);
127 127
128/* Live trees */ 128/* Live trees */
129struct label { 129struct label {
130 int deleted; 130 bool deleted;
131 char *label; 131 char *label;
132 struct label *next; 132 struct label *next;
133}; 133};
134 134
135struct property { 135struct property {
136 int deleted; 136 bool deleted;
137 char *name; 137 char *name;
138 struct data val; 138 struct data val;
139 139
@@ -143,7 +143,7 @@ struct property {
143}; 143};
144 144
145struct node { 145struct node {
146 int deleted; 146 bool deleted;
147 char *name; 147 char *name;
148 struct property *proplist; 148 struct property *proplist;
149 struct node *children; 149 struct node *children;
@@ -247,8 +247,8 @@ void sort_tree(struct boot_info *bi);
247 247
248/* Checks */ 248/* Checks */
249 249
250void parse_checks_option(bool warn, bool error, const char *optarg); 250void parse_checks_option(bool warn, bool error, const char *arg);
251void process_checks(int force, struct boot_info *bi); 251void process_checks(bool force, struct boot_info *bi);
252 252
253/* Flattened trees */ 253/* Flattened trees */
254 254