elv_rb_add

Name:RB-tree support functions for inserting/lookup/removal of requests* in a sorted RB tree.

Proto:void elv_rb_add(struct rb_root *root, struct request *rq)

Type:void

Parameter:

Type	Parameter	Name
struct rb_root *	root
struct request *	rq

257

258

struct rb_node * parent = NULL

261

When p cycle

262

parent = p

263

__rq = rb_entry(parent, structrequest, rb_node)

265

If lk_rq_pos() : the current sector* blk_rq_bytes() : bytes left in the entire request* blk_rq_cur_bytes() : bytes left in the current segment* blk_rq_err_bytes() : bytes left till the next error boundary* blk_rq_sectors() : sectors left in the entire < lk_rq_pos() : the current sector* blk_rq_bytes() : bytes left in the entire request* blk_rq_cur_bytes() : bytes left in the current segment* blk_rq_err_bytes() : bytes left till the next error boundary* blk_rq_sectors() : sectors left in the entire Then p = rb_left

267

Else if lk_rq_pos() : the current sector* blk_rq_bytes() : bytes left in the entire request* blk_rq_cur_bytes() : bytes left in the current segment* blk_rq_err_bytes() : bytes left till the next error boundary* blk_rq_sectors() : sectors left in the entire >= lk_rq_pos() : the current sector* blk_rq_bytes() : bytes left in the entire request* blk_rq_cur_bytes() : bytes left in the current segment* blk_rq_err_bytes() : bytes left till the next error boundary* blk_rq_sectors() : sectors left in the entire Then p = rb_right

271

rb_link_node( & sort/lookup , parent, p)

272

rb_insert_color( & sort/lookup , root)

**Caller**
Name	Describe
deadline_add_rq_rb
bfq_add_request
bfq_request_merged

Source code conversion tool public plug-in interface	X
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion