mirror of
https://github.com/brain-hackers/u-boot-brain
synced 2024-06-09 23:36:03 +09:00
libfdt: Add phandle generation helper
The new fdt_generate_phandle() function can be used to generate a new, unused phandle given a specific device tree blob. The implementation is somewhat naive in that it simply walks the entire device tree to find the highest phandle value and then returns a phandle value one higher than that. A more clever implementation might try to find holes in the current set of phandle values and fill them. But this implementation is relatively simple and works reliably. Also add a test that validates that phandles generated by this new API are indeed unique. Signed-off-by: Thierry Reding <treding@nvidia.com> Reviewed-by: Simon Glass <sjg@chromium.org>
This commit is contained in:
parent
c7fbee540e
commit
ea1df3e07c
|
@ -73,6 +73,37 @@ uint32_t fdt_get_max_phandle(const void *fdt)
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
int fdt_generate_phandle(const void *fdt, uint32_t *phandle)
|
||||||
|
{
|
||||||
|
uint32_t max = 0;
|
||||||
|
int offset = -1;
|
||||||
|
|
||||||
|
while (true) {
|
||||||
|
uint32_t value;
|
||||||
|
|
||||||
|
offset = fdt_next_node(fdt, offset, NULL);
|
||||||
|
if (offset < 0) {
|
||||||
|
if (offset == -FDT_ERR_NOTFOUND)
|
||||||
|
break;
|
||||||
|
|
||||||
|
return offset;
|
||||||
|
}
|
||||||
|
|
||||||
|
value = fdt_get_phandle(fdt, offset);
|
||||||
|
|
||||||
|
if (value > max)
|
||||||
|
max = value;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (max == FDT_MAX_PHANDLE)
|
||||||
|
return -FDT_ERR_NOPHANDLES;
|
||||||
|
|
||||||
|
if (phandle)
|
||||||
|
*phandle = max + 1;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
|
int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
|
||||||
{
|
{
|
||||||
FDT_CHECK_HEADER(fdt);
|
FDT_CHECK_HEADER(fdt);
|
||||||
|
|
|
@ -115,6 +115,37 @@ uint32_t fdt_get_max_phandle(const void *fdt)
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
int fdt_generate_phandle(const void *fdt, uint32_t *phandle)
|
||||||
|
{
|
||||||
|
uint32_t max = 0;
|
||||||
|
int offset = -1;
|
||||||
|
|
||||||
|
while (true) {
|
||||||
|
uint32_t value;
|
||||||
|
|
||||||
|
offset = fdt_next_node(fdt, offset, NULL);
|
||||||
|
if (offset < 0) {
|
||||||
|
if (offset == -FDT_ERR_NOTFOUND)
|
||||||
|
break;
|
||||||
|
|
||||||
|
return offset;
|
||||||
|
}
|
||||||
|
|
||||||
|
value = fdt_get_phandle(fdt, offset);
|
||||||
|
|
||||||
|
if (value > max)
|
||||||
|
max = value;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (max == FDT_MAX_PHANDLE)
|
||||||
|
return -FDT_ERR_NOPHANDLES;
|
||||||
|
|
||||||
|
if (phandle)
|
||||||
|
*phandle = max + 1;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
|
int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
|
||||||
{
|
{
|
||||||
FDT_CHECK_HEADER(fdt);
|
FDT_CHECK_HEADER(fdt);
|
||||||
|
|
|
@ -139,6 +139,10 @@
|
||||||
|
|
||||||
#define FDT_ERR_MAX 17
|
#define FDT_ERR_MAX 17
|
||||||
|
|
||||||
|
/* constants */
|
||||||
|
#define FDT_MAX_PHANDLE 0xfffffffe
|
||||||
|
/* Valid values for phandles range from 1 to 2^32-2. */
|
||||||
|
|
||||||
/**********************************************************************/
|
/**********************************************************************/
|
||||||
/* Low-level functions (you probably don't need these) */
|
/* Low-level functions (you probably don't need these) */
|
||||||
/**********************************************************************/
|
/**********************************************************************/
|
||||||
|
@ -313,6 +317,21 @@ const char *fdt_string(const void *fdt, int stroffset);
|
||||||
*/
|
*/
|
||||||
uint32_t fdt_get_max_phandle(const void *fdt);
|
uint32_t fdt_get_max_phandle(const void *fdt);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* fdt_generate_phandle - return a new, unused phandle for a device tree blob
|
||||||
|
* @fdt: pointer to the device tree blob
|
||||||
|
* @phandle: return location for the new phandle
|
||||||
|
*
|
||||||
|
* Walks the device tree blob and looks for the highest phandle value. On
|
||||||
|
* success, the new, unused phandle value (one higher than the previously
|
||||||
|
* highest phandle value in the device tree blob) will be returned in the
|
||||||
|
* @phandle parameter.
|
||||||
|
*
|
||||||
|
* Returns:
|
||||||
|
* 0 on success or a negative error-code on failure
|
||||||
|
*/
|
||||||
|
int fdt_generate_phandle(const void *fdt, uint32_t *phandle);
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* fdt_num_mem_rsv - retrieve the number of memory reserve map entries
|
* fdt_num_mem_rsv - retrieve the number of memory reserve map entries
|
||||||
* @fdt: pointer to the device tree blob
|
* @fdt: pointer to the device tree blob
|
||||||
|
|
|
@ -52,6 +52,7 @@
|
||||||
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
#include <stdbool.h>
|
||||||
#include <stddef.h>
|
#include <stddef.h>
|
||||||
#include <stdint.h>
|
#include <stdint.h>
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
|
|
Loading…
Reference in New Issue
Block a user