@amalgm/live 0.2.55 → 0.2.56
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/transfer/download.d.ts +8 -6
- package/dist/transfer/download.d.ts.map +1 -1
- package/dist/transfer/download.js +8 -6
- package/dist/transfer/download.js.map +1 -1
- package/dist/transfer/index.d.ts +2 -1
- package/dist/transfer/index.d.ts.map +1 -1
- package/dist/transfer/index.js +2 -1
- package/dist/transfer/index.js.map +1 -1
- package/dist/transfer/ranges.d.ts +43 -0
- package/dist/transfer/ranges.d.ts.map +1 -0
- package/dist/transfer/ranges.js +109 -0
- package/dist/transfer/ranges.js.map +1 -0
- package/dist/transfer/refs.d.ts +35 -0
- package/dist/transfer/refs.d.ts.map +1 -0
- package/dist/transfer/refs.js +45 -0
- package/dist/transfer/refs.js.map +1 -0
- package/dist-cjs/transfer/download.js +8 -6
- package/dist-cjs/transfer/download.js.map +1 -1
- package/dist-cjs/transfer/index.js +2 -1
- package/dist-cjs/transfer/index.js.map +1 -1
- package/dist-cjs/transfer/ranges.js +114 -0
- package/dist-cjs/transfer/ranges.js.map +1 -0
- package/dist-cjs/transfer/refs.js +49 -0
- package/dist-cjs/transfer/refs.js.map +1 -0
- package/package.json +2 -2
- package/dist/transfer/presign.d.ts +0 -26
- package/dist/transfer/presign.d.ts.map +0 -1
- package/dist/transfer/presign.js +0 -44
- package/dist/transfer/presign.js.map +0 -1
- package/dist-cjs/transfer/presign.js +0 -48
- package/dist-cjs/transfer/presign.js.map +0 -1
|
@@ -1,18 +1,20 @@
|
|
|
1
1
|
/**
|
|
2
2
|
* Download a set of immutable artifacts into a machine cache.
|
|
3
3
|
*
|
|
4
|
-
* The set is the primitive: one plan
|
|
5
|
-
* cache which chunks are gaps, one
|
|
6
|
-
* whole set under a single bound, and one seal
|
|
4
|
+
* The set is the primitive: one plan phase proves every manifest and asks the
|
|
5
|
+
* cache which chunks are gaps, one fetch phase obtains every gap across the
|
|
6
|
+
* whole set under a single bound, and one seal phase verifies each complete
|
|
7
7
|
* artifact. A lone artifact is a set of one — there is no second path. This
|
|
8
8
|
* shape removes per-artifact serialization: no artifact waits behind
|
|
9
9
|
* another's plan or seal, only behind the shared fetch bound. Each chunk is
|
|
10
10
|
* still its own storage request — the set changes scheduling, not the
|
|
11
11
|
* request count.
|
|
12
12
|
*
|
|
13
|
-
* Every chunk
|
|
14
|
-
*
|
|
15
|
-
* host's
|
|
13
|
+
* Every chunk keeps one content-addressed identity, whether its sealed
|
|
14
|
+
* envelope lives alone or as a byte range inside an immutable pack. The
|
|
15
|
+
* host's ports resolve and fetch those identities; parallelism, storage
|
|
16
|
+
* layout, transport, and decryption are the host's concern, while the
|
|
17
|
+
* verification laws here remain singular.
|
|
16
18
|
*/
|
|
17
19
|
import { type ContentManifest } from '../contracts/content.js';
|
|
18
20
|
import type { Sha256Hex } from '../entities/types.js';
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"download.d.ts","sourceRoot":"","sources":["../../src/transfer/download.ts"],"names":[],"mappings":"AAAA
|
|
1
|
+
{"version":3,"file":"download.d.ts","sourceRoot":"","sources":["../../src/transfer/download.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAqC,KAAK,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAClG,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAA0B,KAAK,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAO/E,MAAM,WAAW,aAAa,CAAC,aAAa;IAC1C,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAC9B,WAAW,CAAC,QAAQ,EAAE,gBAAgB,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC1D,6EAA6E;IAC7E,QAAQ,CACN,QAAQ,EAAE,gBAAgB,EAC1B,QAAQ,EAAE,eAAe,EACzB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,OAAO,CAAC,CAAC;IACpB,QAAQ,CACN,QAAQ,EAAE,gBAAgB,EAC1B,QAAQ,EAAE,eAAe,EACzB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,UAAU,CAAC,CAAC;IACvB,QAAQ,CACN,QAAQ,EAAE,gBAAgB,EAC1B,QAAQ,EAAE,eAAe,EACzB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,UAAU,GAChB,OAAO,CAAC,IAAI,CAAC,CAAC;IACjB,8EAA8E;IAC9E,YAAY,CACV,QAAQ,EAAE,gBAAgB,EAC1B,QAAQ,EAAE,eAAe,GACxB,OAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC;CAC3C;AAED,MAAM,WAAW,cAAc,CAAC,aAAa;IAC3C,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;IAC9B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B;sEACkE;IAClE,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;CACpC;AAED,MAAM,WAAW,eAAe,CAAC,aAAa;IAC5C,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,CAAC;IACpC,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC;IACnC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;IAC9B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAQD;;uCAEuC;AACvC,wBAAsB,WAAW,CAAC,aAAa,EAC7C,SAAS,EAAE,SAAS,gBAAgB,EAAE,EACtC,KAAK,EAAE,aAAa,CAAC,aAAa,CAAC,EACnC,OAAO,GAAE,eAAoB,GAC5B,OAAO,CAAC,SAAS,eAAe,CAAC,aAAa,CAAC,EAAE,CAAC,CA+DpD;AAED,sDAAsD;AACtD,wBAAsB,QAAQ,CAAC,aAAa,EAC1C,QAAQ,EAAE,gBAAgB,EAC1B,KAAK,EAAE,aAAa,CAAC,aAAa,CAAC,EACnC,OAAO,GAAE,eAAoB,GAC5B,OAAO,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAIzC"}
|
|
@@ -1,18 +1,20 @@
|
|
|
1
1
|
/**
|
|
2
2
|
* Download a set of immutable artifacts into a machine cache.
|
|
3
3
|
*
|
|
4
|
-
* The set is the primitive: one plan
|
|
5
|
-
* cache which chunks are gaps, one
|
|
6
|
-
* whole set under a single bound, and one seal
|
|
4
|
+
* The set is the primitive: one plan phase proves every manifest and asks the
|
|
5
|
+
* cache which chunks are gaps, one fetch phase obtains every gap across the
|
|
6
|
+
* whole set under a single bound, and one seal phase verifies each complete
|
|
7
7
|
* artifact. A lone artifact is a set of one — there is no second path. This
|
|
8
8
|
* shape removes per-artifact serialization: no artifact waits behind
|
|
9
9
|
* another's plan or seal, only behind the shared fetch bound. Each chunk is
|
|
10
10
|
* still its own storage request — the set changes scheduling, not the
|
|
11
11
|
* request count.
|
|
12
12
|
*
|
|
13
|
-
* Every chunk
|
|
14
|
-
*
|
|
15
|
-
* host's
|
|
13
|
+
* Every chunk keeps one content-addressed identity, whether its sealed
|
|
14
|
+
* envelope lives alone or as a byte range inside an immutable pack. The
|
|
15
|
+
* host's ports resolve and fetch those identities; parallelism, storage
|
|
16
|
+
* layout, transport, and decryption are the host's concern, while the
|
|
17
|
+
* verification laws here remain singular.
|
|
16
18
|
*/
|
|
17
19
|
import { CHUNK_BYTES, checkContentManifest } from '../contracts/content.js';
|
|
18
20
|
import { assertTransferArtifact } from './artifacts.js';
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"download.js","sourceRoot":"","sources":["../../src/transfer/download.ts"],"names":[],"mappings":"AAAA
|
|
1
|
+
{"version":3,"file":"download.js","sourceRoot":"","sources":["../../src/transfer/download.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAwB,MAAM,yBAAyB,CAAC;AAElG,OAAO,EAAE,sBAAsB,EAAyB,MAAM,gBAAgB,CAAC;AAC/E,OAAO,EACL,4BAA4B,EAC5B,eAAe,EACf,uBAAuB,GACxB,MAAM,eAAe,CAAC;AAwDvB;;uCAEuC;AACvC,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,SAAsC,EACtC,KAAmC,EACnC,UAA2B,EAAE;IAE7B,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,4BAA4B,CAAC;IACxE,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB;WAC5C,4BAA4B,GAAG,WAAW,CAAC;IAChD,KAAK,MAAM,QAAQ,IAAI,SAAS;QAAE,sBAAsB,CAAC,QAAQ,CAAC,CAAC;IAEnE,MAAM,KAAK,GAAiC,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACxE,MAAM,eAAe,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;QACvE,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QACnC,MAAM,OAAO,GAAG,oBAAoB,CAClC,MAAM,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,EACjC,QAAQ,CAAC,WAAW,CACrB,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC;QAC/B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,MAAM,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5E,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAClC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,uBAAuB,CAC3B,IAAI,EACJ,WAAW,EACX,gBAAgB,EAChB,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,EAC5D,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7C,IAAI,QAAQ,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QAC9F,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC;eAC7B,KAAK,CAAC,UAAU,KAAK,QAAQ,CAAC,KAAK;eACnC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,4BAA4B,KAAK,sBAAsB,CAAC,CAAC;QAC3E,CAAC;QACD,MAAM,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnE,CAAC,CACF,CAAC;IAEF,MAAM,QAAQ,GAAmD,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC7F,MAAM,eAAe,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;QACnE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtE,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,MAAM,CAAC,WAAW,KAAK,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YAC7F,MAAM,IAAI,KAAK,CAAC,uBAAuB,IAAI,CAAC,QAAQ,CAAC,WAAW,sBAAsB,CAAC,CAAC;QAC1F,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,GAAG;YACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,gBAAgB,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;YACrC,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;SAChE,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QAC9B,IAAI,OAAO,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACpF,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,sDAAsD;AACtD,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,QAA0B,EAC1B,KAAmC,EACnC,UAA2B,EAAE;IAE7B,MAAM,CAAC,OAAO,CAAC,GAAG,MAAM,WAAW,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAChE,IAAI,OAAO,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IACpF,OAAO,OAAO,CAAC;AACjB,CAAC"}
|
package/dist/transfer/index.d.ts
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/transfer/index.ts"],"names":[],"mappings":"AAAA,wDAAwD;AAExD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,eAAe,CAAC;AAC9B,cAAc,cAAc,CAAC"}
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/transfer/index.ts"],"names":[],"mappings":"AAAA,wDAAwD;AAExD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC"}
|
package/dist/transfer/index.js
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/transfer/index.ts"],"names":[],"mappings":"AAAA,wDAAwD;AAExD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,eAAe,CAAC;AAC9B,cAAc,cAAc,CAAC"}
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/transfer/index.ts"],"names":[],"mappings":"AAAA,wDAAwD;AAExD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC"}
|
|
@@ -0,0 +1,43 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Ranged pack reading.
|
|
3
|
+
*
|
|
4
|
+
* Sealed envelopes of many small objects live inside one immutable pack.
|
|
5
|
+
* Requests for ranges of the same pack URL made in the same event-loop turn
|
|
6
|
+
* merge into minimal byte spans — one ranged GET per span — and every
|
|
7
|
+
* requester receives exactly its envelope slice. A small hole between wanted
|
|
8
|
+
* ranges is cheaper to read through than to split a request over, so spans
|
|
9
|
+
* merge across gaps up to RANGE_MERGE_GAP_BYTES. Wrong or shifted bytes can
|
|
10
|
+
* never leak: every dispensed slice is still an authenticated envelope the
|
|
11
|
+
* caller opens and hash-verifies.
|
|
12
|
+
*/
|
|
13
|
+
import type { ContentRef } from './refs.js';
|
|
14
|
+
/** Read through holes up to this size rather than splitting a range request. */
|
|
15
|
+
export declare const RANGE_MERGE_GAP_BYTES: number;
|
|
16
|
+
export interface ByteSpan {
|
|
17
|
+
readonly offset: number;
|
|
18
|
+
readonly length: number;
|
|
19
|
+
}
|
|
20
|
+
export interface SpanPlan {
|
|
21
|
+
/** Minimal disjoint fetch spans, ascending by offset. */
|
|
22
|
+
readonly spans: ByteSpan[];
|
|
23
|
+
/** Aligned with the input: which span serves each request, and where the
|
|
24
|
+
* request's bytes start inside that span. */
|
|
25
|
+
readonly slices: Array<{
|
|
26
|
+
readonly span: number;
|
|
27
|
+
readonly start: number;
|
|
28
|
+
}>;
|
|
29
|
+
}
|
|
30
|
+
/** Merge wanted ranges into minimal fetch spans. Pure planning — no IO. */
|
|
31
|
+
export declare function planSpans(requests: readonly ByteSpan[], mergeGap: number): SpanPlan;
|
|
32
|
+
export interface SpanFetcherPorts {
|
|
33
|
+
/** Return exactly the requested bytes: the whole object when span is null,
|
|
34
|
+
* otherwise precisely span.length bytes starting at span.offset. */
|
|
35
|
+
fetchSpan(url: string, span: ByteSpan | null): Promise<Uint8Array>;
|
|
36
|
+
}
|
|
37
|
+
export interface SpanFetcher {
|
|
38
|
+
/** The sealed envelope bytes a ref names — a whole standalone object, or
|
|
39
|
+
* one exact slice of a pack. */
|
|
40
|
+
fetch(ref: ContentRef): Promise<Uint8Array>;
|
|
41
|
+
}
|
|
42
|
+
export declare function createSpanFetcher(ports: SpanFetcherPorts): SpanFetcher;
|
|
43
|
+
//# sourceMappingURL=ranges.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"ranges.d.ts","sourceRoot":"","sources":["../../src/transfer/ranges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,gFAAgF;AAChF,eAAO,MAAM,qBAAqB,QAAY,CAAC;AAE/C,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,QAAQ;IACvB,yDAAyD;IACzD,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC;IAC3B;iDAC6C;IAC7C,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC3E;AAQD,2EAA2E;AAC3E,wBAAgB,SAAS,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,QAAQ,CAwBnF;AAED,MAAM,WAAW,gBAAgB;IAC/B;wEACoE;IACpE,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;CACpE;AAED,MAAM,WAAW,WAAW;IAC1B;oCACgC;IAChC,KAAK,CAAC,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;CAC7C;AAQD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,gBAAgB,GAAG,WAAW,CAyDtE"}
|
|
@@ -0,0 +1,109 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Ranged pack reading.
|
|
3
|
+
*
|
|
4
|
+
* Sealed envelopes of many small objects live inside one immutable pack.
|
|
5
|
+
* Requests for ranges of the same pack URL made in the same event-loop turn
|
|
6
|
+
* merge into minimal byte spans — one ranged GET per span — and every
|
|
7
|
+
* requester receives exactly its envelope slice. A small hole between wanted
|
|
8
|
+
* ranges is cheaper to read through than to split a request over, so spans
|
|
9
|
+
* merge across gaps up to RANGE_MERGE_GAP_BYTES. Wrong or shifted bytes can
|
|
10
|
+
* never leak: every dispensed slice is still an authenticated envelope the
|
|
11
|
+
* caller opens and hash-verifies.
|
|
12
|
+
*/
|
|
13
|
+
/** Read through holes up to this size rather than splitting a range request. */
|
|
14
|
+
export const RANGE_MERGE_GAP_BYTES = 64 * 1024;
|
|
15
|
+
function invalidSpan(span) {
|
|
16
|
+
return !Number.isSafeInteger(span.offset) || span.offset < 0
|
|
17
|
+
|| !Number.isSafeInteger(span.length) || span.length < 1
|
|
18
|
+
|| !Number.isSafeInteger(span.offset + span.length);
|
|
19
|
+
}
|
|
20
|
+
/** Merge wanted ranges into minimal fetch spans. Pure planning — no IO. */
|
|
21
|
+
export function planSpans(requests, mergeGap) {
|
|
22
|
+
if (requests.length === 0)
|
|
23
|
+
return { spans: [], slices: [] };
|
|
24
|
+
if (!Number.isSafeInteger(mergeGap) || mergeGap < 0) {
|
|
25
|
+
throw new Error('range plan received an invalid merge gap');
|
|
26
|
+
}
|
|
27
|
+
if (requests.some(invalidSpan))
|
|
28
|
+
throw new Error('range plan received an invalid byte span');
|
|
29
|
+
const order = requests.map((request, index) => ({ request, index }))
|
|
30
|
+
.sort((a, b) => a.request.offset - b.request.offset || a.request.length - b.request.length);
|
|
31
|
+
const spans = [];
|
|
32
|
+
const slices = new Array(requests.length);
|
|
33
|
+
for (const { request, index } of order) {
|
|
34
|
+
const end = request.offset + request.length;
|
|
35
|
+
const current = spans[spans.length - 1];
|
|
36
|
+
if (current && request.offset <= current.end + mergeGap) {
|
|
37
|
+
current.end = Math.max(current.end, end);
|
|
38
|
+
}
|
|
39
|
+
else {
|
|
40
|
+
spans.push({ offset: request.offset, end });
|
|
41
|
+
}
|
|
42
|
+
slices[index] = { span: spans.length - 1, start: request.offset - spans[spans.length - 1].offset };
|
|
43
|
+
}
|
|
44
|
+
return {
|
|
45
|
+
spans: spans.map((span) => ({ offset: span.offset, length: span.end - span.offset })),
|
|
46
|
+
slices,
|
|
47
|
+
};
|
|
48
|
+
}
|
|
49
|
+
export function createSpanFetcher(ports) {
|
|
50
|
+
const pending = new Map();
|
|
51
|
+
let scheduled = false;
|
|
52
|
+
const flushUrl = async (url, waiters) => {
|
|
53
|
+
let plan;
|
|
54
|
+
try {
|
|
55
|
+
plan = planSpans(waiters.map((waiter) => waiter.range), RANGE_MERGE_GAP_BYTES);
|
|
56
|
+
}
|
|
57
|
+
catch (error) {
|
|
58
|
+
waiters.forEach((waiter) => waiter.reject(error));
|
|
59
|
+
return;
|
|
60
|
+
}
|
|
61
|
+
await Promise.all(plan.spans.map(async (span, spanIndex) => {
|
|
62
|
+
const served = [];
|
|
63
|
+
plan.slices.forEach((slice, index) => {
|
|
64
|
+
if (slice.span === spanIndex)
|
|
65
|
+
served.push({ waiter: waiters[index], start: slice.start });
|
|
66
|
+
});
|
|
67
|
+
try {
|
|
68
|
+
const bytes = await ports.fetchSpan(url, span);
|
|
69
|
+
if (bytes.length !== span.length) {
|
|
70
|
+
throw new Error(`pack range answered ${bytes.length} bytes where ${span.length} were requested`);
|
|
71
|
+
}
|
|
72
|
+
served.forEach(({ waiter, start }) => waiter.resolve(bytes.subarray(start, start + waiter.range.length)));
|
|
73
|
+
}
|
|
74
|
+
catch (error) {
|
|
75
|
+
served.forEach(({ waiter }) => waiter.reject(error));
|
|
76
|
+
}
|
|
77
|
+
}));
|
|
78
|
+
};
|
|
79
|
+
const flush = () => {
|
|
80
|
+
scheduled = false;
|
|
81
|
+
const batches = [...pending.entries()];
|
|
82
|
+
pending.clear();
|
|
83
|
+
for (const [url, waiters] of batches)
|
|
84
|
+
void flushUrl(url, waiters);
|
|
85
|
+
};
|
|
86
|
+
return {
|
|
87
|
+
fetch(ref) {
|
|
88
|
+
if (ref.offset == null && ref.length == null) {
|
|
89
|
+
return ports.fetchSpan(ref.url, null);
|
|
90
|
+
}
|
|
91
|
+
const range = { offset: ref.offset ?? -1, length: ref.length ?? -1 };
|
|
92
|
+
if (invalidSpan(range)) {
|
|
93
|
+
return Promise.reject(new Error('content ref carries an invalid pack range'));
|
|
94
|
+
}
|
|
95
|
+
return new Promise((resolve, reject) => {
|
|
96
|
+
const waiters = pending.get(ref.url);
|
|
97
|
+
if (waiters)
|
|
98
|
+
waiters.push({ range, resolve, reject });
|
|
99
|
+
else
|
|
100
|
+
pending.set(ref.url, [{ range, resolve, reject }]);
|
|
101
|
+
if (!scheduled) {
|
|
102
|
+
scheduled = true;
|
|
103
|
+
setTimeout(flush, 0);
|
|
104
|
+
}
|
|
105
|
+
});
|
|
106
|
+
},
|
|
107
|
+
};
|
|
108
|
+
}
|
|
109
|
+
//# sourceMappingURL=ranges.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"ranges.js","sourceRoot":"","sources":["../../src/transfer/ranges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,gFAAgF;AAChF,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,GAAG,IAAI,CAAC;AAe/C,SAAS,WAAW,CAAC,IAAc;IACjC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;WACvD,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;WACrD,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;AACxD,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,SAAS,CAAC,QAA6B,EAAE,QAAgB;IACvE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC5D,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC5F,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;SACjE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9F,MAAM,KAAK,GAA2C,EAAE,CAAC;IACzD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAkC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC3E,KAAK,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,KAAK,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,GAAG,GAAG,QAAQ,EAAE,CAAC;YACxD,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC;IACtG,CAAC;IACD,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACrF,MAAM;KACP,CAAC;AACJ,CAAC;AAoBD,MAAM,UAAU,iBAAiB,CAAC,KAAuB;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,MAAM,QAAQ,GAAG,KAAK,EAAE,GAAW,EAAE,OAAsB,EAAiB,EAAE;QAC5E,IAAI,IAAc,CAAC;QACnB,IAAI,CAAC;YACH,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,qBAAqB,CAAC,CAAC;QACjF,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAClD,OAAO;QACT,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE;YACzD,MAAM,MAAM,GAAkD,EAAE,CAAC;YACjE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;gBACnC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;oBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,CAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAC7F,CAAC,CAAC,CAAC;YACH,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAC/C,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;oBACjC,MAAM,IAAI,KAAK,CAAC,uBAAuB,KAAK,CAAC,MAAM,gBAAgB,IAAI,CAAC,MAAM,iBAAiB,CAAC,CAAC;gBACnG,CAAC;gBACD,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,CACnC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACvD,CAAC;QACH,CAAC,CAAC,CAAC,CAAC;IACN,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,GAAS,EAAE;QACvB,SAAS,GAAG,KAAK,CAAC;QAClB,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACvC,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,OAAO;YAAE,KAAK,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACpE,CAAC,CAAC;IAEF,OAAO;QACL,KAAK,CAAC,GAAe;YACnB,IAAI,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBAC7C,OAAO,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACxC,CAAC;YACD,MAAM,KAAK,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC;YACrE,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC,CAAC;YAChF,CAAC;YACD,OAAO,IAAI,OAAO,CAAa,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBACjD,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACrC,IAAI,OAAO;oBAAE,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;;oBACjD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;gBACxD,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS,GAAG,IAAI,CAAC;oBACjB,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;KACF,CAAC;AACJ,CAAC"}
|
|
@@ -0,0 +1,35 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Content-ref brokering for direct content-storage fetches.
|
|
3
|
+
*
|
|
4
|
+
* Downloads fetch every storage object straight from content storage. Callers
|
|
5
|
+
* ask where one object lives at a time; the broker coalesces every request
|
|
6
|
+
* made in the same event-loop turn into one batched refs call. The authority
|
|
7
|
+
* answers each object with a short-lived URL and, when the object's sealed
|
|
8
|
+
* envelope rides inside an immutable pack, the exact byte range holding it.
|
|
9
|
+
* URLs are used immediately and never cached — their expiry is the gateway's
|
|
10
|
+
* revocation lever.
|
|
11
|
+
*/
|
|
12
|
+
/** One law shared with the gateway: the most objects one refs call may name. */
|
|
13
|
+
export declare const CONTENT_REFS_BATCH_OBJECTS = 2048;
|
|
14
|
+
export interface ContentObjectName {
|
|
15
|
+
/** 'manifest' names a whole artifact by content hash; 'block' one chunk by its sha256. */
|
|
16
|
+
readonly kind: 'manifest' | 'block';
|
|
17
|
+
readonly sha256: string;
|
|
18
|
+
}
|
|
19
|
+
/** Where one sealed envelope lives. A packed object carries the byte range of
|
|
20
|
+
* its envelope inside the pack the URL names; a standalone object carries the
|
|
21
|
+
* URL alone and is fetched whole. */
|
|
22
|
+
export interface ContentRef {
|
|
23
|
+
readonly url: string;
|
|
24
|
+
readonly offset?: number;
|
|
25
|
+
readonly length?: number;
|
|
26
|
+
}
|
|
27
|
+
export interface RefsBrokerPorts {
|
|
28
|
+
/** Resolve every named object, returning refs aligned by index. */
|
|
29
|
+
requestRefs(objects: readonly ContentObjectName[]): Promise<readonly ContentRef[]>;
|
|
30
|
+
}
|
|
31
|
+
export interface RefsBroker {
|
|
32
|
+
ref(object: ContentObjectName): Promise<ContentRef>;
|
|
33
|
+
}
|
|
34
|
+
export declare function createRefsBroker(ports: RefsBrokerPorts): RefsBroker;
|
|
35
|
+
//# sourceMappingURL=refs.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"refs.d.ts","sourceRoot":"","sources":["../../src/transfer/refs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,gFAAgF;AAChF,eAAO,MAAM,0BAA0B,OAAO,CAAC;AAE/C,MAAM,WAAW,iBAAiB;IAChC,0FAA0F;IAC1F,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;qCAEqC;AACrC,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,eAAe;IAC9B,mEAAmE;IACnE,WAAW,CAAC,OAAO,EAAE,SAAS,iBAAiB,EAAE,GAAG,OAAO,CAAC,SAAS,UAAU,EAAE,CAAC,CAAC;CACpF;AAED,MAAM,WAAW,UAAU;IACzB,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;CACrD;AAQD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,eAAe,GAAG,UAAU,CA+BnE"}
|
|
@@ -0,0 +1,45 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Content-ref brokering for direct content-storage fetches.
|
|
3
|
+
*
|
|
4
|
+
* Downloads fetch every storage object straight from content storage. Callers
|
|
5
|
+
* ask where one object lives at a time; the broker coalesces every request
|
|
6
|
+
* made in the same event-loop turn into one batched refs call. The authority
|
|
7
|
+
* answers each object with a short-lived URL and, when the object's sealed
|
|
8
|
+
* envelope rides inside an immutable pack, the exact byte range holding it.
|
|
9
|
+
* URLs are used immediately and never cached — their expiry is the gateway's
|
|
10
|
+
* revocation lever.
|
|
11
|
+
*/
|
|
12
|
+
/** One law shared with the gateway: the most objects one refs call may name. */
|
|
13
|
+
export const CONTENT_REFS_BATCH_OBJECTS = 2048;
|
|
14
|
+
export function createRefsBroker(ports) {
|
|
15
|
+
let pending = [];
|
|
16
|
+
let scheduled = false;
|
|
17
|
+
const flush = async () => {
|
|
18
|
+
scheduled = false;
|
|
19
|
+
while (pending.length > 0) {
|
|
20
|
+
const batch = pending.splice(0, CONTENT_REFS_BATCH_OBJECTS);
|
|
21
|
+
try {
|
|
22
|
+
const refs = await ports.requestRefs(batch.map((waiter) => waiter.object));
|
|
23
|
+
if (refs.length !== batch.length) {
|
|
24
|
+
throw new Error('content refs answered the wrong number of objects');
|
|
25
|
+
}
|
|
26
|
+
batch.forEach((waiter, index) => waiter.resolve(refs[index]));
|
|
27
|
+
}
|
|
28
|
+
catch (error) {
|
|
29
|
+
batch.forEach((waiter) => waiter.reject(error));
|
|
30
|
+
}
|
|
31
|
+
}
|
|
32
|
+
};
|
|
33
|
+
return {
|
|
34
|
+
ref(object) {
|
|
35
|
+
return new Promise((resolve, reject) => {
|
|
36
|
+
pending.push({ object, resolve, reject });
|
|
37
|
+
if (!scheduled) {
|
|
38
|
+
scheduled = true;
|
|
39
|
+
setTimeout(() => { void flush(); }, 0);
|
|
40
|
+
}
|
|
41
|
+
});
|
|
42
|
+
},
|
|
43
|
+
};
|
|
44
|
+
}
|
|
45
|
+
//# sourceMappingURL=refs.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"refs.js","sourceRoot":"","sources":["../../src/transfer/refs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,gFAAgF;AAChF,MAAM,CAAC,MAAM,0BAA0B,GAAG,IAAI,CAAC;AAgC/C,MAAM,UAAU,gBAAgB,CAAC,KAAsB;IACrD,IAAI,OAAO,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,MAAM,KAAK,GAAG,KAAK,IAAmB,EAAE;QACtC,SAAS,GAAG,KAAK,CAAC;QAClB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC;YAC5D,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;oBACjC,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;gBACvE,CAAC;gBACD,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC,CAAC;YACjE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,GAAG,CAAC,MAAyB;YAC3B,OAAO,IAAI,OAAO,CAAa,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBACjD,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC1C,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS,GAAG,IAAI,CAAC;oBACjB,UAAU,CAAC,GAAG,EAAE,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;KACF,CAAC;AACJ,CAAC"}
|
|
@@ -2,18 +2,20 @@
|
|
|
2
2
|
/**
|
|
3
3
|
* Download a set of immutable artifacts into a machine cache.
|
|
4
4
|
*
|
|
5
|
-
* The set is the primitive: one plan
|
|
6
|
-
* cache which chunks are gaps, one
|
|
7
|
-
* whole set under a single bound, and one seal
|
|
5
|
+
* The set is the primitive: one plan phase proves every manifest and asks the
|
|
6
|
+
* cache which chunks are gaps, one fetch phase obtains every gap across the
|
|
7
|
+
* whole set under a single bound, and one seal phase verifies each complete
|
|
8
8
|
* artifact. A lone artifact is a set of one — there is no second path. This
|
|
9
9
|
* shape removes per-artifact serialization: no artifact waits behind
|
|
10
10
|
* another's plan or seal, only behind the shared fetch bound. Each chunk is
|
|
11
11
|
* still its own storage request — the set changes scheduling, not the
|
|
12
12
|
* request count.
|
|
13
13
|
*
|
|
14
|
-
* Every chunk
|
|
15
|
-
*
|
|
16
|
-
* host's
|
|
14
|
+
* Every chunk keeps one content-addressed identity, whether its sealed
|
|
15
|
+
* envelope lives alone or as a byte range inside an immutable pack. The
|
|
16
|
+
* host's ports resolve and fetch those identities; parallelism, storage
|
|
17
|
+
* layout, transport, and decryption are the host's concern, while the
|
|
18
|
+
* verification laws here remain singular.
|
|
17
19
|
*/
|
|
18
20
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
19
21
|
exports.downloadAll = downloadAll;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"download.js","sourceRoot":"","sources":["../../src/transfer/download.ts"],"names":[],"mappings":";AAAA
|
|
1
|
+
{"version":3,"file":"download.js","sourceRoot":"","sources":["../../src/transfer/download.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;AAoEH,kCAmEC;AAGD,4BAQC;AAhJD,wDAAkG;AAElG,iDAA+E;AAC/E,+CAIuB;AAwDvB;;uCAEuC;AAChC,KAAK,UAAU,WAAW,CAC/B,SAAsC,EACtC,KAAmC,EACnC,UAA2B,EAAE;IAE7B,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,0CAA4B,CAAC;IACxE,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB;WAC5C,0CAA4B,GAAG,wBAAW,CAAC;IAChD,KAAK,MAAM,QAAQ,IAAI,SAAS;QAAE,IAAA,qCAAsB,EAAC,QAAQ,CAAC,CAAC;IAEnE,MAAM,KAAK,GAAiC,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACxE,MAAM,IAAA,6BAAe,EAAC,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;QACvE,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QACnC,MAAM,OAAO,GAAG,IAAA,iCAAoB,EAClC,MAAM,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,EACjC,QAAQ,CAAC,WAAW,CACrB,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC;QAC/B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,MAAM,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5E,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAClC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,IAAA,qCAAuB,EAC3B,IAAI,EACJ,WAAW,EACX,gBAAgB,EAChB,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,EAC5D,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7C,IAAI,QAAQ,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QAC9F,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC;eAC7B,KAAK,CAAC,UAAU,KAAK,QAAQ,CAAC,KAAK;eACnC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,4BAA4B,KAAK,sBAAsB,CAAC,CAAC;QAC3E,CAAC;QACD,MAAM,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnE,CAAC,CACF,CAAC;IAEF,MAAM,QAAQ,GAAmD,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC7F,MAAM,IAAA,6BAAe,EAAC,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;QACnE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtE,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,MAAM,CAAC,WAAW,KAAK,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YAC7F,MAAM,IAAI,KAAK,CAAC,uBAAuB,IAAI,CAAC,QAAQ,CAAC,WAAW,sBAAsB,CAAC,CAAC;QAC1F,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,GAAG;YACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,gBAAgB,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;YACrC,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;SAChE,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QAC9B,IAAI,OAAO,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACpF,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,sDAAsD;AAC/C,KAAK,UAAU,QAAQ,CAC5B,QAA0B,EAC1B,KAAmC,EACnC,UAA2B,EAAE;IAE7B,MAAM,CAAC,OAAO,CAAC,GAAG,MAAM,WAAW,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAChE,IAAI,OAAO,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IACpF,OAAO,OAAO,CAAC;AACjB,CAAC"}
|
|
@@ -19,5 +19,6 @@ __exportStar(require("./artifacts.js"), exports);
|
|
|
19
19
|
__exportStar(require("./cargo.js"), exports);
|
|
20
20
|
__exportStar(require("./upload.js"), exports);
|
|
21
21
|
__exportStar(require("./download.js"), exports);
|
|
22
|
-
__exportStar(require("./
|
|
22
|
+
__exportStar(require("./refs.js"), exports);
|
|
23
|
+
__exportStar(require("./ranges.js"), exports);
|
|
23
24
|
//# sourceMappingURL=index.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/transfer/index.ts"],"names":[],"mappings":";AAAA,wDAAwD;;;;;;;;;;;;;;;;AAExD,iDAA+B;AAC/B,6CAA2B;AAC3B,8CAA4B;AAC5B,gDAA8B;AAC9B
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/transfer/index.ts"],"names":[],"mappings":";AAAA,wDAAwD;;;;;;;;;;;;;;;;AAExD,iDAA+B;AAC/B,6CAA2B;AAC3B,8CAA4B;AAC5B,gDAA8B;AAC9B,4CAA0B;AAC1B,8CAA4B"}
|
|
@@ -0,0 +1,114 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
/**
|
|
3
|
+
* Ranged pack reading.
|
|
4
|
+
*
|
|
5
|
+
* Sealed envelopes of many small objects live inside one immutable pack.
|
|
6
|
+
* Requests for ranges of the same pack URL made in the same event-loop turn
|
|
7
|
+
* merge into minimal byte spans — one ranged GET per span — and every
|
|
8
|
+
* requester receives exactly its envelope slice. A small hole between wanted
|
|
9
|
+
* ranges is cheaper to read through than to split a request over, so spans
|
|
10
|
+
* merge across gaps up to RANGE_MERGE_GAP_BYTES. Wrong or shifted bytes can
|
|
11
|
+
* never leak: every dispensed slice is still an authenticated envelope the
|
|
12
|
+
* caller opens and hash-verifies.
|
|
13
|
+
*/
|
|
14
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
15
|
+
exports.RANGE_MERGE_GAP_BYTES = void 0;
|
|
16
|
+
exports.planSpans = planSpans;
|
|
17
|
+
exports.createSpanFetcher = createSpanFetcher;
|
|
18
|
+
/** Read through holes up to this size rather than splitting a range request. */
|
|
19
|
+
exports.RANGE_MERGE_GAP_BYTES = 64 * 1024;
|
|
20
|
+
function invalidSpan(span) {
|
|
21
|
+
return !Number.isSafeInteger(span.offset) || span.offset < 0
|
|
22
|
+
|| !Number.isSafeInteger(span.length) || span.length < 1
|
|
23
|
+
|| !Number.isSafeInteger(span.offset + span.length);
|
|
24
|
+
}
|
|
25
|
+
/** Merge wanted ranges into minimal fetch spans. Pure planning — no IO. */
|
|
26
|
+
function planSpans(requests, mergeGap) {
|
|
27
|
+
if (requests.length === 0)
|
|
28
|
+
return { spans: [], slices: [] };
|
|
29
|
+
if (!Number.isSafeInteger(mergeGap) || mergeGap < 0) {
|
|
30
|
+
throw new Error('range plan received an invalid merge gap');
|
|
31
|
+
}
|
|
32
|
+
if (requests.some(invalidSpan))
|
|
33
|
+
throw new Error('range plan received an invalid byte span');
|
|
34
|
+
const order = requests.map((request, index) => ({ request, index }))
|
|
35
|
+
.sort((a, b) => a.request.offset - b.request.offset || a.request.length - b.request.length);
|
|
36
|
+
const spans = [];
|
|
37
|
+
const slices = new Array(requests.length);
|
|
38
|
+
for (const { request, index } of order) {
|
|
39
|
+
const end = request.offset + request.length;
|
|
40
|
+
const current = spans[spans.length - 1];
|
|
41
|
+
if (current && request.offset <= current.end + mergeGap) {
|
|
42
|
+
current.end = Math.max(current.end, end);
|
|
43
|
+
}
|
|
44
|
+
else {
|
|
45
|
+
spans.push({ offset: request.offset, end });
|
|
46
|
+
}
|
|
47
|
+
slices[index] = { span: spans.length - 1, start: request.offset - spans[spans.length - 1].offset };
|
|
48
|
+
}
|
|
49
|
+
return {
|
|
50
|
+
spans: spans.map((span) => ({ offset: span.offset, length: span.end - span.offset })),
|
|
51
|
+
slices,
|
|
52
|
+
};
|
|
53
|
+
}
|
|
54
|
+
function createSpanFetcher(ports) {
|
|
55
|
+
const pending = new Map();
|
|
56
|
+
let scheduled = false;
|
|
57
|
+
const flushUrl = async (url, waiters) => {
|
|
58
|
+
let plan;
|
|
59
|
+
try {
|
|
60
|
+
plan = planSpans(waiters.map((waiter) => waiter.range), exports.RANGE_MERGE_GAP_BYTES);
|
|
61
|
+
}
|
|
62
|
+
catch (error) {
|
|
63
|
+
waiters.forEach((waiter) => waiter.reject(error));
|
|
64
|
+
return;
|
|
65
|
+
}
|
|
66
|
+
await Promise.all(plan.spans.map(async (span, spanIndex) => {
|
|
67
|
+
const served = [];
|
|
68
|
+
plan.slices.forEach((slice, index) => {
|
|
69
|
+
if (slice.span === spanIndex)
|
|
70
|
+
served.push({ waiter: waiters[index], start: slice.start });
|
|
71
|
+
});
|
|
72
|
+
try {
|
|
73
|
+
const bytes = await ports.fetchSpan(url, span);
|
|
74
|
+
if (bytes.length !== span.length) {
|
|
75
|
+
throw new Error(`pack range answered ${bytes.length} bytes where ${span.length} were requested`);
|
|
76
|
+
}
|
|
77
|
+
served.forEach(({ waiter, start }) => waiter.resolve(bytes.subarray(start, start + waiter.range.length)));
|
|
78
|
+
}
|
|
79
|
+
catch (error) {
|
|
80
|
+
served.forEach(({ waiter }) => waiter.reject(error));
|
|
81
|
+
}
|
|
82
|
+
}));
|
|
83
|
+
};
|
|
84
|
+
const flush = () => {
|
|
85
|
+
scheduled = false;
|
|
86
|
+
const batches = [...pending.entries()];
|
|
87
|
+
pending.clear();
|
|
88
|
+
for (const [url, waiters] of batches)
|
|
89
|
+
void flushUrl(url, waiters);
|
|
90
|
+
};
|
|
91
|
+
return {
|
|
92
|
+
fetch(ref) {
|
|
93
|
+
if (ref.offset == null && ref.length == null) {
|
|
94
|
+
return ports.fetchSpan(ref.url, null);
|
|
95
|
+
}
|
|
96
|
+
const range = { offset: ref.offset ?? -1, length: ref.length ?? -1 };
|
|
97
|
+
if (invalidSpan(range)) {
|
|
98
|
+
return Promise.reject(new Error('content ref carries an invalid pack range'));
|
|
99
|
+
}
|
|
100
|
+
return new Promise((resolve, reject) => {
|
|
101
|
+
const waiters = pending.get(ref.url);
|
|
102
|
+
if (waiters)
|
|
103
|
+
waiters.push({ range, resolve, reject });
|
|
104
|
+
else
|
|
105
|
+
pending.set(ref.url, [{ range, resolve, reject }]);
|
|
106
|
+
if (!scheduled) {
|
|
107
|
+
scheduled = true;
|
|
108
|
+
setTimeout(flush, 0);
|
|
109
|
+
}
|
|
110
|
+
});
|
|
111
|
+
},
|
|
112
|
+
};
|
|
113
|
+
}
|
|
114
|
+
//# sourceMappingURL=ranges.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"ranges.js","sourceRoot":"","sources":["../../src/transfer/ranges.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;GAWG;;;AA2BH,8BAwBC;AAoBD,8CAyDC;AA5HD,gFAAgF;AACnE,QAAA,qBAAqB,GAAG,EAAE,GAAG,IAAI,CAAC;AAe/C,SAAS,WAAW,CAAC,IAAc;IACjC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;WACvD,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;WACrD,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;AACxD,CAAC;AAED,2EAA2E;AAC3E,SAAgB,SAAS,CAAC,QAA6B,EAAE,QAAgB;IACvE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC5D,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC5F,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;SACjE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9F,MAAM,KAAK,GAA2C,EAAE,CAAC;IACzD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAkC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC3E,KAAK,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,KAAK,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,GAAG,GAAG,QAAQ,EAAE,CAAC;YACxD,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC;IACtG,CAAC;IACD,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACrF,MAAM;KACP,CAAC;AACJ,CAAC;AAoBD,SAAgB,iBAAiB,CAAC,KAAuB;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,MAAM,QAAQ,GAAG,KAAK,EAAE,GAAW,EAAE,OAAsB,EAAiB,EAAE;QAC5E,IAAI,IAAc,CAAC;QACnB,IAAI,CAAC;YACH,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,6BAAqB,CAAC,CAAC;QACjF,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAClD,OAAO;QACT,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE;YACzD,MAAM,MAAM,GAAkD,EAAE,CAAC;YACjE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;gBACnC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;oBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,CAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAC7F,CAAC,CAAC,CAAC;YACH,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAC/C,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;oBACjC,MAAM,IAAI,KAAK,CAAC,uBAAuB,KAAK,CAAC,MAAM,gBAAgB,IAAI,CAAC,MAAM,iBAAiB,CAAC,CAAC;gBACnG,CAAC;gBACD,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,CACnC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACvD,CAAC;QACH,CAAC,CAAC,CAAC,CAAC;IACN,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,GAAS,EAAE;QACvB,SAAS,GAAG,KAAK,CAAC;QAClB,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACvC,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,OAAO;YAAE,KAAK,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACpE,CAAC,CAAC;IAEF,OAAO;QACL,KAAK,CAAC,GAAe;YACnB,IAAI,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBAC7C,OAAO,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACxC,CAAC;YACD,MAAM,KAAK,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC;YACrE,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC,CAAC;YAChF,CAAC;YACD,OAAO,IAAI,OAAO,CAAa,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBACjD,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACrC,IAAI,OAAO;oBAAE,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;;oBACjD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;gBACxD,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS,GAAG,IAAI,CAAC;oBACjB,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;KACF,CAAC;AACJ,CAAC"}
|
|
@@ -0,0 +1,49 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
/**
|
|
3
|
+
* Content-ref brokering for direct content-storage fetches.
|
|
4
|
+
*
|
|
5
|
+
* Downloads fetch every storage object straight from content storage. Callers
|
|
6
|
+
* ask where one object lives at a time; the broker coalesces every request
|
|
7
|
+
* made in the same event-loop turn into one batched refs call. The authority
|
|
8
|
+
* answers each object with a short-lived URL and, when the object's sealed
|
|
9
|
+
* envelope rides inside an immutable pack, the exact byte range holding it.
|
|
10
|
+
* URLs are used immediately and never cached — their expiry is the gateway's
|
|
11
|
+
* revocation lever.
|
|
12
|
+
*/
|
|
13
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
14
|
+
exports.CONTENT_REFS_BATCH_OBJECTS = void 0;
|
|
15
|
+
exports.createRefsBroker = createRefsBroker;
|
|
16
|
+
/** One law shared with the gateway: the most objects one refs call may name. */
|
|
17
|
+
exports.CONTENT_REFS_BATCH_OBJECTS = 2048;
|
|
18
|
+
function createRefsBroker(ports) {
|
|
19
|
+
let pending = [];
|
|
20
|
+
let scheduled = false;
|
|
21
|
+
const flush = async () => {
|
|
22
|
+
scheduled = false;
|
|
23
|
+
while (pending.length > 0) {
|
|
24
|
+
const batch = pending.splice(0, exports.CONTENT_REFS_BATCH_OBJECTS);
|
|
25
|
+
try {
|
|
26
|
+
const refs = await ports.requestRefs(batch.map((waiter) => waiter.object));
|
|
27
|
+
if (refs.length !== batch.length) {
|
|
28
|
+
throw new Error('content refs answered the wrong number of objects');
|
|
29
|
+
}
|
|
30
|
+
batch.forEach((waiter, index) => waiter.resolve(refs[index]));
|
|
31
|
+
}
|
|
32
|
+
catch (error) {
|
|
33
|
+
batch.forEach((waiter) => waiter.reject(error));
|
|
34
|
+
}
|
|
35
|
+
}
|
|
36
|
+
};
|
|
37
|
+
return {
|
|
38
|
+
ref(object) {
|
|
39
|
+
return new Promise((resolve, reject) => {
|
|
40
|
+
pending.push({ object, resolve, reject });
|
|
41
|
+
if (!scheduled) {
|
|
42
|
+
scheduled = true;
|
|
43
|
+
setTimeout(() => { void flush(); }, 0);
|
|
44
|
+
}
|
|
45
|
+
});
|
|
46
|
+
},
|
|
47
|
+
};
|
|
48
|
+
}
|
|
49
|
+
//# sourceMappingURL=refs.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"refs.js","sourceRoot":"","sources":["../../src/transfer/refs.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AAmCH,4CA+BC;AAhED,gFAAgF;AACnE,QAAA,0BAA0B,GAAG,IAAI,CAAC;AAgC/C,SAAgB,gBAAgB,CAAC,KAAsB;IACrD,IAAI,OAAO,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,MAAM,KAAK,GAAG,KAAK,IAAmB,EAAE;QACtC,SAAS,GAAG,KAAK,CAAC;QAClB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,kCAA0B,CAAC,CAAC;YAC5D,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;oBACjC,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;gBACvE,CAAC;gBACD,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC,CAAC;YACjE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,GAAG,CAAC,MAAyB;YAC3B,OAAO,IAAI,OAAO,CAAa,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBACjD,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC1C,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS,GAAG,IAAI,CAAC;oBACjB,UAAU,CAAC,GAAG,EAAE,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;KACF,CAAC;AACJ,CAAC"}
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@amalgm/live",
|
|
3
|
-
"version": "0.2.
|
|
3
|
+
"version": "0.2.56",
|
|
4
4
|
"description": "Portable realtime SDK for Amalgm — wire contracts, mutation discipline, and delivery state machines behind host-injected adapters.",
|
|
5
5
|
"type": "module",
|
|
6
6
|
"main": "./dist-cjs/index.js",
|
|
@@ -94,7 +94,7 @@
|
|
|
94
94
|
"certification:smoke": "node certification/src/release.mjs prepare --profile smoke --amalgm-version latest",
|
|
95
95
|
"certification:release": "node certification/src/release.mjs prepare --profile certification",
|
|
96
96
|
"certification:preflight": "node certification/src/release.mjs preflight",
|
|
97
|
-
"test": "npm run build && node --test
|
|
97
|
+
"test": "npm run build && node --test",
|
|
98
98
|
"test:parity": "npm run build && node --test tests/parity/"
|
|
99
99
|
},
|
|
100
100
|
"devDependencies": {
|
|
@@ -1,26 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* Presigned-URL brokering for direct content-storage fetches.
|
|
3
|
-
*
|
|
4
|
-
* Downloads fetch every storage object straight from content storage using
|
|
5
|
-
* short-lived URLs the gateway signs. Callers ask for one object's URL at a
|
|
6
|
-
* time; the broker coalesces every request made in the same event-loop turn
|
|
7
|
-
* into one batched signing call, so thousands of tiny fetches cost a handful
|
|
8
|
-
* of control-plane round trips. URLs are used immediately and never cached —
|
|
9
|
-
* their expiry is the gateway's revocation lever.
|
|
10
|
-
*/
|
|
11
|
-
/** One law shared with the gateway: the most objects one signing call may name. */
|
|
12
|
-
export declare const PRESIGN_BATCH_OBJECTS = 2048;
|
|
13
|
-
export interface PresignObject {
|
|
14
|
-
/** 'manifest' names a whole artifact by content hash; 'block' one chunk by its sha256. */
|
|
15
|
-
readonly kind: 'manifest' | 'block';
|
|
16
|
-
readonly sha256: string;
|
|
17
|
-
}
|
|
18
|
-
export interface PresignBrokerPorts {
|
|
19
|
-
/** Sign every named object, returning URLs aligned by index. */
|
|
20
|
-
requestUrls(objects: readonly PresignObject[]): Promise<readonly string[]>;
|
|
21
|
-
}
|
|
22
|
-
export interface PresignBroker {
|
|
23
|
-
url(object: PresignObject): Promise<string>;
|
|
24
|
-
}
|
|
25
|
-
export declare function createPresignBroker(ports: PresignBrokerPorts): PresignBroker;
|
|
26
|
-
//# sourceMappingURL=presign.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"presign.d.ts","sourceRoot":"","sources":["../../src/transfer/presign.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,mFAAmF;AACnF,eAAO,MAAM,qBAAqB,OAAO,CAAC;AAE1C,MAAM,WAAW,aAAa;IAC5B,0FAA0F;IAC1F,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,kBAAkB;IACjC,gEAAgE;IAChE,WAAW,CAAC,OAAO,EAAE,SAAS,aAAa,EAAE,GAAG,OAAO,CAAC,SAAS,MAAM,EAAE,CAAC,CAAC;CAC5E;AAED,MAAM,WAAW,aAAa;IAC5B,GAAG,CAAC,MAAM,EAAE,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CAC7C;AAQD,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,kBAAkB,GAAG,aAAa,CA+B5E"}
|
package/dist/transfer/presign.js
DELETED
|
@@ -1,44 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* Presigned-URL brokering for direct content-storage fetches.
|
|
3
|
-
*
|
|
4
|
-
* Downloads fetch every storage object straight from content storage using
|
|
5
|
-
* short-lived URLs the gateway signs. Callers ask for one object's URL at a
|
|
6
|
-
* time; the broker coalesces every request made in the same event-loop turn
|
|
7
|
-
* into one batched signing call, so thousands of tiny fetches cost a handful
|
|
8
|
-
* of control-plane round trips. URLs are used immediately and never cached —
|
|
9
|
-
* their expiry is the gateway's revocation lever.
|
|
10
|
-
*/
|
|
11
|
-
/** One law shared with the gateway: the most objects one signing call may name. */
|
|
12
|
-
export const PRESIGN_BATCH_OBJECTS = 2048;
|
|
13
|
-
export function createPresignBroker(ports) {
|
|
14
|
-
let pending = [];
|
|
15
|
-
let scheduled = false;
|
|
16
|
-
const flush = async () => {
|
|
17
|
-
scheduled = false;
|
|
18
|
-
while (pending.length > 0) {
|
|
19
|
-
const batch = pending.splice(0, PRESIGN_BATCH_OBJECTS);
|
|
20
|
-
try {
|
|
21
|
-
const urls = await ports.requestUrls(batch.map((waiter) => waiter.object));
|
|
22
|
-
if (urls.length !== batch.length) {
|
|
23
|
-
throw new Error('presign returned the wrong number of urls');
|
|
24
|
-
}
|
|
25
|
-
batch.forEach((waiter, index) => waiter.resolve(urls[index]));
|
|
26
|
-
}
|
|
27
|
-
catch (error) {
|
|
28
|
-
batch.forEach((waiter) => waiter.reject(error));
|
|
29
|
-
}
|
|
30
|
-
}
|
|
31
|
-
};
|
|
32
|
-
return {
|
|
33
|
-
url(object) {
|
|
34
|
-
return new Promise((resolve, reject) => {
|
|
35
|
-
pending.push({ object, resolve, reject });
|
|
36
|
-
if (!scheduled) {
|
|
37
|
-
scheduled = true;
|
|
38
|
-
setTimeout(() => { void flush(); }, 0);
|
|
39
|
-
}
|
|
40
|
-
});
|
|
41
|
-
},
|
|
42
|
-
};
|
|
43
|
-
}
|
|
44
|
-
//# sourceMappingURL=presign.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"presign.js","sourceRoot":"","sources":["../../src/transfer/presign.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,mFAAmF;AACnF,MAAM,CAAC,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAuB1C,MAAM,UAAU,mBAAmB,CAAC,KAAyB;IAC3D,IAAI,OAAO,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,MAAM,KAAK,GAAG,KAAK,IAAmB,EAAE;QACtC,SAAS,GAAG,KAAK,CAAC;QAClB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC;YACvD,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;oBACjC,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;gBAC/D,CAAC;gBACD,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC,CAAC;YACjE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,GAAG,CAAC,MAAqB;YACvB,OAAO,IAAI,OAAO,CAAS,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC7C,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC1C,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS,GAAG,IAAI,CAAC;oBACjB,UAAU,CAAC,GAAG,EAAE,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;KACF,CAAC;AACJ,CAAC"}
|
|
@@ -1,48 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
/**
|
|
3
|
-
* Presigned-URL brokering for direct content-storage fetches.
|
|
4
|
-
*
|
|
5
|
-
* Downloads fetch every storage object straight from content storage using
|
|
6
|
-
* short-lived URLs the gateway signs. Callers ask for one object's URL at a
|
|
7
|
-
* time; the broker coalesces every request made in the same event-loop turn
|
|
8
|
-
* into one batched signing call, so thousands of tiny fetches cost a handful
|
|
9
|
-
* of control-plane round trips. URLs are used immediately and never cached —
|
|
10
|
-
* their expiry is the gateway's revocation lever.
|
|
11
|
-
*/
|
|
12
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
13
|
-
exports.PRESIGN_BATCH_OBJECTS = void 0;
|
|
14
|
-
exports.createPresignBroker = createPresignBroker;
|
|
15
|
-
/** One law shared with the gateway: the most objects one signing call may name. */
|
|
16
|
-
exports.PRESIGN_BATCH_OBJECTS = 2048;
|
|
17
|
-
function createPresignBroker(ports) {
|
|
18
|
-
let pending = [];
|
|
19
|
-
let scheduled = false;
|
|
20
|
-
const flush = async () => {
|
|
21
|
-
scheduled = false;
|
|
22
|
-
while (pending.length > 0) {
|
|
23
|
-
const batch = pending.splice(0, exports.PRESIGN_BATCH_OBJECTS);
|
|
24
|
-
try {
|
|
25
|
-
const urls = await ports.requestUrls(batch.map((waiter) => waiter.object));
|
|
26
|
-
if (urls.length !== batch.length) {
|
|
27
|
-
throw new Error('presign returned the wrong number of urls');
|
|
28
|
-
}
|
|
29
|
-
batch.forEach((waiter, index) => waiter.resolve(urls[index]));
|
|
30
|
-
}
|
|
31
|
-
catch (error) {
|
|
32
|
-
batch.forEach((waiter) => waiter.reject(error));
|
|
33
|
-
}
|
|
34
|
-
}
|
|
35
|
-
};
|
|
36
|
-
return {
|
|
37
|
-
url(object) {
|
|
38
|
-
return new Promise((resolve, reject) => {
|
|
39
|
-
pending.push({ object, resolve, reject });
|
|
40
|
-
if (!scheduled) {
|
|
41
|
-
scheduled = true;
|
|
42
|
-
setTimeout(() => { void flush(); }, 0);
|
|
43
|
-
}
|
|
44
|
-
});
|
|
45
|
-
},
|
|
46
|
-
};
|
|
47
|
-
}
|
|
48
|
-
//# sourceMappingURL=presign.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"presign.js","sourceRoot":"","sources":["../../src/transfer/presign.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AA0BH,kDA+BC;AAvDD,mFAAmF;AACtE,QAAA,qBAAqB,GAAG,IAAI,CAAC;AAuB1C,SAAgB,mBAAmB,CAAC,KAAyB;IAC3D,IAAI,OAAO,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,MAAM,KAAK,GAAG,KAAK,IAAmB,EAAE;QACtC,SAAS,GAAG,KAAK,CAAC;QAClB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,6BAAqB,CAAC,CAAC;YACvD,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;oBACjC,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;gBAC/D,CAAC;gBACD,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC,CAAC;YACjE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,GAAG,CAAC,MAAqB;YACvB,OAAO,IAAI,OAAO,CAAS,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC7C,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC1C,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS,GAAG,IAAI,CAAC;oBACjB,UAAU,CAAC,GAAG,EAAE,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;KACF,CAAC;AACJ,CAAC"}
|