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
|
/* BLURB lgpl
Coda File System
Release 5
Copyright (c) 1987-1999 Carnegie Mellon University
Additional copyrights listed below
This code is distributed "AS IS" without warranty of any kind under
the terms of the GNU Library General Public Licence Version 2, as
shown in the file LICENSE. The technical and financial contributors to
Coda are listed in the file CREDITS.
Additional copyrights
none currently
#*/
#include <stdio.h>
#include "rds_private.h"
/************** NOTE: ***************/
/* we create our own transactions in the following routines, even
* though there is a tid in the interface. This might result in unreferenced
* objects if the thread which malloc'ed the object decides to abort. These
* routines have no way of knowing if such an event happens. Also, if the user
* free's then aborts, could have pointers into the free list objects.
*
* Interface has been changed so that if a user feels confident that his
* transactions are serialized, (the above problem won't arise), he can pass
* in a non-null tid ptr and it will be used. So if you aren't sure, make the
* tidptr is zero!
*/
/* Allocate a free block which will hold size + some bytes. The some refers to
* a size field, and two guards to detect overwriting of memory, which will
* be added to the object. Treat the last list seperately since it holds objects
* of that size chunks OR LARGER. A pointer to size bytes will be returned. */
char *
rds_malloc(size, tid, err)
unsigned long size;
rvm_tid_t *tid;
int *err;
{
free_block_t *fbp=NULL;
rvm_tid_t *atid;
rvm_return_t rvmret;
int i;
unsigned long orig_size = size;
/* Make sure the heap has been initialized */
if (!HEAP_INIT) {
(*err) = EHEAP_INIT;
return NULL;
}
/* Reserve bytes to hold the block's size and 2 guards, hidden from user */
size += RDS_BLOCK_HDR_SIZE;
i = (size / RDS_CHUNK_SIZE) + 1; /* determine which list to use */
if (tid == NULL) { /* Use input tid if non-null */
atid = rvm_malloc_tid();
rvmret = rvm_begin_transaction(atid, restore);
if (rvmret != RVM_SUCCESS) {
(*err) = (int)rvmret;
rvm_free_tid(atid);
return NULL;
}
} else
atid = tid;
*err = SUCCESS; /* Initialize the error value */
CRITICAL({
/* Update stats */
rvmret = rvm_set_range(atid, &RDS_STATS, sizeof(rds_stats_t));
if (rvmret != RVM_SUCCESS) {
(*err) = (int)rvmret;
if (tid == NULL) {
rvm_abort_transaction(atid);
rvm_free_tid(atid);
}
LEAVE_CRITICAL_SECTION;
}
RDS_STATS.malloc++;
RDS_STATS.freebytes -= i * RDS_CHUNK_SIZE;
RDS_STATS.mallocbytes += i * RDS_CHUNK_SIZE;
/* Get a block of the correct size. */
fbp = get_block(i, atid, err);
if (*err != SUCCESS) {
if (tid == NULL) {
rvm_abort_transaction(atid);
rvm_free_tid(atid);
}
LEAVE_CRITICAL_SECTION;
}
assert(fbp->size == i); /* Sanity check */
/* Check to see that the guards are valid and the type is free */
assert((fbp->type == FREE_GUARD) && ((*BLOCK_END(fbp)) == END_GUARD));
/* Set the lowguard to reflect that the block has been allocated. */
rvmret = rvm_set_range(atid, fbp, sizeof(free_block_t));
if (rvmret != RVM_SUCCESS) {
if (tid == NULL) {
rvm_abort_transaction(atid);
rvm_free_tid(atid);
}
(*err) = (int)rvmret;
LEAVE_CRITICAL_SECTION;
}
fbp->type = ALLOC_GUARD;
fbp->prev = fbp->next = NULL;
if (tid == NULL) { /* Let code below pick up the error. */
(*err) =(int) rvm_end_transaction(atid, no_flush);
rvm_free_tid(atid);
}
});
if (*err != SUCCESS) return NULL;
RDS_LOG("rdstrace: malloc addr %p size %lx req %lx\n",
USER_BLOCK(fbp), i * RDS_CHUNK_SIZE, orig_size);
return(USER_BLOCK(fbp));
}
|
