We use a simple array (with NULL entries) until we have too many. */
| 133 | |
| 134 | /* We use a simple array (with NULL entries) until we have too many. */ |
| 135 | static bool node_uses_chan_map(const struct node *node) |
| 136 | { |
| 137 | /* This is a layering violation: last entry in htable is the table ptr, |
| 138 | * which is never NULL */ |
| 139 | return node->chans.arr[NUM_IMMEDIATE_CHANS] != NULL; |
| 140 | } |
| 141 | |
| 142 | /* When simple array fills, use a htable. */ |
| 143 | static void convert_node_to_chan_map(struct node *node) |
no outgoing calls
no test coverage detected