You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
44 lines
1.6 KiB
44 lines
1.6 KiB
#ifndef _LIBFDT_INTERNAL_H |
|
#define _LIBFDT_INTERNAL_H |
|
/* |
|
* libfdt - Flat Device Tree manipulation |
|
* Copyright (C) 2006 David Gibson, IBM Corporation. |
|
* |
|
* This library is free software; you can redistribute it and/or |
|
* modify it under the terms of the GNU Lesser General Public License |
|
* as published by the Free Software Foundation; either version 2.1 of |
|
* the License, or (at your option) any later version. |
|
* |
|
* This library is distributed in the hope that it will be useful, but |
|
* WITHOUT ANY WARRANTY; without even the implied warranty of |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
|
* Lesser General Public License for more details. |
|
* |
|
* You should have received a copy of the GNU Lesser General Public |
|
* License along with this library; if not, write to the Free Software |
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA |
|
*/ |
|
#include <fdt.h> |
|
|
|
#define ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1)) |
|
#define PALIGN(p, a) ((void *)ALIGN((unsigned long)(p), (a))) |
|
|
|
#define memeq(p, q, n) (memcmp((p), (q), (n)) == 0) |
|
#define streq(p, q) (strcmp((p), (q)) == 0) |
|
|
|
int _fdt_check_header(const void *fdt); |
|
uint32_t _fdt_next_tag(const void *fdt, int startoffset, int *nextoffset); |
|
const char *_fdt_find_string(const char *strtab, int tabsize, const char *s); |
|
int _fdt_node_end_offset(void *fdt, int nodeoffset); |
|
|
|
static inline void *_fdt_offset_ptr(const struct fdt_header *fdt, int offset) |
|
{ |
|
return (void *)fdt + fdt_off_dt_struct(fdt) + offset; |
|
} |
|
|
|
#define OFFSET_ERROR(code) -(code) |
|
#define PTR_ERROR(code) (void *)(-(long)(code)) |
|
|
|
#define SW_MAGIC (~FDT_MAGIC) |
|
|
|
#endif /* _LIBFDT_INTERNAL_H */
|
|
|