Bitmap.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478
  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. Bitmap::Bitmap(BitmapFormat format, const IntSize& size, Purgeable purgeable, const BackingStore& backing_store)
  93. : m_size(size)
  94. , m_data(backing_store.data)
  95. , m_pitch(backing_store.pitch)
  96. , m_format(format)
  97. , m_purgeable(purgeable == Purgeable::Yes)
  98. {
  99. ASSERT(!m_size.is_empty());
  100. ASSERT(!size_would_overflow(format, size));
  101. ASSERT(m_data);
  102. ASSERT(backing_store.size_in_bytes == size_in_bytes());
  103. allocate_palette_from_format(format, {});
  104. m_needs_munmap = true;
  105. }
  106. RefPtr<Bitmap> Bitmap::create_wrapper(BitmapFormat format, const IntSize& size, size_t pitch, void* data)
  107. {
  108. if (size_would_overflow(format, size))
  109. return nullptr;
  110. return adopt(*new Bitmap(format, size, pitch, data));
  111. }
  112. RefPtr<Bitmap> Bitmap::load_from_file(const StringView& path)
  113. {
  114. #define __ENUMERATE_IMAGE_FORMAT(Name, Ext) \
  115. if (path.ends_with(Ext, CaseSensitivity::CaseInsensitive)) \
  116. return load_##Name(path);
  117. ENUMERATE_IMAGE_FORMATS
  118. #undef __ENUMERATE_IMAGE_FORMAT
  119. return nullptr;
  120. }
  121. Bitmap::Bitmap(BitmapFormat format, const IntSize& size, size_t pitch, void* data)
  122. : m_size(size)
  123. , m_data(data)
  124. , m_pitch(pitch)
  125. , m_format(format)
  126. {
  127. ASSERT(pitch >= minimum_pitch(size.width(), format));
  128. ASSERT(!size_would_overflow(format, size));
  129. // FIXME: assert that `data` is actually long enough!
  130. allocate_palette_from_format(format, {});
  131. }
  132. RefPtr<Bitmap> Bitmap::create_with_shared_buffer(BitmapFormat format, NonnullRefPtr<SharedBuffer>&& shared_buffer, const IntSize& size)
  133. {
  134. return create_with_shared_buffer(format, move(shared_buffer), size, {});
  135. }
  136. static bool check_size(const IntSize& size, BitmapFormat format, unsigned actual_size)
  137. {
  138. // FIXME: Code duplication of size_in_bytes() and m_pitch
  139. unsigned expected_size_min = Bitmap::minimum_pitch(size.width(), format) * size.height();
  140. unsigned expected_size_max = round_up_to_power_of_two(expected_size_min, PAGE_SIZE);
  141. if (expected_size_min > actual_size || actual_size > expected_size_max) {
  142. // Getting here is most likely an error.
  143. 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 << ".";
  144. dbg() << "However, we were given " << actual_size << " bytes, which is outside this range?! Refusing cowardly.";
  145. return false;
  146. }
  147. return true;
  148. }
  149. RefPtr<Bitmap> Bitmap::create_with_shared_buffer(BitmapFormat format, NonnullRefPtr<SharedBuffer>&& shared_buffer, const IntSize& size, const Vector<RGBA32>& palette)
  150. {
  151. if (size_would_overflow(format, size))
  152. return nullptr;
  153. if (!check_size(size, format, shared_buffer->size()))
  154. return {};
  155. return adopt(*new Bitmap(format, move(shared_buffer), size, palette));
  156. }
  157. /// Read a bitmap as described by:
  158. /// - actual size
  159. /// - width
  160. /// - height
  161. /// - format
  162. /// - palette count
  163. /// - palette data (= palette count * RGBA32)
  164. /// - image data (= actual size * u8)
  165. RefPtr<Bitmap> Bitmap::create_from_serialized_byte_buffer(ByteBuffer&& buffer)
  166. {
  167. InputMemoryStream stream { buffer };
  168. unsigned actual_size;
  169. unsigned width;
  170. unsigned height;
  171. BitmapFormat format;
  172. unsigned palette_size;
  173. Vector<RGBA32> palette;
  174. auto read = [&]<typename T>(T& value) {
  175. if (stream.read({ &value, sizeof(T) }) != sizeof(T))
  176. return false;
  177. return true;
  178. };
  179. if (!read(actual_size) || !read(width) || !read(height) || !read(format) || !read(palette_size))
  180. return nullptr;
  181. if (format > BitmapFormat::RGBA32 || format < BitmapFormat::Indexed1)
  182. return nullptr;
  183. if (!check_size({ width, height }, format, actual_size))
  184. return {};
  185. palette.ensure_capacity(palette_size);
  186. for (size_t i = 0; i < palette_size; ++i) {
  187. if (!read(palette[i]))
  188. return {};
  189. }
  190. if (stream.remaining() < actual_size)
  191. return {};
  192. auto data = stream.bytes().slice(stream.offset(), actual_size);
  193. auto bitmap = Bitmap::create(format, { width, height });
  194. if (!bitmap)
  195. return {};
  196. bitmap->m_palette = new RGBA32[palette_size];
  197. memcpy(bitmap->m_palette, palette.data(), palette_size * sizeof(RGBA32));
  198. data.copy_to({ bitmap->scanline(0), bitmap->size_in_bytes() });
  199. return bitmap;
  200. }
  201. ByteBuffer Bitmap::serialize_to_byte_buffer() const
  202. {
  203. auto buffer = ByteBuffer::create_uninitialized(4 * sizeof(unsigned) + sizeof(BitmapFormat) + sizeof(RGBA32) * palette_size(m_format) + size_in_bytes());
  204. OutputMemoryStream stream { buffer };
  205. auto write = [&]<typename T>(T value) {
  206. if (stream.write({ &value, sizeof(T) }) != sizeof(T))
  207. return false;
  208. return true;
  209. };
  210. auto palette = palette_to_vector();
  211. if (!write(size_in_bytes()) || !write((unsigned)size().width()) || !write((unsigned)size().height()) || !write(m_format) || !write((unsigned)palette.size()))
  212. return {};
  213. for (auto& p : palette) {
  214. if (!write(p))
  215. return {};
  216. }
  217. auto size = size_in_bytes();
  218. ASSERT(stream.remaining() == size);
  219. if (stream.write({ scanline(0), size }) != size)
  220. return {};
  221. return buffer;
  222. }
  223. Bitmap::Bitmap(BitmapFormat format, NonnullRefPtr<SharedBuffer>&& shared_buffer, const IntSize& size, const Vector<RGBA32>& palette)
  224. : m_size(size)
  225. , m_data(shared_buffer->data<void>())
  226. , m_pitch(minimum_pitch(size.width(), format))
  227. , m_format(format)
  228. , m_shared_buffer(move(shared_buffer))
  229. {
  230. ASSERT(!is_indexed() || !palette.is_empty());
  231. ASSERT(!size_would_overflow(format, size));
  232. ASSERT(size_in_bytes() <= static_cast<size_t>(m_shared_buffer->size()));
  233. if (is_indexed(m_format))
  234. allocate_palette_from_format(m_format, palette);
  235. }
  236. RefPtr<Gfx::Bitmap> Bitmap::clone() const
  237. {
  238. RefPtr<Gfx::Bitmap> new_bitmap {};
  239. if (m_purgeable) {
  240. new_bitmap = Bitmap::create_purgeable(format(), size());
  241. } else {
  242. new_bitmap = Bitmap::create(format(), size());
  243. }
  244. if (!new_bitmap) {
  245. return nullptr;
  246. }
  247. ASSERT(size_in_bytes() == new_bitmap->size_in_bytes());
  248. memcpy(new_bitmap->scanline(0), scanline(0), size_in_bytes());
  249. return new_bitmap;
  250. }
  251. RefPtr<Gfx::Bitmap> Bitmap::rotated(Gfx::RotationDirection rotation_direction) const
  252. {
  253. auto w = this->width();
  254. auto h = this->height();
  255. auto new_bitmap = Gfx::Bitmap::create(this->format(), { h, w });
  256. if (!new_bitmap)
  257. return nullptr;
  258. for (int i = 0; i < w; i++) {
  259. for (int j = 0; j < h; j++) {
  260. Color color;
  261. if (rotation_direction == Gfx::RotationDirection::Left)
  262. color = this->get_pixel(w - i - 1, j);
  263. else
  264. color = this->get_pixel(i, h - j - 1);
  265. new_bitmap->set_pixel(j, i, color);
  266. }
  267. }
  268. return new_bitmap;
  269. }
  270. RefPtr<Gfx::Bitmap> Bitmap::flipped(Gfx::Orientation orientation) const
  271. {
  272. auto w = this->width();
  273. auto h = this->height();
  274. auto new_bitmap = Gfx::Bitmap::create(this->format(), { w, h });
  275. if (!new_bitmap)
  276. return nullptr;
  277. for (int i = 0; i < w; i++) {
  278. for (int j = 0; j < h; j++) {
  279. Color color = this->get_pixel(i, j);
  280. if (orientation == Orientation::Vertical)
  281. new_bitmap->set_pixel(i, h - j - 1, color);
  282. else
  283. new_bitmap->set_pixel(w - i - 1, j, color);
  284. }
  285. }
  286. return new_bitmap;
  287. }
  288. RefPtr<Bitmap> Bitmap::to_bitmap_backed_by_shared_buffer() const
  289. {
  290. if (m_shared_buffer)
  291. return *this;
  292. auto buffer = SharedBuffer::create_with_size(size_in_bytes());
  293. auto bitmap = Bitmap::create_with_shared_buffer(m_format, *buffer, m_size, palette_to_vector());
  294. if (!bitmap)
  295. return nullptr;
  296. memcpy(buffer->data<void>(), scanline(0), size_in_bytes());
  297. return bitmap;
  298. }
  299. Bitmap::~Bitmap()
  300. {
  301. if (m_needs_munmap) {
  302. int rc = munmap(m_data, size_in_bytes());
  303. ASSERT(rc == 0);
  304. }
  305. m_data = nullptr;
  306. delete[] m_palette;
  307. }
  308. void Bitmap::set_mmap_name(const StringView& name)
  309. {
  310. ASSERT(m_needs_munmap);
  311. #ifdef __serenity__
  312. ::set_mmap_name(m_data, size_in_bytes(), name.to_string().characters());
  313. #else
  314. (void)name;
  315. #endif
  316. }
  317. void Bitmap::fill(Color color)
  318. {
  319. ASSERT(!is_indexed(m_format));
  320. for (int y = 0; y < height(); ++y) {
  321. auto* scanline = this->scanline(y);
  322. fast_u32_fill(scanline, color.value(), width());
  323. }
  324. }
  325. void Bitmap::set_volatile()
  326. {
  327. ASSERT(m_purgeable);
  328. if (m_volatile)
  329. return;
  330. #ifdef __serenity__
  331. int rc = madvise(m_data, size_in_bytes(), MADV_SET_VOLATILE);
  332. if (rc < 0) {
  333. perror("madvise(MADV_SET_VOLATILE)");
  334. ASSERT_NOT_REACHED();
  335. }
  336. #endif
  337. m_volatile = true;
  338. }
  339. [[nodiscard]] bool Bitmap::set_nonvolatile()
  340. {
  341. ASSERT(m_purgeable);
  342. if (!m_volatile)
  343. return true;
  344. #ifdef __serenity__
  345. int rc = madvise(m_data, size_in_bytes(), MADV_SET_NONVOLATILE);
  346. if (rc < 0) {
  347. perror("madvise(MADV_SET_NONVOLATILE)");
  348. ASSERT_NOT_REACHED();
  349. }
  350. #else
  351. int rc = 0;
  352. #endif
  353. m_volatile = false;
  354. return rc == 0;
  355. }
  356. int Bitmap::shbuf_id() const
  357. {
  358. return m_shared_buffer ? m_shared_buffer->shbuf_id() : -1;
  359. }
  360. ShareableBitmap Bitmap::to_shareable_bitmap(pid_t peer_pid) const
  361. {
  362. auto bitmap = to_bitmap_backed_by_shared_buffer();
  363. if (!bitmap)
  364. return {};
  365. if (peer_pid > 0)
  366. bitmap->shared_buffer()->share_with(peer_pid);
  367. return ShareableBitmap(*bitmap);
  368. }
  369. Optional<BackingStore> Bitmap::allocate_backing_store(BitmapFormat format, const IntSize& size, Purgeable purgeable)
  370. {
  371. if (size_would_overflow(format, size))
  372. return {};
  373. const auto pitch = minimum_pitch(size.width(), format);
  374. const auto data_size_in_bytes = size_in_bytes(pitch, size.height());
  375. void* data = nullptr;
  376. #ifdef __serenity__
  377. int map_flags = purgeable == Purgeable::Yes ? (MAP_PURGEABLE | MAP_PRIVATE) : (MAP_ANONYMOUS | MAP_PRIVATE);
  378. 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());
  379. #else
  380. UNUSED_PARAM(purgeable);
  381. int map_flags = (MAP_ANONYMOUS | MAP_PRIVATE);
  382. data = mmap(nullptr, data_size_in_bytes, PROT_READ | PROT_WRITE, map_flags, 0, 0);
  383. #endif
  384. if (data == MAP_FAILED) {
  385. perror("mmap");
  386. return {};
  387. }
  388. return { { data, pitch, data_size_in_bytes } };
  389. }
  390. void Bitmap::allocate_palette_from_format(BitmapFormat format, const Vector<RGBA32>& source_palette)
  391. {
  392. size_t size = palette_size(format);
  393. if (size == 0)
  394. return;
  395. m_palette = new RGBA32[size];
  396. if (!source_palette.is_empty()) {
  397. ASSERT(source_palette.size() == size);
  398. memcpy(m_palette, source_palette.data(), size * sizeof(RGBA32));
  399. }
  400. }
  401. Vector<RGBA32> Bitmap::palette_to_vector() const
  402. {
  403. Vector<RGBA32> vector;
  404. auto size = palette_size(m_format);
  405. vector.ensure_capacity(size);
  406. for (size_t i = 0; i < size; ++i)
  407. vector.unchecked_append(palette_color(i).value());
  408. return vector;
  409. }
  410. }