This repository was archived by the owner on Jan 7, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy pathAddrSequence.cc
More file actions
652 lines (522 loc) · 13.9 KB
/
AddrSequence.cc
File metadata and controls
652 lines (522 loc) · 13.9 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
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
/*
* SPDX-License-Identifier: GPL-2.0
*
* Copyright (c) 2018 Intel Corporation
*
* Authors: Yao Yuan <yuan.yao@intel.com>
* Fengguang Wu <fengguang.wu@intel.com>
*/
#include <stdlib.h>
#include <iostream>
#include "AddrSequence.h"
#include "string.h"
using namespace std;
AddrSequence::AddrSequence()
{
addr_size = 0;
nr_walks = 0;
pageshift = 0;
pagesize = 0;
user_flags = 0;
//set this to froce alloc buffer when add cluster
buf_used_count = MAX_ITEM_COUNT;
clear_location_count();
}
AddrSequence::~AddrSequence()
{
clear();
}
void AddrSequence::clear()
{
addr_size = 0;
nr_walks = 0;
addr_clusters.clear();
free_all_buf();
reset_iterator(find_iter, 0);
#ifdef ADDR_SEQ_SELF_TEST
test_map.clear();
#endif
clear_location_count();
}
void AddrSequence::set_pageshift(int shift)
{
pageshift = shift;
pagesize = 1 << shift;
}
int AddrSequence::rewind()
{
reset_iterator(find_iter, 0);
++nr_walks;
last_cluster_end = 0;
clear_location_count();
return 0;
}
// just reset internal walk_iter and find_iter
int AddrSequence::prepare_update()
{
reset_iterator(find_iter, 0);
last_cluster_end = 0;
return 0;
}
int AddrSequence::inc_payload(unsigned long addr, int n)
{
int ret_value;
if (in_append_period())
ret_value = append_addr(addr, n);
else
ret_value = update_addr(addr, n, true);
return ret_value;
}
int AddrSequence::set_payload(unsigned long addr, int n)
{
// set the payload to a direct val is NOT
// allowed in append period
if (in_append_period())
return -1;
return update_addr(addr, n, false);
}
int AddrSequence::update_nodeid(unsigned long addr, int8_t nid,
int8_t location)
{
int rc = 0;
unsigned long next_addr;
uint8_t unused_payload;
int8_t unused_nid;
// only allow to update nid and location
// in append stage
if (!in_append_period())
return -1;
for (;;) {
rc = do_walk(find_iter, next_addr,
unused_payload, unused_nid);
if (!do_walk_continue(rc))
break;
if (next_addr == addr) {
do_walk_update_nid(find_iter, addr, nid, location);
return 0;
} else if (next_addr > addr) {
return ADDR_NOT_FOUND;
}
do_walk_move_next(find_iter);
}
//in update stage, the addr not exist is a graceful error
//so we change to return positive ADDR_NOT_FOUND
if (rc == END_OF_SEQUENCE)
rc = ADDR_NOT_FOUND;
return rc;
}
int AddrSequence::update_addr(unsigned long addr, int n,
bool is_inc_payload)
{
int rc = 0;
unsigned long next_addr;
uint8_t unused_payload;
int8_t unused_nid;
for (;;) {
rc = do_walk(find_iter, next_addr, unused_payload, unused_nid);
if (!do_walk_continue(rc))
break;
if (next_addr == addr) {
do_walk_update_payload(find_iter, addr, n, is_inc_payload);
return 0;
} else if (next_addr > addr) {
return ADDR_NOT_FOUND;
}
do_walk_move_next(find_iter);
}
//in update stage, the addr not exist is a graceful error
//so we change to return positive ADDR_NOT_FOUND
if (rc == END_OF_SEQUENCE)
rc = ADDR_NOT_FOUND;
return rc;
}
int AddrSequence::smooth_payloads()
{
for (auto &ac: addr_clusters)
{
int runavg;
// AddrCluster& ac = kv;
for (int i = 0; i < ac.size; ++i)
{
if (!i || ac.deltas[i].delta > 3)
runavg = ac.deltas[i].payload;
else {
runavg = (7 + runavg * 7 + ac.deltas[i].payload) / 8;
ac.deltas[i].payload = runavg;
}
}
}
return 0;
}
bool AddrSequence::prepare_get()
{
bool is_empty = addr_clusters.empty();
if (!is_empty)
reset_iterator(walk_iter, 0);
return !is_empty;
}
int AddrSequence::get_first(unsigned long& addr, uint8_t& payload, int8_t& nid)
{
if (!prepare_get())
return -1;
return get_next(addr, payload, nid);
}
int AddrSequence::get_next(unsigned long& addr, uint8_t& payload, int8_t& nid)
{
int rc;
rc = do_walk(walk_iter, addr, payload, nid);
if (do_walk_continue(rc))
do_walk_move_next(walk_iter);
return rc;
}
int AddrSequence::do_walk(walk_iterator& iter,
unsigned long& addr, uint8_t& payload, int8_t& nid)
{
if (iter.cluster_iter == iter.cluster_iter_end)
return END_OF_SEQUENCE;
unsigned long delta_sum;
delta_sum = iter.delta_sum + iter.cur_delta_ptr[iter.delta_index].delta;
addr = iter.cur_cluster_ptr->start + (delta_sum << pageshift);
payload = iter.cur_delta_ptr[iter.delta_index].payload;
nid = iter.cur_delta_ptr[iter.delta_index].nid;
return 0;
}
void AddrSequence::do_walk_move_next(walk_iterator& iter)
{
iter.delta_sum += iter.cur_delta_ptr[iter.delta_index].delta;
++iter.delta_index;
if (iter.delta_index >= iter.cur_cluster_ptr->size) {
iter.delta_index = 0;
iter.delta_sum = 0;
++iter.cluster_iter;
if (iter.cluster_iter < iter.cluster_iter_end) {
do_walk_update_current_ptr(iter);
}
}
}
void AddrSequence::do_walk_update_payload(walk_iterator& iter,
unsigned addr, uint8_t payload,
bool is_inc_payload)
{
if (is_inc_payload) {
if (!payload)
return;
++iter.cur_delta_ptr[iter.delta_index].payload;
} else {
iter.cur_delta_ptr[iter.delta_index].payload = payload;
}
update_addr_location_count(iter);
}
void AddrSequence::do_walk_update_nid(walk_iterator& iter,
unsigned addr,
int8_t nid, int8_t location)
{
iter.cur_delta_ptr[iter.delta_index].nid = nid;
iter.cur_delta_ptr[iter.delta_index].location = location;
update_addr_location_count(iter);
}
int AddrSequence::append_addr(unsigned long addr, int n)
{
if (addr_clusters.empty())
return create_cluster(addr, n);
// the addr in append stage should grow from low to high
// and never duplicated or rollback, so here we
// return directly
if (addr <= last_cluster_end) {
printf("ignore overlapped addr %lx <= %lx\n", addr, last_cluster_end);
return IGNORE_DUPLICATED_ADDR;
}
AddrCluster& cluster = addr_clusters.back();
if (can_merge_into_cluster(cluster, addr))
return save_into_cluster(cluster, addr, n);
else
return create_cluster(addr, n);
}
int AddrSequence::create_cluster(unsigned long addr, int n)
{
void* new_buf_ptr;
int rc;
rc = get_free_buffer(&new_buf_ptr);
if (rc < 0)
return rc;
try {
addr_clusters.push_back(new_cluster(addr, new_buf_ptr));
} catch(std::bad_alloc& e) {
return -ENOMEM;
}
//a new cluster created, so update this
//new cluster's end = strat of cause
last_cluster_end = addr;
//set the find iterator because we added new cluster
reset_iterator(find_iter, addr_clusters.size() - 1);
return save_into_cluster(addr_clusters.back(), addr, n);
}
AddrCluster AddrSequence::new_cluster(unsigned long addr, void* buffer)
{
AddrCluster new_item;
new_item.start = addr;
new_item.size = 0;
new_item.deltas = (DeltaPayload*)buffer;
return new_item;
}
int AddrSequence::get_free_buffer(void** free_ptr)
{
int rc = 0;
if (is_buffer_full())
rc = allocate_buf();
if (rc >= 0) {
DeltaPayload* ptr;
ptr = buf_pool.back();
*free_ptr = &ptr[buf_used_count];
}
return rc;
}
int AddrSequence::save_into_cluster(AddrCluster& cluster,
unsigned long addr, int n)
{
unsigned long delta = (addr - last_cluster_end) >> pageshift;
int index = cluster.size;
cluster.deltas[index].delta = (uint8_t)delta;
cluster.deltas[index].payload = n;
cluster.deltas[index].nid = -1;
// default to DRAM, will be updated in update_nodeid() later
cluster.deltas[index].location = LOC_DRAM;
++cluster.size;
++buf_used_count;
++addr_size;
//becuase cluster grow at end always
last_cluster_end = addr;
return 0;
}
bool AddrSequence::can_merge_into_cluster(AddrCluster& cluster, unsigned long addr)
{
unsigned long addr_delta = addr - last_cluster_end;
unsigned long delta_distance = addr_delta >> pageshift;
int is_not_align = addr_delta & (pagesize - 1);
if (delta_distance > MAX_DELTA_DIST
|| is_buffer_full()
|| is_not_align)
return false;
return true;
}
int AddrSequence::allocate_buf()
{
DeltaPayload* new_buf_ptr = NULL;
try {
new_buf_ptr = buf_allocator.allocate(MAX_ITEM_COUNT);
//new free buffer saved to back of pool
//users will always use back() to get it later
buf_pool.push_back(new_buf_ptr);
//we already have a new buf in pool,
//so let's reset the buf_used_count here
buf_used_count = 0;
} catch(std::bad_alloc& e) {
if (new_buf_ptr)
buf_allocator.deallocate(new_buf_ptr, MAX_ITEM_COUNT);
return -ENOMEM;
}
return 0;
}
void AddrSequence::free_all_buf()
{
for (auto& i : buf_pool)
buf_allocator.deallocate(i, MAX_ITEM_COUNT);
buf_pool.clear();
buf_used_count = MAX_ITEM_COUNT;
}
//self-testing
#ifdef ADDR_SEQ_SELF_TEST
int AddrSequence::do_self_test_compare(unsigned long pagesize, bool is_perf)
{
unsigned long addr = 0;
uint8_t payload = 0;
int8_t nid;
cout << "addr_clusters.size = " << addr_clusters.size() << endl;
cout << "buf_pool.size = " << buf_pool.size() << endl;
if (!prepare_get()) {
cout << "empty AddrSequence" << endl;
return -1;
}
if (is_perf) {
while (!get_next(addr, payload, nid))
;
return 0;
}
for (auto& kv: test_map)
{
int err = get_next(addr, payload, nid);
if (err < 0)
return err;
if (addr != kv.first) {
fprintf(stderr, "addr mismatch: %lx != %lx\n page increment=%lx",
addr, kv.first, pagesize);
return -1;
}
if (payload != kv.second) {
fprintf(stderr, "payload mismatch: Addr = %lx, %d != %d page increment=%lx\n",
kv.first, (int)payload, (int)kv.second,
pagesize);
return -2;
}
}
return 0;
}
int AddrSequence::do_self_test_walk(unsigned long pagesize, bool is_perf)
{
unsigned long addr = 0x100000;
unsigned long delta;
bool is_first_walk = test_map.empty();
rewind();
for (int i = 0; i < 1<<20; ++i)
{
delta = is_perf ? 1 : rand() & 0xff;
addr += delta * pagesize;
int val = is_perf ? 1 : (rand() & 1);
int err = inc_payload(addr, val);
if (err < 0) {
fprintf(stderr, "inc_payload error %d\n pagesize increment=%lx", err, pagesize);
fprintf(stderr, "nr_walks=%d i=%d addr=%lx val=%d\n", nr_walks, i, addr, val);
return err;
}
if (is_perf)
continue;
/*
the addr may duplicated beacsue rand() may return 0
because we ignore this, so we only put non-duplicated addr
into test_map
*/
if (is_first_walk) {
if (!err)
test_map[addr] = val;
} else if (test_map.find(addr) != test_map.end()) {
/*
for the nr_walk >=2 case, update stage, we do
change payload(base on val) if addr already exists,
so change here to same as inc_payload() behavior.
*/
if (val)
++test_map[addr];
}
}
return 0;
}
int AddrSequence::self_test()
{
int ret;
clear();
set_pageshift(12);
ret = do_self_test(4096, 30, false);
if (ret)
return ret;
clear();
set_pageshift(21);
ret = do_self_test(1<<21, 30, false);
if (ret)
return ret;
clear();
set_pageshift(12);
ret = do_self_test(4096, rand() & 127, false);
if (ret)
return ret;
clear();
set_pageshift(12);
ret = do_self_test(4096, rand() & 127, false);
if (ret)
return ret;
clear();
set_pageshift(21);
ret = do_self_test(1<<21, 30, false);
return ret;
}
int AddrSequence::do_self_test(unsigned long pagesize,
int max_loop,
bool is_perf)
{
std::map<unsigned long, uint8_t> am;
int err;
//max_walks = 30; //rand() & 0xff;
for (int i = 0; i < max_loop; ++i)
{
err = do_self_test_walk(pagesize, is_perf);
if (err < 0)
return err;
}
err = do_self_test_compare(pagesize, is_perf);
if (err < 0)
return err;
err = do_self_test_compare(pagesize, is_perf);
return err;
}
int test_static()
{
AddrSequence as;
int rc;
unsigned long addr;
uint8_t payload;
int8_t nid;
as.set_pageshift(12);
rc = as.inc_payload(0x1000, 0);
rc = as.inc_payload(0x3000, 0);
rc = as.inc_payload(0x5000, 0);
rc = as.inc_payload(0x8000, 0);
rc = as.inc_payload(0x1000 + 4096 * 255, 1);
rc = as.inc_payload(0x1000 + 4096 * 256, 1);
as.clear();
as.rewind();
as.set_pageshift(12);
rc = as.inc_payload(0x11000, 0);
rc = as.inc_payload(0x13000, 0);
rc = as.inc_payload(0x15000, 0);
rc = as.inc_payload(0x18000, 0);
rc = as.inc_payload(0x21000, 0);
rc = as.inc_payload(0x23000, 0);
rc = as.inc_payload(0x25000, 0);
rc = as.inc_payload(0x28000, 0);
rc = as.inc_payload(0x30000, 0);
rc = as.inc_payload(0x32000, 0);
as.rewind();
rc = as.inc_payload(0x11000, 1);
rc = as.inc_payload(0x13000, 0);
rc = as.inc_payload(0x15000, 1);
rc = as.inc_payload(0x18000, 0);
rc = as.inc_payload(0x21000, 1);
rc = as.inc_payload(0x23000, 0);
rc = as.inc_payload(0x25000, 1);
rc = as.inc_payload(0x28000, 1);
rc = as.inc_payload(0x30000, 0);
rc = as.inc_payload(0x32000, 1);
rc = as.inc_payload(0x40000, 1); //should not update
rc = as.inc_payload(0x40000, 1); //should not update
rc = as.get_first(addr, payload, nid);
while (!rc) {
printf("addr = %lx, payload = %u\n", addr, payload);
rc = as.get_next(addr, payload, nid);
}
as.clear();
as.clear();
as.set_pageshift(12);
rc = as.do_self_test(1, 12, true);
if (rc)
goto out;
as.clear();
as.set_pageshift(12);
rc = as.do_self_test(4096, 17, true);
if (rc)
goto out;
as.clear();
as.set_pageshift(21);
rc = as.do_self_test(1<<21, 30, true);
out:
return rc;
}
int main(int argc, char* argv[])
{
if (argc >= 2) {
if (!strcmp(argv[1], "check")) {
AddrSequence as;
return as.self_test();
}
}
return test_static();
}
#endif