| | @@ -134,19 +134,10 @@ |
| 134 | 134 | db_step(&addLeaf); |
| 135 | 135 | db_reset(&addLeaf); |
| 136 | 136 | } |
| 137 | 137 | } |
| 138 | 138 | |
| 139 | | -/* |
| 140 | | -** Check for a fork against rid and set g.fForkSeen |
| 141 | | -*/ |
| 142 | | -void fork_check(int rid){ |
| 143 | | - if( is_a_leaf(rid) && fossil_find_nearest_fork(rid, 0) ){ |
| 144 | | - g.forkSeen = 1; |
| 145 | | - } |
| 146 | | -} |
| 147 | | - |
| 148 | 139 | /* |
| 149 | 140 | ** Return an SQL expression (stored in memory obtained from fossil_malloc()) |
| 150 | 141 | ** that is true if the SQL variable named "zVar" contains the rid with |
| 151 | 142 | ** a CLOSED tag. In other words, return true if the leaf is closed. |
| 152 | 143 | ** |
| | @@ -179,17 +170,14 @@ |
| 179 | 170 | } |
| 180 | 171 | db_reset(&parentsOf); |
| 181 | 172 | } |
| 182 | 173 | |
| 183 | 174 | /* |
| 184 | | -** Do all pending leaf and fork checks. |
| 175 | +** Do all pending leaf checks. |
| 185 | 176 | */ |
| 186 | 177 | void leaf_do_pending_checks(void){ |
| 187 | 178 | int rid; |
| 188 | 179 | for(rid=bag_first(&needToCheck); rid; rid=bag_next(&needToCheck,rid)){ |
| 189 | 180 | leaf_check(rid); |
| 190 | 181 | } |
| 191 | | - for(rid=bag_first(&needToCheck); rid; rid=bag_next(&needToCheck,rid)){ |
| 192 | | - fork_check(rid); |
| 193 | | - } |
| 194 | 182 | bag_clear(&needToCheck); |
| 195 | 183 | } |
| 196 | 184 | |