commitgraph.cpp 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. #include "commitgraph.h"
  2. #include <gitcommit.h>
  3. #include <graphpoint.h>
  4. #include <QDateTime>
  5. #include <git2/revwalk.h>
  6. #include <git2/commit.h>
  7. CommitGraph::CommitGraph() : QObject()
  8. {
  9. qsrand(QDateTime::currentMSecsSinceEpoch());
  10. }
  11. void CommitGraph::addHead(const GitOid &oid)
  12. {
  13. //Random color generation to be replaced with resets
  14. int red = qrand() % 205 + 50;
  15. int green = qrand() % 205 + 50;
  16. int blue = qrand() % 205 + 50;
  17. m_color = QString::number(red, 16) + QString::number(green, 16) + QString::number(blue, 16);
  18. git_revwalk* walk;
  19. git_revwalk_new(&walk, oid.repository()->raw());
  20. git_revwalk_push(walk, oid.raw());
  21. git_revwalk_sorting(walk, GIT_SORT_TOPOLOGICAL);
  22. git_oid newOid;
  23. while(git_revwalk_next(&newOid, walk) == 0) {
  24. GitOid commitOid(&newOid, oid.repository());
  25. GitCommit *commit = GitCommit::fromOid(commitOid);
  26. findParents(commit);
  27. }
  28. git_revwalk_free(walk);
  29. qDebug() << "Update Y coordinate after head added";
  30. for(int i = 0; i < m_sortedPoints.count(); i++) {
  31. static_cast<GraphPoint*>(m_sortedPoints.at(i))->setY(i);
  32. }
  33. }
  34. void CommitGraph::findParents(GitCommit* commit)
  35. {
  36. QList<GitOid> reverseList;
  37. git_commit* commitRaw = commit->raw();
  38. while(commitRaw != nullptr)
  39. {
  40. GitOid parentOid(git_commit_id(commitRaw), commit->repository());
  41. commit = GitCommit::fromOid(parentOid);
  42. reverseList.push_front(parentOid);
  43. if(m_points.contains(parentOid)) { //Finish parents lookup once parent found in tree. We will see nothing new in this branch
  44. break;
  45. }
  46. qDebug() << "Add commit to reverselist" << parentOid.toString();
  47. commitRaw = nullptr;
  48. git_commit_parent(&commitRaw, commit->raw(), 0);
  49. }
  50. if(reverseList.count() < 2) { //In case if only original commit in list, we didn't find anything new
  51. return;
  52. }
  53. addCommits(reverseList);
  54. }
  55. void CommitGraph::addCommits(QList<GitOid>& reversList)
  56. {
  57. GraphPoint* point = nullptr;
  58. GraphPoint* parentPoint = nullptr;
  59. for(int i = 0; i < (reversList.count() - 1); i++) {
  60. GitOid& parentIter = reversList[i];
  61. GitOid& childIter = reversList[i + 1];
  62. parentPoint = m_points.value(parentIter, nullptr);
  63. if(parentPoint == nullptr) {
  64. parentPoint = new GraphPoint(parentIter, this);
  65. parentPoint->setColor(m_color);
  66. m_sortedPoints.append(parentPoint);
  67. m_points.insert(parentPoint->oid(), parentPoint);
  68. }
  69. point = m_points.value(childIter, nullptr);
  70. if(point == nullptr) {
  71. int x = parentPoint->x() + parentPoint->childPointsCount();
  72. point = new GraphPoint(childIter, x, 0, m_color, this);
  73. parentPoint->addChildPoint(point);
  74. m_points.insert(point->oid(), point);
  75. //Ordered commits
  76. int parentPosition = m_sortedPoints.indexOf(parentPoint);
  77. if(parentPosition >= 0) {
  78. m_sortedPoints.insert(parentPosition + 1, point);
  79. }
  80. qDebug() << "New commit: " << point->oid().toString() << point->x() << point->y();
  81. qDebug() << "New commit: " << parentPoint->oid().toString() << parentPoint->x() << parentPoint->y();
  82. }
  83. }
  84. }