函数逻辑报告 | 
Source Code:lib\raid6\algos.c | 
Create Date:2022-07-27 08:07:08 | 
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick | 
| 首页 | 函数Tree | 
| 注解内核,赢得工具 | 下载SCCT | English | 
函数名称:raid6_choose_gen
函数原型:static inline const struct raid6_calls *raid6_choose_gen(void *( *const dptrs)[(65536/((1UL)<<12))+2], const int disks)
返回类型:struct raid6_calls
参数:
| 类型 | 参数 | 名称 | 
|---|---|---|
| void *( *const | dptrs | |
| const int | disks | 
| 166 | perf等于0 | 
| 168 | 禁止抢占() | 
| 171 | cpu_relax() | 
| 172 | 当time_before(jiffies, j1 + (1 << RAID6_TIME_JIFFIES_LG2))循环 | 
| 174 | gen_syndrome(disks, PAGE_SIZE, * dptrs) | 
| 175 | perf自加 | 
| 177 | 禁用抢占和中断() | 
| 179 | 如果perf大于bestgenperf则 | 
| 180 | bestgenperf等于perf | 
| 183 | 打印信息("raid6: %-8s gen() %5ld MB/s\n", Name of this routine set , (perf * HZ) >> (20 - 16 + RAID6_TIME_JIFFIES_LG2)) | 
| 186 | 如果非xor_syndrome则继续下一循环 | 
| 189 | perf等于0 | 
| 191 | 禁止抢占() | 
| 194 | cpu_relax() | 
| 195 | 当time_before(jiffies, j1 + (1 << RAID6_TIME_JIFFIES_LG2))循环 | 
| 201 | 禁用抢占和中断() | 
| 203 | 如果best恒等于algo则bestxorperf等于perf | 
| 206 | 打印信息("raid6: %-8s xor() %5ld MB/s\n", Name of this routine set , (perf * HZ) >> (20 - 16 + RAID6_TIME_JIFFIES_LG2 + 1)) | 
| 211 | 如果best则 | 
| 212 | 打印信息("raid6: using algorithm %s gen() %ld MB/s\n", Name of this routine set , (bestgenperf * HZ) >> (20 - 16 + RAID6_TIME_JIFFIES_LG2)) | 
| 215 | 如果xor_syndrome则打印信息("raid6: .... xor() %ld MB/s, rmw enabled\n", (bestxorperf * HZ) >> (20 - 16 + RAID6_TIME_JIFFIES_LG2 + 1)) | 
| 218 | raid6_call等于best | 
| 219 | 否则打印错误信息("raid6: Yikes! No algorithm found!\n") | 
| 222 | 返回:best | 
| 名称 | 描述 | 
|---|---|
| raid6_select_algo | This code uses the gfmul table as convenient data set to abuse | 
| 源代码转换工具 开放的插件接口  | X | 
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码  |