当前位置: 首页 > news >正文

linker list

linker list是利用lds 描述符实现同类型数据连续排布的一种机制。
下面是uboot里面的应用说明

lds文件里面需要增加section描述:

. = ALIGN(4);.u_boot_list : {KEEP(*(SORT(.u_boot_list*)));}

linker_list.h:

/* SPDX-License-Identifier: GPL-2.0+ */
/** include/linker_lists.h** Implementation of linker-generated arrays** Copyright (C) 2012 Marek Vasut <marex@denx.de>*/#ifndef __LINKER_LISTS_H__
#define __LINKER_LISTS_H__#include <linux/compiler.h>/** There is no use in including this from ASM files.* So just don't define anything when included from ASM.*/#if !defined(__ASSEMBLY__)/*** llsym() - Access a linker-generated array entry* @_type:	Data type of the entry* @_name:	Name of the entry* @_list:	name of the list. Should contain only characters allowed*		in a C variable name!*/
#define llsym(_type, _name, _list) \((_type *)&_u_boot_list_2_##_list##_2_##_name)/*** ll_entry_declare() - Declare linker-generated array entry* @_type:	Data type of the entry* @_name:	Name of the entry* @_list:	name of the list. Should contain only characters allowed*		in a C variable name!** This macro declares a variable that is placed into a linker-generated* array. This is a basic building block for more advanced use of linker-* generated arrays. The user is expected to build their own macro wrapper* around this one.** A variable declared using this macro must be compile-time initialized.** Special precaution must be made when using this macro:** 1) The _type must not contain the "static" keyword, otherwise the*    entry is generated and can be iterated but is listed in the map*    file and cannot be retrieved by name.** 2) In case a section is declared that contains some array elements AND*    a subsection of this section is declared and contains some elements,*    it is imperative that the elements are of the same type.** 3) In case an outer section is declared that contains some array elements*    AND an inner subsection of this section is declared and contains some*    elements, then when traversing the outer section, even the elements of*    the inner sections are present in the array.** Example:** ::**   ll_entry_declare(struct my_sub_cmd, my_sub_cmd, cmd_sub) = {*           .x = 3,*           .y = 4,*   };*/
#define ll_entry_declare(_type, _name, _list)				\_type _u_boot_list_2_##_list##_2_##_name __aligned(4)		\__attribute__((unused,				\section(".u_boot_list_2_"#_list"_2_"#_name)))/*** ll_entry_declare_list() - Declare a list of link-generated array entries* @_type:	Data type of each entry* @_name:	Name of the entry* @_list:	name of the list. Should contain only characters allowed*		in a C variable name!** This is like ll_entry_declare() but creates multiple entries. It should* be assigned to an array.** ::**   ll_entry_declare_list(struct my_sub_cmd, my_sub_cmd, cmd_sub) = {*        { .x = 3, .y = 4 },*        { .x = 8, .y = 2 },*        { .x = 1, .y = 7 }*   };*/
#define ll_entry_declare_list(_type, _name, _list)			\_type _u_boot_list_2_##_list##_2_##_name[] __aligned(4)		\__attribute__((unused,				\section(".u_boot_list_2_"#_list"_2_"#_name)))/** We need a 0-byte-size type for iterator symbols, and the compiler* does not allow defining objects of C type 'void'. Using an empty* struct is allowed by the compiler, but causes gcc versions 4.4 and* below to complain about aliasing. Therefore we use the next best* thing: zero-sized arrays, which are both 0-byte-size and exempt from* aliasing warnings.*//*** ll_entry_start() - Point to first entry of linker-generated array* @_type:	Data type of the entry* @_list:	Name of the list in which this entry is placed** This function returns ``(_type *)`` pointer to the very first entry of a* linker-generated array placed into subsection of .u_boot_list section* specified by _list argument.** Since this macro defines an array start symbol, its leftmost index* must be 2 and its rightmost index must be 1.** Example:** ::**   struct my_sub_cmd *msc = ll_entry_start(struct my_sub_cmd, cmd_sub);*/
#define ll_entry_start(_type, _list)					\
({									\static char start[0] __aligned(4) __attribute__((unused,	\section(".u_boot_list_2_"#_list"_1")));			\(_type *)&start;						\
})/*** ll_entry_end() - Point after last entry of linker-generated array* @_type:	Data type of the entry* @_list:	Name of the list in which this entry is placed*		(with underscores instead of dots)** This function returns ``(_type *)`` pointer after the very last entry of* a linker-generated array placed into subsection of .u_boot_list* section specified by _list argument.** Since this macro defines an array end symbol, its leftmost index* must be 2 and its rightmost index must be 3.** Example:** ::**   struct my_sub_cmd *msc = ll_entry_end(struct my_sub_cmd, cmd_sub);*/
#define ll_entry_end(_type, _list)					\
({									\static char end[0] __aligned(4) __attribute__((unused,		\section(".u_boot_list_2_"#_list"_3")));			\(_type *)&end;							\
})
/*** ll_entry_count() - Return the number of elements in linker-generated array* @_type:	Data type of the entry* @_list:	Name of the list of which the number of elements is computed** This function returns the number of elements of a linker-generated array* placed into subsection of .u_boot_list section specified by _list* argument. The result is of an unsigned int type.** Example:** ::**   int i;*   const unsigned int count = ll_entry_count(struct my_sub_cmd, cmd_sub);*   struct my_sub_cmd *msc = ll_entry_start(struct my_sub_cmd, cmd_sub);*   for (i = 0; i < count; i++, msc++)*           printf("Entry %i, x=%i y=%i\n", i, msc->x, msc->y);*/
#define ll_entry_count(_type, _list)					\({								\_type *start = ll_entry_start(_type, _list);		\_type *end = ll_entry_end(_type, _list);		\unsigned int _ll_result = end - start;			\_ll_result;						\})/*** ll_entry_get() - Retrieve entry from linker-generated array by name* @_type:	Data type of the entry* @_name:	Name of the entry* @_list:	Name of the list in which this entry is placed** This function returns a pointer to a particular entry in linker-generated* array identified by the subsection of u_boot_list where the entry resides* and it's name.** Example:** ::**   ll_entry_declare(struct my_sub_cmd, my_sub_cmd, cmd_sub) = {*           .x = 3,*           .y = 4,*   };*   ...*   struct my_sub_cmd *c = ll_entry_get(struct my_sub_cmd, my_sub_cmd, cmd_sub);*/
#define ll_entry_get(_type, _name, _list)				\({								\extern _type _u_boot_list_2_##_list##_2_##_name;	\_type *_ll_result =					\&_u_boot_list_2_##_list##_2_##_name;		\_ll_result;						\})/*** ll_start() - Point to first entry of first linker-generated array* @_type:	Data type of the entry** This function returns ``(_type *)`` pointer to the very first entry of* the very first linker-generated array.** Since this macro defines the start of the linker-generated arrays,* its leftmost index must be 1.** Example:** ::**   struct my_sub_cmd *msc = ll_start(struct my_sub_cmd);*/
#define ll_start(_type)							\
({									\static char start[0] __aligned(4) __attribute__((unused,	\section(".u_boot_list_1")));				\(_type *)&start;						\
})/*** ll_end() - Point after last entry of last linker-generated array* @_type:	Data type of the entry** This function returns ``(_type *)`` pointer after the very last entry of* the very last linker-generated array.** Since this macro defines the end of the linker-generated arrays,* its leftmost index must be 3.** Example:** ::**   struct my_sub_cmd *msc = ll_end(struct my_sub_cmd);*/
#define ll_end(_type)							\
({									\static char end[0] __aligned(4) __attribute__((unused,		\section(".u_boot_list_3")));				\(_type *)&end;							\
})#endif /* __ASSEMBLY__ */#endif	/* __LINKER_LISTS_H__ */

ll_entry_declare_list 和ll_entry_declare差别是前者是数组声明,一次可以声明多个条目,后者只声明(定义)一个条目。

ll_entry_start(_type, _list) 获取该类型列表首个条目地址

ll_entry_get(_type, _name, _list) 根据名字 返回条目地址

ll_entry_count(_type, _list) 返回该类型条目数

使用实例

参考driver的定义:

struct driver {char *name;enum uclass_id id;const struct udevice_id *of_match;int (*bind)(struct udevice *dev);int (*probe)(struct udevice *dev);int (*remove)(struct udevice *dev);int (*unbind)(struct udevice *dev);int (*ofdata_to_platdata)(struct udevice *dev);int (*child_post_bind)(struct udevice *dev);int (*child_pre_probe)(struct udevice *dev);int (*child_post_remove)(struct udevice *dev);int priv_auto_alloc_size;int platdata_auto_alloc_size;int per_child_auto_alloc_size;int per_child_platdata_auto_alloc_size;const void *ops;	/* driver-specific operations */uint32_t flags;
};/* Declare a new U-Boot driver */
#define U_BOOT_DRIVER(__name)						\ll_entry_declare(struct driver, __name, driver)

usb hub driver

U_BOOT_DRIVER(usb_generic_hub) = {
.name = “usb_hub”,
.id = UCLASS_USB_HUB,
.of_match = usb_hub_ids,
.flags = DM_FLAG_ALLOC_PRIV_DMA,
};

http://www.lryc.cn/news/296742.html

相关文章:

  • [CUDA手搓]从零开始用C++ CUDA搭建一个卷积神经网络(LeNet),了解神经网络各个层背后算法原理
  • 【开源】基于JAVA+Vue+SpringBoot的数据可视化的智慧河南大屏
  • 页面单跳转换率统计案例分析
  • 眸思MouSi:“听见世界” — 用多模态大模型点亮盲人生活
  • 电商小程序05用户注册
  • 什么是UI设计?
  • React 实现表单组件
  • PlantUML绘制UML图教程
  • 自学Python第二十二天- Django框架(六) django的实用插件:cron、APScheduler
  • 医院挂号预约|医院挂号预约小程序|基于微信小程序的医院挂号预约系统设计与实现(源码+数据库+文档)
  • 网络选择流程分析(首选网络类型切换流程)
  • AutoSAR(基础入门篇)6.1-Vector的汽车电子开发工具链简介
  • TI的电量计驱动在卸载时导致Linux卡死
  • 使用yolo训练自己的模型
  • 堆的概念实现
  • Redis(三)主从架构、Redis哨兵架构、Redis集群方案对比、Redis高可用集群搭建、Redis高可用集群之水平扩展
  • pnpm + vite 从外网迁移到内网环境开发
  • 寒假作业7
  • 【0257】关于pg内核shared cache invalidation messages (概念篇)
  • Nginx 缓存集成、清除、设置不缓存资源
  • C++面试宝典第27题:完全平方数之和
  • webrtc native api的几个要点
  • MinMaxScaler, StandardScaler数据预处理中常用的两种缩放方法,用于将数据标准化或归一化到特定的范围或分布
  • 【Web】vulhub Shiro-550反序列化漏洞复现学习笔记
  • 【论文精读】多模态情感分析 —— VLP-MABSA
  • SQL SELECT TOP, LIMIT, ROWNUM 子句
  • 金融信贷风控评分卡模型
  • 【java苍穹外卖项目实战二】苍穹外卖环境搭建
  • 在 Ubuntu 22.04 上安装 Django Web 框架的方法
  • JVM Java虚拟机入门指南