When simple array fills, use a htable. */
| 141 | |
| 142 | /* When simple array fills, use a htable. */ |
| 143 | static void convert_node_to_chan_map(struct node *node) |
| 144 | { |
| 145 | struct chan *chans[NUM_IMMEDIATE_CHANS]; |
| 146 | |
| 147 | memcpy(chans, node->chans.arr, sizeof(chans)); |
| 148 | chan_map_init_sized(&node->chans.map, NUM_IMMEDIATE_CHANS + 1); |
| 149 | assert(node_uses_chan_map(node)); |
| 150 | for (size_t i = 0; i < ARRAY_SIZE(chans); i++) |
| 151 | chan_map_add(&node->chans.map, chans[i]); |
| 152 | } |
| 153 | |
| 154 | static void add_chan(struct node *node, struct chan *chan) |
| 155 | { |
no test coverage detected