Repository navigation
Expand file tree
/
Copy pathMemCache.cpp
More file actions
520 lines (434 loc) · 13.6 KB
/
Copy pathMemCache.cpp
File metadata and controls
520 lines (434 loc) · 13.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
/*
* MemCache.cpp
*
Copyright (c) 2013 Collin Kidder, Michael Neuweiler, Charles Galpin
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include "MemCache.h"
MemCache memCache;
MemCache::MemCache()
{
}
MemCache::~MemCache()
{
}
/*
* Initialize the memory cache (note, this is only a TickListener, not a device !)
*/
void MemCache::setup()
{
tickHandler.detach(this);
Logger::info("add MemCache (id: %#x, %#x)", MEMCACHE, &memCache);
Wire.begin();
for (U8 c = 0; c < NUM_CACHED_PAGES; c++) {
pages[c].address = 0xFFFFFF; //maximum number. This is way over what our chip will actually support so it signals unused
pages[c].age = 0;
pages[c].dirty = false;
}
//WriteTimer = 0;
//digital pin 18 is connected to the write protect function of the EEPROM. It is active high so set it low to enable writes
pinMode(CFG_EEPROM_WRITE_PROTECT, OUTPUT);
digitalWrite(CFG_EEPROM_WRITE_PROTECT, LOW);
tickHandler.attach(this, CFG_TICK_INTERVAL_MEM_CACHE);
}
/*
* Handle aging of dirty pages and flushing of aged out dirty pages
*/
void MemCache::handleTick()
{
U8 c;
cache_age();
for (c = 0; c < NUM_CACHED_PAGES; c++) {
if ((pages[c].age == MAX_AGE) && (pages[c].dirty)) {
FlushPage(c);
return;
}
}
}
/*
* Flush the first dirty page to the EEPROM.
*/
void MemCache::FlushSinglePage()
{
U8 c;
for (c = 0; c < NUM_CACHED_PAGES; c++) {
if (pages[c].dirty) {
cache_writepage(c);
pages[c].dirty = false;
pages[c].age = 0; //freshly flushed!
return;
}
}
}
/*
* Flush every dirty page.
* It will block for 10ms per page so maybe things will be blocked for a long, long time
*
* NOTE: DO NOT USE THIS FUNCTION UNLESS YOU CAN ACCEPT THAT!
*/
void MemCache::FlushAllPages()
{
U8 c;
for (c = 0; c < NUM_CACHED_PAGES; c++) {
if (pages[c].dirty) { //found a dirty page so flush it
cache_writepage(c);
pages[c].dirty = false;
delay(10); //10ms is longest it would take to write a page according to datasheet
}
}
}
/*
* Flush a given page by the page ID.
* This is NOT by address so act accordingly.
*/
void MemCache::FlushPage(uint8_t page)
{
if (pages[page].dirty) {
cache_writepage(page);
pages[page].dirty = false;
pages[page].age = 0; //freshly flushed!
}
}
/*
* Like FlushPage but also marks the page invalid (unused).
* So if another read request comes it it'll have to be re-read from EEPROM
*/
void MemCache::InvalidatePage(uint8_t page)
{
if (page > NUM_CACHED_PAGES - 1) {
return; //invalid page, buddy!
}
if (pages[page].dirty) {
cache_writepage(page);
}
pages[page].dirty = false;
pages[page].address = 0xFFFFFF;
pages[page].age = 0;
}
/*
* Mark a given page unused given an address within that page.
* Will write the page out if it was dirty.
*/
void MemCache::InvalidateAddress(uint32_t address)
{
uint32_t addr;
uint8_t c;
addr = address >> 8; //kick it down to the page we're talking about
c = cache_hit(addr);
if (c != 0xFF) {
InvalidatePage(c);
}
}
/*
* Mark all page cache entries unused (go back to clean slate).
* It will try to write any dirty pages so be prepared to wait.
*/
void MemCache::InvalidateAll()
{
uint8_t c;
for (c = 0; c < NUM_CACHED_PAGES; c++) {
InvalidatePage(c);
}
}
/*
* Cause a given page to be fully aged which will cause it to be written at the next opportunity
*/
void MemCache::AgeFullyPage(uint8_t page)
{
if (page < NUM_CACHED_PAGES) { //if we did indeed have that page in cache
pages[page].age = MAX_AGE;
}
}
/*
* Cause the page containing the given address to be fully aged and thus written as soon as possible.
*/
void MemCache::AgeFullyAddress(uint32_t address)
{
uint8_t thisCache;
uint32_t page_addr;
page_addr = address >> 8; //kick it down to the page we're talking about
thisCache = cache_hit(page_addr);
if (thisCache != 0xFF) { //if we did indeed have that page in cache
pages[thisCache].age = MAX_AGE;
}
}
/*
* Write data into the memory cache instead of direct EEPROM writes
*/
boolean MemCache::Write(uint32_t address, uint8_t valu)
{
uint32_t addr;
uint8_t c;
addr = address >> 8; //kick it down to the page we're talking about
c = cache_hit(addr);
if (c == 0xFF) {
c = cache_findpage(); //try to free up a page
if (c != 0xFF) {
c = cache_readpage(addr); //and populate it with the existing data
}
}
if (c != 0xFF) {
pages[c].data[(uint16_t)(address & 0x00FF)] = valu;
pages[c].dirty = true;
pages[c].address = addr; //set this in case we actually are setting up a new cache page
return true;
}
return false;
}
/*
* Write data into the memory cache instead of direct EEPROM writes
*/
boolean MemCache::Write(uint32_t address, uint16_t valu)
{
boolean result;
result = Write(address, &valu, 2);
return result;
}
/*
* Write data into the memory cache instead of direct EEPROM writes
*/
boolean MemCache::Write(uint32_t address, uint32_t valu)
{
boolean result;
result = Write(address, &valu, 4);
return result;
}
/*
* Write data into the memory cache instead of direct EEPROM writes
*/
boolean MemCache::Write(uint32_t address, void* data, uint16_t len)
{
uint32_t addr;
uint8_t c;
uint16_t count;
for (count = 0; count < len; count++) {
addr = (address + count) >> 8; //kick it down to the page we're talking about
c = cache_hit(addr);
if (c == 0xFF) {
c = cache_findpage(); //try to find a page that either isn't loaded or isn't dirty
if (c != 0xFF) {
c = cache_readpage(addr); //and populate it with the existing data
}
}
if (c != 0xFF) { //could we find a suitable cache page to write to?
pages[c].data[(uint16_t)((address + count) & 0x00FF)] = * (uint8_t *)(data + count);
pages[c].dirty = true;
pages[c].address = addr; //set this in case we actually are setting up a new cache page
} else {
break;
}
}
if (c != 0xFF) {
return true; //all ok!
}
return false;
}
/*
* Read a value from the cache.
* If not available in the cache, the EEPROM will be read.
*/
boolean MemCache::Read(uint32_t address, uint8_t* valu)
{
uint32_t addr;
uint8_t c;
addr = address >> 8; //kick it down to the page we're talking about
c = cache_hit(addr);
if (c == 0xFF) { //page isn't cached. Search the cache, potentially dump a page and bring this one in
c = cache_readpage(addr);
}
if (c != 0xFF) {
*valu = pages[c].data[(uint16_t)(address & 0x00FF)];
if (!pages[c].dirty) {
pages[c].age = 0; //reset age since we just used it
}
return true; //all ok!
} else {
return false;
}
}
/*
* Read a value from the cache.
* If not available in the cache, the EEPROM will be read.
*/
boolean MemCache::Read(uint32_t address, uint16_t* valu)
{
boolean result;
result = Read(address, valu, 2);
return result;
}
/*
* Read a value from the cache.
* If not available in the cache, the EEPROM will be read.
*/
boolean MemCache::Read(uint32_t address, uint32_t* valu)
{
boolean result;
result = Read(address, valu, 4);
return result;
}
/*
* Read a value from the cache.
* If not available in the cache, the EEPROM will be read.
*/
boolean MemCache::Read(uint32_t address, void* data, uint16_t len)
{
uint32_t addr;
uint8_t c;
uint16_t count;
for (count = 0; count < len; count++) {
addr = (address + count) >> 8;
c = cache_hit(addr);
if (c == 0xFF) { //page isn't cached. Search the cache, potentially dump a page and bring this one in
c = cache_readpage(addr);
}
if (c != 0xFF) {
* (uint8_t *)(data + count) = pages[c].data[(uint16_t)((address + count) & 0x00FF)];
if (!pages[c].dirty) {
pages[c].age = 0; //reset age since we just used it
}
} else {
break; //bust the for loop if we run into trouble
}
}
if (c != 0xFF) {
return true; //all ok!
}
return false;
}
/*
* Find page number of an address (if present, return 0xFF otherwise)
*/
uint8_t MemCache::cache_hit(uint32_t address)
{
uint8_t c;
for (c = 0; c < NUM_CACHED_PAGES; c++) {
if (pages[c].address == address) {
return c;
}
}
return 0xFF;
}
/*
* Increase the age of all cached pages
*/
void MemCache::cache_age()
{
uint8_t c;
for (c = 0; c < NUM_CACHED_PAGES; c++) {
if (pages[c].age < MAX_AGE) {
pages[c].age++;
}
}
}
/*
* Try to find an empty page or one that can be removed from cache
*/
uint8_t MemCache::cache_findpage()
{
uint8_t c;
uint8_t old_c, old_v;
for (c = 0; c < NUM_CACHED_PAGES; c++) {
if (pages[c].address == 0xFFFFFF) { //found an empty cache page so populate it and return its number
pages[c].age = 0;
pages[c].dirty = false;
return c;
}
}
//if we got here then there are no free pages so scan to find the oldest one which isn't dirty
old_c = 0xFF;
old_v = 0;
for (c = 0; c < NUM_CACHED_PAGES; c++) {
if (!pages[c].dirty && pages[c].age >= old_v) {
old_c = c;
old_v = pages[c].age;
}
}
if (old_c == 0xFF) { //no pages were not dirty - try to free one up
FlushSinglePage(); //try to free up a page
//now try to find the free page (if one was freed)
old_v = 0;
for (c = 0; c < NUM_CACHED_PAGES; c++) {
if (!pages[c].dirty && pages[c].age >= old_v) {
old_c = c;
old_v = pages[c].age;
}
}
if (old_c == 0xFF) {
return 0xFF; //if nothing worked then give up
}
}
//If we got to this point then we have a page to use
pages[old_c].age = 0;
pages[old_c].dirty = false;
pages[old_c].address = 0xFFFFFF; //mark it unused
return old_c;
}
/*
* Find the page of the cache and read data directly from the EEPROM into it.
*/
uint8_t MemCache::cache_readpage(uint32_t addr)
{
uint16_t c, d, e;
uint32_t address = addr << 8;
uint8_t buffer[3];
uint8_t i2c_id;
c = cache_findpage();
if (c != 0xFF) {
buffer[0] = ((address & 0xFF00) >> 8);
//buffer[1] = (address & 0x00FF);
buffer[1] = 0; //the pages are 256 bytes so the start of a page is always 00 for the LSB
i2c_id = 0b01010000 + ((address >> 16) & 0x03); //10100 is the chip ID then the two upper bits of the address
Wire.beginTransmission(i2c_id);
Wire.write(buffer, 2);
Wire.endTransmission(false); //do NOT generate stop
//delayMicroseconds(50); //give TWI some time to send and chip some time to get page
Wire.requestFrom(i2c_id, 256); //this will generate stop though.
for (e = 0; e < 256; e++) {
if (Wire.available()) {
d = Wire.read(); // receive a byte as character
pages[c].data[e] = d;
}
}
pages[c].address = addr;
pages[c].age = 0;
pages[c].dirty = false;
}
return c;
}
/*
* Write a page from the memory cache directly to the EEPROM
*/
boolean MemCache::cache_writepage(uint8_t page)
{
uint16_t d;
uint32_t addr;
uint8_t buffer[258];
uint8_t i2c_id;
addr = pages[page].address << 8;
buffer[0] = ((addr & 0xFF00) >> 8);
//buffer[1] = (addr & 0x00FF);
buffer[1] = 0; //pages are 256 bytes so LSB is always 0 for the start of a page
i2c_id = 0b01010000 + ((addr >> 16) & 0x03); //10100 is the chip ID then the two upper bits of the address
for (d = 0; d < 256; d++) {
buffer[d + 2] = pages[page].data[d];
}
Wire.beginTransmission(i2c_id);
Wire.write(buffer, 258);
Wire.endTransmission(true);
return true;
}