package camlimages
Image processing library
Install
Dune Dependency
Authors
Maintainers
Sources
camlimages-5.0.4.tar.bz2
sha256=1c9a68bdc3d348c9f859d490dadf384926213e47a584159832f7fc4a20242865
md5=1ddba74d210b86a899b5d6565f45c2dc
doc/src/camlimages.core/bitmap.ml.html
Source file bitmap.ml
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 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581
(***********************************************************************) (* *) (* Objective Caml *) (* *) (* Jun Furuse, projet Cristal, INRIA Rocquencourt *) (* *) (* Copyright 1999-2004, *) (* Institut National de Recherche en Informatique et en Automatique. *) (* Distributed only by permission. *) (* *) (***********************************************************************) (* $Id: bitmap.ml,v 1.7 2009/07/04 03:39:28 furuse Exp $*) open Util let debug = ref true let debugs s = if !debug then prerr_endline s let maximum_live = ref 0 (* around 3M words for example *) let maximum_block_size = ref (!maximum_live / 10) (* default 300K words *) (* see Temp to set temp file directory *) type block_data = | InMemory of bytes | Swapped | Destroyed type block = { block_width: int; block_height: int; block_size: int; mutable block_data: block_data; mutable last_used: float; swap: string option } let swappable_blocks = ref [] (* wrapped Bytes.create *) let bytes_create s = try Bytes.create s with Invalid_argument _ -> raise Out_of_memory module Block = struct type t = { width : int; height : int; x : int; y : int; dump : bytes; } end module type Bitdepth = sig val bytes_per_pixel : int end module Make(B:Bitdepth) = struct open B type t = { (* The whole size *) width : int; height : int; (* block partition size *) block_size_width : int; block_size_height : int; (* number of block partitions *) blocks_x : int; blocks_y : int; data : block array array; access : int -> int -> (bytes * int); } (****************************************************************************) (* Destruction *) (****************************************************************************) let destroy _t = () (* do nothing... *) let destroy_block blk = if blk.block_data = Destroyed then () else begin match blk.swap with | Some fname -> begin match blk.block_data with | Swapped -> Sys.remove fname; blk.block_data <- Destroyed | InMemory _ | Destroyed -> () end | None -> () end; swappable_blocks := List.fold_right (fun blk' st -> if blk == blk' then st else blk' :: st) !swappable_blocks [] let fill_bytes buf init = (* fill bytes with init quickly (hopefully) *) let fulllength = Bytes.length buf in let halflength = fulllength / 2 in let rec sub = function | 0 -> let len = Bytes.length init in Bytes.unsafe_blit init 0 buf 0 len; sub len | x when x <= halflength -> Bytes.unsafe_blit buf 0 buf x x; sub (x * 2) | x (* when x > halflength *) -> Bytes.unsafe_blit buf 0 buf x (fulllength - x) in sub 0 let check_init init = match init with | Some v -> if Bytes.length v <> bytes_per_pixel then failwith "bitmap fill value is incorrect" | None -> () let memory width height init = (* try to have it whole in memory *) check_init init; (* we can have hsize lines at maximum in one bytes *) let hsize = Sys.max_string_length / (width * bytes_per_pixel) in let hsize = min height hsize in (* how many caml bytess required? *) let blocks_y = (height - 1) / hsize + 1 in let buf_size_heights = Array.init blocks_y (fun by -> let height = if by = blocks_y - 1 then let m = height mod hsize in if m = 0 then hsize else m else hsize in (* CR jfuruse: check overflow *) let size = width * height * bytes_per_pixel in bytes_create size, size, height) in let bufs = Array.map (fun (buf, _, _) -> buf) buf_size_heights in begin match init with | Some v -> Array.iter (fun s -> fill_bytes s v) bufs; | None -> () end; { width = width; height = height; block_size_width = width; block_size_height = hsize; blocks_x = 1; blocks_y = blocks_y; data = [| Array.init blocks_y (fun h -> let buf, size, height = buf_size_heights.(h) in { block_width = width; block_height = height; block_data = InMemory buf; block_size = size; last_used = 0.0; swap = None; }) |]; access = if blocks_y = 1 then (fun x y -> bufs.(0), (y * width + x) * bytes_per_pixel) else (fun x y -> bufs.(y / hsize), ((y mod hsize) * width + x) * bytes_per_pixel) } let swap_out = function | {block_data = Destroyed} -> failwith "swap_out: Already destroyed" | {swap = None} -> failwith "No swap file set" | {swap = Some fname; block_data = InMemory s; block_size = size} as blk -> begin try debugs (Printf.sprintf "swap out %s" fname (* blk.block_size*)); let oc = open_out_bin fname in output oc s 0 size; close_out oc; blk.block_data <- Swapped with | e -> prerr_endline "Swap-out failed"; raise e end | _ -> () let touch_block blk = blk.last_used <- Sys.time () let swap_out_eldest words = let sorted = List.sort (fun b1 b2 -> compare b1.last_used b2.last_used) !swappable_blocks in let rec swapper sorted i = match sorted with | [] -> () | x :: xs -> swap_out x; swapper xs (i - (x.block_size + Camlimages.word_size - 1) / Camlimages.word_size) in swapper sorted words let require bytes = let words = (bytes + Camlimages.word_size - 1) / Camlimages.word_size in let stat = Gc.stat () in let over = stat.Gc.live_words + words - !maximum_live in if over > 0 then swap_out_eldest over let swap_in = function | {block_data = Destroyed} -> raise (Failure "swap_in: Already destroyed") | {block_data = InMemory s} as blk -> touch_block blk; s | {swap = Some fname; block_data = Swapped; block_size = size} as blk -> begin try debugs ("swap in "^fname); require size; let ic = open_in_bin fname in let s = bytes_create size in really_input ic s 0 size; close_in ic; blk.block_data <- InMemory s; Sys.remove fname; touch_block blk; s with | e -> prerr_endline (Printf.sprintf "Swap-in failed (%s)" (Printexc.to_string e)); raise e end | _ -> assert false let alloc_swappable_block width height init = (* CR jfuruse: check overflow *) let size = bytes_per_pixel * width * height in require size; let s = bytes_create size in begin match init with | Some v -> fill_bytes s v | None -> () end; let blk = { block_width = width; block_height = height; block_size = size; block_data = InMemory s; last_used = Sys.time (); swap = Some (Tmpfile.new_tmp_file_name "swap") } in Gc.finalise destroy_block blk; swappable_blocks := blk :: !swappable_blocks; blk (****************************************************************************) (* Creation functions *) (****************************************************************************) let create width height init = if !maximum_live <= 0 then memory width height init else begin check_init init; (* determine the block size *) let rec get_block_size p = (* CR jfuruse: check overflow *) let whole_words = (bytes_per_pixel * width * height + Camlimages.word_size - 1) / Camlimages.word_size in let pp = p * p in if whole_words / pp > !maximum_block_size then get_block_size (p + 1) else p in let rec alloc_test_block p = let block_size_width = width / p + (if width mod p <> 0 then 1 else 0) and block_size_height = height / p + (if height mod p <> 0 then 1 else 0) in try (* CR jfuruse: check overflow *) p, bytes_create (block_size_width * block_size_height * bytes_per_pixel) with | Out_of_memory -> alloc_test_block (p + 1) in let blocks, test_block = alloc_test_block (get_block_size 1) in (* use the block so that it is not GCed too early *) test_block << 0 & '0'; (* Create bitmap *) let blocks_x = blocks and blocks_y = blocks in let block_size_width = width / blocks_x + (if width mod blocks_x <> 0 then 1 else 0) and block_size_height = height / blocks_x + (if height mod blocks_x <> 0 then 1 else 0) in debugs (Printf.sprintf "creating %d x %d blocks (%dx%d)" blocks blocks block_size_width block_size_height); let data = (* CR jfuruse: check overflow *) Array.init blocks_x (fun x -> Array.init blocks_y (fun y -> let w = if x <> blocks_x - 1 then block_size_width else width - block_size_width * (blocks_x - 1) and h = if y <> blocks_y - 1 then block_size_height else height - block_size_height * (blocks_y - 1) in alloc_swappable_block w h init)) in let t = { width = width; height = height; block_size_width = block_size_width; block_size_height = block_size_height; blocks_x = blocks_x; blocks_y = blocks_y; data = data; access = ( if blocks_x = 1 && blocks_y = 1 then begin let the_blk = data.(0).(0) in fun x y -> let str = swap_in the_blk in let pos = (the_blk.block_width * (y mod block_size_height) + (x mod block_size_width)) * bytes_per_pixel in str, pos end else begin fun x y -> let bx = x / block_size_width and by = y / block_size_height in let blk = data.(bx).(by) in let str = swap_in blk in let pos = (blk.block_width * (y mod block_size_height) + (x mod block_size_width)) * bytes_per_pixel in str, pos end); } in t end let create_with width height buf = { width = width; height = height; block_size_width = width; block_size_height = height; blocks_x = 1; blocks_y = 1; data = [| [| { block_width = width; block_height = height; block_data = InMemory buf; (* CR jfuruse: check overflow *) block_size = width * height * bytes_per_pixel; last_used = 0.0; swap = None; } |] |]; access = (fun x y -> buf, (y * width + x) * bytes_per_pixel); } let create_with_scanlines width height scanlines = (* CR jfuruse: check overflow *) let block_size = width * bytes_per_pixel in if Array.length scanlines <> height then begin Format.eprintf "scanline error %d (height=%d) (bpp=%d)@." (Array.length scanlines) height bytes_per_pixel; assert false end; for y = 0 to height - 1 do if Bytes.length scanlines.(y) <> block_size then begin Format.eprintf "scanline error %d = block_size %d = %d * %d (y=%d)@." (Bytes.length scanlines.(y)) block_size width bytes_per_pixel y; assert false end done; { width = width; height = height; block_size_width = width; block_size_height = 1; blocks_x = 1; blocks_y = height; data = [| Array.mapi (fun _y scanline -> { block_width = width; block_height = 1; block_data = InMemory scanline; block_size = block_size; last_used = 0.0; swap = None }) scanlines |]; access = (fun x y -> scanlines.(y), x * bytes_per_pixel); } (****************************************************************************) (* Tool functions *) (****************************************************************************) let access t = t.access (* strip access *) (* Here, "strip" is a rectangle region with height 1 *) let get_strip t x y w = (* No region checks for performance. You should wrap this to make safe in your applications. *) match t.blocks_x, t.blocks_y with | 1, _ -> (* optimized *) let bly = y / t.block_size_height in let y' = y mod t.block_size_height in let blk = t.data.(0).(bly) in let src = swap_in blk in let size = w * bytes_per_pixel in let adrs = (blk.block_width * y' + x) * bytes_per_pixel in let str = bytes_create size in Bytes.unsafe_blit src adrs str 0 size; str | _, _ -> let bly = y / t.block_size_height in let y' = y mod t.block_size_height in let str = bytes_create (w * bytes_per_pixel) in let blx_start = x / t.block_size_width in let blx_last = (x + w - 1) / t.block_size_width in for blx = blx_start to blx_last do let blk = t.data.(blx).(bly) in let src = swap_in blk in let x1 = if blx = blx_start then x mod t.block_size_width else 0 in let x2 = if blx = blx_last then (x + w - 1) mod t.block_size_width else (blk.block_width - 1) in let w' = x2 - x1 + 1 in let size = w' * bytes_per_pixel in let adrs = (blk.block_width * y' + x1) * bytes_per_pixel in let offset = if blx = blx_start then 0 else (t.block_size_width * blx - x) * bytes_per_pixel in Bytes.unsafe_blit src adrs str offset size done; str let set_strip t x y w str = (* No region checks for performance. You should wrap this to make safe in your applications. *) match t.blocks_x, t.blocks_y with | 1, _ -> (* optimized *) let bly = y / t.block_size_height in let y' = y mod t.block_size_height in let blk = t.data.(0).(bly) in let dst = swap_in blk in let size = w * bytes_per_pixel in let adrs = (blk.block_width * y' + x) * bytes_per_pixel in Bytes.unsafe_blit str 0 dst adrs size | _, _ -> let bly = y / t.block_size_height in let y' = y mod t.block_size_height in let blx_start = x / t.block_size_width in let blx_last = (x + w - 1) / t.block_size_width in for blx = blx_start to blx_last do let blk = t.data.(blx).(bly) in let dst = swap_in blk in let x1 = if blx = blx_start then x mod t.block_size_width else 0 in let x2 = if blx = blx_last then (x + w - 1) mod t.block_size_width else (blk.block_width - 1) in let w' = x2 - x1 + 1 in let size = w' * bytes_per_pixel in let adrs = (blk.block_width * y' + x1) * bytes_per_pixel in let offset = if blx = blx_start then 0 else (t.block_size_width * blx - x) * bytes_per_pixel in Bytes.unsafe_blit str offset dst adrs size done (* scanline access (special case of strip access) *) let get_scanline t y = get_strip t 0 y t.width (* returns the scan line address and how many lines we can get *) let get_scanline_ptr t = match t.blocks_x, t.blocks_y with | 1, 1 -> (* optimized *) Some (fun y -> let blk = t.data.(0).(0) in let src = swap_in blk in let adrs = (blk.block_width * y) * bytes_per_pixel in (src, adrs), blk.block_height - y) | 1, _ -> (* optimized *) Some (fun y -> let bly = y / t.block_size_height in let y' = y mod t.block_size_height in let blk = Array.unsafe_get (Array.unsafe_get t.data 0) bly in let src = swap_in blk in let adrs = (blk.block_width * y') * bytes_per_pixel in (src, adrs), blk.block_height - y') | _, _ -> None let set_scanline t y str = (* CR jfuruse: check overflow *) if Bytes.length str <> t.width * B.bytes_per_pixel then failwith (Printf.sprintf "scan=%d width=%d bbp=%d" (Bytes.length str) t.width B.bytes_per_pixel); set_strip t 0 y t.width str (* dump : of course this does not work for large images *) let dump t = (* CR jfuruse: check overflow *) let size = bytes_per_pixel * t.width * t.height in match t.blocks_x, t.blocks_y with | 1, 1 -> swap_in t.data.(0).(0) | 1, h -> let s = bytes_create size in let scanline_size = bytes_per_pixel * t.width in for y = 0 to h - 1 do let str = swap_in t.data.(0).(y) in Bytes.unsafe_blit str 0 s (scanline_size * y) scanline_size done; s | w, h -> let s = bytes_create size in for x = 0 to w - 1 do for y = 0 to h - 1 do let blk = t.data.(x).(y) in let str = swap_in blk in let scanline_size = bytes_per_pixel * blk.block_width in for i = 0 to blk.block_height - 1 do Bytes.unsafe_blit str (scanline_size * i) s (((y * t.block_size_height + i) * t.width + x * t.block_size_width) * bytes_per_pixel) scanline_size done done done; s (* sub-bitmap *) let sub t x y w h = Region.check t.width t.height x y; Region.check t.width t.height (x + w - 1) (y + h - 1); let dst = create w h None in try for i = 0 to h - 1 do set_scanline dst i (get_strip t x (y + i) w) done; dst with | e -> destroy dst; raise e let copy t = sub t 0 0 t.width t.height let blit src sx sy dst dx dy w h = Region.check src.width src.height sx sy; Region.check src.width src.height (sx + w - 1) (sy + h - 1); Region.check dst.width dst.height dx dy; Region.check dst.width dst.height (dx + w - 1) (dy + h - 1); for i = 0 to h - 1 do set_strip dst dx (dy + i) w (get_strip src sx (sy + i) w) done let blocks bmp = bmp.blocks_x, bmp.blocks_y let dump_block bmp x y = let blk = bmp.data.(x).(y) in let at_x = x * bmp.block_size_width in let at_y = y * bmp.block_size_height in let w = if x = bmp.blocks_x - 1 then bmp.width - at_x else bmp.block_size_width in let h = if y = bmp.blocks_y - 1 then bmp.height - at_y else bmp.block_size_height in { Block.width = w; height = h; x = at_x; y = at_y; dump = swap_in blk } end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>