The member's outcome: a method's node, else a graph gap. */
| 765 | |
| 766 | /* The member's outcome: a method's node, else a graph gap. */ |
| 767 | static pr_res_t pr_member_node(const pr_ctx_t *c, const pr_search_t *s) { |
| 768 | const pr_type_t *t = &c->ix->types[s->owner]; |
| 769 | if (s->found->kind != 'm' || t->dup) { |
| 770 | return pr_mk(PR_GAP); |
| 771 | } |
| 772 | const pr_file_t *f = &c->ix->files[t->file]; |
| 773 | char qn[PR_QN_MAX]; |
| 774 | int n = snprintf(qn, sizeof(qn), "%s.%s.%s", f->module_qn, t->name, s->found->name); |
| 775 | const cbm_gbuf_node_t *node = |
| 776 | (n > 0 && (size_t)n < sizeof(qn)) ? pr_node(c, qn, f->path) : NULL; |
| 777 | pr_res_t r = pr_mk(node ? PR_NODE : PR_GAP); |
| 778 | r.node = node; |
| 779 | return r; |
| 780 | } |
| 781 | |
| 782 | static pr_res_t pr_member(const pr_ctx_t *c, int ti, const pr_ref_t *r) { |
| 783 | pr_search_t s = {.c = c, .name = r->mem, .len = r->mem_len, .owner = CBM_NOT_FOUND}; |
no test coverage detected