Linux ip-172-26-7-228 5.4.0-1103-aws #111~18.04.1-Ubuntu SMP Tue May 23 20:04:10 UTC 2023 x86_64
Apache
: 172.26.7.228 | : 3.15.3.153
Cant Read [ /etc/named.conf ]
5.6.40-24+ubuntu18.04.1+deb.sury.org+1
www-data
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
home /
ubuntu /
ImageMagick-7.0.10-22 /
MagickCore /
[ HOME SHELL ]
Name
Size
Permission
Action
.deps
[ DIR ]
drwxrwxr-x
.libs
[ DIR ]
drwxrwxr-x
.dirstamp
0
B
-rw-rw-r--
ImageMagick-7.Q16HDRI.pc
867
B
-rw-rw-r--
ImageMagick.pc
867
B
-rw-rw-r--
ImageMagick.pc.in
575
B
-rw-rw-r--
MagickCore-7.Q16HDRI.pc
916
B
-rw-rw-r--
MagickCore-config
1.5
KB
-rwxrwxr-x
MagickCore-config.1
1.85
KB
-rw-rw-r--
MagickCore-config.in
1.57
KB
-rw-rw-r--
MagickCore.h
4.94
KB
-rw-rw-r--
MagickCore.pc
916
B
-rw-rw-r--
MagickCore.pc.in
688
B
-rw-rw-r--
Makefile.am
14.76
KB
-rw-rw-r--
accelerate-kernels-private.h
102.16
KB
-rw-rw-r--
accelerate-private.h
2.63
KB
-rw-rw-r--
accelerate.c
169.72
KB
-rw-rw-r--
animate-private.h
1.23
KB
-rw-rw-r--
animate.c
103.29
KB
-rw-rw-r--
animate.h
979
B
-rw-rw-r--
annotate-private.h
1022
B
-rw-rw-r--
annotate.c
71.69
KB
-rw-rw-r--
annotate.h
1.26
KB
-rw-rw-r--
artifact.c
18.74
KB
-rw-rw-r--
artifact.h
1.35
KB
-rw-rw-r--
attribute.c
69.33
KB
-rw-rw-r--
attribute.h
1.78
KB
-rw-rw-r--
blob-private.h
4.07
KB
-rw-rw-r--
blob.c
207.68
KB
-rw-rw-r--
blob.h
3.29
KB
-rw-rw-r--
cache-private.h
6.63
KB
-rw-rw-r--
cache-view.c
44.83
KB
-rw-rw-r--
cache-view.h
3.63
KB
-rw-rw-r--
cache.c
211.11
KB
-rw-rw-r--
cache.h
2.5
KB
-rw-rw-r--
channel.c
41.69
KB
-rw-rw-r--
channel.h
1.28
KB
-rw-rw-r--
cipher.c
40.58
KB
-rw-rw-r--
cipher.h
1.11
KB
-rw-rw-r--
client.c
7.37
KB
-rw-rw-r--
client.h
1.03
KB
-rw-rw-r--
coder-private.h
1005
B
-rw-rw-r--
coder.c
20.03
KB
-rw-rw-r--
coder.h
1.28
KB
-rw-rw-r--
color-private.h
2.28
KB
-rw-rw-r--
color.c
105.5
KB
-rw-rw-r--
color.h
2.22
KB
-rw-rw-r--
colormap-private.h
1.8
KB
-rw-rw-r--
colormap.c
13.3
KB
-rw-rw-r--
colormap.h
1.05
KB
-rw-rw-r--
colorspace-private.h
4.23
KB
-rw-rw-r--
colorspace.c
99.03
KB
-rw-rw-r--
colorspace.h
2.35
KB
-rw-rw-r--
compare.c
72.32
KB
-rw-rw-r--
compare.h
1.86
KB
-rw-rw-r--
composite-private.h
5.5
KB
-rw-rw-r--
composite.c
81.18
KB
-rw-rw-r--
composite.h
2.85
KB
-rw-rw-r--
compress.c
39.93
KB
-rw-rw-r--
compress.h
2.15
KB
-rw-rw-r--
configure-private.h
1019
B
-rw-rw-r--
configure.c
44.68
KB
-rw-rw-r--
configure.h
1.65
KB
-rw-rw-r--
constitute-private.h
890
B
-rw-rw-r--
constitute.c
50.54
KB
-rw-rw-r--
constitute.h
1.45
KB
-rw-rw-r--
decorate.c
31.1
KB
-rw-rw-r--
decorate.h
1.34
KB
-rw-rw-r--
delegate-private.h
2.16
KB
-rw-rw-r--
delegate.c
83.77
KB
-rw-rw-r--
delegate.h
1.98
KB
-rw-rw-r--
deprecate.c
13.45
KB
-rw-rw-r--
deprecate.h
1.21
KB
-rw-rw-r--
display-private.h
1.24
KB
-rw-rw-r--
display.c
515.56
KB
-rw-rw-r--
display.h
1.05
KB
-rw-rw-r--
distort.c
134.29
KB
-rw-rw-r--
distort.h
2.65
KB
-rw-rw-r--
distribute-cache-private.h
2.24
KB
-rw-rw-r--
distribute-cache.c
49.1
KB
-rw-rw-r--
distribute-cache.h
997
B
-rw-rw-r--
draw-private.h
2.1
KB
-rw-rw-r--
draw.c
245.29
KB
-rw-rw-r--
draw.h
5.55
KB
-rw-rw-r--
effect.c
125.86
KB
-rw-rw-r--
effect.h
2.85
KB
-rw-rw-r--
enhance.c
137.51
KB
-rw-rw-r--
enhance.h
2.32
KB
-rw-rw-r--
exception-private.h
3.18
KB
-rw-rw-r--
exception.c
44.49
KB
-rw-rw-r--
exception.h
4.35
KB
-rw-rw-r--
feature.c
83.79
KB
-rw-rw-r--
feature.h
1.7
KB
-rw-rw-r--
fourier.c
49.36
KB
-rw-rw-r--
fourier.h
1.38
KB
-rw-rw-r--
fx-private.h
1.21
KB
-rw-rw-r--
fx.c
87.87
KB
-rw-rw-r--
fx.h
956
B
-rw-rw-r--
gem-private.h
6.28
KB
-rw-rw-r--
gem.c
53.31
KB
-rw-rw-r--
gem.h
1.15
KB
-rw-rw-r--
geometry.c
55.44
KB
-rw-rw-r--
geometry.h
3.98
KB
-rw-rw-r--
histogram.c
39.72
KB
-rw-rw-r--
histogram.h
1.35
KB
-rw-rw-r--
identify.c
57.07
KB
-rw-rw-r--
identify.h
971
B
-rw-rw-r--
image-private.h
2.89
KB
-rw-rw-r--
image-view.c
42.98
KB
-rw-rw-r--
image-view.h
2.72
KB
-rw-rw-r--
image.c
142.86
KB
-rw-rw-r--
image.h
13.87
KB
-rw-rw-r--
layer.c
75.49
KB
-rw-rw-r--
layer.h
2
KB
-rw-rw-r--
libMagickCore-7.Q16HDRI.la
1.32
KB
-rw-rw-r--
libMagickCore.map
46
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-acc...
374
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-acc...
6.25
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ani...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ani...
245.7
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ann...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ann...
225.34
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-art...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-art...
57.34
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-att...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-att...
198.58
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-blo...
356
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-blo...
559.89
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cac...
374
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cac...
130.77
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cac...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cac...
575.03
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cha...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cha...
132.27
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cip...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cip...
99.63
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cli...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cli...
11.99
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cod...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-cod...
48.66
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-col...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-col...
187.05
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-col...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-col...
64.29
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-col...
374
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-col...
416.23
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-com...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-com...
244.2
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-com...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-com...
205.62
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-com...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-com...
116.91
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-con...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-con...
92.49
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-con...
374
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-con...
134.21
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dec...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dec...
140.39
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-del...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-del...
181.88
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dep...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dep...
40.1
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dis...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dis...
1001.06
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dis...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dis...
257.94
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dis...
392
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dis...
138.98
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dra...
356
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-dra...
629.21
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-eff...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-eff...
359.09
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-enh...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-enh...
435.72
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-exc...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-exc...
79.98
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-fea...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-fea...
231.75
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-fou...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-fou...
147.25
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-fx....
350
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-fx....
285.02
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-gem...
353
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-gem...
222.46
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-geo...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-geo...
111.41
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-his...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-his...
103.51
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ide...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ide...
183.14
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ima...
374
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ima...
103.35
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ima...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ima...
311.29
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-lay...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-lay...
140.62
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-lin...
377
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-lin...
41.23
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-lis...
356
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-lis...
137.44
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-loc...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-loc...
93.1
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-log...
353
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-log...
109.05
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mag...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mag...
54.52
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mag...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mag...
123.44
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mat...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mat...
90.06
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mem...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mem...
64.4
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mim...
356
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mim...
69.73
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mod...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mod...
46.27
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mon...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mon...
37.7
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mon...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mon...
102.55
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mor...
374
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-mor...
249.84
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ope...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ope...
14.32
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-opt...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-opt...
238.09
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pai...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pai...
158.05
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pix...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pix...
1.12
MB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pol...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pol...
84.46
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pre...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pre...
50.55
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pro...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pro...
178.05
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pro...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-pro...
375.58
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-qua...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-qua...
308.11
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-qua...
386
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-qua...
886.72
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-qua...
386
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-qua...
690.47
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-qua...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-qua...
93.22
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ran...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ran...
71.95
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-reg...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-reg...
58.8
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-res...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-res...
101.68
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-res...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-res...
484.14
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-res...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-res...
130.89
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-seg...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-seg...
137.09
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-sem...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-sem...
27.5
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-she...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-she...
209.97
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-sig...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-sig...
77.59
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-spl...
374
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-spl...
71.54
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-sta...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-sta...
42.69
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-sta...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-sta...
361.96
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-str...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-str...
389.89
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-str...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-str...
145.78
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-thr...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-thr...
9.66
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-thr...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-thr...
223.15
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-tim...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-tim...
38.76
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-tok...
359
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-tok...
220.66
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-tra...
371
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-tra...
228.2
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-typ...
356
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-typ...
88.52
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-uti...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-uti...
121.42
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ver...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-ver...
27.84
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-vis...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-vis...
161.29
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-vis...
386
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-vis...
490.88
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-wid...
362
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-wid...
450.54
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-xml...
368
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-xml...
166.75
KB
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-xwi...
365
B
-rw-rw-r--
libMagickCore_7_Q16HDRI_la-xwi...
641.91
KB
-rw-rw-r--
linked-list.c
33.55
KB
-rw-rw-r--
linked-list.h
1.92
KB
-rw-rw-r--
list.c
52.79
KB
-rw-rw-r--
list.h
2.3
KB
-rw-rw-r--
locale-private.h
1.35
KB
-rw-rw-r--
locale.c
58.89
KB
-rw-rw-r--
locale_.h
2.2
KB
-rw-rw-r--
log-private.h
1
KB
-rw-rw-r--
log.c
56.53
KB
-rw-rw-r--
log.h
2.73
KB
-rw-rw-r--
magic-private.h
999
B
-rw-rw-r--
magic.c
27.52
KB
-rw-rw-r--
magic.h
1.32
KB
-rw-rw-r--
magick-baseconfig.h
44.5
KB
-rw-rw-r--
magick-config.h
8.75
KB
-rw-rw-r--
magick-private.h
1.04
KB
-rw-rw-r--
magick-type.h
5.78
KB
-rw-rw-r--
magick.c
66.91
KB
-rw-rw-r--
magick.h
4.18
KB
-rw-rw-r--
matrix-private.h
1.1
KB
-rw-rw-r--
matrix.c
38.14
KB
-rw-rw-r--
matrix.h
1.53
KB
-rw-rw-r--
memory-private.h
1.49
KB
-rw-rw-r--
memory.c
51.43
KB
-rw-rw-r--
memory_.h
3.24
KB
-rw-rw-r--
method-attribute.h
4.03
KB
-rw-rw-r--
methods-private.h
0
B
-rw-rw-r--
methods.h
79.51
KB
-rw-rw-r--
mime-private.h
1.07
KB
-rw-rw-r--
mime.c
35.56
KB
-rw-rw-r--
mime.h
1.38
KB
-rw-rw-r--
module-private.h
1.05
KB
-rw-rw-r--
module.c
56.79
KB
-rw-rw-r--
module.h
1.99
KB
-rw-rw-r--
monitor-private.h
1023
B
-rw-rw-r--
monitor.c
10.83
KB
-rw-rw-r--
monitor.h
1.56
KB
-rw-rw-r--
montage.c
32.5
KB
-rw-rw-r--
montage.h
1.78
KB
-rw-rw-r--
morphology-private.h
1.17
KB
-rw-rw-r--
morphology.c
177.3
KB
-rw-rw-r--
morphology.h
4.45
KB
-rw-rw-r--
mutex.h
3.03
KB
-rw-rw-r--
nt-base-private.h
3.26
KB
-rw-rw-r--
nt-base.c
90.09
KB
-rw-rw-r--
nt-base.h
8.03
KB
-rw-rw-r--
nt-feature.c
13.72
KB
-rw-rw-r--
nt-feature.h
1.11
KB
-rw-rw-r--
opencl-private.h
14.79
KB
-rw-rw-r--
opencl.c
104.16
KB
-rw-rw-r--
opencl.h
1.98
KB
-rw-rw-r--
option-private.h
872
B
-rw-rw-r--
option.c
168.81
KB
-rw-rw-r--
option.h
6.26
KB
-rw-rw-r--
paint.c
42.91
KB
-rw-rw-r--
paint.h
1.62
KB
-rw-rw-r--
pixel-accessor.h
28.36
KB
-rw-rw-r--
pixel-private.h
869
B
-rw-rw-r--
pixel.c
202.86
KB
-rw-rw-r--
pixel.h
7.18
KB
-rw-rw-r--
policy-private.h
1.22
KB
-rw-rw-r--
policy.c
41.97
KB
-rw-rw-r--
policy.h
1.88
KB
-rw-rw-r--
prepress.c
6.08
KB
-rw-rw-r--
prepress.h
939
B
-rw-rw-r--
profile-private.h
984
B
-rw-rw-r--
profile.c
85.4
KB
-rw-rw-r--
profile.h
1.64
KB
-rw-rw-r--
property.c
148.71
KB
-rw-rw-r--
property.h
1.66
KB
-rw-rw-r--
quantize.c
133.36
KB
-rw-rw-r--
quantize.h
2.05
KB
-rw-rw-r--
quantum-export.c
124.46
KB
-rw-rw-r--
quantum-import.c
145.28
KB
-rw-rw-r--
quantum-private.h
19.37
KB
-rw-rw-r--
quantum.c
38.9
KB
-rw-rw-r--
quantum.h
5.1
KB
-rw-rw-r--
random-private.h
2.16
KB
-rw-rw-r--
random.c
33.01
KB
-rw-rw-r--
random_.h
1.49
KB
-rw-rw-r--
registry-private.h
1014
B
-rw-rw-r--
registry.c
18.63
KB
-rw-rw-r--
registry.h
1.41
KB
-rw-rw-r--
resample-private.h
2.21
KB
-rw-rw-r--
resample.c
56.74
KB
-rw-rw-r--
resample.h
2.72
KB
-rw-rw-r--
resize-private.h
2.02
KB
-rw-rw-r--
resize.c
149.98
KB
-rw-rw-r--
resize.h
1.71
KB
-rw-rw-r--
resource-private.h
1.11
KB
-rw-rw-r--
resource.c
47.74
KB
-rw-rw-r--
resource_.h
1.69
KB
-rw-rw-r--
segment.c
60.41
KB
-rw-rw-r--
segment.h
1.09
KB
-rw-rw-r--
semaphore-private.h
1009
B
-rw-rw-r--
semaphore.c
16.58
KB
-rw-rw-r--
semaphore.h
1.15
KB
-rw-rw-r--
shear.c
56.66
KB
-rw-rw-r--
shear.h
1.11
KB
-rw-rw-r--
signature-private.h
1.5
KB
-rw-rw-r--
signature.c
28.84
KB
-rw-rw-r--
signature.h
947
B
-rw-rw-r--
splay-tree.c
54.92
KB
-rw-rw-r--
splay-tree.h
1.98
KB
-rw-rw-r--
static.c
13.23
KB
-rw-rw-r--
static.h
10.11
KB
-rw-rw-r--
statistic.c
91.04
KB
-rw-rw-r--
statistic.h
4.25
KB
-rw-rw-r--
stream-private.h
1.04
KB
-rw-rw-r--
stream.c
97.33
KB
-rw-rw-r--
stream.h
1.57
KB
-rw-rw-r--
string-private.h
3.17
KB
-rw-rw-r--
string.c
90.27
KB
-rw-rw-r--
string_.h
3.61
KB
-rw-rw-r--
studio.h
9.23
KB
-rw-rw-r--
thread-private.h
3.87
KB
-rw-rw-r--
thread.c
9.62
KB
-rw-rw-r--
thread_.h
1.59
KB
-rw-rw-r--
threshold.c
81.92
KB
-rw-rw-r--
threshold.h
2.01
KB
-rw-rw-r--
timer-private.h
1.53
KB
-rw-rw-r--
timer.c
21.71
KB
-rw-rw-r--
timer.h
1.57
KB
-rw-rw-r--
token-private.h
4.27
KB
-rw-rw-r--
token.c
30.01
KB
-rw-rw-r--
token.h
1.48
KB
-rw-rw-r--
transform-private.h
997
B
-rw-rw-r--
transform.c
78.58
KB
-rw-rw-r--
transform.h
1.76
KB
-rw-rw-r--
type-private.h
1000
B
-rw-rw-r--
type.c
44.45
KB
-rw-rw-r--
type.h
1.94
KB
-rw-rw-r--
utility-private.h
7.37
KB
-rw-rw-r--
utility.c
60.19
KB
-rw-rw-r--
utility.h
1.62
KB
-rw-rw-r--
version-private.h
984
B
-rw-rw-r--
version.c
22.62
KB
-rw-rw-r--
version.h
3.02
KB
-rw-rw-r--
version.h.in
3.29
KB
-rw-rw-r--
vision.c
49.74
KB
-rw-rw-r--
vision.h
1.22
KB
-rw-rw-r--
visual-effects.c
122.12
KB
-rw-rw-r--
visual-effects.h
2.81
KB
-rw-rw-r--
widget-private.h
2.59
KB
-rw-rw-r--
widget.c
320.79
KB
-rw-rw-r--
widget.h
852
B
-rw-rw-r--
xml-tree-private.h
1.62
KB
-rw-rw-r--
xml-tree.c
93.09
KB
-rw-rw-r--
xml-tree.h
1.46
KB
-rw-rw-r--
xwindow-private.h
11.19
KB
-rw-rw-r--
xwindow.c
338.16
KB
-rw-rw-r--
xwindow.h
1.11
KB
-rw-rw-r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : splay-tree.c
/* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % SSSSS PPPP L AAA Y Y % % SS P P L A A Y Y % % SSS PPPP L AAAAA Y % % SS P L A A Y % % SSSSS P LLLLL A A Y % % % % TTTTT RRRR EEEEE EEEEE % % T R R E E % % T RRRR EEE EEE % % T R R E E % % T R R EEEEE EEEEE % % % % % % MagickCore Self-adjusting Binary Search Tree Methods % % % % Software Design % % Cristy % % December 2002 % % % % % % Copyright 1999-2020 ImageMagick Studio LLC, a non-profit organization % % dedicated to making software imaging solutions freely available. % % % % You may not use this file except in compliance with the License. You may % % obtain a copy of the License at % % % % https://imagemagick.org/script/license.php % % % % Unless required by applicable law or agreed to in writing, software % % distributed under the License is distributed on an "AS IS" BASIS, % % WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. % % See the License for the specific language governing permissions and % % limitations under the License. % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % This module implements the standard handy splay-tree methods for storing and % retrieving large numbers of data elements. It is loosely based on the Java % implementation of these algorithms. % */ /* Include declarations. */ #include "MagickCore/studio.h" #include "MagickCore/exception.h" #include "MagickCore/exception-private.h" #include "MagickCore/locale_.h" #include "MagickCore/log.h" #include "MagickCore/memory_.h" #include "MagickCore/memory-private.h" #include "MagickCore/splay-tree.h" #include "MagickCore/semaphore.h" #include "MagickCore/string_.h" /* Define declarations. */ #define MaxSplayTreeDepth 1024 /* Typedef declarations. */ typedef struct _NodeInfo { void *key; void *value; struct _NodeInfo *left, *right; } NodeInfo; struct _SplayTreeInfo { NodeInfo *root; int (*compare)(const void *,const void *); void *(*relinquish_key)(void *), *(*relinquish_value)(void *); MagickBooleanType balance; void *key, *next; size_t nodes; MagickBooleanType debug; SemaphoreInfo *semaphore; size_t signature; }; /* Forward declarations. */ static int IterateOverSplayTree(SplayTreeInfo *,int (*)(NodeInfo *,const void *), const void *); static void SplaySplayTree(SplayTreeInfo *,const void *); /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % A d d V a l u e T o S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % AddValueToSplayTree() adds the given key and value to the splay-tree. Both % key and value are used as is, without coping or cloning. It returns % MagickTrue on success, otherwise MagickFalse. % % The format of the AddValueToSplayTree method is: % % MagickBooleanType AddValueToSplayTree(SplayTreeInfo *splay_tree, % const void *key,const void *value) % % A description of each parameter follows: % % o splay_tree: the splay-tree info. % % o key: the key. % % o value: the value. % */ MagickExport MagickBooleanType AddValueToSplayTree(SplayTreeInfo *splay_tree, const void *key,const void *value) { int compare; register NodeInfo *node; LockSemaphoreInfo(splay_tree->semaphore); SplaySplayTree(splay_tree,key); compare=0; if (splay_tree->root != (NodeInfo *) NULL) { if (splay_tree->compare != (int (*)(const void *,const void *)) NULL) compare=splay_tree->compare(splay_tree->root->key,key); else compare=(splay_tree->root->key > key) ? 1 : ((splay_tree->root->key < key) ? -1 : 0); if (compare == 0) { if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (splay_tree->root->value != (void *) NULL)) splay_tree->root->value=splay_tree->relinquish_value( splay_tree->root->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (splay_tree->root->key != (void *) NULL)) splay_tree->root->key=splay_tree->relinquish_key( splay_tree->root->key); splay_tree->root->key=(void *) key; splay_tree->root->value=(void *) value; UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickTrue); } } node=(NodeInfo *) AcquireMagickMemory(sizeof(*node)); if (node == (NodeInfo *) NULL) { UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickFalse); } node->key=(void *) key; node->value=(void *) value; if (splay_tree->root == (NodeInfo *) NULL) { node->left=(NodeInfo *) NULL; node->right=(NodeInfo *) NULL; } else if (compare < 0) { node->left=splay_tree->root; node->right=node->left->right; node->left->right=(NodeInfo *) NULL; } else { node->right=splay_tree->root; node->left=node->right->left; node->right->left=(NodeInfo *) NULL; } splay_tree->root=node; splay_tree->key=(void *) NULL; splay_tree->nodes++; UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickTrue); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % B a l a n c e S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % BalanceSplayTree() balances the splay-tree. % % The format of the BalanceSplayTree method is: % % void *BalanceSplayTree(SplayTreeInfo *splay_tree,const void *key) % % A description of each parameter follows: % % o splay_tree: the splay-tree info. % % o key: the key. % */ static NodeInfo *LinkSplayTreeNodes(NodeInfo **nodes,const size_t low, const size_t high) { register NodeInfo *node; size_t bisect; bisect=low+(high-low)/2; node=nodes[bisect]; if ((low+1) > bisect) node->left=(NodeInfo *) NULL; else node->left=LinkSplayTreeNodes(nodes,low,bisect-1); if ((bisect+1) > high) node->right=(NodeInfo *) NULL; else node->right=LinkSplayTreeNodes(nodes,bisect+1,high); return(node); } static inline int SplayTreeToNodeArray(NodeInfo *node,const void *nodes) { register const NodeInfo ***p; p=(const NodeInfo ***) nodes; *(*p)=node; (*p)++; return(0); } static void BalanceSplayTree(SplayTreeInfo *splay_tree) { NodeInfo **node, **nodes; if (splay_tree->nodes <= 2) { splay_tree->balance=MagickFalse; return; } nodes=(NodeInfo **) AcquireQuantumMemory((size_t) splay_tree->nodes, sizeof(*nodes)); if (nodes == (NodeInfo **) NULL) ThrowFatalException(ResourceLimitFatalError,"MemoryAllocationFailed"); node=nodes; (void) IterateOverSplayTree(splay_tree,SplayTreeToNodeArray,(const void *) &node); splay_tree->root=LinkSplayTreeNodes(nodes,0,splay_tree->nodes-1); splay_tree->balance=MagickFalse; nodes=(NodeInfo **) RelinquishMagickMemory(nodes); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % C l o n e S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % CloneSplayTree() clones the splay tree. % % The format of the CloneSplayTree method is: % % SplayTreeInfo *CloneSplayTree(SplayTreeInfo *splay_tree, % void *(*clone_key)(void *),void *(*cline_value)(void *)) % % A description of each parameter follows: % % o splay_tree: the splay tree. % % o clone_key: the key clone method, typically ConstantString(), called % whenever a key is added to the splay-tree. % % o clone_value: the value clone method; typically ConstantString(), called % whenever a value object is added to the splay-tree. % */ static inline void *GetFirstSplayTreeNode(SplayTreeInfo *splay_tree) { register NodeInfo *node; node=splay_tree->root; if (splay_tree->root == (NodeInfo *) NULL) return((NodeInfo *) NULL); while (node->left != (NodeInfo *) NULL) node=node->left; return(node->key); } MagickExport SplayTreeInfo *CloneSplayTree(SplayTreeInfo *splay_tree, void *(*clone_key)(void *),void *(*clone_value)(void *)) { register NodeInfo *next, *node; SplayTreeInfo *clone_tree; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); clone_tree=NewSplayTree(splay_tree->compare,splay_tree->relinquish_key, splay_tree->relinquish_value); LockSemaphoreInfo(splay_tree->semaphore); if (splay_tree->root == (NodeInfo *) NULL) { UnlockSemaphoreInfo(splay_tree->semaphore); return(clone_tree); } next=(NodeInfo *) GetFirstSplayTreeNode(splay_tree); while (next != (NodeInfo *) NULL) { SplaySplayTree(splay_tree,next); (void) AddValueToSplayTree(clone_tree,clone_key(splay_tree->root->key), clone_value(splay_tree->root->value)); next=(NodeInfo *) NULL; node=splay_tree->root->right; if (node != (NodeInfo *) NULL) { while (node->left != (NodeInfo *) NULL) node=node->left; next=(NodeInfo *) node->key; } } UnlockSemaphoreInfo(splay_tree->semaphore); return(clone_tree); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % C o m p a r e S p l a y T r e e S t r i n g % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % CompareSplayTreeString() method finds a node in a splay-tree based on the % contents of a string. % % The format of the CompareSplayTreeString method is: % % int CompareSplayTreeString(const void *target,const void *source) % % A description of each parameter follows: % % o target: the target string. % % o source: the source string. % */ MagickExport int CompareSplayTreeString(const void *target,const void *source) { const char *p, *q; p=(const char *) target; q=(const char *) source; return(LocaleCompare(p,q)); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % C o m p a r e S p l a y T r e e S t r i n g I n f o % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % CompareSplayTreeStringInfo() finds a node in a splay-tree based on the % contents of a string. % % The format of the CompareSplayTreeStringInfo method is: % % int CompareSplayTreeStringInfo(const void *target,const void *source) % % A description of each parameter follows: % % o target: the target string. % % o source: the source string. % */ MagickExport int CompareSplayTreeStringInfo(const void *target, const void *source) { const StringInfo *p, *q; p=(const StringInfo *) target; q=(const StringInfo *) source; return(CompareStringInfo(p,q)); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % D e l e t e N o d e B y V a l u e F r o m S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % DeleteNodeByValueFromSplayTree() deletes a node by value from the % splay-tree. % % The format of the DeleteNodeByValueFromSplayTree method is: % % MagickBooleanType DeleteNodeByValueFromSplayTree( % SplayTreeInfo *splay_tree,const void *value) % % A description of each parameter follows: % % o splay_tree: the splay-tree info. % % o value: the value. % */ MagickExport MagickBooleanType DeleteNodeByValueFromSplayTree( SplayTreeInfo *splay_tree,const void *value) { register NodeInfo *next, *node; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); LockSemaphoreInfo(splay_tree->semaphore); if (splay_tree->root == (NodeInfo *) NULL) { UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickFalse); } next=(NodeInfo *) GetFirstSplayTreeNode(splay_tree); while (next != (NodeInfo *) NULL) { SplaySplayTree(splay_tree,next); next=(NodeInfo *) NULL; node=splay_tree->root->right; if (node != (NodeInfo *) NULL) { while (node->left != (NodeInfo *) NULL) node=node->left; next=(NodeInfo *) node->key; } if (splay_tree->root->value == value) { int compare; register NodeInfo *left, *right; void *key; /* We found the node that matches the value; now delete it. */ key=splay_tree->root->key; SplaySplayTree(splay_tree,key); splay_tree->key=(void *) NULL; if (splay_tree->compare != (int (*)(const void *,const void *)) NULL) compare=splay_tree->compare(splay_tree->root->key,key); else compare=(splay_tree->root->key > key) ? 1 : ((splay_tree->root->key < key) ? -1 : 0); if (compare != 0) { UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickFalse); } left=splay_tree->root->left; right=splay_tree->root->right; if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (splay_tree->root->value != (void *) NULL)) splay_tree->root->value=splay_tree->relinquish_value( splay_tree->root->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (splay_tree->root->key != (void *) NULL)) splay_tree->root->key=splay_tree->relinquish_key( splay_tree->root->key); splay_tree->root=(NodeInfo *) RelinquishMagickMemory(splay_tree->root); splay_tree->nodes--; if (left == (NodeInfo *) NULL) { splay_tree->root=right; UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickTrue); } splay_tree->root=left; if (right != (NodeInfo *) NULL) { while (left->right != (NodeInfo *) NULL) left=left->right; left->right=right; } UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickTrue); } } UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickFalse); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % D e l e t e N o d e F r o m S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % DeleteNodeFromSplayTree() deletes a node from the splay-tree. It returns % MagickTrue if the option is found and successfully deleted from the % splay-tree. % % The format of the DeleteNodeFromSplayTree method is: % % MagickBooleanType DeleteNodeFromSplayTree(SplayTreeInfo *splay_tree, % const void *key) % % A description of each parameter follows: % % o splay_tree: the splay-tree info. % % o key: the key. % */ MagickExport MagickBooleanType DeleteNodeFromSplayTree( SplayTreeInfo *splay_tree,const void *key) { int compare; register NodeInfo *left, *right; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); if (splay_tree->root == (NodeInfo *) NULL) return(MagickFalse); LockSemaphoreInfo(splay_tree->semaphore); SplaySplayTree(splay_tree,key); splay_tree->key=(void *) NULL; if (splay_tree->compare != (int (*)(const void *,const void *)) NULL) compare=splay_tree->compare(splay_tree->root->key,key); else compare=(splay_tree->root->key > key) ? 1 : ((splay_tree->root->key < key) ? -1 : 0); if (compare != 0) { UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickFalse); } left=splay_tree->root->left; right=splay_tree->root->right; if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (splay_tree->root->value != (void *) NULL)) splay_tree->root->value=splay_tree->relinquish_value( splay_tree->root->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (splay_tree->root->key != (void *) NULL)) splay_tree->root->key=splay_tree->relinquish_key(splay_tree->root->key); splay_tree->root=(NodeInfo *) RelinquishMagickMemory(splay_tree->root); splay_tree->nodes--; if (left == (NodeInfo *) NULL) { splay_tree->root=right; UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickTrue); } splay_tree->root=left; if (right != (NodeInfo *) NULL) { while (left->right != (NodeInfo *) NULL) left=left->right; left->right=right; } UnlockSemaphoreInfo(splay_tree->semaphore); return(MagickTrue); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % D e s t r o y S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % DestroySplayTree() destroys the splay-tree. % % The format of the DestroySplayTree method is: % % SplayTreeInfo *DestroySplayTree(SplayTreeInfo *splay_tree) % % A description of each parameter follows: % % o splay_tree: the splay tree. % */ MagickExport SplayTreeInfo *DestroySplayTree(SplayTreeInfo *splay_tree) { NodeInfo *node; register NodeInfo *active, *pend; LockSemaphoreInfo(splay_tree->semaphore); if (splay_tree->root != (NodeInfo *) NULL) { if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (splay_tree->root->value != (void *) NULL)) splay_tree->root->value=splay_tree->relinquish_value( splay_tree->root->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (splay_tree->root->key != (void *) NULL)) splay_tree->root->key=splay_tree->relinquish_key(splay_tree->root->key); splay_tree->root->key=(void *) NULL; for (pend=splay_tree->root; pend != (NodeInfo *) NULL; ) { active=pend; for (pend=(NodeInfo *) NULL; active != (NodeInfo *) NULL; ) { if (active->left != (NodeInfo *) NULL) { if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (active->left->value != (void *) NULL)) active->left->value=splay_tree->relinquish_value( active->left->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (active->left->key != (void *) NULL)) active->left->key=splay_tree->relinquish_key(active->left->key); active->left->key=(void *) pend; pend=active->left; } if (active->right != (NodeInfo *) NULL) { if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (active->right->value != (void *) NULL)) active->right->value=splay_tree->relinquish_value( active->right->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (active->right->key != (void *) NULL)) active->right->key=splay_tree->relinquish_key( active->right->key); active->right->key=(void *) pend; pend=active->right; } node=active; active=(NodeInfo *) node->key; node=(NodeInfo *) RelinquishMagickMemory(node); } } } splay_tree->signature=(~MagickCoreSignature); UnlockSemaphoreInfo(splay_tree->semaphore); RelinquishSemaphoreInfo(&splay_tree->semaphore); splay_tree=(SplayTreeInfo *) RelinquishMagickMemory(splay_tree); return(splay_tree); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % G e t N e x t K e y I n S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % GetNextKeyInSplayTree() gets the next key in the splay-tree. % % The format of the GetNextKeyInSplayTree method is: % % const void *GetNextKeyInSplayTree(SplayTreeInfo *splay_tree) % % A description of each parameter follows: % % o splay_tree: the splay tree. % % o key: the key. % */ MagickExport const void *GetNextKeyInSplayTree(SplayTreeInfo *splay_tree) { register NodeInfo *node; void *key; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); if ((splay_tree->root == (NodeInfo *) NULL) || (splay_tree->next == (void *) NULL)) return((void *) NULL); LockSemaphoreInfo(splay_tree->semaphore); SplaySplayTree(splay_tree,splay_tree->next); splay_tree->next=(void *) NULL; node=splay_tree->root->right; if (node != (NodeInfo *) NULL) { while (node->left != (NodeInfo *) NULL) node=node->left; splay_tree->next=node->key; } key=splay_tree->root->key; UnlockSemaphoreInfo(splay_tree->semaphore); return(key); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % G e t N e x t V a l u e I n S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % GetNextValueInSplayTree() gets the next value in the splay-tree. % % The format of the GetNextValueInSplayTree method is: % % const void *GetNextValueInSplayTree(SplayTreeInfo *splay_tree) % % A description of each parameter follows: % % o splay_tree: the splay tree. % % o key: the key. % */ MagickExport const void *GetNextValueInSplayTree(SplayTreeInfo *splay_tree) { register NodeInfo *node; void *value; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); if ((splay_tree->root == (NodeInfo *) NULL) || (splay_tree->next == (void *) NULL)) return((void *) NULL); LockSemaphoreInfo(splay_tree->semaphore); SplaySplayTree(splay_tree,splay_tree->next); splay_tree->next=(void *) NULL; node=splay_tree->root->right; if (node != (NodeInfo *) NULL) { while (node->left != (NodeInfo *) NULL) node=node->left; splay_tree->next=node->key; } value=splay_tree->root->value; UnlockSemaphoreInfo(splay_tree->semaphore); return(value); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % G e t R o o t V a l u e F r o m S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % GetRootValueFromSplayTree() gets the root value from the splay-tree. % % The format of the GetRootValueFromSplayTree method is: % % const void *GetRootValueFromSplayTree(SplayTreeInfo *splay_tree) % % A description of each parameter follows: % % o splay_tree: the splay tree. % % o key: the key. % */ MagickExport const void *GetRootValueFromSplayTree(SplayTreeInfo *splay_tree) { const void *value; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); value=(const void *) NULL; LockSemaphoreInfo(splay_tree->semaphore); if (splay_tree->root != (NodeInfo *) NULL) value=splay_tree->root->value; UnlockSemaphoreInfo(splay_tree->semaphore); return(value); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % G e t V a l u e F r o m S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % GetValueFromSplayTree() gets a value from the splay-tree by its key. % % Note, the value is a constant. Do not attempt to free it. % % The format of the GetValueFromSplayTree method is: % % const void *GetValueFromSplayTree(SplayTreeInfo *splay_tree, % const void *key) % % A description of each parameter follows: % % o splay_tree: the splay tree. % % o key: the key. % */ MagickExport const void *GetValueFromSplayTree(SplayTreeInfo *splay_tree, const void *key) { int compare; void *value; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); if (splay_tree->root == (NodeInfo *) NULL) return((void *) NULL); LockSemaphoreInfo(splay_tree->semaphore); SplaySplayTree(splay_tree,key); if (splay_tree->compare != (int (*)(const void *,const void *)) NULL) compare=splay_tree->compare(splay_tree->root->key,key); else compare=(splay_tree->root->key > key) ? 1 : ((splay_tree->root->key < key) ? -1 : 0); if (compare != 0) { UnlockSemaphoreInfo(splay_tree->semaphore); return((void *) NULL); } value=splay_tree->root->value; UnlockSemaphoreInfo(splay_tree->semaphore); return(value); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % G e t N u m b e r O f N o d e s I n S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % GetNumberOfNodesInSplayTree() returns the number of nodes in the splay-tree. % % The format of the GetNumberOfNodesInSplayTree method is: % % size_t GetNumberOfNodesInSplayTree( % const SplayTreeInfo *splay_tree) % % A description of each parameter follows: % % o splay_tree: the splay tree. % */ MagickExport size_t GetNumberOfNodesInSplayTree( const SplayTreeInfo *splay_tree) { assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); return(splay_tree->nodes); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % I t e r a t e O v e r S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % IterateOverSplayTree() iterates over the splay-tree. % % The format of the IterateOverSplayTree method is: % % int IterateOverSplayTree(SplayTreeInfo *splay_tree, % int (*method)(NodeInfo *,void *),const void *value) % % A description of each parameter follows: % % o splay_tree: the splay-tree info. % % o method: the method. % % o value: the value. % */ static int IterateOverSplayTree(SplayTreeInfo *splay_tree, int (*method)(NodeInfo *,const void *),const void *value) { typedef enum { LeftTransition, RightTransition, DownTransition, UpTransition } TransitionType; int status; MagickBooleanType final_transition; NodeInfo **nodes; register ssize_t i; register NodeInfo *node; TransitionType transition; unsigned char *transitions; if (splay_tree->root == (NodeInfo *) NULL) return(0); nodes=(NodeInfo **) AcquireQuantumMemory((size_t) splay_tree->nodes, sizeof(*nodes)); transitions=(unsigned char *) AcquireQuantumMemory((size_t) splay_tree->nodes, sizeof(*transitions)); if ((nodes == (NodeInfo **) NULL) || (transitions == (unsigned char *) NULL)) ThrowFatalException(ResourceLimitFatalError,"MemoryAllocationFailed"); status=0; final_transition=MagickFalse; nodes[0]=splay_tree->root; transitions[0]=(unsigned char) LeftTransition; for (i=0; final_transition == MagickFalse; ) { node=nodes[i]; transition=(TransitionType) transitions[i]; switch (transition) { case LeftTransition: { transitions[i]=(unsigned char) DownTransition; if (node->left == (NodeInfo *) NULL) break; i++; nodes[i]=node->left; transitions[i]=(unsigned char) LeftTransition; break; } case RightTransition: { transitions[i]=(unsigned char) UpTransition; if (node->right == (NodeInfo *) NULL) break; i++; nodes[i]=node->right; transitions[i]=(unsigned char) LeftTransition; break; } case DownTransition: default: { transitions[i]=(unsigned char) RightTransition; status=(*method)(node,value); if (status != 0) final_transition=MagickTrue; break; } case UpTransition: { if (i == 0) { final_transition=MagickTrue; break; } i--; break; } } } nodes=(NodeInfo **) RelinquishMagickMemory(nodes); transitions=(unsigned char *) RelinquishMagickMemory(transitions); return(status); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % N e w S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % NewSplayTree() returns a pointer to a SplayTreeInfo structure initialized % to default values. % % The format of the NewSplayTree method is: % % SplayTreeInfo *NewSplayTree(int (*compare)(const void *,const void *), % void *(*relinquish_key)(void *),void *(*relinquish_value)(void *)) % % A description of each parameter follows: % % o compare: the compare method. % % o relinquish_key: the key deallocation method, typically % RelinquishMagickMemory(), called whenever a key is removed from the % splay-tree. % % o relinquish_value: the value deallocation method; typically % RelinquishMagickMemory(), called whenever a value object is removed from % the splay-tree. % */ MagickExport SplayTreeInfo *NewSplayTree( int (*compare)(const void *,const void *),void *(*relinquish_key)(void *), void *(*relinquish_value)(void *)) { SplayTreeInfo *splay_tree; splay_tree=(SplayTreeInfo *) AcquireCriticalMemory(sizeof(*splay_tree)); (void) memset(splay_tree,0,sizeof(*splay_tree)); splay_tree->root=(NodeInfo *) NULL; splay_tree->compare=compare; splay_tree->relinquish_key=relinquish_key; splay_tree->relinquish_value=relinquish_value; splay_tree->balance=MagickFalse; splay_tree->key=(void *) NULL; splay_tree->next=(void *) NULL; splay_tree->nodes=0; splay_tree->debug=IsEventLogging(); splay_tree->semaphore=AcquireSemaphoreInfo(); splay_tree->signature=MagickCoreSignature; return(splay_tree); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % R e m o v e N o d e B y V a l u e F r o m S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % RemoveNodeByValueFromSplayTree() removes a node by value from the splay-tree % and returns its key. % % The format of the RemoveNodeByValueFromSplayTree method is: % % void *RemoveNodeByValueFromSplayTree(SplayTreeInfo *splay_tree, % const void *value) % % A description of each parameter follows: % % o splay_tree: the splay-tree info. % % o value: the value. % */ MagickExport void *RemoveNodeByValueFromSplayTree(SplayTreeInfo *splay_tree, const void *value) { register NodeInfo *next, *node; void *key; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); key=(void *) NULL; if (splay_tree->root == (NodeInfo *) NULL) return(key); LockSemaphoreInfo(splay_tree->semaphore); next=(NodeInfo *) GetFirstSplayTreeNode(splay_tree); while (next != (NodeInfo *) NULL) { SplaySplayTree(splay_tree,next); next=(NodeInfo *) NULL; node=splay_tree->root->right; if (node != (NodeInfo *) NULL) { while (node->left != (NodeInfo *) NULL) node=node->left; next=(NodeInfo *) node->key; } if (splay_tree->root->value == value) { int compare; register NodeInfo *left, *right; /* We found the node that matches the value; now remove it. */ key=splay_tree->root->key; SplaySplayTree(splay_tree,key); splay_tree->key=(void *) NULL; if (splay_tree->compare != (int (*)(const void *,const void *)) NULL) compare=splay_tree->compare(splay_tree->root->key,key); else compare=(splay_tree->root->key > key) ? 1 : ((splay_tree->root->key < key) ? -1 : 0); if (compare != 0) { UnlockSemaphoreInfo(splay_tree->semaphore); return(key); } left=splay_tree->root->left; right=splay_tree->root->right; if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (splay_tree->root->value != (void *) NULL)) splay_tree->root->value=splay_tree->relinquish_value( splay_tree->root->value); splay_tree->root=(NodeInfo *) RelinquishMagickMemory(splay_tree->root); splay_tree->nodes--; if (left == (NodeInfo *) NULL) { splay_tree->root=right; UnlockSemaphoreInfo(splay_tree->semaphore); return(key); } splay_tree->root=left; if (right != (NodeInfo *) NULL) { while (left->right != (NodeInfo *) NULL) left=left->right; left->right=right; } UnlockSemaphoreInfo(splay_tree->semaphore); return(key); } } UnlockSemaphoreInfo(splay_tree->semaphore); return(key); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % R e m o v e N o d e F r o m S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % RemoveNodeFromSplayTree() removes a node from the splay-tree and returns its % value. % % The format of the RemoveNodeFromSplayTree method is: % % void *RemoveNodeFromSplayTree(SplayTreeInfo *splay_tree,const void *key) % % A description of each parameter follows: % % o splay_tree: the splay-tree info. % % o key: the key. % */ MagickExport void *RemoveNodeFromSplayTree(SplayTreeInfo *splay_tree, const void *key) { int compare; register NodeInfo *left, *right; void *value; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); value=(void *) NULL; if (splay_tree->root == (NodeInfo *) NULL) return(value); LockSemaphoreInfo(splay_tree->semaphore); SplaySplayTree(splay_tree,key); splay_tree->key=(void *) NULL; if (splay_tree->compare != (int (*)(const void *,const void *)) NULL) compare=splay_tree->compare(splay_tree->root->key,key); else compare=(splay_tree->root->key > key) ? 1 : ((splay_tree->root->key < key) ? -1 : 0); if (compare != 0) { UnlockSemaphoreInfo(splay_tree->semaphore); return(value); } left=splay_tree->root->left; right=splay_tree->root->right; value=splay_tree->root->value; if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (splay_tree->root->key != (void *) NULL)) splay_tree->root->key=splay_tree->relinquish_key(splay_tree->root->key); splay_tree->root=(NodeInfo *) RelinquishMagickMemory(splay_tree->root); splay_tree->nodes--; if (left == (NodeInfo *) NULL) { splay_tree->root=right; UnlockSemaphoreInfo(splay_tree->semaphore); return(value); } splay_tree->root=left; if (right != (NodeInfo *) NULL) { while (left->right != (NodeInfo *) NULL) left=left->right; left->right=right; } UnlockSemaphoreInfo(splay_tree->semaphore); return(value); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % R e s e t S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % ResetSplayTree() resets the splay-tree. That is, it deletes all the nodes % from the tree. % % The format of the ResetSplayTree method is: % % ResetSplayTree(SplayTreeInfo *splay_tree) % % A description of each parameter follows: % % o splay_tree: the splay tree. % */ MagickExport void ResetSplayTree(SplayTreeInfo *splay_tree) { NodeInfo *node; register NodeInfo *active, *pend; assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); LockSemaphoreInfo(splay_tree->semaphore); if (splay_tree->root != (NodeInfo *) NULL) { if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (splay_tree->root->value != (void *) NULL)) splay_tree->root->value=splay_tree->relinquish_value( splay_tree->root->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (splay_tree->root->key != (void *) NULL)) splay_tree->root->key=splay_tree->relinquish_key(splay_tree->root->key); splay_tree->root->key=(void *) NULL; for (pend=splay_tree->root; pend != (NodeInfo *) NULL; ) { active=pend; for (pend=(NodeInfo *) NULL; active != (NodeInfo *) NULL; ) { if (active->left != (NodeInfo *) NULL) { if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (active->left->value != (void *) NULL)) active->left->value=splay_tree->relinquish_value( active->left->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (active->left->key != (void *) NULL)) active->left->key=splay_tree->relinquish_key(active->left->key); active->left->key=(void *) pend; pend=active->left; } if (active->right != (NodeInfo *) NULL) { if ((splay_tree->relinquish_value != (void *(*)(void *)) NULL) && (active->right->value != (void *) NULL)) active->right->value=splay_tree->relinquish_value( active->right->value); if ((splay_tree->relinquish_key != (void *(*)(void *)) NULL) && (active->right->key != (void *) NULL)) active->right->key=splay_tree->relinquish_key( active->right->key); active->right->key=(void *) pend; pend=active->right; } node=active; active=(NodeInfo *) node->key; node=(NodeInfo *) RelinquishMagickMemory(node); } } } splay_tree->root=(NodeInfo *) NULL; splay_tree->key=(void *) NULL; splay_tree->next=(void *) NULL; splay_tree->nodes=0; splay_tree->balance=MagickFalse; UnlockSemaphoreInfo(splay_tree->semaphore); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % R e s e t S p l a y T r e e I t e r a t o r % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % ResetSplayTreeIterator() resets the splay-tree iterator. Use it in % conjunction with GetNextValueInSplayTree() to iterate over all the nodes in % the splay-tree. % % The format of the ResetSplayTreeIterator method is: % % ResetSplayTreeIterator(SplayTreeInfo *splay_tree) % % A description of each parameter follows: % % o splay_tree: the splay tree. % */ MagickExport void ResetSplayTreeIterator(SplayTreeInfo *splay_tree) { assert(splay_tree != (SplayTreeInfo *) NULL); assert(splay_tree->signature == MagickCoreSignature); if (splay_tree->debug != MagickFalse) (void) LogMagickEvent(TraceEvent,GetMagickModule(),"..."); LockSemaphoreInfo(splay_tree->semaphore); splay_tree->next=GetFirstSplayTreeNode(splay_tree); UnlockSemaphoreInfo(splay_tree->semaphore); } /* %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % % % % % S p l a y S p l a y T r e e % % % % % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % SplaySplayTree() splays the splay-tree. % % The format of the SplaySplayTree method is: % % void SplaySplayTree(SplayTreeInfo *splay_tree,const void *key, % NodeInfo **node,NodeInfo **parent,NodeInfo **grandparent) % % A description of each parameter follows: % % o splay_tree: the splay-tree info. % % o key: the key. % % o node: the node. % % o parent: the parent node. % % o grandparent: the grandparent node. % */ static NodeInfo *Splay(SplayTreeInfo *splay_tree,const size_t depth, const void *key,NodeInfo **node,NodeInfo **parent,NodeInfo **grandparent) { int compare; NodeInfo **next; register NodeInfo *n, *p; n=(*node); if (n == (NodeInfo *) NULL) return(*parent); if (splay_tree->compare != (int (*)(const void *,const void *)) NULL) compare=splay_tree->compare(n->key,key); else compare=(n->key > key) ? 1 : ((n->key < key) ? -1 : 0); next=(NodeInfo **) NULL; if (compare > 0) next=(&n->left); else if (compare < 0) next=(&n->right); if (next != (NodeInfo **) NULL) { if (depth >= MaxSplayTreeDepth) { splay_tree->balance=MagickTrue; return(n); } n=Splay(splay_tree,depth+1,key,next,node,parent); if ((n != *node) || (splay_tree->balance != MagickFalse)) return(n); } if (parent == (NodeInfo **) NULL) return(n); if (grandparent == (NodeInfo **) NULL) { if (n == (*parent)->left) { *node=n->right; n->right=(*parent); } else { *node=n->left; n->left=(*parent); } *parent=n; return(n); } if ((n == (*parent)->left) && (*parent == (*grandparent)->left)) { p=(*parent); (*grandparent)->left=p->right; p->right=(*grandparent); p->left=n->right; n->right=p; *grandparent=n; return(n); } if ((n == (*parent)->right) && (*parent == (*grandparent)->right)) { p=(*parent); (*grandparent)->right=p->left; p->left=(*grandparent); p->right=n->left; n->left=p; *grandparent=n; return(n); } if (n == (*parent)->left) { (*parent)->left=n->right; n->right=(*parent); (*grandparent)->right=n->left; n->left=(*grandparent); *grandparent=n; return(n); } (*parent)->right=n->left; n->left=(*parent); (*grandparent)->left=n->right; n->right=(*grandparent); *grandparent=n; return(n); } static void SplaySplayTree(SplayTreeInfo *splay_tree,const void *key) { if (splay_tree->root == (NodeInfo *) NULL) return; if (splay_tree->key != (void *) NULL) { int compare; if (splay_tree->compare != (int (*)(const void *,const void *)) NULL) compare=splay_tree->compare(splay_tree->root->key,key); else compare=(splay_tree->key > key) ? 1 : ((splay_tree->key < key) ? -1 : 0); if (compare == 0) return; } (void) Splay(splay_tree,0UL,key,&splay_tree->root,(NodeInfo **) NULL, (NodeInfo **) NULL); if (splay_tree->balance != MagickFalse) { BalanceSplayTree(splay_tree); (void) Splay(splay_tree,0UL,key,&splay_tree->root,(NodeInfo **) NULL, (NodeInfo **) NULL); if (splay_tree->balance != MagickFalse) ThrowFatalException(ResourceLimitFatalError,"MemoryAllocationFailed"); } splay_tree->key=(void *) key; }
Close