1 // TortoiseSVN - a Windows shell extension for easy version control
3 // Copyright (C) 2007-2008 - TortoiseSVN
5 // This program is free software; you can redistribute it and/or
6 // modify it under the terms of the GNU General Public License
7 // as published by the Free Software Foundation; either version 2
8 // of the License, or (at your option) any later version.
10 // This program is distributed in the hope that it will be useful,
11 // but WITHOUT ANY WARRANTY; without even the implied warranty of
12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 // GNU General Public License for more details.
15 // You should have received a copy of the GNU General Public License
16 // along with this program; if not, write to the Free Software Foundation,
17 // 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
20 Description: start-up repository opening and reading
22 Author: Marco Costalba (C) 2005-2007
24 Copyright: See COPYING file that comes with this distribution
29 #include "TortoiseProc.h"
30 #include "GitLogList.h"
32 //#include "VssStyle.h"
38 #include "SVNProgressDlg.h"
39 #include "ProgressDlg.h"
40 //#include "RepositoryBrowser.h"
41 //#include "CopyDlg.h"
42 //#include "StatGraphDlg.h"
44 #include "MessageBox.h"
47 #include "PathUtils.h"
48 #include "StringUtils.h"
49 #include "UnicodeUtils.h"
51 //#include "GitInfo.h"
52 //#include "GitDiff.h"
54 //#include "RevisionRangeDlg.h"
55 //#include "BrowseFolder.h"
56 //#include "BlameDlg.h"
58 //#include "GitHelpers.h"
59 #include "GitStatus.h"
60 //#include "LogDlgHelper.h"
61 //#include "CachedLogInfo.h"
62 //#include "RepositoryInfo.h"
63 //#include "EditPropertiesDlg.h"
64 #include "FileDiffDlg.h"
66 //CLogDataVector Class
67 int CLogDataVector::ParserFromLog()
74 begin.Format(_T("#<%c>"),LOG_REV_ITEM_BEGIN);
76 if(log.GetLength()==0)
84 next=log.Find(begin,start);
86 length = next - start+4;
88 length = log.GetLength()-start+4;
91 onelog=log.Mid(start -4,length);
92 rev.ParserFromLog(onelog);
94 m_HashMap[rev.m_CommitHash]=&rev;
101 void CLogDataVector::setLane(CString& sha)
103 Lanes* l = &(this->m_Lanes);
104 int i = m_FirstFreeLane;
106 // QVector<QByteArray> ba;
107 // const ShaString& ss = toPersistentSha(sha, ba);
108 // const ShaVect& shaVec(fh->revOrder);
110 for (int cnt = size(); i < cnt; ++i) {
112 GitRev* r = &(*this)[i];
113 CString &curSha=r->m_CommitHash;
115 if (r->m_Lanes.size() == 0)
116 updateLanes(*r, *l, curSha);
121 m_FirstFreeLane = ++i;
124 Lanes* l = &(this->m_Lanes);
125 int i = m_FirstFreeLane;
127 QVector<QByteArray> ba;
128 const ShaString& ss = toPersistentSha(sha, ba);
129 const ShaVect& shaVec(fh->revOrder);
131 for (uint cnt = shaVec.count(); i < cnt; ++i) {
133 const ShaString& curSha = shaVec[i];
134 Rev* r = m_HashMap[curSha]const_cast<Rev*>(revLookup(curSha, fh));
135 if (r->lanes.count() == 0)
136 updateLanes(*r, *l, curSha);
141 fh->firstFreeLane = ++i;
146 void CLogDataVector::updateLanes(GitRev& c, Lanes& lns, CString &sha)
148 // we could get third argument from c.sha(), but we are in fast path here
149 // and c.sha() involves a deep copy, so we accept a little redundancy
154 bool isDiscontinuity;
155 bool isFork = lns.isFork(sha, isDiscontinuity);
156 bool isMerge = (c.ParentsCount() > 1);
157 bool isInitial = (c.ParentsCount() == 0);
160 lns.changeActiveLane(sha); // uses previous isBoundary state
162 lns.setBoundary(0/*c.isBoundary()*/); // update must be here
167 lns.setMerge(c.m_ParentHash);
173 lns.getLanes(c.m_Lanes); // here lanes are snapshotted
175 CString nextSha = (isInitial) ? CString(_T("")) : QString(c.m_ParentHash[0]);
177 lns.nextParent(nextSha);
180 // lns.afterApplied();
188 // QString tmp = "", tmp2;
189 // for (uint i = 0; i < c.lanes.count(); i++) {
190 // tmp2.setNum(c.lanes[i]);
191 // tmp.append(tmp2 + "-");
193 // qDebug("%s %s",tmp.latin1(), c.sha.latin1());