Jul*_*lle 4 python git git-post-receive gitpython dulwich
我正在使用Python和Git-Python编写一个git post-receive钩子,该钩子收集有关推送中包含的提交的信息,然后用摘要更新我们的错误跟踪器和IM。在推送创建分支的情况下,我遇到了麻烦(即fromrev,后接收的参数全为零),并且在该分支上还跨越了几次提交。我正在从torev提交中倒退父母列表,但是我不知道如何确定哪个提交是分支中的第一个提交,即何时停止查找。
在命令行上我可以做
git rev-list this-branch ^not-that-branch ^master
Run Code Online (Sandbox Code Playgroud)
这将给我确切的提交清单this-branch,而没有其他人。我尝试使用记录的Commit.iter_parents方法复制此方法,该方法记录为采用与git-rev-list相同的参数,但据我所知,它不喜欢位置参数,而且我找不到一组关键字参数那个工作。
我读了Dulwich的doco,但尚不清楚它是否会做与Git-Python截然不同的事情。
我的(简化)代码如下所示。推送开始新分支时,当前仅查看第一次提交,然后停止:
import git
repo = git.Repo('.')
for line in input:
(fromrev, torev, refname) = line.rstrip().split(' ')
commit = repo.commit(torev)
maxdepth = 25 # just so we don't go too far back in the tree
if fromrev == ('0' * 40):
maxdepth = 1
depth = 0
while depth < maxdepth:
if commit.hexsha == fromrev:
# Reached the start of the push
break
print '{sha} by {name}: {msg}'.format(
sha = commit.hexsha[:7], user = commit.author.name, commit.summary)
commit = commit.parents[0]
depth += 1
Run Code Online (Sandbox Code Playgroud)
使用纯Git-Python,它也可以完成。我还没有找到一种方法来识别一组一次性使用的kwarg。但是,您可以简单地构造一组master分支的shas,然后在要检查的分支上使用iter_commits来查找第一个未出现在父分支中的分支:
from git import *
repo_path = '.'
repo = Repo(repo_path)
parent_branch = repo.branches.master
examine_branch = repo.branches.test_feature_branch
other_shas = set()
for parent_commit in repo.iter_commits(rev=parent_branch):
other_shas.add(parent_commit.hexsha)
for commit in repo.iter_commits(rev=examine_branch):
if commit.hexsha not in other_shas:
first_commit = commit
print '%s by %s: %s' % (first_commit.hexsha[:7],
first_commit.author.name, first_commit.summary)
Run Code Online (Sandbox Code Playgroud)
而且,如果您确实要确保排除所有其他分支上的所有提交,则可以将第一个for循环包装在repo.branches上的另一个for循环中:
other_shas = set()
for branch in repo.branches:
if branch != examine_branch:
for commit in repo.iter_commits(rev=branch):
other_shas.add(commit.hexsha)
Run Code Online (Sandbox Code Playgroud)
我刚刚玩了一下德威,也许有更好的方法来做到这一点(使用内置助行器?)。假设只有一个新分支(或多个没有共同点的新分支):
#!/usr/bin/env python
import sys
from dulwich.repo import Repo
from dulwich.objects import ZERO_SHA
def walk(repo, sha, shas, callback=None, depth=100):
if not sha in shas and depth > 0:
shas.add(sha)
if callback:
callback(sha)
for parent in repo.commit(sha).parents:
walk(repo, parent, shas, callback, depth - 1)
def reachable_from_other_branches(repo, this_branch):
shas = set()
for branch in repo.refs.keys():
if branch.startswith("refs/heads") and branch != this_branch:
walk(repo, repo.refs[branch], shas)
return shas
def branch_commits(repo, fromrev, torev, branchname):
if fromrev == ZERO_SHA:
ends = reachable_from_other_branches(repo, branchname)
else:
ends = set([fromrev])
def print_callback(sha):
commit = repo.commit(sha)
msg = commit.message.split("\n")[0]
print('{sha} by {author}: {msg}'
.format(sha=sha[:7], author=commit.author, msg=msg))
print(branchname)
walk(repo, torev, ends, print_callback)
repo = Repo(".")
for line in sys.stdin:
fromrev, torev, refname = line.rstrip().split(' ')
branch_commits(repo, fromrev, torev, refname)
Run Code Online (Sandbox Code Playgroud)