-
Notifications
You must be signed in to change notification settings - Fork 29
/
utilities.lisp
483 lines (412 loc) · 16.5 KB
/
utilities.lisp
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
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
(in-package :graph-db)
(defun dbg (fmt &rest args)
(apply #'format t fmt args)
(terpri))
(defun ignore-warning (condition)
(declare (ignore condition))
(muffle-warning))
(defun get-random-bytes (&optional (count 16))
(with-open-file (in "/dev/urandom" :direction :input :element-type '(unsigned-byte 8))
(let ((bytes (make-byte-vector count)))
(dotimes (i count)
(setf (aref bytes i) (read-byte in)))
bytes)))
(defun print-byte-array (stream array
&optional colon amp (delimiter #\Space))
(declare (ignore colon amp delimiter))
(loop
:for x :across array
:do (format stream "~A" (code-char x))))
#+lispworks
(fli:define-c-struct timeval
(tv-sec time-t)
(tv-usec suseconds-t))
#+lispworks(fli:define-c-typedef time-t :long)
#+lispworks(fli:define-c-typedef suseconds-t #+linux :long #+darwin :int)
#+lispworks(fli:define-foreign-function (gettimeofday/ffi "gettimeofday")
((tv (:pointer (:struct timeval)))
(tz :pointer))
:result-type :int)
(defun gettimeofday ()
#+sbcl
(multiple-value-bind (sec msec) (sb-ext:get-time-of-day)
(+ sec (/ msec 1000000)))
#+(and ccl (not windows))
(ccl:rlet ((tv :timeval))
(let ((err (ccl:external-call "gettimeofday" :address tv :address (ccl:%null-ptr) :int)))
(assert (zerop err) nil "gettimeofday failed")
(values (ccl:pref tv :timeval.tv_sec)
(ccl:pref tv :timeval.tv_usec))))
#+lispworks
(fli:with-dynamic-foreign-objects ((tv (:struct timeval)))
(let ((ret (gettimeofday/ffi tv fli:*null-pointer*)))
(assert (zerop ret) nil "gettimeofday failed")
(let ((secs
(fli:foreign-slot-value tv 'tv-sec
:type 'time-t
:object-type '(:struct timeval)))
(usecs
(fli:foreign-slot-value tv 'tv-usec
:type 'suseconds-t
:object-type '(:struct timeval))))
(values secs (* 1000 usecs))))))
(defvar *unix-epoch-difference*
(encode-universal-time 0 0 0 1 1 1970 0))
(defun universal-to-unix-time (universal-time)
(- universal-time *unix-epoch-difference*))
(defun unix-to-universal-time (unix-time)
(+ unix-time *unix-epoch-difference*))
(defun get-unix-time ()
(universal-to-unix-time (get-universal-time)))
(defun line-count (file)
(with-open-file (in file)
(loop
for x from 0
for line = (read-line in nil :eof)
until (eql line :eof)
finally (return x))))
(defun last1 (lst)
(first (last lst)))
(defun flatten (x)
(labels ((rec (x acc)
(cond ((null x) acc)
((atom x) (cons x acc))
(t (rec (car x) (rec (cdr x) acc))))))
(rec x nil)))
(defun continue-p ()
"Ask user if we should continue looking for solutions."
(case (read-char)
(#\; t)
(#\. nil)
(#\newline (continue-p))
(otherwise
(format t " Type ; to see more or . to stop")
(continue-p))))
(defun reuse-cons (x y x-y)
"Return (cons x y), or reuse x-y if it is equal to (cons x y)"
(if (and (eql x (car x-y)) (eql y (cdr x-y)))
x-y
(cons x y)))
(defun find-all (item sequence &rest keyword-args
&key (test #'eql) test-not &allow-other-keys)
"Find all those elements of sequence that match item,
according to the keywords. Doesn't alter sequence."
(if test-not
(apply #'remove item sequence
:test-not (complement test-not) keyword-args)
(apply #'remove item sequence
:test (complement test) keyword-args)))
(defun find-anywhere (item tree)
"Does item occur anywhere in tree? If so, return it."
(cond ((eql item tree) tree)
((atom tree) nil)
((find-anywhere item (first tree)))
((find-anywhere item (rest tree)))))
(defun find-if-anywhere (predicate tree)
"Does predicate apply to any atom in the tree?"
(if (atom tree)
(funcall predicate tree)
(or (find-if-anywhere predicate (first tree))
(find-if-anywhere predicate (rest tree)))))
(defun unique-find-anywhere-if (predicate tree &optional found-so-far)
"return a list of leaves of tree satisfying predicate, with duplicates removed."
(if (atom tree)
(if (funcall predicate tree)
(adjoin tree found-so-far)
found-so-far)
(unique-find-anywhere-if
predicate
(first tree)
(unique-find-anywhere-if predicate (rest tree) found-so-far))))
(defun length=1 (list)
"Is this a list of exactly one element?"
(and (consp list) (null (cdr list))))
(defun new-interned-symbol (&rest args)
"Concatenate symbols or strings to form an interned symbol"
(intern (format nil "~{~a~}" args)))
(defun gen-id ()
(uuid:uuid-to-byte-array (uuid:make-v4-uuid)))
(defun parse-uuid-block (string start end)
(parse-integer string :start start :end end :radix 16))
(defun read-uuid-from-string (string)
"Creates an uuid from the string represenation of an uuid. (example input string
6ba7b810-9dad11d180b400c04fd430c8)"
(setq string (remove #\- string))
(unless (= (length string) 32)
(error "~@<Could not parse ~S as UUID: string representation ~
has invalid length (~D). A valid UUID string representation has 32 ~
characters.~@:>" string (length string)))
(make-instance 'uuid:uuid
:time-low (parse-uuid-block string 0 8)
:time-mid (parse-uuid-block string 8 12)
:time-high (parse-uuid-block string 12 16)
:clock-seq-var (parse-uuid-block string 16 18)
:clock-seq-low (parse-uuid-block string 18 20)
:node (parse-uuid-block string 20 32)))
(defun read-id-array-from-string (string)
(let ((array (make-array 16 :element-type '(unsigned-byte 8))))
(loop for i from 3 downto 0
do (setf (aref array (- 3 i))
(ldb (byte 8 (* 8 i)) (parse-uuid-block string 0 8))))
(loop for i from 5 downto 4
do (setf (aref array i)
(ldb (byte 8 (* 8 (- 5 i))) (parse-uuid-block string 8 12))))
(loop for i from 7 downto 6
do (setf (aref array i)
(ldb (byte 8 (* 8 (- 7 i))) (parse-uuid-block string 12 16))))
(setf (aref array 8) (ldb (byte 8 0) (parse-uuid-block string 16 18)))
(setf (aref array 9) (ldb (byte 8 0) (parse-uuid-block string 18 20)))
(loop for i from 15 downto 10
do (setf (aref array i)
(ldb (byte 8 (* 8 (- 15 i))) (parse-uuid-block string 20 32))))
array))
(defun free-memory ()
#+sbcl
(- (sb-kernel::dynamic-space-size) (sb-kernel:dynamic-usage))
;; TODO: LispWorks
#+ccl
(ccl::%freebytes))
(defun djb-hash (seq)
;; Not used
(unless (typep seq 'sequence)
(setq seq (format nil "~A" seq)))
(let ((hash 5381))
(dotimes (i (length seq))
(let ((item (elt seq i)))
(typecase item
(integer nil)
(character (setq item (char-code item)))
(float (setq item (truncate item)))
(otherwise (setq item 1)))
(setf hash (+ (+ hash (ash hash -5)) item))))
hash))
(defun fast-djb-hash (seq)
;; Not used
(let ((hash 5381))
(dotimes (i (length seq))
(setf hash (+ (+ hash (ash hash -5)) (elt seq i))))
hash))
(defun proper-listp (x)
"Is x a proper (non-dotted) list?"
(or (null x)
(and (consp x) (proper-listp (rest x)))))
(defun make-byte-vector (length)
(make-array `(,length) :element-type '(unsigned-byte 8) :initial-element 0))
(defmacro with-gensyms (syms &body body)
`(let ,(loop for s in syms collect `(,s (gensym)))
,@body))
(defun dump-hash (hash)
(loop for k being the hash-keys in hash using (hash-value v)
do (dbg "~S:~% ~S" k v)))
(defgeneric less-than (x y)
(:documentation
"Generic less-than operator. Allows comparison of apples and oranges.")
;; Sentinels for generic skip lists
(:method ((x (eql +min-sentinel+)) y) t)
(:method ((x (eql +max-sentinel+)) y) nil)
(:method ((x (eql +min-sentinel+)) (y number)) t)
(:method ((x (eql +min-sentinel+)) (y symbol)) t)
(:method ((x (eql +min-sentinel+)) (y (eql t))) t)
(:method ((x (eql +min-sentinel+)) (y null)) t)
(:method ((x (eql +min-sentinel+)) (y list)) t)
(:method ((x number) (y (eql +min-sentinel+))) nil)
(:method ((x symbol) (y (eql +min-sentinel+))) nil)
(:method ((x (eql t)) (y (eql +min-sentinel+))) nil)
(:method ((x null) (y (eql +min-sentinel+))) nil)
(:method ((x list) (y (eql +min-sentinel+))) nil)
(:method ((x (eql +max-sentinel+)) (y number)) nil)
(:method ((x (eql +max-sentinel+)) (y symbol)) nil)
(:method ((x (eql +max-sentinel+)) (y string)) nil)
(:method ((x (eql +max-sentinel+)) (y (eql t))) nil)
(:method ((x (eql +max-sentinel+)) (y null)) nil)
(:method ((x (eql +max-sentinel+)) (y list)) nil)
(:method ((x number) (y (eql +max-sentinel+))) t)
(:method ((x symbol) (y (eql +max-sentinel+))) t)
(:method ((x string) (y (eql +max-sentinel+))) t)
(:method ((x (eql t)) (y (eql +max-sentinel+))) t)
(:method ((x null) (y (eql +max-sentinel+))) t)
(:method ((x list) (y (eql +max-sentinel+))) t)
(:method ((x (eql t)) (y null)) nil)
(:method ((x null) (y (eql t))) t)
(:method ((x (eql t)) y) t)
(:method ((x null) y) t)
(:method ((x symbol) (y symbol)) (string< (symbol-name x) (symbol-name y)))
(:method ((x string) (y string)) (string< x y))
(:method ((x number) (y number)) (< x y))
(:method ((x timestamp) (y timestamp)) (timestamp< x y))
(:method ((x uuid:uuid) (y uuid:uuid)) (string<
(uuid:print-bytes nil x)
(uuid:print-bytes nil y)))
(:method ((x list) (y list)) (or (less-than (car x) (car y))
(and (equal (car x) (car y))
(less-than (cdr x) (cdr y)))))
(:method ((x list) y) t)
(:method (x (y list)) nil)
(:method ((x number) y) t)
(:method ((x number) (y (eql t))) nil)
(:method ((x number) (y null)) nil)
(:method (x (y number)) nil)
(:method ((x string) (y symbol)) nil)
(:method ((x symbol) (y string)) t)
(:method ((x symbol) (y timestamp)) nil)
(:method ((x timestamp) (y symbol)) t)
(:method ((x symbol) (y uuid:uuid)) nil)
(:method ((x uuid:uuid) (y symbol)) t)
(:method ((x string) (y timestamp)) nil)
(:method ((x timestamp) (y string)) t)
(:method ((x string) (y uuid:uuid)) nil)
(:method ((x uuid:uuid) (y string)) t)
(:method ((x uuid:uuid) (y timestamp)) nil)
(:method ((x timestamp) (y uuid:uuid)) t))
(defun key-vector< (v1 v2)
(cond ((= (array-dimension v1 0) 0)
nil)
((< (aref v1 0) (aref v2 0))
t)
((= (aref v1 0) (aref v2 0))
(key-vector< (subseq v1 1) (subseq v2 1)))
(t
nil)))
(defun key-vector<= (v1 v2)
(cond ((= (array-dimension v1 0) 0)
t)
((< (aref v1 0) (aref v2 0))
t)
((= (aref v1 0) (aref v2 0))
(key-vector<= (subseq v1 1) (subseq v2 1)))
(t
nil)))
(defgeneric greater-than (x y)
(:documentation
"Generic greater-than operator. Allows comparison of apples and oranges.")
;; Sentinels for generic skip lists
(:method ((x (eql +min-sentinel+)) y) nil)
(:method ((x (eql +max-sentinel+)) y) t)
(:method ((x (eql +min-sentinel+)) (y number)) nil)
(:method ((x (eql +min-sentinel+)) (y symbol)) nil)
(:method ((x (eql +min-sentinel+)) (y (eql t))) nil)
(:method ((x (eql +min-sentinel+)) (y null)) nil)
(:method ((x (eql +min-sentinel+)) (y list)) nil)
(:method ((x number) (y (eql +min-sentinel+))) t)
(:method ((x symbol) (y (eql +min-sentinel+))) t)
(:method ((x (eql t)) (y (eql +min-sentinel+))) t)
(:method ((x null) (y (eql +min-sentinel+))) t)
(:method ((x list) (y (eql +min-sentinel+))) t)
(:method ((x (eql +max-sentinel+)) (y number)) t)
(:method ((x (eql +max-sentinel+)) (y symbol)) t)
(:method ((x (eql +max-sentinel+)) (y string)) t)
(:method ((x (eql +max-sentinel+)) (y (eql t))) t)
(:method ((x (eql +max-sentinel+)) (y null)) t)
(:method ((x (eql +max-sentinel+)) (y list)) t)
(:method ((x number) (y (eql +max-sentinel+))) nil)
(:method ((x symbol) (y (eql +max-sentinel+))) nil)
(:method ((x string) (y (eql +max-sentinel+))) nil)
(:method ((x (eql t)) (y (eql +max-sentinel+))) nil)
(:method ((x null) (y (eql +max-sentinel+))) nil)
(:method ((x list) (y (eql +max-sentinel+))) nil)
(:method ((x (eql t)) (y null)) t)
(:method ((x null) (y (eql t))) nil)
(:method ((x (eql t)) y) nil)
(:method ((x null) y) nil)
(:method ((x symbol) (y symbol)) (string> (symbol-name x) (symbol-name y)))
(:method ((x string) (y string)) (string> x y))
(:method ((x number) (y number)) (> x y))
(:method ((x timestamp) (y timestamp)) (timestamp> x y))
(:method ((x uuid:uuid) (y uuid:uuid)) (string>
(uuid:print-bytes nil x)
(uuid:print-bytes nil y)))
(:method ((x list) (y list)) (or (greater-than (car x) (car y))
(and (equal (car x) (car y))
(greater-than (cdr x) (cdr y)))))
(:method ((x list) y) nil)
(:method (x (y list)) t)
(:method ((x number) y) nil)
(:method ((x number) (y (eql t))) t)
(:method ((x number) (y null)) t)
(:method (x (y number)) t)
(:method ((x string) (y symbol)) t)
(:method ((x symbol) (y string)) nil)
(:method ((x symbol) (y timestamp)) t)
(:method ((x timestamp) (y symbol)) nil)
(:method ((x symbol) (y uuid:uuid)) t)
(:method ((x uuid:uuid) (y symbol)) nil)
(:method ((x string) (y timestamp)) t)
(:method ((x timestamp) (y string)) nil)
(:method ((x string) (y uuid:uuid)) t)
(:method ((x uuid:uuid) (y string)) nil)
(:method ((x uuid:uuid) (y timestamp)) t)
(:method ((x timestamp) (y uuid:uuid)) nil))
(defun key-vector> (v1 v2)
(cond ((= (array-dimension v1 0) 0)
nil)
((> (aref v1 0) (aref v2 0))
t)
((= (aref v1 0) (aref v2 0))
(key-vector> (subseq v1 1) (subseq v2 1)))
(t
nil)))
#+ccl
(defun do-grab-lock-with-timeout (lock whostate timeout)
(if timeout
(or (ccl:try-lock lock)
(ccl:process-wait-with-timeout whostate
(round
(* timeout ccl:*ticks-per-second*))
#'ccl:try-lock (list lock)))
(ccl:grab-lock lock)))
#+ccl
(defun do-with-lock (lock whostate timeout fn)
(if timeout
(and
(do-grab-lock-with-timeout lock whostate timeout)
(unwind-protect
(funcall fn)
(ccl:release-lock lock)))
(ccl:with-lock-grabbed (lock) (funcall fn))))
(defmacro with-lock ((lock &key whostate timeout) &body body)
"Wait for lock available, then execute the body while holding the lock."
#+ccl
`(do-with-lock ,lock ,whostate ,timeout (lambda () ,@body))
#+lispworks
`(mp:with-lock (,lock) ,@body)
#+sbcl
`(sb-thread:with-recursive-lock (,lock)
(progn ,@body)))
(defun make-semaphore ()
#+sbcl (sb-thread:make-semaphore)
#+lispworks(mp:make-semaphore)
#+ccl (ccl:make-semaphore))
(defmacro with-locked-hash-table ((table) &body body)
#+lispworks
`(progn ,@body)
#+ccl
`(progn ,@body)
#+sbcl
`(sb-ext:with-locked-hash-table (,table)
(progn ,@body)))
#+ccl
(defmacro with-read-lock ((lock) &body body)
`(ccl:with-read-lock (,lock)
(progn ,@body)))
#+ccl
(defmacro with-write-lock ((lock) &body body)
`(ccl:with-write-lock (,lock)
(progn ,@body)))
#+ccl
(defun make-rw-lock ()
(ccl:make-read-write-lock))
#+ccl
(defun rw-lock-p (thing)
(ccl::read-write-lock-p thing))
#+ccl
(defun acquire-write-lock (lock &key wait-p)
(declare (ignore wait-p))
(let ((locked (ccl:make-lock-acquisition)))
(declare (dynamic-extent locked))
(ccl::write-lock-rwlock lock locked)
(when (ccl::lock-acquisition.status locked)
lock)))
#+ccl
(defun release-write-lock (lock)
(declare (ignore wait-p))
(ccl::unlock-rwlock lock))