ResourceTree::copy inserted into entries_ (a std::map) while range-iterating
that same map. When dst fell inside src (e.g. /dav/a -> /dav/a/b), each
newly inserted entry was discovered by the ongoing iteration and copied
again, so the loop never converged and memory grew without bound
(MOLO-DAV-001, CWE-674/CWE-400). RFC 4918 9.8.3/9.9.3 require servers to
reject this shape before mutating anything, so copy() now checks dst == src
or dst nested under src and fails immediately with no side effects.
move() inherits the fix since it calls copy() first.
As defense in depth, copy() also no longer mutates entries_ while
iterating it: it collects the (target, resource) pairs into a local
vector first, then applies them in a second pass, so the same class of
bug cannot recur even if the containment check is ever bypassed.
Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
- Collector: timestamped ring (deque, 60s prune under lock); RateIn/Out KB/s
- Query text/JSON gain kb_s_in/kb_s_out columns
- test: assert rates non-zero after traffic, disabled fast-path takes no lock
- full realtime suite green (13 binaries, 0 fail)
Ten sequential spec files plus index covering runtime,
observability, security, data, routing, realtime, supervisor,
clients, CLI ops, and workflow, each with best practices,
structure, rules, guidelines, specs, and cross-references.
Scope covers HTTP/1.1+HTTP/2, WebSockets, Socket.IO, ORM with
prod self-healing, realtime clients, observability, supervisor,
AI harness CLI, and living example project.