chore: acquire-core migration monorepo (legacy C + Spring Boot target skeleton)
Some checks failed
ci / build (push) Failing after 2s

TxCore/ECPG legacy 매입·정산 C 슬라이스(빌드검증) + Spring Boot 멀티모듈 골격(mvn test green) + MIGRATION.md 전환룰 + CI(boot 빌드).
This commit is contained in:
forge-bot 2026-07-18 09:55:46 +00:00
commit ff0b0b60a2
31 changed files with 2208 additions and 0 deletions

View file

@ -0,0 +1,82 @@
/*
* util_amount.c - / (plain C)
*/
#include "acq_util.h"
#include <string.h>
#include <ctype.h>
#include <stdio.h>
/* 거래금액 상한 (원). 건당 1억원 */
#define AMOUNT_MAX 100000000L
long amount_parse(const char *field, int len)
{
long v = 0;
int i;
if (!field || len <= 0)
return -1;
for (i = 0; i < len; i++) {
char c = field[i];
if (c == ' ') /* 선행 공백 허용 */
continue;
if (!isdigit((unsigned char)c))
return -1;
v = v * 10 + (c - '0');
}
return v;
}
int amount_format(long amount, char *out, int len)
{
char tmp[32];
int n;
if (!out || len <= 0 || amount < 0)
return -1;
n = snprintf(tmp, sizeof(tmp), "%0*ld", len, amount);
if (n < 0 || n > len) /* 폭 초과 = 오버플로우 */
return -1;
memcpy(out, tmp, len); /* 널 종료 없이 고정폭 복사 */
return 0;
}
void amount_format_won(long amount, char *out, int outlen)
{
char raw[32];
int n, i, j, digits, first;
if (!out || outlen <= 0)
return;
n = snprintf(raw, sizeof(raw), "%ld", amount);
if (n < 0) {
out[0] = '\0';
return;
}
first = (raw[0] == '-') ? 1 : 0;
digits = n - first;
j = 0;
if (first && j < outlen - 1)
out[j++] = '-';
for (i = first; i < n && j < outlen - 1; i++) {
int pos = i - first; /* 0-based 자릿수 위치 */
if (pos > 0 && (digits - pos) % 3 == 0)
if (j < outlen - 1)
out[j++] = ',';
out[j++] = raw[i];
}
out[j] = '\0';
}
int amount_is_valid(long amount)
{
return (amount >= 1 && amount <= AMOUNT_MAX) ? 1 : 0;
}

View file

@ -0,0 +1,135 @@
/*
* util_date.c - / (plain C)
*/
#include "acq_util.h"
#include <string.h>
#include <ctype.h>
#include <stdio.h>
#include <time.h>
static int is_all_digit(const char *s, int len)
{
int i;
for (i = 0; i < len; i++) {
if (!isdigit((unsigned char)s[i]))
return 0;
}
return 1;
}
static int to_int(const char *s, int len)
{
int i, v = 0;
for (i = 0; i < len; i++)
v = v * 10 + (s[i] - '0');
return v;
}
static int days_in_month(int y, int m)
{
static const int d[] = { 31, 28, 31, 30, 31, 30,
31, 31, 30, 31, 30, 31 };
if (m < 1 || m > 12)
return 0;
if (m == 2) {
int leap = (y % 4 == 0 && y % 100 != 0) || (y % 400 == 0);
return leap ? 29 : 28;
}
return d[m - 1];
}
int date_is_valid(const char *yyyymmdd)
{
int y, m, d;
if (!yyyymmdd || strlen(yyyymmdd) < 8)
return 0;
if (!is_all_digit(yyyymmdd, 8))
return 0;
y = to_int(yyyymmdd, 4);
m = to_int(yyyymmdd + 4, 2);
d = to_int(yyyymmdd + 6, 2);
if (y < 1900 || y > 2999)
return 0;
if (m < 1 || m > 12)
return 0;
if (d < 1 || d > days_in_month(y, m))
return 0;
return 1;
}
/* Sakamoto 알고리즘: 0=일요일 ... 6=토요일 */
int date_weekday(const char *yyyymmdd)
{
static const int t[] = { 0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4 };
int y, m, d;
if (!date_is_valid(yyyymmdd))
return -1;
y = to_int(yyyymmdd, 4);
m = to_int(yyyymmdd + 4, 2);
d = to_int(yyyymmdd + 6, 2);
if (m < 3)
y -= 1;
return (y + y / 4 - y / 100 + y / 400 + t[m - 1] + d) % 7;
}
int date_is_weekend(const char *yyyymmdd)
{
int w = date_weekday(yyyymmdd);
return (w == 0 || w == 6) ? 1 : 0;
}
/* YYYYMMDD 를 하루 증가시킨다 (in==out 허용) */
static void add_one_day(const char *in, char *out)
{
int y = to_int(in, 4);
int m = to_int(in + 4, 2);
int d = to_int(in + 6, 2);
d++;
if (d > days_in_month(y, m)) {
d = 1;
m++;
if (m > 12) {
m = 1;
y++;
}
}
snprintf(out, 9, "%04d%02d%02d", y, m, d);
}
int date_next_business(const char *yyyymmdd, char *out)
{
char cur[9];
int guard = 0;
if (!date_is_valid(yyyymmdd) || !out)
return -1;
memcpy(cur, yyyymmdd, 8);
cur[8] = '\0';
do {
add_one_day(cur, cur);
if (++guard > 14) /* 무한루프 방지 */
return -1;
} while (date_is_weekend(cur));
memcpy(out, cur, 8);
out[8] = '\0';
return 0;
}
void date_today(char *out)
{
time_t now = time(NULL);
struct tm tmv;
localtime_r(&now, &tmv);
strftime(out, 9, "%Y%m%d", &tmv);
}

