| 1096 | |
| 1097 | |
| 1098 | int tpl_length(const tpl_t* tpl) |
| 1099 | { |
| 1100 | tpl_node_t *n = tpl->head; |
| 1101 | tpl_tcell_t *s = tpl->first; |
| 1102 | int len; |
| 1103 | |
| 1104 | for (len = 0; n != NULL; n = n->next) |
| 1105 | len += (n->val) ? n->len : n->fval->len; |
| 1106 | |
| 1107 | for (; s != NULL; s = s->next) |
| 1108 | { |
| 1109 | for (n = s->tpl->added_head; n != NULL; n = n->next) |
| 1110 | len += n->len; |
| 1111 | } |
| 1112 | |
| 1113 | return len; |
| 1114 | } |
| 1115 | |
| 1116 | |
| 1117 | int tpl_section_length(const tpl_t* tpl) |
no outgoing calls
no test coverage detected
searching dependent graphs…