File Manager

003 File Manager

Current Path: /usr/src/sys/kern

📁 ..
📄 Make.tags.inc(2.13 KB)
📄 Makefile(302 B)
📄 bus_if.m(26.31 KB)
📄 capabilities.conf(13.67 KB)
📄 clock_if.m(1.7 KB)
📄 cpufreq_if.m(2.27 KB)
📄 device_if.m(10.41 KB)
📄 firmw.S(2.15 KB)
📄 genassym.sh(1.11 KB)
📄 genoffset.c(1.68 KB)
📄 genoffset.sh(3.58 KB)
📄 imgact_aout.c(9.45 KB)
📄 imgact_binmisc.c(18.64 KB)
📄 imgact_elf.c(76.32 KB)
📄 imgact_elf32.c(1.47 KB)
📄 imgact_elf64.c(1.47 KB)
📄 imgact_shell.c(8.41 KB)
📄 init_main.c(24.31 KB)
📄 init_sysent.c(95.3 KB)
📄 kern_acct.c(19.03 KB)
📄 kern_alq.c(24.97 KB)
📄 kern_clock.c(21.12 KB)
📄 kern_clocksource.c(23.34 KB)
📄 kern_condvar.c(11.28 KB)
📄 kern_conf.c(36.14 KB)
📄 kern_cons.c(15.75 KB)
📄 kern_context.c(3.59 KB)
📄 kern_cpu.c(30.77 KB)
📄 kern_cpuset.c(59.78 KB)
📄 kern_ctf.c(8.73 KB)
📄 kern_descrip.c(112.87 KB)
📄 kern_dtrace.c(2.94 KB)
📄 kern_dump.c(8.51 KB)
📄 kern_environment.c(22.75 KB)
📄 kern_et.c(7.1 KB)
📄 kern_event.c(62.49 KB)
📄 kern_exec.c(46.67 KB)
📄 kern_exit.c(34.61 KB)
📄 kern_fail.c(29.32 KB)
📄 kern_ffclock.c(12.66 KB)
📄 kern_fork.c(28.29 KB)
📄 kern_hhook.c(13.58 KB)
📄 kern_idle.c(2.74 KB)
📄 kern_intr.c(40.44 KB)
📄 kern_jail.c(112.67 KB)
📄 kern_kcov.c(15.32 KB)
📄 kern_khelp.c(9.45 KB)
📄 kern_kthread.c(11.8 KB)
📄 kern_ktr.c(11.93 KB)
📄 kern_ktrace.c(31.41 KB)
📄 kern_linker.c(54.3 KB)
📄 kern_lock.c(46.99 KB)
📄 kern_lockf.c(64.46 KB)
📄 kern_lockstat.c(3.8 KB)
📄 kern_loginclass.c(6.69 KB)
📄 kern_malloc.c(37.09 KB)
📄 kern_mbuf.c(43.16 KB)
📄 kern_mib.c(24.26 KB)
📄 kern_module.c(11.05 KB)
📄 kern_mtxpool.c(5.82 KB)
📄 kern_mutex.c(33.62 KB)
📄 kern_ntptime.c(32.49 KB)
📄 kern_osd.c(12.37 KB)
📄 kern_physio.c(5.74 KB)
📄 kern_pmc.c(8.89 KB)
📄 kern_poll.c(15.86 KB)
📄 kern_priv.c(9.14 KB)
📄 kern_proc.c(80.01 KB)
📄 kern_procctl.c(19.48 KB)
📄 kern_prot.c(57.94 KB)
📄 kern_racct.c(34.01 KB)
📄 kern_rangelock.c(8.67 KB)
📄 kern_rctl.c(53.87 KB)
📄 kern_resource.c(36.66 KB)
📄 kern_rmlock.c(28.27 KB)
📄 kern_rwlock.c(40.72 KB)
📄 kern_sdt.c(2.05 KB)
📄 kern_sema.c(4.85 KB)
📄 kern_sendfile.c(33.97 KB)
📄 kern_sharedpage.c(10.37 KB)
📄 kern_shutdown.c(43.34 KB)
📄 kern_sig.c(101.89 KB)
📄 kern_switch.c(13.85 KB)
📄 kern_sx.c(40.27 KB)
📄 kern_synch.c(18.17 KB)
📄 kern_syscalls.c(6.74 KB)
📄 kern_sysctl.c(67.24 KB)
📄 kern_tc.c(55.73 KB)
📄 kern_thr.c(14.14 KB)
📄 kern_thread.c(41.75 KB)
📄 kern_time.c(40.89 KB)
📄 kern_timeout.c(43.08 KB)
📄 kern_tslog.c(3.44 KB)
📄 kern_ubsan.c(50.74 KB)
📄 kern_umtx.c(107.14 KB)
📄 kern_uuid.c(11.68 KB)
📄 kern_xxx.c(10.44 KB)
📄 ksched.c(6.56 KB)
📄 link_elf.c(47.99 KB)
📄 link_elf_obj.c(44.41 KB)
📄 linker_if.m(3.96 KB)
📄 makesyscalls.sh(23.57 KB)
📄 md4c.c(7.89 KB)
📄 md5c.c(9.56 KB)
📄 msi_if.m(2.48 KB)
📄 p1003_1b.c(8.84 KB)
📄 pic_if.m(3.9 KB)
📄 posix4_mib.c(5.59 KB)
📄 sched_4bsd.c(45.03 KB)
📄 sched_ule.c(82.65 KB)
📄 serdev_if.m(3.49 KB)
📄 stack_protector.c(613 B)
📄 subr_acl_nfs4.c(37.42 KB)
📄 subr_acl_posix1e.c(17.71 KB)
📄 subr_atomic64.c(3.97 KB)
📄 subr_autoconf.c(7.7 KB)
📄 subr_blist.c(31.88 KB)
📄 subr_boot.c(5.8 KB)
📄 subr_bufring.c(2.21 KB)
📄 subr_bus.c(145.4 KB)
📄 subr_bus_dma.c(19.67 KB)
📄 subr_busdma_bufalloc.c(5.24 KB)
📄 subr_capability.c(11.93 KB)
📄 subr_clock.c(10.61 KB)
📄 subr_compressor.c(13.11 KB)
📄 subr_counter.c(4.44 KB)
📄 subr_coverage.c(6.17 KB)
📄 subr_csan.c(25.39 KB)
📄 subr_devmap.c(9.8 KB)
📄 subr_devstat.c(16.21 KB)
📄 subr_disk.c(8.54 KB)
📄 subr_dummy_vdso_tc.c(1.7 KB)
📄 subr_early.c(2.26 KB)
📄 subr_epoch.c(25.02 KB)
📄 subr_eventhandler.c(9.17 KB)
📄 subr_fattime.c(9.98 KB)
📄 subr_filter.c(12.2 KB)
📄 subr_firmware.c(13.88 KB)
📄 subr_gtaskqueue.c(20.19 KB)
📄 subr_hash.c(4.8 KB)
📄 subr_hints.c(12.87 KB)
📄 subr_intr.c(40.61 KB)
📄 subr_kdb.c(16.13 KB)
📄 subr_kobj.c(7.1 KB)
📄 subr_lock.c(18.81 KB)
📄 subr_log.c(7.64 KB)
📄 subr_mchain.c(11.06 KB)
📄 subr_module.c(12.98 KB)
📄 subr_msgbuf.c(10.6 KB)
📄 subr_param.c(10.93 KB)
📄 subr_pcpu.c(10.18 KB)
📄 subr_pctrie.c(20.99 KB)
📄 subr_physmem.c(11.52 KB)
📄 subr_pidctrl.c(5.43 KB)
📄 subr_power.c(3.13 KB)
📄 subr_prf.c(27.42 KB)
📄 subr_prng.c(3.36 KB)
📄 subr_prof.c(15.43 KB)
📄 subr_rangeset.c(8.5 KB)
📄 subr_rman.c(27.61 KB)
📄 subr_rtc.c(11.42 KB)
📄 subr_sbuf.c(20.53 KB)
📄 subr_scanf.c(15.59 KB)
📄 subr_sfbuf.c(6.17 KB)
📄 subr_sglist.c(22.83 KB)
📄 subr_sleepqueue.c(39.43 KB)
📄 subr_smp.c(31.62 KB)
📄 subr_smr.c(20.17 KB)
📄 subr_stack.c(6.47 KB)
📄 subr_stats.c(103.01 KB)
📄 subr_syscall.c(7.98 KB)
📄 subr_taskqueue.c(21.1 KB)
📄 subr_terminal.c(15.52 KB)
📄 subr_trap.c(10.87 KB)
📄 subr_turnstile.c(35.58 KB)
📄 subr_uio.c(11.38 KB)
📄 subr_unit.c(22.97 KB)
📄 subr_vmem.c(43.25 KB)
📄 subr_witness.c(84.59 KB)
📄 sys_capability.c(15.06 KB)
📄 sys_eventfd.c(8.42 KB)
📄 sys_generic.c(44.22 KB)
📄 sys_getrandom.c(4.21 KB)
📄 sys_pipe.c(45.14 KB)
📄 sys_procdesc.c(14.57 KB)
📄 sys_process.c(30.73 KB)
📄 sys_socket.c(20.11 KB)
📄 syscalls.c(22.73 KB)
📄 syscalls.master(60.26 KB)
📄 systrace_args.c(178.49 KB)
📄 sysv_ipc.c(6.53 KB)
📄 sysv_msg.c(48.65 KB)
📄 sysv_sem.c(49.85 KB)
📄 sysv_shm.c(43.93 KB)
📄 tty.c(55.14 KB)
📄 tty_compat.c(11.46 KB)
📄 tty_info.c(9.93 KB)
📄 tty_inq.c(12.22 KB)
📄 tty_outq.c(8.74 KB)
📄 tty_pts.c(19.74 KB)
📄 tty_tty.c(2.83 KB)
📄 tty_ttydisc.c(28.6 KB)
📄 uipc_accf.c(8.07 KB)
📄 uipc_debug.c(12.42 KB)
📄 uipc_domain.c(13.13 KB)
📄 uipc_ktls.c(55.7 KB)
📄 uipc_mbuf.c(52.45 KB)
📄 uipc_mbuf2.c(12.64 KB)
📄 uipc_mbufhash.c(4.9 KB)
📄 uipc_mqueue.c(64.64 KB)
📄 uipc_sem.c(25.18 KB)
📄 uipc_shm.c(50.47 KB)
📄 uipc_sockbuf.c(42.9 KB)
📄 uipc_socket.c(110.61 KB)
📄 uipc_syscalls.c(35.94 KB)
📄 uipc_usrreq.c(75.11 KB)
📄 vfs_acl.c(14.5 KB)
📄 vfs_aio.c(76.32 KB)
📄 vfs_bio.c(145.39 KB)
📄 vfs_cache.c(143.09 KB)
📄 vfs_cluster.c(28.36 KB)
📄 vfs_default.c(33.16 KB)
📄 vfs_export.c(14.55 KB)
📄 vfs_extattr.c(17.91 KB)
📄 vfs_hash.c(6 KB)
📄 vfs_init.c(15.86 KB)
📄 vfs_lookup.c(45.48 KB)
📄 vfs_mount.c(62.58 KB)
📄 vfs_mountroot.c(26.23 KB)
📄 vfs_subr.c(167.52 KB)
📄 vfs_syscalls.c(106.86 KB)
📄 vfs_vnops.c(86.28 KB)
📄 vnode_if.src(13.66 KB)

