openwrt/upstream - upstream openwrt

diff options

author	John Crispin <john@openwrt.org>	2014-10-14 12:21:16 +0000
committer	John Crispin <john@openwrt.org>	2014-10-14 12:21:16 +0000
commit	064f50871b57e2e17232ca2fd10845eaa3a1025b (patch)
tree	a5f8cf39c99f9110b7322fe13ca51364d72ebfac /package/system
parent	20940138ac41e3eca54afefc34f65e40834be3ea (diff)
download	upstream-064f50871b57e2e17232ca2fd10845eaa3a1025b.tar.gz upstream-064f50871b57e2e17232ca2fd10845eaa3a1025b.tar.bz2 upstream-064f50871b57e2e17232ca2fd10845eaa3a1025b.zip

target/toolchain/Config.in: Clarify packaging of toolchain.

Change the "help" info to emphasize that this option refers specifically to packaging the toolchain that would be built anyway. Signed-off-by: Robert P. J. Day <rpjday@crashcourse.ca> SVN-Revision: 42912

Diffstat (limited to 'package/system')

0 files changed, 0 insertions, 0 deletions

/* * linux/drivers/block/elevator.c * * Block device elevator/IO-scheduler. * * Copyright (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE * * 30042000 Jens Axboe <axboe@suse.de> : * * Split the elevator a bit so that it is possible to choose a different * one or even write a new "plug in". There are three pieces: * - elevator_fn, inserts a new request in the queue list * - elevator_merge_fn, decides whether a new buffer can be merged with * an existing request * - elevator_dequeue_fn, called when a request is taken off the active list * * 20082000 Dave Jones <davej@suse.de> : * Removed tests for max-bomb-segments, which was breaking elvtune * when run without -bN * */ #include <xeno/config.h> #include <xeno/types.h> /*#include <xeno/fs.h>*/ #include <xeno/blkdev.h> #include <xeno/elevator.h> #include <xeno/blk.h> #include <xeno/module.h> #include <asm/uaccess.h> /* * This is a bit tricky. It's given that bh and rq are for the same * device, but the next request might of course not be. Run through * the tests below to check if we want to insert here if we can't merge * bh into an existing request */ inline int bh_rq_in_between(struct buffer_head *bh, struct request *rq, struct list_head *head) { struct list_head *next; struct request *next_rq; next = rq->queue.next; if (next == head) return 0; /* * if the device is different (usually on a different partition), * just check if bh is after rq */ next_rq = blkdev_entry_to_request(next); if (next_rq->rq_dev != rq->rq_dev) return bh->b_rsector > rq->sector; /* * ok, rq, next_rq and bh are on the same device. if bh is in between * the two, this is the sweet spot */ if (bh->b_rsector < next_rq->sector && bh->b_rsector > rq->sector) return 1; /* * next_rq is ordered wrt rq, but bh is not in between the two */ if (next_rq->sector > rq->sector) return 0; /* * next_rq and rq not ordered, if we happen to be either before * next_rq or after rq insert here anyway */ if (bh->b_rsector > rq->sector || bh->b_rsector < next_rq->sector) return 1; return 0; } int elevator_linus_merge(request_queue_t *q, struct request **req, struct list_head * head, struct buffer_head *bh, int rw, int max_sectors) { struct list_head *entry = &q->queue_head; unsigned int count = bh->b_size >> 9, ret = ELEVATOR_NO_MERGE; while ((entry = entry->prev) != head) { struct request *__rq = blkdev_entry_to_request(entry); /* * simply "aging" of requests in queue */ if (__rq->elevator_sequence-- <= 0) break; if (__rq->waiting) continue; if (__rq->rq_dev != bh->b_rdev) continue; if (!*req && bh_rq_in_between(bh, __rq, &q->queue_head)) *req = __rq; if (__rq->cmd != rw) continue; if (__rq->nr_sectors + count > max_sectors) continue; if (__rq->elevator_sequence < count)


context:
space:
mode: