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
use std::collections::{LinkedList, HashMap};
use ocl::{Queue, Buffer};
use ocl::traits::OclPrm;
use ocl::flags::MemFlags;
pub struct PoolRegion {
buffer_id: usize,
origin: u32,
len: u32,
}
pub struct SubBufferPool<T: OclPrm> {
buffer: Buffer<T>,
regions: LinkedList<PoolRegion>,
sub_buffers: HashMap<usize, Buffer<T>>,
align: u32,
_next_uid: usize,
}
impl<T: OclPrm> SubBufferPool<T> {
pub fn new(len: u32, default_queue: Queue) -> SubBufferPool<T> {
let align = default_queue.device().mem_base_addr_align().unwrap();
let flags = MemFlags::new().alloc_host_ptr().read_write();
let buffer = Buffer::<T>::builder()
.queue(default_queue)
.flags(flags)
.len(len as usize)
.build().unwrap();
SubBufferPool {
buffer: buffer,
regions: LinkedList::new(),
sub_buffers: HashMap::new(),
align: align,
_next_uid: 0,
}
}
fn next_valid_align(&self, unaligned_origin: u32) -> u32 {
((unaligned_origin / self.align) + 1) * self.align
}
fn next_uid(&mut self) -> usize {
self._next_uid += 1;
self._next_uid - 1
}
fn insert_region(&mut self, region: PoolRegion, region_idx: usize) {
let mut tail = self.regions.split_off(region_idx);
self.regions.push_back(region);
self.regions.append(&mut tail);
}
fn create_sub_buffer(&mut self, region_idx: usize, flags: Option<MemFlags>,
origin: u32, len: u32) -> usize {
let buffer_id = self.next_uid();
let region = PoolRegion { buffer_id: buffer_id, origin: origin, len: len };
let sbuf = self.buffer.create_sub_buffer(flags, region.origin as usize,
region.len as usize).unwrap();
if let Some(idx) = self.sub_buffers.insert(region.buffer_id, sbuf) {
panic!("Duplicate indexes: {}", idx); }
self.insert_region(region, region_idx);
buffer_id
}
pub fn alloc(&mut self, len: u32, flags: Option<MemFlags>) -> Result<usize, ()> {
assert!(self.regions.len() == self.sub_buffers.len());
match self.regions.front() {
Some(_) => {
let mut end_prev = 0;
let mut create_at = None;
for (region_idx, region) in self.regions.iter().enumerate() {
if region.origin - end_prev >= len {
create_at = Some(region_idx);
break;
} else {
end_prev = self.next_valid_align(region.origin + region.len);
}
}
if let Some(region_idx) = create_at {
Ok(self.create_sub_buffer(region_idx, flags, end_prev, len))
} else if self.buffer.len() as u32 - end_prev >= len {
let region_idx = self.regions.len();
Ok(self.create_sub_buffer(region_idx, flags, end_prev, len))
} else {
Err(())
}
},
None => {
Ok(self.create_sub_buffer(0, flags, 0, len))
},
}
}
pub fn free(&mut self, buffer_id: usize) -> Result<(), usize> {
let mut region_idx = None;
if let Some(_) = self.sub_buffers.remove(&buffer_id) {
region_idx = self.regions.iter().position(|r| r.buffer_id == buffer_id);
}
if let Some(r_idx) = region_idx {
let mut tail = self.regions.split_off(r_idx);
tail.pop_front().ok_or(buffer_id) ?;
self.regions.append(&mut tail);
Ok(())
} else {
Err(buffer_id)
}
}
pub fn get(&self, buffer_id: usize) -> Option<&Buffer<T>> {
self.sub_buffers.get(&buffer_id)
}
#[allow(dead_code)]
pub fn get_mut(&mut self, buffer_id: usize) -> Option<&mut Buffer<T>> {
self.sub_buffers.get_mut(&buffer_id)
}
#[allow(dead_code)]
pub fn defrag(&mut self) {
unimplemented!();
}
#[allow(dead_code, unused_variables)]
pub fn resize(&mut self, len: u32) {
unimplemented!();
}
}