aboutsummaryrefslogtreecommitdiffstats
path: root/vendor/github.com/andybalholm/brotli/memory.go
blob: a07c7050a07f9fc8f61f734f763c6ac3faba0539 (plain) (blame)
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
package brotli

/* Copyright 2016 Google Inc. All Rights Reserved.

   Distributed under MIT license.
   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
*/

/*
Dynamically grows array capacity to at least the requested size
T: data type
A: array
C: capacity
R: requested size
*/
func brotli_ensure_capacity_uint8_t(a *[]byte, c *uint, r uint) {
	if *c < r {
		var new_size uint = *c
		if new_size == 0 {
			new_size = r
		}

		for new_size < r {
			new_size *= 2
		}

		if cap(*a) < int(new_size) {
			var new_array []byte = make([]byte, new_size)
			if *c != 0 {
				copy(new_array, (*a)[:*c])
			}

			*a = new_array
		} else {
			*a = (*a)[:new_size]
		}

		*c = new_size
	}
}

func brotli_ensure_capacity_uint32_t(a *[]uint32, c *uint, r uint) {
	var new_array []uint32
	if *c < r {
		var new_size uint = *c
		if new_size == 0 {
			new_size = r
		}

		for new_size < r {
			new_size *= 2
		}

		if cap(*a) < int(new_size) {
			new_array = make([]uint32, new_size)
			if *c != 0 {
				copy(new_array, (*a)[:*c])
			}

			*a = new_array
		} else {
			*a = (*a)[:new_size]
		}
		*c = new_size
	}
}