Editing: subr_disk.c

/*-
 * SPDX-License-Identifier: Beerware
 *
 * ----------------------------------------------------------------------------
 * "THE BEER-WARE LICENSE" (Revision 42):
 * <phk@FreeBSD.ORG> wrote this file.  As long as you retain this notice you
 * can do whatever you want with this stuff. If we meet some day, and you think
 * this stuff is worth it, you can buy me a beer in return.   Poul-Henning Kamp
 * ----------------------------------------------------------------------------
 *
 * The bioq_disksort() (and the specification of the bioq API)
 * have been written by Luigi Rizzo and Fabio Checconi under the same
 * license as above.
 */

#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");

#include "opt_geom.h"

#include <sys/param.h>
#include <sys/systm.h>
#include <sys/bio.h>
#include <sys/conf.h>
#include <sys/disk.h>
#include <sys/sysctl.h>
#include <geom/geom_disk.h>

static int bioq_batchsize = 128;
SYSCTL_INT(_debug, OID_AUTO, bioq_batchsize, CTLFLAG_RW,
    &bioq_batchsize, 0, "BIOQ batch size");

/*-
 * Disk error is the preface to plaintive error messages
 * about failing disk transfers.  It prints messages of the form
 * 	"hp0g: BLABLABLA cmd=read fsbn 12345 of 12344-12347"
 * blkdone should be -1 if the position of the error is unknown.
 * The message is printed with printf.
 */
