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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
|
/* $OpenBSD: util.c,v 1.18 2004/06/14 15:07:36 millert Exp $ */
/*
* Copyright (c) 1998 Per Fogelstrom, Opsycon AB
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/mman.h>
#include <sys/sysctl.h>
#include <string.h>
#include "archdep.h"
/*
* Stack protector dummies.
* Ideally, a scheme to compile these stubs from libc should be used, but
* this would end up dragging too much code from libc here.
*/
long __guard[8] = {0, 0, 0, 0, 0, 0, 0, 0};
void __stack_smash_handler(char [], int);
void
__stack_smash_handler(char func[], int damaged)
{
_dl_exit(127);
}
/*
* Static vars usable after bootstrapping.
*/
static void *_dl_malloc_pool = 0;
static long *_dl_malloc_free = 0;
char *
_dl_strdup(const char *orig)
{
char *newstr;
int len;
len = _dl_strlen(orig)+1;
newstr = _dl_malloc(len);
_dl_strlcpy(newstr, orig, len);
return (newstr);
}
#define _dl_round_page(x) (((x) + (__LDPGSZ - 1)) & ~(__LDPGSZ - 1))
/*
* The following malloc/free code is a very simplified implementation
* of a malloc function. However, we do not need to be very complex here
* because we only free memory when 'dlclose()' is called and we can
* reuse at least the memory allocated for the object descriptor. We have
* one dynamic string allocated, the library name and it is likely that
* we can reuse that one to without a lot of complex colapsing code.
*/
void *
_dl_malloc(size_t need)
{
long *p, *t, *n, have;
need = (need + 8 + DL_MALLOC_ALIGN - 1) & ~(DL_MALLOC_ALIGN - 1);
if ((t = _dl_malloc_free) != 0) { /* Try free list first */
n = (long *)&_dl_malloc_free;
while (t && t[-1] < need) {
n = t;
t = (long *)*t;
}
if (t) {
*n = *t;
_dl_memset(t, 0, t[-1] - sizeof(long));
return((void *)t);
}
}
have = _dl_round_page((long)_dl_malloc_pool) - (long)_dl_malloc_pool;
if (need > have) {
if (have >= 8 + DL_MALLOC_ALIGN) {
p = _dl_malloc_pool;
*p = have;
_dl_free((void *)(p + 1)); /* move to freelist */
}
_dl_malloc_pool = (void *)_dl_mmap((void *)0,
_dl_round_page(need), PROT_READ|PROT_WRITE,
MAP_ANON|MAP_PRIVATE, -1, 0);
if (_dl_malloc_pool == 0 || _dl_malloc_pool == MAP_FAILED ) {
_dl_printf("Dynamic loader failure: malloc.\n");
_dl_exit(7);
}
}
p = _dl_malloc_pool;
_dl_malloc_pool += need;
_dl_memset(p, 0, need);
*p = need;
return((void *)(p + 1));
}
void
_dl_free(void *p)
{
long *t = (long *)p;
*t = (long)_dl_malloc_free;
_dl_malloc_free = p;
}
unsigned int
_dl_random(void)
{
int mib[2];
unsigned int rnd;
size_t len;
mib[0] = CTL_KERN;
mib[1] = KERN_ARND;
len = sizeof(rnd);
_dl_sysctl(mib, 2, &rnd, &len, NULL, 0);
return (rnd);
}
|
