35 35 <td>FilterSymbols</td>
36 36 <td>Filter symbols, exclude symbols and lines of development</td>
37 37 <td>Ok</td>
38 38 </tr>
39 39 <tr>
40 40 <td>InitCsets</td>
41 41 <td>Create initial changesets</td>
42 -<td>Ok. <b>Memory Hog, Slow commit</b></td>
42 +<td>Ok.</td>
43 43 </tr>
44 44 <tr>
45 45 <td>CsetDeps</td>
46 46 <td>Compute changeset dependencies from revision dependencies</td>
47 47 <td>Ok</td>
48 48 </tr>
49 49 <tr>
................................................................................
60 60 <td>BreakSymCsetCycles</td>
61 61 <td>Break cycles among symbol changesets</td>
62 62 <td>Ok</td>
63 63 </tr>
64 64 <tr>
65 65 <td>BreakAllCsetCycles</td>
66 66 <td>Break cycles over all changesets</td>
67 -<td><b>May still change the order of revision changesets over the result of pass 7.</b></td>
67 +<td>Ok. (Accepting that it may still change the order of revision changesets over the result of pass 7).</td>
68 68 </tr>
69 69 <tr>
70 70 <td>AllTopologicallSort</td>
71 71 <td>Topologically sort all changesets</td>
72 72 <td>Ok</td>
73 73 </tr>
74 -
74 +<tr>
75 +<td>Import</td>
76 +<td>Import files</td>
77 +<td>Ok.</td>
78 +</tr>
79 +<tr>
80 +<td>Import</td>
81 +<td>Import changesets</td>
82 +<td>Ok.</td>
83 +</tr>
75 84 <tr>
76 85 <td>Import</td>
77 -<td>Import files and changesets</td>
78 -<td>File import ok. Changeset import has restarted.</td>
86 +<td>Import finalization (fossil rebuild)</td>
87 +<td>Ok.</td>
79 88 </tr>
80 89 </table>
81 90 </p>
82 91
83 -Passes to do:
84 - * Put changeset order from the top.sort passes and tree of symbols from the coll|FilterSym passes together into a tree of changesets. Note that it might not be a tree if there is an NTDB around.
85 - * Perform the actual import.
86 92
87 93 Notes regarding the actual import:
88 94 <ul>
89 95 <li>cvs2svn is either slow, or hungry for diskspace. The reason: It is importing changeset by changeset and so has to either regenerate the needed revisions of the files on-demand over and over, or it caches the needed revisions when created until the last user is gone.
90 96 </li>
91 97 <li>We can do better, if we get help from fossil. We would need commands to perform the following actions:
92 98 <ul>