Function _Lcmp

vm/ByteCodeTranslator/src/javascript/parparvm_runtime.js:3773–3781

(a, b)

  return _LL((c16 << 16) | c00, (c48 << 16) | c32);
}
function _Lcmp(a, b) {
  a = _Lc(a); b = _Lc(b);
  // Allocation-free: the high word is signed, so it orders the full value; on a
  // tie compare the low words as unsigned. Comparisons dominate loops/timing, so
  // avoiding the _Lsub object churn here is the main hi/lo perf win.
  if (a.h !== b.h) return a.h < b.h ? -1 : 1;
  const al = a.l >>> 0, bl = b.l >>> 0;
  return al === bl ? 0 : (al < bl ? -1 : 1);
}
function _Ldiv(a, b) {
  a = _Lc(a); b = _Lc(b);
  if (_LisZero(b)) { throw new Error("/ by zero"); }