@oneuptime/common 12.0.25 → 12.0.27

package/build/dist/Server/Services/NetworkDeviceService.js

@@ -14,16 +14,22 @@ import NetworkDeviceOwnerRuleEngineService from "./NetworkDeviceOwnerRuleEngineS
 import NetworkSiteAssignmentRuleService from "./NetworkSiteAssignmentRuleService";
 import NetworkSiteService from "./NetworkSiteService";
 import Model from "../../Models/DatabaseModels/NetworkDevice";
+import Monitor from "../../Models/DatabaseModels/Monitor";
 import CaptureSpan from "../Utils/Telemetry/CaptureSpan";
 import logger from "../Utils/Logger";
 import LIMIT_MAX, { LIMIT_PER_PROJECT } from "../../Types/Database/LimitMax";
 import SortOrder from "../../Types/BaseDatabase/SortOrder";
 import BadDataException from "../../Types/Exception/BadDataException";
+import NotAuthorizedException from "../../Types/Exception/NotAuthorizedException";
 import ObjectID from "../../Types/ObjectID";
 import OneUptimeDate from "../../Types/Date";
 import CidrMatchUtil from "../../Utils/NetworkSite/CidrMatchUtil";
 import { NetworkDeviceMonitoringMethodUtil } from "../../Types/NetworkDevice/NetworkDeviceMonitoringMethod";
 import RelationIdUtil from "../Utils/Database/RelationIdUtil";
