File: array.c

package info (click to toggle)
staden 2.0.0%2Bb11-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster
  • size: 21,556 kB
  • sloc: ansic: 240,603; tcl: 65,360; cpp: 12,854; makefile: 11,201; sh: 2,952; fortran: 2,033; perl: 63; awk: 46
file content (175 lines) | stat: -rw-r--r-- 3,350 bytes parent folder | download | duplicates (4)
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
171
172
173
174
175
/*
 * Copyright (c) Medical Research Council 1994. All rights reserved.
 *
 * Permission to use, copy, modify and distribute this software and its
 * documentation for any purpose is hereby granted without fee, provided that
 * this copyright and notice appears in all copies.
 *
 * This file was written by James Bonfield, Simon Dear, Rodger Staden,
 * as part of the Staden Package at the MRC Laboratory of Molecular
 * Biology, Hills Road, Cambridge, CB2 2QH, United Kingdom.
 *
 * MRC disclaims all warranties with regard to this software.
 */

/*
 * File: array.c
 * Version:
 *
 * Author:
 *         MRC Laboratory of Molecular Biology
 *	   Hills Road
 *	   Cambridge CB2 2QH
 *	   United Kingdom
 *
 * Description:
 *
 * Created:
 * Updated:
 *
 */

#include <stdio.h>
#include <string.h>
#include <sys/types.h>

#include "array.h"
#include "xalloc.h"

/*#include <c_asm.h>*/

char *ArrayErrorString(int err)
{
    switch(err) {
    case ARRAY_NO_ERROR:          return "No error";
    case ARRAY_FULL:     	  return "Array full";
    case ARRAY_INVALID_ARGUMENTS: return "Invalid arguments";
    case ARRAY_OUT_OF_MEMORY:     return "Out of memory";
    default:			  return "Unknown error";
    }
}

Array ArrayCreate(size_t size, size_t dim)
/*
 * create a new array
 */
{
    Array a;

/*    printf("CR: 0x%lx:",(long)asm("bis %ra,%ra,%v0")); */

    if ( (a = (Array) xmalloc(sizeof(ArrayStruct)) ) == NULL ) {
	(void)aerr_set(ARRAY_OUT_OF_MEMORY);
    } else {
	a->size = size;
	a->dim = dim?dim:1;
	a->max = 0;
	if ( (a->base = (void *)xmalloc(a->size * a->dim)) == NULL ) {
	    (void)aerr_set(ARRAY_OUT_OF_MEMORY);
	    xfree(a);
	    a = NULL;
	}
    }
    
/*    printf("0x%lx - size %d\n", (long)a, a->size * a->dim); */
    return a;
    
}



int ArrayExtend(Array a, size_t dim)
/*
 * extend array
 */
{
    void *newbase;
    size_t old_dim;

    if (a == NULL) {
	return aerr_set(ARRAY_INVALID_ARGUMENTS);
    }

    if (dim < a->dim) {
	return 0;
    }

    old_dim = a->dim;
    while (dim >= a->dim) {
	a->dim = a->dim * 1.2 + 1;
    }

    if ( (newbase = (void *)xrealloc(a->base, a->size * a->dim)) == NULL ) {
	a->dim = old_dim;
	return aerr_set(ARRAY_OUT_OF_MEMORY);
    } else {
	a->base = newbase;
    }

    return 0;
}


void *ArrayRef(Array a, size_t i)
{
    if (a==NULL) {
	(void)aerr_set(ARRAY_INVALID_ARGUMENTS);
	return NULL;
    }

    if (i >= a->max) {
	if (i >= a->dim) {
	    if (ArrayExtend(a,i+1)) {
		/* ArrayExtend sets aerrnum */
		return NULL;
	    }
	}
	a->max = i+1;
    }

    return (void *) arrp(char,a,i*a->size);
}

int ArrayDestroy(Array a)
/*
 * destroy array
 */
{
/*    printf("DR: 0x%lx:0x%lx\n",(long)asm("bis %ra,%ra,%v0"), (long)a); */

    if (a==NULL) {
	return aerr_set(ARRAY_INVALID_ARGUMENTS);
    }
    
    if (a->base != NULL) xfree(a->base);
    a->base= NULL;
    xfree(a);

    return 0;
}


/*
 * Concatenates Array b onto the end of Array a.
 * Array b is left unmodified.
 *
 * Returns 0 on success;
 *        -1 on failure.
 */
int ArrayConcat(Array a, Array b) {
    if (a->size != b->size) {
	fprintf(stderr, "Attempt made to concatenate incompatible arrays\n");
	return -1;
    }

    if (ArrayExtend(a, a->max + b->max))
	return -1;

    memcpy((char *)a->base + a->max*a->size,
	   (char *)b->base,
	   b->size * b->max);
    a->max += b->max;

    return 0;
}