prop_array_util.c revision 1.5.16.2 1 1.5.16.1 martin /* $NetBSD: prop_array_util.c,v 1.5.16.2 2020/04/21 19:37:51 martin Exp $ */
2 1.1 haad
3 1.1 haad /*-
4 1.1 haad * Copyright (c) 2006 The NetBSD Foundation, Inc.
5 1.1 haad * All rights reserved.
6 1.1 haad *
7 1.1 haad * This code is derived from software contributed to The NetBSD Foundation
8 1.1 haad * by Jason R. Thorpe.
9 1.1 haad *
10 1.1 haad * Redistribution and use in source and binary forms, with or without
11 1.1 haad * modification, are permitted provided that the following conditions
12 1.1 haad * are met:
13 1.1 haad * 1. Redistributions of source code must retain the above copyright
14 1.1 haad * notice, this list of conditions and the following disclaimer.
15 1.1 haad * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 haad * notice, this list of conditions and the following disclaimer in the
17 1.1 haad * documentation and/or other materials provided with the distribution.
18 1.1 haad *
19 1.1 haad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 haad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 haad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 haad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 haad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 haad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 haad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 haad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 haad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 haad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 haad * POSSIBILITY OF SUCH DAMAGE.
30 1.1 haad */
31 1.1 haad
32 1.1 haad /*
33 1.1 haad * Utility routines to make it more convenient to work with values
34 1.1 haad * stored in array.
35 1.1 haad *
36 1.1 haad * Note: There is no special magic going on here. We use the standard
37 1.1 haad * proplib(3) APIs to do all of this work. Any application could do
38 1.1 haad * exactly what we're doing here.
39 1.1 haad */
40 1.1 haad
41 1.4 pooka #include "prop_object_impl.h" /* hide kernel vs. not-kernel vs. standalone */
42 1.1 haad #include <prop/proplib.h>
43 1.1 haad
44 1.1 haad bool
45 1.1 haad prop_array_get_bool(prop_array_t array,
46 1.1 haad unsigned int indx,
47 1.1 haad bool *valp)
48 1.1 haad {
49 1.1 haad prop_bool_t b;
50 1.1 haad
51 1.1 haad b = prop_array_get(array, indx);
52 1.1 haad if (prop_object_type(b) != PROP_TYPE_BOOL)
53 1.1 haad return (false);
54 1.1 haad
55 1.1 haad *valp = prop_bool_true(b);
56 1.1 haad
57 1.1 haad return (true);
58 1.1 haad }
59 1.1 haad
60 1.1 haad bool
61 1.1 haad prop_array_set_bool(prop_array_t array,
62 1.1 haad unsigned int indx,
63 1.1 haad bool val)
64 1.1 haad {
65 1.1 haad prop_bool_t b;
66 1.1 haad int rv;
67 1.1 haad
68 1.1 haad b = prop_bool_create(val);
69 1.1 haad if (b == NULL)
70 1.1 haad return (false);
71 1.1 haad rv = prop_array_set(array, indx, b);
72 1.1 haad prop_object_release(b);
73 1.1 haad
74 1.1 haad return (rv);
75 1.1 haad }
76 1.1 haad
77 1.1 haad #define TEMPLATE(size) \
78 1.1 haad bool \
79 1.1 haad prop_array_get_int ## size (prop_array_t array, \
80 1.1 haad unsigned int indx, \
81 1.1 haad int ## size ## _t *valp) \
82 1.1 haad { \
83 1.1 haad prop_number_t num; \
84 1.1 haad \
85 1.1 haad num = prop_array_get(array, indx); \
86 1.1 haad if (prop_object_type(num) != PROP_TYPE_NUMBER) \
87 1.1 haad return (false); \
88 1.1 haad \
89 1.1 haad if (prop_number_unsigned(num) && \
90 1.1 haad prop_number_unsigned_integer_value(num) > \
91 1.1 haad /*CONSTCOND*/((size) == 8 ? INT8_MAX : \
92 1.1 haad (size) == 16 ? INT16_MAX : \
93 1.1 haad (size) == 32 ? INT32_MAX : INT64_MAX)) { \
94 1.1 haad return (false); \
95 1.1 haad } \
96 1.1 haad \
97 1.1 haad if (prop_number_size(num) > (size)) \
98 1.1 haad return (false); \
99 1.1 haad \
100 1.1 haad *valp = (int ## size ## _t) prop_number_integer_value(num); \
101 1.1 haad \
102 1.1 haad return (true); \
103 1.1 haad } \
104 1.1 haad \
105 1.1 haad bool \
106 1.1 haad prop_array_get_uint ## size (prop_array_t array, \
107 1.1 haad unsigned int indx, \
108 1.1 haad uint ## size ## _t *valp) \
109 1.1 haad { \
110 1.1 haad prop_number_t num; \
111 1.1 haad \
112 1.1 haad num = prop_array_get(array, indx); \
113 1.1 haad if (prop_object_type(num) != PROP_TYPE_NUMBER) \
114 1.1 haad return (false); \
115 1.1 haad \
116 1.1 haad if (prop_number_unsigned(num) == false && \
117 1.1 haad prop_number_integer_value(num) < 0) { \
118 1.1 haad return (false); \
119 1.1 haad } \
120 1.1 haad \
121 1.1 haad if (prop_number_size(num) > (size)) \
122 1.1 haad return (false); \
123 1.1 haad \
124 1.1 haad *valp = (uint ## size ## _t) \
125 1.1 haad prop_number_unsigned_integer_value(num); \
126 1.1 haad \
127 1.1 haad return (true); \
128 1.1 haad } \
129 1.1 haad \
130 1.1 haad bool \
131 1.1 haad prop_array_set_int ## size (prop_array_t array, \
132 1.1 haad unsigned int indx, \
133 1.1 haad int ## size ## _t val) \
134 1.1 haad { \
135 1.1 haad prop_number_t num; \
136 1.1 haad int rv; \
137 1.1 haad \
138 1.1 haad num = prop_number_create_integer((int64_t) val); \
139 1.1 haad if (num == NULL) \
140 1.1 haad return (false); \
141 1.1 haad rv = prop_array_set(array, indx, num); \
142 1.1 haad prop_object_release(num); \
143 1.1 haad \
144 1.1 haad return (rv); \
145 1.1 haad } \
146 1.1 haad \
147 1.1 haad bool \
148 1.1 haad prop_array_set_uint ## size (prop_array_t array, \
149 1.1 haad unsigned int indx, \
150 1.1 haad uint ## size ## _t val) \
151 1.1 haad { \
152 1.1 haad prop_number_t num; \
153 1.1 haad int rv; \
154 1.1 haad \
155 1.1 haad num = prop_number_create_unsigned_integer((uint64_t) val); \
156 1.1 haad if (num == NULL) \
157 1.1 haad return (false); \
158 1.1 haad rv = prop_array_set(array, indx, num); \
159 1.1 haad prop_object_release(num); \
160 1.1 haad \
161 1.1 haad return (rv); \
162 1.2 haad } \
163 1.2 haad \
164 1.2 haad bool \
165 1.2 haad prop_array_add_int ## size (prop_array_t array, \
166 1.2 haad int ## size ## _t val) \
167 1.2 haad { \
168 1.2 haad prop_number_t num; \
169 1.2 haad int rv; \
170 1.2 haad \
171 1.2 haad num = prop_number_create_integer((int64_t) val); \
172 1.2 haad if (num == NULL) \
173 1.2 haad return (false); \
174 1.2 haad rv = prop_array_add(array, num); \
175 1.2 haad prop_object_release(num); \
176 1.2 haad \
177 1.2 haad return (rv); \
178 1.2 haad } \
179 1.2 haad \
180 1.2 haad bool \
181 1.2 haad prop_array_add_uint ## size (prop_array_t array, \
182 1.2 haad uint ## size ## _t val) \
183 1.2 haad { \
184 1.2 haad prop_number_t num; \
185 1.2 haad int rv; \
186 1.2 haad \
187 1.2 haad num = prop_number_create_integer((int64_t) val); \
188 1.2 haad if (num == NULL) \
189 1.2 haad return (false); \
190 1.2 haad rv = prop_array_add(array, num); \
191 1.2 haad prop_object_release(num); \
192 1.2 haad \
193 1.2 haad return (rv); \
194 1.1 haad }
195 1.1 haad
196 1.1 haad TEMPLATE(8)
197 1.1 haad TEMPLATE(16)
198 1.1 haad TEMPLATE(32)
199 1.1 haad TEMPLATE(64)
200 1.1 haad
201 1.1 haad #undef TEMPLATE
202 1.1 haad
203 1.1 haad #define TEMPLATE(variant, qualifier) \
204 1.5 pgoyette bool \
205 1.5 pgoyette prop_array_add_cstring ## variant (prop_array_t array, \
206 1.5 pgoyette const char *cp) \
207 1.5 pgoyette { \
208 1.5 pgoyette prop_string_t str; \
209 1.5 pgoyette bool rv; \
210 1.5 pgoyette \
211 1.5 pgoyette str = prop_string_create_cstring ## variant (cp); \
212 1.5 pgoyette if (str == NULL) \
213 1.5 pgoyette return false; \
214 1.5 pgoyette rv = prop_array_add(array, str); \
215 1.5 pgoyette prop_object_release(str); \
216 1.5 pgoyette return rv; \
217 1.5 pgoyette } \
218 1.5 pgoyette \
219 1.1 haad bool \
220 1.1 haad prop_array_get_cstring ## variant (prop_array_t array, \
221 1.1 haad unsigned int indx, \
222 1.1 haad qualifier char **cpp) \
223 1.1 haad { \
224 1.1 haad prop_string_t str; \
225 1.1 haad \
226 1.1 haad str = prop_array_get(array, indx); \
227 1.1 haad if (prop_object_type(str) != PROP_TYPE_STRING) \
228 1.1 haad return (false); \
229 1.1 haad \
230 1.1 haad *cpp = prop_string_cstring ## variant (str); \
231 1.1 haad \
232 1.1 haad return (*cpp == NULL ? false : true); \
233 1.1 haad } \
234 1.1 haad \
235 1.1 haad bool \
236 1.1 haad prop_array_set_cstring ## variant (prop_array_t array, \
237 1.1 haad unsigned int indx, \
238 1.1 haad const char *cp) \
239 1.1 haad { \
240 1.1 haad prop_string_t str; \
241 1.1 haad int rv; \
242 1.1 haad \
243 1.1 haad str = prop_string_create_cstring ## variant (cp); \
244 1.1 haad if (str == NULL) \
245 1.1 haad return (false); \
246 1.1 haad rv = prop_array_set(array, indx, str); \
247 1.1 haad prop_object_release(str); \
248 1.1 haad \
249 1.1 haad return (rv); \
250 1.1 haad }
251 1.1 haad
252 1.1 haad TEMPLATE(,)
253 1.1 haad TEMPLATE(_nocopy,const)
254 1.1 haad
255 1.1 haad #undef TEMPLATE
256 1.3 bouyer
257 1.3 bouyer bool
258 1.3 bouyer prop_array_add_and_rel(prop_array_t array, prop_object_t po)
259 1.3 bouyer {
260 1.3 bouyer bool ret;
261 1.3 bouyer if (po == NULL)
262 1.3 bouyer return false;
263 1.3 bouyer ret = prop_array_add(array, po);
264 1.3 bouyer prop_object_release(po);
265 1.3 bouyer return ret;
266 1.3 bouyer }
267