xref: /freebsd/lib/libc/quad/TESTS/mul.c (revision 0b8224d1)
1 /*-
2  * SPDX-License-Identifier: BSD-3-Clause
3  *
4  * Copyright (c) 1992, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * This software was developed by the Computer Systems Engineering group
8  * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9  * contributed to Berkeley.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  * 3. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 #include <stdio.h>
37 
main()38 main()
39 {
40 	union { long long q; unsigned long v[2]; } a, b, m;
41 	char buf[300];
42 	extern long long __muldi3(long long, long long);
43 
44 	for (;;) {
45 		printf("> ");
46 		if (fgets(buf, sizeof buf, stdin) == NULL)
47 			break;
48 		if (sscanf(buf, "%lu:%lu %lu:%lu",
49 			    &a.v[0], &a.v[1], &b.v[0], &b.v[1]) != 4 &&
50 		    sscanf(buf, "0x%lx:%lx 0x%lx:%lx",
51 			    &a.v[0], &a.v[1], &b.v[0], &b.v[1]) != 4) {
52 			printf("eh?\n");
53 			continue;
54 		}
55 		m.q = __muldi3(a.q, b.q);
56 		printf("%lx:%lx * %lx:%lx => %lx:%lx\n",
57 		    a.v[0], a.v[1], b.v[0], b.v[1], m.v[0], m.v[1]);
58 		printf("  = %lX%08lX * %lX%08lX => %lX%08lX\n",
59 		    a.v[0], a.v[1], b.v[0], b.v[1], m.v[0], m.v[1]);
60 	}
61 	exit(0);
62 }
63