aboutsummaryrefslogtreecommitdiff
path: root/lib/darr.c
blob: 4393c4b592921a673ec025172989e8d21792ff3e (plain)
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
/* Copyright (C) 2023 Aryadev Chavali

 * You may distribute and modify this code under the terms of the
 * GPLv2 license.  You should have received a copy of the GPLv2
 * license with this file.  If not, please write to:
 * aryadev@aryadevchavali.com.

 * Created: 2023-10-15
 * Author: Aryadev Chavali
 * Description: Dynamically sized byte array
 */

#include <assert.h>
#include <malloc.h>
#include <string.h>

#include "./darr.h"

void darr_init(darr_t *darr, size_t size)
{
  if (size == 0)
    size = DARR_DEFAULT_SIZE;
  *darr = (darr_t){
      .data      = calloc(size, 1),
      .used      = 0,
      .available = size,
  };
}

void darr_ensure_capacity(darr_t *darr, size_t requested)
{
  if (darr->used + requested >= darr->available)
  {
    darr->available =
        MAX(darr->used + requested, darr->available * DARR_REALLOC_MULT);
    darr->data = realloc(darr->data, darr->available);
  }
}

void darr_append_byte(darr_t *darr, byte byte)
{
  darr_ensure_capacity(darr, 1);
  darr->data[darr->used++] = byte;
}

void darr_append_bytes(darr_t *darr, byte *bytes, size_t n)
{
  darr_ensure_capacity(darr, n);
  memcpy(darr->data + darr->used, bytes, n);
  darr->used += n;
}

byte darr_at(darr_t *darr, size_t index)
{
  if (index >= darr->used)
    // TODO: Error (index is out of bounds)
    return 0;
  return darr->data[index];
}

void darr_write_file(darr_t *bytes, FILE *fp)
{
  size_t size = fwrite(bytes->data, bytes->used, 1, fp);
  assert(size == 1);
}

darr_t darr_read_file(FILE *fp)
{
  darr_t darr = {0};
  fseek(fp, 0, SEEK_END);
  long size = ftell(fp);
  darr_init(&darr, size);
  fseek(fp, 0, SEEK_SET);
  size_t read = fread(darr.data, size, 1, fp);
  assert(read == 1);
  return darr;
}