@cerbos/orm-prisma 4.0.0 → 5.0.0

package/src/evaluate.ts

@@ -0,0 +1,170 @@
+// Evaluating operators whose operands are all constants, with CEL's semantics.
+
+import type { Value } from "@cerbos/core";
+import { UnsupportedQueryPlanError } from "./errors";
+import { isNumber, isObject, isString } from "./narrowing";
+
+export const ARITHMETIC_OPERATORS = new Set(["add", "sub", "mult", "div"]);
+
+export function evaluateConstantComparison(
+  operator: string,
+  left: Value,
+  right: Value
+): boolean {
+  switch (operator) {
+    case "in":
+      if (!Array.isArray(right)) {
+        throw new UnsupportedQueryPlanError("in constant comparison requires a list");
+      }
+
+      return right.some((element) => areValuesEqual(left, element));
+    case "eq":
+      return areValuesEqual(left, right);
+    case "ne":
+      return !areValuesEqual(left, right);
+    case "lt":
+    case "le":
+    case "gt":
+    case "ge": {
+      if (
+        isNumber(left) &&
+        isNumber(right) &&
+        (Number.isNaN(left) || Number.isNaN(right))
+      ) {
+        return false;
+      }
+
+      if (
+        !(
+          (isNumber(left) && isNumber(right)) ||
+          (isString(left) && isString(right))
+        )
+      ) {
+        throw new UnsupportedQueryPlanError(
+          `${operator} constant comparison requires two numbers or two strings`
+        );
+      }
+
+      const order = compareConstantValues(left, right);
+
+      switch (operator) {
+        case "lt":
+          return order < 0;
+        case "le":
+          return order <= 0;
+        case "gt":
+          return order > 0;
+        case "ge":
+          return order >= 0;
+      }
+    }
+  }
+
+  throw new UnsupportedQueryPlanError(`Unsupported constant comparison operator: ${operator}`);
+}
+
+/** Orders numbers numerically and strings by Unicode code point, as CEL does. */
+function compareConstantValues(
+  left: number | string,
+  right: number | string
+): number {
+  if (isNumber(left) && isNumber(right)) {
+    return left === right ? 0 : left < right ? -1 : 1;
+  }
+
+  if (!isString(left) || !isString(right)) {
+    throw new UnsupportedQueryPlanError("Cannot order constant values of different types");
+  }
+
+  const leftCodePoints = Array.from(left, (character) =>
+    character.codePointAt(0)
+  );
+
+  const rightCodePoints = Array.from(right, (character) =>
+    character.codePointAt(0)
+  );
+
+  const sharedLength = Math.min(leftCodePoints.length, rightCodePoints.length);
+
+  for (let index = 0; index < sharedLength; index++) {
+    const leftCodePoint = leftCodePoints[index]!;
+    const rightCodePoint = rightCodePoints[index]!;
+
+    if (leftCodePoint !== rightCodePoint) {
+      return leftCodePoint < rightCodePoint ? -1 : 1;
+    }
+  }
+
+  return leftCodePoints.length === rightCodePoints.length
+    ? 0
+    : leftCodePoints.length < rightCodePoints.length
+      ? -1
+      : 1;
+}
+
+function areValuesEqual(left: Value, right: Value): boolean {
+  if (Array.isArray(left)) {
+    return (
+      Array.isArray(right) &&
+      left.length === right.length &&
+      left.every((value, index) => areValuesEqual(value, right[index]!))
+    );
+  }
+
+  if (Array.isArray(right)) {
+    return false;
+  }
+
+  if (isObject(left)) {
+    if (!isObject(right)) {
+      return false;
+    }
+
+    const leftKeys = Object.keys(left);
+    const rightKeys = Object.keys(right);
+
+    return (
+      leftKeys.length === rightKeys.length &&
+      leftKeys.every(
+        (key) => key in right && areValuesEqual(left[key]!, right[key]!)
+      )
+    );
+  }
+
+  return left === right;
+}
+
+export function foldArithmetic(
+  operator: string,
+  left: Value,
+  right: Value
+): Value {
+  if (operator === "add" && Array.isArray(left) && Array.isArray(right)) {
+    return [...left, ...right];
+  }
+
+  if (
+    operator === "add" &&
+    isString(left) &&
+    isString(right)
+  ) {
+    return left + right;
+  }
+
+  if (!isNumber(left) || !isNumber(right)) {
+    throw new UnsupportedQueryPlanError(`${operator} operator requires string or number operands`);
+  }
+
+  switch (operator) {
+    case "add":
+      return left + right;
+    case "sub":
+      return left - right;
+    case "mult":
+      return left * right;
+    case "div":
+      return left / right;
+    default:
+      throw new UnsupportedQueryPlanError(`Unsupported operator: ${operator}`);
+  }
+}