+import ModelPermission from "../Types/Database/Permissions/Index";
+import QueryHelper from "../Types/Database/QueryHelper";
+import AggregateResultUtil from "../Types/Database/AggregateResultUtil";
+import { DEVICE_HEALTH_AGGREGATES, DEVICE_HEALTH_GROUP_COLUMNS, DEVICE_HEALTH_GROUP_ORDER, DEVICE_HEALTH_GROUP_COLUMNS_BY_SITE, DEVICE_HEALTH_NOW_PARAMETER, parseDeviceHealthGroup, } from "../Utils/NetworkDevice/DeviceHealthAggregation";
 /*
  * Columns a NetworkSiteAssignmentRule's hostname pattern is matched against.
  * A write to any of them can change which rule wins for the device, so
@@ -80,6 +86,11 @@ function readMonitorIdFromData(data) {
 export const MAX_DEVICES_PER_RULE_RUN = LIMIT_PER_PROJECT;
 // Devices are read in pages so a large estate never lands in memory at once.
 const RULE_RUN_PAGE_SIZE = 1000;
+/*
+ * How many addresses one "are these already registered" lookup asks about.
+ * Bounded because the list is rendered into the statement as a literal IN.
+ */
+const HOSTNAME_LOOKUP_CHUNK_SIZE = 500;
 /*
  * The identity a rule is matched against. The hostname column holds an IP
  * address or a DNS name depending on how the device got here, so it is passed
@@ -95,9 +106,481 @@ function toRuleMatchTarget(device) {
         name: device.name,
     };
 }
+/*
+ * How long "this project has no site-assignment rules at all" is trusted
+ * without asking Postgres again.
+ *
+ * Every successful walk writes `sysName`, an identity column, so
+ * onUpdateSuccess re-evaluates the rules for every device that has no site.
+ * That rule is correct and stays (see shouldReapplySiteAssignmentRules), but
+ * on a project mid-rollout — devices imported, rules not written yet — it is
+ * EVERY device, and each one re-read the same empty rule set to conclude
+ * nothing: a findOneById plus an uncached findBy per device per poll, i.e.
+ * ~160,000 queries per five-minute cycle on an 80,000-device fleet.
+ *
+ * Ten seconds is measured against the thing a user would actually notice.
+ * The earliest a newly saved rule can reach an already-imported device is
+ * that device's next poll — five minutes by default — or the rule's "Run
+ * now" button, which never consults this cache. Ten seconds is a rounding
+ * error against that window, so this can never be the reason a rule looks
+ * like it did not take.
+ */
+export const EMPTY_SITE_ASSIGNMENT_RULE_CACHE_TTL_IN_MS = 10 * 1000;
+/*
+ * Bounded so an instance serving many projects cannot grow this forever.
+ * Only ever holds projects that had NO rules, so in practice it is small.
+ */
+const EMPTY_SITE_ASSIGNMENT_RULE_CACHE_MAX_PROJECTS = 10000;
+/*
+ * Remembers ONLY the negative answer: "this project had zero site-assignment
+ * rules when we last looked."
+ *
+ * Deliberately not a cache of the rules themselves. A stale rule set causes a
+ * WRONG WRITE — a device assigned to a site by a rule that was edited or
+ * deleted seconds ago, and nothing ever moves it back — whereas a stale "no
+ * rules" only defers work that the polling interval already defers by
+ * minutes. The two failure modes are not comparable, so only the safe half is
+ * cached.
+ *
+ * Every read of the rule set feeds `record`, so the instant any code path in
+ * this process observes that the project does have rules, the skip is
+ * dropped. Across replicas nothing is invalidated by another replica's write
+ * — which is precisely why the TTL, not the invalidation, is the guarantee.
+ */
+export class EmptySiteAssignmentRuleCache {
+    constructor(options) {
+        var _a, _b, _c;
+        this.knownEmptyUntil = new Map();
+        this.ttlInMs =
+            (_a = options === null || options === void 0 ? void 0 : options.ttlInMs) !== null && _a !== void 0 ? _a : EMPTY_SITE_ASSIGNMENT_RULE_CACHE_TTL_IN_MS;
+        this.maxProjects =
+            (_b = options === null || options === void 0 ? void 0 : options.maxProjects) !== null && _b !== void 0 ? _b : EMPTY_SITE_ASSIGNMENT_RULE_CACHE_MAX_PROJECTS;
+        /*
+         * Wrapped rather than stored as `Date.now` itself, so moving the clock
+         * (a test, or a future injected clock) is actually observed here.
+         */
+        this.now =
+            (_c = options === null || options === void 0 ? void 0 : options.now) !== null && _c !== void 0 ? _c : (() => {
+                return Date.now();
+            });
+    }
+    isKnownEmpty(projectId) {
+        const key = projectId.toString();
+        const expiresAt = this.knownEmptyUntil.get(key);
+        if (expiresAt === undefined) {
+            return false;
+        }
+        if (expiresAt <= this.now()) {
+            // Dropped on read, so an idle project's entry does not linger.
+            this.knownEmptyUntil.delete(key);
+            return false;
+        }
+        return true;
+    }
+    record(data) {
+        const key = data.projectId.toString();
+        if (!data.isEmpty) {
+            this.knownEmptyUntil.delete(key);
+            return;
+        }
+        if (this.knownEmptyUntil.size >= this.maxProjects &&
+            !this.knownEmptyUntil.has(key)) {
+            // Evict the oldest — a Map iterates in insertion order.
+            const oldestKey = this.knownEmptyUntil
+                .keys()
+                .next().value;
+            if (oldestKey !== undefined) {
+                this.knownEmptyUntil.delete(oldestKey);
+            }
+        }
+        this.knownEmptyUntil.set(key, this.now() + this.ttlInMs);
+    }
+    clear() {
+        this.knownEmptyUntil.clear();
+    }
+}
 export class Service extends DatabaseService {
     constructor() {
         super(Model);
+        /*
+         * The projects known to have no site-assignment rules. Exposed so tests can
+         * reset it between cases, and so a future invalidation hook on
+         * NetworkSiteAssignmentRuleService has something to call — note that such a
+         * hook only clears the replica that ran the write, which is why the TTL
+         * above is what actually bounds staleness.
+         */
+        this.emptySiteAssignmentRuleCache = new EmptySiteAssignmentRuleCache();
+    }
+    /**
+     * The four numbers in the summary strip above the device list, in one
+     * round trip and one SQL statement.
+     *
+     * The three status counts partition the fleet exactly — `isReachable` is
+     * true, false, or NULL — which is what lets the strip agree with the rows
+     * underneath it: the Status chip filters on the same column, so clicking a
+     * tile opens exactly the devices it counted.
+     *
+     * `interfacesDown` is a real SUM over the whole fleet. It used to be
+     * computed by fetching every device with a down interface and adding them
+     * up in the browser, which was not only slow but WRONG past ten thousand
+     * such devices — the fetch was capped, so the tile understated the fleet
+     * without saying so.
+     */
+    async getFleetSummary(data) {
+        const rows = await this.aggregateBy({
+            query: {
+                projectId: data.projectId,
+                isArchived: false,
+            },
+            select: [
+                {
+                    expression: `COUNT(*) FILTER (WHERE "NetworkDevice"."isReachable" = true)`,
+                    alias: "devicesUp",
+                },
+                {
+                    expression: `COUNT(*) FILTER (WHERE "NetworkDevice"."isReachable" = false)`,
+                    alias: "devicesDown",
+                },
+                {
+                    expression: `COUNT(*) FILTER (WHERE "NetworkDevice"."isReachable" IS NULL)`,
+                    alias: "devicesPending",
+                },
+                {
+                    expression: `COALESCE(SUM("NetworkDevice"."interfacesDown"), 0)`,
+                    alias: "interfacesDown",
+                },
+                {
+                    expression: `COUNT(*)`,
+                    alias: "totalDevices",
+                },
+                {
+                    expression: `COUNT(*) FILTER (WHERE "NetworkDevice"."siteId" IS NULL)`,
+                    alias: "devicesWithoutSite",
+                },
+            ],
+            props: data.props,
+        });
+        const row = rows[0];
+        return {
+            devicesUp: AggregateResultUtil.toNumber(row, "devicesUp"),
+            devicesDown: AggregateResultUtil.toNumber(row, "devicesDown"),
+            devicesPending: AggregateResultUtil.toNumber(row, "devicesPending"),
+            interfacesDown: AggregateResultUtil.toNumber(row, "interfacesDown"),
+            totalDevices: AggregateResultUtil.toNumber(row, "totalDevices"),
+            devicesWithoutSite: AggregateResultUtil.toNumber(row, "devicesWithoutSite"),
+        };
+    }
+    /**
+     * How many devices of each vendor, biggest first.
+     *
+     * `GROUP BY vendor` in the database rather than a Map built over every
+     * device row in the browser. Unenriched devices — no SNMP walk yet, so no
+     * vendor — group under the empty string here and are named by the caller,
+     * because "Unknown" is a label rather than a fact about the row.
+     */
+    async getVendorBreakdown(data) {
+        const rows = await this.aggregateBy({
+            query: {
+                projectId: data.projectId,
+                isArchived: false,
+            },
+            groupBy: [
+                {
+                    expression: `COALESCE(NULLIF(TRIM("NetworkDevice"."vendor"), ''), '')`,
+                    alias: "vendor",
+                },
+            ],
+            select: [
+                {
+                    expression: `COUNT(*)`,
+                    alias: "deviceCount",
+                },
+            ],
+            orderBy: [
+                // Ties break by name so the list is stable across refreshes.
+                { expression: `"deviceCount"`, sortOrder: SortOrder.Descending },
+                { expression: `"vendor"`, sortOrder: SortOrder.Ascending },
+            ],
+            limit: data.limit,
+            props: data.props,
+        });
+        return rows.map((row) => {
+            return {
+                vendor: AggregateResultUtil.toStringOrNull(row, "vendor") || "",
+                count: AggregateResultUtil.toNumber(row, "deviceCount"),
+            };
+        });
+    }
+    /**
+     * Which of these addresses already have a device in this project.
+     *
+     * Answers "is 10.4.2.17 already registered" for the few hundred hosts a
+     * discovery sweep actually found, rather than by loading every hostname in
+     * the project into a Set and asking the Set.
+     *
+     * That walk was not just expensive — it was WRONG in the exact scenario it
+     * served. It paged `ORDER BY createdAt`, and a bulk discovery import stamps
+     * every device it creates with the same `createdAt`: on a fleet of 80,000
+     * devices, all 80,000 shared one value, so `LIMIT 10000 OFFSET n` over a
+     * single-valued sort key returned an arbitrary, non-deterministic slice per
+     * call. Pages overlapped and skipped, and a skipped hostname reads as "not
+     * registered" — which creates a duplicate device, the very thing the paging
+     * was added to prevent.
+     *
+     * `hostname` is indexed, so each chunk here is an index lookup.
+     */
+    async getRegisteredHostnames(data) {
+        return new Set((await this.getDevicesByHostnames({
+            projectId: data.projectId,
+            hostnames: data.hostnames,
+            select: { hostname: true },
+            props: data.props,
+        })).keys());
+    }
+    /**
+     * The devices at these addresses, keyed by hostname.
+     *
+     * The row-returning form of `getRegisteredHostnames`, for callers that need
+     * more than "does it exist" — the auto-import engine reads back the device's
+     * id and monitoring method to decide whether it also needs a monitor
+     * provisioned. Same chunked, indexed lookup; same reason for existing.
+     */
+    async getDevicesByHostnames(data) {
+        const registered = new Map();
+        const wanted = Array.from(new Set(data.hostnames.filter((hostname) => {
+            return Boolean(hostname);
+        })));
+        /*
+         * Chunked, because the whole list becomes a literal `IN (...)` in the
+         * statement text. A scan may cover tens of thousands of addresses
+         * (ScanTargetUtil.MAX_SCAN_HOSTS), and a single IN list that long costs
+         * more to parse and plan than the lookups it saves.
+         */
+        for (let offset = 0; offset < wanted.length; offset += HOSTNAME_LOOKUP_CHUNK_SIZE) {
+            const chunk = wanted.slice(offset, offset + HOSTNAME_LOOKUP_CHUNK_SIZE);
+            const found = await this.findBy({
+                query: {
+                    projectId: data.projectId,
+                    hostname: QueryHelper.any(chunk),
+                },
+                select: Object.assign(Object.assign({}, data.select), { hostname: true }),
+                sort: {},
+                limit: LIMIT_MAX,
+                skip: 0,
+                props: data.props,
+            });
+            for (const device of found) {
+                if (device.hostname) {
+                    registered.set(device.hostname, device);
+                }
+            }
+        }
+        return registered;
+    }
+    /**
+     * How many live devices are attached to each site in the project — one row
+     * per site that has any, counted in the database.
+     *
+     * The Sites page's hierarchy tree used to work this out by fetching every
+     * device in the project and tallying `siteId` in the browser. Capped at
+     * LIMIT_PER_PROJECT, that is not slow so much as WRONG: on a fleet of
+     * 80,000 devices across 1,188 sites it returned an arbitrary 10,000 of them
+     * — no ORDER BY, so which 10,000 was up to Postgres — and every store in the
+     * tree read "8 devices" when it had 65.
+     *
+     * Sites with no devices are simply absent, which is what the caller's
+     * `count || 0` already assumed.
+     */
+    async getDeviceCountsBySite(data) {
+        const rows = await this.aggregateBy({
+            query: {
+                projectId: data.projectId,
+                isArchived: false,
+                siteId: QueryHelper.notNull(),
+            },
+            groupBy: [
+                {
+                    expression: `"NetworkDevice"."siteId"`,
+                    alias: "siteId",
+                },
+            ],
+            select: [
+                {
+                    expression: `COUNT(*)`,
+                    alias: "deviceCount",
+                },
+            ],
+            props: data.props,
+        });
+        const counts = [];
+        for (const row of rows) {
+            const siteId = AggregateResultUtil.toStringOrNull(row, "siteId");
+            if (!siteId) {
+                continue;
+            }
+            counts.push({
+                siteId: siteId,
+                deviceCount: AggregateResultUtil.toNumber(row, "deviceCount"),
+            });
+        }
+        return counts;
+    }
+    /**
+     * Device health, bucketed by the discriminating columns and broken down by
+     * site — the input a per-site rollup needs, without reading the devices.
+     *
+     * The buckets are NOT verdicts: they are the raw facts
+     * `DeviceHealthStateUtil` classifies, so the caller runs the one real
+     * classifier over a few hundred buckets instead of eighty thousand rows.
+     * See DeviceHealthAggregation for why the rule is not reimplemented in SQL.
+     */
+    async getHealthGroups(data) {
+        const query = {
+            projectId: data.projectId,
+            isArchived: false,
+        };
+        if (data.onlyAttachedToSite) {
+            query.siteId = QueryHelper.notNull();
+        }
+        const rows = await this.aggregateBy({
+            query: query,
+            groupBy: data.groupBySite
+                ? DEVICE_HEALTH_GROUP_COLUMNS_BY_SITE
+                : DEVICE_HEALTH_GROUP_COLUMNS,
+            select: DEVICE_HEALTH_AGGREGATES,
+            orderBy: DEVICE_HEALTH_GROUP_ORDER,
+            parameters: {
+                [DEVICE_HEALTH_NOW_PARAMETER]: data.now,
+            },
+            props: data.props,
+        });
+        return rows.map(parseDeviceHealthGroup);
+    }
+    /**
+     * Health buckets for the devices attached to a specific set of sites — the
+     * subtree read the persisted rollup engine runs on.
+     *
+     * Not broken down by site: the caller wants one verdict for the whole
+     * subtree, so bucketing across all of it produces the fewest rows that can
+     * still answer the question.
+     */
+    async getHealthGroupsForSites(data) {
+        if (data.siteIds.length === 0) {
+            return [];
+        }
+        const rows = await this.aggregateBy({
+            query: {
+                projectId: data.projectId,
+                siteId: QueryHelper.any(data.siteIds),
+                isArchived: false,
+            },
+            groupBy: data.groupBySite
+                ? DEVICE_HEALTH_GROUP_COLUMNS_BY_SITE
+                : DEVICE_HEALTH_GROUP_COLUMNS,
+            select: DEVICE_HEALTH_AGGREGATES,
+            orderBy: DEVICE_HEALTH_GROUP_ORDER,
+            parameters: {
+                [DEVICE_HEALTH_NOW_PARAMETER]: data.now,
+            },
+            props: data.props,
+        });
+        return rows.map(parseDeviceHealthGroup);
+    }
+    /*
+     * The provenance FK uses RESTRICT as a final race backstop: PostgreSQL must
+     * never silently remove an active monitor with its device. An ordinary
+     * service deletion therefore authorizes and resolves the exact device rows
+     * first, then deletes their automatic monitors through MonitorService so
+     * Monitor delete permissions, workspace cleanup, workflows, audit,
+     * realtime, and billing hooks all run before the devices are removed.
+     */
+    async onBeforeDelete(deleteBy) {
+        const authorizedQuery = await ModelPermission.checkDeleteQueryPermission(Model, deleteBy.query, deleteBy.props);
+        const devices = await this.findBy({
+            query: authorizedQuery,
+            select: {
+                _id: true,
+                projectId: true,
+            },
+            limit: deleteBy.limit,
+            skip: deleteBy.skip,
+            props: { isRoot: true },
+        });
+        const countAutomaticMonitors = async (query) => {
+            return (await MonitorService.countBy({
+                query,
+                props: { isRoot: true },
+            })).toNumber();
+        };
+        const cleanupPlans = [];
+        /*
+         * Preflight every device in the bulk request before deleting the first
+         * monitor. Otherwise a later inaccessible device could abort the request
+         * after earlier devices had already lost their automatic monitors.
+         */
+        for (const device of devices) {
+            if (!device.id || !device.projectId) {
+                continue;
+            }
+            const automaticMonitorQuery = {
+                projectId: device.projectId,
+                autoProvisionedNetworkDeviceId: device.id,
+            };
+            const monitorDeleteProps = Object.assign(Object.assign({}, deleteBy.props), { tenantId: device.projectId });
+            const monitorCount = await countAutomaticMonitors(automaticMonitorQuery);
+            if (monitorCount === 0) {
+                continue;
+            }
+            /*
+             * Prove access BEFORE deleting anything. Without this preflight an
+             * access-control query could delete only the monitors visible to the
+             * caller before the RESTRICT constraint rejects the device deletion,
+             * leaving a partially cleaned-up request. The authorized query is a
+             * subset of automaticMonitorQuery, so equal counts prove that it covers
+             * the full set at this instant.
+             */
+            const authorizedMonitorQuery = await ModelPermission.checkDeleteQueryPermission(Monitor, automaticMonitorQuery, monitorDeleteProps);
+            const authorizedMonitorCount = await countAutomaticMonitors(authorizedMonitorQuery);
+            if (authorizedMonitorCount !== monitorCount) {
+                throw new NotAuthorizedException("You do not have permission to delete every auto-provisioned monitor linked to this Network Device.");
+            }
+            cleanupPlans.push({
+                automaticMonitorQuery,
+                monitorDeleteProps,
+                monitorCount,
+            });
+        }
+        for (const cleanupPlan of cleanupPlans) {
+            /*
+             * LIMIT_MAX is a per-service-call cap, not a lifecycle cap. Always
+             * delete from offset zero because each successful batch shrinks the
+             * result set. Recount as root after every batch: a permission change or
+             * concurrent inaccessible insert must fail closed, with the FK's
+             * RESTRICT policy remaining the last guard before device deletion.
+             */
+            let remainingMonitorCount = cleanupPlan.monitorCount;
+            while (remainingMonitorCount > 0) {
+                await MonitorService.deleteBy({
+                    query: cleanupPlan.automaticMonitorQuery,
+                    limit: LIMIT_MAX,
+                    skip: 0,
+                    props: cleanupPlan.monitorDeleteProps,
+                });
+                const previousMonitorCount = remainingMonitorCount;
+                remainingMonitorCount = await countAutomaticMonitors(cleanupPlan.automaticMonitorQuery);
+                if (remainingMonitorCount >= previousMonitorCount) {
+                    throw new NotAuthorizedException("Could not delete every auto-provisioned monitor linked to this Network Device.");
+                }
+            }
+        }
+        return {
+            deleteBy: Object.assign(Object.assign({}, deleteBy), { query: {
+                    _id: QueryHelper.any(devices.flatMap((device) => {
+                        return device.id ? [device.id] : [];
+                    })),
+                }, skip: 0 }),
+            carryForward: null,
+        };
     }
     /*
      * The FK behind siteId only requires the NetworkSite row to exist, not that
@@ -522,7 +1005,24 @@ export class Service extends DatabaseService {
                         !this.shouldReapplySiteAssignmentRules(previousDevice, onUpdate.updateBy.data)) {
                         continue;
                     }
-                    await this.applySiteAssignmentRulesToDevice(deviceId);
+                    /*
+                     * The previous snapshot already carries the device's project, so
+                     * hand it over: it lets a project with no rules at all skip both
+                     * the device read and the rule read, which is the whole cost of
+                     * this branch for a fleet that has not been given rules yet.
+                     *
+                     * ...but ONLY for a device with no site, and that distinction is
+                     * the whole safety of the skip. Those devices are re-evaluated on
+                     * every poll, so a skip there defers work by one cycle and the next
+                     * poll picks it up. A device that already HAS a site is re-evaluated
+                     * only when its identity actually changed — a one-shot event, not a
+                     * retry. Skipping that is not a deferral, it is a LOSS: the rename
+                     * never happens again, the device keeps its old site indefinitely,
+                     * and nothing says so. Ten seconds of staleness is a fine price for
+                     * a deferral and an unacceptable one for a loss, so the identity
+                     * path always reads the rules.
+                     */
+                    await this.applySiteAssignmentRulesToDevice(deviceId, (previousDevice === null || previousDevice === void 0 ? void 0 : previousDevice.siteId) ? undefined : previousDevice === null || previousDevice === void 0 ? void 0 : previousDevice.projectId);
                 }
             }
         }
