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
|
;;; Software License Agreement (BSD License)
;;;
;;; Copyright (c) 2008, Abdulaziz Ghuloum.
;;; All rights reserved.
;;;
;;; Redistribution and use of this software in source and binary forms,
;;; with or without modification, are permitted provided that the
;;; following conditions are met:
;;;
;;; - Redistributions of source code must retain the above copyright
;;; notice, this list of conditions and the following disclaimer.
;;;
;;; - Redistributions in binary form must reproduce the above copyright
;;; notice, this list of conditions and the following disclaimer in
;;; the documentation and/or other materials provided with the
;;; distribution.
;;;
;;; - The name of the author may not be used to endorse or promote
;;; products derived from this software without specific prior written
;;; permission from the author.
;;;
;;; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
;;; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
;;; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
;;; FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
;;; COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
;;; INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
;;; BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
;;; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
;;; CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
;;; LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
;;; ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
;;; POSSIBILITY OF SUCH DAMAGE.
;;;
;;; hexdump utility for R6RS Scheme.
;;;
;;;
;;; Usage:
;;; (import (hexdump))
;;;
;;; (hexdump bytevector)
;;; dumps all bytes in bytevector
;;;
;;; (hexdump bytevector start-index)
;;; dumps bytevector from start-index to the end of the bytevector
;;;
;;; (hexdump bytevector start-index count)
;;; dumps count bytes bytevector starting from start-index
;;;
(library (hexdump)
(export hexdump)
(import (rnrs))
(define line-width 16)
(define hex-string "0123456789ABCDEF")
(define D display)
(define (dump-hex-bytes i n)
(unless (= n 0)
(dump-hex-bytes (div i 16) (- n 1))
(D (string-ref hex-string (mod i 16)))))
(define (dump-line-number i)
(D "0x")
(dump-hex-bytes i 8)
(D " "))
(define (dump-data bv i j)
(unless (= i j)
(D " ")
(dump-hex-bytes (bytevector-u8-ref bv i) 2)
(dump-data bv (+ i 1) j)))
(define (dump-chars bv i j)
(unless (= i j)
(let ([n (bytevector-u8-ref bv i)])
(cond
[(<= (char->integer #\!) n (char->integer #\~))
(D (integer->char n))]
[else (D ".")]))
(dump-chars bv (+ i 1) j)))
(define (dump-empty n)
(unless (zero? n)
(D " ")
(dump-empty (- n 1))))
(define (dump-line bv i k)
(dump-line-number i)
(let ([j (+ i line-width)])
(let ([m (min j k)])
(dump-data bv i m)
(dump-empty (* (- j m) 3))
(D " | ")
(dump-chars bv i m)
(dump-empty (- j m))
(D " |\n")
m)))
(define (dump bv i j)
(unless (= i j)
(dump bv (dump-line bv i j) j)))
;;; interface
(define-syntax check
(syntax-rules ()
[(_ p? arg* ...)
(unless (p? arg* ...)
(error 'hexdump "failed test" '(p? arg* ...)))]))
(define (non-negative? x) (>= x 0))
(define (in-range? i bv) (< i (bytevector-length bv)))
(define hexdump
(case-lambda
[(bv)
(check bytevector? bv)
(dump bv 0 (bytevector-length bv))]
[(bv start-index)
(check bytevector? bv)
(check fixnum? start-index)
(check non-negative? start-index)
(check in-range? start-index bv)
(dump bv start-index (bytevector-length bv))]
[(bv start-index byte-count)
(check bytevector? bv)
(check fixnum? start-index)
(check fixnum? byte-count)
(check non-negative? start-index)
(check non-negative? byte-count)
(check in-range? start-index bv)
(check in-range? (+ start-index byte-count -1) bv)
(dump bv start-index (+ start-index byte-count))])))
|