xref: /minix3/common/lib/libc/arch/alpha/string/bzero.S (revision b6cbf7203b080219de306404f8022a65b7884f33)
1*b6cbf720SGianluca Guida/*	$NetBSD: bzero.S,v 1.1 2005/12/20 19:28:49 christos Exp $	*/
2*b6cbf720SGianluca Guida
3*b6cbf720SGianluca Guida/*
4*b6cbf720SGianluca Guida * Copyright (c) 1995 Carnegie-Mellon University.
5*b6cbf720SGianluca Guida * All rights reserved.
6*b6cbf720SGianluca Guida *
7*b6cbf720SGianluca Guida * Author: Trevor Blackwell
8*b6cbf720SGianluca Guida *
9*b6cbf720SGianluca Guida * Permission to use, copy, modify and distribute this software and
10*b6cbf720SGianluca Guida * its documentation is hereby granted, provided that both the copyright
11*b6cbf720SGianluca Guida * notice and this permission notice appear in all copies of the
12*b6cbf720SGianluca Guida * software, derivative works or modified versions, and any portions
13*b6cbf720SGianluca Guida * thereof, and that both notices appear in supporting documentation.
14*b6cbf720SGianluca Guida *
15*b6cbf720SGianluca Guida * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
16*b6cbf720SGianluca Guida * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
17*b6cbf720SGianluca Guida * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
18*b6cbf720SGianluca Guida *
19*b6cbf720SGianluca Guida * Carnegie Mellon requests users of this software to return to
20*b6cbf720SGianluca Guida *
21*b6cbf720SGianluca Guida *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
22*b6cbf720SGianluca Guida *  School of Computer Science
23*b6cbf720SGianluca Guida *  Carnegie Mellon University
24*b6cbf720SGianluca Guida *  Pittsburgh PA 15213-3890
25*b6cbf720SGianluca Guida *
26*b6cbf720SGianluca Guida * any improvements or extensions that they make and grant Carnegie the
27*b6cbf720SGianluca Guida * rights to redistribute these changes.
28*b6cbf720SGianluca Guida */
29*b6cbf720SGianluca Guida
30*b6cbf720SGianluca Guida#include <machine/asm.h>
31*b6cbf720SGianluca Guida
32*b6cbf720SGianluca GuidaLEAF(bzero,2)
33*b6cbf720SGianluca Guida	ble	a1,bzero_done
34*b6cbf720SGianluca Guida	bic	a1,63,t3	/* t3 is # bytes to do 64 bytes at a time */
35*b6cbf720SGianluca Guida
36*b6cbf720SGianluca Guida	/* If nothing in first word, ignore it */
37*b6cbf720SGianluca Guida	subq	zero,a0,t0
38*b6cbf720SGianluca Guida	and	t0,7,t0		/* t0 = (0-size)%8 */
39*b6cbf720SGianluca Guida	beq	t0,bzero_nostart1
40*b6cbf720SGianluca Guida
41*b6cbf720SGianluca Guida	cmpult	a1,t0,t1	/* if size > size%8 goto noshort */
42*b6cbf720SGianluca Guida	beq	t1,bzero_noshort
43*b6cbf720SGianluca Guida
44*b6cbf720SGianluca Guida	/*
45*b6cbf720SGianluca Guida	 * The whole thing is less than a word.
46*b6cbf720SGianluca Guida	 * Mask off 1..7 bytes, and finish.
47*b6cbf720SGianluca Guida	 */
48*b6cbf720SGianluca Guida	ldq_u	t2,0(a0)
49*b6cbf720SGianluca Guida	lda	t0,-1(zero)	/* t0=-1 */
50*b6cbf720SGianluca Guida	mskql	t0,a1,t0	/* Get ff in bytes (a0%8)..((a0+a1-1)%8) */
51*b6cbf720SGianluca Guida	insql	t0,a0,t0
52*b6cbf720SGianluca Guida	bic	t2,t0,t2	/* zero those bytes in word */
53*b6cbf720SGianluca Guida	stq_u	t2,0(a0)
54*b6cbf720SGianluca Guida	RET
55*b6cbf720SGianluca Guida
56*b6cbf720SGianluca Guidabzero_noshort:
57*b6cbf720SGianluca Guida	/* Handle the first partial word */
58*b6cbf720SGianluca Guida	ldq_u	t2,0(a0)
59*b6cbf720SGianluca Guida	subq	a1,t0,a1
60*b6cbf720SGianluca Guida	mskql	t2,a0,t2	/* zero bytes (a0%8)..7 in word */
61*b6cbf720SGianluca Guida	stq_u	t2,0(a0)
62*b6cbf720SGianluca Guida
63*b6cbf720SGianluca Guida	addq	a0,t0,a0	/* round a0 up to next word */
64*b6cbf720SGianluca Guida	bic	a1,63,t3	/* recalc t3 (# bytes to do 64 bytes at a
65*b6cbf720SGianluca Guida				   time) */
66*b6cbf720SGianluca Guida
67*b6cbf720SGianluca Guidabzero_nostart1:
68*b6cbf720SGianluca Guida	/*
69*b6cbf720SGianluca Guida	 * Loop, zeroing 64 bytes at a time
70*b6cbf720SGianluca Guida	 */
71*b6cbf720SGianluca Guida	beq	t3,bzero_lp_done
72*b6cbf720SGianluca Guidabzero_lp:
73*b6cbf720SGianluca Guida	stq	zero,0(a0)
74*b6cbf720SGianluca Guida	stq	zero,8(a0)
75*b6cbf720SGianluca Guida	stq	zero,16(a0)
76*b6cbf720SGianluca Guida	stq	zero,24(a0)
77*b6cbf720SGianluca Guida	subq	t3,64,t3
78*b6cbf720SGianluca Guida	stq	zero,32(a0)
79*b6cbf720SGianluca Guida	stq	zero,40(a0)
80*b6cbf720SGianluca Guida	stq	zero,48(a0)
81*b6cbf720SGianluca Guida	stq	zero,56(a0)
82*b6cbf720SGianluca Guida	addq	a0,64,a0
83*b6cbf720SGianluca Guida	bne	t3,bzero_lp
84*b6cbf720SGianluca Guida
85*b6cbf720SGianluca Guidabzero_lp_done:
86*b6cbf720SGianluca Guida	/*
87*b6cbf720SGianluca Guida	 * Handle the last 0..7 words.
88*b6cbf720SGianluca Guida	 * We mask off the low bits, so we don't need an extra
89*b6cbf720SGianluca Guida	 * compare instruction for the loop (just a bne. heh-heh)
90*b6cbf720SGianluca Guida	 */
91*b6cbf720SGianluca Guida	and	a1,0x38,t4
92*b6cbf720SGianluca Guida	beq	t4,bzero_finish_lp_done
93*b6cbf720SGianluca Guidabzero_finish_lp:
94*b6cbf720SGianluca Guida	stq	zero,0(a0)
95*b6cbf720SGianluca Guida	subq	t4,8,t4
96*b6cbf720SGianluca Guida	addq	a0,8,a0
97*b6cbf720SGianluca Guida	bne	t4,bzero_finish_lp
98*b6cbf720SGianluca Guida
99*b6cbf720SGianluca Guida	/* Do the last partial word */
100*b6cbf720SGianluca Guidabzero_finish_lp_done:
101*b6cbf720SGianluca Guida	and	a1,7,t5		/* 0..7 bytes left */
102*b6cbf720SGianluca Guida	beq	t5,bzero_done	/* mskqh won't change t0 if t5==0, but I
103*b6cbf720SGianluca Guida				   don't want to touch, say, a new VM page */
104*b6cbf720SGianluca Guida	ldq	t0,0(a0)
105*b6cbf720SGianluca Guida	mskqh	t0,t5,t0
106*b6cbf720SGianluca Guida	stq	t0,0(a0)
107*b6cbf720SGianluca Guidabzero_done:
108*b6cbf720SGianluca Guida	RET
109*b6cbf720SGianluca Guida
110*b6cbf720SGianluca Guida	END(bzero)
111