| | @@ -36,26 +36,59 @@ |
| 36 | 36 | */ |
| 37 | 37 | void bisect_path(void){ |
| 38 | 38 | PathNode *p; |
| 39 | 39 | bisect.bad = db_lget_int("bisect-bad", 0); |
| 40 | 40 | if( bisect.bad==0 ){ |
| 41 | | - bisect.bad = db_int(0, "SELECT cid FROM plink ORDER BY mtime DESC LIMIT 1"); |
| 42 | | - db_lset_int("bisect-bad", bisect.bad); |
| 41 | + fossil_fatal("no \"bad\" version has been identified"); |
| 43 | 42 | } |
| 44 | 43 | bisect.good = db_lget_int("bisect-good", 0); |
| 45 | 44 | if( bisect.good==0 ){ |
| 46 | | - bisect.good = db_int(0,"SELECT pid FROM plink ORDER BY mtime LIMIT 1"); |
| 47 | | - db_lset_int("bisect-good", bisect.good); |
| 45 | + fossil_fatal("no \"good\" version has been identified"); |
| 48 | 46 | } |
| 49 | | - p = path_shortest(bisect.good, bisect.bad, 0); |
| 47 | + p = path_shortest(bisect.good, bisect.bad, bisect_option("direct-only")); |
| 50 | 48 | if( p==0 ){ |
| 51 | 49 | char *zBad = db_text(0, "SELECT uuid FROM blob WHERE rid=%d", bisect.bad); |
| 52 | 50 | char *zGood = db_text(0, "SELECT uuid FROM blob WHERE rid=%d", bisect.good); |
| 53 | 51 | fossil_fatal("no path from good ([%S]) to bad ([%S]) or back", |
| 54 | 52 | zGood, zBad); |
| 55 | 53 | } |
| 56 | 54 | } |
| 55 | + |
| 56 | +/* |
| 57 | +** The set of all bisect options. |
| 58 | +*/ |
| 59 | +static const struct { |
| 60 | + const char *zName; |
| 61 | + const char *zDefault; |
| 62 | + const char *zDesc; |
| 63 | +} aBisectOption[] = { |
| 64 | + { "auto-next", "on", "Automatically run \"bisect next\" after each " |
| 65 | + "\"bisect good\" or \"bisect bad\"" }, |
| 66 | + { "direct-only", "on", "Follow only primary parent-child links, not " |
| 67 | + "merges\n" }, |
| 68 | +}; |
| 69 | + |
| 70 | +/* |
| 71 | +** Return the value of a boolean bisect option. |
| 72 | +*/ |
| 73 | +int bisect_option(const char *zName){ |
| 74 | + unsigned int i; |
| 75 | + int r = -1; |
| 76 | + for(i=0; i<sizeof(aBisectOption)/sizeof(aBisectOption[0]); i++){ |
| 77 | + if( strcmp(zName, aBisectOption[i].zName)==0 ){ |
| 78 | + char *zLabel = mprintf("bisect-%s", zName); |
| 79 | + char *z = db_lget(zLabel, (char*)aBisectOption[i].zDefault); |
| 80 | + if( is_truth(z) ) r = 1; |
| 81 | + if( is_false(z) ) r = 0; |
| 82 | + if( r<0 ) r = is_truth(aBisectOption[i].zDefault); |
| 83 | + free(zLabel); |
| 84 | + break; |
| 85 | + } |
| 86 | + } |
| 87 | + assert( r>=0 ); |
| 88 | + return r; |
| 89 | +} |
| 57 | 90 | |
| 58 | 91 | /* |
| 59 | 92 | ** COMMAND: bisect |
| 60 | 93 | ** |
| 61 | 94 | ** Usage: %fossil bisect SUBCOMMAND ... |
| | @@ -75,10 +108,15 @@ |
| 75 | 108 | ** fossil bisect next |
| 76 | 109 | ** |
| 77 | 110 | ** Update to the next version that is halfway between the working and |
| 78 | 111 | ** non-working versions. |
| 79 | 112 | ** |
| 113 | +** fossil bisect options ?NAME? ?VALUE? |
| 114 | +** |
| 115 | +** List all bisect options, or the value of a single option, or set the |
| 116 | +** value of a bisect option. |
| 117 | +** |
| 80 | 118 | ** fossil bisect reset |
| 81 | 119 | ** |
| 82 | 120 | ** Reinitialize a bisect session. This cancels prior bisect history |
| 83 | 121 | ** and allows a bisect session to start over from the beginning. |
| 84 | 122 | ** |
| | @@ -88,10 +126,13 @@ |
| 88 | 126 | */ |
| 89 | 127 | void bisect_cmd(void){ |
| 90 | 128 | int n; |
| 91 | 129 | const char *zCmd; |
| 92 | 130 | db_must_be_within_tree(); |
| 131 | + if( g.argc<3 ){ |
| 132 | + usage("bisect SUBCOMMAND ARGS..."); |
| 133 | + } |
| 93 | 134 | zCmd = g.argv[2]; |
| 94 | 135 | n = strlen(zCmd); |
| 95 | 136 | if( n==0 ) zCmd = "-"; |
| 96 | 137 | if( memcmp(zCmd, "bad", n)==0 ){ |
| 97 | 138 | int ridBad; |
| | @@ -99,19 +140,38 @@ |
| 99 | 140 | ridBad = db_lget_int("checkout",0); |
| 100 | 141 | }else{ |
| 101 | 142 | ridBad = name_to_rid(g.argv[3]); |
| 102 | 143 | } |
| 103 | 144 | db_lset_int("bisect-bad", ridBad); |
| 145 | + if( ridBad>0 |
| 146 | + && bisect_option("auto-next") |
| 147 | + && db_lget_int("bisect-good",0)>0 |
| 148 | + ){ |
| 149 | + zCmd = "next"; |
| 150 | + n = 4; |
| 151 | + }else{ |
| 152 | + return; |
| 153 | + } |
| 104 | 154 | }else if( memcmp(zCmd, "good", n)==0 ){ |
| 105 | 155 | int ridGood; |
| 106 | 156 | if( g.argc==3 ){ |
| 107 | 157 | ridGood = db_lget_int("checkout",0); |
| 108 | 158 | }else{ |
| 109 | 159 | ridGood = name_to_rid(g.argv[3]); |
| 110 | 160 | } |
| 111 | 161 | db_lset_int("bisect-good", ridGood); |
| 112 | | - }else if( memcmp(zCmd, "next", n)==0 ){ |
| 162 | + if( ridGood>0 |
| 163 | + && bisect_option("auto-next") |
| 164 | + && db_lget_int("bisect-bad",0)>0 |
| 165 | + ){ |
| 166 | + zCmd = "next"; |
| 167 | + n = 4; |
| 168 | + }else{ |
| 169 | + return; |
| 170 | + } |
| 171 | + } |
| 172 | + if( memcmp(zCmd, "next", n)==0 ){ |
| 113 | 173 | PathNode *pMid; |
| 114 | 174 | bisect_path(); |
| 115 | 175 | pMid = path_midpoint(); |
| 116 | 176 | if( pMid==0 ){ |
| 117 | 177 | fossil_fatal("bisect is done - there are no more intermediate versions"); |
| | @@ -119,16 +179,43 @@ |
| 119 | 179 | g.argv[1] = "update"; |
| 120 | 180 | g.argv[2] = db_text(0, "SELECT uuid FROM blob WHERE rid=%d", pMid->rid); |
| 121 | 181 | g.argc = 3; |
| 122 | 182 | g.fNoSync = 1; |
| 123 | 183 | update_cmd(); |
| 184 | + }else if( memcmp(zCmd, "options", n)==0 ){ |
| 185 | + if( g.argc==3 ){ |
| 186 | + unsigned int i; |
| 187 | + for(i=0; i<sizeof(aBisectOption)/sizeof(aBisectOption[0]); i++){ |
| 188 | + char *z = mprintf("bisect-%s", aBisectOption[i].zName); |
| 189 | + printf(" %-15s %-6s ", aBisectOption[i].zName, |
| 190 | + db_lget(z, (char*)aBisectOption[i].zDefault)); |
| 191 | + fossil_free(z); |
| 192 | + comment_print(aBisectOption[i].zDesc, 27, 79); |
| 193 | + } |
| 194 | + }else if( g.argc==4 || g.argc==5 ){ |
| 195 | + unsigned int i; |
| 196 | + n = strlen(g.argv[3]); |
| 197 | + for(i=0; i<sizeof(aBisectOption)/sizeof(aBisectOption[0]); i++){ |
| 198 | + if( memcmp(g.argv[3], aBisectOption[i].zName, n)==0 ){ |
| 199 | + char *z = mprintf("bisect-%s", aBisectOption[i].zName); |
| 200 | + if( g.argc==5 ){ |
| 201 | + db_lset(z, g.argv[4]); |
| 202 | + } |
| 203 | + printf("%s\n", db_lget(z, (char*)aBisectOption[i].zDefault)); |
| 204 | + fossil_free(z); |
| 205 | + break; |
| 206 | + } |
| 207 | + } |
| 208 | + if( i>=sizeof(aBisectOption)/sizeof(aBisectOption[0]) ){ |
| 209 | + fossil_fatal("no such bisect option: %s", g.argv[3]); |
| 210 | + } |
| 211 | + }else{ |
| 212 | + usage("bisect option ?NAME? ?VALUE?"); |
| 213 | + } |
| 124 | 214 | }else if( memcmp(zCmd, "reset", n)==0 ){ |
| 125 | 215 | db_multi_exec( |
| 126 | | - "REPLACE INTO vvar(name, value) " |
| 127 | | - " SELECT 'bisect-good', pid FROM plink ORDER BY mtime LIMIT 1;" |
| 128 | | - "REPLACE INTO vvar(name, value) " |
| 129 | | - " SELECT 'bisect-bad', cid FROM plink ORDER BY mtime DESC LIMIT 1;" |
| 216 | + "DELETE FROM vvar WHERE name IN ('bisect-good', 'bisect-bad');" |
| 130 | 217 | ); |
| 131 | 218 | }else if( memcmp(zCmd, "vlist", n)==0 ){ |
| 132 | 219 | PathNode *p; |
| 133 | 220 | int vid = db_lget_int("checkout", 0); |
| 134 | 221 | int n; |
| 135 | 222 | |