src/TortoiseProc/LogDataVector.cpp

   1 // TortoiseGit - a Windows shell extension for easy version control
   2
   3 // Copyright (C) 2009-2013 - TortoiseGit
   4 // Copyright (C) 2007-2008 - TortoiseSVN
   5
   6 // This program is free software; you can redistribute it and/or
   7 // modify it under the terms of the GNU General Public License
   8 // as published by the Free Software Foundation; either version 2
   9 // of the License, or (at your option) any later version.
  10
  11 // This program is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License
  17 // along with this program; if not, write to the Free Software Foundation,
  18 // 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  19 //
  20 /*
  21         Description: start-up repository opening and reading
  22
  23         Author: Marco Costalba (C) 2005-2007
  24
  25         Copyright: See COPYING file that comes with this distribution
  26
  27 */
  28
  29 #include "stdafx.h"
  30 #include "TortoiseProc.h"
  31 #include "GitLogListBase.h"
  32 #include "GitRev.h"
  33 //#include "VssStyle.h"
  34 #include "IconMenu.h"
  35 // CGitLogList
  36 #include "cursor.h"
  37 #include "InputDlg.h"
  38 #include "GITProgressDlg.h"
  39 #include "ProgressDlg.h"
  40 //#include "RepositoryBrowser.h"
  41 //#include "CopyDlg.h"
  42 //#include "StatGraphDlg.h"
  43 #include "Logdlg.h"
  44 #include "MessageBox.h"
  45 #include "registry.h"
  46 #include "AppUtils.h"
  47 #include "PathUtils.h"
  48 #include "StringUtils.h"
  49 #include "UnicodeUtils.h"
  50 #include "TempFile.h"
  51 //#include "GitInfo.h"
  52 //#include "GitDiff.h"
  53 #include "IconMenu.h"
  54 //#include "RevisionRangeDlg.h"
  55 //#include "BrowseFolder.h"
  56 //#include "BlameDlg.h"
  57 //#include "Blame.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"
  65 #include "GitHash.h"
  66 CGitHashMap a;
  67
  68 void CLogDataVector::ClearAll()
  69 {
  70
  71         clear();
  72         m_HashMap.clear();
  73         m_Lns.clear();
  74
  75         m_FirstFreeLane=0;
  76         m_Lns.clear();
  77
  78         m_RawlogData.clear();
  79         m_RawLogStart.clear();
  80 }
  81
  82 //CLogDataVector Class
  83 int CLogDataVector::ParserFromLog(CTGitPath *path ,int count ,int infomask,CString *from,CString *to)
  84 {
  85         // only enable --follow on files
  86         if ((path == NULL || path->IsDirectory()) && (infomask & CGit::LOG_INFO_FOLLOW))
  87                 infomask = infomask ^ CGit::LOG_INFO_FOLLOW;
  88
  89         CString hash;
  90         CString cmd=g_Git.GetLogCmd(hash,path,count,infomask,from,to,true);
  91
  92         if (g_Git.IsOrphanBranch(hash))
  93                 return 0;
  94
  95         git_init();
  96
  97         GIT_LOG handle;
  98         try
  99         {
 100                 if (git_open_log(&handle,CUnicodeUtils::GetMulti(cmd, CP_UTF8).GetBuffer()))
 101                 {
 102                         return -1;
 103                 }
 104         }
 105         catch (char * g_last_error)
 106         {
 107                 MessageBox(NULL, CString(g_last_error), _T("TortoiseGit"), MB_ICONERROR);
 108                 return -1;
 109         }
 110
 111         git_get_log_firstcommit(handle);
 112
 113         GIT_COMMIT commit;
 114
 115         while (git_get_log_nextcommit(handle, &commit, infomask & CGit::LOG_INFO_FOLLOW) == 0)
 116         {
 117                 if (commit.m_ignore == 1)
 118                 {
 119                         git_free_commit(&commit);
 120                         continue;
 121                 }
 122
 123                 CGitHash hash = (char*)commit.m_hash ;
 124
 125                 GitRev *pRev = this->m_pLogCache->GetCacheData(hash);
 126
 127                 char *note=NULL;
 128                 git_get_notes(commit.m_hash,&note);
 129                 if(note)
 130                 {
 131                         pRev->m_Notes.Empty();
 132                         g_Git.StringAppend(&pRev->m_Notes,(BYTE*)note);
 133                 }
 134
 135                 if((pRev == NULL || !pRev->m_IsFull) && infomask& CGit::LOG_INFO_FULL_DIFF)
 136                 {
 137                         pRev->ParserFromCommit(&commit);
 138                         pRev->ParserParentFromCommit(&commit);
 139                         git_free_commit(&commit);
 140                         //Must call free commit before SafeFetchFullInfo, commit parent is rewrite by log.
 141                         //file list will wrong if parent rewrite.
 142                         try
 143                         {
 144                                 pRev->SafeFetchFullInfo(&g_Git);
 145                         }
 146                         catch (char * g_last_error)
 147                         {
 148                                 MessageBox(NULL, _T("Could not fetch full info of a commit.\nlibgit reports:\n") + CString(g_last_error), _T("TortoiseGit"), MB_ICONERROR);
 149                                 return -1;
 150                         }
 151                 }
 152                 else
 153                 {
 154                         ASSERT(pRev->m_CommitHash == hash);
 155                         pRev->ParserFromCommit(&commit);
 156                         pRev->ParserParentFromCommit(&commit);
 157                         git_free_commit(&commit);
 158                 }
 159
 160                 this->push_back(pRev->m_CommitHash);
 161
 162                 m_HashMap[pRev->m_CommitHash] = (int)size() - 1;
 163
 164         }
 165
 166         git_close_log(handle);
 167
 168         return 0;
 169 }
 170
 171 int AddTolist(unsigned char * /*osha1*/, unsigned char *nsha1, const char * /*name*/, unsigned long /*time*/, int /*sz*/, const char *msg, void *data)
 172 {
 173         CLogDataVector *vector = (CLogDataVector*)data;
 174         GitRev rev;
 175         rev.m_CommitHash=(char*)nsha1;
 176
 177         CString one;
 178         g_Git.StringAppend(&one, (BYTE *)msg);
 179
 180         int message=one.Find(_T(":"),0);
 181         if(message>0)
 182         {
 183                 rev.m_RefAction=one.Left(message);
 184                 rev.GetSubject()=one.Mid(message+1);
 185         }
 186
 187         vector->m_pLogCache->m_HashMap[rev.m_CommitHash]=rev;
 188         vector->insert(vector->begin(),rev.m_CommitHash);
 189
 190         return 0;
 191 }
 192
 193 int CLogDataVector::ParserFromRefLog(CString ref)
 194 {
 195         if(g_Git.m_IsUseGitDLL)
 196         {
 197                 git_for_each_reflog_ent(CUnicodeUtils::GetUTF8(ref),AddTolist,this);
 198                 for (size_t i = 0; i < size(); ++i)
 199                 {
 200                         m_pLogCache->m_HashMap[at(i)].m_Ref.Format(_T("%s{%d}"), ref,i);
 201                 }
 202
 203         }
 204         else
 205         {
 206
 207                 CString cmd, out;
 208                 GitRev rev;
 209                 cmd.Format(_T("git.exe reflog show %s"),ref);
 210                 if (g_Git.Run(cmd, &out, NULL, CP_UTF8))
 211                         return -1;
 212
 213                 int pos=0;
 214                 while(pos>=0)
 215                 {
 216                         CString one=out.Tokenize(_T("\n"),pos);
 217                         int ref=one.Find(_T(' '),0);
 218                         if(ref<0)
 219                                 continue;
 220
 221                         rev.Clear();
 222
 223                         if (g_Git.GetHash(rev.m_CommitHash, one.Left(ref)))
 224                         {
 225                                 MessageBox(NULL, g_Git.GetGitLastErr(_T("Could not get hash of ") + one.Left(ref) + _T(".")), _T("TortoiseGit"), MB_ICONERROR);
 226                                 return -1;
 227                         }
 228                         int action=one.Find(_T(' '),ref+1);
 229                         int message;
 230                         if(action>0)
 231                         {
 232                                 rev.m_Ref=one.Mid(ref+1,action-ref-2);
 233                                 message=one.Find(_T(":"),action);
 234                                 if(message>0)
 235                                 {
 236                                         rev.m_RefAction=one.Mid(action+1,message-action-1);
 237                                         rev.GetSubject()=one.Right(one.GetLength()-message-1);
 238                                 }
 239                         }
 240
 241                         this->m_pLogCache->m_HashMap[rev.m_CommitHash]=rev;
 242
 243                         this->push_back(rev.m_CommitHash);
 244
 245                 }
 246         }
 247         return 0;
 248 }
 249
 250 void CLogDataVector::setLane(CGitHash& sha)
 251 {
 252         Lanes* l = &(this->m_Lns);
 253         int i = m_FirstFreeLane;
 254
 255 //      QVector<QByteArray> ba;
 256 //      const ShaString& ss = toPersistentSha(sha, ba);
 257 //      const ShaVect& shaVec(fh->revOrder);
 258
 259         for (int cnt = (int)size(); i < cnt; ++i) {
 260
 261                 GitRev* r = & this->GetGitRevAt(i);
 262                 CGitHash curSha=r->m_CommitHash;
 263
 264                 if (r->m_Lanes.empty())
 265                         updateLanes(*r, *l, curSha);
 266
 267                 if (curSha == sha)
 268                         break;
 269         }
 270         m_FirstFreeLane = ++i;
 271
 272 #if 0
 273         Lanes* l = &(this->m_Lanes);
 274         int i = m_FirstFreeLane;
 275
 276         QVector<QByteArray> ba;
 277         const ShaString& ss = toPersistentSha(sha, ba);
 278         const ShaVect& shaVec(fh->revOrder);
 279
 280         for (uint cnt = shaVec.count(); i < cnt; ++i) {
 281
 282                 const ShaString& curSha = shaVec[i];
 283                 Rev* r = m_HashMap[curSha]const_cast<Rev*>(revLookup(curSha, fh));
 284                 if (r->lanes.count() == 0)
 285                         updateLanes(*r, *l, curSha);
 286
 287                 if (curSha == ss)
 288                         break;
 289         }
 290         fh->firstFreeLane = ++i;
 291 #endif
 292 }
 293
 294
 295 void CLogDataVector::updateLanes(GitRev& c, Lanes& lns, CGitHash &sha)
 296 {
 297 // we could get third argument from c.sha(), but we are in fast path here
 298 // and c.sha() involves a deep copy, so we accept a little redundancy
 299
 300         if (lns.isEmpty())
 301                 lns.init(sha);
 302
 303         bool isDiscontinuity;
 304         bool isFork = lns.isFork(sha, isDiscontinuity);
 305         bool isMerge = (c.ParentsCount() > 1);
 306         bool isInitial = (c.ParentsCount() == 0);
 307
 308         if (isDiscontinuity)
 309                 lns.changeActiveLane(sha); // uses previous isBoundary state
 310
 311         lns.setBoundary(c.IsBoundary() == TRUE); // update must be here
 312         TRACE(_T("%s %d"),c.m_CommitHash.ToString(),c.IsBoundary());
 313
 314         if (isFork)
 315                 lns.setFork(sha);
 316         if (isMerge)
 317                 lns.setMerge(c.m_ParentHash);
 318         //if (c.isApplied)
 319         //      lns.setApplied();
 320         if (isInitial)
 321                 lns.setInitial();
 322
 323         lns.getLanes(c.m_Lanes); // here lanes are snapshotted
 324
 325         CGitHash nextSha;
 326         if( !isInitial)
 327                 nextSha = c.m_ParentHash[0];
 328
 329         lns.nextParent(nextSha);
 330
 331         //if (c.isApplied)
 332         //      lns.afterApplied();
 333         if (isMerge)
 334                 lns.afterMerge();
 335         if (isFork)
 336                 lns.afterFork();
 337         if (lns.isBranch())
 338                 lns.afterBranch();
 339
 340 //      QString tmp = "", tmp2;
 341 //      for (uint i = 0; i < c.lanes.count(); i++) {
 342 //              tmp2.setNum(c.lanes[i]);
 343 //              tmp.append(tmp2 + "-");
 344 //      }
 345 //      qDebug("%s %s",tmp.latin1(), c.sha.latin1());
 346 }