Browse Source

perf: filter mechanism in block move

legacy
Dnomd343 2 years ago
parent
commit
3739af1a1f
  1. 20
      src/core_demo.cc
  2. 2
      src/core_demo.h

20
src/core_demo.cc

@ -27,6 +27,7 @@ void move_1x1_demo(uint64_t code, int addr) {
cache_size = 1; cache_size = 1;
cache[0].code = code; cache[0].code = code;
cache[0].addr = addr; cache[0].addr = addr;
cache[0].filter = 0; // filter unset
int count = 0; int count = 0;
@ -34,6 +35,9 @@ void move_1x1_demo(uint64_t code, int addr) {
code = cache[count].code; code = cache[count].code;
addr = cache[count].addr; addr = cache[count].addr;
int filter = cache[count].filter;
++count; ++count;
uint64_t ret_code; uint64_t ret_code;
@ -41,33 +45,33 @@ void move_1x1_demo(uint64_t code, int addr) {
int next_addr; int next_addr;
/// try to move up /// try to move up
if (addr >= 4 * 3 && !(code >> (next_addr = addr + UP) & F_1x1)) { if (filter != UP && addr >= 4 * 3 && !(code >> (next_addr = addr + UP) & F_1x1)) {
ret_code = code & ~(F_1x1 << addr) | (C_1x1 << next_addr); ret_code = code & ~(F_1x1 << addr) | (C_1x1 << next_addr);
cache_t new_item = {ret_code, next_addr}; cache_t new_item = {ret_code, DOWN, next_addr};
cache_insert(new_item); cache_insert(new_item);
} }
/// try to move down /// try to move down
if (addr <= 15 * 3 && !(code >> (next_addr = addr + DOWN) & F_1x1)) { if (filter != DOWN && addr <= 15 * 3 && !(code >> (next_addr = addr + DOWN) & F_1x1)) {
ret_code = code & ~(F_1x1 << addr) | (C_1x1 << next_addr); ret_code = code & ~(F_1x1 << addr) | (C_1x1 << next_addr);
cache_t new_item = {ret_code, next_addr}; cache_t new_item = {ret_code, UP, next_addr};
cache_insert(new_item); cache_insert(new_item);
} }
/// try to move left /// try to move left
if ((addr & 0b11) != 0 && !(code >> (next_addr = addr + LEFT) & F_1x1)) { if (filter != LEFT && (addr & 0b11) != 0 && !(code >> (next_addr = addr + LEFT) & F_1x1)) {
ret_code = code & ~(F_1x1 << addr) | (C_1x1 << next_addr); ret_code = code & ~(F_1x1 << addr) | (C_1x1 << next_addr);
cache_t new_item = {ret_code, next_addr}; cache_t new_item = {ret_code, RIGHT, next_addr};
cache_insert(new_item); cache_insert(new_item);
} }
/// try to move right /// try to move right
if ((addr & 0x3) != 1 && !(code >> (next_addr = addr + RIGHT) & F_1x1)) { if (filter != RIGHT && (addr & 0x3) != 1 && !(code >> (next_addr = addr + RIGHT) & F_1x1)) {
ret_code = code & ~(F_1x1 << addr) | (C_1x1 << next_addr); ret_code = code & ~(F_1x1 << addr) | (C_1x1 << next_addr);
cache_t new_item = {ret_code, next_addr}; cache_t new_item = {ret_code, LEFT, next_addr};
cache_insert(new_item); cache_insert(new_item);
} }

2
src/core_demo.h

@ -12,7 +12,7 @@
struct cache_t { struct cache_t {
uint64_t code; // raw code uint64_t code; // raw code
// uint64_t mask; // only 000 or 111 // uint64_t mask; // only 000 or 111
// int filter; int filter;
int addr; int addr;
}; };

Loading…
Cancel
Save