void
disk_err(struct bio *bp, const char *what, int blkdone, int nl)
{
	daddr_t sn;

if (bp->bio_dev != NULL)
		printf("%s: %s ", devtoname(bp->bio_dev), what);
	else if (bp->bio_disk != NULL)
		printf("%s%d: %s ",
		    bp->bio_disk->d_name, bp->bio_disk->d_unit, what);
	else
		printf("disk??: %s ", what);
	switch(bp->bio_cmd) {
	case BIO_READ:		printf("cmd=read "); break;
	case BIO_WRITE:		printf("cmd=write "); break;
	case BIO_DELETE:	printf("cmd=delete "); break;
	case BIO_GETATTR:	printf("cmd=getattr "); break;
	case BIO_FLUSH:		printf("cmd=flush "); break;
	default:		printf("cmd=%x ", bp->bio_cmd); break;
	}
	sn = bp->bio_pblkno;
	if (bp->bio_bcount <= DEV_BSIZE) {
		printf("fsbn %jd%s", (intmax_t)sn, nl ? "\n" : "");
		return;
	}
	if (blkdone >= 0) {
		sn += blkdone;
		printf("fsbn %jd of ", (intmax_t)sn);
	}
	printf("%jd-%jd", (intmax_t)bp->bio_pblkno,
	    (intmax_t)(bp->bio_pblkno + (bp->bio_bcount - 1) / DEV_BSIZE));
	if (nl)
		printf("\n");
}

