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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/* $OpenBSD: util.c,v 1.6 2015/10/07 03:06:46 krw Exp $ */
/*
* Copyright (c) 2014 Joel Sing <jsing@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/stat.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <limits.h>
#include "installboot.h"
#define MINIMUM(a, b) (((a) < (b)) ? (a) : (b))
#define BUFSIZE 512
void
filecopy(const char *srcfile, const char *dstfile)
{
struct stat sb;
ssize_t sz, n;
int sfd, dfd;
char *buf;
if ((buf = malloc(BUFSIZE)) == NULL)
err(1, "malloc");
sfd = open(srcfile, O_RDONLY);
if (sfd == -1)
err(1, "open %s", srcfile);
if (fstat(sfd, &sb) == -1)
err(1, "fstat");
sz = sb.st_size;
dfd = open(dstfile, O_WRONLY|O_CREAT);
if (dfd == -1)
err(1, "open %s", dstfile);
if (fchown(dfd, 0, 0) == -1)
if (errno != EINVAL)
err(1, "chown");
if (fchmod(dfd, S_IRUSR|S_IWUSR|S_IRGRP|S_IROTH) == -1)
err(1, "chmod");
while (sz > 0) {
n = MINIMUM(sz, BUFSIZE);
if ((n = read(sfd, buf, n)) == -1)
err(1, "read");
sz -= n;
if (write(dfd, buf, n) != n)
err(1, "write");
}
ftruncate(dfd, sb.st_size);
close(dfd);
close(sfd);
free(buf);
}
char *
fileprefix(const char *base, const char *path)
{
char *r, *s;
int n;
if ((s = malloc(PATH_MAX)) == NULL)
err(1, "malloc");
n = snprintf(s, PATH_MAX, "%s/%s", base, path);
if (n < 1 || n >= PATH_MAX)
err(1, "snprintf");
if ((r = realpath(s, NULL)) == NULL)
err(1, "realpath");
free(s);
return r;
}
/*
* Adapted from Hacker's Delight crc32b().
*
* To quote http://www.hackersdelight.org/permissions.htm :
*
* "You are free to use, copy, and distribute any of the code on
* this web site, whether modified by you or not. You need not give
* attribution. This includes the algorithms (some of which appear
* in Hacker's Delight), the Hacker's Assistant, and any code submitted
* by readers. Submitters implicitly agree to this."
*/
u_int32_t
crc32(const u_char *buf, const u_int32_t size)
{
int j;
u_int32_t i, byte, crc, mask;
crc = 0xFFFFFFFF;
for (i = 0; i < size; i++) {
byte = buf[i]; /* Get next byte. */
crc = crc ^ byte;
for (j = 7; j >= 0; j--) { /* Do eight times. */
mask = -(crc & 1);
crc = (crc >> 1) ^ (0xEDB88320 & mask);
}
}
return ~crc;
}
|
