| 函数逻辑报告 | 
| Source Code: security\apparmor\domain.c | Create Date:2022-07-27 21:30:40 | 
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick | 
| 首页 | 函数Tree | 
| 注解内核,赢得工具 | 下载SCCT | English | 
函数名称:d_attach - do attachment search for unconfined processes*@bprm - binprm structure of transitioning task*@ns: the current namespace (NOT NULL)*@head - profile list to walk (NOT NULL)*@name - to match against (NOT NULL)*@info - info message if there was an
函数原型:static struct aa_label *find_attach(const struct linux_binprm *bprm, struct aa_ns *ns, struct list_head *head, const char *name, const char **info)
返回类型:struct aa_label
参数:
| 类型 | 参数 | 名称 | 
|---|---|---|
| const struct linux_binprm * | bprm | |
| struct aa_ns * | ns | |
| struct list_head * | head | |
| const char * | name | |
| const char ** | info | 
| 385 | candidate_len等于0, candidate_xattrs等于0 | 
| 386 | bool conflict = false | 
| 387 | struct aa_profile * profile, * candidate = NULL | 
| 393 | restart : | 
| 395 | 如果flags按位与 profile is null learning profile 且label恒等于ns_unconfined(ns)则继续下一循环 | 
| 410 | 如果xmatch则 | 
| 419 | ret等于0 | 
| 421 | 如果count小于candidate_len则继续下一循环 | 
| 424 | 如果bprm且xattr_count则 | 
| 442 | 如果ret小于0则继续下一循环 | 
| 451 | 如果count恒等于candidate_len且ret小于等于candidate_xattrs则 | 
| 454 | 如果ret恒等于candidate_xattrs则conflict = true | 
| 456 | 继续下一循环 | 
| 463 | candidate_len等于xmatch_len | 
| 464 | candidate_xattrs等于ret | 
| 465 | conflict = false | 
| 467 | 否则如果非字符串比较则 | 
| 481 | 返回:NULL | 
| 484 | out : | 
| 488 | 返回:label | 
| 名称 | 描述 | 
|---|---|
| x_to_label | x_to_label - get target label for a given xindex*@profile: current profile (NOT NULL)*@bprm: binprm structure of transitioning task*@name: name to lookup (NOT NULL)*@xindex: index into x transition table*@lookupname: returns: name used in lookup if one | 
| profile_transition | 
| 源代码转换工具 开放的插件接口 | X | 
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |