Files
huntedbytheirs 7f3cad8cb6 perf(wave2): dynamic config arrays, flat dwindle tree, dual client arrays
Wave 2 changes:
- Dynamic Config arrays with geometric growth (cap=16, 2x growth)
  → saves ~2.5 MB heap for typical configs vs fixed 128-entry arrays
- Proper deep-copy protocol in on_config_reload/do_reload (free old, move new, zero source)
- Flat DwindleTree array with int children[2]/parent indices
  → eliminates pointer chasing, contiguous allocation, iterative two-pass recalc
- Lazy per-tag allocation (DwindleTree.nodes starts NULL, allocates on first use)
- Dual client_arr + fstack_arr arrays alongside wl_list/fstack for cache-friendly iteration
  → arrange() and focustop() use array scan instead of linked-list pointer chase
- All arrays maintain size-tracking (nclients, nfstack) for bounds checking
- Zero-warning build with clang -Werror -Wpedantic
2026-07-02 23:50:43 -04:00

48 lines
1.1 KiB
C

#pragma once
#include <stdint.h>
#include <stddef.h>
/* Default tag count — define before including to override */
#ifndef TAGCOUNT
#define TAGCOUNT 9
#endif
/* Forward declarations for types used below */
struct Client;
struct Monitor;
/* Argument union used by keybind functions */
typedef union {
int i;
uint32_t ui;
float f;
const void *v;
} Arg;
/* Compute array length */
#define LENGTH(X) (sizeof(X) / sizeof((X)[0]))
/* Bitmask covering all tags */
#define TAGMASK ((1u << TAGCOUNT) - 1)
/* Convenience min/max */
#define MAX(A, B) ((A) > (B) ? (A) : (B))
#define MIN(A, B) ((A) < (B) ? (A) : (B))
extern struct Client **client_arr;
extern int nclients;
extern struct Client **fstack_arr;
extern int nfstack;
/* Convenience wrapper for the function below */
#define VISIBLEON(C, M) visibleon((C), (M))
/* Determine whether client @c is visible on monitor @m */
static inline int visibleon(struct Client *c, struct Monitor *m) {
return m && c->mon == m
? (c->isscratchpad ? m->scratchpad_visible
: (int)(c->tags & m->tagset[m->seltags]))
: 0;
}