dsh-flash-mem-mon 0.0.0-stage → 0.1.3

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,3 +1,38 @@
-# Temporary Holding Version
-
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+# dsh-flash-mem-mon
+
+Memory monitor provider for [dock-flash](https://github.com/tcgbp/dock-flash) — registers a host-memory-alert provider (RSS absolute thresholds, RSS growth rate, Major GC frequency) via `ctx.get('dockFlashAlerts')` and exposes `/memory-trend` for trend sparklines.
+
+## Installation
+
+```bash
+dsh plugin --profile <profile> add dsh-flash-mem-mon
+```
+
+Requires `dock-flash >=1.6.0` (provides `dockFlashAlerts` and `quickControl` services).
+
+## Configuration
+
+All settings are live-editable (volatile) and take effect immediately:
+
+| Setting | Default | Description |
+|---|---|---|
+| `memThresholdInfo` | 256 MB | RSS info threshold |
+| `memThresholdWarning` | 512 MB | RSS warning threshold |
+| `memThresholdError` | 1024 MB | RSS error threshold |
+| `memThresholdCritical` | 1536 MB | RSS critical threshold |
+| `memPollBase` | 30000 ms | Base polling interval |
+| `memPollMin` | 2000 ms | Minimum polling interval |
+| `gcThresholdInfo` | 2 /min | Major GC info threshold |
+| `gcThresholdWarning` | 5 /min | Major GC warning threshold |
+| `gcThresholdError` | 10 /min | Major GC error threshold |
+
+## Architecture
+
+This is a **companion plugin** following the same two-half pattern as `dsh-flash-net-mon`:
+
+- **Host half** (`src/index.ts` → tsc → `dist/index.js`): Memory trend ring buffer, GC observer, `/memory-trend` HTTP route
+- **Client half** (`lib/client.js`): Alert provider, enable toggle, config modal with sparkline, i18n
+
+## License
+
+Apache-2.0

package/README.zh-CN.md

@@ -0,0 +1,38 @@
+# dsh-flash-mem-mon
+
+dock-flash 的内存监控提供器 — 通过 `ctx.get('dockFlashAlerts')` 注册主机内存告警提供器（RSS 绝对阈值、RSS 增长率、Major GC 频率），并暴露 `/memory-trend` 路由用于趋势图。
+
+## 安装
+
+```bash
+dsh plugin --profile <profile> add dsh-flash-mem-mon
+```
+
+需要 `dock-flash >=1.6.0`（提供 `dockFlashAlerts` 和 `quickControl` 服务）。
+
+## 配置
+
+所有设置均支持热更新（volatile），修改后立即生效：
+
+| 设置 | 默认值 | 说明 |
+|---|---|---|
+| `memThresholdInfo` | 256 MB | RSS 信息阈值 |
+| `memThresholdWarning` | 512 MB | RSS 警告阈值 |
+| `memThresholdError` | 1024 MB | RSS 错误阈值 |
+| `memThresholdCritical` | 1536 MB | RSS 严重阈值 |
+| `memPollBase` | 30000 ms | 基础轮询间隔 |
+| `memPollMin` | 2000 ms | 最小轮询间隔 |
+| `gcThresholdInfo` | 2 /min | Major GC 信息阈值 |
+| `gcThresholdWarning` | 5 /min | Major GC 警告阈值 |
+| `gcThresholdError` | 10 /min | Major GC 错误阈值 |
+
+## 架构
+
+本插件为 **伴随插件**，遵循与 `dsh-flash-net-mon` 相同的双半模式：
+
+- **宿主端** (`src/index.ts` → tsc → `dist/index.js`)：内存趋势环形缓冲区、GC 观察器、`/memory-trend` HTTP 路由
+- **客户端** (`lib/client.js`)：告警提供器、启用开关、带趋势图的配置弹窗、国际化
+
+## 许可证
+
+Apache-2.0

package/cordis.patch.yml

@@ -0,0 +1,11 @@
+# dsh-flash-mem-mon bundle layer — registers the HOST half into a profile.
+#
+# The BROWSER half needs no row here: the module loader auto-discovers the
+# client bundle from package.json `exports["./client"]` + `dsh.client` and
+# serves it at /plugins/<pkg>/client.js.
+#
+# PITFALL: `name` is a PACKAGE NAME (resolved via the profile's node_modules),
+# NOT a relative path.
+- insert:
+    - id: dsh-flash-mem-mon
+      name: dsh-flash-mem-mon

package/dist/index.js

@@ -0,0 +1,372 @@
+// Default export only (`export default Schema`); there is no named `Schema`.
+import Schema from '@deepseek-ai/schemastery';
+export const name = 'dsh-flash-mem-mon';
+// No host-side service dependencies; all services are injected lazily.
+export const inject = [];
+// ── Memory alert thresholds (RSS MB) and GC thresholds (major GC/min) ──
+const DEFAULT_MEM_THRESHOLD_INFO = 256;
+const DEFAULT_MEM_THRESHOLD_WARNING = 512;
+const DEFAULT_MEM_THRESHOLD_ERROR = 1024;
+const DEFAULT_MEM_THRESHOLD_CRITICAL = 1536;
+const DEFAULT_MEM_POLL_BASE = 30000;
+const DEFAULT_MEM_POLL_MIN = 2000;
+const DEFAULT_GC_THRESHOLD_INFO = 2;
+const DEFAULT_GC_THRESHOLD_WARNING = 5;
+const DEFAULT_GC_THRESHOLD_ERROR = 10;
+// V8 GC entry `kind` is a bitmask of GC types:
+//   1 << 0 = Scavenge (minor / young-gen)
+//   1 << 1 = MarkSweepCompact (major / full)
+//   1 << 2 = IncrementalMarking
+//   1 << 3 = ProcessWeakCallbacks
+// In practice modern V8/Node reports a full MarkSweepCompact cycle through the
+// IncrementalMarking (4) and ProcessWeakCallbacks (8) phases — the standalone
+// "major" bit (2) is almost never emitted on its own.  Classifying Full GC by
+// `kind === 2` alone therefore misses (nearly) every real full collection.
+// The robust test: a Full GC is any NON-scavenge cycle, i.e. the Scavenge bit
+// (1) is NOT set.  This captures 2, 4, 6, 8, 10, 12, 14 while excluding minor
+// (1) scavenges.
+function isFullGc(kind) {
+    return (kind & 1) === 0 && kind > 0;
+}
+export const Config = Schema.object({
+    memThresholdInfo: Schema.number().default(DEFAULT_MEM_THRESHOLD_INFO).volatile(),
+    memThresholdWarning: Schema.number().default(DEFAULT_MEM_THRESHOLD_WARNING).volatile(),
+    memThresholdError: Schema.number().default(DEFAULT_MEM_THRESHOLD_ERROR).volatile(),
+    memThresholdCritical: Schema.number().default(DEFAULT_MEM_THRESHOLD_CRITICAL).volatile(),
+    memPollBase: Schema.number().default(DEFAULT_MEM_POLL_BASE).volatile(),
+    memPollMin: Schema.number().default(DEFAULT_MEM_POLL_MIN).volatile(),
+    gcThresholdInfo: Schema.number().default(DEFAULT_GC_THRESHOLD_INFO).volatile(),
+    gcThresholdWarning: Schema.number().default(DEFAULT_GC_THRESHOLD_WARNING).volatile(),
+    gcThresholdError: Schema.number().default(DEFAULT_GC_THRESHOLD_ERROR).volatile(),
+});
+class MemoryTrendCollector {
+    _samples = [];
+    _timer = null;
+    _cap;
+    // GC monitoring via PerformanceObserver
+    _gcObserver = null; // PerformanceObserver | null
+    _gcEvents = [];
+    _gcEventsCap = 2000; // ~5 min at worst-case GC frequency
+    /** Separate cap for major GC events only — they are rare and valuable for diagnostics. */
+    _gcMajorEvents = [];
+    _gcMajorEventsCap = 500; // Full GC events are rare; keep up to 500 (~hours)
+    constructor(cap = 720) {
+        this._cap = Math.max(10, cap);
+    }
+    start(baseInterval = 30_000, minInterval = 5_000) {
+        this.stop();
+        // Fire-and-forget: GC observer can start asynchronously; the poll loop
+        // below begins immediately regardless, since it does not depend on GC.
+        this._startGcObserver().catch(() => { });
+        const poll = () => {
+            const mu = process.memoryUsage();
+            this._push({
+                ts: Date.now(),
+                rss: mu.rss,
+                heapTotal: mu.heapTotal,
+                heapUsed: mu.heapUsed,
+                external: mu.external,
+                arrayBuffers: mu.arrayBuffers,
+            });
+            // Adaptive: higher heap usage → shorter interval (sample more densely).
+            const ratio = mu.heapUsed / mu.heapTotal;
+            const next = Math.max(minInterval, Math.round(baseInterval * Math.pow(1 - Math.min(ratio, 1), 2) + minInterval));
+            this._timer = setTimeout(poll, next);
+            // Unref so the timer never keeps the process alive on its own.
+            if (this._timer && typeof this._timer === 'object' && 'unref' in this._timer) {
+                this._timer.unref();
+            }
+        };
+        // First sample immediately.
+        poll();
+    }
+    stop() {
+        if (this._timer !== null) {
+            clearTimeout(this._timer);
+            this._timer = null;
+        }
+        this._stopGcObserver();
+    }
+    setCap(cap) {
+        this._cap = Math.max(10, Math.floor(cap) || 10);
+        while (this._samples.length > this._cap)
+            this._samples.shift();
+    }
+    query(since) {
+        if (!since)
+            return this._samples.slice();
+        return this._samples.filter(s => s.ts >= since);
+    }
+    /** Return Full (major) GC events for chart rendering.
+     *  Pass since=0 to return ALL stored events (for full-mode fetches).
+     *  Each returned event is one real full-GC cycle (phases already coalesced
+     *  in `_startGcObserver`) and is normalized to kind=2 so the client can
+     *  always treat `gcEvents` as "Full GC events". */
+    gcEvents(since) {
+        if (this._gcMajorEvents.length === 0)
+            return [];
+        const cutoff = since ?? (Date.now() - 5 * 60 * 1000);
+        return this._gcMajorEvents
+            .filter(e => e.ts >= cutoff)
+            .map(e => ({ ts: e.ts, kind: 2, duration: e.duration }))
+            .sort((a, b) => a.ts - b.ts);
+    }
+    summary(since) {
+        const data = this.query(since);
+        if (data.length === 0) {
+            return { current: null, peak: null, trend: 'stable', sampleCount: 0, heapRatio: 0, spanSeconds: 0, rssSlopePerMin: 0, gc: null };
+        }
+        const current = data[data.length - 1];
+        let peak = { heapUsed: 0, rss: 0, ts: 0 };
+        for (const s of data) {
+            if (s.heapUsed > peak.heapUsed)
+                peak = { heapUsed: s.heapUsed, rss: s.rss, ts: s.ts };
+        }
+        // Simple linear regression on heapUsed over the last 20 samples (or fewer).
+        const tail = data.slice(-20);
+        let trend = 'stable';
+        if (tail.length >= 3) {
+            const n = tail.length;
+            let sumX = 0, sumY = 0, sumXY = 0, sumXX = 0;
+            for (let i = 0; i < n; i++) {
+                sumX += i;
+                sumY += tail[i].heapUsed;
+                sumXY += i * tail[i].heapUsed;
+                sumXX += i * i;
+            }
+            const slope = (n * sumXY - sumX * sumY) / (n * sumXX - sumX * sumX);
+            // Threshold: ±0.5% of current heapUsed per sample-index step.
+            const threshold = current.heapUsed * 0.005;
+            if (slope > threshold)
+                trend = 'up';
+            else if (slope < -threshold)
+                trend = 'down';
+        }
+        const heapRatio = current.heapTotal > 0 ? current.heapUsed / current.heapTotal : 0;
+        const spanSeconds = data.length >= 2 ? Math.round((data[data.length - 1].ts - data[0].ts) / 1000) : 0;
+        // RSS linear regression over the last 20 samples → slope per minute (MB/min).
+        let rssSlopePerMin = 0;
+        if (tail.length >= 3) {
+            const n = tail.length;
+            let sumX = 0, sumY = 0, sumXY = 0, sumXX = 0;
+            for (let i = 0; i < n; i++) {
+                sumX += i;
+                sumY += tail[i].rss;
+                sumXY += i * tail[i].rss;
+                sumXX += i * i;
+            }
+            const slope = (n * sumXY - sumX * sumY) / (n * sumXX - sumX * sumX);
+            // slope = bytes per sample-index step.  Convert to MB/min.
+            // Average interval between tail samples ≈ spanSeconds / (n-1).
+            const avgIntervalSec = tail.length >= 2 ? spanSeconds / (tail.length - 1) : 30;
+            const samplesPerMin = avgIntervalSec > 0 ? 60 / avgIntervalSec : 2;
+            rssSlopePerMin = Math.round((slope * samplesPerMin / 1048576) * 100) / 100;
+        }
+        // GC stats over the last ~5 minutes.
+        const gc = this._gcSummary(5 * 60 * 1000);
+        return { current, peak, trend, sampleCount: data.length, heapRatio, spanSeconds, rssSlopePerMin, gc };
+    }
+    /** Aggregate GC events in the last `windowMs` milliseconds. */
+    _gcSummary(windowMs) {
+        if (this._gcEvents.length === 0 && this._gcMajorEvents.length === 0)
+            return null;
+        const cutoff = Date.now() - windowMs;
+        // Major (Full) count comes from the coalesced major-GC buffer so each
+        // real cycle counts once (not once per phase entry).
+        const majorRecent = this._gcMajorEvents.filter(e => e.ts >= cutoff);
+        const majorCount = majorRecent.length;
+        // Minor count + total pause come from the general ring buffer (which holds
+        // every event).  A minor cycle is a Scavenge (kind bit 1 set).
+        let minorCount = 0, gcPauseMs = 0;
+        for (const e of this._gcEvents) {
+            if (e.ts < cutoff)
+                continue;
+            gcPauseMs += e.duration;
+            if ((e.kind & 1) !== 0)
+                minorCount++;
+        }
+        if (majorCount === 0 && minorCount === 0 && gcPauseMs === 0)
+            return null;
+        const windowMin = windowMs / 60000;
+        return {
+            minorCount,
+            majorCount,
+            majorPerMin: Math.round((majorCount / windowMin) * 100) / 100,
+            gcPauseMs: Math.round(gcPauseMs * 100) / 100,
+            gcPausePerMin: Math.round((gcPauseMs / windowMin) * 100) / 100,
+        };
+    }
+    async _startGcObserver() {
+        try {
+            // Dynamic import — perf_hooks may not be available in all environments.
+            // MUST use import(), not require(): this half is ESM, so require() throws
+            // ReferenceError into the catch — silently disabling GC monitoring forever.
+            const { PerformanceObserver } = await import('perf_hooks');
+            this._gcObserver = new PerformanceObserver((list) => {
+                for (const entry of list.getEntries()) {
+                    // GC entry kinds form a bitmask (see isFullGc): 1=Scavenge(minor),
+                    // 2/4/8 = MarkSweepCompact/IncrementalMarking/ProcessWeakCallbacks.
+                    // A single real Full GC is usually reported as several phase entries
+                    // (e.g. kind 4 + kind 8) within a few ms, so we coalesce them into
+                    // one Full GC event below.
+                    const kind = entry.kind ?? 0;
+                    const event = { ts: Date.now(), kind, duration: entry.duration };
+                    this._gcEvents.push(event);
+                    // Also store full (major) GC events in a separate long-lived buffer,
+                    // because they are rare and the general ring buffer may evict them.
+                    if (isFullGc(kind)) {
+                        const last = this._gcMajorEvents[this._gcMajorEvents.length - 1];
+                        if (last && event.ts - last.ts < 500) {
+                            // Same full-GC cycle (phase entries arriving back-to-back):
+                            // merge into the existing event, keeping the worst-case pause.
+                            last.duration = Math.max(last.duration, event.duration);
+                            last.ts = event.ts;
+                        }
+                        else {
+                            this._gcMajorEvents.push(event);
+                            while (this._gcMajorEvents.length > this._gcMajorEventsCap)
+                                this._gcMajorEvents.shift();
+                        }
+                    }
+                }
+                // Cap the ring buffer.
+                while (this._gcEvents.length > this._gcEventsCap)
+                    this._gcEvents.shift();
+            });
+            this._gcObserver.observe({ type: 'gc', buffered: true });
+        }
+        catch (_) {
+            // GC observation not available — gc will remain null in summaries.
+            this._gcObserver = null;
+        }
+    }
+    _stopGcObserver() {
+        if (this._gcObserver) {
+            try {
+                this._gcObserver.disconnect();
+            }
+            catch (_) { }
+            this._gcObserver = null;
+        }
+        this._gcEvents = [];
+        this._gcMajorEvents = [];
+    }
+    _push(s) {
+        this._samples.push(s);
+        if (this._samples.length > this._cap)
+            this._samples.shift();
+    }
+}
+/** Module-level singleton — one collector per process. */
+let _memoryTrend = null;
+// ── Private HTTP helpers ────────────────────────────────────────────────
+/** Send a JSON response with no-store cache control. */
+function sendJson(res, status, payload) {
+    res.statusCode = status;
+    res.setHeader('content-type', 'application/json; charset=utf-8');
+    res.setHeader('cache-control', 'no-store');
+    res.end(JSON.stringify(payload));
+}
+/**
+ * Read an optional JSON request body, bounded so a client cannot feed the
+ * host an unbounded buffer. Returns null for an empty, oversized, or
+ * unparseable body — callers treat that as "no override supplied".
+ */
+async function readJsonBody(req, limit = 4096) {
+    try {
+        const chunks = [];
+        let size = 0;
+        for await (const chunk of req) {
+            size += chunk.length;
+            if (size > limit)
+                return null;
+            chunks.push(chunk);
+        }
+        if (chunks.length === 0)
+            return null;
+        return JSON.parse(Buffer.concat(chunks).toString('utf8'));
+    }
+    catch (_) {
+        return null;
+    }
+}
+// ── apply() ─────────────────────────────────────────────────────────────
+export function apply(ctx, config) {
+    // ── Settings namespace registration ──────────────────────────────────
+    ctx.inject(['settings'], (settingsCtx) => {
+        settingsCtx.effect(() => settingsCtx.settings.configure({ auto: false }, ctx.fiber));
+    });
+    // ── Memory trend collector bootstrap ──────────────────────────────────
+    // One bounded ring buffer per process. Starts on first apply and stops on
+    // dispose. The timer uses .unref() so it never keeps the process alive.
+    if (!_memoryTrend)
+        _memoryTrend = new MemoryTrendCollector();
+    _memoryTrend.start((config.memPollBase?.get?.() ?? config.memPollBase) || DEFAULT_MEM_POLL_BASE, (config.memPollMin?.get?.() ?? config.memPollMin) || DEFAULT_MEM_POLL_MIN);
+    ctx.effect(() => {
+        const collector = _memoryTrend;
+        return () => {
+            collector?.stop();
+            _memoryTrend = null;
+        };
+    });
+    // ── Volatile-update handler for poll intervals ────────────────────────
+    // Restart the collector when memPollBase or memPollMin change.
+    ctx.on('loader/volatile-update', (paths) => {
+        const memPaths = ['memPollBase', 'memPollMin'];
+        if (!paths.some((pp) => pp.length && memPaths.includes(pp[pp.length - 1])))
+            return;
+        if (_memoryTrend) {
+            _memoryTrend.stop();
+            _memoryTrend.start((config.memPollBase?.get?.() ?? config.memPollBase) || DEFAULT_MEM_POLL_BASE, (config.memPollMin?.get?.() ?? config.memPollMin) || DEFAULT_MEM_POLL_MIN);
+        }
+    });
+    // ── HTTP API route for client-side trend data ────────────────────────
+    // The webServer type augmentation lives in @deepseek-ai/dsh-host-webserver
+    // which is not a direct dependency; cast through `any` for the register calls.
+    ctx.inject(['webServer'], (wsCtx) => {
+        // GET /plugins/dsh-flash-mem-mon/memory-trend
+        // Returns memory trend data for the client's config popup.
+        // `mode=summary` returns a lightweight snapshot (current, peak, trend direction);
+        // `mode=full` returns the raw samples for rendering a chart.
+        // Optional `since` (unix ms) limits the range.
+        wsCtx.effect(() => wsCtx.webServer.register({
+            kind: 'exact',
+            path: '/plugins/dsh-flash-mem-mon/memory-trend',
+            handler: async (req, res) => {
+                if (req.method !== 'GET') {
+                    res.statusCode = 405;
+                    res.setHeader('allow', 'GET');
+                    res.end();
+                    return;
+                }
+                if (!_memoryTrend) {
+                    sendJson(res, 200, { samples: [], summary: null });
+                    return;
+                }
+                const u = new URL(req.url || '/', 'http://localhost');
+                const since = parseInt(u.searchParams.get('since') || '0', 10) || 0;
+                const mode = u.searchParams.get('mode') || 'summary';
+                if (mode === 'full') {
+                    // For gcEvents: when no explicit `since` is requested (since=0),
+                    // pass 0 so ALL stored events are returned — not just the last 5 min.
+                    // gcEvents(0) → cutoff=0 → returns everything.
+                    // gcEvents(undefined) → cutoff=now-5min → only recent events.
+                    // The sparkline may span hours, so we need the full range.
+                    const gcSince = since > 0 ? since : 0;
+                    // Only return full (major) GC events to the client — minor GC is too
+                    // frequent and clutters the chart.  These are already coalesced into
+                    // one event per real cycle by `_startGcObserver`.  Minor GC stats are
+                    // still available via mode=summary (majorPerMin, gcPausePerMin).
+                    const majorGcEvents = _memoryTrend.gcEvents(gcSince);
+                    sendJson(res, 200, {
+                        samples: _memoryTrend.query(since || undefined),
+                        gcEvents: majorGcEvents,
+                    });
+                }
+                else {
+                    sendJson(res, 200, _memoryTrend.summary(since || undefined));
+                }
+            },
+        }), 'dsh-flash-mem-mon: GET /plugins/dsh-flash-mem-mon/memory-trend');
+    });
+}