16   assert(a->last_node >= a->first_node);  in value_lifecycle_overlap()
17   assert(b->last_node >= b->first_node);  in value_lifecycle_overlap()
18   if (a->first_node < b->first_node) {  in value_lifecycle_overlap()
19     return a->last_node >= b->first_node;  in value_lifecycle_overlap()
21     return b->last_node >= a->first_node;  in value_lifecycle_overlap()
43       if (usage[node->inputs[i]].first_node == 0) {  in populate_value_lifecycle()
44         usage[node->inputs[i]].first_node = nid;  in populate_value_lifecycle()
49       if (usage[node->outputs[i]].first_node == 0) {  in populate_value_lifecycle()
50         usage[node->outputs[i]].first_node = nid;  in populate_value_lifecycle()
55   const struct xnn_node* first_node = subgraph->nodes;  in populate_value_lifecycle()  local
56   for (uint32_t i = 0; i < first_node->num_inputs; ++i) {  in populate_value_lifecycle()
57     usage[first_node->inputs[i]].first_node = 0;  in populate_value_lifecycle()
59   for (uint32_t i = 0; i < first_node->num_outputs; ++i) {  in populate_value_lifecycle()
60     usage[first_node->outputs[i]].first_node = 0;  in populate_value_lifecycle()