1 | /* |
---|
2 | * Copyright (c) 2015, 2018 embedded brains GmbH |
---|
3 | * All rights reserved. |
---|
4 | * |
---|
5 | * Redistribution and use in source and binary forms, with or without |
---|
6 | * modification, are permitted provided that the following conditions |
---|
7 | * are met: |
---|
8 | * 1. Redistributions of source code must retain the above copyright |
---|
9 | * notice, this list of conditions and the following disclaimer. |
---|
10 | * 2. Redistributions in binary form must reproduce the above copyright |
---|
11 | * notice, this list of conditions and the following disclaimer in the |
---|
12 | * documentation and/or other materials provided with the distribution. |
---|
13 | * |
---|
14 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
---|
15 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
---|
16 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
---|
17 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
---|
18 | * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
---|
19 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
---|
20 | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
---|
21 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
---|
22 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
---|
23 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
---|
24 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
---|
25 | */ |
---|
26 | |
---|
27 | #ifndef _LINUX_OF_H |
---|
28 | #define _LINUX_OF_H |
---|
29 | |
---|
30 | #include <linux/types.h> |
---|
31 | |
---|
32 | #include <libfdt.h> |
---|
33 | |
---|
34 | #ifdef __cplusplus |
---|
35 | extern "C" { |
---|
36 | #endif /* __cplusplus */ |
---|
37 | |
---|
38 | #define OF_BAD_ADDR ((uint64_t)-1) |
---|
39 | |
---|
40 | typedef uint32_t phandle; |
---|
41 | |
---|
42 | struct device_node { |
---|
43 | int offset; |
---|
44 | const char *full_name; |
---|
45 | }; |
---|
46 | |
---|
47 | static inline struct device_node * |
---|
48 | of_node_get(struct device_node *dn) |
---|
49 | { |
---|
50 | |
---|
51 | return (dn); |
---|
52 | } |
---|
53 | |
---|
54 | static inline void |
---|
55 | of_node_put(struct device_node *dn) |
---|
56 | { |
---|
57 | |
---|
58 | (void)dn; |
---|
59 | } |
---|
60 | |
---|
61 | const void *of_get_property(const struct device_node *dn, const char *name, |
---|
62 | int *len); |
---|
63 | |
---|
64 | int of_n_addr_cells(struct device_node *dn); |
---|
65 | |
---|
66 | int of_n_size_cells(struct device_node *dn); |
---|
67 | |
---|
68 | /* FIXME: If we need the property, then more work is to do */ |
---|
69 | #define of_find_property(dn, name, len) of_get_property(dn, name, len) |
---|
70 | |
---|
71 | int of_property_read_u32_array(const struct device_node *dn, const char *name, |
---|
72 | u32 *vals, size_t nz); |
---|
73 | |
---|
74 | static inline int |
---|
75 | of_property_read_u32(const struct device_node *dn, const char *name, u32 *val) |
---|
76 | { |
---|
77 | |
---|
78 | return (of_property_read_u32_array(dn, name, val, 1)); |
---|
79 | } |
---|
80 | |
---|
81 | uint64_t of_read_number(const uint32_t *cell, int size); |
---|
82 | |
---|
83 | struct device_node *of_parse_phandle(struct device_node *dns, |
---|
84 | struct device_node *dn, const char *phandle_name, int index); |
---|
85 | |
---|
86 | int of_count_phandle_with_args(struct device_node *dn, const char *list_name, |
---|
87 | const char *cells_name); |
---|
88 | |
---|
89 | bool of_device_is_available(const struct device_node *dn); |
---|
90 | |
---|
91 | int of_device_is_compatible(const struct device_node *dn, const char *name); |
---|
92 | |
---|
93 | struct device_node *of_find_node_by_path(struct device_node *dns, |
---|
94 | const char *path); |
---|
95 | |
---|
96 | struct device_node *of_find_compatible_node(struct device_node *dns, |
---|
97 | const struct device_node *dn, const char *type, const char *compatible); |
---|
98 | |
---|
99 | #define for_each_compatible_node(dn, type, compatible) \ |
---|
100 | for (dn = of_find_compatible_node(&of_dns, NULL, type, compatible); \ |
---|
101 | dn != NULL; dn = of_find_compatible_node(&of_dns, dn, type, compatible)) |
---|
102 | |
---|
103 | #ifdef __cplusplus |
---|
104 | } |
---|
105 | #endif /* __cplusplus */ |
---|
106 | |
---|
107 | #endif /* _LINUX_OF_H */ |
---|