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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
/* gdbmstore.c - Add a new key/data pair to the database. */
/* This file is part of GDBM, the GNU data base manager, by Philip A. Nelson.
Copyright (C) 1990, 1991, 1993 Free Software Foundation, Inc.
GDBM 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.
GDBM 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 GDBM; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
You may contact the author by:
e-mail: phil@cs.wwu.edu
us-mail: Philip A. Nelson
Computer Science Department
Western Washington University
Bellingham, WA 98226
*************************************************************************/
/* include system configuration before all else. */
#include "autoconf.h"
#include "gdbmdefs.h"
#include "gdbmerrno.h"
/* Add a new element to the database. CONTENT is keyed by KEY. The
file on disk is updated to reflect the structure of the new database
before returning from this procedure. The FLAGS define the action to
take when the KEY is already in the database. The value GDBM_REPLACE
asks that the old data be replaced by the new CONTENT. The value
GDBM_INSERT asks that an error be returned and no action taken. A
return value of 0 means no errors. A return value of -1 means that
the item was not stored in the data base because the caller was not an
official writer. A return value of 0 means that the item was not stored
because the argument FLAGS was GDBM_INSERT and the KEY was already in
the database. */
int
gdbm_store (dbf, key, content, flags)
gdbm_file_info *dbf;
datum key;
datum content;
int flags;
{
int new_hash_val; /* The new hash value. */
int elem_loc; /* The location in hash bucket. */
off_t file_adr; /* The address of new space in the file. */
off_t file_pos; /* The position after a lseek. */
int num_bytes; /* Used for error detection. */
off_t free_adr; /* For keeping track of a freed section. */
int free_size;
int new_size; /* Used in allocating space. */
char *temp; /* Used in _gdbm_findkey call. */
/* First check to make sure this guy is a writer. */
if (dbf->read_write == GDBM_READER)
{
gdbm_errno = GDBM_READER_CANT_STORE;
return -1;
}
/* Check for illegal data values. A NULL dptr field is illegal because
NULL dptr returned by a lookup procedure indicates an error. */
if ((key.dptr == NULL) || (content.dptr == NULL))
{
gdbm_errno = GDBM_ILLEGAL_DATA;
return -1;
}
/* Initialize the gdbm_errno variable. */
gdbm_errno = GDBM_NO_ERROR;
/* Look for the key in the file.
A side effect loads the correct bucket and calculates the hash value. */
elem_loc = _gdbm_findkey (dbf, key, &temp, &new_hash_val);
/* Initialize these. */
file_adr = 0;
new_size = key.dsize + content.dsize;
/* Did we find the item? */
if (elem_loc != -1)
{
if (flags == GDBM_REPLACE)
{
/* Just replace the data. */
free_adr = dbf->bucket->h_table[elem_loc].data_pointer;
free_size = dbf->bucket->h_table[elem_loc].key_size
+ dbf->bucket->h_table[elem_loc].data_size;
if (free_size != new_size)
{
_gdbm_free (dbf, free_adr, free_size);
}
else
{
/* Just reuse the same address! */
file_adr = free_adr;
}
}
else
{
gdbm_errno = GDBM_CANNOT_REPLACE;
return 1;
}
}
/* Get the file address for the new space.
(Current bucket's free space is first place to look.) */
if (file_adr == 0)
{
file_adr = _gdbm_alloc (dbf, new_size);
}
/* If this is a new entry in the bucket, we need to do special things. */
if (elem_loc == -1)
{
if (dbf->bucket->count == dbf->header->bucket_elems)
{
/* Split the current bucket. */
_gdbm_split_bucket (dbf, new_hash_val);
}
/* Find space to insert into bucket and set elem_loc to that place. */
elem_loc = new_hash_val % dbf->header->bucket_elems;
while (dbf->bucket->h_table[elem_loc].hash_value != -1)
{ elem_loc = (elem_loc + 1) % dbf->header->bucket_elems; }
/* We now have another element in the bucket. Add the new information.*/
dbf->bucket->count += 1;
dbf->bucket->h_table[elem_loc].hash_value = new_hash_val;
bcopy (key.dptr, dbf->bucket->h_table[elem_loc].key_start,
(SMALL < key.dsize ? SMALL : key.dsize));
}
/* Update current bucket data pointer and sizes. */
dbf->bucket->h_table[elem_loc].data_pointer = file_adr;
dbf->bucket->h_table[elem_loc].key_size = key.dsize;
dbf->bucket->h_table[elem_loc].data_size = content.dsize;
/* Write the data to the file. */
file_pos = lseek (dbf->desc, file_adr, L_SET);
if (file_pos != file_adr) _gdbm_fatal (dbf, "lseek error");
num_bytes = write (dbf->desc, key.dptr, key.dsize);
if (num_bytes != key.dsize) _gdbm_fatal (dbf, "write error");
num_bytes = write (dbf->desc, content.dptr, content.dsize);
if (num_bytes != content.dsize) _gdbm_fatal (dbf, "write error");
/* Current bucket has changed. */
dbf->cache_entry->ca_changed = TRUE;
dbf->bucket_changed = TRUE;
/* Write everything that is needed to the disk. */
_gdbm_end_update (dbf);
return 0;
}
|
