mirror of
https://github.com/torvalds/linux.git
synced 2024-12-06 19:11:31 +00:00
f858927fd6
Major changes are I2C and SPI bus checks, YAML output format (for future validation), some new libfdt functions, and more libfdt validation of dtbs. The YAML addition adds an optional dependency on libyaml. pkg-config is used to test for it and pkg-config became a kconfig dependency in 4.18. This adds the following commits from upstream: c86da84d30e4 Add support for YAML encoded output 361b5e7d8067 Make type_marker_length helper public bfbfab047e45 pylibfdt: Add a means to add and delete notes 9005f4108e7c pylibfdt: Allow delprop() to return errors b94c056b137e Make valgrind optional fd06c54d4711 tests: Better testing of dtc -I fs mode c3f50c9a86d9 tests: Allow dtbs_equal_unordered to ignore mem reserves 0ac9fdee37c7 dtc: trivial '-I fs -O dts' test 0fd1c8c783f3 pylibfdt: fdt_get_mem_rsv returns 2 uint64_t values 04853cad18f4 pylibfdt: Don't incorrectly / unnecessarily override uint64_t typemap 9619c8619c37 Kill bogus TYPE_BLOB marker type ac68ff92ae20 parser: add TYPE_STRING marker to path references 90a190eb04d9 checks: add SPI bus checks 53a1bd546905 checks: add I2C bus checks 88f18909db73 dtc: Bump version to v1.4.7 85bce8b2f06d tests: Correction to vg_prepare_blob() 57f7f9e7bc7c tests: Don't call memcmp() with NULL arguments c12b2b0c20eb libfdt: fdt_address_cells() and fdt_size_cells() 3fe0eeda0b7f livetree: Set phandle properties type to uint32 853649acceba pylibfdt: Support the sequential-write interface 9b0e4fe26093 tests: Improve fdt_resize() tests 1087504bb3e8 libfdt: Add necessary header padding in fdt_create() c72fa777e613 libfdt: Copy the struct region in fdt_resize() 32b9c6130762 Preserve datatype markers when emitting dts format 6dcb8ba408ec libfdt: Add helpers for accessing unaligned words 42607f21d43e tests: Fix incorrect check name 'prop_name_chars' 9d78c33bf8a1 tests: fix grep for checks error messages b770f3d1c13f pylibfdt: Support setting the name of a node 2f0d07e678e0 pylibfdt: Add functions to set and get properties as strings 354d3dc55939 pylibfdt: Update the bytearray size with pack() 3c374d46acce pylibfdt: Allow reading integer values from properties 49d32ce40bb4 pylibfdt: Use an unsigned type for fdt32_t 481246a0c13a pylibfdt: Avoid accessing the internal _fdt member in tests 9aafa33d99ed pylibfdt: Add functions to update properties 5a598671fdbf pylibfdt: Support device-tree creation/expansion 483e170625e1 pylibfdt: Add support for reading the memory reserve map 29bb05aa4200 pylibfdt: Add support for the rest of the header functions 582a7159a5d0 pylibfdt: Add support for fdt_next_node() f0f8c9169819 pylibfdt: Reorder functions to match libfdt.h 64a69d123935 pylibfdt: Return string instead of bytearray from getprop() 4d09a83420df fdtput: Add documentation e617cbe1bd67 fdtget: Add documentation 180a93924014 Use <inttypes.h> format specifiers in a bunch of places we should b9af3b396576 scripts/dtc: Fixed format mismatch in fprintf 4b8fcc3d015c libfdt: Add fdt_check_full() function c14223fb2292 tests: Use valgrind client requests for better checking 5b67d2b955a3 tests: Better handling of valgrind errors saving blobs e2556aaeb506 tests: Remove unused #define fb9c6abddaa8 Use size_t for blob lengths in utilfdt_read* 0112fda03bf6 libfdt: Add fdt_header_size() 6473a21d8bfe Consolidate utilfdt_read_len() variants d5db5382c5e5 libfdt: Safer access to memory reservations 719d582e98ec libfdt: Propagate name errors in fdt_getprop_by_offset() 70166d62a27f libfdt: Safer access to strings section eb890c0f77dc libfdt: Make fdt_check_header() more thorough 899d6fad93f3 libfdt: Improve sequential write state checking 04b5b4062ccd libfdt: Clean up header checking functions 44d3efedc816 Preserve datatype information when parsing dts f0be81bd8de0 Make Property a subclass of bytearray 24b1f3f064d4 pylibfdt: Add a method to access the device tree directly Signed-off-by: Rob Herring <robh@kernel.org>
311 lines
8.8 KiB
C
311 lines
8.8 KiB
C
#ifndef DTC_H
|
|
#define DTC_H
|
|
|
|
/*
|
|
* (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
|
|
*
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License as
|
|
* published by the Free Software Foundation; either version 2 of the
|
|
* License, or (at your option) any later version.
|
|
*
|
|
* This program 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
|
|
* General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
|
|
* USA
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <stdint.h>
|
|
#include <stdbool.h>
|
|
#include <stdarg.h>
|
|
#include <assert.h>
|
|
#include <ctype.h>
|
|
#include <errno.h>
|
|
#include <unistd.h>
|
|
#include <inttypes.h>
|
|
|
|
#include <libfdt_env.h>
|
|
#include <fdt.h>
|
|
|
|
#include "util.h"
|
|
|
|
#ifdef DEBUG
|
|
#define debug(...) printf(__VA_ARGS__)
|
|
#else
|
|
#define debug(...)
|
|
#endif
|
|
|
|
#define DEFAULT_FDT_VERSION 17
|
|
|
|
/*
|
|
* Command line options
|
|
*/
|
|
extern int quiet; /* Level of quietness */
|
|
extern int reservenum; /* Number of memory reservation slots */
|
|
extern int minsize; /* Minimum blob size */
|
|
extern int padsize; /* Additional padding to blob */
|
|
extern int alignsize; /* Additional padding to blob accroding to the alignsize */
|
|
extern int phandle_format; /* Use linux,phandle or phandle properties */
|
|
extern int generate_symbols; /* generate symbols for nodes with labels */
|
|
extern int generate_fixups; /* generate fixups */
|
|
extern int auto_label_aliases; /* auto generate labels -> aliases */
|
|
|
|
#define PHANDLE_LEGACY 0x1
|
|
#define PHANDLE_EPAPR 0x2
|
|
#define PHANDLE_BOTH 0x3
|
|
|
|
typedef uint32_t cell_t;
|
|
|
|
|
|
#define streq(a, b) (strcmp((a), (b)) == 0)
|
|
#define strstarts(s, prefix) (strncmp((s), (prefix), strlen(prefix)) == 0)
|
|
#define strprefixeq(a, n, b) (strlen(b) == (n) && (memcmp(a, b, n) == 0))
|
|
|
|
#define ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1))
|
|
|
|
/* Data blobs */
|
|
enum markertype {
|
|
TYPE_NONE,
|
|
REF_PHANDLE,
|
|
REF_PATH,
|
|
LABEL,
|
|
TYPE_UINT8,
|
|
TYPE_UINT16,
|
|
TYPE_UINT32,
|
|
TYPE_UINT64,
|
|
TYPE_STRING,
|
|
};
|
|
extern const char *markername(enum markertype markertype);
|
|
|
|
struct marker {
|
|
enum markertype type;
|
|
int offset;
|
|
char *ref;
|
|
struct marker *next;
|
|
};
|
|
|
|
struct data {
|
|
int len;
|
|
char *val;
|
|
struct marker *markers;
|
|
};
|
|
|
|
|
|
#define empty_data ((struct data){ 0 /* all .members = 0 or NULL */ })
|
|
|
|
#define for_each_marker(m) \
|
|
for (; (m); (m) = (m)->next)
|
|
#define for_each_marker_of_type(m, t) \
|
|
for_each_marker(m) \
|
|
if ((m)->type == (t))
|
|
|
|
size_t type_marker_length(struct marker *m);
|
|
|
|
void data_free(struct data d);
|
|
|
|
struct data data_grow_for(struct data d, int xlen);
|
|
|
|
struct data data_copy_mem(const char *mem, int len);
|
|
struct data data_copy_escape_string(const char *s, int len);
|
|
struct data data_copy_file(FILE *f, size_t len);
|
|
|
|
struct data data_append_data(struct data d, const void *p, int len);
|
|
struct data data_insert_at_marker(struct data d, struct marker *m,
|
|
const void *p, int len);
|
|
struct data data_merge(struct data d1, struct data d2);
|
|
struct data data_append_cell(struct data d, cell_t word);
|
|
struct data data_append_integer(struct data d, uint64_t word, int bits);
|
|
struct data data_append_re(struct data d, uint64_t address, uint64_t size);
|
|
struct data data_append_addr(struct data d, uint64_t addr);
|
|
struct data data_append_byte(struct data d, uint8_t byte);
|
|
struct data data_append_zeroes(struct data d, int len);
|
|
struct data data_append_align(struct data d, int align);
|
|
|
|
struct data data_add_marker(struct data d, enum markertype type, char *ref);
|
|
|
|
bool data_is_one_string(struct data d);
|
|
|
|
/* DT constraints */
|
|
|
|
#define MAX_PROPNAME_LEN 31
|
|
#define MAX_NODENAME_LEN 31
|
|
|
|
/* Live trees */
|
|
struct label {
|
|
bool deleted;
|
|
char *label;
|
|
struct label *next;
|
|
};
|
|
|
|
struct bus_type {
|
|
const char *name;
|
|
};
|
|
|
|
struct property {
|
|
bool deleted;
|
|
char *name;
|
|
struct data val;
|
|
|
|
struct property *next;
|
|
|
|
struct label *labels;
|
|
};
|
|
|
|
struct node {
|
|
bool deleted;
|
|
char *name;
|
|
struct property *proplist;
|
|
struct node *children;
|
|
|
|
struct node *parent;
|
|
struct node *next_sibling;
|
|
|
|
char *fullpath;
|
|
int basenamelen;
|
|
|
|
cell_t phandle;
|
|
int addr_cells, size_cells;
|
|
|
|
struct label *labels;
|
|
const struct bus_type *bus;
|
|
|
|
bool omit_if_unused, is_referenced;
|
|
};
|
|
|
|
#define for_each_label_withdel(l0, l) \
|
|
for ((l) = (l0); (l); (l) = (l)->next)
|
|
|
|
#define for_each_label(l0, l) \
|
|
for_each_label_withdel(l0, l) \
|
|
if (!(l)->deleted)
|
|
|
|
#define for_each_property_withdel(n, p) \
|
|
for ((p) = (n)->proplist; (p); (p) = (p)->next)
|
|
|
|
#define for_each_property(n, p) \
|
|
for_each_property_withdel(n, p) \
|
|
if (!(p)->deleted)
|
|
|
|
#define for_each_child_withdel(n, c) \
|
|
for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
|
|
|
|
#define for_each_child(n, c) \
|
|
for_each_child_withdel(n, c) \
|
|
if (!(c)->deleted)
|
|
|
|
void add_label(struct label **labels, char *label);
|
|
void delete_labels(struct label **labels);
|
|
|
|
struct property *build_property(char *name, struct data val);
|
|
struct property *build_property_delete(char *name);
|
|
struct property *chain_property(struct property *first, struct property *list);
|
|
struct property *reverse_properties(struct property *first);
|
|
|
|
struct node *build_node(struct property *proplist, struct node *children);
|
|
struct node *build_node_delete(void);
|
|
struct node *name_node(struct node *node, char *name);
|
|
struct node *omit_node_if_unused(struct node *node);
|
|
struct node *reference_node(struct node *node);
|
|
struct node *chain_node(struct node *first, struct node *list);
|
|
struct node *merge_nodes(struct node *old_node, struct node *new_node);
|
|
struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);
|
|
|
|
void add_property(struct node *node, struct property *prop);
|
|
void delete_property_by_name(struct node *node, char *name);
|
|
void delete_property(struct property *prop);
|
|
void add_child(struct node *parent, struct node *child);
|
|
void delete_node_by_name(struct node *parent, char *name);
|
|
void delete_node(struct node *node);
|
|
void append_to_property(struct node *node,
|
|
char *name, const void *data, int len);
|
|
|
|
const char *get_unitname(struct node *node);
|
|
struct property *get_property(struct node *node, const char *propname);
|
|
cell_t propval_cell(struct property *prop);
|
|
cell_t propval_cell_n(struct property *prop, int n);
|
|
struct property *get_property_by_label(struct node *tree, const char *label,
|
|
struct node **node);
|
|
struct marker *get_marker_label(struct node *tree, const char *label,
|
|
struct node **node, struct property **prop);
|
|
struct node *get_subnode(struct node *node, const char *nodename);
|
|
struct node *get_node_by_path(struct node *tree, const char *path);
|
|
struct node *get_node_by_label(struct node *tree, const char *label);
|
|
struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
|
|
struct node *get_node_by_ref(struct node *tree, const char *ref);
|
|
cell_t get_node_phandle(struct node *root, struct node *node);
|
|
|
|
uint32_t guess_boot_cpuid(struct node *tree);
|
|
|
|
/* Boot info (tree plus memreserve information */
|
|
|
|
struct reserve_info {
|
|
uint64_t address, size;
|
|
|
|
struct reserve_info *next;
|
|
|
|
struct label *labels;
|
|
};
|
|
|
|
struct reserve_info *build_reserve_entry(uint64_t start, uint64_t len);
|
|
struct reserve_info *chain_reserve_entry(struct reserve_info *first,
|
|
struct reserve_info *list);
|
|
struct reserve_info *add_reserve_entry(struct reserve_info *list,
|
|
struct reserve_info *new);
|
|
|
|
|
|
struct dt_info {
|
|
unsigned int dtsflags;
|
|
struct reserve_info *reservelist;
|
|
uint32_t boot_cpuid_phys;
|
|
struct node *dt; /* the device tree */
|
|
const char *outname; /* filename being written to, "-" for stdout */
|
|
};
|
|
|
|
/* DTS version flags definitions */
|
|
#define DTSF_V1 0x0001 /* /dts-v1/ */
|
|
#define DTSF_PLUGIN 0x0002 /* /plugin/ */
|
|
|
|
struct dt_info *build_dt_info(unsigned int dtsflags,
|
|
struct reserve_info *reservelist,
|
|
struct node *tree, uint32_t boot_cpuid_phys);
|
|
void sort_tree(struct dt_info *dti);
|
|
void generate_label_tree(struct dt_info *dti, char *name, bool allocph);
|
|
void generate_fixups_tree(struct dt_info *dti, char *name);
|
|
void generate_local_fixups_tree(struct dt_info *dti, char *name);
|
|
|
|
/* Checks */
|
|
|
|
void parse_checks_option(bool warn, bool error, const char *arg);
|
|
void process_checks(bool force, struct dt_info *dti);
|
|
|
|
/* Flattened trees */
|
|
|
|
void dt_to_blob(FILE *f, struct dt_info *dti, int version);
|
|
void dt_to_asm(FILE *f, struct dt_info *dti, int version);
|
|
|
|
struct dt_info *dt_from_blob(const char *fname);
|
|
|
|
/* Tree source */
|
|
|
|
void dt_to_source(FILE *f, struct dt_info *dti);
|
|
struct dt_info *dt_from_source(const char *f);
|
|
|
|
/* YAML source */
|
|
|
|
void dt_to_yaml(FILE *f, struct dt_info *dti);
|
|
|
|
/* FS trees */
|
|
|
|
struct dt_info *dt_from_fs(const char *dirname);
|
|
|
|
#endif /* DTC_H */
|