libfdt_internal.h (204431) | libfdt_internal.h (204433) |
---|---|
1#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 * libfdt is dual licensed: you can use it either under the terms of 8 * the GPL, or the BSD license, at your option. --- 48 unchanged lines hidden (view full) --- 57 58#define FDT_CHECK_HEADER(fdt) \ 59 { \ 60 int err; \ 61 if ((err = fdt_check_header(fdt)) != 0) \ 62 return err; \ 63 } 64 | 1#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 * libfdt is dual licensed: you can use it either under the terms of 8 * the GPL, or the BSD license, at your option. --- 48 unchanged lines hidden (view full) --- 57 58#define FDT_CHECK_HEADER(fdt) \ 59 { \ 60 int err; \ 61 if ((err = fdt_check_header(fdt)) != 0) \ 62 return err; \ 63 } 64 |
65uint32_t _fdt_next_tag(const void *fdt, int startoffset, int *nextoffset); | |
66int _fdt_check_node_offset(const void *fdt, int offset); 67const char *_fdt_find_string(const char *strtab, int tabsize, const char *s); 68int _fdt_node_end_offset(void *fdt, int nodeoffset); 69 70static inline const void *_fdt_offset_ptr(const void *fdt, int offset) 71{ 72 return (const char *)fdt + fdt_off_dt_struct(fdt) + offset; 73} --- 22 unchanged lines hidden --- | 65int _fdt_check_node_offset(const void *fdt, int offset); 66const char *_fdt_find_string(const char *strtab, int tabsize, const char *s); 67int _fdt_node_end_offset(void *fdt, int nodeoffset); 68 69static inline const void *_fdt_offset_ptr(const void *fdt, int offset) 70{ 71 return (const char *)fdt + fdt_off_dt_struct(fdt) + offset; 72} --- 22 unchanged lines hidden --- |