12693984246

Committed 09 Jan 2025 04:15PM CUT coverage: 100.0%. Remained the same

Build # 12693984246

Build Type

push

github

Committed by

web-flow

Commit Message

Optimize batch-exchange by bulk copying (#473)

Bulk-copy component data between archetypes on batch operations. As an example, for entities with 10 components, the speedup is 5-10 fold.

* optimize batch exchange
* add benchmark for batch exchange on large entities
* extend batch exchange unit tests

Run Details

25 of 25 new or added lines in 2 files covered. (100.0%)

6533 of 6533 relevant lines covered (100.0%)

113247.37 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

100.0

/ecs/bitset.go

package ecs

// Data structure for compact storage of booleans.
type bitSet struct {
        data []uint64
}

// Get a value.
func (b *bitSet) Get(bit eid) bool {
        chunk, bit := bit/wordSize, bit%wordSize
        mask := uint64(1 << bit)
        return b.data[chunk]&mask == mask
}

// Set a value.
func (b *bitSet) Set(bit eid, value bool) {
        chunk, bit := bit/wordSize, bit%wordSize
        if value {
                b.data[chunk] |= uint64(1 << bit)
        } else {
                b.data[chunk] &= uint64(^(1 << bit))
        }
}

// Reset all values.
func (b *bitSet) Reset() {
        for i := range b.data {
                b.data[i] = 0
        }
}

// Extend to hold at least the given bits.
func (b *bitSet) ExtendTo(length int) {
        chunks, bit := length/wordSize, length%wordSize
        if bit > 0 {
                chunks++
        }
        if len(b.data) >= chunks {
                return
        }

        old := b.data
        b.data = make([]uint64, chunks)

        copy(b.data, old)
}

1	package ecs
2
3	// Data structure for compact storage of booleans.
4	type bitSet struct {
5	data []uint64
6	}
7
8	// Get a value.
9	func (b *bitSet) Get(bit eid) bool {	3,508,372✔
10	chunk, bit := bit/wordSize, bit%wordSize	3,508,372✔
11	mask := uint64(1 << bit)	3,508,372✔
12	return b.data[chunk]&mask == mask	3,508,372✔
13	}	3,508,372✔
14
15	// Set a value.
16	func (b *bitSet) Set(bit eid, value bool) {	3,816,204✔
17	chunk, bit := bit/wordSize, bit%wordSize	3,816,204✔
18	if value {	3,846,705✔
19	b.data[chunk] \|= uint64(1 << bit)	30,501✔
20	} else {	3,816,204✔
21	b.data[chunk] &= uint64(^(1 << bit))	3,785,703✔
22	}	3,785,703✔
23	}
24
25	// Reset all values.
26	func (b *bitSet) Reset() {	34✔
27	for i := range b.data {	6,205✔
28	b.data[i] = 0	6,171✔
29	}	6,171✔
30	}
31
32	// Extend to hold at least the given bits.
33	func (b *bitSet) ExtendTo(length int) {	39,336✔
34	chunks, bit := length/wordSize, length%wordSize	39,336✔
35	if bit > 0 {	45,512✔
36	chunks++	6,176✔
37	}	6,176✔
38	if len(b.data) >= chunks {	78,380✔
39	return	39,044✔
40	}	39,044✔
41
42	old := b.data	292✔
43	b.data = make([]uint64, chunks)	292✔
44		292✔
45	copy(b.data, old)	292✔
46	}

mlange-42 / arche / 12693984246

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous