Graph Topology * nodes per stage: 4 * stages: 3 * src: 1 * sink: 1 */
| 890 | * sink: 1 |
| 891 | */ |
| 892 | static inline int |
| 893 | graph_init_reverse_tree(void) |
| 894 | { |
| 895 | uint8_t edge_map[][4][4] = { |
| 896 | { |
| 897 | {25, 25, 25, 25}, |
| 898 | {25, 25, 25, 25}, |
| 899 | {25, 25, 25, 25}, |
| 900 | {25, 25, 25, 25} |
| 901 | }, |
| 902 | { |
| 903 | {33, 33, 33, 33}, |
| 904 | {33, 33, 33, 33}, |
| 905 | {34, 34, 34, 34}, |
| 906 | {0, 0, 0, 0} |
| 907 | }, |
| 908 | { |
| 909 | {50, 50, 50, 0}, |
| 910 | {50, 50, 50, 0}, |
| 911 | {0, 0, 0, 0}, |
| 912 | {0, 0, 0, 0} |
| 913 | }, |
| 914 | }; |
| 915 | uint8_t src_map[][4] = { {25, 25, 25, 25} }; |
| 916 | uint8_t snk_map[][1] = { {100}, {100}, {0}, {0} }; |
| 917 | |
| 918 | return graph_init("graph_full_split", SOURCES(src_map), SINKS(snk_map), |
| 919 | STAGES(edge_map), NODES_PER_STAGE(edge_map), src_map, |
| 920 | snk_map, edge_map, 0); |
| 921 | } |
| 922 | |
| 923 | /* Graph Topology |
| 924 | * nodes per stage: 4 |
nothing calls this directly
no test coverage detected