/*
 * BIO queue implementation
 *
 * Please read carefully the description below before making any change
 * to the code, or you might change the behaviour of the data structure
 * in undesirable ways.
 *
 * A bioq stores disk I/O request (bio), normally sorted according to
 * the distance of the requested position (bio->bio_offset) from the
 * current head position (bioq->last_offset) in the scan direction, i.e.
 *
 * 	(uoff_t)(bio_offset - last_offset)
 *
 * Note that the cast to unsigned (uoff_t) is fundamental to insure
 * that the distance is computed in the scan direction.
 *
 * The main methods for manipulating the bioq are:
 *
 *   bioq_disksort()	performs an ordered insertion;
 *
 *   bioq_first()	return the head of the queue, without removing;
 *
 *   bioq_takefirst()	return and remove the head of the queue,
 *		updating the 'current head position' as
 *		bioq->last_offset = bio->bio_offset + bio->bio_length;
 *
 * When updating the 'current head position', we assume that the result of
 * bioq_takefirst() is dispatched to the device, so bioq->last_offset
 * represents the head position once the request is complete.
 *
 * If the bioq is manipulated using only the above calls, it starts
 * with a sorted sequence of requests with bio_offset >= last_offset,
 * possibly followed by another sorted sequence of requests with
 * 0 <= bio_offset < bioq->last_offset 
 *
 * NOTE: historical behaviour was to ignore bio->bio_length in the
 *	update, but its use tracks the head position in a better way.
 *	Historical behaviour was also to update the head position when
 *	the request under service is complete, rather than when the
 *	request is extracted from the queue. However, the current API
 *	has no method to update the head position; secondly, once
 *	a request has been submitted to the disk, we have no idea of
 *	the actual head position, so the final one is our best guess.
 *
 * --- Direct queue manipulation ---
 *
 * A bioq uses an underlying TAILQ to store requests, so we also
 * export methods to manipulate the TAILQ, in particular:
 *
 * bioq_insert_tail()	insert an entry at the end.
 *		It also creates a 'barrier' so all subsequent
 *		insertions through bioq_disksort() will end up
 *		after this entry;
 *
 * bioq_insert_head()	insert an entry at the head, update
 *		bioq->last_offset = bio->bio_offset so that
 *		all subsequent insertions through bioq_disksort()
 *		will end up after this entry;
 *
 * bioq_remove()	remove a generic element from the queue, act as
 *		bioq_takefirst() if invoked on the head of the queue.
 *
 * The semantic of these methods is the same as the operations
 * on the underlying TAILQ, but with additional guarantees on
 * subsequent bioq_disksort() calls. E.g. bioq_insert_tail()
 * can be useful for making sure that all previous ops are flushed
 * to disk before continuing.
 *
 * Updating bioq->last_offset on a bioq_insert_head() guarantees
 * that the bio inserted with the last bioq_insert_head() will stay
 * at the head of the queue even after subsequent bioq_disksort().
 *
 * Note that when the direct queue manipulation functions are used,
 * the queue may contain multiple inversion points (i.e. more than
 * two sorted sequences of requests).
 *
 */

