A base candidate (the team artifact's graph) is repaired incrementally when * the closure route can, rebuilt when it declines, and either way the result * is exactly the graph a build from scratch makes of the same tree. */ Two independent builds never share row ids or a database identity, so they * are compared by graph content. */
| 1629 | /* Two independent builds never share row ids or a database identity, so they |
| 1630 | * are compared by graph content. */ |
| 1631 | static bool pf_digest(const char *db, unsigned char out[32]) { |
| 1632 | cbm_store_t *store = cbm_store_open_path_query(db); |
| 1633 | if (!store) |
| 1634 | return false; |
| 1635 | bool ok = cbm_store_graph_content_digest(store, PF_PROJECT, out) == CBM_STORE_OK; |
| 1636 | cbm_store_close(store); |
| 1637 | return ok; |
| 1638 | } |
| 1639 | |
| 1640 | /* Builds the source tree into `keep` (renamed from the candidate); base may be |
| 1641 | * NULL. *route receives the route that built it. */ |
no test coverage detected