| /* |
| * Copyright (C) 2016 The Android Open Source Project |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| #ifndef UFDT_TYPES_H |
| #define UFDT_TYPES_H |
| |
| #include <libfdt.h> |
| |
| /* it has type : struct ufdt_node** */ |
| #define for_each(it, node) \ |
| if ((node) != NULL) \ |
| for ((it) = (node)->nodes; (it) != (node)->nodes + (node)->mem_size; ++(it)) \ |
| if (*(it)) |
| |
| #define for_each_child(it, node) \ |
| if (ufdt_node_tag(node) == FDT_BEGIN_NODE) \ |
| for ((it) = &(((struct ufdt_node_fdt_node *)(node))->child); *(it); \ |
| (it) = &((*(it))->sibling)) |
| |
| #define for_each_prop(it, node) \ |
| for_each_child(it, node) if (ufdt_node_tag(*(it)) == FDT_PROP) |
| |
| #define for_each_node(it, node) \ |
| for_each_child(it, node) if (ufdt_node_tag(*(it)) == FDT_BEGIN_NODE) |
| |
| /* |
| * Gets prop name from FDT requires complicated manipulation. |
| * To avoid the manipulation, the *name pointer in ufdt_node_fdt_prop |
| * is pointed to the final destination of the prop name in FDT. |
| * For the FDT_BEGIN_NODE name, it can be obtained from FDT directly. |
| */ |
| #define ufdt_node_name(node) \ |
| ((ufdt_node_tag(node) == FDT_BEGIN_NODE) \ |
| ? (((const struct fdt_node_header *)((node)->fdt_tag_ptr))->name) \ |
| : (((const struct ufdt_node_fdt_prop *)(node))->name)) |
| |
| #define ufdt_node_tag(node) \ |
| ((node) ? fdt32_to_cpu(*(node)->fdt_tag_ptr) : FDT_END) |
| |
| struct ufdt_node { |
| fdt32_t *fdt_tag_ptr; |
| struct ufdt_node *sibling; |
| }; |
| |
| struct ufdt_node_fdt_prop { |
| struct ufdt_node parent; |
| const char *name; |
| }; |
| |
| struct ufdt_node_fdt_node { |
| struct ufdt_node parent; |
| struct ufdt_node *child; |
| struct ufdt_node **last_child_p; |
| }; |
| |
| struct ufdt_phandle_table_entry { |
| uint32_t phandle; |
| struct ufdt_node *node; |
| }; |
| |
| struct ufdt_static_phandle_table { |
| int len; |
| struct ufdt_phandle_table_entry *data; |
| }; |
| |
| struct ufdt { |
| void **fdtps; |
| int mem_size_fdtps; |
| int num_used_fdtps; |
| |
| struct ufdt_node *root; |
| struct ufdt_static_phandle_table phandle_table; |
| }; |
| |
| struct ufdt_node_pool; |
| |
| #endif /* UFDT_TYPES_H */ |