函数逻辑报告 | 
Source Code:kernel\audit_tree.c | 
Create Date:2022-07-27 12:33:51 | 
| Last Modify:2022-05-22 16:43:11 | Copyright©Brick | 
| 首页 | 函数Tree | 
| 注解内核,赢得工具 | 下载SCCT | English | 
函数名称:he first tagged inode becomes root of tree
函数原型:static int tag_chunk(struct inode *inode, struct audit_tree *tree)
返回类型:int
参数:
| 类型 | 参数 | 名称 | 
|---|---|---|
| struct inode * | inode | |
| struct audit_tree * | tree | 
| 469 | mutex_lock( & protect marks_list ) | 
| 470 | mark等于Given a list of marks, find the mark associated with given group. If found* take a reference to that mark and return it, else return NULL. | 
| 480 | 加自旋锁 | 
| 481 | old等于mark_chunk(mark) | 
| 490 | 自旋锁解锁 | 
| 492 | chunk等于alloc_chunk(count + 1) | 
| 493 | 如果非chunk则 | 
| 495 | fsnotify_put_mark(mark) | 
| 496 | 返回:负ENOMEM | 
| 499 | 加自旋锁 | 
| 500 | 如果goner则 | 
| 508 | index; upper bit indicates 'will prune' 等于count减1按位或1U左移31位 | 
| 511 | 添加链表项 | 
| 512 | 如果非root则 | 
| 520 | replace_chunk(chunk, old) | 
| 521 | 自旋锁解锁 | 
| 523 | fsnotify_put_mark(mark) | 
| 526 | 返回:0 | 
| 名称 | 描述 | 
|---|---|
| tag_mount | 
| 源代码转换工具 开放的插件接口  | X | 
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码  |