 next = rq->queuelist.next; if (next != &q->queue_head && next != &rq->queuelist) return list_entry_rq(next);  
struct request *elv_latter_request(request_queue_t *q, struct request *rq){	struct list_head *next;	elevator_t *e = q->elevator;	if (e->ops->elevator_latter_req_fn)		return e->ops->elevator_latter_req_fn(q, rq);	next = rq->queuelist.next;	if (next != &q->queue_head && next != &rq->queuelist)		return list_entry_rq(next);	return NULL;}
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/3beb2077125d8457118140653e75efc998ac6630/elevator.c/buggy/block/elevator.c