summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rwxr-xr-xbin/bitbake-diffsigs16
1 files changed, 0 insertions, 16 deletions
diff --git a/bin/bitbake-diffsigs b/bin/bitbake-diffsigs
index f84188d57..5400e5b92 100755
--- a/bin/bitbake-diffsigs
+++ b/bin/bitbake-diffsigs
@@ -37,12 +37,6 @@ logger = bb.msg.logger_create('bitbake-diffsigs')
def find_compare_task(bbhandler, pn, taskname):
""" Find the most recent signature files for the specified PN/task and compare them """
- def get_hashval(siginfo):
- if siginfo.endswith('.siginfo'):
- return siginfo.rpartition(':')[2].partition('_')[0]
- else:
- return siginfo.rpartition('.')[2]
-
if not hasattr(bb.siggen, 'find_siginfo'):
logger.error('Metadata does not support finding signature data files')
sys.exit(1)
@@ -59,16 +53,6 @@ def find_compare_task(bbhandler, pn, taskname):
logger.error('Only one matching sigdata file found for the specified task (%s %s)' % (pn, taskname))
sys.exit(1)
else:
- # It's possible that latestfiles contain 3 elements and the first two have the same hash value.
- # In this case, we delete the second element.
- # The above case is actually the most common one. Because we may have sigdata file and siginfo
- # file having the same hash value. Comparing such two files makes no sense.
- if len(latestfiles) == 3:
- hash0 = get_hashval(latestfiles[0])
- hash1 = get_hashval(latestfiles[1])
- if hash0 == hash1:
- latestfiles.pop(1)
-
# Define recursion callback
def recursecb(key, hash1, hash2):
hashes = [hash1, hash2]