1 1.1 matt /* $NetBSD: mulsi3.S,v 1.1 2014/09/03 19:34:25 matt Exp $ */ 2 1.1 matt 3 1.1 matt /*- 4 1.1 matt * Copyright (c) 2014 The NetBSD Foundation, Inc. 5 1.1 matt * All rights reserved. 6 1.1 matt * 7 1.1 matt * This code is derived from software contributed to The NetBSD Foundation 8 1.1 matt * by Matt Thomas of 3am Software Foundry. 9 1.1 matt * 10 1.1 matt * Redistribution and use in source and binary forms, with or without 11 1.1 matt * modification, are permitted provided that the following conditions 12 1.1 matt * are met: 13 1.1 matt * 1. Redistributions of source code must retain the above copyright 14 1.1 matt * notice, this list of conditions and the following disclaimer. 15 1.1 matt * 2. Redistributions in binary form must reproduce the above copyright 16 1.1 matt * notice, this list of conditions and the following disclaimer in the 17 1.1 matt * documentation and/or other materials provided with the distribution. 18 1.1 matt * 19 1.1 matt * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 20 1.1 matt * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 21 1.1 matt * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 22 1.1 matt * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 23 1.1 matt * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 24 1.1 matt * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 1.1 matt * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 1.1 matt * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 27 1.1 matt * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 1.1 matt * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29 1.1 matt * POSSIBILITY OF SUCH DAMAGE. 30 1.1 matt */ 31 1.1 matt 32 1.1 matt #include <machine/asm.h> 33 1.1 matt 34 1.1 matt __RCSID("$NetBSD: mulsi3.S,v 1.1 2014/09/03 19:34:25 matt Exp $") 35 1.1 matt 36 1.1 matt ENTRY(__mulsi3) 37 1.1 matt l.movhi r11, 0 38 1.1 matt 39 1.1 matt l.sfeqi r3, 0 40 1.1 matt l.bf .Lret 41 1.1 matt l.nop 42 1.1 matt 43 1.1 matt l.sfeqi r4, 0 44 1.1 matt l.bf .Lret 45 1.1 matt l.nop 46 1.1 matt 47 1.1 matt l.sfleu r3, r4 # is r3 < r4 (unsigned) 48 1.1 matt #if 0 49 1.1 matt l.ori r6, r3, 0 # move r3 to r6 50 1.1 matt l.bf .Lloop # yes, r6 already has smaller value, 51 1.1 matt l.nop 52 1.1 matt l.ori r6, r4, 0 # move r4 to r6 because it's smaller than r3 53 1.1 matt #else 54 1.1 matt l.cmov r6, r3, r4 # choose lesser of r3 or r4 55 1.1 matt #endif 56 1.1 matt 57 1.1 matt .Lloop: 58 1.1 matt l.andi r5, r6, 1 # get LSB 59 1.1 matt l.sub r8, r0, r5 # 0 -> 0, 1 -> 0xffffffff 60 1.1 matt l.and r8, r8, r4 # r8 = r6 & 1 ? r4 : 0 61 1.1 matt l.add r11, r11, r8 # add to result 62 1.1 matt l.srli r4, r4, 1 # discard LSB 63 1.1 matt l.slli r6, r6, 1 # multiply by 2 64 1.1 matt .Lentry: 65 1.1 matt l.sfeqi r4, 0 # only 0 left? 66 1.1 matt l.bf .Lret # yes, we're done 67 1.1 matt l.nop 68 1.1 matt l.sfeqi r6, 0 # only 0 left? 69 1.1 matt l.bnf .Lloop # no, another round of long multiplication. 70 1.1 matt l.nop 71 1.1 matt 72 1.1 matt .Lret: l.jr lr 73 1.1 matt l.nop 74 1.1 matt END(__mulsi3) 75