fumiama/simple-protobuf
1
0
Fork 0
mirror of https://github.com/fumiama/simple-protobuf.git synced 2026-06-26 22:30:24 +08:00
Code Activity

规范化代码

Browse Source
This commit is contained in:
fumiama
2021-05-17 20:30:18 +08:00
parent db1b95a42e
commit 234e414be2
3 changed files with 32 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
CMakeLists.txt
View File

@@ -8,5 +8,5 @@ if (${isBigEndian})
endif() endif()
add_library(spb SHARED protobuf.c) add_library(spb SHARED protobuf.c)
add_executable(test test.c) add_executable(t test.c)
target_link_libraries(test spb) target_link_libraries(t spb)

29
protobuf.c
View File

@@ -79,4 +79,31 @@ int set_pb(FILE* fp, uint8_t* items_type, uint64_t struct_len, void* target) {
fwrite(this, data_len, 1, fp); fwrite(this, data_len, 1, fp);
} }
return i; return i;
} }
uint8_t first_set(uint64_t n) {
uint8_t i = 0;
while(!(n & 1)) {
n >>= 1;
i++;
}
return i;
}
void align_struct(uint8_t* items_type, uint64_t items_cnt, uint64_t struct_size) {
uint64_t sum = 0;
uint8_t min = 255;
for(uint64_t i = 0; i < items_cnt; i++) {
sum += 1u << items_type[i];
if(min > items_type[i]) min = items_type[i];
}
while(sum < struct_size) {
uint8_t new_min = 255;
sum = 0;
for(uint64_t i = 0; i < items_cnt; i++) {
if(items_type[i] == min) items_type[i]++;
if(new_min > items_type[i]) new_min = items_type[i];
sum += 1u << items_type[i];
}
}
}

30
simple_protobuf.h
View File

@@ -11,33 +11,7 @@ typedef struct SIMPLE_PB SIMPLE_PB;
SIMPLE_PB* get_pb(FILE* fp); SIMPLE_PB* get_pb(FILE* fp);
int set_pb(FILE* fp, uint8_t* items_type, uint64_t struct_len, void* target); int set_pb(FILE* fp, uint8_t* items_type, uint64_t struct_len, void* target);
uint8_t first_set(uint64_t n);
uint8_t first_set(uint64_t n) { void align_struct(uint8_t* items_type, uint64_t items_cnt, uint64_t struct_size);
uint8_t i = 0;
while(!(n & 1)) {
n >>= 1;
i++;
}
return i;
}
void align_struct(uint8_t* items_type, uint64_t items_cnt, uint64_t struct_size) {
uint64_t sum = 0;
uint64_t min_cnt = 0;
uint8_t min = 255;
for(uint64_t i = 0; i < items_cnt; i++) {
sum += 1u << items_type[i];
if(min > items_type[i]) min = items_type[i];
}
while(sum < struct_size) {
uint8_t new_min = 255;
sum = 0;
for(uint64_t i = 0; i < items_cnt; i++) {
if(items_type[i] == min) items_type[i]++;
if(new_min > items_type[i]) new_min = items_type[i];
sum += 1u << items_type[i];
}
}
}
#endif #endif