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
|
/*
* This file is part of libdyn.a, the C Dynamic Object library. It
* contains the source code for the functions DynGet() and DynAdd().
*
* There are no restrictions on this code; however, if you make any
* changes, I request that you document them so that I do not get
* credit or blame for your modifications.
*
* Written by Barr3y Jaspan, Student Information Processing Board (SIPB)
* and MIT-Project Athena, 1989.
*/
#include "dynP.h"
int DynPut();
DynPtr DynGet(obj, num)
DynObjectP obj;
int num;
{
if (num < 0) {
if (obj->debug)
fprintf(stderr, "dyn: get: bad index %d\n", num);
return NULL;
}
if (num >= obj->num_el) {
if (obj->debug)
fprintf(stderr, "dyn: get: highest element is %d.\n",
obj->num_el);
return NULL;
}
if (obj->debug)
fprintf(stderr, "dyn: get: Returning address %d + %d.\n",
obj->array, obj->el_size*num);
return (DynPtr) obj->array + obj->el_size*num;
}
int DynAdd(obj, el)
DynObjectP obj;
DynPtr el;
{
int ret;
ret = DynPut(obj, el, obj->num_el);
if (ret != DYN_OK)
return ret;
++obj->num_el;
return ret;
}
/*
* WARNING! There is a reason this function is not documented in the
* man page. If DynPut used to mutate already existing elements,
* everything will go fine. If it is used to add new elements
* directly, however, the state within the object (such as
* obj->num_el) will not be updated properly and many other functions
* in the library will lose. Have a nice day.
*/
int DynPut(obj, el, index)
DynObjectP obj;
DynPtr el;
int index;
{
int ret;
if (obj->debug)
fprintf(stderr, "dyn: put: Writing %d bytes from %d to %d + %d\n",
obj->el_size, el, obj->array, index*obj->el_size);
if ((ret = _DynResize(obj, index)) != DYN_OK)
return ret;
(void) memmove(obj->array + index*obj->el_size, el, obj->el_size);
if (obj->debug)
fprintf(stderr, "dyn: put: done.\n");
return DYN_OK;
}
|
