├── .gitignore ├── CONTRIBUTING.md ├── LICENSE.md ├── README.md ├── examples ├── eepromTest │ └── eepromTest.ino └── struct │ └── struct.ino ├── keywords.txt ├── library.properties └── src ├── JC_EEPROM.cpp └── JC_EEPROM.h /.gitignore: -------------------------------------------------------------------------------- 1 | *.zip 2 | *.7z 3 | .development 4 | -------------------------------------------------------------------------------- /CONTRIBUTING.md: -------------------------------------------------------------------------------- 1 | # A GitHub Manifesto 2 | ### Notes on contributing to my repositories 3 | Jack Christensen 4 | Jan 2018 5 | 6 | Surely Git and GitHub are wonderful tools. They make coding and collaboration so much easier. I'm equally impressed with the open source movement, and with the Arduino ecosystem in particular. 7 | 8 | I'm just one guy, mostly a hobbyist. Posting my projects to GitHub is my way of giving back a little to the community. It's very gratifying that some of my code has received a modicum of popularity. 9 | 10 | Like many things, this has been somewhat of a double-edged sword. Especially since I tend to be a pretty busy guy with many varied interests. 11 | 12 | First, I am always interested in bug reports. Please raise an issue in the appropriate repository and please please please include a good, concise description of the issue and a Short, Self Contained, Correct (Compilable), Example (see [sscce.org](http://www.sscce.org/)). I will need to be able to reproduce the issue, with minimal hardware, and without installing a dozen other libraries. I work exclusively with the AVR architecture so most times I will not be able to reproduce issues on other platforms. (There have been one or two occasions where relatively simple changes have been made to accommodate another platform; I am not necessarily averse to these.) 13 | 14 | Second, bug reports should always be for problems with *my* code. I will not use GitHub to help you with *your* code, even if you happen to be using one of my libraries. Please use the [Arduino forum](https://forum.arduino.cc/) or other such venue instead. 15 | 16 | Finally, pull requests can be problematic, especially if they represent enhancements rather than fixes. I seldom intend my code to be all things to all people. This is mostly a hobby activity and I have very limited bandwidth. Reviewing and managing PRs requires time that I do not often have. Sometimes a PR will take a library in a direction that I'm not interested in. Sometimes a PR will be counter to my original design intent. No doubt the author of a PR thinks that their new feature is the best thing since canned beer, but if I don't happen to share that opinion, then I'll decline it. OTOH, I am certainly capable of making stupid mistakes and missing absolutely fundamental things, and I do appreciate it when these are pointed out. 17 | 18 | All this to say, that if I do decline a request, please do not take it personally. Feel free to consider it my problem, not yours. At the end of the day, it's my code, and I reserve the right to decline issues or PRs for any reason, or for no reason at all. But here is the beauty of open source. You can always fork the repository and have your way with it. 19 | -------------------------------------------------------------------------------- /LICENSE.md: -------------------------------------------------------------------------------- 1 | ### GNU GENERAL PUBLIC LICENSE 2 | 3 | Version 3, 29 June 2007 4 | 5 | Copyright (C) 2007 Free Software Foundation, Inc. 6 | 7 | 8 | Everyone is permitted to copy and distribute verbatim copies of this 9 | license document, but changing it is not allowed. 10 | 11 | ### Preamble 12 | 13 | The GNU General Public License is a free, copyleft license for 14 | software and other kinds of works. 15 | 16 | The licenses for most software and other practical works are designed 17 | to take away your freedom to share and change the works. By contrast, 18 | the GNU General Public License is intended to guarantee your freedom 19 | to share and change all versions of a program--to make sure it remains 20 | free software for all its users. We, the Free Software Foundation, use 21 | the GNU General Public License for most of our software; it applies 22 | also to any other work released this way by its authors. You can apply 23 | it to your programs, too. 24 | 25 | When we speak of free software, we are referring to freedom, not 26 | price. Our General Public Licenses are designed to make sure that you 27 | have the freedom to distribute copies of free software (and charge for 28 | them if you wish), that you receive source code or can get it if you 29 | want it, that you can change the software or use pieces of it in new 30 | free programs, and that you know you can do these things. 31 | 32 | To protect your rights, we need to prevent others from denying you 33 | these rights or asking you to surrender the rights. Therefore, you 34 | have certain responsibilities if you distribute copies of the 35 | software, or if you modify it: responsibilities to respect the freedom 36 | of others. 37 | 38 | For example, if you distribute copies of such a program, whether 39 | gratis or for a fee, you must pass on to the recipients the same 40 | freedoms that you received. You must make sure that they, too, receive 41 | or can get the source code. And you must show them these terms so they 42 | know their rights. 43 | 44 | Developers that use the GNU GPL protect your rights with two steps: 45 | (1) assert copyright on the software, and (2) offer you this License 46 | giving you legal permission to copy, distribute and/or modify it. 47 | 48 | For the developers' and authors' protection, the GPL clearly explains 49 | that there is no warranty for this free software. For both users' and 50 | authors' sake, the GPL requires that modified versions be marked as 51 | changed, so that their problems will not be attributed erroneously to 52 | authors of previous versions. 53 | 54 | Some devices are designed to deny users access to install or run 55 | modified versions of the software inside them, although the 56 | manufacturer can do so. This is fundamentally incompatible with the 57 | aim of protecting users' freedom to change the software. The 58 | systematic pattern of such abuse occurs in the area of products for 59 | individuals to use, which is precisely where it is most unacceptable. 60 | Therefore, we have designed this version of the GPL to prohibit the 61 | practice for those products. If such problems arise substantially in 62 | other domains, we stand ready to extend this provision to those 63 | domains in future versions of the GPL, as needed to protect the 64 | freedom of users. 65 | 66 | Finally, every program is threatened constantly by software patents. 67 | States should not allow patents to restrict development and use of 68 | software on general-purpose computers, but in those that do, we wish 69 | to avoid the special danger that patents applied to a free program 70 | could make it effectively proprietary. To prevent this, the GPL 71 | assures that patents cannot be used to render the program non-free. 72 | 73 | The precise terms and conditions for copying, distribution and 74 | modification follow. 75 | 76 | ### TERMS AND CONDITIONS 77 | 78 | #### 0. Definitions. 79 | 80 | "This License" refers to version 3 of the GNU General Public License. 81 | 82 | "Copyright" also means copyright-like laws that apply to other kinds 83 | of works, such as semiconductor masks. 84 | 85 | "The Program" refers to any copyrightable work licensed under this 86 | License. Each licensee is addressed as "you". "Licensees" and 87 | "recipients" may be individuals or organizations. 88 | 89 | To "modify" a work means to copy from or adapt all or part of the work 90 | in a fashion requiring copyright permission, other than the making of 91 | an exact copy. The resulting work is called a "modified version" of 92 | the earlier work or a work "based on" the earlier work. 93 | 94 | A "covered work" means either the unmodified Program or a work based 95 | on the Program. 96 | 97 | To "propagate" a work means to do anything with it that, without 98 | permission, would make you directly or secondarily liable for 99 | infringement under applicable copyright law, except executing it on a 100 | computer or modifying a private copy. Propagation includes copying, 101 | distribution (with or without modification), making available to the 102 | public, and in some countries other activities as well. 103 | 104 | To "convey" a work means any kind of propagation that enables other 105 | parties to make or receive copies. Mere interaction with a user 106 | through a computer network, with no transfer of a copy, is not 107 | conveying. 108 | 109 | An interactive user interface displays "Appropriate Legal Notices" to 110 | the extent that it includes a convenient and prominently visible 111 | feature that (1) displays an appropriate copyright notice, and (2) 112 | tells the user that there is no warranty for the work (except to the 113 | extent that warranties are provided), that licensees may convey the 114 | work under this License, and how to view a copy of this License. If 115 | the interface presents a list of user commands or options, such as a 116 | menu, a prominent item in the list meets this criterion. 117 | 118 | #### 1. Source Code. 119 | 120 | The "source code" for a work means the preferred form of the work for 121 | making modifications to it. "Object code" means any non-source form of 122 | a work. 123 | 124 | A "Standard Interface" means an interface that either is an official 125 | standard defined by a recognized standards body, or, in the case of 126 | interfaces specified for a particular programming language, one that 127 | is widely used among developers working in that language. 128 | 129 | The "System Libraries" of an executable work include anything, other 130 | than the work as a whole, that (a) is included in the normal form of 131 | packaging a Major Component, but which is not part of that Major 132 | Component, and (b) serves only to enable use of the work with that 133 | Major Component, or to implement a Standard Interface for which an 134 | implementation is available to the public in source code form. A 135 | "Major Component", in this context, means a major essential component 136 | (kernel, window system, and so on) of the specific operating system 137 | (if any) on which the executable work runs, or a compiler used to 138 | produce the work, or an object code interpreter used to run it. 139 | 140 | The "Corresponding Source" for a work in object code form means all 141 | the source code needed to generate, install, and (for an executable 142 | work) run the object code and to modify the work, including scripts to 143 | control those activities. However, it does not include the work's 144 | System Libraries, or general-purpose tools or generally available free 145 | programs which are used unmodified in performing those activities but 146 | which are not part of the work. For example, Corresponding Source 147 | includes interface definition files associated with source files for 148 | the work, and the source code for shared libraries and dynamically 149 | linked subprograms that the work is specifically designed to require, 150 | such as by intimate data communication or control flow between those 151 | subprograms and other parts of the work. 152 | 153 | The Corresponding Source need not include anything that users can 154 | regenerate automatically from other parts of the Corresponding Source. 155 | 156 | The Corresponding Source for a work in source code form is that same 157 | work. 158 | 159 | #### 2. Basic Permissions. 160 | 161 | All rights granted under this License are granted for the term of 162 | copyright on the Program, and are irrevocable provided the stated 163 | conditions are met. This License explicitly affirms your unlimited 164 | permission to run the unmodified Program. The output from running a 165 | covered work is covered by this License only if the output, given its 166 | content, constitutes a covered work. This License acknowledges your 167 | rights of fair use or other equivalent, as provided by copyright law. 168 | 169 | You may make, run and propagate covered works that you do not convey, 170 | without conditions so long as your license otherwise remains in force. 171 | You may convey covered works to others for the sole purpose of having 172 | them make modifications exclusively for you, or provide you with 173 | facilities for running those works, provided that you comply with the 174 | terms of this License in conveying all material for which you do not 175 | control copyright. Those thus making or running the covered works for 176 | you must do so exclusively on your behalf, under your direction and 177 | control, on terms that prohibit them from making any copies of your 178 | copyrighted material outside their relationship with you. 179 | 180 | Conveying under any other circumstances is permitted solely under the 181 | conditions stated below. Sublicensing is not allowed; section 10 makes 182 | it unnecessary. 183 | 184 | #### 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 185 | 186 | No covered work shall be deemed part of an effective technological 187 | measure under any applicable law fulfilling obligations under article 188 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 189 | similar laws prohibiting or restricting circumvention of such 190 | measures. 191 | 192 | When you convey a covered work, you waive any legal power to forbid 193 | circumvention of technological measures to the extent such 194 | circumvention is effected by exercising rights under this License with 195 | respect to the covered work, and you disclaim any intention to limit 196 | operation or modification of the work as a means of enforcing, against 197 | the work's users, your or third parties' legal rights to forbid 198 | circumvention of technological measures. 199 | 200 | #### 4. Conveying Verbatim Copies. 201 | 202 | You may convey verbatim copies of the Program's source code as you 203 | receive it, in any medium, provided that you conspicuously and 204 | appropriately publish on each copy an appropriate copyright notice; 205 | keep intact all notices stating that this License and any 206 | non-permissive terms added in accord with section 7 apply to the code; 207 | keep intact all notices of the absence of any warranty; and give all 208 | recipients a copy of this License along with the Program. 209 | 210 | You may charge any price or no price for each copy that you convey, 211 | and you may offer support or warranty protection for a fee. 212 | 213 | #### 5. Conveying Modified Source Versions. 214 | 215 | You may convey a work based on the Program, or the modifications to 216 | produce it from the Program, in the form of source code under the 217 | terms of section 4, provided that you also meet all of these 218 | conditions: 219 | 220 | - a) The work must carry prominent notices stating that you modified 221 | it, and giving a relevant date. 222 | - b) The work must carry prominent notices stating that it is 223 | released under this License and any conditions added under 224 | section 7. This requirement modifies the requirement in section 4 225 | to "keep intact all notices". 226 | - c) You must license the entire work, as a whole, under this 227 | License to anyone who comes into possession of a copy. This 228 | License will therefore apply, along with any applicable section 7 229 | additional terms, to the whole of the work, and all its parts, 230 | regardless of how they are packaged. This License gives no 231 | permission to license the work in any other way, but it does not 232 | invalidate such permission if you have separately received it. 233 | - d) If the work has interactive user interfaces, each must display 234 | Appropriate Legal Notices; however, if the Program has interactive 235 | interfaces that do not display Appropriate Legal Notices, your 236 | work need not make them do so. 237 | 238 | A compilation of a covered work with other separate and independent 239 | works, which are not by their nature extensions of the covered work, 240 | and which are not combined with it such as to form a larger program, 241 | in or on a volume of a storage or distribution medium, is called an 242 | "aggregate" if the compilation and its resulting copyright are not 243 | used to limit the access or legal rights of the compilation's users 244 | beyond what the individual works permit. Inclusion of a covered work 245 | in an aggregate does not cause this License to apply to the other 246 | parts of the aggregate. 247 | 248 | #### 6. Conveying Non-Source Forms. 249 | 250 | You may convey a covered work in object code form under the terms of 251 | sections 4 and 5, provided that you also convey the machine-readable 252 | Corresponding Source under the terms of this License, in one of these 253 | ways: 254 | 255 | - a) Convey the object code in, or embodied in, a physical product 256 | (including a physical distribution medium), accompanied by the 257 | Corresponding Source fixed on a durable physical medium 258 | customarily used for software interchange. 259 | - b) Convey the object code in, or embodied in, a physical product 260 | (including a physical distribution medium), accompanied by a 261 | written offer, valid for at least three years and valid for as 262 | long as you offer spare parts or customer support for that product 263 | model, to give anyone who possesses the object code either (1) a 264 | copy of the Corresponding Source for all the software in the 265 | product that is covered by this License, on a durable physical 266 | medium customarily used for software interchange, for a price no 267 | more than your reasonable cost of physically performing this 268 | conveying of source, or (2) access to copy the Corresponding 269 | Source from a network server at no charge. 270 | - c) Convey individual copies of the object code with a copy of the 271 | written offer to provide the Corresponding Source. This 272 | alternative is allowed only occasionally and noncommercially, and 273 | only if you received the object code with such an offer, in accord 274 | with subsection 6b. 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 | - e) Convey the object code using peer-to-peer transmission, 288 | provided you inform other peers where the object code and 289 | Corresponding Source of the work are being offered to the general 290 | public at no charge under subsection 6d. 291 | 292 | A separable portion of the object code, whose source code is excluded 293 | from the Corresponding Source as a System Library, need not be 294 | included in conveying the object code work. 295 | 296 | A "User Product" is either (1) a "consumer product", which means any 297 | tangible personal property which is normally used for personal, 298 | family, or household purposes, or (2) anything designed or sold for 299 | incorporation into a dwelling. In determining whether a product is a 300 | consumer product, doubtful cases shall be resolved in favor of 301 | coverage. For a particular product received by a particular user, 302 | "normally used" refers to a typical or common use of that class of 303 | product, regardless of the status of the particular user or of the way 304 | in which the particular user actually uses, or expects or is expected 305 | to use, the product. A product is a consumer product regardless of 306 | whether the product has substantial commercial, industrial or 307 | non-consumer uses, unless such uses represent the only significant 308 | 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 312 | install and execute modified versions of a covered work in that User 313 | Product from a modified version of its Corresponding Source. The 314 | information must suffice to ensure that the continued functioning of 315 | the modified object code is in no case prevented or interfered with 316 | solely because 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 331 | updates for a work that has been modified or installed by the 332 | recipient, or for the User Product in which it has been modified or 333 | installed. Access to a network may be denied when the modification 334 | itself materially and adversely affects the operation of the network 335 | or violates the rules and protocols for communication across the 336 | network. 337 | 338 | Corresponding Source conveyed, and Installation Information provided, 339 | in accord with this section must be in a format that is publicly 340 | documented (and with an implementation available to the public in 341 | source code form), and must require no special password or key for 342 | unpacking, reading or copying. 343 | 344 | #### 7. Additional Terms. 345 | 346 | "Additional permissions" are terms that supplement the terms of this 347 | License by making exceptions from one or more of its conditions. 348 | Additional permissions that are applicable to the entire Program shall 349 | be treated as though they were included in this License, to the extent 350 | that they are valid under applicable law. If additional permissions 351 | apply only to part of the Program, that part may be used separately 352 | under those permissions, but the entire Program remains governed by 353 | this License without regard to the additional permissions. 354 | 355 | When you convey a copy of a covered work, you may at your option 356 | remove any additional permissions from that copy, or from any part of 357 | it. (Additional permissions may be written to require their own 358 | removal in certain cases when you modify the work.) You may place 359 | additional permissions on material, added by you to a covered work, 360 | for which you have or can give appropriate copyright permission. 361 | 362 | Notwithstanding any other provision of this License, for material you 363 | add to a covered work, you may (if authorized by the copyright holders 364 | of that material) supplement the terms of this License with terms: 365 | 366 | - a) Disclaiming warranty or limiting liability differently from the 367 | terms of sections 15 and 16 of this License; or 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 | - c) Prohibiting misrepresentation of the origin of that material, 372 | or requiring that modified versions of such material be marked in 373 | reasonable ways as different from the original version; or 374 | - d) Limiting the use for publicity purposes of names of licensors 375 | or authors of the material; or 376 | - e) Declining to grant rights under trademark law for use of some 377 | trade names, trademarks, or service marks; or 378 | - f) Requiring indemnification of licensors and authors of that 379 | material by anyone who conveys the material (or modified versions 380 | of it) with contractual assumptions of liability to the recipient, 381 | for any liability that these contractual assumptions directly 382 | impose on those licensors and authors. 383 | 384 | All other non-permissive additional terms are considered "further 385 | restrictions" within the meaning of section 10. If the Program as you 386 | received it, or any part of it, contains a notice stating that it is 387 | governed by this License along with a term that is a further 388 | restriction, you may remove that term. If a license document contains 389 | a further restriction but permits relicensing or conveying under this 390 | License, you may add to a covered work material governed by the terms 391 | of that license document, provided that the further restriction does 392 | not survive such relicensing or conveying. 393 | 394 | If you add terms to a covered work in accord with this section, you 395 | must place, in the relevant source files, a statement of the 396 | additional terms that apply to those files, or a notice indicating 397 | where to find the applicable terms. 398 | 399 | Additional terms, permissive or non-permissive, may be stated in the 400 | form of a separately written license, or stated as exceptions; the 401 | above requirements apply either way. 402 | 403 | #### 8. Termination. 404 | 405 | You may not propagate or modify a covered work except as expressly 406 | provided under this License. Any attempt otherwise to propagate or 407 | modify it is void, and will automatically terminate your rights under 408 | this License (including any patent licenses granted under the third 409 | paragraph of section 11). 410 | 411 | However, if you cease all violation of this License, then your license 412 | from a particular copyright holder is reinstated (a) provisionally, 413 | unless and until the copyright holder explicitly and finally 414 | terminates your license, and (b) permanently, if the copyright holder 415 | fails to notify you of the violation by some reasonable means prior to 416 | 60 days after the cessation. 417 | 418 | Moreover, your license from a particular copyright holder is 419 | reinstated permanently if the copyright holder notifies you of the 420 | violation by some reasonable means, this is the first time you have 421 | received notice of violation of this License (for any work) from that 422 | copyright holder, and you cure the violation prior to 30 days after 423 | your receipt of the notice. 424 | 425 | Termination of your rights under this section does not terminate the 426 | licenses of parties who have received copies or rights from you under 427 | this License. If your rights have been terminated and not permanently 428 | reinstated, you do not qualify to receive new licenses for the same 429 | material under section 10. 430 | 431 | #### 9. Acceptance Not Required for Having Copies. 432 | 433 | You are not required to accept this License in order to receive or run 434 | a copy of the Program. Ancillary propagation of a covered work 435 | occurring solely as a consequence of using peer-to-peer transmission 436 | to receive a copy likewise does not require acceptance. However, 437 | nothing other than this License grants you permission to propagate or 438 | modify any covered work. These actions infringe copyright if you do 439 | not accept this License. Therefore, by modifying or propagating a 440 | covered work, you indicate your acceptance of this License to do so. 441 | 442 | #### 10. Automatic Licensing of Downstream Recipients. 443 | 444 | Each time you convey a covered work, the recipient automatically 445 | receives a license from the original licensors, to run, modify and 446 | propagate that work, subject to this License. You are not responsible 447 | for enforcing compliance by third parties with this License. 448 | 449 | An "entity transaction" is a transaction transferring control of an 450 | organization, or substantially all assets of one, or subdividing an 451 | organization, or merging organizations. If propagation of a covered 452 | work results from an entity transaction, each party to that 453 | transaction who receives a copy of the work also receives whatever 454 | licenses to the work the party's predecessor in interest had or could 455 | give under the previous paragraph, plus a right to possession of the 456 | Corresponding Source of the work from the predecessor in interest, if 457 | the predecessor has it or can get it with reasonable efforts. 458 | 459 | You may not impose any further restrictions on the exercise of the 460 | rights granted or affirmed under this License. For example, you may 461 | not impose a license fee, royalty, or other charge for exercise of 462 | rights granted under this License, and you may not initiate litigation 463 | (including a cross-claim or counterclaim in a lawsuit) alleging that 464 | any patent claim is infringed by making, using, selling, offering for 465 | sale, or importing the Program or any portion of it. 466 | 467 | #### 11. Patents. 468 | 469 | A "contributor" is a copyright holder who authorizes use under this 470 | License of the Program or a work on which the Program is based. The 471 | work thus licensed is called the contributor's "contributor version". 472 | 473 | A contributor's "essential patent claims" are all patent claims owned 474 | or controlled by the contributor, whether already acquired or 475 | hereafter acquired, that would be infringed by some manner, permitted 476 | by this License, of making, using, or selling its contributor version, 477 | but do not include claims that would be infringed only as a 478 | consequence of further modification of the contributor version. For 479 | purposes of this definition, "control" includes the right to grant 480 | patent sublicenses in a manner consistent with the requirements of 481 | this License. 482 | 483 | Each contributor grants you a non-exclusive, worldwide, royalty-free 484 | patent license under the contributor's essential patent claims, to 485 | make, use, sell, offer for sale, import and otherwise run, modify and 486 | propagate the contents of its contributor version. 487 | 488 | In the following three paragraphs, a "patent license" is any express 489 | agreement or commitment, however denominated, not to enforce a patent 490 | (such as an express permission to practice a patent or covenant not to 491 | sue for patent infringement). To "grant" such a patent license to a 492 | party means to make such an agreement or commitment not to enforce a 493 | patent against the party. 494 | 495 | If you convey a covered work, knowingly relying on a patent license, 496 | and the Corresponding Source of the work is not available for anyone 497 | to copy, free of charge and under the terms of this License, through a 498 | publicly available network server or other readily accessible means, 499 | then you must either (1) cause the Corresponding Source to be so 500 | available, or (2) arrange to deprive yourself of the benefit of the 501 | patent license for this particular work, or (3) arrange, in a manner 502 | consistent with the requirements of this License, to extend the patent 503 | license to downstream recipients. "Knowingly relying" means you have 504 | actual knowledge that, but for the patent license, your conveying the 505 | covered work in a country, or your recipient's use of the covered work 506 | in a country, would infringe one or more identifiable patents in that 507 | country that you have reason to believe are valid. 508 | 509 | If, pursuant to or in connection with a single transaction or 510 | arrangement, you convey, or propagate by procuring conveyance of, a 511 | covered work, and grant a patent license to some of the parties 512 | receiving the covered work authorizing them to use, propagate, modify 513 | or convey a specific copy of the covered work, then the patent license 514 | you grant is automatically extended to all recipients of the covered 515 | work and works based on it. 516 | 517 | A patent license is "discriminatory" if it does not include within the 518 | scope of its coverage, prohibits the exercise of, or is conditioned on 519 | the non-exercise of one or more of the rights that are specifically 520 | granted under this License. You may not convey a covered work if you 521 | are a party to an arrangement with a third party that is in the 522 | business of distributing software, under which you make payment to the 523 | third party based on the extent of your activity of conveying the 524 | work, and under which the third party grants, to any of the parties 525 | who would receive the covered work from you, a discriminatory patent 526 | license (a) in connection with copies of the covered work conveyed by 527 | you (or copies made from those copies), or (b) primarily for and in 528 | connection with specific products or compilations that contain the 529 | covered work, unless you entered into that arrangement, or that patent 530 | license was granted, prior to 28 March 2007. 531 | 532 | Nothing in this License shall be construed as excluding or limiting 533 | any implied license or other defenses to infringement that may 534 | otherwise be available to you under applicable patent law. 535 | 536 | #### 12. No Surrender of Others' Freedom. 537 | 538 | If conditions are imposed on you (whether by court order, agreement or 539 | otherwise) that contradict the conditions of this License, they do not 540 | excuse you from the conditions of this License. If you cannot convey a 541 | covered work so as to satisfy simultaneously your obligations under 542 | this License and any other pertinent obligations, then as a 543 | consequence you may not convey it at all. For example, if you agree to 544 | terms that obligate you to collect a royalty for further conveying 545 | from those to whom you convey the Program, the only way you could 546 | satisfy both those terms and this License would be to refrain entirely 547 | from conveying the Program. 548 | 549 | #### 13. Use with the GNU Affero General Public License. 550 | 551 | Notwithstanding any other provision of this License, you have 552 | permission to link or combine any covered work with a work licensed 553 | under version 3 of the GNU Affero General Public License into a single 554 | combined work, and to convey the resulting work. The terms of this 555 | License will continue to apply to the part which is the covered work, 556 | but the special requirements of the GNU Affero General Public License, 557 | section 13, concerning interaction through a network will apply to the 558 | combination as such. 559 | 560 | #### 14. Revised Versions of this License. 561 | 562 | The Free Software Foundation may publish revised and/or new versions 563 | of the GNU General Public License from time to time. Such new versions 564 | will be similar in spirit to the present version, but may differ in 565 | detail to address new problems or concerns. 566 | 567 | Each version is given a distinguishing version number. If the Program 568 | specifies that a certain numbered version of the GNU General Public 569 | License "or any later version" applies to it, you have the option of 570 | following the terms and conditions either of that numbered version or 571 | of any later version published by the Free Software Foundation. If the 572 | Program does not specify a version number of the GNU General Public 573 | License, you may choose any version ever published by the Free 574 | Software Foundation. 575 | 576 | If the Program specifies that a proxy can decide which future versions 577 | of the GNU General Public License can be used, that proxy's public 578 | statement of acceptance of a version permanently authorizes you to 579 | choose that version for the Program. 580 | 581 | Later license versions may give you additional or different 582 | permissions. However, no additional obligations are imposed on any 583 | author or copyright holder as a result of your choosing to follow a 584 | later version. 585 | 586 | #### 15. Disclaimer of Warranty. 587 | 588 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 589 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 590 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT 591 | WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT 592 | LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 593 | A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND 594 | PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE 595 | DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR 596 | CORRECTION. 597 | 598 | #### 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR 602 | CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 603 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES 604 | ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT 605 | NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR 606 | LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM 607 | TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER 608 | PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 609 | 610 | #### 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | ### How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these 626 | terms. 627 | 628 | To do so, attach the following notices to the program. It is safest to 629 | attach them to the start of each source file to most effectively state 630 | the exclusion of warranty; and each file should have at least the 631 | "copyright" line and a pointer to where the full notice is found. 632 | 633 | 634 | Copyright (C) 635 | 636 | This program is free software: you can redistribute it and/or modify 637 | it under the terms of the GNU General Public License as published by 638 | the Free Software Foundation, either version 3 of the License, or 639 | (at your option) any later version. 640 | 641 | This program is distributed in the hope that it will be useful, 642 | but WITHOUT ANY WARRANTY; without even the implied warranty of 643 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 644 | GNU General Public License for more details. 645 | 646 | You should have received a copy of the GNU General Public License 647 | along with this program. If not, see . 648 | 649 | Also add information on how to contact you by electronic and paper 650 | 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 | Copyright (C) 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 661 | appropriate parts of the General Public License. Of course, your 662 | program's commands might be different; for a GUI interface, you would 663 | use an "about box". 664 | 665 | You should also get your employer (if you work as a programmer) or 666 | school, if any, to sign a "copyright disclaimer" for the program, if 667 | necessary. For more information on this, and how to apply and follow 668 | the GNU GPL, see . 669 | 670 | The GNU General Public License does not permit incorporating your 671 | program into proprietary programs. If your program is a subroutine 672 | library, you may consider it more useful to permit linking proprietary 673 | applications with the library. If this is what you want to do, use the 674 | GNU Lesser General Public License instead of this License. But first, 675 | please read . 676 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Arduino EEPROM Library 2 | http://github.com/JChristensen/JC_EEPROM 3 | README file 4 | 5 | 6 | ## License 7 | Arduino EEPROM Library Copyright (C) 2022 Jack Christensen GNU GPL v3.0 8 | 9 | This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License v3.0 as published by the Free Software Foundation. 10 | 11 | This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. 12 | 13 | You should have received a copy of the GNU General Public License along with this program. If not, see 14 | 15 | ## Introduction 16 | **Arduino EEPROM Library** 17 | 18 | This library will work with most I2C serial EEPROM chips between 2k bits and 2048k bits (2M bits) in size. Multiple EEPROMs on the bus are supported as a single address space. I/O across block, page and device boundaries is supported. Certain assumptions are made regarding the EEPROM device addressing. These assumptions should be true for most EEPROMs but there are exceptions, so read the datasheet and know your hardware. 19 | 20 | The library should also work for EEPROMs smaller than 2k bits, assuming that there is only one EEPROM on the bus and also that the user is careful to not exceed the maximum address for the EEPROM. 21 | 22 | The **JC_EEPROM Library** has been tested with: 23 | - Microchip 24AA02E48 (2k bit) 24 | - 24xx32 (32k bit, thanks to Richard M) 25 | - Microchip 24LC256 (256k bit) 26 | - Microchip 24FC1026 (1M bit, thanks to Gabriele B on the Arduino forum) 27 | - ST Micro M24M02 (2M bit) 28 | - Atmel AT24C256C (thanks to searobin) 29 | - Microchip 24C16B, 24C32 (thanks to Diogko) 30 | - Microchip AT24C02 and ST Micro M24C04-W with ESP-12F/ESP8266 (thanks to Thorsten) 31 | 32 | The **JC_EEPROM Library** will **NOT** work with Microchip 24xx1025 as its control byte does not conform to the following assumptions. 33 | 34 | **Device addressing assumptions:** 35 | - The I2C address sequence consists of a control byte followed by one address byte (for EEPROMs <= 16k bits) or two address bytes (for EEPROMs > 16k bits). 36 | - The three least-significant bits in the control byte (excluding the R/W bit) comprise the three most-significant bits for the entire address space, i.e. all chips on the bus. As such, these may be chip-select bits or block-select bits (for individual chips that have an internal block organization), or a combination of both (in which case the block-select bits must be of lesser significance than the chip-select bits). 37 | - Regardless of the number of bits needed to address the entire address space, the three most-significant bits always go in the control byte. Depending on EEPROM device size, this may result in one or more of the most significant bits in the I2C address bytes being unused (or "don't care" bits). 38 | - An EEPROM contains an integral number of pages. 39 | 40 | Note that the Arduino Wire library has a buffer size of 32 bytes. This limits the size of physical I/Os that can be done to EEPROM. For writes, one or two bytes are used for the address, so writing is therefore limited to 31 or 30 bytes. Because the **JC_EEPROM Library** will handle I/O across block, page and device boundaries, the only consequence this has for the user is one of efficiency; arbitrarily large blocks of data can be written and read; however, carefully chosen block sizes may reduce the number of physical I/Os needed. 41 | 42 | ## Installation 43 | The library can be installed using the Arduino Library Manager. To install manually: 44 | - Go to http://github.com/JChristensen/JC_EEPROM, click **Code > Download ZIP** and save the ZIP file to a convenient location on your PC. 45 | - Uncompress the downloaded file. This will result in a folder containing all the files for the library, that has a name that includes the branch name, usually **JC_EEPROM-master**. 46 | - Rename the folder to just **JC_EEPROM**. 47 | - Copy the renamed folder to the Arduino sketchbook/libraries folder. 48 | 49 | ## Examples 50 | The following example sketch is included with the **JC_EEPROM Library**: 51 | - **eepromTest:** Writes 32-bit integers to the entire EEPROM address space, starting at address 0 and continuing to the topmost address. These are then read back in and verified; any discrepancies are reported to the serial monitor. 52 | - **struct:** Demonstrates writing a `struct` to EEPROM and reading it back. 53 | 54 | ## Enumerations 55 | 56 | ### eeprom_size_t 57 | ##### Description 58 | EEPROM device size in k-bits. Many manufacturers' EEPROM part numbers are designated in k-bits. 59 | ##### Values 60 | - JC_EEPROM::kbits_2 61 | - JC_EEPROM::kbits_4 62 | - JC_EEPROM::kbits_8 63 | - JC_EEPROM::kbits_16 64 | - JC_EEPROM::kbits_32 65 | - JC_EEPROM::kbits_64 66 | - JC_EEPROM::kbits_128 67 | - JC_EEPROM::kbits_256 68 | - JC_EEPROM::kbits_512 69 | - JC_EEPROM::kbits_1024 70 | - JC_EEPROM::kbits_2048 71 | 72 | ### twiClockFreq_t 73 | ##### Description 74 | I2C bus speed. 75 | ##### Values 76 | - JC_EEPROM::twiClock100kHz 77 | - JC_EEPROM::twiClock400kHz 78 | 79 | ## Constructor 80 | 81 | ### JC_EEPROM(eeprom_size_t devCap, uint8_t nDev, uint16_t pgSize, uint8_t busAddr) 82 | ##### Description 83 | Instantiates an external EEPROM object. 84 | ##### Syntax 85 | `JC_EEPROM myEEPROM(eeprom_size_t devCap, uint8_t nDev, uint16_t pgSize, uint8_t busAddr));` 86 | ##### Parameters 87 | **devCap** *(eeprom_size_t)*: The size of one EEPROM device in k-bits. Choose a value from the eeprom_size_t enumeration above. 88 | **nDev** *(uint8_t)*: The number of EEPROM devices on the bus. Note that if there are multiple EEPROM devices on the bus, they must be identical and each must have its address pins strapped properly. 89 | **pgSize** *(uint16_t)*: The EEPROM page size in bytes. Consult the datasheet if you are unsure of the page size. 90 | **busAddr** *(uint8_t)*: The base I2C bus address for the EEPROM(s). 0x50 is a common value and this parameter can be omitted, in which case 0x50 will be used as the default. 91 | ##### Example 92 | ```c++ 93 | JC_EEPROM myEEPROM(kbits_256, 2, 64); //two 24LC256 EEPROMS on the bus 94 | JC_EEPROM oddEEPROM(kbits_8, 1, 16, 0x42); //an EEPROM with a non-standard I2C address 95 | ``` 96 | 97 | ## Methods 98 | ### begin(twiClockFreq_t freq) 99 | ##### Description 100 | Initializes the library. Call this method once in the setup code. begin() does a dummy I/O so that the user may interrogate the return status to ensure the EEPROM is operational. 101 | ##### Syntax 102 | `myEEPROM.begin(twiClockFreq_t freq);` 103 | ##### Parameters 104 | **freq** *(twiClockFreq_t)*: The desired I2C bus speed, `JC_EEPROM::twiClock100kHz` or `JC_EEPROM::twiClock400kHz`. Can be omitted in which case it will default to `twiClock100kHz`. **NOTE:** When using 400kHz, if there are other devices on the bus they must all support a 400kHz bus speed. **Secondly**, the other devices should be initialized first, as other libraries may not support adjusting the bus speed. To ensure the desired speed is set, call the JC_EEPROM.begin() function *after* initializing all other I2C devices. 105 | ##### Returns 106 | I2C I/O status, zero if successful *(uint8_t)*. See the [Arduino Wire.endTransmission() function](https://www.arduino.cc/reference/en/language/functions/communication/wire/endtransmission/) for a description of other return codes. 107 | ##### Example 108 | ```c++ 109 | JC_EEPROM myEEPROM(kbits_256, 2, 64); 110 | uint8_t i2cStat = myEEPROM.begin(JC_EEPROM::twiClock400kHz); 111 | if ( i2cStat != 0 ) { 112 | //there was a problem 113 | } 114 | ``` 115 | ### write(uint32_t addr, uint8_t* values, uint16_t nBytes) 116 | ##### Description 117 | Write one or more bytes to external EEPROM. 118 | ##### Syntax 119 | `myEEPROM.write(uint32_t addr, uint8_t* values, uint16_t nBytes);` 120 | ##### Parameters 121 | **addr** *(uint32_t)*: The beginning EEPROM location to write. 122 | **values** _(uint8_t*)_: Pointer to an array containing the data to write. 123 | **nBytes** *(uint16_t)*: The number of bytes to write. 124 | ##### Returns 125 | I2C I/O status, zero if successful *(uint8_t)*. See the [Arduino Wire.endTransmission() function](https://www.arduino.cc/reference/en/language/functions/communication/wire/endtransmission/) for a description of other return codes. Returns a status of EEPROM_ADDR_ERR if the I/O would extend past the top of the EEPROM address space. 126 | ##### Example 127 | ```c++ 128 | uint8_t myData[10]; 129 | //write 10 bytes starting at location 42 130 | uint8_t i2cStat = myEEPROM.write(42, myData, 10); 131 | if ( i2cStat != 0 ) { 132 | //there was a problem 133 | if ( i2cStat == EEPROM_ADDR_ERR) { 134 | //bad address 135 | } 136 | else { 137 | //some other I2C error 138 | } 139 | } 140 | ``` 141 | ### write(uint32_t addr, uint8_t value) 142 | ##### Description 143 | Writes a single byte to external EEPROM. 144 | ##### Syntax 145 | `myEEPROM.write(uint32_t addr, uint8_t value);` 146 | ##### Parameters 147 | **addr** *(uint32_t)*: The EEPROM location to write. 148 | **values** _(uint8_t)_: The value to write. 149 | ##### Returns 150 | Same as multiple-byte write() above. 151 | ##### Example 152 | ```c++ 153 | //write the value 16 to EEPROM location 314. 154 | uint8_t i2cStat = myEEPROM.write(314, 16); 155 | ``` 156 | ### read(uint32_t addr, uint8_t* values, uint16_t nBytes) 157 | ##### Description 158 | Reads one or more bytes from external EEPROM into an array supplied by the caller. 159 | ##### Syntax 160 | `myEEPROM.read(uint32_t addr, uint8_t* values, uint16_t nBytes);` 161 | ##### Parameters 162 | **addr** *(uint32_t)*: The beginning EEPROM location to read from. 163 | **values** _(uint8_t*)_: Pointer to an array to receive the data. 164 | **nBytes** *(uint16_t)*: The number of bytes to read. 165 | ##### Returns 166 | I2C I/O status, zero if successful *(uint8_t)*. See the [Arduino Wire.endTransmission() function](https://www.arduino.cc/reference/en/language/functions/communication/wire/endtransmission/) for a description of other return codes. Returns a status of EEPROM_ADDR_ERR if the I/O would extend past the top of the EEPROM address space. 167 | ##### Example 168 | ```c++ 169 | uint8_t myData[10]; 170 | //read 10 bytes starting at location 42 171 | uint8_t i2cStat = myEEPROM.read(42, myData, 10); 172 | if ( i2cStat != 0 ) { 173 | //there was a problem 174 | if ( i2cStat == EEPROM_ADDR_ERR) { 175 | //bad address 176 | } 177 | else { 178 | //some other I2C error 179 | } 180 | } 181 | ``` 182 | ### read(uint32_t addr) 183 | ##### Description 184 | Reads a single byte from external EEPROM. 185 | ##### Syntax 186 | `myEEPROM.read(uint32_t addr);` 187 | ##### Parameters 188 | **addr** *(uint32_t)*: The EEPROM location to read from. 189 | ##### Returns 190 | The data read from EEPROM or an error code *(int16_t)*. To distinguish error values from valid data, error values are returned as negative numbers. See the [Arduino Wire.endTransmission() function](https://www.arduino.cc/reference/en/language/functions/communication/wire/endtransmission/) for a description of return codes. Returns a status of EEPROM_ADDR_ERR if the I/O would extend past the top of the EEPROM address space. 191 | 192 | ##### Example 193 | ```c++ 194 | //read a byte from location 42 195 | int16_t readValue = myEEPROM.read(42); 196 | if ( readValue < 0 ) { 197 | //there was a problem 198 | if ( -readValue == EEPROM_ADDR_ERR) { 199 | //bad address 200 | } 201 | else { 202 | //some other I2C error 203 | } 204 | } 205 | else { 206 | //data read ok 207 | } 208 | ``` 209 | 210 | ### update(uint32_t addr, uint8_t value) 211 | ##### Description 212 | Updates a single byte in external EEPROM. Like `write(addr, value)` except first reads the location from EEPROM and only writes `value` if it differs from the current value stored at the given location, to reduce wear on the EEPROM. 213 | ##### Syntax 214 | `myEEPROM.update(uint32_t addr, uint8_t value);` 215 | ##### Parameters 216 | **addr** *(uint32_t)*: The EEPROM location to update. 217 | **values** _(uint8_t)_: The value to write. 218 | ##### Returns 219 | Same as multiple-byte write() above. 220 | ##### Example 221 | ```c++ 222 | // update the value in EEPROM location 314 to 16. 223 | uint8_t i2cStat = myEEPROM.update(314, 16); 224 | ``` -------------------------------------------------------------------------------- /examples/eepromTest/eepromTest.ino: -------------------------------------------------------------------------------- 1 | // Arduino JC_EEPROM Library 2 | // https://github.com/JChristensen/JC_EEPROM 3 | // Copyright (C) 2022 by Jack Christensen and licensed under 4 | // GNU GPL v3.0, https://www.gnu.org/licenses/gpl.html 5 | // 6 | // Example sketch to test JC_EEPROM library. 7 | // Writes the EEPROM full of 32-bit integers and reads them back to verify. 8 | // Wire a button from digital pin 6 to ground, this is used as a start button 9 | // so the sketch doesn't do unnecessary EEPROM writes every time it's reset. 10 | // Jack Christensen 09Jul2014 11 | 12 | #include // https://github.com/JChristensen/JC_EEPROM 13 | #include // https://github.com/janelia-arduino/Streaming 14 | #include // https://arduino.cc/en/Reference/Wire 15 | 16 | // Two 24LC256 EEPROMs on the bus 17 | JC_EEPROM eep(JC_EEPROM::kbits_256, 2, 64); // device size, number of devices, page size 18 | 19 | constexpr bool erase {false}; // true writes 0xFF to all addresses, 20 | // false performs write/read test 21 | constexpr uint32_t totalKBytes {64}; // for read and write test functions 22 | constexpr uint8_t btnStart {6}; // pin for start button 23 | 24 | void setup() 25 | { 26 | pinMode(btnStart, INPUT_PULLUP); 27 | Serial.begin(115200); 28 | Serial << F( "\n" __FILE__ "\n" __DATE__ " " __TIME__ "\n" ); 29 | 30 | uint8_t eepStatus = eep.begin(JC_EEPROM::twiClock400kHz); // go fast! 31 | if (eepStatus) { 32 | Serial << endl << F("extEEPROM.begin() failed, status = ") << eepStatus << endl; 33 | while (1); 34 | } 35 | 36 | Serial << endl << F("Press button to start...") << endl; 37 | while (digitalRead(btnStart) == HIGH) delay(10); // wait for button push 38 | 39 | // chunkSize can be changed, but must be a multiple of 4 since we're writing 32-bit integers 40 | uint8_t chunkSize = 64; 41 | if (erase) { 42 | eeErase(chunkSize, 0, totalKBytes * 1024 - 1); 43 | dump(0, totalKBytes * 1024); // dump everything 44 | } 45 | else { 46 | eeWrite(chunkSize); 47 | eeRead(chunkSize); 48 | dump(0, 16); // the first 16 bytes 49 | dump(32752, 32); // across the device boundary 50 | dump(65520, 16); // the last 16 bytes 51 | } 52 | Serial << "\nDone.\n"; 53 | } 54 | 55 | void loop() {} 56 | 57 | // write test data (32-bit integers) to eeprom, "chunk" bytes at a time 58 | void eeWrite(uint8_t chunk) 59 | { 60 | chunk &= 0xFC; // force chunk to be a multiple of 4 61 | uint8_t data[chunk]; 62 | uint32_t val = 0; 63 | Serial << F("Writing...") << endl; 64 | uint32_t msStart = millis(); 65 | 66 | for (uint32_t addr = 0; addr < totalKBytes * 1024; addr += chunk) { 67 | if ( (addr &0xFFF) == 0 ) Serial << addr << endl; 68 | for (uint8_t c = 0; c < chunk; c += 4) { 69 | data[c+0] = val >> 24; 70 | data[c+1] = val >> 16; 71 | data[c+2] = val >> 8; 72 | data[c+3] = val; 73 | ++val; 74 | } 75 | eep.write(addr, data, chunk); 76 | } 77 | uint32_t msLapse = millis() - msStart; 78 | Serial << "Write lapse: " << msLapse << " ms" << endl; 79 | } 80 | 81 | // read test data (32-bit integers) from eeprom, "chunk" bytes at a time 82 | void eeRead(uint8_t chunk) 83 | { 84 | chunk &= 0xFC; // force chunk to be a multiple of 4 85 | uint8_t data[chunk]; 86 | uint32_t val = 0, testVal; 87 | Serial << F("Reading...") << endl; 88 | uint32_t msStart = millis(); 89 | 90 | for (uint32_t addr = 0; addr < totalKBytes * 1024; addr += chunk) { 91 | if ( (addr &0xFFF) == 0 ) Serial << addr << endl; 92 | eep.read(addr, data, chunk); 93 | for (uint8_t c = 0; c < chunk; c += 4) { 94 | testVal = ((uint32_t)data[c+0] << 24) + ((uint32_t)data[c+1] << 16) + ((uint32_t)data[c+2] << 8) + (uint32_t)data[c+3]; 95 | if (testVal != val) Serial << F("Error @ addr ") << addr+c << F(" Expected ") << val << F(" Read ") << testVal << F(" 0x") << _HEX(testVal) << endl; 96 | ++val; 97 | } 98 | } 99 | uint32_t msLapse = millis() - msStart; 100 | Serial << "Last value: " << --val << " Read lapse: " << msLapse << " ms" << endl; 101 | } 102 | 103 | // write 0xFF to eeprom, "chunk" bytes at a time 104 | void eeErase(uint8_t chunk, uint32_t startAddr, uint32_t endAddr) 105 | { 106 | chunk &= 0xFC; // force chunk to be a multiple of 4 107 | uint8_t data[chunk]; 108 | Serial << F("Erasing...") << endl; 109 | for (int16_t i = 0; i < chunk; i++) data[i] = 0xFF; 110 | uint32_t msStart = millis(); 111 | 112 | for (uint32_t a = startAddr; a <= endAddr; a += chunk) { 113 | if ( (a &0xFFF) == 0 ) Serial << a << endl; 114 | eep.write(a, data, chunk); 115 | } 116 | uint32_t msLapse = millis() - msStart; 117 | Serial << "Erase lapse: " << msLapse << " ms" << endl; 118 | } 119 | 120 | // dump eeprom contents, 16 bytes at a time. 121 | // always dumps a multiple of 16 bytes. 122 | // duplicate rows are suppressed and indicated with an asterisk. 123 | void dump(uint32_t startAddr, uint32_t nBytes) 124 | { 125 | Serial << endl << F("EEPROM DUMP 0x") << _HEX(startAddr) << F(" 0x") << _HEX(nBytes) << ' ' << startAddr << ' ' << nBytes << endl; 126 | uint32_t nRows = (nBytes + 15) >> 4; 127 | 128 | uint8_t d[16], last[16]; 129 | uint32_t aLast {startAddr}; 130 | for (uint32_t r = 0; r < nRows; r++) { 131 | uint32_t a = startAddr + 16 * r; 132 | eep.read(a, d, 16); 133 | bool same {true}; 134 | for (int i=0; i<16; ++i) { 135 | if (last[i] != d[i]) same = false; 136 | } 137 | if (!same || r == 0 || r == nRows-1) { 138 | Serial << "0x"; 139 | if ( a < 16 * 16 * 16 ) Serial << '0'; 140 | if ( a < 16 * 16 ) Serial << '0'; 141 | if ( a < 16 ) Serial << '0'; 142 | Serial << _HEX(a) << (a == aLast+16 || r == 0 ? " " : "* "); 143 | for ( int16_t c = 0; c < 16; c++ ) { 144 | if ( d[c] < 16 ) Serial << '0'; 145 | Serial << _HEX( d[c] ) << ( c == 7 ? " " : " " ); 146 | } 147 | Serial << endl; 148 | aLast = a; 149 | } 150 | for (int i=0; i<16; ++i) { 151 | last[i] = d[i]; 152 | } 153 | } 154 | } 155 | -------------------------------------------------------------------------------- /examples/struct/struct.ino: -------------------------------------------------------------------------------- 1 | // Arduino JC_EEPROM Library 2 | // https://github.com/JChristensen/JC_EEPROM 3 | // Copyright (C) 2022 by Jack Christensen and licensed under 4 | // GNU GPL v3.0, https://www.gnu.org/licenses/gpl.html 5 | // 6 | // Example sketch to write a struct to EEPROM and read it back. 7 | 8 | #include // https://github.com/JChristensen/JC_EEPROM 9 | #include // https://github.com/janelia-arduino/Streaming 10 | 11 | struct myStruct { 12 | int16_t a; 13 | int32_t b; 14 | float c; 15 | double d; 16 | uint8_t e; 17 | bool f; 18 | }; 19 | 20 | JC_EEPROM eep(JC_EEPROM::kbits_256, 1, 64); // 24LC256 21 | 22 | void setup() 23 | { 24 | constexpr uint32_t addr {61}; 25 | eep.begin(); 26 | Serial.begin(115200); 27 | Serial << F( "\n" __FILE__ "\n" __DATE__ " " __TIME__ "\n" ); 28 | 29 | myStruct w { 1, 2, 3, 4, 5, true }; 30 | Serial << "Writing " << sizeof(w) << " bytes\n"; 31 | uint8_t s = eep.write(addr, reinterpret_cast(&w), sizeof(w)); 32 | Serial << "Write status " << s << endl; 33 | printStruct(w); 34 | 35 | Serial << "Reading\n"; 36 | myStruct r; 37 | eep.read(addr, reinterpret_cast(&r), sizeof(r)); 38 | printStruct(r); 39 | dump(0, 32 * 1024UL); // dump all eeprom 40 | Serial << "\nDone.\n"; 41 | } 42 | 43 | void loop() {} 44 | 45 | void printStruct(myStruct s) 46 | { 47 | Serial << s.a << ' ' << s.b << ' ' << s.c << ' ' << s.d << ' '; 48 | Serial << s.e << ' ' << s.f << endl; 49 | } 50 | 51 | // dump eeprom contents, 16 bytes at a time. 52 | // always dumps a multiple of 16 bytes. 53 | // duplicate rows are suppressed and indicated with an asterisk. 54 | void dump(uint32_t startAddr, uint32_t nBytes) 55 | { 56 | Serial << endl << F("EEPROM DUMP 0x") << _HEX(startAddr) << F(" 0x") << _HEX(nBytes) << ' ' << startAddr << ' ' << nBytes << endl; 57 | uint32_t nRows = (nBytes + 15) >> 4; 58 | 59 | uint8_t d[16], last[16]; 60 | uint32_t aLast {startAddr}; 61 | for (uint32_t r = 0; r < nRows; r++) { 62 | uint32_t a = startAddr + 16 * r; 63 | eep.read(a, d, 16); 64 | bool same {true}; 65 | for (int i=0; i<16; ++i) { 66 | if (last[i] != d[i]) same = false; 67 | } 68 | if (!same || r == 0 || r == nRows-1) { 69 | Serial << "0x"; 70 | if ( a < 16 * 16 * 16 ) Serial << '0'; 71 | if ( a < 16 * 16 ) Serial << '0'; 72 | if ( a < 16 ) Serial << '0'; 73 | Serial << _HEX(a) << (a == aLast+16 || r == 0 ? " " : "* "); 74 | for ( int16_t c = 0; c < 16; c++ ) { 75 | if ( d[c] < 16 ) Serial << '0'; 76 | Serial << _HEX( d[c] ) << ( c == 7 ? " " : " " ); 77 | } 78 | Serial << endl; 79 | aLast = a; 80 | } 81 | for (int i=0; i<16; ++i) { 82 | last[i] = d[i]; 83 | } 84 | } 85 | } 86 | -------------------------------------------------------------------------------- /keywords.txt: -------------------------------------------------------------------------------- 1 | JC_EEPROM KEYWORD1 2 | begin KEYWORD2 3 | write KEYWORD2 4 | read KEYWORD2 5 | kbits_2 LITERAL1 6 | kbits_4 LITERAL1 7 | kbits_8 LITERAL1 8 | kbits_16 LITERAL1 9 | kbits_32 LITERAL1 10 | kbits_64 LITERAL1 11 | kbits_128 LITERAL1 12 | kbits_256 LITERAL1 13 | kbits_512 LITERAL1 14 | kbits_1024 LITERAL1 15 | kbits_2048 LITERAL1 16 | twiClock100kHz LITERAL1 17 | twiClock400kHz LITERAL1 18 | EEPROM_ADDR_ERR LITERAL1 19 | -------------------------------------------------------------------------------- /library.properties: -------------------------------------------------------------------------------- 1 | name=JC_EEPROM 2 | version=1.0.9 3 | author=Jack Christensen 4 | maintainer=Jack Christensen 5 | sentence=Arduino library to support external I2C EEPROMs. 6 | paragraph=Copyright (C) 2022-2023 by Jack Christensen and licensed under GNU GPL v3.0. 7 | category=Data Storage 8 | url=https://github.com/JChristensen/JC_EEPROM 9 | architectures=* 10 | -------------------------------------------------------------------------------- /src/JC_EEPROM.cpp: -------------------------------------------------------------------------------- 1 | // Arduino JC_EEPROM Library 2 | // https://github.com/JChristensen/JC_EEPROM 3 | // Copyright (C) 2022 by Jack Christensen and licensed under 4 | // GNU GPL v3.0, https://www.gnu.org/licenses/gpl.html 5 | // 6 | // Arduino library to support external I2C EEPROMs. 7 | 8 | #include 9 | #include 10 | 11 | // Constructor. 12 | // - deviceCapacity is the capacity of a single EEPROM device in 13 | // kilobits (kb) and should be one of the values defined in the 14 | // eeprom_size_t enumeration in the extEEPROM.h file. (Most 15 | // EEPROM manufacturers use kbits in their part numbers.) 16 | // - nDevice is the number of EEPROM devices on the I2C bus (all must 17 | // be identical). 18 | // - pageSize is the EEPROM's page size in bytes. 19 | // - eepromAddr is the EEPROM's I2C address and defaults to 0x50 which is common. 20 | JC_EEPROM::JC_EEPROM(eeprom_size_t deviceCapacity, uint8_t nDevice, uint16_t pageSize, uint8_t eepromAddr) 21 | { 22 | m_dvcCapacity = deviceCapacity; 23 | m_nDevice = nDevice; 24 | m_pageSize = pageSize; 25 | m_eepromAddr = eepromAddr; 26 | m_totalCapacity = m_nDevice * m_dvcCapacity * 1024UL / 8; 27 | m_nAddrBytes = deviceCapacity > kbits_16 ? 2 : 1; // two address bytes needed for eeproms > 16kbits 28 | 29 | // determine the bitshift needed to isolate the chip select bits from 30 | // the address to put into the control byte 31 | uint16_t kb = m_dvcCapacity; 32 | if ( kb <= kbits_16 ) m_csShift = 8; 33 | else if ( kb >= kbits_512 ) m_csShift = 16; 34 | else { 35 | kb >>= 6; 36 | m_csShift = 12; 37 | while ( kb >= 1 ) { 38 | ++m_csShift; 39 | kb >>= 1; 40 | } 41 | } 42 | } 43 | 44 | // initialize the I2C bus and do a dummy write (no data sent) 45 | // to the device so that the caller can determine whether it is responding. 46 | // when using a 400kHz bus speed and there are multiple I2C devices on the 47 | // bus (other than EEPROM), call extEEPROM::begin() after any initialization 48 | // calls for the other devices to ensure the intended I2C clock speed is set. 49 | uint8_t JC_EEPROM::begin(twiClockFreq_t twiFreq) 50 | { 51 | Wire.begin(); 52 | Wire.setClock(twiFreq); 53 | Wire.beginTransmission(m_eepromAddr); 54 | if (m_nAddrBytes == 2) Wire.write(0); // high addr byte 55 | Wire.write(0); // low addr byte 56 | return Wire.endTransmission(); 57 | } 58 | 59 | // Write bytes to external EEPROM. 60 | // If the I/O would extend past the top of the EEPROM address space, 61 | // a status of EEPROM_ADDR_ERR is returned. For I2C errors, the status 62 | // from the Arduino Wire library is passed back through to the caller. 63 | uint8_t JC_EEPROM::write(uint32_t addr, uint8_t* values, uint16_t nBytes) 64 | { 65 | if (addr + nBytes > m_totalCapacity) { // will this write go past the top of the EEPROM? 66 | return EEPROM_ADDR_ERR; // yes, tell the caller 67 | } 68 | 69 | uint8_t txStatus {0}; // transmit status 70 | while (nBytes > 0) { 71 | uint16_t nPage = m_pageSize - ( addr & (m_pageSize - 1) ); 72 | // find min(nBytes, nPage, BUFFER_LENGTH) -- BUFFER_LENGTH is defined in the Wire library. 73 | uint16_t nWrite = nBytes < nPage ? nBytes : nPage; 74 | nWrite = BUFFER_LENGTH - m_nAddrBytes < nWrite ? BUFFER_LENGTH - m_nAddrBytes : nWrite; 75 | uint8_t ctrlByte = m_eepromAddr | static_cast(addr >> m_csShift); 76 | Wire.beginTransmission(ctrlByte); 77 | if (m_nAddrBytes == 2) Wire.write(static_cast(addr >> 8)); // high addr byte 78 | Wire.write(static_cast(addr)); // low addr byte 79 | Wire.write(values, static_cast(nWrite)); 80 | txStatus = Wire.endTransmission(); 81 | if (txStatus != 0) return txStatus; 82 | 83 | // wait up to 50ms for the write to complete 84 | for (uint8_t i=100; i; --i) { 85 | delayMicroseconds(500); // no point in waiting too fast 86 | Wire.beginTransmission(ctrlByte); 87 | if (m_nAddrBytes == 2) Wire.write(0); // high addr byte 88 | Wire.write(0); // low addr byte 89 | txStatus = Wire.endTransmission(); 90 | if (txStatus == 0) break; 91 | } 92 | if (txStatus != 0) return txStatus; 93 | 94 | addr += nWrite; // increment the EEPROM address 95 | values += nWrite; // increment the input data pointer 96 | nBytes -= nWrite; // decrement the number of bytes left to write 97 | } 98 | return txStatus; 99 | } 100 | 101 | // Read bytes from external EEPROM. 102 | // If the I/O would extend past the top of the EEPROM address space, 103 | // a status of EEPROM_ADDR_ERR is returned. For I2C errors, the status 104 | // from the Arduino Wire library is passed back through to the caller. 105 | uint8_t JC_EEPROM::read(uint32_t addr, uint8_t* values, uint16_t nBytes) 106 | { 107 | if (addr + nBytes > m_totalCapacity) { // will this read take us past the top of the EEPROM? 108 | return EEPROM_ADDR_ERR; // yes, tell the caller 109 | } 110 | 111 | while (nBytes > 0) { 112 | uint16_t nPage = m_pageSize - ( addr & (m_pageSize - 1) ); 113 | uint16_t nRead = nBytes < nPage ? nBytes : nPage; 114 | nRead = BUFFER_LENGTH < nRead ? BUFFER_LENGTH : nRead; 115 | uint8_t ctrlByte = m_eepromAddr | static_cast(addr >> m_csShift); 116 | Wire.beginTransmission(ctrlByte); 117 | if (m_nAddrBytes == 2) Wire.write(static_cast(addr >> 8)); // high addr byte 118 | Wire.write(static_cast(addr)); // low addr byte 119 | uint8_t rxStatus = Wire.endTransmission(); 120 | if (rxStatus != 0) return rxStatus; // read error 121 | 122 | Wire.requestFrom(ctrlByte, static_cast(nRead)); 123 | for (byte i=0; i 16k bits). 33 | // 2. The three least-significant bits in the control byte (excluding the R/W 34 | // bit) comprise the three most-significant bits for the entire address 35 | // space, i.e. all chips on the bus. As such, these may be chip-select 36 | // bits or block-select bits (for individual chips that have an internal 37 | // block organization), or a combination of both (in which case the 38 | // block-select bits must be of lesser significance than the chip-select 39 | // bits). 40 | // 3. Regardless of the number of bits needed to address the entire address 41 | // space, the three most-significant bits always go in the control byte. 42 | // Depending on EEPROM device size, this may result in one or more of the 43 | // most significant bits in the I2C address bytes being unused (or "don't 44 | // care"). 45 | // 4. An EEPROM contains an integral number of pages. 46 | // 47 | // To use the extEEPROM library, the Arduino Wire library must also 48 | // be included. 49 | // 50 | // Jack Christensen 23Mar2013 v1 51 | // 29Mar2013 v2 - Updated to span page boundaries (and therefore also 52 | // device boundaries, assuming an integral number of pages per device) 53 | // 08Jul2014 v3 - Generalized for 2kb - 2Mb EEPROMs. 54 | // 11Jan2022 v1.0.0 - Rename to JC_EEPROM, conform to Arduino library standards. 55 | 56 | #ifndef JC_EEPROM_H_INCLUDED 57 | #define JC_EEPROM_H_INCLUDED 58 | 59 | #include 60 | #include 61 | 62 | // a horrible and limiting kludge for architectures that 63 | // do not define BUFFER_LENGTH 64 | #ifndef BUFFER_LENGTH 65 | #define BUFFER_LENGTH 32 66 | #endif 67 | 68 | class JC_EEPROM 69 | { 70 | public: 71 | // EEPROM size in kilobits. 72 | // EEPROM part numbers are usually designated in k-bits. 73 | enum eeprom_size_t { 74 | kbits_2 = 2, 75 | kbits_4 = 4, 76 | kbits_8 = 8, 77 | kbits_16 = 16, 78 | kbits_32 = 32, 79 | kbits_64 = 64, 80 | kbits_128 = 128, 81 | kbits_256 = 256, 82 | kbits_512 = 512, 83 | kbits_1024 = 1024, 84 | kbits_2048 = 2048 85 | }; 86 | 87 | // I2C clock frequencies 88 | enum twiClockFreq_t 89 | { twiClock100kHz = 100000, twiClock400kHz = 400000 }; 90 | 91 | // EEPROM addressing error, returned by write() or read() if 92 | // upper address bound is exceeded 93 | static const uint8_t EEPROM_ADDR_ERR {9}; 94 | 95 | JC_EEPROM(eeprom_size_t deviceCapacity, uint8_t nDevice, 96 | uint16_t pageSize, uint8_t eepromAddr = 0x50); 97 | uint8_t begin(twiClockFreq_t twiFreq = twiClock100kHz); 98 | uint8_t write(uint32_t addr, uint8_t* values, uint16_t nBytes); 99 | uint8_t write(uint32_t addr, uint8_t value); 100 | uint8_t read(uint32_t addr, uint8_t* values, uint16_t nBytes); 101 | int16_t read(uint32_t addr); 102 | uint8_t update(uint32_t addr, uint8_t value) 103 | {return (read(addr) == value) ? 0 : write(addr, &value, 1); } 104 | 105 | private: 106 | uint8_t m_eepromAddr; // eeprom i2c address 107 | uint16_t m_dvcCapacity; // capacity of one EEPROM device, in kbits 108 | uint8_t m_nDevice; // number of devices on the bus 109 | uint16_t m_pageSize; // page size in bytes 110 | uint8_t m_csShift; // number of bits to shift address for chip select bits in control byte 111 | uint16_t m_nAddrBytes; // number of address bytes (1 or 2) 112 | uint32_t m_totalCapacity; // capacity of all EEPROM devices on the bus, in bytes 113 | }; 114 | 115 | #endif 116 | --------------------------------------------------------------------------------