/
smartcache.py
422 lines (362 loc) · 14.6 KB
/
smartcache.py
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
""" Defines SmartCache and supporting functions """
from __future__ import division, print_function, absolute_import, unicode_literals
#*****************************************************************
# pyGSTi 0.9: Copyright 2015 Sandia Corporation
# This Software is released under the GPL license detailed
# in the file "license.txt" in the top-level pyGSTi directory
#*****************************************************************
import hashlib as _hashlib
import functools as _functools
import sys as _sys
import numpy as _np
import functools as _functools
import inspect as _inspect
import pickle as _pickle
from collections import Counter, defaultdict
from .opttools import timed_block as _timed_block
DIGEST_TIMES = defaultdict(list)
csize = lambda counter : len(list(counter.elements()))
def average(l):
""" Computes the average of the items in a list """
nCalls = max(1, len(l))
return sum(l) / nCalls
def show_cache_percents(hits, misses, printer):
"""
Shows effectiveness of a cache
Parameters
----------
hits : Counter
cache hits
misses : Counter
cache misses
printer : pygsti.objects.VerbosityPrinter
logging object
"""
nHits = csize(hits)
nMisses = csize(misses)
nRequests = nHits + nMisses
printer.log(' {:<10} requests'.format(nRequests))
printer.log(' {:<10} hits'.format(nHits))
printer.log(' {:<10} misses'.format(nMisses))
printer.log(' {}% effective\n'.format(round((nHits/max(1, nRequests)) * 100, 2)))
def show_kvs(title, kvs, printer):
'''
Pretty-print key-value pairs w/ a title and printer Object
'''
printer.log(title)
for k, v in kvs:
printer.log(' {:<40} {}'.format(k, v))
printer.log('')
class SmartCache(object):
'''
Cache object that profiles itself
'''
StaticCacheList = []
def __init__(self, decorating=(None, None)):
'''
Construct a smart cache object
Parameters
----------
decorating : tuple
module and function being decorated by the smart cache
'''
self.cache = dict()
self.ineffective = set()
self.decoratingModule, self.decoratingFn = decorating
self.customDigests = []
self.misses = Counter()
self.hits = Counter()
self.fhits = Counter()
self.requests = Counter()
self.ineffectiveRequests = Counter()
self.effectiveTimes = defaultdict(list)
self.ineffectiveTimes = defaultdict(list)
self.hashTimes = defaultdict(list)
self.callTimes = defaultdict(list)
self.typesigs = dict()
self.saved = 0
self.unpickleable = set()
SmartCache.StaticCacheList.append(self)
def __setstate__(self, d):
return self.__dict__.update(d)
def __getstate__(self):
d = dict(self.__dict__)
pickleableCache = dict()
for k, v in self.cache.items():
try:
_pickle.dumps(v)
pickleableCache[k] = v
except TypeError as e:
if isinstance(v,dict):
self.unpickleable.add(str(k[0]) + str(type(v)) + str(e) + str(list(v.keys())))
else:
self.unpickleable.add(str(k[0]) + str(type(v)) + str(e) + str(list(v.__dict__.keys())))
except _pickle.PicklingError as e:
self.unpickleable.add(str(k[0]) + str(type(v)) + str(e))
d['cache'] = pickleableCache
return d
def add_digest(self, custom):
'''
Add a "custom" digest function, used for hashing otherwise un-hashable
types.
Parameters
----------
custom : function
A hashing function, which takes two arguments: `md5` (a running MD5
hash) and `val` (the value to be hashed). It should call
`md5.update` to add to the running hash, and needn't return anything.
'''
self.customDigests.append(custom)
def low_overhead_cached_compute(self, fn, argVals, kwargs=None):
'''
Cached compute with less profiling:
see :method:`cached_compute` docstring
'''
if kwargs is None:
kwargs = dict()
name_key = get_fn_name_key(fn)
if name_key in self.ineffective:
key = 'NA'
result = fn(*argVals, **kwargs)
else:
times = dict()
with _timed_block('hash', times):
key = call_key(fn, (argVals, kwargs), self.customDigests) # cache by call key
if key not in self.cache:
with _timed_block('call', times):
self.cache[key] = fn(*argVals, **kwargs)
if times['hash'] > times['call']:
self.ineffective.add(name_key)
result = self.cache[key]
return key, result
def cached_compute(self, fn, argVals, kwargs=None):
'''
Shows effectiveness of a cache
Parameters
----------
fn : function
Cached function
argVals : tuple or list
Arguments to cached function
kwargs : dictionary
Keyword arguments to cached function
Returns
-------
result : result of fn called with argVals and kwargs
'''
if kwargs is None:
kwargs = dict()
name_key = get_fn_name_key(fn)
self.requests[name_key] += 1
if name_key in self.ineffective:
key = 'INEFFECTIVE'
result = fn(*argVals, **kwargs)
self.ineffectiveRequests[name_key] += 1
self.misses[key] += 1
else:
times = dict()
with _timed_block('hash', times):
key = call_key(fn, (argVals, kwargs), self.customDigests) # cache by call key
if key not in self.cache:
typesig = str(tuple(str(type(arg)) for arg in argVals)) + \
str({k : str(type(v)) for k, v in kwargs.items()})
self.typesigs[name_key] = typesig
with _timed_block('call', times):
self.cache[key] = fn(*argVals, **kwargs)
self.misses[key] += 1
hashtime = times['hash']
calltime = times['call']
if hashtime > calltime:
self.ineffective.add(name_key)
self.ineffectiveTimes[name_key].append(hashtime - calltime)
else:
self.effectiveTimes[name_key].append(calltime - hashtime)
self.hashTimes[name_key].append(hashtime)
self.callTimes[name_key].append(calltime)
else:
#print('The function {} experienced a cache hit'.format(name_key))
self.hits[key] += 1
self.fhits[name_key] += 1
result = self.cache[key]
return key, result
@staticmethod
def global_status(printer):
'''
Show the statuses of all Cache objects
'''
totalSaved = 0
totalHits = Counter()
totalMisses = Counter()
suggestRemove = set()
warnNoHits = set()
notCalled = set()
for cache in SmartCache.StaticCacheList:
cache.status(printer)
totalHits += cache.hits
totalMisses += cache.misses
totalSaved += cache.saved
fullname = '{}.{}'.format(cache.decoratingModule, cache.decoratingFn)
if cache.decoratingFn is not None and \
cache.decoratingFn in cache.ineffective:
suggestRemove.add(fullname)
if csize(cache.hits) == 0:
warnNoHits.add(fullname)
if csize(cache.requests) == 0:
notCalled.add(fullname)
with printer.verbosity_env(2):
printer.log('Average hash times by object:')
for k, v in sorted(DIGEST_TIMES.items(), key=lambda t : sum(t[1])):
total = sum(v)
avg = average(v)
printer.log(' {:<65} avg | {}s'.format(k, avg))
printer.log(' {:<65} tot | {}s'.format('', total))
printer.log('-'*100)
printer.log('\nBecause they take longer to hash than to calculate, \n' + \
'the following functions may be unmarked for caching:')
for name in suggestRemove:
printer.log(' {}'.format(name))
with printer.verbosity_env(2):
printer.log('\nThe following functions would provide a speedup, \n' + \
'but currently do not experience any cache hits:')
for name in warnNoHits:
printer.log(' {}'.format(name))
with printer.verbosity_env(4):
printer.log('\nThe following functions are not called:')
for name in notCalled:
printer.log(' {}'.format(name))
printer.log('\nGlobal cache overview:')
show_cache_percents(totalHits, totalMisses, printer)
printer.log(' {} seconds saved total'.format(totalSaved))
def avg_timedict(self, d):
""" Given a dictionary of lists of times (`d`), returns a dict of the
summed times. """
ret = dict()
for k, v in d.items():
if k not in self.fhits:
time = 0
else:
time = average(v) * len(v)
ret[k] = time
return ret
def status(self, printer):
'''
Show the status of a cache object instance
'''
printer.log('Status of smart cache decorating {}.{}:\n'.format(
self.decoratingModule, self.decoratingFn))
show_cache_percents(self.hits, self.misses, printer)
with printer.verbosity_env(2):
show_kvs('Most common requests:\n', self.requests.most_common(), printer)
show_kvs('Ineffective requests:\n', self.ineffectiveRequests.most_common(), printer)
show_kvs('Hits:\n', self.fhits.most_common(), printer)
printer.log('Type signatures of functions and their hash times:\n')
for k, v in self.typesigs.items():
avg = average(self.hashTimes[k])
printer.log(' {:<40} {}'.format(k, v))
printer.log(' {:<40} {}'.format(k, avg))
printer.log('')
printer.log('')
savedTimes = self.avg_timedict(self.effectiveTimes)
saved = sum(savedTimes.values())
show_kvs('Effective total saved time:\n',
sorted(savedTimes.items(), key=lambda t : t[1], reverse=True),
printer)
overTimes = self.avg_timedict(self.ineffectiveTimes)
overhead = sum(overTimes.values())
show_kvs('Ineffective differences:\n',
sorted(overTimes.items(), key=lambda t : t[1]),
printer)
printer.log('overhead : {}'.format(overhead))
printer.log('saved : {}'.format(saved))
printer.log('net benefit : {}'.format(saved - overhead))
self.saved = saved - overhead
printer.log(self.unpickleable)
def smart_cached(obj):
'''
Decorator for applying a smart cache to a single
function or method
'''
cache = obj.cache = SmartCache(decorating=(obj.__module__, obj.__name__))
@_functools.wraps(obj)
def _cacher(*args, **kwargs):
_, v = cache.cached_compute(obj, args, kwargs)
return v
return _cacher
class CustomDigestError(Exception):
""" Custom Digest Exception type """
pass
def digest(obj, custom_digests=None):
"""Returns an MD5 digest of an arbitary Python object, `obj`."""
if custom_digests is None:
custom_digests = []
#if _sys.version_info > (3, 0): # Python3?
# longT = int # define long and unicode
# unicodeT = str # types to mimic Python2
#else:
# longT = long
# unicodeT = unicode
# a function to recursively serialize 'v' into an md5 object
def add(md5, v):
"""Add `v` to the hash, recursively if needed."""
with _timed_block(str(type(v)), DIGEST_TIMES):
md5.update(str(type(v)).encode('utf-8'))
if isinstance(v, bytes):
md5.update(v) #can add bytes directly
else:
try:
md5.update(str(hash(v)).encode('utf-8'))
except TypeError: # as hashException:
if isinstance(v, _np.ndarray):
md5.update(v.tostring() + str(v.shape).encode('utf-8') ) # numpy gives us bytes
elif isinstance(v, (tuple, list)):
for el in v: add(md5,el)
elif isinstance(v, dict):
keys = list(v.keys())
for k in sorted(keys):
add(md5,k)
add(md5,v[k])
elif type(v).__module__ == 'mpi4py.MPI': # don't import mpi4py (not always available)
pass #don't hash comm objects
else:
for custom_digest in custom_digests:
try:
custom_digest(md5, v)
break
except CustomDigestError:
pass
else:
attribs = list(sorted(dir(v)))
for k in attribs:
if k.startswith('__'):
continue
a = getattr(v, k)
if _inspect.isroutine(a):
continue
add(md5,k)
add(md5,a)
return
M = _hashlib.md5()
add(M, obj)
return M.digest() #return native hash of the MD5 digest
def get_fn_name_key(fn):
""" Get the name (str) used to has the function `fn` """
name = fn.__name__
if hasattr(fn, '__self__'):
name = fn.__self__.__class__.__name__ + '.' + name
return name
def call_key(fn, args, custom_digests):
"""
Returns a hashable key for caching the result of a function call.
Parameters
----------
fn : function
The function itself
args : list or tuple
The function's arguments.
Returns
-------
tuple
"""
fnName = get_fn_name_key(fn)
inner_digest = _functools.partial(digest, custom_digests=custom_digests)
return (fnName,) + tuple(map(inner_digest,args))