View file

@ -0,0 +1,109 @@
/*
* util_msg.c - pack/unpack (plain C)
*/
#include "acq_util.h"
#include <string.h>
#include <ctype.h>
void msg_field_copy(char *out, const char *field, int len)
{
int end;
if (!out || !field || len < 0)
return;
/* 우측 공백 제거하여 널 종료 문자열 생성 */
end = len;
while (end > 0 && (field[end - 1] == ' ' || field[end - 1] == '\0'))
end--;
memcpy(out, field, end);
out[end] = '\0';
}
void msg_field_set(char *field, const char *src, int len)
{
int slen, i;
if (!field || len < 0)
return;
slen = src ? (int)strlen(src) : 0;
if (slen > len)
slen = len;
memcpy(field, src, slen);
for (i = slen; i < len; i++) /* 우측 공백 패딩 */
field[i] = ' ';
}
void msg_field_set_num(char *field, const char *src, int len)
{
int slen, pad, i;
if (!field || len < 0)
return;
slen = src ? (int)strlen(src) : 0;
if (slen > len)
slen = len;
pad = len - slen;
for (i = 0; i < pad; i++) /* 좌측 zero 패딩 */
field[i] = '0';
if (src)
memcpy(field + pad, src, slen);
}
int msg_unpack(acq_msg_t *msg, const char *raw, int rawlen)
{
if (!msg || !raw)
return -1;
if (rawlen < MSG_ACQ_LEN)
return -1;
/* 위치기반 레이아웃이 곧 구조체 메모리 배열과 동일 */
memcpy(msg, raw, MSG_ACQ_LEN);
return 0;
}
int msg_pack(const acq_msg_t *msg, char *raw, int rawlen)
{
if (!msg || !raw)
return -1;
if (rawlen < MSG_ACQ_LEN)
return -1;
memcpy(raw, msg, MSG_ACQ_LEN);
return 0;
}
static int field_blank(const char *field, int len)
{
int i;
for (i = 0; i < len; i++) {
if (field[i] != ' ' && field[i] != '\0')
return 0;
}
return 1;
}
int msg_validate(const acq_msg_t *msg)
{
if (!msg)
return -1;
if (field_blank(msg->msg_type, FLD_MSG_TYPE_LEN))
return -1;
if (field_blank(msg->merch_id, FLD_MERCH_ID_LEN))
return -1;
if (field_blank(msg->card_no, FLD_CARD_NO_LEN))
return -1;
if (field_blank(msg->amount, FLD_AMOUNT_LEN))
return -1;
if (field_blank(msg->txn_date, FLD_TXN_DATE_LEN))
return -1;
return 0;
}