github.com/ccccaoqing/test@v0.0.0-20220510085219-3985d23445c0/src/libbio/boffset.c (about)

     1  /*
     2  http://code.google.com/p/inferno-os/source/browse/libbio/boffset.c
     3  
     4  	Copyright © 1994-1999 Lucent Technologies Inc.  All rights reserved.
     5  	Revisions Copyright © 2000-2007 Vita Nuova Holdings Limited (www.vitanuova.com).  All rights reserved.
     6  
     7  Permission is hereby granted, free of charge, to any person obtaining a copy
     8  of this software and associated documentation files (the "Software"), to deal
     9  in the Software without restriction, including without limitation the rights
    10  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
    11  copies of the Software, and to permit persons to whom the Software is
    12  furnished to do so, subject to the following conditions:
    13  
    14  The above copyright notice and this permission notice shall be included in
    15  all copies or substantial portions of the Software.
    16  
    17  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    18  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
    19  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
    20  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
    21  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
    22  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
    23  THE SOFTWARE.
    24  */
    25  
    26  #include	<u.h>
    27  #include	<libc.h>
    28  #include	<bio.h>
    29  
    30  vlong
    31  Boffset(Biobuf *bp)
    32  {
    33  	vlong n;
    34  
    35  	switch(bp->state) {
    36  	default:
    37  		fprint(2, "Boffset: unknown state %d\n", bp->state);
    38  		n = Beof;
    39  		break;
    40  
    41  	case Bracteof:
    42  	case Bractive:
    43  		n = bp->offset + bp->icount;
    44  		break;
    45  
    46  	case Bwactive:
    47  		n = bp->offset + (bp->bsize + bp->ocount);
    48  		break;
    49  	}
    50  	return n;
    51  }