-
Notifications
You must be signed in to change notification settings - Fork 85
/
Copy pathcommand_buffer.rs
370 lines (328 loc) · 11.4 KB
/
command_buffer.rs
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
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
// Copyright 2019 Google LLC
//
// Licensed under the Apache License, Version 2.0, <LICENSE-APACHE or
// http://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
// http://opensource.org/licenses/MIT>, at your option. This file may not be
// copied, modified, or distributed except according to those terms.
use core::any::TypeId;
use core::mem;
use core::ops::Range;
use core::ptr::{self, NonNull};
use crate::alloc::alloc::{alloc, dealloc, Layout};
use crate::alloc::vec::Vec;
use crate::archetype::TypeInfo;
use crate::{align, DynamicBundle};
use crate::{Bundle, Entity};
use crate::{Component, World};
/// Records operations for future application to a [`World`]
///
/// Useful when operations cannot be applied directly due to ordering concerns or borrow checking.
///
/// ```
/// # use hecs::*;
/// let mut world = World::new();
/// let entity = world.reserve_entity();
/// let mut cmd = CommandBuffer::new();
/// cmd.insert(entity, (true, 42));
/// cmd.run_on(&mut world); // cmd can now be reused
/// assert_eq!(*world.get::<&i32>(entity).unwrap(), 42);
/// ```
pub struct CommandBuffer {
cmds: Vec<Cmd>,
storage: NonNull<u8>,
layout: Layout,
cursor: usize,
components: Vec<ComponentInfo>,
ids: Vec<TypeId>,
}
impl CommandBuffer {
/// Create an empty command buffer
pub fn new() -> Self {
Self::default()
}
unsafe fn grow(
min_size: usize,
cursor: usize,
align: usize,
storage: NonNull<u8>,
) -> (NonNull<u8>, Layout) {
let layout = Layout::from_size_align(min_size.next_power_of_two().max(64), align).unwrap();
let new_storage = NonNull::new_unchecked(alloc(layout));
ptr::copy_nonoverlapping(storage.as_ptr(), new_storage.as_ptr(), cursor);
(new_storage, layout)
}
unsafe fn add_inner(&mut self, ptr: *mut u8, ty: TypeInfo) {
let offset = align(self.cursor, ty.layout().align());
let end = offset + ty.layout().size();
if end > self.layout.size() || ty.layout().align() > self.layout.align() {
let new_align = self.layout.align().max(ty.layout().align());
let (new_storage, new_layout) = Self::grow(end, self.cursor, new_align, self.storage);
if self.layout.size() != 0 {
dealloc(self.storage.as_ptr(), self.layout);
}
self.storage = new_storage;
self.layout = new_layout;
}
let addr = self.storage.as_ptr().add(offset);
ptr::copy_nonoverlapping(ptr, addr, ty.layout().size());
self.components.push(ComponentInfo { ty, offset });
self.cursor = end;
}
/// Add components from `bundle` to `entity`, if it exists
///
/// Pairs well with [`World::reserve_entity`] to spawn entities with a known handle.
///
/// When inserting a single component, see [`insert_one`](Self::insert_one) for convenience.
pub fn insert(&mut self, entity: Entity, components: impl DynamicBundle) {
let first_component = self.components.len();
unsafe {
components.put(|ptr, ty| self.add_inner(ptr, ty));
}
self.components[first_component..].sort_unstable_by_key(|c| c.ty);
self.cmds.push(Cmd::SpawnOrInsert(EntityIndex {
entity: Some(entity),
components: first_component..self.components.len(),
}));
}
/// Add `component` to `entity`, if the entity exists
///
/// See [`insert`](Self::insert).
pub fn insert_one(&mut self, entity: Entity, component: impl Component) {
self.insert(entity, (component,));
}
/// Remove components from `entity` if they exist
///
/// When removing a single component, see [`remove_one`](Self::remove_one) for convenience.
pub fn remove<T: Bundle + 'static>(&mut self, ent: Entity) {
fn remove_bundle_and_ignore_result<T: Bundle + 'static>(world: &mut World, ents: Entity) {
let _ = world.remove::<T>(ents);
}
self.cmds.push(Cmd::Remove(RemovedComps {
remove: remove_bundle_and_ignore_result::<T>,
entity: ent,
}));
}
/// Remove a component from `entity` if it exists
///
/// See [`remove`](Self::remove).
pub fn remove_one<T: Component>(&mut self, ent: Entity) {
self.remove::<(T,)>(ent);
}
/// Despawn `entity` from World
pub fn despawn(&mut self, entity: Entity) {
self.cmds.push(Cmd::Despawn(entity));
}
/// Spawn a new entity with `components`
///
/// If the [`Entity`] is needed immediately, consider combining [`World::reserve_entity`] with
/// [`insert`](CommandBuffer::insert) instead.
pub fn spawn(&mut self, components: impl DynamicBundle) {
let first_component = self.components.len();
unsafe {
components.put(|ptr, ty| self.add_inner(ptr, ty));
}
self.components[first_component..].sort_unstable_by_key(|c| c.ty);
self.cmds.push(Cmd::SpawnOrInsert(EntityIndex {
entity: None,
components: first_component..self.components.len(),
}));
}
/// Run recorded commands on `world`, clearing the command buffer
pub fn run_on(&mut self, world: &mut World) {
for i in 0..self.cmds.len() {
match mem::replace(&mut self.cmds[i], Cmd::Despawn(Entity::DANGLING)) {
Cmd::SpawnOrInsert(entity) => {
let components = self.build(entity.components);
match entity.entity {
Some(entity) => {
// If `entity` no longer exists, quietly drop the components.
let _ = world.insert(entity, components);
}
None => {
world.spawn(components);
}
}
}
Cmd::Remove(remove) => {
(remove.remove)(world, remove.entity);
}
Cmd::Despawn(entity) => {
let _ = world.despawn(entity);
}
}
}
// Wipe out component references so `clear` doesn't try to double-free
self.components.clear();
self.clear();
}
fn build(&mut self, components: Range<usize>) -> RecordedEntity<'_> {
self.ids.clear();
self.ids.extend(
self.components[components.clone()]
.iter()
.map(|x| x.ty.id()),
);
RecordedEntity {
cmd: self,
components,
}
}
/// Drop all recorded commands
pub fn clear(&mut self) {
self.ids.clear();
self.cursor = 0;
for info in self.components.drain(..) {
unsafe {
info.ty.drop(self.storage.as_ptr().add(info.offset));
}
}
self.cmds.clear();
}
}
unsafe impl Send for CommandBuffer {}
unsafe impl Sync for CommandBuffer {}
impl Drop for CommandBuffer {
fn drop(&mut self) {
self.clear();
if self.layout.size() != 0 {
unsafe {
dealloc(self.storage.as_ptr(), self.layout);
}
}
}
}
impl Default for CommandBuffer {
/// Create an empty buffer
fn default() -> Self {
Self {
cmds: Vec::new(),
storage: NonNull::dangling(),
layout: Layout::from_size_align(0, 8).unwrap(),
cursor: 0,
components: Vec::new(),
ids: Vec::new(),
}
}
}
/// The output of an '[CommandBuffer]` suitable for passing to
/// [`World::spawn_into`](crate::World::spawn_into)
struct RecordedEntity<'a> {
cmd: &'a mut CommandBuffer,
components: Range<usize>,
}
unsafe impl DynamicBundle for RecordedEntity<'_> {
fn with_ids<T>(&self, f: impl FnOnce(&[TypeId]) -> T) -> T {
f(&self.cmd.ids)
}
fn type_info(&self) -> Vec<TypeInfo> {
self.cmd.components[self.components.clone()]
.iter()
.map(|x| x.ty)
.collect()
}
unsafe fn put(mut self, mut f: impl FnMut(*mut u8, TypeInfo)) {
// Zero out the components slice so `drop` won't double-free
let components = mem::replace(&mut self.components, 0..0);
for info in &self.cmd.components[components] {
let ptr = self.cmd.storage.as_ptr().add(info.offset);
f(ptr, info.ty);
}
}
}
impl Drop for RecordedEntity<'_> {
fn drop(&mut self) {
// If `put` was never called, we still need to drop this entity's components and discard
// their info.
unsafe {
for info in &self.cmd.components[self.components.clone()] {
info.ty.drop(self.cmd.storage.as_ptr().add(info.offset));
}
}
}
}
/// Data required to store components and their offset
struct ComponentInfo {
ty: TypeInfo,
// Position in 'storage'
offset: usize,
}
/// Data of buffered 'entity' and its relative position in component data
struct EntityIndex {
entity: Option<Entity>,
// Position of this entity's components in `CommandBuffer::info`
//
// We could store a single start point for the first initialized entity, rather than one for
// each, but this would be more error prone for marginal space savings.
components: Range<usize>,
}
/// Data required to remove components from 'entity'
struct RemovedComps {
remove: fn(&mut World, Entity),
entity: Entity,
}
/// A buffered command
enum Cmd {
SpawnOrInsert(EntityIndex),
Remove(RemovedComps),
Despawn(Entity),
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn populate_archetypes() {
let mut world = World::new();
let mut buffer = CommandBuffer::new();
let ent = world.reserve_entity();
let enta = world.reserve_entity();
let entb = world.reserve_entity();
let entc = world.reserve_entity();
buffer.insert(ent, (true, "a"));
buffer.insert(entc, (true, "a"));
buffer.insert(enta, (1, 1.0));
buffer.insert(entb, (1.0, "a"));
buffer.run_on(&mut world);
assert_eq!(world.archetypes().len(), 4);
}
#[test]
fn failed_insert_regression() {
// Verify that failing to insert components doesn't lead to concatenating components
// together
#[derive(Clone)]
struct A;
let mut world = World::new();
// Get two IDs
let a = world.spawn((A,));
let b = world.spawn((A,));
// Invalidate them both
world.clear();
let mut cmd = CommandBuffer::new();
cmd.insert_one(a, A);
cmd.insert_one(b, A);
// Make `a` valid again
world.spawn_at(a, ());
// The insert to `a` should succeed
cmd.run_on(&mut world);
assert!(world.satisfies::<&A>(a).unwrap());
}
#[test]
fn insert_then_remove() {
let mut world = World::new();
let a = world.spawn(());
let mut cmd = CommandBuffer::new();
cmd.insert_one(a, 42i32);
cmd.remove_one::<i32>(a);
cmd.run_on(&mut world);
assert!(!world.satisfies::<&i32>(a).unwrap());
}
#[test]
fn remove_then_insert() {
let mut world = World::new();
let a = world.spawn((17i32,));
let mut cmd = CommandBuffer::new();
cmd.remove_one::<i32>(a);
cmd.insert_one(a, 42i32);
cmd.run_on(&mut world);
assert_eq!(*world.get::<&i32>(a).unwrap(), 42);
}
}