1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
/* @(#)fillbytes.c 1.9 98/02/15 Copyright 1987 J. Schilling */
/*
* fill memory with data
*
* Copyright (c) 1987 J. Schilling
*/
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <standard.h>
#include <align.h>
#define DO8(a) a;a;a;a;a;a;a;a;
#define cval ((char) lval)
#ifdef PROTOTYPES
char *fillbytes(void *tov, int cnt, char val)
#else
char *fillbytes(tov, cnt, val)
void *tov;
int cnt;
char val;
#endif
{
register char *to = (char *)tov;
register int n;
register long lval;
if ((n = cnt) == 0)
return (to);
lval = val & 0xFF;
while (!laligned(to)) {
*to++ = cval;
n--;
}
if (n >= 8 * sizeof(long)) {
register int rem = n % (8 * sizeof (long));
lval |= (lval<<8);
lval |= (lval<<16);
#if SIZE_LONG > SIZE_INT
lval |= (lval<<32);
#endif
n /= (8 * sizeof (long));
{
register long *tol = (long *)to;
do {
DO8 (*tol++ = lval);
} while (--n > 0);
to = (char *)tol;
}
n = rem;
if (n >= 8) {
n -= 8;
do {
DO8 (*to++ = cval);
} while ((n -= 8) >= 0);
n += 8;
}
if (n > 0) do {
*to++ = cval;
} while (--n > 0);
return (to);
}
if (n > 0) do {
*to++ = cval;
} while (--n > 0);
return (to);
}
|
