├── .gitignore ├── CPP ├── README.md ├── libbmp.cpp └── libbmp.h ├── LICENSE ├── README.md ├── example ├── Makefile └── checkerboard.c ├── libbmp.c ├── libbmp.h └── test ├── Makefile └── test.c /.gitignore: -------------------------------------------------------------------------------- 1 | # Object files 2 | *.o 3 | *.ko 4 | *.obj 5 | *.elf 6 | 7 | # Precompiled Headers 8 | *.gch 9 | *.pch 10 | 11 | # Libraries 12 | *.lib 13 | *.a 14 | *.la 15 | *.lo 16 | 17 | # Shared objects (inc. Windows DLLs) 18 | *.dll 19 | *.so 20 | *.so.* 21 | *.dylib 22 | 23 | # Executables 24 | *.exe 25 | *.out 26 | *.app 27 | *.i*86 28 | *.x86_64 29 | *.hex 30 | test/test 31 | example/checkerboard 32 | 33 | # Debug files 34 | *.dSYM/ 35 | *.su 36 | 37 | # Media 38 | *.bmp 39 | -------------------------------------------------------------------------------- /CPP/README.md: -------------------------------------------------------------------------------- 1 | This is the C++ version of libbmp. 2 | Instead of just using C code inside a wrapper, it is rewritten in native C++. 3 | 4 | ### Example: Checkerboard-pattern 5 | 6 | ```C++ 7 | #include 8 | #include "libbmp.h" 9 | 10 | int 11 | main () 12 | { 13 | BmpImg img (512, 512); 14 | 15 | // Draw a checkerboard pattern: 16 | // Use negative loops to improve performance 17 | for (int y = 511, x; y >= 0; y--) 18 | { 19 | for (x = 511; x >= 0; x--) 20 | { 21 | if ((y % 128 < 64 && x % 128 < 64) || 22 | (y % 128 >= 64 && x % 128 >= 64)) 23 | { 24 | img.set_pixel (x, y, 255, 255, 255); 25 | } 26 | } 27 | } 28 | 29 | img.write ("test.bmp"); 30 | return 0; 31 | } 32 | ``` 33 | 34 | ### Example: Counting black and white pixels 35 | 36 | ```C++ 37 | #include 38 | #include "libbmp.h" 39 | 40 | int 41 | main () 42 | { 43 | BmpImg img; 44 | 45 | img.read ("test.bmp"); 46 | 47 | // n - 1 because we use negative loops. 48 | const int width = img.get_width () - 1; 49 | const int height = img.get_height () - 1; 50 | int amnt_b = 0, amnt_w = 0; 51 | 52 | // Count the amount of black and white pixels: 53 | // Use negative loops to improve performance 54 | for (int y = height, x; y >= 0; y--) 55 | { 56 | for (x = width; x >= 0; x--) 57 | { 58 | if (img.red_at (x, y) < 128 && 59 | img.green_at (x, y) < 128 && 60 | img.blue_at (x, y) < 128) 61 | { 62 | amnt_b++; 63 | } 64 | else 65 | { 66 | amnt_w++; 67 | } 68 | } 69 | } 70 | 71 | std::cout << "Amount of black pixels:\t" << amnt_b << "\n"; 72 | std::cout << "Amount of white pixels:\t" << amnt_w << "\n"; 73 | return 0; 74 | } 75 | ``` 76 | -------------------------------------------------------------------------------- /CPP/libbmp.cpp: -------------------------------------------------------------------------------- 1 | /* Copyright 2016 - 2017 Marc Volker Dickmann 2 | * Project: LibBMP 3 | */ 4 | #include 5 | #include 6 | #include "libbmp.h" 7 | 8 | // 9 | // BmpPixbuf 10 | // 11 | 12 | BmpPixbuf::BmpPixbuf (void) 13 | { 14 | } 15 | 16 | BmpPixbuf::BmpPixbuf (const int width, 17 | const int height) 18 | { 19 | init (width, height); 20 | } 21 | 22 | BmpPixbuf::~BmpPixbuf (void) 23 | { 24 | data.clear (); 25 | } 26 | 27 | void 28 | BmpPixbuf::init (const int width, 29 | const int height) 30 | { 31 | len_row = width * len_pixel; 32 | 33 | data.resize (height * len_row); 34 | } 35 | 36 | void 37 | BmpPixbuf::set_pixel (const int x, 38 | const int y, 39 | const unsigned char r, 40 | const unsigned char g, 41 | const unsigned char b) 42 | { 43 | const size_t index = (x * len_pixel) + (y * len_row); 44 | data[index] = b; 45 | data[index + 1] = g; 46 | data[index + 2] = r; 47 | } 48 | 49 | unsigned char 50 | BmpPixbuf::red_at (const int x, 51 | const int y) 52 | { 53 | return data[(x * len_pixel) + (y * len_row) + 2]; 54 | } 55 | 56 | unsigned char 57 | BmpPixbuf::green_at (const int x, 58 | const int y) 59 | { 60 | return data[(x * len_pixel) + (y * len_row) + 1]; 61 | } 62 | 63 | unsigned char 64 | BmpPixbuf::blue_at (const int x, 65 | const int y) 66 | { 67 | return data[(x * len_pixel) + (y * len_row)]; 68 | } 69 | 70 | void 71 | BmpPixbuf::write (const int row, 72 | std::ofstream& f) 73 | { 74 | f.write (reinterpret_cast (&data[row * len_row]), len_row); 75 | } 76 | 77 | void 78 | BmpPixbuf::read (const int row, 79 | std::ifstream& f) 80 | { 81 | f.read (reinterpret_cast (&data[row * len_row]), len_row); 82 | } 83 | 84 | // 85 | // BmpImg 86 | // 87 | 88 | BmpImg::BmpImg (void) 89 | { 90 | } 91 | 92 | BmpImg::BmpImg (const int width, 93 | const int height) : BmpPixbuf (width, std::abs (height)) 94 | { 95 | // INIT the header with default values 96 | header.bfSize = (3 * width + BMP_GET_PADDING (width)) 97 | * std::abs (height); 98 | header.biWidth = width; 99 | header.biHeight = height; 100 | } 101 | 102 | BmpImg::~BmpImg (void) 103 | { 104 | } 105 | 106 | int 107 | BmpImg::get_width (void) 108 | { 109 | return header.biWidth; 110 | } 111 | 112 | int 113 | BmpImg::get_height (void) 114 | { 115 | return header.biHeight; 116 | } 117 | 118 | enum BmpError 119 | BmpImg::write (const std::string& filename) 120 | { 121 | // Open the image file in binary mode 122 | std::ofstream f_img (filename.c_str (), std::ios::binary); 123 | 124 | if (!f_img.is_open ()) 125 | return BMP_FILE_NOT_OPENED; 126 | 127 | // Since an adress must be passed to fwrite, create a variable! 128 | const unsigned short magic = BMP_MAGIC; 129 | 130 | f_img.write (reinterpret_cast(&magic), sizeof (magic)); 131 | f_img.write (reinterpret_cast(&header), sizeof (header)); 132 | 133 | // Select the mode (bottom-up or top-down) 134 | const int h = std::abs (header.biHeight); 135 | const int offset = (header.biHeight > 0 ? 0 : h - 1); 136 | const int padding = BMP_GET_PADDING (header.biWidth); 137 | 138 | for (int y = h - 1; y >= 0; y--) 139 | { 140 | // Write a whole row of pixels into the file 141 | BmpPixbuf::write ((int)std::abs (y - offset), f_img); 142 | 143 | // Write the padding 144 | f_img.write ("\0\0\0", padding); 145 | } 146 | 147 | // NOTE: All good 148 | f_img.close (); 149 | return BMP_OK; 150 | } 151 | 152 | enum BmpError 153 | BmpImg::read (const std::string& filename) 154 | { 155 | // Open the image file in binary mode 156 | std::ifstream f_img (filename.c_str (), std::ios::binary); 157 | 158 | if (!f_img.is_open ()) 159 | return BMP_FILE_NOT_OPENED; 160 | 161 | // Since an adress must be passed to fread, create a variable! 162 | unsigned short magic; 163 | 164 | // Check if its an bmp file by comparing the magic nbr 165 | f_img.read(reinterpret_cast(&magic), sizeof (magic)); 166 | 167 | if (magic != BMP_MAGIC) 168 | { 169 | f_img.close (); 170 | return BMP_INVALID_FILE; 171 | } 172 | 173 | // Read the header structure into header 174 | f_img.read (reinterpret_cast(&header), sizeof (header)); 175 | 176 | // Select the mode (bottom-up or top-down) 177 | const int h = std::abs (header.biHeight); 178 | const int offset = (header.biHeight > 0 ? 0 : h - 1); 179 | const int padding = BMP_GET_PADDING (header.biWidth); 180 | 181 | // Allocate the pixel buffer 182 | BmpPixbuf::init (header.biWidth, h); 183 | 184 | for (int y = h - 1; y >= 0; y--) 185 | { 186 | // Read a whole row of pixels from the file 187 | BmpPixbuf::read ((int)std::abs (y - offset), f_img); 188 | 189 | // Skip the padding 190 | f_img.seekg (padding, std::ios::cur); 191 | } 192 | 193 | // NOTE: All good 194 | f_img.close (); 195 | return BMP_OK; 196 | } 197 | -------------------------------------------------------------------------------- /CPP/libbmp.h: -------------------------------------------------------------------------------- 1 | #ifndef __LIBBMP_H__ 2 | #define __LIBBMP_H__ 3 | 4 | #include 5 | 6 | #define BMP_MAGIC 19778 7 | 8 | #define BMP_GET_PADDING(a) ((a) % 4) 9 | 10 | // 11 | // BmpError 12 | // 13 | 14 | enum BmpError 15 | { 16 | BMP_FILE_NOT_OPENED = -4, 17 | BMP_HEADER_NOT_INITIALIZED, 18 | BMP_INVALID_FILE, 19 | BMP_ERROR, 20 | BMP_OK = 0 21 | }; 22 | 23 | // 24 | // BmpPixbuf 25 | // 26 | 27 | class BmpPixbuf 28 | { 29 | public: 30 | BmpPixbuf (void); 31 | BmpPixbuf (const int width, 32 | const int height); 33 | ~BmpPixbuf (); 34 | 35 | void init (const int width, 36 | const int height); 37 | 38 | void set_pixel (const int x, 39 | const int y, 40 | const unsigned char r, 41 | const unsigned char g, 42 | const unsigned char b); 43 | 44 | unsigned char red_at (const int x, 45 | const int y); 46 | unsigned char green_at (const int x, 47 | const int y); 48 | unsigned char blue_at (const int x, 49 | const int y); 50 | 51 | 52 | void write (const int row, 53 | std::ofstream& f); 54 | 55 | void read (const int row, 56 | std::ifstream& f); 57 | private: 58 | size_t len_row; 59 | size_t len_pixel = 3; 60 | 61 | std::vector data; 62 | }; 63 | 64 | // 65 | // BmpImg 66 | // 67 | 68 | class BmpImg : public BmpPixbuf 69 | { 70 | public: 71 | BmpImg (void); 72 | BmpImg (const int width, 73 | const int height); 74 | ~BmpImg (); 75 | 76 | enum BmpError write (const std::string& filename); 77 | enum BmpError read (const std::string& filename); 78 | 79 | int get_width (void); 80 | int get_height (void); 81 | private: 82 | // Use a struct to read this in one call 83 | struct 84 | { 85 | unsigned int bfSize = 0; 86 | unsigned int bfReserved = 0; 87 | unsigned int bfOffBits = 54; 88 | unsigned int biSize = 40; 89 | int biWidth = 0; 90 | int biHeight = 0; 91 | unsigned short biPlanes = 1; 92 | unsigned short biBitCount = 24; 93 | unsigned int biCompression = 0; 94 | unsigned int biSizeImage = 0; 95 | int biXPelsPerMeter = 0; 96 | int biYPelsPerMeter = 0; 97 | unsigned int biClrUsed = 0; 98 | unsigned int biClrImportant = 0; 99 | } header; 100 | }; 101 | 102 | #endif /* __LIBBMP_H__ */ 103 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # libbmp 2 | A simple Bitmap (BMP) library written in C without dependencies. 3 | For a native C++ version look inside the `CPP` folder. 4 | 5 | ### Example: Checkerboard-pattern 6 | 7 | ```C 8 | #include 9 | #include "libbmp.h" 10 | 11 | int 12 | main () 13 | { 14 | bmp_img img; 15 | bmp_img_init_df (&img, 512, 512); 16 | 17 | // Draw a checkerboard pattern: 18 | for (size_t y = 0, x; y < 512; y++) 19 | { 20 | for (x = 0; x < 512; x++) 21 | { 22 | if ((y % 128 < 64 && x % 128 < 64) || 23 | (y % 128 >= 64 && x % 128 >= 64)) 24 | { 25 | bmp_pixel_init (&img.img_pixels[y][x], 250, 250, 250); 26 | } 27 | else 28 | { 29 | bmp_pixel_init (&img.img_pixels[y][x], 0, 0, 0); 30 | } 31 | } 32 | } 33 | 34 | bmp_img_write (&img, "test.bmp"); 35 | bmp_img_free (&img); 36 | return 0; 37 | } 38 | ``` 39 | 40 | ### Important Notes 41 | 42 | * Since the C and C++ version have many things in common, both of them are maintained in a single repository. 43 | To report language specific things, make use of the `C` or `C++` label. 44 | -------------------------------------------------------------------------------- /example/Makefile: -------------------------------------------------------------------------------- 1 | CC = gcc 2 | OBJECTS = ../libbmp.c checkerboard.c 3 | LIBS = 4 | CFLAGS = -Wall -Wextra -O2 5 | BINDIR = $(DESTDIR)/usr/bin 6 | NAME = checkerboard 7 | 8 | checkerboard: $(OBJECTS) 9 | $(CC) $(CFLAGS) -o $(NAME) $(OBJECTS) $(LIBS) 10 | 11 | clean: 12 | rm $(NAME) 13 | -------------------------------------------------------------------------------- /example/checkerboard.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include "../libbmp.h" 3 | 4 | int 5 | main (int argc, char *argv[]) 6 | { 7 | bmp_img img; 8 | bmp_img_init_df (&img, 512, 512); 9 | 10 | // Draw a checkerboard pattern: 11 | for (size_t y = 0; y < 512; y++) 12 | { 13 | for (size_t x = 0; x < 512; x++) 14 | { 15 | if ((y % 128 < 64 && x % 128 < 64) || 16 | (y % 128 >= 64 && x % 128 >= 64)) 17 | { 18 | bmp_pixel_init (&img.img_pixels[y][x], 250, 250, 250); 19 | } 20 | else 21 | { 22 | bmp_pixel_init (&img.img_pixels[y][x], 0, 0, 0); 23 | } 24 | } 25 | } 26 | 27 | bmp_img_write (&img, "test.bmp"); 28 | bmp_img_free (&img); 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /libbmp.c: -------------------------------------------------------------------------------- 1 | /* Copyright 2016 - 2017 Marc Volker Dickmann 2 | * Project: LibBMP 3 | */ 4 | #include 5 | #include 6 | #include "libbmp.h" 7 | 8 | // BMP_HEADER 9 | 10 | void 11 | bmp_header_init_df (bmp_header *header, 12 | const int width, 13 | const int height) 14 | { 15 | header->bfSize = (sizeof (bmp_pixel) * width + BMP_GET_PADDING (width)) 16 | * abs (height); 17 | header->bfReserved = 0; 18 | header->bfOffBits = 54; 19 | header->biSize = 40; 20 | header->biWidth = width; 21 | header->biHeight = height; 22 | header->biPlanes = 1; 23 | header->biBitCount = 24; 24 | header->biCompression = 0; 25 | header->biSizeImage = 0; 26 | header->biXPelsPerMeter = 0; 27 | header->biYPelsPerMeter = 0; 28 | header->biClrUsed = 0; 29 | header->biClrImportant = 0; 30 | } 31 | 32 | enum bmp_error 33 | bmp_header_write (const bmp_header *header, 34 | FILE *img_file) 35 | { 36 | if (header == NULL) 37 | { 38 | return BMP_HEADER_NOT_INITIALIZED; 39 | } 40 | else if (img_file == NULL) 41 | { 42 | return BMP_FILE_NOT_OPENED; 43 | } 44 | 45 | // Since an adress must be passed to fwrite, create a variable! 46 | const unsigned short magic = BMP_MAGIC; 47 | fwrite (&magic, sizeof (magic), 1, img_file); 48 | 49 | // Use the type instead of the variable because its a pointer! 50 | fwrite (header, sizeof (bmp_header), 1, img_file); 51 | return BMP_OK; 52 | } 53 | 54 | enum bmp_error 55 | bmp_header_read (bmp_header *header, 56 | FILE *img_file) 57 | { 58 | if (img_file == NULL) 59 | { 60 | return BMP_FILE_NOT_OPENED; 61 | } 62 | 63 | // Since an adress must be passed to fread, create a variable! 64 | unsigned short magic; 65 | 66 | // Check if its an bmp file by comparing the magic nbr: 67 | if (fread (&magic, sizeof (magic), 1, img_file) != 1 || 68 | magic != BMP_MAGIC) 69 | { 70 | return BMP_INVALID_FILE; 71 | } 72 | 73 | if (fread (header, sizeof (bmp_header), 1, img_file) != 1) 74 | { 75 | return BMP_ERROR; 76 | } 77 | 78 | return BMP_OK; 79 | } 80 | 81 | // BMP_PIXEL 82 | 83 | void 84 | bmp_pixel_init (bmp_pixel *pxl, 85 | const unsigned char red, 86 | const unsigned char green, 87 | const unsigned char blue) 88 | { 89 | pxl->red = red; 90 | pxl->green = green; 91 | pxl->blue = blue; 92 | } 93 | 94 | // BMP_IMG 95 | 96 | void 97 | bmp_img_alloc (bmp_img *img) 98 | { 99 | const size_t h = abs (img->img_header.biHeight); 100 | 101 | // Allocate the required memory for the pixels: 102 | img->img_pixels = malloc (sizeof (bmp_pixel*) * h); 103 | 104 | for (size_t y = 0; y < h; y++) 105 | { 106 | img->img_pixels[y] = malloc (sizeof (bmp_pixel) * img->img_header.biWidth); 107 | } 108 | } 109 | 110 | void 111 | bmp_img_init_df (bmp_img *img, 112 | const int width, 113 | const int height) 114 | { 115 | // INIT the header with default values: 116 | bmp_header_init_df (&img->img_header, width, height); 117 | bmp_img_alloc (img); 118 | } 119 | 120 | void 121 | bmp_img_free (bmp_img *img) 122 | { 123 | const size_t h = abs (img->img_header.biHeight); 124 | 125 | for (size_t y = 0; y < h; y++) 126 | { 127 | free (img->img_pixels[y]); 128 | } 129 | free (img->img_pixels); 130 | } 131 | 132 | enum bmp_error 133 | bmp_img_write (const bmp_img *img, 134 | const char *filename) 135 | { 136 | FILE *img_file = fopen (filename, "wb"); 137 | 138 | if (img_file == NULL) 139 | { 140 | return BMP_FILE_NOT_OPENED; 141 | } 142 | 143 | // NOTE: This way the correct error code could be returned. 144 | const enum bmp_error err = bmp_header_write (&img->img_header, img_file); 145 | 146 | if (err != BMP_OK) 147 | { 148 | // ERROR: Could'nt write the header! 149 | fclose (img_file); 150 | return err; 151 | } 152 | 153 | // Select the mode (bottom-up or top-down): 154 | const size_t h = abs (img->img_header.biHeight); 155 | const size_t offset = (img->img_header.biHeight > 0 ? h - 1 : 0); 156 | 157 | // Create the padding: 158 | const unsigned char padding[3] = {'\0', '\0', '\0'}; 159 | 160 | // Write the content: 161 | for (size_t y = 0; y < h; y++) 162 | { 163 | // Write a whole row of pixels to the file: 164 | fwrite (img->img_pixels[abs (offset - y)], sizeof (bmp_pixel), img->img_header.biWidth, img_file); 165 | 166 | // Write the padding for the row! 167 | fwrite (padding, sizeof (unsigned char), BMP_GET_PADDING (img->img_header.biWidth), img_file); 168 | } 169 | 170 | // NOTE: All good! 171 | fclose (img_file); 172 | return BMP_OK; 173 | } 174 | 175 | enum bmp_error 176 | bmp_img_read (bmp_img *img, 177 | const char *filename) 178 | { 179 | FILE *img_file = fopen (filename, "rb"); 180 | 181 | if (img_file == NULL) 182 | { 183 | return BMP_FILE_NOT_OPENED; 184 | } 185 | 186 | // NOTE: This way the correct error code can be returned. 187 | const enum bmp_error err = bmp_header_read (&img->img_header, img_file); 188 | 189 | if (err != BMP_OK) 190 | { 191 | // ERROR: Could'nt read the image header! 192 | fclose (img_file); 193 | return err; 194 | } 195 | 196 | bmp_img_alloc (img); 197 | 198 | // Select the mode (bottom-up or top-down): 199 | const size_t h = abs (img->img_header.biHeight); 200 | const size_t offset = (img->img_header.biHeight > 0 ? h - 1 : 0); 201 | const size_t padding = BMP_GET_PADDING (img->img_header.biWidth); 202 | 203 | // Needed to compare the return value of fread 204 | const size_t items = img->img_header.biWidth; 205 | 206 | // Read the content: 207 | for (size_t y = 0; y < h; y++) 208 | { 209 | // Read a whole row of pixels from the file: 210 | if (fread (img->img_pixels[abs (offset - y)], sizeof (bmp_pixel), items, img_file) != items) 211 | { 212 | fclose (img_file); 213 | return BMP_ERROR; 214 | } 215 | 216 | // Skip the padding: 217 | fseek (img_file, padding, SEEK_CUR); 218 | } 219 | 220 | // NOTE: All good! 221 | fclose (img_file); 222 | return BMP_OK; 223 | } 224 | -------------------------------------------------------------------------------- /libbmp.h: -------------------------------------------------------------------------------- 1 | #ifndef __LIBBMP_H__ 2 | #define __LIBBMP_H__ 3 | 4 | #define BMP_MAGIC 19778 5 | 6 | #define BMP_GET_PADDING(a) ((a) % 4) 7 | 8 | enum bmp_error 9 | { 10 | BMP_FILE_NOT_OPENED = -4, 11 | BMP_HEADER_NOT_INITIALIZED, 12 | BMP_INVALID_FILE, 13 | BMP_ERROR, 14 | BMP_OK = 0 15 | }; 16 | 17 | typedef struct _bmp_header 18 | { 19 | unsigned int bfSize; 20 | unsigned int bfReserved; 21 | unsigned int bfOffBits; 22 | 23 | unsigned int biSize; 24 | int biWidth; 25 | int biHeight; 26 | unsigned short biPlanes; 27 | unsigned short biBitCount; 28 | unsigned int biCompression; 29 | unsigned int biSizeImage; 30 | int biXPelsPerMeter; 31 | int biYPelsPerMeter; 32 | unsigned int biClrUsed; 33 | unsigned int biClrImportant; 34 | } bmp_header; 35 | 36 | typedef struct _bmp_pixel 37 | { 38 | unsigned char blue; 39 | unsigned char green; 40 | unsigned char red; 41 | } bmp_pixel; 42 | 43 | // This is faster than a function call 44 | #define BMP_PIXEL(r,g,b) ((bmp_pixel){(b),(g),(r)}) 45 | 46 | typedef struct _bmp_img 47 | { 48 | bmp_header img_header; 49 | bmp_pixel **img_pixels; 50 | } bmp_img; 51 | 52 | // BMP_HEADER 53 | void bmp_header_init_df (bmp_header*, 54 | const int, 55 | const int); 56 | 57 | enum bmp_error bmp_header_write (const bmp_header*, 58 | FILE*); 59 | 60 | enum bmp_error bmp_header_read (bmp_header*, 61 | FILE*); 62 | 63 | // BMP_PIXEL 64 | void bmp_pixel_init (bmp_pixel*, 65 | const unsigned char, 66 | const unsigned char, 67 | const unsigned char); 68 | 69 | // BMP_IMG 70 | void bmp_img_alloc (bmp_img*); 71 | void bmp_img_init_df (bmp_img*, 72 | const int, 73 | const int); 74 | void bmp_img_free (bmp_img*); 75 | 76 | enum bmp_error bmp_img_write (const bmp_img*, 77 | const char*); 78 | 79 | enum bmp_error bmp_img_read (bmp_img*, 80 | const char*); 81 | 82 | #endif /* __LIBBMP_H__ */ 83 | -------------------------------------------------------------------------------- /test/Makefile: -------------------------------------------------------------------------------- 1 | CC = gcc 2 | OBJECTS = ../libbmp.c test.c 3 | LIBS = 4 | CFLAGS = -Wall -Wextra -O2 5 | BINDIR = $(DESTDIR)/usr/bin 6 | NAME = test 7 | 8 | test: $(OBJECTS) 9 | $(CC) $(CFLAGS) -o $(NAME) $(OBJECTS) $(LIBS) 10 | 11 | clean: 12 | rm $(NAME) 13 | -------------------------------------------------------------------------------- /test/test.c: -------------------------------------------------------------------------------- 1 | /* Copyright 2016 - 2017 Marc Volker Dickmann 2 | * Project: LibBMP 3 | */ 4 | #include 5 | #include "../libbmp.h" 6 | 7 | #define BMP_TEST_PASSED 1 8 | #define BMP_TEST_FAILED 0 9 | 10 | // Utils 11 | 12 | static void 13 | bmp_test_print_summary (const int points, 14 | const int points_max) 15 | { 16 | printf ("\n\nPoints\t%i/%i\n", points, points_max); 17 | printf ("Failed\t%i\n", points_max - points); 18 | } 19 | 20 | static void 21 | bmp_test_print_passed (const char *name) 22 | { 23 | printf ("%s\t\tPASSED!\n", name); 24 | } 25 | 26 | static void 27 | bmp_test_print_failed (const char *name) 28 | { 29 | printf ("%s\t\tFAILED!\n", name); 30 | } 31 | 32 | // MACROS 33 | 34 | static int 35 | bmp_test_get_padding (void) 36 | { 37 | if (BMP_GET_PADDING (1) == 1 && 38 | BMP_GET_PADDING (2) == 2 && 39 | BMP_GET_PADDING (3) == 3 && 40 | BMP_GET_PADDING (4) == 0 && 41 | BMP_GET_PADDING (5) == 1 && 42 | BMP_GET_PADDING (6) == 2 && 43 | BMP_GET_PADDING (7) == 3 && 44 | BMP_GET_PADDING (8) == 0) 45 | { 46 | bmp_test_print_passed ("BMP_GET_PADDING"); 47 | return BMP_TEST_PASSED; 48 | } 49 | 50 | bmp_test_print_failed ("BMP_GET_PADDING"); 51 | return BMP_TEST_FAILED; 52 | } 53 | 54 | // Header 55 | 56 | static int 57 | bmp_test_header_size (void) 58 | { 59 | // Note: Its 52 Bytes because the header doesn't include the magic field! 60 | if (sizeof (bmp_header) == 52) 61 | { 62 | bmp_test_print_passed ("header_size"); 63 | return BMP_TEST_PASSED; 64 | } 65 | 66 | bmp_test_print_failed ("header_size"); 67 | return BMP_TEST_FAILED; 68 | } 69 | 70 | static int 71 | bmp_test_header_init_df (void) 72 | { 73 | int passed = BMP_TEST_PASSED; 74 | bmp_header header; 75 | 76 | // Test positive height value: 77 | bmp_header_init_df (&header, 100, 100); 78 | 79 | if (header.bfSize != (sizeof (bmp_pixel) * 10000) || 80 | header.biWidth != 100 || 81 | header.biHeight != 100) 82 | { 83 | passed = BMP_TEST_FAILED; 84 | } 85 | 86 | // Test negative height value with padding: 87 | bmp_header_init_df (&header, 102, -100); 88 | 89 | if (header.bfSize != (sizeof (bmp_pixel) * 10200) + 200 || 90 | header.biWidth != 102 || 91 | header.biHeight != -100) 92 | { 93 | passed = BMP_TEST_FAILED; 94 | } 95 | 96 | // Return the result: 97 | if (passed == BMP_TEST_PASSED) 98 | { 99 | bmp_test_print_passed ("header_init_df"); 100 | return BMP_TEST_PASSED; 101 | } 102 | 103 | bmp_test_print_failed ("header_init_df"); 104 | return BMP_TEST_FAILED; 105 | } 106 | 107 | // Pixel 108 | 109 | static int 110 | bmp_test_pixel_init (void) 111 | { 112 | bmp_pixel pxl; 113 | 114 | bmp_pixel_init (&pxl, 1, 250, 4); 115 | 116 | if (pxl.red == 1 && 117 | pxl.green == 250 && 118 | pxl.blue == 4) 119 | { 120 | bmp_test_print_passed ("pixel_init"); 121 | return BMP_TEST_PASSED; 122 | } 123 | 124 | bmp_test_print_failed ("pixel_init"); 125 | return BMP_TEST_FAILED; 126 | } 127 | 128 | int 129 | main (int argc, char *argv[]) 130 | { 131 | int points = 0; 132 | 133 | printf ("LibBMP-Test v. 0.0.1 A (C) 2016 - 2017 Marc Volker Dickmann\n\n"); 134 | 135 | points += bmp_test_get_padding (); 136 | 137 | points += bmp_test_header_size (); 138 | points += bmp_test_header_init_df (); 139 | 140 | points += bmp_test_pixel_init (); 141 | 142 | bmp_test_print_summary (points, 4); 143 | return 0; 144 | } 145 | --------------------------------------------------------------------------------