函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\interval_tree_test.c Create Date:2022-07-27 08:20:31
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：interval_tree_test_init

函数原型：static int interval_tree_test_init(void)

返回类型：int

参数：无

68  nodes等于分配数组内存
70  如果非nodes则返回:负ENOMEM
73  queries等于分配数组内存
74  如果非queries则
75  kfree(nodes)
76  返回:负ENOMEM
79  printk(action must be taken immediately "interval tree insert/remove")
81  prandom_seed_state - set seed for prandom_u32_state().*@state: pointer to state structure to receive the seed.*@seed: arbitrary 64-bit value to use as a seed.
82  init()
84  time1等于get_cycles()
86  以i小于perf_loops循环
87  以j小于nnodes循环interval_tree_insert(nodes + j, & root)
89  以j小于nnodes循环interval_tree_remove(nodes + j, & root)
93  time2等于get_cycles()
94  time等于time2减time1
96  time等于div_u64 - unsigned 64bit divide with 32bit divisor*@dividend: unsigned 64bit dividend*@divisor: unsigned 32bit divisor* This is the most common 64bit divide and should be used if possible,* as many 32bit archs can optimize this variant better than a full
97  printk(" -> %llu cycles\n", (unsignedlonglong)time)
99  printk(action must be taken immediately "interval tree search")
101  以j小于nnodes循环interval_tree_insert(nodes + j, & root)
104  time1等于get_cycles()
106  results等于0
107  以i小于search_loops循环以j小于nsearches循环
109  start等于如果search_all则0否则queries[j]
110  last等于如果search_all则max_endpoint否则queries[j]
112  results加等于search( & root, start, last)
115  time2等于get_cycles()
116  time等于time2减time1
118  time等于div_u64 - unsigned 64bit divide with 32bit divisor*@dividend: unsigned 64bit dividend*@divisor: unsigned 32bit divisor* This is the most common 64bit divide and should be used if possible,* as many 32bit archs can optimize this variant better than a full
119  results等于div_u64 - unsigned 64bit divide with 32bit divisor*@dividend: unsigned 64bit dividend*@divisor: unsigned 32bit divisor* This is the most common 64bit divide and should be used if possible,* as many 32bit archs can optimize this variant better than a full
120  printk(" -> %llu cycles (%lu results)\n", (unsignedlonglong)time, results)
123  kfree(queries)
124  kfree(nodes)
126  返回:负EAGAIN