1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
# Copyright (C) 2012-2014 Codethink Limited
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; version 2 of the License.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License along
# with this program; if not, write to the Free Software Foundation, Inc.,
# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
import hashlib
import logging
import morphlib
class CacheKeyComputer(object):
def __init__(self, build_env):
self._build_env = build_env
self._calculated = {}
def _filterenv(self, env):
keys = ["LOGNAME", "MORPH_ARCH", "TARGET", "TARGET_STAGE1",
"USER", "USERNAME"]
return dict([(k, env[k]) for k in keys])
def compute_key(self, artifact):
logging.debug('computing cache key for artifact %s from source '
'repo %s, sha1 %s, filename %s' %
(artifact.name, artifact.source.repo_name,
artifact.source.sha1, artifact.source.filename))
return self._hash_id(self.get_cache_id(artifact))
def _hash_id(self, cache_id):
sha = hashlib.sha256()
self._hash_dict(sha, cache_id)
return sha.hexdigest()
def _hash_thing(self, sha, thing):
if type(thing) == dict:
self._hash_dict(sha, thing)
elif type(thing) == list:
self._hash_list(sha, thing)
elif type(thing) == tuple:
self._hash_tuple(sha, thing)
else:
sha.update(str(thing))
def _hash_dict(self, sha, d):
for tup in sorted(d.iteritems()):
self._hash_thing(sha, tup)
def _hash_list(self, sha, l):
for item in l:
self._hash_thing(sha, item)
def _hash_tuple(self, sha, tup):
for item in tup:
self._hash_thing(sha, item)
def get_cache_id(self, artifact):
logging.debug('computing cache id for artifact %s from source '
'repo %s, sha1 %s, filename %s' %
(artifact.name, artifact.source.repo_name,
artifact.source.sha1, artifact.source.filename))
try:
return self._calculated[artifact]
except KeyError:
cacheid = self._calculate(artifact)
self._calculated[artifact] = cacheid
return cacheid
def _calculate(self, artifact):
keys = {
'env': self._filterenv(self._build_env.env),
'filename': artifact.source.filename,
'kids': [self.compute_key(x) for x in artifact.dependencies],
'metadata-version': artifact.metadata_version
}
kind = artifact.source.morphology['kind']
if kind == 'chunk':
keys['build-mode'] = artifact.source.build_mode
keys['prefix'] = artifact.source.prefix
keys['tree'] = artifact.source.tree
keys['split-rules'] = [(a, [rgx.pattern for rgx in r._regexes])
for (a, r) in artifact.source.split_rules]
elif kind in ('system', 'stratum'):
morphology = artifact.source.morphology
le_dict = dict((k, morphology[k]) for k in morphology.keys())
# Disregard all fields of a morphology that aren't important
ignored_fields = (
'description', # purely cosmetic, doesn't change builds
# The following are used to determine dependencies,
# so are already handled by the 'kids' field.
'strata', 'build-depends', 'chunks',
'products')
for ignored_field in ignored_fields:
if ignored_field in le_dict:
del le_dict[ignored_field]
checksum = hashlib.sha1()
self._hash_thing(checksum, le_dict)
keys['morphology-sha1'] = checksum.hexdigest()
if kind == 'stratum':
keys['stratum-format-version'] = 1
elif kind == 'system':
keys['system-compatibility-version'] = "1~ (temporary, root rw)"
return keys
|