feat: DTail fork — server/client feature development

Squashed development of the snonux/dtail fork's product code (internal/, cmd/)
since diverging from mimecast/dtail. Major areas:

- Read/output path: the former "turbo" channel-less path is now the single,
  default server-side read/output path for cat/grep/tail and MapReduce; the old
  channel-based path and its config/env toggles were removed.
- MapReduce: single aggregate implementation (server + serverless) fed directly
  by a processor pipeline, with input-exhausted finalization via the shutdown
  coordinator; high-concurrency and data-race fixes.
- Journal source reads (journal:unit.service) via journalctl, Linux-gated behind
  a journal-v1 capability.
- Auth-key fast reconnect: in-memory per-user public-key cache with TTL/max-keys,
  registered over an authenticated session (AUTHKEY), checked before
  authorized_keys.
- Interactive query reload (--interactive-query) with SESSION START/UPDATE
  generation boundaries and capability negotiation.
- Client-side deadlines: --timeout / --shutdownAfter as context deadlines;
  follow shutdown handling.
- Client logging: diagnostics-only daily log by default, opt-in payload tee via
  --log-payload.
- Numerous correctness fixes (buffer-pool double-recycle races, EOF-sentinel
  leaks, glob-expansion cap, TOCTOU in CSV parsing) with accompanying unit tests.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>

1 files changed, 81 insertions, 0 deletions

diff --git a/internal/mapr/parserfieldplan.go b/internal/mapr/parserfieldplan.go
new file mode 100644
index 0000000..fd831a5
--- /dev/null
+++ b/internal/mapr/parserfieldplan.go
@@ -0,0 +1,81 @@
+package mapr
+
+// ParserFieldPlan describes which raw fields a parser needs to materialize.
+type ParserFieldPlan struct {
+	AllFields bool
+	Fields    map[string]struct{}
+}
+
+// Needs reports whether the parser plan requires a field.
+func (p ParserFieldPlan) Needs(field string) bool {
+	if p.AllFields {
+		return true
+	}
+	_, ok := p.Fields[field]
+	return ok
+}
+
+// Capacity returns a reasonable initial capacity for a parsed field map.
+func (p ParserFieldPlan) Capacity() int {
+	if p.AllFields {
+		return 20
+	}
+	if len(p.Fields) == 0 {
+		return 4
+	}
+	return len(p.Fields) + 2
+}
+
+// ParserFieldPlan returns the raw fields required to evaluate the query.
+func (q *Query) ParserFieldPlan() ParserFieldPlan {
+	if q == nil {
+		return ParserFieldPlan{AllFields: true}
+	}
+
+	fields := make(map[string]struct{}, len(q.Select)+len(q.GroupBy)+len(q.Where)*2+len(q.Set))
+	producedBySet := make(map[string]struct{}, len(q.Set))
+
+	add := func(field string) {
+		if field == "" {
+			return
+		}
+		fields[field] = struct{}{}
+	}
+	isProduced := func(field string) bool {
+		_, ok := producedBySet[field]
+		return ok
+	}
+
+	for _, wc := range q.Where {
+		if wc.lType == Field {
+			add(wc.lString)
+		}
+		if wc.rType == Field {
+			add(wc.rString)
+		}
+	}
+
+	for _, sc := range q.Set {
+		switch sc.rType {
+		case Field, FunctionStack:
+			if !isProduced(sc.rString) {
+				add(sc.rString)
+			}
+		}
+		producedBySet[sc.lString] = struct{}{}
+	}
+
+	for _, groupBy := range q.GroupBy {
+		if !isProduced(groupBy) {
+			add(groupBy)
+		}
+	}
+
+	for _, sc := range q.Select {
+		if !isProduced(sc.Field) {
+			add(sc.Field)
+		}
+	}
+
+	return ParserFieldPlan{Fields: fields}
+}