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
|
/* $OpenBSD: rf_utils.c,v 1.4 2000/01/11 18:02:23 peter Exp $ */
/* $NetBSD: rf_utils.c,v 1.5 2000/01/07 03:41:03 oster Exp $ */
/*
* Copyright (c) 1995 Carnegie-Mellon University.
* All rights reserved.
*
* Author: Mark Holland
*
* Permission to use, copy, modify and distribute this software and
* its documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
* FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie the
* rights to redistribute these changes.
*/
/****************************************
*
* rf_utils.c -- various support routines
*
****************************************/
#include "rf_threadstuff.h"
#include <sys/time.h>
#include "rf_utils.h"
#include "rf_debugMem.h"
#include "rf_alloclist.h"
#include "rf_general.h"
/* creates & zeros 2-d array with b rows and k columns (MCH) */
RF_RowCol_t **
rf_make_2d_array(b, k, allocList)
int b;
int k;
RF_AllocListElem_t *allocList;
{
RF_RowCol_t **retval, i;
RF_MallocAndAdd(retval, b * sizeof(RF_RowCol_t *), (RF_RowCol_t **), allocList);
for (i = 0; i < b; i++) {
RF_MallocAndAdd(retval[i], k * sizeof(RF_RowCol_t), (RF_RowCol_t *), allocList);
(void) bzero((char *) retval[i], k * sizeof(RF_RowCol_t));
}
return (retval);
}
void
rf_free_2d_array(a, b, k)
RF_RowCol_t **a;
int b;
int k;
{
RF_RowCol_t i;
for (i = 0; i < b; i++)
RF_Free(a[i], k * sizeof(RF_RowCol_t));
RF_Free(a, b * sizeof(RF_RowCol_t));
}
/* creates & zeros a 1-d array with c columns */
RF_RowCol_t *
rf_make_1d_array(c, allocList)
int c;
RF_AllocListElem_t *allocList;
{
RF_RowCol_t *retval;
RF_MallocAndAdd(retval, c * sizeof(RF_RowCol_t), (RF_RowCol_t *), allocList);
(void) bzero((char *) retval, c * sizeof(RF_RowCol_t));
return (retval);
}
void
rf_free_1d_array(a, n)
RF_RowCol_t *a;
int n;
{
RF_Free(a, n * sizeof(RF_RowCol_t));
}
/* Euclid's algorithm: finds and returns the greatest common divisor
* between a and b. (MCH)
*/
int
rf_gcd(m, n)
int m;
int n;
{
int t;
while (m > 0) {
t = n % m;
n = m;
m = t;
}
return (n);
}
/* these convert between text and integer. Apparently the regular C macros
* for doing this are not available in the kernel
*/
#define ISDIGIT(x) ( (x) >= '0' && (x) <= '9' )
#define ISHEXCHAR(x) ( ((x) >= 'a' && (x) <= 'f') || ((x) >= 'A' && (x) <= 'F') )
#define ISHEX(x) ( ISDIGIT(x) || ISHEXCHAR(x) )
#define HC2INT(x) ( ((x) >= 'a' && (x) <= 'f') ? (x) - 'a' + 10 : \
( ((x) >= 'A' && (x) <= 'F') ? (x) - 'A' + 10 : (x - '0') ) )
int
rf_atoi(p)
char *p;
{
int val = 0, negate = 0;
if (*p == '-') {
negate = 1;
p++;
}
for (; ISDIGIT(*p); p++)
val = 10 * val + (*p - '0');
return ((negate) ? -val : val);
}
int
rf_htoi(p)
char *p;
{
int val = 0;
for (; ISHEXCHAR(*p); p++)
val = 16 * val + HC2INT(*p);
return (val);
}
|
