1/*- 2 * Copyright (c) 1988 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)vaxbsubs.s 4.2 (Berkeley) 4/26/91 34 */ 35 36/* This is taken from bcmp.s from 4.2. 37 * The output of bunequal is the offset of the byte which didn't match; 38 * if all the bytes match, then we return n. 39 * 40 * BUGNOTE: This has no chance of working for lengths greater than 64K. 41 * (so, if you use this somewhere else, you may need to 42 * fix it...) 43 */ 44 45/* bunequal(s1, s2, n) */ 46 47#include "defs.h" 48 49ENTRY(bunequal) 50 movl 4(ap),r1 51 movl 8(ap),r3 52 movl 12(ap),r4 531: 54 movzwl $65535,r0 55 cmpl r4,r0 56 jleq 2f 57 subl2 r0,r4 58 cmpc3 r0,(r1),(r3) 59 jeql 1b 60 addl2 r4,r0 61 /* changes... */ 62 subl3 r0,12(ap),r0 63 /* end of changes for bunequal... */ 64 ret 652: 66 cmpc3 r4,(r1),(r3) 67 /* changes... */ 68 subl3 r0,12(ap),r0 69 /* end of changes for bunequal... */ 70 ret 71 72 73 74 75/* brand new code, using the above as base... */ 76/* bskip(s1, n, b) : finds the first occurrence of any byte != 'b' in the 'n' 77 * bytes beginning at 's1'. 78 * 79 * BUGNOTE: This has no chance of working for lengths greater than 64K. 80 * (so, if you use this somewhere else, you may need to 81 * fix it...) 82 */ 83 84ENTRY(bskip) 85 movl 4(ap),r1 86 movl 8(ap),r3 87 movl 12(ap),r4 881: 89 movzwl $65535,r0 90 cmpl r3,r0 91 jleq 2f 92 subl2 r0,r3 93 skpc r4,r0,(r1) 94 jeql 1b 95 addl2 r3,r0 96 subl3 r0,8(ap),r0 97 ret 982: 99 skpc r4,r3,(r1) 100 subl3 r0,8(ap),r0 101 ret 102