blob: 124bef78e9a5d01805ee070d0a61250b9697b55b [file] [log] [blame]
Gerald Van Baren7cd5da02007-03-31 11:59:59 -04001#ifndef _LIBFDT_INTERNAL_H
2#define _LIBFDT_INTERNAL_H
3/*
4 * libfdt - Flat Device Tree manipulation
5 * Copyright (C) 2006 David Gibson, IBM Corporation.
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public License
9 * as published by the Free Software Foundation; either version 2.1 of
10 * the License, or (at your option) any later version.
11 *
12 * This library is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21#include <fdt.h>
22
23#define ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1))
24#define PALIGN(p, a) ((void *)ALIGN((unsigned long)(p), (a)))
25
26#define memeq(p, q, n) (memcmp((p), (q), (n)) == 0)
27#define streq(p, q) (strcmp((p), (q)) == 0)
28
29int _fdt_check_header(const void *fdt);
30uint32_t _fdt_next_tag(const void *fdt, int startoffset, int *nextoffset);
31const char *_fdt_find_string(const char *strtab, int tabsize, const char *s);
32int _fdt_node_end_offset(void *fdt, int nodeoffset);
33
34static inline void *_fdt_offset_ptr(const struct fdt_header *fdt, int offset)
35{
36 return (void *)fdt + fdt_off_dt_struct(fdt) + offset;
37}
38
39#define SW_MAGIC (~FDT_MAGIC)
40
41#endif /* _LIBFDT_INTERNAL_H */