Bitmap.cpp 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685
  1. /*
  2. * Copyright (c) 2018-2021, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2022, Timothy Slater <tslater2006@gmail.com>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <AK/Bitmap.h>
  8. #include <AK/Checked.h>
  9. #include <AK/DeprecatedString.h>
  10. #include <AK/LexicalPath.h>
  11. #include <AK/Memory.h>
  12. #include <AK/MemoryStream.h>
  13. #include <AK/Optional.h>
  14. #include <AK/Queue.h>
  15. #include <AK/ScopeGuard.h>
  16. #include <AK/Try.h>
  17. #include <LibCore/MappedFile.h>
  18. #include <LibCore/System.h>
  19. #include <LibGfx/Bitmap.h>
  20. #include <LibGfx/ImageDecoder.h>
  21. #include <LibGfx/ShareableBitmap.h>
  22. #include <errno.h>
  23. #include <fcntl.h>
  24. #include <stdio.h>
  25. #include <sys/mman.h>
  26. namespace Gfx {
  27. struct BackingStore {
  28. void* data { nullptr };
  29. size_t pitch { 0 };
  30. size_t size_in_bytes { 0 };
  31. };
  32. size_t Bitmap::minimum_pitch(size_t physical_width, BitmapFormat format)
  33. {
  34. size_t element_size;
  35. switch (determine_storage_format(format)) {
  36. case StorageFormat::Indexed8:
  37. element_size = 1;
  38. break;
  39. case StorageFormat::BGRx8888:
  40. case StorageFormat::BGRA8888:
  41. case StorageFormat::RGBA8888:
  42. element_size = 4;
  43. break;
  44. default:
  45. VERIFY_NOT_REACHED();
  46. }
  47. return physical_width * element_size;
  48. }
  49. static bool size_would_overflow(BitmapFormat format, IntSize size, int scale_factor)
  50. {
  51. if (size.width() < 0 || size.height() < 0)
  52. return true;
  53. // This check is a bit arbitrary, but should protect us from most shenanigans:
  54. if (size.width() >= INT16_MAX || size.height() >= INT16_MAX || scale_factor < 1 || scale_factor > 4)
  55. return true;
  56. // In contrast, this check is absolutely necessary:
  57. size_t pitch = Bitmap::minimum_pitch(size.width() * scale_factor, format);
  58. return Checked<size_t>::multiplication_would_overflow(pitch, size.height() * scale_factor);
  59. }
  60. ErrorOr<NonnullRefPtr<Bitmap>> Bitmap::try_create(BitmapFormat format, IntSize size, int scale_factor)
  61. {
  62. auto backing_store = TRY(Bitmap::allocate_backing_store(format, size, scale_factor));
  63. return AK::adopt_nonnull_ref_or_enomem(new (nothrow) Bitmap(format, size, scale_factor, backing_store));
  64. }
  65. ErrorOr<NonnullRefPtr<Bitmap>> Bitmap::try_create_shareable(BitmapFormat format, IntSize size, int scale_factor)
  66. {
  67. if (size_would_overflow(format, size, scale_factor))
  68. return Error::from_string_literal("Gfx::Bitmap::try_create_shareable size overflow");
  69. auto const pitch = minimum_pitch(size.width() * scale_factor, format);
  70. auto const data_size = size_in_bytes(pitch, size.height() * scale_factor);
  71. auto buffer = TRY(Core::AnonymousBuffer::create_with_size(round_up_to_power_of_two(data_size, PAGE_SIZE)));
  72. auto bitmap = TRY(Bitmap::try_create_with_anonymous_buffer(format, buffer, size, scale_factor, {}));
  73. return bitmap;
  74. }
  75. Bitmap::Bitmap(BitmapFormat format, IntSize size, int scale_factor, BackingStore const& backing_store)
  76. : m_size(size)
  77. , m_scale(scale_factor)
  78. , m_data(backing_store.data)
  79. , m_pitch(backing_store.pitch)
  80. , m_format(format)
  81. {
  82. VERIFY(!m_size.is_empty());
  83. VERIFY(!size_would_overflow(format, size, scale_factor));
  84. VERIFY(m_data);
  85. VERIFY(backing_store.size_in_bytes == size_in_bytes());
  86. allocate_palette_from_format(format, {});
  87. m_needs_munmap = true;
  88. }
  89. ErrorOr<NonnullRefPtr<Bitmap>> Bitmap::try_create_wrapper(BitmapFormat format, IntSize size, int scale_factor, size_t pitch, void* data)
  90. {
  91. if (size_would_overflow(format, size, scale_factor))
  92. return Error::from_string_literal("Gfx::Bitmap::try_create_wrapper size overflow");
  93. return adopt_ref(*new Bitmap(format, size, scale_factor, pitch, data));
  94. }
  95. ErrorOr<NonnullRefPtr<Bitmap>> Bitmap::try_load_from_file(StringView path, int scale_factor)
  96. {
  97. if (scale_factor > 1 && path.starts_with("/res/"sv)) {
  98. auto load_scaled_bitmap = [](StringView path, int scale_factor) -> ErrorOr<NonnullRefPtr<Bitmap>> {
  99. LexicalPath lexical_path { path };
  100. StringBuilder highdpi_icon_path;
  101. TRY(highdpi_icon_path.try_appendff("{}/{}-{}x.{}", lexical_path.dirname(), lexical_path.title(), scale_factor, lexical_path.extension()));
  102. auto highdpi_icon_string = highdpi_icon_path.string_view();
  103. auto fd = TRY(Core::System::open(highdpi_icon_string, O_RDONLY));
  104. auto bitmap = TRY(try_load_from_fd_and_close(fd, highdpi_icon_string));
  105. if (bitmap->width() % scale_factor != 0 || bitmap->height() % scale_factor != 0)
  106. return Error::from_string_literal("Bitmap::try_load_from_file: HighDPI image size should be divisible by scale factor");
  107. bitmap->m_size.set_width(bitmap->width() / scale_factor);
  108. bitmap->m_size.set_height(bitmap->height() / scale_factor);
  109. bitmap->m_scale = scale_factor;
  110. return bitmap;
  111. };
  112. auto scaled_bitmap_or_error = load_scaled_bitmap(path, scale_factor);
  113. if (!scaled_bitmap_or_error.is_error())
  114. return scaled_bitmap_or_error.release_value();
  115. auto error = scaled_bitmap_or_error.release_error();
  116. if (!(error.is_syscall() && error.code() == ENOENT)) {
  117. dbgln("Couldn't load scaled bitmap: {}", error);
  118. dbgln("Trying base scale instead.");
  119. }
  120. }
  121. auto fd = TRY(Core::System::open(path, O_RDONLY));
  122. return try_load_from_fd_and_close(fd, path);
  123. }
  124. ErrorOr<NonnullRefPtr<Bitmap>> Bitmap::try_load_from_fd_and_close(int fd, StringView path)
  125. {
  126. auto file = TRY(Core::MappedFile::map_from_fd_and_close(fd, path));
  127. if (auto decoder = ImageDecoder::try_create(file->bytes())) {
  128. auto frame = TRY(decoder->frame(0));
  129. if (auto& bitmap = frame.image)
  130. return bitmap.release_nonnull();
  131. }
  132. return Error::from_string_literal("Gfx::Bitmap unable to load from fd");
  133. }
  134. Bitmap::Bitmap(BitmapFormat format, IntSize size, int scale_factor, size_t pitch, void* data)
  135. : m_size(size)
  136. , m_scale(scale_factor)
  137. , m_data(data)
  138. , m_pitch(pitch)
  139. , m_format(format)
  140. {
  141. VERIFY(pitch >= minimum_pitch(size.width() * scale_factor, format));
  142. VERIFY(!size_would_overflow(format, size, scale_factor));
  143. // FIXME: assert that `data` is actually long enough!
  144. allocate_palette_from_format(format, {});
  145. }
  146. static bool check_size(IntSize size, int scale_factor, BitmapFormat format, unsigned actual_size)
  147. {
  148. // FIXME: Code duplication of size_in_bytes() and m_pitch
  149. unsigned expected_size_min = Bitmap::minimum_pitch(size.width() * scale_factor, format) * size.height() * scale_factor;
  150. unsigned expected_size_max = round_up_to_power_of_two(expected_size_min, PAGE_SIZE);
  151. if (expected_size_min > actual_size || actual_size > expected_size_max) {
  152. // Getting here is most likely an error.
  153. dbgln("Constructing a shared bitmap for format {} and size {} @ {}x, which demands {} bytes, which rounds up to at most {}.",
  154. static_cast<int>(format),
  155. size,
  156. scale_factor,
  157. expected_size_min,
  158. expected_size_max);
  159. dbgln("However, we were given {} bytes, which is outside this range?! Refusing cowardly.", actual_size);
  160. return false;
  161. }
  162. return true;
  163. }
  164. ErrorOr<NonnullRefPtr<Bitmap>> Bitmap::try_create_with_anonymous_buffer(BitmapFormat format, Core::AnonymousBuffer buffer, IntSize size, int scale_factor, Vector<ARGB32> const& palette)
  165. {
  166. if (size_would_overflow(format, size, scale_factor))
  167. return Error::from_string_literal("Gfx::Bitmap::try_create_with_anonymous_buffer size overflow");
  168. return adopt_nonnull_ref_or_enomem(new (nothrow) Bitmap(format, move(buffer), size, scale_factor, palette));
  169. }
  170. /// Read a bitmap as described by:
  171. /// - actual size
  172. /// - width
  173. /// - height
  174. /// - scale_factor
  175. /// - format
  176. /// - palette count
  177. /// - palette data (= palette count * BGRA8888)
  178. /// - image data (= actual size * u8)
  179. ErrorOr<NonnullRefPtr<Bitmap>> Bitmap::try_create_from_serialized_byte_buffer(ByteBuffer&& buffer)
  180. {
  181. InputMemoryStream stream { buffer };
  182. size_t actual_size;
  183. unsigned width;
  184. unsigned height;
  185. unsigned scale_factor;
  186. BitmapFormat format;
  187. unsigned palette_size;
  188. Vector<ARGB32> palette;
  189. auto read = [&]<typename T>(T& value) {
  190. if (stream.read({ &value, sizeof(T) }) != sizeof(T))
  191. return false;
  192. return true;
  193. };
  194. if (!read(actual_size) || !read(width) || !read(height) || !read(scale_factor) || !read(format) || !read(palette_size))
  195. return Error::from_string_literal("Gfx::Bitmap::try_create_from_serialized_byte_buffer: decode failed");
  196. if (format > BitmapFormat::BGRA8888 || format < BitmapFormat::Indexed1)
  197. return Error::from_string_literal("Gfx::Bitmap::try_create_from_serialized_byte_buffer: decode failed");
  198. if (!check_size({ width, height }, scale_factor, format, actual_size))
  199. return Error::from_string_literal("Gfx::Bitmap::try_create_from_serialized_byte_buffer: decode failed");
  200. palette.ensure_capacity(palette_size);
  201. for (size_t i = 0; i < palette_size; ++i) {
  202. if (!read(palette[i]))
  203. return Error::from_string_literal("Gfx::Bitmap::try_create_from_serialized_byte_buffer: decode failed");
  204. }
  205. if (stream.remaining() < actual_size)
  206. return Error::from_string_literal("Gfx::Bitmap::try_create_from_serialized_byte_buffer: decode failed");
  207. auto data = stream.bytes().slice(stream.offset(), actual_size);
  208. auto bitmap = TRY(Bitmap::try_create(format, { width, height }, scale_factor));
  209. bitmap->m_palette = new ARGB32[palette_size];
  210. memcpy(bitmap->m_palette, palette.data(), palette_size * sizeof(ARGB32));
  211. data.copy_to({ bitmap->scanline(0), bitmap->size_in_bytes() });
  212. return bitmap;
  213. }
  214. ByteBuffer Bitmap::serialize_to_byte_buffer() const
  215. {
  216. // FIXME: Somehow handle possible OOM situation here.
  217. auto buffer = ByteBuffer::create_uninitialized(sizeof(size_t) + 4 * sizeof(unsigned) + sizeof(BitmapFormat) + sizeof(ARGB32) * palette_size(m_format) + size_in_bytes()).release_value_but_fixme_should_propagate_errors();
  218. OutputMemoryStream stream { buffer };
  219. auto write = [&]<typename T>(T value) {
  220. if (stream.write({ &value, sizeof(T) }) != sizeof(T))
  221. return false;
  222. return true;
  223. };
  224. auto palette = palette_to_vector();
  225. if (!write(size_in_bytes()) || !write((unsigned)size().width()) || !write((unsigned)size().height()) || !write((unsigned)scale()) || !write(m_format) || !write((unsigned)palette.size()))
  226. return {};
  227. for (auto& p : palette) {
  228. if (!write(p))
  229. return {};
  230. }
  231. auto size = size_in_bytes();
  232. VERIFY(stream.remaining() == size);
  233. if (stream.write({ scanline(0), size }) != size)
  234. return {};
  235. return buffer;
  236. }
  237. Bitmap::Bitmap(BitmapFormat format, Core::AnonymousBuffer buffer, IntSize size, int scale_factor, Vector<ARGB32> const& palette)
  238. : m_size(size)
  239. , m_scale(scale_factor)
  240. , m_data(buffer.data<void>())
  241. , m_pitch(minimum_pitch(size.width() * scale_factor, format))
  242. , m_format(format)
  243. , m_buffer(move(buffer))
  244. {
  245. VERIFY(!is_indexed() || !palette.is_empty());
  246. VERIFY(!size_would_overflow(format, size, scale_factor));
  247. if (is_indexed(m_format))
  248. allocate_palette_from_format(m_format, palette);
  249. }
  250. ErrorOr<NonnullRefPtr<Gfx::Bitmap>> Bitmap::clone() const
  251. {
  252. auto new_bitmap = TRY(Bitmap::try_create(format(), size(), scale()));
  253. VERIFY(size_in_bytes() == new_bitmap->size_in_bytes());
  254. memcpy(new_bitmap->scanline(0), scanline(0), size_in_bytes());
  255. return new_bitmap;
  256. }
  257. ErrorOr<NonnullRefPtr<Gfx::Bitmap>> Bitmap::rotated(Gfx::RotationDirection rotation_direction) const
  258. {
  259. auto new_bitmap = TRY(Gfx::Bitmap::try_create(this->format(), { height(), width() }, scale()));
  260. auto w = this->physical_width();
  261. auto h = this->physical_height();
  262. for (int i = 0; i < w; i++) {
  263. for (int j = 0; j < h; j++) {
  264. Color color;
  265. if (rotation_direction == Gfx::RotationDirection::CounterClockwise)
  266. color = this->get_pixel(w - i - 1, j);
  267. else
  268. color = this->get_pixel(i, h - j - 1);
  269. new_bitmap->set_pixel(j, i, color);
  270. }
  271. }
  272. return new_bitmap;
  273. }
  274. ErrorOr<NonnullRefPtr<Gfx::Bitmap>> Bitmap::flipped(Gfx::Orientation orientation) const
  275. {
  276. auto new_bitmap = TRY(Gfx::Bitmap::try_create(this->format(), { width(), height() }, scale()));
  277. auto w = this->physical_width();
  278. auto h = this->physical_height();
  279. for (int i = 0; i < w; i++) {
  280. for (int j = 0; j < h; j++) {
  281. Color color = this->get_pixel(i, j);
  282. if (orientation == Orientation::Vertical)
  283. new_bitmap->set_pixel(i, h - j - 1, color);
  284. else
  285. new_bitmap->set_pixel(w - i - 1, j, color);
  286. }
  287. }
  288. return new_bitmap;
  289. }
  290. ErrorOr<NonnullRefPtr<Gfx::Bitmap>> Bitmap::scaled(int sx, int sy) const
  291. {
  292. VERIFY(sx >= 0 && sy >= 0);
  293. if (sx == 1 && sy == 1)
  294. return NonnullRefPtr { *this };
  295. auto new_bitmap = TRY(Gfx::Bitmap::try_create(format(), { width() * sx, height() * sy }, scale()));
  296. auto old_width = physical_width();
  297. auto old_height = physical_height();
  298. for (int y = 0; y < old_height; y++) {
  299. for (int x = 0; x < old_width; x++) {
  300. auto color = get_pixel(x, y);
  301. auto base_x = x * sx;
  302. auto base_y = y * sy;
  303. for (int new_y = base_y; new_y < base_y + sy; new_y++) {
  304. for (int new_x = base_x; new_x < base_x + sx; new_x++) {
  305. new_bitmap->set_pixel(new_x, new_y, color);
  306. }
  307. }
  308. }
  309. }
  310. return new_bitmap;
  311. }
  312. // http://fourier.eng.hmc.edu/e161/lectures/resize/node3.html
  313. ErrorOr<NonnullRefPtr<Gfx::Bitmap>> Bitmap::scaled(float sx, float sy) const
  314. {
  315. VERIFY(sx >= 0.0f && sy >= 0.0f);
  316. if (floorf(sx) == sx && floorf(sy) == sy)
  317. return scaled(static_cast<int>(sx), static_cast<int>(sy));
  318. int scaled_width = (int)ceilf(sx * (float)width());
  319. int scaled_height = (int)ceilf(sy * (float)height());
  320. auto new_bitmap = TRY(Gfx::Bitmap::try_create(format(), { scaled_width, scaled_height }, scale()));
  321. auto old_width = physical_width();
  322. auto old_height = physical_height();
  323. auto new_width = new_bitmap->physical_width();
  324. auto new_height = new_bitmap->physical_height();
  325. // The interpolation goes out of bounds on the bottom- and right-most edges.
  326. // We handle those in two specialized loops not only to make them faster, but
  327. // also to avoid four branch checks for every pixel.
  328. for (int y = 0; y < new_height - 1; y++) {
  329. for (int x = 0; x < new_width - 1; x++) {
  330. auto p = static_cast<float>(x) * static_cast<float>(old_width - 1) / static_cast<float>(new_width - 1);
  331. auto q = static_cast<float>(y) * static_cast<float>(old_height - 1) / static_cast<float>(new_height - 1);
  332. int i = floorf(p);
  333. int j = floorf(q);
  334. float u = p - static_cast<float>(i);
  335. float v = q - static_cast<float>(j);
  336. auto a = get_pixel(i, j);
  337. auto b = get_pixel(i + 1, j);
  338. auto c = get_pixel(i, j + 1);
  339. auto d = get_pixel(i + 1, j + 1);
  340. auto e = a.interpolate(b, u);
  341. auto f = c.interpolate(d, u);
  342. auto color = e.interpolate(f, v);
  343. new_bitmap->set_pixel(x, y, color);
  344. }
  345. }
  346. // Bottom strip (excluding last pixel)
  347. auto old_bottom_y = old_height - 1;
  348. auto new_bottom_y = new_height - 1;
  349. for (int x = 0; x < new_width - 1; x++) {
  350. auto p = static_cast<float>(x) * static_cast<float>(old_width - 1) / static_cast<float>(new_width - 1);
  351. int i = floorf(p);
  352. float u = p - static_cast<float>(i);
  353. auto a = get_pixel(i, old_bottom_y);
  354. auto b = get_pixel(i + 1, old_bottom_y);
  355. auto color = a.interpolate(b, u);
  356. new_bitmap->set_pixel(x, new_bottom_y, color);
  357. }
  358. // Right strip (excluding last pixel)
  359. auto old_right_x = old_width - 1;
  360. auto new_right_x = new_width - 1;
  361. for (int y = 0; y < new_height - 1; y++) {
  362. auto q = static_cast<float>(y) * static_cast<float>(old_height - 1) / static_cast<float>(new_height - 1);
  363. int j = floorf(q);
  364. float v = q - static_cast<float>(j);
  365. auto c = get_pixel(old_right_x, j);
  366. auto d = get_pixel(old_right_x, j + 1);
  367. auto color = c.interpolate(d, v);
  368. new_bitmap->set_pixel(new_right_x, y, color);
  369. }
  370. // Bottom-right pixel
  371. new_bitmap->set_pixel(new_width - 1, new_height - 1, get_pixel(physical_width() - 1, physical_height() - 1));
  372. return new_bitmap;
  373. }
  374. ErrorOr<NonnullRefPtr<Gfx::Bitmap>> Bitmap::cropped(Gfx::IntRect crop, Optional<BitmapFormat> new_bitmap_format) const
  375. {
  376. auto new_bitmap = TRY(Gfx::Bitmap::try_create(new_bitmap_format.value_or(format()), { crop.width(), crop.height() }, 1));
  377. for (int y = 0; y < crop.height(); ++y) {
  378. for (int x = 0; x < crop.width(); ++x) {
  379. int global_x = x + crop.left();
  380. int global_y = y + crop.top();
  381. if (global_x >= physical_width() || global_y >= physical_height() || global_x < 0 || global_y < 0) {
  382. new_bitmap->set_pixel(x, y, Gfx::Color::Black);
  383. } else {
  384. new_bitmap->set_pixel(x, y, get_pixel(global_x, global_y));
  385. }
  386. }
  387. }
  388. return new_bitmap;
  389. }
  390. ErrorOr<NonnullRefPtr<Bitmap>> Bitmap::to_bitmap_backed_by_anonymous_buffer() const
  391. {
  392. if (m_buffer.is_valid())
  393. return NonnullRefPtr { *this };
  394. auto buffer = TRY(Core::AnonymousBuffer::create_with_size(round_up_to_power_of_two(size_in_bytes(), PAGE_SIZE)));
  395. auto bitmap = TRY(Bitmap::try_create_with_anonymous_buffer(m_format, move(buffer), size(), scale(), palette_to_vector()));
  396. memcpy(bitmap->scanline(0), scanline(0), size_in_bytes());
  397. return bitmap;
  398. }
  399. void Bitmap::invert()
  400. {
  401. for (auto y = 0; y < height(); y++) {
  402. for (auto x = 0; x < width(); x++)
  403. set_pixel(x, y, get_pixel(x, y).inverted());
  404. }
  405. }
  406. Bitmap::~Bitmap()
  407. {
  408. if (m_needs_munmap) {
  409. int rc = munmap(m_data, size_in_bytes());
  410. VERIFY(rc == 0);
  411. }
  412. m_data = nullptr;
  413. delete[] m_palette;
  414. }
  415. void Bitmap::set_mmap_name([[maybe_unused]] DeprecatedString const& name)
  416. {
  417. VERIFY(m_needs_munmap);
  418. #ifdef AK_OS_SERENITY
  419. ::set_mmap_name(m_data, size_in_bytes(), name.characters());
  420. #endif
  421. }
  422. void Bitmap::fill(Color color)
  423. {
  424. VERIFY(!is_indexed(m_format));
  425. for (int y = 0; y < physical_height(); ++y) {
  426. auto* scanline = this->scanline(y);
  427. fast_u32_fill(scanline, color.value(), physical_width());
  428. }
  429. }
  430. void Bitmap::set_volatile()
  431. {
  432. if (m_volatile)
  433. return;
  434. #ifdef AK_OS_SERENITY
  435. int rc = madvise(m_data, size_in_bytes(), MADV_SET_VOLATILE);
  436. if (rc < 0) {
  437. perror("madvise(MADV_SET_VOLATILE)");
  438. VERIFY_NOT_REACHED();
  439. }
  440. #endif
  441. m_volatile = true;
  442. }
  443. [[nodiscard]] bool Bitmap::set_nonvolatile(bool& was_purged)
  444. {
  445. if (!m_volatile) {
  446. was_purged = false;
  447. return true;
  448. }
  449. #ifdef AK_OS_SERENITY
  450. int rc = madvise(m_data, size_in_bytes(), MADV_SET_NONVOLATILE);
  451. if (rc < 0) {
  452. if (errno == ENOMEM) {
  453. was_purged = true;
  454. return false;
  455. }
  456. perror("madvise(MADV_SET_NONVOLATILE)");
  457. VERIFY_NOT_REACHED();
  458. }
  459. was_purged = rc != 0;
  460. #endif
  461. m_volatile = false;
  462. return true;
  463. }
  464. Gfx::ShareableBitmap Bitmap::to_shareable_bitmap() const
  465. {
  466. auto bitmap_or_error = to_bitmap_backed_by_anonymous_buffer();
  467. if (bitmap_or_error.is_error())
  468. return {};
  469. return Gfx::ShareableBitmap { bitmap_or_error.release_value_but_fixme_should_propagate_errors(), Gfx::ShareableBitmap::ConstructWithKnownGoodBitmap };
  470. }
  471. ErrorOr<BackingStore> Bitmap::allocate_backing_store(BitmapFormat format, IntSize size, int scale_factor)
  472. {
  473. if (size_would_overflow(format, size, scale_factor))
  474. return Error::from_string_literal("Gfx::Bitmap backing store size overflow");
  475. auto const pitch = minimum_pitch(size.width() * scale_factor, format);
  476. auto const data_size_in_bytes = size_in_bytes(pitch, size.height() * scale_factor);
  477. int map_flags = MAP_ANONYMOUS | MAP_PRIVATE;
  478. #ifdef AK_OS_SERENITY
  479. map_flags |= MAP_PURGEABLE;
  480. void* data = mmap_with_name(nullptr, data_size_in_bytes, PROT_READ | PROT_WRITE, map_flags, 0, 0, DeprecatedString::formatted("GraphicsBitmap [{}]", size).characters());
  481. #else
  482. void* data = mmap(nullptr, data_size_in_bytes, PROT_READ | PROT_WRITE, map_flags, -1, 0);
  483. #endif
  484. if (data == MAP_FAILED)
  485. return Error::from_errno(errno);
  486. return BackingStore { data, pitch, data_size_in_bytes };
  487. }
  488. void Bitmap::allocate_palette_from_format(BitmapFormat format, Vector<ARGB32> const& source_palette)
  489. {
  490. size_t size = palette_size(format);
  491. if (size == 0)
  492. return;
  493. m_palette = new ARGB32[size];
  494. if (!source_palette.is_empty()) {
  495. VERIFY(source_palette.size() == size);
  496. memcpy(m_palette, source_palette.data(), size * sizeof(ARGB32));
  497. }
  498. }
  499. Vector<ARGB32> Bitmap::palette_to_vector() const
  500. {
  501. Vector<ARGB32> vector;
  502. auto size = palette_size(m_format);
  503. vector.ensure_capacity(size);
  504. for (size_t i = 0; i < size; ++i)
  505. vector.unchecked_append(palette_color(i).value());
  506. return vector;
  507. }
  508. bool Bitmap::visually_equals(Bitmap const& other) const
  509. {
  510. auto own_width = width();
  511. auto own_height = height();
  512. if (other.width() != own_width || other.height() != own_height)
  513. return false;
  514. for (auto y = 0; y < own_height; ++y) {
  515. for (auto x = 0; x < own_width; ++x) {
  516. if (get_pixel(x, y) != other.get_pixel(x, y))
  517. return false;
  518. }
  519. }
  520. return true;
  521. }
  522. Optional<Color> Bitmap::solid_color(u8 alpha_threshold) const
  523. {
  524. Optional<Color> color;
  525. for (auto y = 0; y < height(); ++y) {
  526. for (auto x = 0; x < width(); ++x) {
  527. auto const& pixel = get_pixel(x, y);
  528. if (has_alpha_channel() && pixel.alpha() <= alpha_threshold)
  529. continue;
  530. if (!color.has_value())
  531. color = pixel;
  532. else if (pixel != color)
  533. return {};
  534. }
  535. }
  536. return color;
  537. }
  538. void Bitmap::flood_visit_from_point(Gfx::IntPoint start_point, int threshold,
  539. Function<void(Gfx::IntPoint location)> pixel_reached)
  540. {
  541. VERIFY(rect().contains(start_point));
  542. auto target_color = get_pixel(start_point.x(), start_point.y());
  543. float threshold_normalized_squared = (threshold / 100.0f) * (threshold / 100.0f);
  544. Queue<Gfx::IntPoint> points_to_visit = Queue<Gfx::IntPoint>();
  545. points_to_visit.enqueue(start_point);
  546. pixel_reached(start_point);
  547. auto flood_mask = AK::Bitmap::must_create(width() * height(), false);
  548. flood_mask.set(width() * start_point.y() + start_point.x(), true);
  549. // This implements a non-recursive flood fill. This is a breadth-first search of paintable neighbors
  550. // As we find neighbors that are reachable we call the location_reached callback, add them to the queue, and mark them in the mask
  551. while (!points_to_visit.is_empty()) {
  552. auto current_point = points_to_visit.dequeue();
  553. auto candidate_points = Array {
  554. current_point.moved_left(1),
  555. current_point.moved_right(1),
  556. current_point.moved_up(1),
  557. current_point.moved_down(1)
  558. };
  559. for (auto candidate_point : candidate_points) {
  560. auto flood_mask_index = width() * candidate_point.y() + candidate_point.x();
  561. if (!rect().contains(candidate_point))
  562. continue;
  563. auto pixel_color = get_pixel<Gfx::StorageFormat::BGRA8888>(candidate_point.x(), candidate_point.y());
  564. auto can_paint = pixel_color.distance_squared_to(target_color) <= threshold_normalized_squared;
  565. if (flood_mask.get(flood_mask_index) == false && can_paint) {
  566. points_to_visit.enqueue(candidate_point);
  567. pixel_reached(candidate_point);
  568. }
  569. flood_mask.set(flood_mask_index, true);
  570. }
  571. }
  572. }
  573. }