blankhex/CgeStr
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix code style for pointers

Browse Source
This commit is contained in:
Mikhail Romanko
2026-06-21 13:35:05 +03:00
parent 32649b3526
commit 58526b9ee1
10 changed files with 2246 additions and 2246 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
generator/Blocks.h
View File

@@ -6,14 +6,14 @@
#include "ValueList.h"
struct BlockLevel {
long* data;
long *data;
size_t size;
size_t capacity;
struct ValueList* list;
struct ValueList *list;
};
struct Blocks {
struct BlockLevel* levels;
struct BlockLevel *levels;
size_t depth;
};
@@ -23,8 +23,8 @@ static int ilog2(unsigned long value) {
return result;
}
static long blockInsert(struct Blocks* blocks, long value, size_t depth) {
struct BlockLevel* level = blocks->levels + depth;
static long blockInsert(struct Blocks *blocks, long value, size_t depth) {
struct BlockLevel *level = blocks->levels + depth;
if (blocks->depth - 1 != depth) {
if ((value = blockInsert(blocks, value, depth + 1)) == -1)
@@ -44,9 +44,9 @@ static long blockInsert(struct Blocks* blocks, long value, size_t depth) {
return -1;
}
static long blockFindR(struct Blocks* blocks, long value, long offset, size_t depth) {
struct BlockLevel* level = &blocks->levels[depth];
struct ValueList* current;
static long blockFindR(struct Blocks *blocks, long value, long offset, size_t depth) {
struct BlockLevel *level = &blocks->levels[depth];
struct ValueList *current;
size_t i, bits = 0;
for (i = depth + 1; i < blocks->depth; i++) {
@@ -65,7 +65,7 @@ static long blockFindR(struct Blocks* blocks, long value, long offset, size_t de
return offset;
}
static long blockFind(struct Blocks* blocks, long value) {
static long blockFind(struct Blocks *blocks, long value) {
size_t i, bits = 0;
long offset;
@@ -77,7 +77,7 @@ static long blockFind(struct Blocks* blocks, long value) {
return blockFindR(blocks, value, offset, 0);
}
static void blockInit(struct Blocks* blocks, size_t depth, ...) {
static void blockInit(struct Blocks *blocks, size_t depth, ...) {
va_list args;
blocks->depth = 0;
@@ -87,7 +87,7 @@ static void blockInit(struct Blocks* blocks, size_t depth, ...) {
va_start(args, depth);
while (blocks->depth < depth) {
struct BlockLevel* level = &blocks->levels[blocks->depth];
struct BlockLevel *level = &blocks->levels[blocks->depth];
level->list = NULL;
level->size = 0;
@@ -100,10 +100,10 @@ static void blockInit(struct Blocks* blocks, size_t depth, ...) {
va_end(args);
}
static void blockDump(struct Blocks* blocks, size_t depth, FILE* out,
const char* name, const char* type) {
struct BlockLevel* level = &blocks->levels[depth];
struct ValueList* current;
static void blockDump(struct Blocks *blocks, size_t depth, FILE *out,
const char *name, const char *type) {
struct BlockLevel *level = &blocks->levels[depth];
struct ValueList *current;
size_t i, j, printed = 0;
fprintf(out, "static const %s %s[] = {\n ", type, name);
@@ -120,9 +120,9 @@ static void blockDump(struct Blocks* blocks, size_t depth, FILE* out,
fprintf(out, "\n};\n\n");
}
static void blockAccess(struct Blocks* blocks, size_t depth, FILE* out,
const char* var, const char* arg, const char* name) {
struct BlockLevel* level = &blocks->levels[depth];
static void blockAccess(struct Blocks *blocks, size_t depth, FILE *out,
const char *var, const char *arg, const char *name) {
struct BlockLevel *level = &blocks->levels[depth];
long i, bits = 0, offset, mask;
for (i = depth + 1; i < blocks->depth; i++) {

52
generator/Tables.c
View File

@@ -24,18 +24,18 @@ struct CaseInfo {
long title[4];
long fold[4];
} full;
struct CaseInfo* prev;
struct CaseInfo* next;
struct CaseInfo *prev;
struct CaseInfo *next;
};
typedef int (*EntryCb)(long rune, int fill, char** fields, size_t size);
static void entryProcess(FILE* in, EntryCb cb, const char* globStart,
const char* globEnd, size_t globField,
static void entryProcess(FILE *in, EntryCb cb, const char *globStart,
const char *globEnd, size_t globField,
size_t codeField, size_t minFields) {
long code, startCode, prevCode = -1;
char line[MAX_LINE];
char* fields[MAX_FIELDS];
char *fields[MAX_FIELDS];
int emitted = 0;
size_t columns;
@@ -76,9 +76,9 @@ static void entryProcess(FILE* in, EntryCb cb, const char* globStart,
emitted = cb(code++, 1, fields, columns);
}
static struct CaseInfo* caseInfoSort(struct CaseInfo* head) {
struct CaseInfo* current;
struct CaseInfo* next;
static struct CaseInfo *caseInfoSort(struct CaseInfo *head) {
struct CaseInfo *current;
struct CaseInfo *next;
int swapped;
if (!head || !head->next)
@@ -112,9 +112,9 @@ static struct CaseInfo* caseInfoSort(struct CaseInfo* head) {
return head;
}
static struct CaseInfo* caseInfoGet(struct CaseInfo** head, long rune) {
struct CaseInfo* current = *head;
struct CaseInfo* node;
static struct CaseInfo *caseInfoGet(struct CaseInfo** head, long rune) {
struct CaseInfo *current = *head;
struct CaseInfo *node;
while (current != NULL) {
if (current->rune == rune)
@@ -135,7 +135,7 @@ static struct CaseInfo* caseInfoGet(struct CaseInfo** head, long rune) {
return node;
}
static size_t categoryClassify(const char* name) {
static size_t categoryClassify(const char *name) {
static const char *categories[] = {
"Lu", "Ll", "Lt", "Lm", "Lo", "Mn", "Mc", "Me", "Nd", "Nl", "No", "Pc",
"Pd", "Ps", "Pe", "Pi", "Pf", "Po", "Sm", "Sc", "Sk", "So", "Zs", "Zl",
@@ -152,15 +152,15 @@ static size_t categoryClassify(const char* name) {
return categoryClassify("Cn");
}
FILE* in;
FILE* out;
FILE *in;
FILE *out;
struct Blocks categoryBlocks;
struct CaseInfo* caseInfo = NULL;
struct CaseInfo *caseInfo = NULL;
static int entryUnicodeData(long rune, int fill, char** fields, size_t size) {
long lowercase, uppercase, titlecase;
struct CaseInfo* node;
struct CaseInfo *node;
if (fill) {
return blockInsert(&categoryBlocks, categoryClassify("Cn"), 0);
@@ -180,8 +180,8 @@ static int entryUnicodeData(long rune, int fill, char** fields, size_t size) {
}
}
static void arrayParseFromStr(const char* field, long* array) {
char* endptr = (char*)field;
static void arrayParseFromStr(const char *field, long *array) {
char *endptr = (char*)field;
size_t written = 0;
while (1) {
@@ -193,7 +193,7 @@ static void arrayParseFromStr(const char* field, long* array) {
}
static int entryCaseFolding(long rune, int fill, char** fields, size_t size) {
struct CaseInfo* node;
struct CaseInfo *node;
if (fill || !strcmp("T", fields[1]))
return 1;
@@ -208,7 +208,7 @@ static int entryCaseFolding(long rune, int fill, char** fields, size_t size) {
}
static int entrySpecialCasing(long rune, int fill, char** fields, size_t size) {
struct CaseInfo* node;
struct CaseInfo *node;
if (fill || strcmp("", fields[4]))
return 1;
@@ -221,13 +221,13 @@ static int entrySpecialCasing(long rune, int fill, char** fields, size_t size) {
return 1;
}
static void mappingRemoveSingle(long* array) {
static void mappingRemoveSingle(long *array) {
if (array[0] && !array[1])
array[0] = 0;
}
static void caseInfoReduce(void) {
struct CaseInfo* current = caseInfo;
struct CaseInfo *current = caseInfo;
while (current) {
if (!current->simple.title && current->simple.upper)
current->simple.title = current->simple.upper;
@@ -248,7 +248,7 @@ struct Blocks lowerFullBlocks, upperFullBlocks, titleFullBlocks, foldFullBlocks;
long longIndexData[1024][4];
size_t longIndexSize = 0;
static long longIndexGet(long* array) {
static long longIndexGet(long *array) {
size_t i;
for (i = 0; i < longIndexSize; i++) {
@@ -261,7 +261,7 @@ static long longIndexGet(long* array) {
}
static void blocksBuild(void) {
struct CaseInfo* current = caseInfo;
struct CaseInfo *current = caseInfo;
int emitted;
long last = -1;
@@ -388,14 +388,14 @@ static void outputCode(void) {
} while(0)
#define EMIT_FULL(FUNC, SIMPLE, FULL_BLOCKS, FULL_BASE, SIMPLE_FUNC) do { \
fprintf(out, "size_t CgeRune" #FUNC "Full(uint32_t r, uint32_t* out){\n"); \
fprintf(out, "size_t CgeRune" #FUNC "Full(uint32_t r, uint32_t *out){\n"); \
fprintf(out, " long t;\n if(r>1114111ul){\n *out=r;\n return 1;\n }\n"); \
blockAccess(&FULL_BLOCKS, 0, out, "t", "r", FULL_BASE "1"); \
blockAccess(&FULL_BLOCKS, 1, out, "t", "r", FULL_BASE "2"); \
blockAccess(&FULL_BLOCKS, 2, out, "t", "r", FULL_BASE "3"); \
blockAccess(&FULL_BLOCKS, 3, out, "t", "r", FULL_BASE "4"); \
fprintf(out, " if(t>=0){\n"); \
fprintf(out, " const int32_t* p=case_data[t];\n"); \
fprintf(out, " const int32_t *p=case_data[t];\n"); \
fprintf(out, " size_t i=0;\n"); \
fprintf(out, " while(p[i] && i<3){out[i]=p[i];i++;}\n"); \
fprintf(out, " return i;\n }\n"); \

22
generator/TextProc.h
View File

@@ -8,9 +8,9 @@
#define MAX_FIELDS 16
static int glob(const char* pattern, const char* text) {
const char* star = NULL;
const char* restart = text;
static int glob(const char *pattern, const char *text) {
const char *star = NULL;
const char *restart = text;
while (*text) {
if (*pattern == *text || *pattern == '?')
@@ -27,13 +27,13 @@ static int glob(const char* pattern, const char* text) {
return (*pattern == '\0');
}
static char* trimLeft(char* line) {
static char *trimLeft(char *line) {
for (; *line && isspace(*line); ++line);
return line;
}
static void trimRight(char* line) {
char* last = line;
static void trimRight(char *line) {
char *last = line;
for (; *line; ++line)
if (!isspace(*line))
@@ -41,17 +41,17 @@ static void trimRight(char* line) {
*last = '\0';
}
static void trimComment(char* line) {
char* separator = strchr(line, '#');
static void trimComment(char *line) {
char *separator = strchr(line, '#');
if (separator) *separator = '\0';
}
static char* trim(char* line) {
static char *trim(char *line) {
trimRight(line);
return trimLeft(line);
}
static size_t fieldParse(char* line, char** fields, char separator) {
static size_t fieldParse(char *line, char** fields, char separator) {
size_t index = 0;
do {
@@ -65,7 +65,7 @@ static size_t fieldParse(char* line, char** fields, char separator) {
return index;
}
static int processLine(FILE* in, char* line, size_t size, char** fields) {
static int processLine(FILE *in, char *line, size_t size, char** fields) {
if (!fgets(line, size, in))
return 0;

8
generator/ValueList.h
View File

@@ -6,12 +6,12 @@
#include <stdlib.h>
struct ValueList {
long* data;
long *data;
size_t size;
struct ValueList* next;
struct ValueList *next;
};
static long valueListFind(struct ValueList* list, long* data, size_t size) {
static long valueListFind(struct ValueList *list, long *data, size_t size) {
long index = 0;
while (list) {
@@ -22,7 +22,7 @@ static long valueListFind(struct ValueList* list, long* data, size_t size) {
return -1;
}
static long valueListIntern(struct ValueList** list, long* data, size_t size) {
static long valueListIntern(struct ValueList** list, long *data, size_t size) {
long index = 0;
while (*list) ++index, list = &(*list)->next;