GraphAllocator
Description
Allocator backing the graph’s slots, adjacency vectors, and node payloads.
Parameters
| Name | Direction | Description |
|---|---|---|
g |
in | Graph to query. |
Usage example (Cross-references)
Usage examples (Cross-references)
- In
Init.c:160:
// top-level allocator is propagated all the way down to the inner
// storage of the deep-copy / typed-init variants.
bool result = (GraphAllocator(&graph_a)->retry_limit == 31) && (GraphAllocator(&graph_b)->retry_limit == 31);
result = result && (GraphAllocator(&graph_c)->retry_limit == 31) && (GraphAllocator(&graph_d)->retry_limit == 31);
result = result && (GraphAllocator(&graph_e)->retry_limit == 31) && (GraphAllocator(&graph_f)->retry_limit == 31);- In
Init.c:161:
// storage of the deep-copy / typed-init variants.
bool result = (GraphAllocator(&graph_a)->retry_limit == 31) && (GraphAllocator(&graph_b)->retry_limit == 31);
result = result && (GraphAllocator(&graph_c)->retry_limit == 31) && (GraphAllocator(&graph_d)->retry_limit == 31);
result = result && (GraphAllocator(&graph_e)->retry_limit == 31) && (GraphAllocator(&graph_f)->retry_limit == 31);
result = result && (GraphAllocator(&graph_g)->retry_limit == 31) && (GraphAllocator(&graph_h)->retry_limit == 31);- In
Init.c:162:
bool result = (GraphAllocator(&graph_a)->retry_limit == 31) && (GraphAllocator(&graph_b)->retry_limit == 31);
result = result && (GraphAllocator(&graph_c)->retry_limit == 31) && (GraphAllocator(&graph_d)->retry_limit == 31);
result = result && (GraphAllocator(&graph_e)->retry_limit == 31) && (GraphAllocator(&graph_f)->retry_limit == 31);
result = result && (GraphAllocator(&graph_g)->retry_limit == 31) && (GraphAllocator(&graph_h)->retry_limit == 31);
result = result && (GraphAllocator(&graph_e)->alignment == 8) && (GraphAllocator(&graph_f)->alignment == 16);- In
Init.c:163:
result = result && (GraphAllocator(&graph_c)->retry_limit == 31) && (GraphAllocator(&graph_d)->retry_limit == 31);
result = result && (GraphAllocator(&graph_e)->retry_limit == 31) && (GraphAllocator(&graph_f)->retry_limit == 31);
result = result && (GraphAllocator(&graph_g)->retry_limit == 31) && (GraphAllocator(&graph_h)->retry_limit == 31);
result = result && (GraphAllocator(&graph_e)->alignment == 8) && (GraphAllocator(&graph_f)->alignment == 16);
result = result && (GraphAllocator(&graph_g)->alignment == 32) && (GraphAllocator(&graph_h)->alignment == 64);- In
Init.c:164:
result = result && (GraphAllocator(&graph_e)->retry_limit == 31) && (GraphAllocator(&graph_f)->retry_limit == 31);
result = result && (GraphAllocator(&graph_g)->retry_limit == 31) && (GraphAllocator(&graph_h)->retry_limit == 31);
result = result && (GraphAllocator(&graph_e)->alignment == 8) && (GraphAllocator(&graph_f)->alignment == 16);
result = result && (GraphAllocator(&graph_g)->alignment == 32) && (GraphAllocator(&graph_h)->alignment == 64);
result = result && (GraphCopyInit(&graph_c) == (GenericCopyInit)str_init_copy);- In
Init.c:165:
result = result && (GraphAllocator(&graph_g)->retry_limit == 31) && (GraphAllocator(&graph_h)->retry_limit == 31);
result = result && (GraphAllocator(&graph_e)->alignment == 8) && (GraphAllocator(&graph_f)->alignment == 16);
result = result && (GraphAllocator(&graph_g)->alignment == 32) && (GraphAllocator(&graph_h)->alignment == 64);
result = result && (GraphCopyInit(&graph_c) == (GenericCopyInit)str_init_copy);
result = result && (GraphCopyDeinit(&graph_d) == (GenericCopyDeinit)str_deinit);- In
Type.c:34:
VecBegin(&graph.pending_edge_removals) == NULL && GraphCopyInit(&graph) == NULL &&
GraphCopyDeinit(&graph) == NULL && graph.pending_delete_count == 0 &&
GraphMutationEpoch(&graph) == 0 && GraphAllocator(&graph)->alignment == 1;
GraphDeinit(&graph);- In
Type.c:52:
GraphNode node = GraphGetNode(&graph, node_id);
bool result = GraphAllocator(&graph)->alignment == 32 && GraphNodeIdIndex(node_id) == 0 &&
GraphNodeIdGeneration(node_id) == 1;
result = result && GraphNodeGetId(node) == node_id;- In
Type.c:125:
// guard on this (non-allocating) path.
GENERIC_GRAPH(&graph)->__magic |= MAGIC_VALIDATED_BIT;
GraphAllocator(&graph)->alignment = 3;
ValidateGraph(&graph);
Last updated on