diff options
| author |   Richard Purdie <richard.purdie@linuxfoundation.org> | 2013-12-09 10:18:31 +0000 |
|---|---|---|
| committer | Richard Purdie <richard.purdie@linuxfoundation.org> | 2013-12-09 10:25:41 +0000 |
| commit | 8f453bb11d72afc90a986ac604b3477d97eaf9a8 (patch) | |
| tree | fa0414fb0754fca09841742ce2212cdd3ed31586 /lib/bb/data.py | |
| parent | 73ddf1a3d1c516ad3bc785e0413483e616ce07a8 (diff) | |
| download | bitbake-contrib-8f453bb11d72afc90a986ac604b3477d97eaf9a8.tar.gz | |
data: Ensure we add the contains keys in a particular order
If we don't sort the data, the values can reorder changing the
signatures meaning we get confused builds and significant cache
misses.
Signed-off-by: Richard Purdie <richard.purdie@linuxfoundation.org>
Diffstat (limited to 'lib/bb/data.py')
| -rw-r--r-- | lib/bb/data.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/bb/data.py b/lib/bb/data.py index 3d2c6a497..58408036d 100644 --- a/lib/bb/data.py +++ b/lib/bb/data.py @@ -301,9 +301,9 @@ def build_dependencies(key, keys, shelldeps, varflagsexcl, d): def handle_contains(value, contains, d): newvalue = "" - for k in contains: + for k in sorted(contains): l = (d.getVar(k, True) or "").split() - for word in contains[k]: + for word in sorted(contains[k]): if word in l: newvalue += "\n%s{%s} = Set" % (k, word) else: |