@@ -565,7 +1065,23 @@ export class Service extends DatabaseService {
      * goes through updateOneById so onUpdateSuccess refreshes the rollups of
      * both the old and the new site.
      */
-    async applySiteAssignmentRulesToDevice(deviceId) {
+    async applySiteAssignmentRulesToDevice(deviceId, 
+    /*
+     * The device's project, when the caller already knows it AND the call is
+     * one that will happen again if it is skipped. Purely an optimisation,
+     * and only ever a SKIP: it lets the known-empty check run before the
+     * device read, so a project with no rules costs nothing per poll.
+     *
+     * Leaving it out gets the unconditional, always-fresh path, and two
+     * callers deliberately do: device creation (a rule saved moments ago must
+     * apply to the device being imported right now) and the identity-change
+     * branch of onUpdateSuccess (a one-shot event — see the note there).
+     */
+    projectId) {
+        if (projectId &&
+            this.emptySiteAssignmentRuleCache.isKnownEmpty(projectId)) {
+            return;
+        }
         const device = await this.findOneById({
             id: deviceId,
             select: {
@@ -601,6 +1117,16 @@ export class Service extends DatabaseService {
                 isRoot: true,
             },
         });
+        /*
+         * Feed the answer back either way: an empty set starts (or renews) the
+         * skip, and a non-empty one cancels it immediately — so a project that
+         * gains its first rule stops being skipped on this replica as soon as
+         * anything here looks at the rules, without waiting for the TTL.
+         */
+        this.emptySiteAssignmentRuleCache.record({
+            projectId: device.projectId,
+            isEmpty: rules.length === 0,
+        });
         if (rules.length === 0) {
             return;
         }
@@ -674,6 +1200,16 @@ export class Service extends DatabaseService {
                 isRoot: true,
             },
         });
+        /*
+         * Read fresh above and never from the negative cache: this is the button
+         * an operator presses right after saving a rule, so it must see the rule
+         * it was pressed for. Recording the answer here also means pressing it
+         * lifts any "no rules" skip the poll path had cached for the project.
+         */
+        this.emptySiteAssignmentRuleCache.record({
+            projectId: data.projectId,
+            isEmpty: rules.length === 0,
+        });
         const rule = rules.find((candidate) => {
             var _a;
             return ((_a = candidate._id) === null || _a === void 0 ? void 0 : _a.toString()) === data.ruleId.toString();
@@ -838,13 +1374,18 @@ export class Service extends DatabaseService {
           -- A monitor-backed device has no credentials to walk with. NULL is
           -- every device created before the column existed: those are SNMP.
           AND (nd."monitoringMethod" IS NULL OR nd."monitoringMethod" <> 'Monitor')
-          AND (nd."nextPollAt" IS NULL OR nd."nextPollAt" <= $2)
+          AND nd."nextPollAt" <= $2
           AND p."deletedAt" IS NULL
           AND (p."paymentProviderSubscriptionStatus" IS NULL
                OR p."paymentProviderSubscriptionStatus" IN ('active', 'trialing'))
           AND (p."paymentProviderMeteredSubscriptionStatus" IS NULL
                OR p."paymentProviderMeteredSubscriptionStatus" IN ('active', 'trialing'))
-        ORDER BY nd."nextPollAt" ASC NULLS FIRST
+        -- Plain ASC, which is the order the (probeId, nextPollAt) btree is
+        -- already in, so this is a range scan that stops at LIMIT rather than
+        -- a scan-and-sort of the probe's whole slice of the fleet. See the
+        -- column's NOT NULL note on the model for why there are no NULLs to
+        -- order around any more.
+        ORDER BY nd."nextPollAt" ASC
         LIMIT $3
         FOR UPDATE OF nd SKIP LOCKED
       `;
@@ -901,6 +1442,54 @@ export class Service extends DatabaseService {
         return claimedIds;
     }
 }
+__decorate([
+    CaptureSpan(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object]),
+    __metadata("design:returntype", Promise)
+], Service.prototype, "getFleetSummary", null);
+__decorate([
+    CaptureSpan(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object]),
+    __metadata("design:returntype", Promise)
+], Service.prototype, "getVendorBreakdown", null);
+__decorate([
+    CaptureSpan(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object]),
+    __metadata("design:returntype", Promise)
+], Service.prototype, "getRegisteredHostnames", null);
+__decorate([
+    CaptureSpan(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object]),
+    __metadata("design:returntype", Promise)
+], Service.prototype, "getDevicesByHostnames", null);
+__decorate([
+    CaptureSpan(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object]),
+    __metadata("design:returntype", Promise)
+], Service.prototype, "getDeviceCountsBySite", null);
+__decorate([
+    CaptureSpan(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object]),
+    __metadata("design:returntype", Promise)
+], Service.prototype, "getHealthGroups", null);
+__decorate([
+    CaptureSpan(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object]),
+    __metadata("design:returntype", Promise)
+], Service.prototype, "getHealthGroupsForSites", null);
+__decorate([
+    CaptureSpan(),
+    __metadata("design:type", Function),
+    __metadata("design:paramtypes", [Object]),
+    __metadata("design:returntype", Promise)
+], Service.prototype, "onBeforeDelete", null);
 __decorate([
     CaptureSpan(),
     __metadata("design:type", Function),
@@ -940,7 +1529,7 @@ __decorate([
 __decorate([
     CaptureSpan(),
     __metadata("design:type", Function),
-    __metadata("design:paramtypes", [ObjectID]),
+    __metadata("design:paramtypes", [ObjectID, Object]),
     __metadata("design:returntype", Promise)
 ], Service.prototype, "applySiteAssignmentRulesToDevice", null);
 __decorate([