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 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279
|
/* Copyright (C) 2000, 2001, 2002, 2003, 2004 Stijn van Dongen
*
* This file is part of MCL. You can redistribute and/or modify MCL under the
* terms of the GNU General Public License; either version 2 of the License or
* (at your option) any later version. You should have received a copy of the
* GPL along with MCL, in the file COPYING.
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "array.h"
#include "alloc.h"
#include "types.h"
#include "err.h"
#include "minmax.h"
mcxstatus mcxSplice
( void* base1pptr
, const void* base2ptr
, int size /* size of base1 and base2 members */
, int *pn_base1 /* # base1 elements currently in use */
, int *pN_base1 /* # base1 elements for which is malloced */
, int O_base1 /* splice relative to this element */
, int d_base1 /* delete this number of elements */
, int c_base2 /* number of elements to copy */
)
{ char **ppr1 = (char **) base1pptr
; char* dummy
; const char *ptr2 = (const char *) base2ptr
; int n_base1 = *pn_base1
; int N_base1 = *pN_base1
; int m_base1 = n_base1 - d_base1 + c_base2
; int o_base1 = O_base1 >= 0
? O_base1
: n_base1 + O_base1 + 1
; const char *errMsg = ""
; mcxstatus stat = STATUS_FAIL
; while (1)
{ if ( n_base1 < 0
|| N_base1 < 0
|| n_base1 > N_base1
|| d_base1 < 0
|| c_base2 < 0
)
{ errMsg = "integer arguments not consistent"
; break
; }
if (o_base1 < 0 || o_base1 > n_base1)
{ errMsg = "computed splice offset not in bounds"
; break
; }
if (*ppr1 == NULL && ptr2 == NULL)
{ errMsg = "source and destination both void"
; break
; }
if (o_base1 + d_base1 > n_base1)
{ errMsg = "not that many elements to delete"
; break
; }
stat = STATUS_OK
; break
; }
if (stat != STATUS_OK)
{ mcxErr("[mcxSplice PBD]", "%s", errMsg)
; mcxErr
( "[mcxSplice PBD]"
, "[n1, %ld] [N1, %ld] [o1, %ld] [d1, %ld] [c2, %ld]"
, (long) n_base1, (long) N_base1, (long) O_base1
, (long) d_base1, (long) c_base2
)
; return STATUS_FAIL
; }
if (m_base1 > N_base1)
{ if (!(dummy = mcxRealloc(*ppr1, size*m_base1, RETURN_ON_FAIL)))
{ mcxMemDenied(stderr, "mcxSplice", "void", m_base1)
; return STATUS_FAIL
; }
*pN_base1 = N_base1 = m_base1
; *ppr1 = dummy
; }
if (o_base1 < n_base1)
memmove
( *ppr1 + size*(o_base1 + c_base2)
, *ppr1 + size*(o_base1 + d_base1)
, size*(n_base1 - o_base1 - d_base1)
)
; if (c_base2)
memcpy
( *ppr1 + size * (o_base1)
, ptr2
, size*(c_base2)
)
; *pn_base1 = m_base1
; return STATUS_OK
; }
int mcxDedup
( void* base
, int nmemb
, int size
, int (*cmp)(const void *, const void *)
, void (*merge)(void *, const void *)
)
{ int k = 0
; int l = 0
; while (l < nmemb)
{
if (k != l)
memcpy(((char*)base) + k * size, ((char*)base) + l * size, size)
; while
( ++l < nmemb
&& ( cmp
? (!cmp(((char*)base) + k * size, ((char*)base) + l * size))
: (!memcmp(((char*)base) + k*size, ((char*)base) + l*size, size))
)
)
{ if (merge)
merge(((char*)base) + k * size, ((char*)base) + l * size)
; }
k++
; }
return k
; }
mcxstatus mcxResize
( void* mempp
, int size
, int* ct
, int newct
, mcxOnFail ON_FAIL
)
{ char **pp = (char **) mempp
; char* ptr = *pp
; if (newct && !(ptr = mcxRealloc(ptr, size*newct, ON_FAIL)))
return STATUS_FAIL
; *pp = ptr
; *ct = newct
; return STATUS_OK
; }
mcxstatus mcxBufInit
( mcxBuf* buf
, void* mempptr
, int size
, int n_alloc
)
{ char **usrpptr = (char **) mempptr
; char* dummy
; buf->mempptr = mempptr
; buf->size = size
; buf->n = 0
; buf->bFinalized = 0
; buf->factor = 1.41
; dummy = mcxRealloc
( *usrpptr
, n_alloc * size
, RETURN_ON_FAIL
)
; if (n_alloc && !dummy)
{ mcxMemDenied(stderr, "mcxBufInit", "char", n_alloc * size)
; buf->n_alloc = 0
; return STATUS_FAIL
; }
buf->n_alloc = n_alloc
; *usrpptr = dummy
; return STATUS_OK
; }
void* mcxBufExtend
( mcxBuf* buf
, int n_request
, mcxOnFail ON_FAIL
)
{ int oldsize = buf->n
; char **usrpptr = (char **) buf->mempptr
; char* dummy
; if (buf->bFinalized)
mcxErr("mcxBufExtend PBD", "extending finalized buffer")
; if (buf->n_alloc < buf->n + n_request)
{ int n_new
= MAX
( (int) (buf->n_alloc * buf->factor + 8)
, (int) (buf->n + n_request)
)
; dummy = mcxRealloc
( *usrpptr
, n_new * buf->size
, ON_FAIL
)
; if (n_new && !dummy)
{ mcxMemDenied(stderr,"mcxBufExtend","char",buf->n*buf->size)
; return NULL
; }
buf->n_alloc = n_new
; *usrpptr = dummy
; }
buf->n += n_request
; return *usrpptr + (oldsize * buf->size)
; }
int mcxBufFinalize
( mcxBuf* buf
)
{ char **usrpptr = (char **) buf->mempptr
; char* dummy
; if (buf->bFinalized)
mcxErr("mcxBufFinalize PBD", "extending finalized buffer")
; else
buf->bFinalized = 1
; dummy = mcxRealloc
( *usrpptr
, buf->n * buf->size
, RETURN_ON_FAIL
)
; if (buf->n && !dummy)
{ mcxMemDenied(stderr, "mcxBufFinalize", "char", buf->n * buf->size)
; return -1
; }
*usrpptr = dummy
; buf->n_alloc = buf->n
; return buf->n
; }
void mcxBufReset
( mcxBuf* buf
, void* mempptr
)
{ if (!buf->bFinalized)
mcxErr("mcxBufReset PBD", "buffer not finalized")
; buf->mempptr = mempptr
; buf->n = 0
; buf->n_alloc = 0
; buf->bFinalized = 0
; }
|