void
bioq_init(struct bio_queue_head *head)
{

TAILQ_INIT(&head->queue);
	head->last_offset = 0;
	head->insert_point = NULL;
	head->total = 0;
	head->batched = 0;
}

void
bioq_remove(struct bio_queue_head *head, struct bio *bp)
{

if (head->insert_point == NULL) {
		if (bp == TAILQ_FIRST(&head->queue))
			head->last_offset = bp->bio_offset + bp->bio_length;
	} else if (bp == head->insert_point)
		head->insert_point = NULL;

TAILQ_REMOVE(&head->queue, bp, bio_queue);
	if (TAILQ_EMPTY(&head->queue))
		head->batched = 0;
	head->total--;
}

void
bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error)
{
	struct bio *bp;

while ((bp = bioq_takefirst(head)) != NULL)
		biofinish(bp, stp, error);
}

void
bioq_insert_head(struct bio_queue_head *head, struct bio *bp)
{

if (head->insert_point == NULL)
		head->last_offset = bp->bio_offset;
	TAILQ_INSERT_HEAD(&head->queue, bp, bio_queue);
	head->total++;
	head->batched = 0;
}

void
bioq_insert_tail(struct bio_queue_head *head, struct bio *bp)
{

TAILQ_INSERT_TAIL(&head->queue, bp, bio_queue);
	head->total++;
	head->batched = 0;
	head->insert_point = bp;
	head->last_offset = bp->bio_offset;
}

struct bio *
bioq_first(struct bio_queue_head *head)
{

return (TAILQ_FIRST(&head->queue));
}

struct bio *
bioq_takefirst(struct bio_queue_head *head)
{
	struct bio *bp;

bp = TAILQ_FIRST(&head->queue);
	if (bp != NULL)
		bioq_remove(head, bp);
	return (bp);
}

/*
 * Compute the sorting key. The cast to unsigned is
 * fundamental for correctness, see the description
 * near the beginning of the file.
 */
static inline uoff_t
bioq_bio_key(struct bio_queue_head *head, struct bio *bp)
{

return ((uoff_t)(bp->bio_offset - head->last_offset));
}

/*
 * Seek sort for disks.
 *
 * Sort all requests in a single queue while keeping
 * track of the current position of the disk with last_offset.
 * See above for details.
 */
void
bioq_disksort(struct bio_queue_head *head, struct bio *bp)
{
	struct bio *cur, *prev;
	uoff_t key;

if ((bp->bio_flags & BIO_ORDERED) != 0) {
		/*
		 * Ordered transactions can only be dispatched
		 * after any currently queued transactions.  They
		 * also have barrier semantics - no transactions
		 * queued in the future can pass them.
		 */
		bioq_insert_tail(head, bp);
		return;
	}

/*
	 * We should only sort requests of types that have concept of offset.
	 * Other types, such as BIO_FLUSH or BIO_ZONE, may imply some degree
	 * of ordering even if strict ordering is not requested explicitly.
	 */
	if (bp->bio_cmd != BIO_READ && bp->bio_cmd != BIO_WRITE &&
	    bp->bio_cmd != BIO_DELETE) {
		bioq_insert_tail(head, bp);
		return;
	}

if (bioq_batchsize > 0 && head->batched > bioq_batchsize) {
		bioq_insert_tail(head, bp);
		return;
	}

prev = NULL;
	key = bioq_bio_key(head, bp);
	cur = TAILQ_FIRST(&head->queue);

if (head->insert_point) {
		prev = head->insert_point;
		cur = TAILQ_NEXT(head->insert_point, bio_queue);
	}

while (cur != NULL && key >= bioq_bio_key(head, cur)) {
		prev = cur;
		cur = TAILQ_NEXT(cur, bio_queue);
	}

if (prev == NULL)
		TAILQ_INSERT_HEAD(&head->queue, bp, bio_queue);
	else
		TAILQ_INSERT_AFTER(&head->queue, prev, bp, bio_queue);
	head->total++;
	head->batched++;
}

003 File Manager

Editing: subr_disk.c

Upload File

Create Folder