Lines Matching refs:SortKey
54 * Renderer), which can be sorted independently. Each (step, draw) pair produces its own SortKey.
69 * Last, the SortKey encodes an index into the set of uniform bindings accumulated for a DrawPass.
70 * This allows the SortKey to cluster draw steps that have both a compatible pipeline and do not
72 * the pipeline description index are packed into indices and not actual pointers, a given SortKey
75 class DrawPass::SortKey {
77 SortKey(const DrawList::Draw* draw,
90 bool operator<(const SortKey& k) const {
160 // NOTE: This assert is here to ensure SortKey is as tightly packed as possible. Any change to
164 // At 24 bytes (current), sorting is about 30% slower than if SortKey could be packed into just
174 static_assert(sizeof(DrawPass::SortKey) == 16 + sizeof(void*));
180 std::vector<SortKey> keys;
247 for (const SortKey& key : keys) {