133 lines
5.1 KiB
C
133 lines
5.1 KiB
C
/*
|
|
* Copyright (c) 1982, 1986, 1989, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
* (c) UNIX System Laboratories, Inc.
|
|
* All or some portions of this file are derived from material licensed
|
|
* to the University of California by American Telephone and Telegraph
|
|
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
|
|
* the permission of UNIX System Laboratories, Inc.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)buf.h 8.9 (Berkeley) 3/30/95
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _SYS_BIO_H_
|
|
#define _SYS_BIO_H_
|
|
|
|
#include <sys/queue.h>
|
|
|
|
struct disk;
|
|
struct bio;
|
|
|
|
typedef void bio_task_t(struct bio *, void *);
|
|
|
|
/*
|
|
* The bio structure describes an I/O operation in the kernel.
|
|
*/
|
|
struct bio {
|
|
u_int bio_cmd; /* I/O operation. */
|
|
dev_t bio_dev; /* Device to do I/O on. */
|
|
struct disk *bio_disk; /* Valid below geom_disk.c only */
|
|
daddr_t bio_blkno; /* Underlying physical block number. */
|
|
off_t bio_offset; /* Offset into file. */
|
|
long bio_bcount; /* Valid bytes in buffer. */
|
|
caddr_t bio_data; /* Memory, superblocks, indirect etc. */
|
|
u_int bio_flags; /* BIO_ flags. */
|
|
int bio_error; /* Errno for BIO_ERROR. */
|
|
long bio_resid; /* Remaining I/0 in bytes. */
|
|
void (*bio_done)(struct bio *);
|
|
void *bio_driver1; /* Private use by the callee. */
|
|
void *bio_driver2; /* Private use by the callee. */
|
|
void *bio_caller1; /* Private use by the caller. */
|
|
void *bio_caller2; /* Private use by the caller. */
|
|
TAILQ_ENTRY(bio) bio_queue; /* Disksort queue. */
|
|
const char *bio_attribute; /* Attribute for BIO_[GS]ETATTR */
|
|
struct g_consumer *bio_from; /* GEOM linkage */
|
|
struct g_provider *bio_to; /* GEOM linkage */
|
|
off_t bio_length; /* Like bio_bcount */
|
|
off_t bio_completed; /* Inverse of bio_resid */
|
|
u_int bio_children; /* Number of spawned bios */
|
|
u_int bio_inbed; /* Children safely home by now */
|
|
struct bio *bio_parent; /* Pointer to parent */
|
|
struct bintime bio_t0; /* Time request started */
|
|
|
|
bio_task_t *bio_task; /* Task_queue handler */
|
|
void *bio_task_arg; /* Argument to above */
|
|
|
|
/* XXX: these go away when bio chaining is introduced */
|
|
daddr_t bio_pblkno; /* physical block number */
|
|
};
|
|
|
|
/* bio_cmd */
|
|
#define BIO_READ 0x00000001
|
|
#define BIO_WRITE 0x00000002
|
|
#define BIO_DELETE 0x00000004
|
|
#define BIO_GETATTR 0x00000008
|
|
#define BIO_CMD1 0x40000000 /* Available for local hacks */
|
|
#define BIO_CMD2 0x80000000 /* Available for local hacks */
|
|
|
|
/* bio_flags */
|
|
#define BIO_ERROR 0x00000001
|
|
#define BIO_DONE 0x00000004
|
|
#define BIO_FLAG2 0x40000000 /* Available for local hacks */
|
|
#define BIO_FLAG1 0x80000000 /* Available for local hacks */
|
|
|
|
#ifdef _KERNEL
|
|
|
|
struct uio;
|
|
struct devstat;
|
|
|
|
struct bio_queue_head {
|
|
TAILQ_HEAD(bio_queue, bio) queue;
|
|
daddr_t last_pblkno;
|
|
struct bio *insert_point;
|
|
struct bio *switch_point;
|
|
};
|
|
|
|
void biodone(struct bio *bp);
|
|
void biofinish(struct bio *bp, struct devstat *stat, int error);
|
|
int biowait(struct bio *bp, const char *wchan);
|
|
|
|
void bioq_disksort(struct bio_queue_head *ap, struct bio *bp);
|
|
struct bio *bioq_first(struct bio_queue_head *head);
|
|
void bioq_flush(struct bio_queue_head *head, struct devstat *stp, int error);
|
|
void bioq_init(struct bio_queue_head *head);
|
|
void bioq_insert_tail(struct bio_queue_head *head, struct bio *bp);
|
|
void bioq_remove(struct bio_queue_head *head, struct bio *bp);
|
|
|
|
int physio(dev_t dev, struct uio *uio, int ioflag);
|
|
#define physread physio
|
|
#define physwrite physio
|
|
|
|
#endif /* _KERNEL */
|
|
|
|
#endif /* !_SYS_BIO_H_ */
|