函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：adblocks_set() - Add a range of bad blocks to the table

函数原型：int badblocks_set(struct badblocks *bb, sector_t s, int sectors, int acknowledged)

返回类型：int

参数：

类型参数名称
struct badblocks *bb
sector_ts
intsectors
intacknowledged
168  rv等于0
171  如果 shift from sectors to block size * a -ve shift means badblocks are * disabled.小于0则返回:1
175  如果 shift from sectors to block size * a -ve shift means badblocks are * disabled.则
177  next等于s加sectors
179  s右移等于 shift from sectors to block size * a -ve shift means badblocks are * disabled.位
180  next加等于1左移 shift from sectors to block size * a -ve shift means badblocks are * disabled.位的值减1
181  next右移等于 shift from sectors to block size * a -ve shift means badblocks are * disabled.位
182  sectors等于next减s
185  write_seqlock_irqsave( & lock, flags)
187  p等于 badblock list
188  lo等于0
189  hi等于 count of bad blocks
191  当hi减lo大于1循环
192  mid等于lo加hi的和除2
193  a等于BB_OFFSET(p[mid])
195  如果a小于等于s则lo等于mid
197  否则hi等于mid
200  如果hi大于lo且BB_OFFSET(p[lo])大于s则hi等于lo
203  如果hi大于lo则
207  a等于BB_OFFSET(p[lo])
208  e等于a加BB_LEN(p[lo])
209  ack等于BB_ACK(p[lo])
211  如果e大于等于s则
213  如果s恒等于a且s加sectors大于等于e则ack等于acknowledged
216  否则ack等于ack且acknowledged
219  如果e小于s加sectors则e等于s加sectors
221  如果e减a小于等于BB_MAX_LEN则
222  p[lo]等于BB_MAKE(a, e - a, ack)
223  s等于e
224  否则
228  如果BB_LEN(p[lo])不等于BB_MAX_LEN则p[lo]等于BB_MAKE(a, BB_MAX_LEN, ack)
230  s等于a加BB_MAX_LEN
232  sectors等于e减s
235  如果sectors且hi小于 count of bad blocks 则
239  a等于BB_OFFSET(p[hi])
240  e等于a加BB_LEN(p[hi])
241  ack等于BB_ACK(p[hi])
243  如果a小于等于s加sectors则
245  如果e小于等于s加sectors则
247  e等于s加sectors
248  ack等于acknowledged
249  否则ack等于ack且acknowledged
252  a等于s
253  如果e减a小于等于BB_MAX_LEN则
254  p[hi]等于BB_MAKE(a, e - a, ack)
255  s等于e
256  否则
257  p[hi]等于BB_MAKE(a, BB_MAX_LEN, ack)
258  s等于a加BB_MAX_LEN
260  sectors等于e减s
261  lo等于hi
262  hi自加
265  如果sectors恒等于0且hi小于 count of bad blocks 则
268  a等于BB_OFFSET(p[hi])
269  lolen等于BB_LEN(p[lo])
270  hilen等于BB_LEN(p[hi])
271  newlen等于lolen加hilen减s减a
273  如果s大于等于a且newlen小于BB_MAX_LEN则
275  ack等于BB_ACK(p[lo])且BB_ACK(p[hi])
277  p[lo]等于BB_MAKE(BB_OFFSET(p[lo]), newlen, ack)
278  Not static to avoid a conflict with the prototype in the Linux headers.
280  count of bad blocks 自减
283  当sectors循环
287  如果 count of bad blocks 大于等于Bad block numbers are stored sorted in a single page.* 64bits is used for each block or extent.* 54 bits are sector number, 9 bits are extent size,* 1 bit is an 'acknowledged' flag.则
289  rv等于1
290  退出
291  否则
292  this_sectors等于sectors
294  memmove(p + hi + 1, p + hi, ( count of bad blocks - hi) * 8)
296  count of bad blocks 自加
298  如果this_sectors大于BB_MAX_LEN则this_sectors等于BB_MAX_LEN
300  p[hi]等于BB_MAKE(s, this_sectors, acknowledged)
301  sectors减等于this_sectors
302  s加等于this_sectors
306  changed等于1
307  如果非acknowledged则 there probably are unacknowledged * bad blocks. This is only cleared * when a read discovers none等于1
309  否则badblocks_update_acked(bb)
311  write_sequnlock_irqrestore( & lock, flags)
313  返回:rv
调用者
名称描述
badblocks_storeadblocks_store() - sysfs access to bad-blocks list*@bb: the badblocks structure that holds all badblock information*@page: buffer received from sysfs*@len: length of data received from sysfs*@unack: weather to show unacknowledged badblocks* Return: