Bitmap.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <AK/Checked.h>
  27. #include <AK/Memory.h>
  28. #include <AK/MemoryStream.h>
  29. #include <AK/Optional.h>
  30. #include <AK/SharedBuffer.h>
  31. #include <AK/String.h>
  32. #include <LibGfx/BMPLoader.h>
  33. #include <LibGfx/Bitmap.h>
  34. #include <LibGfx/GIFLoader.h>
  35. #include <LibGfx/ICOLoader.h>
  36. #include <LibGfx/JPGLoader.h>
  37. #include <LibGfx/PBMLoader.h>
  38. #include <LibGfx/PGMLoader.h>
  39. #include <LibGfx/PNGLoader.h>
  40. #include <LibGfx/PPMLoader.h>
  41. #include <LibGfx/ShareableBitmap.h>
  42. #include <fcntl.h>
  43. #include <stdio.h>
  44. #include <sys/mman.h>
  45. namespace Gfx {
  46. struct BackingStore {
  47. void* data { nullptr };
  48. size_t pitch { 0 };
  49. size_t size_in_bytes { 0 };
  50. };
  51. size_t Bitmap::minimum_pitch(size_t width, BitmapFormat format)
  52. {
  53. size_t element_size;
  54. switch (determine_storage_format(format)) {
  55. case StorageFormat::Indexed8:
  56. element_size = 1;
  57. break;
  58. case StorageFormat::RGB32:
  59. case StorageFormat::RGBA32:
  60. element_size = 4;
  61. break;
  62. default:
  63. ASSERT_NOT_REACHED();
  64. }
  65. return width * element_size;
  66. }
  67. static bool size_would_overflow(BitmapFormat format, const IntSize& size)
  68. {
  69. if (size.width() < 0 || size.height() < 0)
  70. return true;
  71. // This check is a bit arbitrary, but should protect us from most shenanigans:
  72. if (size.width() >= 32768 || size.height() >= 32768)
  73. return true;
  74. // In contrast, this check is absolutely necessary:
  75. size_t pitch = Bitmap::minimum_pitch(size.width(), format);
  76. return Checked<size_t>::multiplication_would_overflow(pitch, size.height());
  77. }
  78. RefPtr<Bitmap> Bitmap::create(BitmapFormat format, const IntSize& size)
  79. {
  80. auto backing_store = Bitmap::allocate_backing_store(format, size, Purgeable::No);
  81. if (!backing_store.has_value())
  82. return nullptr;
  83. return adopt(*new Bitmap(format, size, Purgeable::No, backing_store.value()));
  84. }
  85. RefPtr<Bitmap> Bitmap::create_purgeable(BitmapFormat format, const IntSize& size)
  86. {
  87. auto backing_store = Bitmap::allocate_backing_store(format, size, Purgeable::Yes);
  88. if (!backing_store.has_value())
  89. return nullptr;
  90. return adopt(*new Bitmap(format, size, Purgeable::Yes, backing_store.value()));
  91. }
  92. RefPtr<Bitmap> Bitmap::create_shareable(BitmapFormat format, const IntSize& size)
  93. {
  94. if (size_would_overflow(format, size))
  95. return nullptr;
  96. const auto pitch = minimum_pitch(size.width(), format);
  97. const auto data_size = size_in_bytes(pitch, size.height());
  98. auto shared_buffer = SharedBuffer::create_with_size(data_size);
  99. if (!shared_buffer)
  100. return nullptr;
  101. return adopt(*new Bitmap(format, shared_buffer.release_nonnull(), size, Vector<RGBA32>()));
  102. }
  103. Bitmap::Bitmap(BitmapFormat format, const IntSize& size, Purgeable purgeable, const BackingStore& backing_store)
  104. : m_size(size)
  105. , m_data(backing_store.data)
  106. , m_pitch(backing_store.pitch)
  107. , m_format(format)
  108. , m_purgeable(purgeable == Purgeable::Yes)
  109. {
  110. ASSERT(!m_size.is_empty());
  111. ASSERT(!size_would_overflow(format, size));
  112. ASSERT(m_data);
  113. ASSERT(backing_store.size_in_bytes == size_in_bytes());
  114. allocate_palette_from_format(format, {});
  115. m_needs_munmap = true;
  116. }
  117. RefPtr<Bitmap> Bitmap::create_wrapper(BitmapFormat format, const IntSize& size, size_t pitch, void* data)
  118. {
  119. if (size_would_overflow(format, size))
  120. return nullptr;
  121. return adopt(*new Bitmap(format, size, pitch, data));
  122. }
  123. RefPtr<Bitmap> Bitmap::load_from_file(const StringView& path)
  124. {
  125. #define __ENUMERATE_IMAGE_FORMAT(Name, Ext) \
  126. if (path.ends_with(Ext, CaseSensitivity::CaseInsensitive)) \
  127. return load_##Name(path);
  128. ENUMERATE_IMAGE_FORMATS
  129. #undef __ENUMERATE_IMAGE_FORMAT
  130. return nullptr;
  131. }
  132. Bitmap::Bitmap(BitmapFormat format, const IntSize& size, size_t pitch, void* data)
  133. : m_size(size)
  134. , m_data(data)
  135. , m_pitch(pitch)
  136. , m_format(format)
  137. {
  138. ASSERT(pitch >= minimum_pitch(size.width(), format));
  139. ASSERT(!size_would_overflow(format, size));
  140. // FIXME: assert that `data` is actually long enough!
  141. allocate_palette_from_format(format, {});
  142. }
  143. RefPtr<Bitmap> Bitmap::create_with_shared_buffer(BitmapFormat format, NonnullRefPtr<SharedBuffer>&& shared_buffer, const IntSize& size)
  144. {
  145. return create_with_shared_buffer(format, move(shared_buffer), size, {});
  146. }
  147. static bool check_size(const IntSize& size, BitmapFormat format, unsigned actual_size)
  148. {
  149. // FIXME: Code duplication of size_in_bytes() and m_pitch
  150. unsigned expected_size_min = Bitmap::minimum_pitch(size.width(), format) * size.height();
  151. unsigned expected_size_max = round_up_to_power_of_two(expected_size_min, PAGE_SIZE);
  152. if (expected_size_min > actual_size || actual_size > expected_size_max) {
  153. // Getting here is most likely an error.
  154. dbg() << "Constructing a shared bitmap for format " << (int)format << " and size " << size << ", which demands " << expected_size_min << " bytes, which rounds up to at most " << expected_size_max << ".";
  155. dbg() << "However, we were given " << actual_size << " bytes, which is outside this range?! Refusing cowardly.";
  156. return false;
  157. }
  158. return true;
  159. }
  160. RefPtr<Bitmap> Bitmap::create_with_shared_buffer(BitmapFormat format, NonnullRefPtr<SharedBuffer>&& shared_buffer, const IntSize& size, const Vector<RGBA32>& palette)
  161. {
  162. if (size_would_overflow(format, size))
  163. return nullptr;
  164. if (!check_size(size, format, shared_buffer->size()))
  165. return {};
  166. return adopt(*new Bitmap(format, move(shared_buffer), size, palette));
  167. }
  168. /// Read a bitmap as described by:
  169. /// - actual size
  170. /// - width
  171. /// - height
  172. /// - format
  173. /// - palette count
  174. /// - palette data (= palette count * RGBA32)
  175. /// - image data (= actual size * u8)
  176. RefPtr<Bitmap> Bitmap::create_from_serialized_byte_buffer(ByteBuffer&& buffer)
  177. {
  178. InputMemoryStream stream { buffer };
  179. unsigned actual_size;
  180. unsigned width;
  181. unsigned height;
  182. BitmapFormat format;
  183. unsigned palette_size;
  184. Vector<RGBA32> palette;
  185. auto read = [&]<typename T>(T& value) {
  186. if (stream.read({ &value, sizeof(T) }) != sizeof(T))
  187. return false;
  188. return true;
  189. };
  190. if (!read(actual_size) || !read(width) || !read(height) || !read(format) || !read(palette_size))
  191. return nullptr;
  192. if (format > BitmapFormat::RGBA32 || format < BitmapFormat::Indexed1)
  193. return nullptr;
  194. if (!check_size({ width, height }, format, actual_size))
  195. return {};
  196. palette.ensure_capacity(palette_size);
  197. for (size_t i = 0; i < palette_size; ++i) {
  198. if (!read(palette[i]))
  199. return {};
  200. }
  201. if (stream.remaining() < actual_size)
  202. return {};
  203. auto data = stream.bytes().slice(stream.offset(), actual_size);
  204. auto bitmap = Bitmap::create(format, { width, height });
  205. if (!bitmap)
  206. return {};
  207. bitmap->m_palette = new RGBA32[palette_size];
  208. memcpy(bitmap->m_palette, palette.data(), palette_size * sizeof(RGBA32));
  209. data.copy_to({ bitmap->scanline(0), bitmap->size_in_bytes() });
  210. return bitmap;
  211. }
  212. ByteBuffer Bitmap::serialize_to_byte_buffer() const
  213. {
  214. auto buffer = ByteBuffer::create_uninitialized(4 * sizeof(unsigned) + sizeof(BitmapFormat) + sizeof(RGBA32) * palette_size(m_format) + size_in_bytes());
  215. OutputMemoryStream stream { buffer };
  216. auto write = [&]<typename T>(T value) {
  217. if (stream.write({ &value, sizeof(T) }) != sizeof(T))
  218. return false;
  219. return true;
  220. };
  221. auto palette = palette_to_vector();
  222. if (!write(size_in_bytes()) || !write((unsigned)size().width()) || !write((unsigned)size().height()) || !write(m_format) || !write((unsigned)palette.size()))
  223. return {};
  224. for (auto& p : palette) {
  225. if (!write(p))
  226. return {};
  227. }
  228. auto size = size_in_bytes();
  229. ASSERT(stream.remaining() == size);
  230. if (stream.write({ scanline(0), size }) != size)
  231. return {};
  232. return buffer;
  233. }
  234. Bitmap::Bitmap(BitmapFormat format, NonnullRefPtr<SharedBuffer>&& shared_buffer, const IntSize& size, const Vector<RGBA32>& palette)
  235. : m_size(size)
  236. , m_data(shared_buffer->data<void>())
  237. , m_pitch(minimum_pitch(size.width(), format))
  238. , m_format(format)
  239. , m_shared_buffer(move(shared_buffer))
  240. {
  241. ASSERT(!is_indexed() || !palette.is_empty());
  242. ASSERT(!size_would_overflow(format, size));
  243. ASSERT(size_in_bytes() <= static_cast<size_t>(m_shared_buffer->size()));
  244. if (is_indexed(m_format))
  245. allocate_palette_from_format(m_format, palette);
  246. }
  247. RefPtr<Gfx::Bitmap> Bitmap::clone() const
  248. {
  249. RefPtr<Gfx::Bitmap> new_bitmap {};
  250. if (m_purgeable) {
  251. new_bitmap = Bitmap::create_purgeable(format(), size());
  252. } else {
  253. new_bitmap = Bitmap::create(format(), size());
  254. }
  255. if (!new_bitmap) {
  256. return nullptr;
  257. }
  258. ASSERT(size_in_bytes() == new_bitmap->size_in_bytes());
  259. memcpy(new_bitmap->scanline(0), scanline(0), size_in_bytes());
  260. return new_bitmap;
  261. }
  262. RefPtr<Gfx::Bitmap> Bitmap::rotated(Gfx::RotationDirection rotation_direction) const
  263. {
  264. auto w = this->width();
  265. auto h = this->height();
  266. auto new_bitmap = Gfx::Bitmap::create(this->format(), { h, w });
  267. if (!new_bitmap)
  268. return nullptr;
  269. for (int i = 0; i < w; i++) {
  270. for (int j = 0; j < h; j++) {
  271. Color color;
  272. if (rotation_direction == Gfx::RotationDirection::Left)
  273. color = this->get_pixel(w - i - 1, j);
  274. else
  275. color = this->get_pixel(i, h - j - 1);
  276. new_bitmap->set_pixel(j, i, color);
  277. }
  278. }
  279. return new_bitmap;
  280. }
  281. RefPtr<Gfx::Bitmap> Bitmap::flipped(Gfx::Orientation orientation) const
  282. {
  283. auto w = this->width();
  284. auto h = this->height();
  285. auto new_bitmap = Gfx::Bitmap::create(this->format(), { w, h });
  286. if (!new_bitmap)
  287. return nullptr;
  288. for (int i = 0; i < w; i++) {
  289. for (int j = 0; j < h; j++) {
  290. Color color = this->get_pixel(i, j);
  291. if (orientation == Orientation::Vertical)
  292. new_bitmap->set_pixel(i, h - j - 1, color);
  293. else
  294. new_bitmap->set_pixel(w - i - 1, j, color);
  295. }
  296. }
  297. return new_bitmap;
  298. }
  299. RefPtr<Bitmap> Bitmap::to_bitmap_backed_by_shared_buffer() const
  300. {
  301. if (m_shared_buffer)
  302. return *this;
  303. auto buffer = SharedBuffer::create_with_size(size_in_bytes());
  304. if (!buffer)
  305. return nullptr;
  306. auto bitmap = Bitmap::create_with_shared_buffer(m_format, *buffer, m_size, palette_to_vector());
  307. if (!bitmap)
  308. return nullptr;
  309. memcpy(buffer->data<void>(), scanline(0), size_in_bytes());
  310. return bitmap;
  311. }
  312. Bitmap::~Bitmap()
  313. {
  314. if (m_needs_munmap) {
  315. int rc = munmap(m_data, size_in_bytes());
  316. ASSERT(rc == 0);
  317. }
  318. m_data = nullptr;
  319. delete[] m_palette;
  320. }
  321. void Bitmap::set_mmap_name([[maybe_unused]] const StringView& name)
  322. {
  323. ASSERT(m_needs_munmap);
  324. #ifdef __serenity__
  325. ::set_mmap_name(m_data, size_in_bytes(), name.to_string().characters());
  326. #endif
  327. }
  328. void Bitmap::fill(Color color)
  329. {
  330. ASSERT(!is_indexed(m_format));
  331. for (int y = 0; y < height(); ++y) {
  332. auto* scanline = this->scanline(y);
  333. fast_u32_fill(scanline, color.value(), width());
  334. }
  335. }
  336. void Bitmap::set_volatile()
  337. {
  338. ASSERT(m_purgeable);
  339. if (m_volatile)
  340. return;
  341. #ifdef __serenity__
  342. int rc = madvise(m_data, size_in_bytes(), MADV_SET_VOLATILE);
  343. if (rc < 0) {
  344. perror("madvise(MADV_SET_VOLATILE)");
  345. ASSERT_NOT_REACHED();
  346. }
  347. #endif
  348. m_volatile = true;
  349. }
  350. [[nodiscard]] bool Bitmap::set_nonvolatile()
  351. {
  352. ASSERT(m_purgeable);
  353. if (!m_volatile)
  354. return true;
  355. #ifdef __serenity__
  356. int rc = madvise(m_data, size_in_bytes(), MADV_SET_NONVOLATILE);
  357. if (rc < 0) {
  358. perror("madvise(MADV_SET_NONVOLATILE)");
  359. ASSERT_NOT_REACHED();
  360. }
  361. #else
  362. int rc = 0;
  363. #endif
  364. m_volatile = false;
  365. return rc == 0;
  366. }
  367. int Bitmap::shbuf_id() const
  368. {
  369. return m_shared_buffer ? m_shared_buffer->shbuf_id() : -1;
  370. }
  371. ShareableBitmap Bitmap::to_shareable_bitmap(pid_t peer_pid) const
  372. {
  373. auto bitmap = to_bitmap_backed_by_shared_buffer();
  374. if (!bitmap)
  375. return {};
  376. if (peer_pid > 0)
  377. bitmap->shared_buffer()->share_with(peer_pid);
  378. return ShareableBitmap(*bitmap);
  379. }
  380. Optional<BackingStore> Bitmap::allocate_backing_store(BitmapFormat format, const IntSize& size, [[maybe_unused]] Purgeable purgeable)
  381. {
  382. if (size_would_overflow(format, size))
  383. return {};
  384. const auto pitch = minimum_pitch(size.width(), format);
  385. const auto data_size_in_bytes = size_in_bytes(pitch, size.height());
  386. int map_flags = MAP_ANONYMOUS | MAP_PRIVATE;
  387. if (purgeable == Purgeable::Yes)
  388. map_flags |= MAP_NORESERVE;
  389. #ifdef __serenity__
  390. void* data = mmap_with_name(nullptr, data_size_in_bytes, PROT_READ | PROT_WRITE, map_flags, 0, 0, String::format("GraphicsBitmap [%dx%d]", size.width(), size.height()).characters());
  391. #else
  392. void* data = mmap(nullptr, data_size_in_bytes, PROT_READ | PROT_WRITE, map_flags, 0, 0);
  393. #endif
  394. if (data == MAP_FAILED) {
  395. perror("mmap");
  396. return {};
  397. }
  398. return { { data, pitch, data_size_in_bytes } };
  399. }
  400. void Bitmap::allocate_palette_from_format(BitmapFormat format, const Vector<RGBA32>& source_palette)
  401. {
  402. size_t size = palette_size(format);
  403. if (size == 0)
  404. return;
  405. m_palette = new RGBA32[size];
  406. if (!source_palette.is_empty()) {
  407. ASSERT(source_palette.size() == size);
  408. memcpy(m_palette, source_palette.data(), size * sizeof(RGBA32));
  409. }
  410. }
  411. Vector<RGBA32> Bitmap::palette_to_vector() const
  412. {
  413. Vector<RGBA32> vector;
  414. auto size = palette_size(m_format);
  415. vector.ensure_capacity(size);
  416. for (size_t i = 0; i < size; ++i)
  417. vector.unchecked_append(palette_color(i).value());
  418. return vector;
  419. }
  420. }