This commit was manufactured by cvs2svn to create branch 'binutils'.
[deliverable/binutils-gdb.git] / gas / flonum-copy.c
1 /* flonum_copy.c - copy a flonum
2 Copyright (C) 1987, 1990, 1991 Free Software Foundation, Inc.
3
4 This file is part of GAS, the GNU Assembler.
5
6 GAS is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 1, or (at your option)
9 any later version.
10
11 GAS is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with GAS; see the file COPYING. If not, write to
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
19
20 /* static const char rcsid[] = "$Id$"; */
21
22 #include "as.h"
23
24 #ifdef USG
25 #define bzero(s,n) memset(s,0,n)
26 #define bcopy(from,to,n) memcpy(to,from,n)
27 #endif
28
29 void
30 flonum_copy (in, out)
31 FLONUM_TYPE * in;
32 FLONUM_TYPE * out;
33 {
34 int in_length; /* 0 origin */
35 int out_length; /* 0 origin */
36
37 out -> sign = in -> sign;
38 in_length = in -> leader - in -> low;
39 if (in_length < 0)
40 {
41 out -> leader = out -> low - 1; /* 0.0 case */
42 }
43 else
44 {
45 out_length = out -> high - out -> low;
46 /*
47 * Assume no GAPS in packing of littlenums.
48 * I.e. sizeof(array) == sizeof(element) * number_of_elements.
49 */
50 if (in_length <= out_length)
51 {
52 {
53 /*
54 * For defensive programming, zero any high-order littlenums we don't need.
55 * This is destroying evidence and wasting time, so why bother???
56 */
57 if (in_length < out_length)
58 {
59 bzero ((char *)(out->low + in_length + 1), out_length - in_length);
60 }
61 }
62 bcopy ((char *)(in->low), (char *)(out->low), (int)((in_length + 1) * sizeof(LITTLENUM_TYPE)));
63 out -> exponent = in -> exponent;
64 out -> leader = in -> leader - in -> low + out -> low;
65 }
66 else
67 {
68 int shorten; /* 1-origin. Number of littlenums we drop. */
69
70 shorten = in_length - out_length;
71 /* Assume out_length >= 0 ! */
72 bcopy ((char *)(in->low + shorten),(char *)( out->low), (int)((out_length + 1) * sizeof(LITTLENUM_TYPE)));
73 out -> leader = out -> high;
74 out -> exponent = in -> exponent + shorten;
75 }
76 } /* if any significant bits */
77 }
78
79 /* end: flonum_copy.c */
This page took 0.051772 seconds and 5 git commands to generate.