OLD | NEW |
1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "gfx/icon_util.h" | 5 #include "gfx/icon_util.h" |
6 | 6 |
7 #include "base/file_util.h" | 7 #include "base/file_util.h" |
8 #include "base/logging.h" | 8 #include "base/logging.h" |
9 #include "base/scoped_ptr.h" | 9 #include "base/scoped_ptr.h" |
10 #include "base/win/scoped_handle.h" | 10 #include "base/win/scoped_handle.h" |
(...skipping 437 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
448 // Once we compute the size for a singe AND mask scan line, we multiply that | 448 // Once we compute the size for a singe AND mask scan line, we multiply that |
449 // number by the image height in order to get the total number of bytes for | 449 // number by the image height in order to get the total number of bytes for |
450 // the AND mask. Thus, for a 15X15 image, we need 15 * 4 which is 60 bytes | 450 // the AND mask. Thus, for a 15X15 image, we need 15 * 4 which is 60 bytes |
451 // for the monochrome bitmap representing the AND mask. | 451 // for the monochrome bitmap representing the AND mask. |
452 size_t and_line_length = (bitmap.width() + 7) >> 3; | 452 size_t and_line_length = (bitmap.width() + 7) >> 3; |
453 and_line_length = (and_line_length + 3) & ~3; | 453 and_line_length = (and_line_length + 3) & ~3; |
454 size_t and_mask_size = and_line_length * bitmap.height(); | 454 size_t and_mask_size = and_line_length * bitmap.height(); |
455 size_t masks_size = *xor_mask_size + and_mask_size; | 455 size_t masks_size = *xor_mask_size + and_mask_size; |
456 *bytes_in_resource = masks_size + sizeof(BITMAPINFOHEADER); | 456 *bytes_in_resource = masks_size + sizeof(BITMAPINFOHEADER); |
457 } | 457 } |
OLD | NEW |