package/src/fields.ts

@@ -0,0 +1,373 @@
+// Predicates on one resolved column: the leaves every operator handler bottoms out in.
+
+import type { Value } from "@cerbos/core";
+
+import type { PrismaFilter } from "./index";
+import {
+  assertNullOperandTranslatable,
+  getLeafField,
+  isExplicitNullReference,
+} from "./mapping";
+import type { ResolvedFieldReference, TranslationContext } from "./mapping";
+import { CERBOS_TO_PRISMA_OPERATOR, assertDefined } from "./plan";
+import { wrapInRelations } from "./relations";
+import { UnsupportedQueryPlanError } from "./errors";
+import { isBoolean, isNumber, isObject, lookup, typeofValue } from "./narrowing";
+
+/**
+ * Prisma has no model-agnostic always-false `where` shape — empty logical arrays are ignored —
+ * so a predicate that folds to constant false is refused. Real PDP plans fold it to
+ * ALWAYS_DENIED before it reaches the adapter.
+ */
+export function rejectConstantFalse(): never {
+  throw new UnsupportedQueryPlanError(
+    "A constant-false conditional predicate must be folded by the Cerbos planner"
+  );
+}
+
+/** `{ field: { [prismaOp]: value } }`, nested through the field's relations. */
+export function buildFieldFilter(
+  fieldRef: ResolvedFieldReference,
+  prismaOp: string,
+  value: Value
+): PrismaFilter {
+  const fieldName = getLeafField(fieldRef.path);
+
+  return wrapInRelations(fieldRef.relations, {
+    [fieldName]: { [prismaOp]: value },
+  });
+}
+
+const LIKE_METACHARACTERS = /[%_\\]/;
+
+/**
+ * `column.startsWith(prefix)`, or, when `strict`, the prefix followed by at least one character.
+ *
+ * Prisma's `startsWith` is a LIKE with no ESCAPE clause, so a prefix holding `%`, `_` or `\` is
+ * spelled as the range of strings it bounds instead: every string with that prefix is at least the
+ * prefix and below the prefix with its last code point stepped up, and no other string is, under
+ * the code-point order CEL's own string comparisons already require of the collation. A NULL
+ * column is UNKNOWN under either spelling, as the missing attribute's error requires.
+ */
+export function buildPrefixFilter(
+  fieldRef: ResolvedFieldReference,
+  prefix: string,
+  strict = false
+): PrismaFilter {
+  if (!LIKE_METACHARACTERS.test(prefix)) {
+    return buildFieldFilter(fieldRef, "startsWith", strict ? `${prefix}_` : prefix);
+  }
+
+  const fieldName = getLeafField(fieldRef.path);
+  const lower = { [fieldName]: { [strict ? "gt" : "gte"]: prefix } };
+  const bound = firstStringPastPrefix(prefix);
+
+  return wrapInRelations(
+    fieldRef.relations,
+    bound === undefined ? lower : { AND: [lower, { [fieldName]: { lt: bound } }] }
+  );
+}
+
+/**
+ * The least string, in code-point order, above every string that starts with `prefix`: the prefix
+ * with its last code point stepped up, skipping the surrogate range no string holds. A trailing
+ * U+10FFFF has no successor, so it is dropped and the step applied before it; undefined when
+ * nothing is left, where no string is above the prefix.
+ */
+function firstStringPastPrefix(prefix: string): string | undefined {
+  const codePoints = Array.from(prefix, (character) => character.codePointAt(0)!);
+
+  while (codePoints.length > 0) {
+    const last = codePoints.pop()!;
+
+    if (last >= 0x10ffff) continue;
+    const next = last + 1 === 0xd800 ? 0xe000 : last + 1;
+
+    return String.fromCodePoint(...codePoints, next);
+  }
+
+  return undefined;
+}
+
+/** A filter no row satisfies, spelled on a column the model is known to have. */
+export function buildImpossibleFilter(
+  fieldRef: ResolvedFieldReference
+): PrismaFilter {
+  return buildFieldFilter(fieldRef, "in", []);
+}
+
+function buildDirectOrInLeaf(
+  fieldRef: ResolvedFieldReference,
+  values: Value[]
+): PrismaFilter {
+  const fieldName = getLeafField(fieldRef.path);
+
+  return values.length === 1
+    ? { [fieldName]: values[0] }
+    : { [fieldName]: { in: values } };
+}
+
+/**
+ * `field IS NOT NULL AND <leaf>`, so a NULL column makes the whole thing definitely FALSE rather
+ * than merely unmatched — which is what lets an enclosing `NOT` include the row.
+ *
+ * Prisma has no three-valued logic to expose: a record either matches a `where` or it does not.
+ * That is exactly why the guard has to be explicit — `{ NOT: { field: { equals: "x" } } }` leans on
+ * the generated SQL's UNKNOWN, which excludes the record under both polarities, and an
+ * explicit-null attribute needs the negation to include it.
+ *
+ * The guard is ANDed with the leaf BEFORE the relation wrapping, so both halves are evaluated
+ * against the same element rather than against two independently-matched ones.
+ */
+function guardedFieldFilter(
+  fieldRef: ResolvedFieldReference,
+  leaf: PrismaFilter
+): PrismaFilter {
+  const fieldName = getLeafField(fieldRef.path);
+
+  return wrapInRelations(fieldRef.relations, {
+    AND: [{ [fieldName]: { not: null } }, leaf],
+  });
+}
+
+function assertScalarValue(
+  fieldRef: ResolvedFieldReference,
+  value: Value,
+  operator: string
+): void {
+  if (isObject(value)) {
+    throw new UnsupportedQueryPlanError(
+      `${operator} requires scalar values: Prisma cannot compare list or map elements`
+    );
+  }
+
+  if (
+    value !== null &&
+    fieldRef.valueType !== undefined &&
+    fieldRef.valueType !== "dateTime" &&
+    typeofValue(value) !== fieldRef.valueType
+  ) {
+    throw new UnsupportedQueryPlanError(
+      `${operator} value type does not match mapped ${fieldRef.valueType} field`
+    );
+  }
+}
+
+export function assertStringField(
+  fieldRef: ResolvedFieldReference,
+  operator: string
+): void {
+  if (fieldRef.valueType !== undefined && fieldRef.valueType !== "string") {
+    throw new UnsupportedQueryPlanError(
+      `${operator} requires a string field, got ${fieldRef.valueType}`
+    );
+  }
+}
+
+/** `field IN values`, with CEL's semantics for a null element and for an explicit-null column. */
+export function buildMembershipFilter(
+  context: TranslationContext,
+  fieldRef: ResolvedFieldReference,
+  listed: Value[]
+): PrismaFilter {
+  // A column declared NOT NULL never equals a null element, and Prisma rejects `{ field: null }` on one.
+  const values = fieldRef.nullable === false ? listed.filter((value) => value !== null) : listed;
+
+  for (const value of values) assertScalarValue(fieldRef, value, "in");
+  const nonNullValues = values.filter((value) => value !== null);
+  const carriesNull = nonNullValues.length !== values.length;
+
+  if (carriesNull) {
+    assertNullOperandTranslatable(
+      context,
+      "a null element in an `in` list",
+      fieldRef.nullAttributeRepresentation
+    );
+  }
+
+  const filters: PrismaFilter[] = [];
+
+  if (nonNullValues.length > 0 || values.length === 0) {
+    // Without a null element nothing has made the membership definite yet: a NULL column is
+    // dropped by `{ in: [...] }` under BOTH polarities, while CEL compares a null VALUE against
+    // each element and gets a definite false, so its negation is TRUE. With a null element the
+    // `[null]` disjunct below already settles it.
+    const leaf = buildDirectOrInLeaf(fieldRef, nonNullValues);
+    filters.push(
+      carriesNull || !isExplicitNullReference(fieldRef)
+        ? wrapInRelations(fieldRef.relations, leaf)
+        : guardedFieldFilter(fieldRef, leaf)
+    );
+  }
+
+  if (carriesNull) {
+    filters.push(
+      wrapInRelations(fieldRef.relations, buildDirectOrInLeaf(fieldRef, [null]))
+    );
+  }
+
+  return filters.length === 1 ? filters[0]! : { OR: filters };
+}
+
+/**
+ * The two-clause bracket a fractional constant needs, or undefined for an operator that has
+ * none. Prisma coerces filter values to the column's type: on an Int column, `gte: 1.5` is
+ * silently bound as `gte: 1`, inverting rows like aNumber == 1. Each bracket pairs the exact
+ * constant with its integer neighbor so the combination is correct BOTH for Float columns (the
+ * extra clause is redundant) and Int columns (whichever way Prisma truncates or floors the
+ * fraction).
+ */
+function fractionalBracket(
+  fieldName: string,
+  operator: string,
+  value: number
+): PrismaFilter | undefined {
+  const lower = Math.floor(value);
+  const upper = Math.ceil(value);
+
+  const equalsBracket = {
+    AND: [
+      { [fieldName]: { equals: value } },
+      { [fieldName]: { gt: lower } },
+      { [fieldName]: { lt: upper } },
+    ],
+  };
+
+  switch (operator) {
+    case "gt":
+      return {
+        OR: [{ [fieldName]: { gt: value } }, { [fieldName]: { gte: upper } }],
+      };
+    case "ge":
+      return {
+        AND: [{ [fieldName]: { gte: value } }, { [fieldName]: { gt: lower } }],
+      };
+    case "lt":
+      return {
+        OR: [{ [fieldName]: { lt: value } }, { [fieldName]: { lte: lower } }],
+      };
+    case "le":
+      return {
+        AND: [{ [fieldName]: { lte: value } }, { [fieldName]: { lt: upper } }],
+      };
+    case "eq":
+      return equalsBracket;
+    case "ne":
+      return { NOT: equalsBracket };
+    default:
+      return undefined;
+  }
+}
+
+/**
+ * An ordering against a boolean constant. CEL orders bools, `false < true`, but Prisma's Boolean
+ * filter has only `equals` and `not`, so the ordering becomes the set of bools that satisfy it,
+ * spelled with `equals` alone. Every spelling reads the column, so a NULL stays UNKNOWN under both
+ * polarities, as the missing-attribute error requires: an empty set is a contradiction on the
+ * column and the full set a tautology on it. Plain `equals` rather than the explicit-null guard,
+ * because ordering a null VALUE is a no-overload error in CEL, not a definite answer.
+ */
+function buildBooleanOrderingFilter(
+  fieldRef: ResolvedFieldReference,
+  operator: string,
+  value: boolean
+): PrismaFilter {
+  const satisfied = [false, true].filter((candidate) => {
+    const [a, b] = [Number(candidate), Number(value)];
+
+    switch (operator) {
+      case "lt":
+        return a < b;
+      case "le":
+        return a <= b;
+      case "gt":
+        return a > b;
+      case "ge":
+        return a >= b;
+      default:
+        throw new UnsupportedQueryPlanError(`Unsupported operator: ${operator}`);
+    }
+  });
+
+  if (satisfied.length === 1) return buildFieldFilter(fieldRef, "equals", satisfied[0]!);
+  const fieldName = getLeafField(fieldRef.path);
+  const both = [{ [fieldName]: { equals: false } }, { [fieldName]: { equals: true } }];
+
+  return wrapInRelations(
+    fieldRef.relations,
+    satisfied.length === 0 ? { AND: both } : { OR: both }
+  );
+}
+
+/**
+ * Builds a field-vs-constant comparison. Fractional constants are emitted as a two-clause
+ * bracket (see fractionalBracket).
+ */
+export function buildComparisonFilter(
+  context: TranslationContext,
+  fieldRef: ResolvedFieldReference,
+  operator: string,
+  value: Value
+): PrismaFilter {
+  const prismaOperator = assertDefined(
+    lookup(CERBOS_TO_PRISMA_OPERATOR, operator),
+    `Unsupported operator: ${operator}`
+  );
+
+  assertScalarValue(fieldRef, value, operator);
+
+  if (isBoolean(value) && operator !== "eq" && operator !== "ne") {
+    return buildBooleanOrderingFilter(fieldRef, operator, value);
+  }
+
+  if (value === null) {
+    assertNullOperandTranslatable(
+      context,
+      `\`${operator}\` against a null operand`,
+      fieldRef.nullAttributeRepresentation
+    );
+  }
+
+  // An attribute the caller sends as an explicit null holds a null VALUE in CEL, so equality
+  // against a non-null operand is a definite FALSE and inequality a definite TRUE. Prisma leans
+  // on SQL's UNKNOWN for both, which drops the row under either polarity, so the presence of the
+  // column has to become part of the predicate. Confined to the equality family: an ordering
+  // comparison against a null receiver is a no-overload error in CEL, which denies exactly as the
+  // dropped row does.
+  if (
+    value !== null &&
+    isExplicitNullReference(fieldRef) &&
+    (operator === "eq" || operator === "ne")
+  ) {
+    const fieldName = getLeafField(fieldRef.path);
+
+    const equality = guardedFieldFilter(fieldRef, {
+      [fieldName]: { equals: value },
+    });
+
+    return operator === "eq" ? equality : { NOT: equality };
+  }
+
+  if (isNumber(value) && !Number.isInteger(value)) {
+    const bracket = fractionalBracket(
+      getLeafField(fieldRef.path),
+      operator,
+      value
+    );
+
+    if (bracket) {
+      return wrapInRelations(fieldRef.relations, bracket);
+    }
+  }
+
+  return buildFieldFilter(fieldRef, prismaOperator, value);
+}
+
+/** OR of `field IS NULL` checks for every nullable element column the lambda touched. */
+export function buildNullWitnessFilter(
+  nullableFields: Set<string>
+): PrismaFilter {
+  const checks = [...nullableFields].map((field) => ({ [field]: null }));
+
+  return checks.length === 1 ? checks[0]! : { OR: checks };
+}