fastchart/fastchart_graph.h at master · iliaal/fastchart · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
/*
  +----------------------------------------------------------------------+
  | Copyright (c) 2025-2026, Ilia Alshanetsky                            |
  | Copyright (c) 2025-2026, Advanced Internet Designs Inc.              |
  +----------------------------------------------------------------------+
  | This source file is subject to the BSD 3-Clause license that is      |
  | bundled with this package in the file LICENSE.                       |
  +----------------------------------------------------------------------+
  | Author: Ilia Alshanetsky <ilia@ilia.ws>                              |
  +----------------------------------------------------------------------+
*/

#ifndef FASTCHART_GRAPH_H
#define FASTCHART_GRAPH_H

#include "php.h"

/* Shared node/edge data model for the graph chart family (ArcDiagram,
 * ChordDiagram, NetworkChart). Same shape SankeyChart parses inline;
 * these charts share the parse/free/clone helpers below instead of
 * duplicating the logic per class. SankeyChart predates this header
 * and keeps its own copy — folding it in is a later dedupe. */

#define FASTCHART_MAX_GRAPH_NODES   512    /* per chart */
#define FASTCHART_MAX_GRAPH_LINKS   2048   /* per chart */
#define FASTCHART_MAX_GRAPH_LABEL_BYTES (64 * 1024)

typedef struct {
    char *label;          /* emalloc'd, NUL-terminated; NULL = no label */
    int   color_rgb;      /* -1 = palette default */
} fastchart_graph_node;

typedef struct {
    int    from;          /* node index, 0-based */
    int    to;            /* node index, 0-based */
    double value;         /* > 0 */
} fastchart_graph_link;

/* Parse a PHP node array (`[['label' => string?, 'color' => int?], ...]`)
 * into a freshly emalloc'd fastchart_graph_node[]. Caps element count at
 * `max`. A non-array entry becomes an unlabeled palette-colored node so
 * indices stay aligned with the caller's input. On success writes *out /
 * *count and returns 0; an empty input yields *count == 0 and *out NULL. */
int fastchart_graph_parse_nodes(zval *arr, int max,
                                fastchart_graph_node **out, int *count);
int fastchart_graph_validate_node_labels(zval *arr, const char *method);

/* Parse a PHP link array (`[['from' => int, 'to' => int, 'value' => num],
 * ...]`) into a freshly emalloc'd fastchart_graph_link[]. Drops entries
 * that are malformed, reference an out-of-range index (>= node_count),
 * are self-loops, or carry a non-finite / non-positive value. Caps at
 * `max`. Returns 0 with *count possibly 0 (and *out NULL). */
int fastchart_graph_parse_links(zval *arr, int node_count, int max,
                                fastchart_graph_link **out, int *count);

void fastchart_graph_free_nodes(fastchart_graph_node *nodes, int count);
void fastchart_graph_free_links(fastchart_graph_link *links);

/* Deep-copy helpers for clone_object (addref) handlers. Return NULL when
 * count <= 0 or the source pointer is NULL. */
fastchart_graph_node *fastchart_graph_clone_nodes(
    const fastchart_graph_node *nodes, int count);
fastchart_graph_link *fastchart_graph_clone_links(
    const fastchart_graph_link *links, int count);

/* Object-field helpers shared by the graph chart classes (ArcDiagram,
 * ChordDiagram, NetworkChart), which all carry the same
 * {nodes, node_count, links, link_count} quad. Each operates through
 * field pointers so it makes no assumption about the surrounding struct
 * layout. */
void fastchart_graph_fields_release(fastchart_graph_node **nodes, int *ncount,
                                    fastchart_graph_link **links, int *lcount);
void fastchart_graph_fields_addref(fastchart_graph_node **nodes, int ncount,
                                   fastchart_graph_link **links, int lcount);
/* setNodes semantics: free the old nodes AND links (stale link indices
 * reference the old node array), then parse the new node list. */
void fastchart_graph_fields_set_nodes(fastchart_graph_node **nodes, int *ncount,
                                      fastchart_graph_link **links, int *lcount,
                                      zval *arr);
void fastchart_graph_fields_set_links(int node_count,
                                      fastchart_graph_link **links, int *lcount,
                                      zval *arr);

#endif /* FASTCHART_GRAPH_H */