log2journal-params.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519
  1. // SPDX-License-Identifier: GPL-3.0-or-later
  2. #include "log2journal.h"
  3. static bool parse_replacement_pattern(struct key_rewrite *rw);
  4. // ----------------------------------------------------------------------------
  5. void nd_log_destroy(struct log_job *jb) {
  6. for(size_t i = 0; i < jb->injections.used ;i++) {
  7. if(jb->injections.keys[i].value.s)
  8. freez(jb->injections.keys[i].value.s);
  9. }
  10. for(size_t i = 0; i < jb->unmatched.injections.used ;i++) {
  11. if(jb->unmatched.injections.keys[i].value.s)
  12. freez(jb->unmatched.injections.keys[i].value.s);
  13. }
  14. for(size_t i = 0; i < jb->dups.used ;i++) {
  15. struct key_dup *kd = &jb->dups.array[i];
  16. if(kd->target)
  17. freez(kd->target);
  18. for(size_t j = 0; j < kd->used ; j++) {
  19. if (kd->keys[j])
  20. freez(kd->keys[j]);
  21. if (kd->values[j].s)
  22. freez(kd->values[j].s);
  23. }
  24. }
  25. for(size_t i = 0; i < jb->rewrites.used; i++) {
  26. struct key_rewrite *rw = &jb->rewrites.array[i];
  27. if (rw->key)
  28. freez(rw->key);
  29. if (rw->search_pattern)
  30. freez(rw->search_pattern);
  31. if (rw->replace_pattern)
  32. freez(rw->replace_pattern);
  33. if(rw->match_data)
  34. pcre2_match_data_free(rw->match_data);
  35. if (rw->re)
  36. pcre2_code_free(rw->re);
  37. // Cleanup for replacement nodes linked list
  38. struct replacement_node *current = rw->nodes;
  39. while (current != NULL) {
  40. struct replacement_node *next = current->next;
  41. if (current->s)
  42. freez((void *)current->s);
  43. freez(current);
  44. current = next;
  45. }
  46. }
  47. memset(jb, 0, sizeof(*jb));
  48. }
  49. // ----------------------------------------------------------------------------
  50. bool log_job_add_filename_key(struct log_job *jb, const char *key, size_t key_len) {
  51. if(!key || !*key) {
  52. log2stderr("filename key cannot be empty.");
  53. return false;
  54. }
  55. if(jb->filename.key)
  56. freez((char*)jb->filename.key);
  57. jb->filename.key = strndupz(key, key_len);
  58. return true;
  59. }
  60. bool log_job_add_key_prefix(struct log_job *jb, const char *prefix, size_t prefix_len) {
  61. if(!prefix || !*prefix) {
  62. log2stderr("filename key cannot be empty.");
  63. return false;
  64. }
  65. if(jb->prefix)
  66. freez((char*)jb->prefix);
  67. jb->prefix = strndupz(prefix, prefix_len);
  68. return true;
  69. }
  70. bool log_job_add_injection(struct log_job *jb, const char *key, size_t key_len, const char *value, size_t value_len, bool unmatched) {
  71. if (unmatched) {
  72. if (jb->unmatched.injections.used >= MAX_INJECTIONS) {
  73. log2stderr("Error: too many unmatched injections. You can inject up to %d lines.", MAX_INJECTIONS);
  74. return false;
  75. }
  76. }
  77. else {
  78. if (jb->injections.used >= MAX_INJECTIONS) {
  79. log2stderr("Error: too many injections. You can inject up to %d lines.", MAX_INJECTIONS);
  80. return false;
  81. }
  82. }
  83. if (unmatched) {
  84. key_value_replace(&jb->unmatched.injections.keys[jb->unmatched.injections.used++],
  85. key, key_len,
  86. value, value_len);
  87. } else {
  88. key_value_replace(&jb->injections.keys[jb->injections.used++],
  89. key, key_len,
  90. value, value_len);
  91. }
  92. return true;
  93. }
  94. bool log_job_add_rename(struct log_job *jb, const char *new_key, size_t new_key_len, const char *old_key, size_t old_key_len) {
  95. if(jb->renames.used >= MAX_RENAMES) {
  96. log2stderr("Error: too many renames. You can rename up to %d fields.", MAX_RENAMES);
  97. return false;
  98. }
  99. struct key_rename *rn = &jb->renames.array[jb->renames.used++];
  100. rn->new_key = strndupz(new_key, new_key_len);
  101. rn->new_hash = XXH3_64bits(rn->new_key, strlen(rn->new_key));
  102. rn->old_key = strndupz(old_key, old_key_len);
  103. rn->old_hash = XXH3_64bits(rn->old_key, strlen(rn->old_key));
  104. return true;
  105. }
  106. bool log_job_add_rewrite(struct log_job *jb, const char *key, const char *search_pattern, const char *replace_pattern) {
  107. if(jb->rewrites.used >= MAX_REWRITES) {
  108. log2stderr("Error: too many rewrites. You can add up to %d rewrite rules.", MAX_REWRITES);
  109. return false;
  110. }
  111. pcre2_code *re = jb_compile_pcre2_pattern(search_pattern);
  112. if (!re) {
  113. return false;
  114. }
  115. struct key_rewrite *rw = &jb->rewrites.array[jb->rewrites.used++];
  116. rw->key = strdupz(key);
  117. rw->hash = XXH3_64bits(rw->key, strlen(rw->key));
  118. rw->search_pattern = strdupz(search_pattern);
  119. rw->replace_pattern = strdupz(replace_pattern);
  120. rw->re = re;
  121. rw->match_data = pcre2_match_data_create_from_pattern(rw->re, NULL);
  122. // Parse the replacement pattern and create the linked list
  123. if (!parse_replacement_pattern(rw)) {
  124. pcre2_match_data_free(rw->match_data);
  125. pcre2_code_free(rw->re);
  126. freez(rw->key);
  127. freez(rw->search_pattern);
  128. freez(rw->replace_pattern);
  129. jb->rewrites.used--;
  130. return false;
  131. }
  132. return true;
  133. }
  134. // ----------------------------------------------------------------------------
  135. struct key_dup *log_job_add_duplication_to_job(struct log_job *jb, const char *target, size_t target_len) {
  136. if (jb->dups.used >= MAX_KEY_DUPS) {
  137. log2stderr("Error: Too many duplicates defined. Maximum allowed is %d.", MAX_KEY_DUPS);
  138. return NULL;
  139. }
  140. struct key_dup *kd = &jb->dups.array[jb->dups.used++];
  141. kd->target = strndupz(target, target_len);
  142. kd->hash = XXH3_64bits(kd->target, target_len);
  143. kd->used = 0;
  144. kd->exposed = false;
  145. // Initialize values array
  146. for (size_t i = 0; i < MAX_KEY_DUPS_KEYS; i++) {
  147. kd->values[i].s = NULL;
  148. kd->values[i].size = 0;
  149. }
  150. return kd;
  151. }
  152. bool log_job_add_key_to_duplication(struct key_dup *kd, const char *key, size_t key_len) {
  153. if (kd->used >= MAX_KEY_DUPS_KEYS) {
  154. log2stderr("Error: Too many keys in duplication of target '%s'.", kd->target);
  155. return false;
  156. }
  157. kd->keys[kd->used++] = strndupz(key, key_len);
  158. return true;
  159. }
  160. // ----------------------------------------------------------------------------
  161. // command line params
  162. struct replacement_node *add_replacement_node(struct replacement_node **head, bool is_variable, const char *text) {
  163. struct replacement_node *new_node = mallocz(sizeof(struct replacement_node));
  164. if (!new_node)
  165. return NULL;
  166. new_node->is_variable = is_variable;
  167. new_node->s = text;
  168. new_node->len = strlen(text);
  169. new_node->next = NULL;
  170. if (*head == NULL)
  171. *head = new_node;
  172. else {
  173. struct replacement_node *current = *head;
  174. // append it
  175. while (current->next != NULL)
  176. current = current->next;
  177. current->next = new_node;
  178. }
  179. return new_node;
  180. }
  181. static bool parse_replacement_pattern(struct key_rewrite *rw) {
  182. const char *current = rw->replace_pattern;
  183. while (*current != '\0') {
  184. if (*current == '$' && *(current + 1) == '{') {
  185. // Start of a variable
  186. const char *end = strchr(current, '}');
  187. if (!end) {
  188. log2stderr("Error: Missing closing brace in replacement pattern: %s", rw->replace_pattern);
  189. return false;
  190. }
  191. size_t name_length = end - current - 2; // Length of the variable name
  192. char *variable_name = strndupz(current + 2, name_length);
  193. if (!variable_name) {
  194. log2stderr("Error: Memory allocation failed for variable name.");
  195. return false;
  196. }
  197. struct replacement_node *node = add_replacement_node(&(rw->nodes), true, variable_name);
  198. if (!node) {
  199. freez(variable_name);
  200. log2stderr("Error: Failed to add replacement node for variable.");
  201. return false;
  202. }
  203. current = end + 1; // Move past the variable
  204. }
  205. else {
  206. // Start of literal text
  207. const char *start = current;
  208. while (*current != '\0' && !(*current == '$' && *(current + 1) == '{')) {
  209. current++;
  210. }
  211. size_t text_length = current - start;
  212. char *text = strndupz(start, text_length);
  213. if (!text) {
  214. log2stderr("Error: Memory allocation failed for literal text.");
  215. return false;
  216. }
  217. struct replacement_node *node = add_replacement_node(&(rw->nodes), false, text);
  218. if (!node) {
  219. freez(text);
  220. log2stderr("Error: Failed to add replacement node for text.");
  221. return false;
  222. }
  223. }
  224. }
  225. return true;
  226. }
  227. static bool parse_rename(struct log_job *jb, const char *param) {
  228. // Search for '=' in param
  229. const char *equal_sign = strchr(param, '=');
  230. if (!equal_sign || equal_sign == param) {
  231. log2stderr("Error: Invalid rename format, '=' not found in %s", param);
  232. return false;
  233. }
  234. const char *new_key = param;
  235. size_t new_key_len = equal_sign - new_key;
  236. const char *old_key = equal_sign + 1;
  237. size_t old_key_len = strlen(old_key);
  238. return log_job_add_rename(jb, new_key, new_key_len, old_key, old_key_len);
  239. }
  240. static bool is_symbol(char c) {
  241. return !isalpha(c) && !isdigit(c) && !iscntrl(c);
  242. }
  243. static bool parse_rewrite(struct log_job *jb, const char *param) {
  244. // Search for '=' in param
  245. const char *equal_sign = strchr(param, '=');
  246. if (!equal_sign || equal_sign == param) {
  247. log2stderr("Error: Invalid rewrite format, '=' not found in %s", param);
  248. return false;
  249. }
  250. // Get the next character as the separator
  251. char separator = *(equal_sign + 1);
  252. if (!separator || !is_symbol(separator)) {
  253. log2stderr("Error: rewrite separator not found after '=', or is not one of /\\|-# in: %s", param);
  254. return false;
  255. }
  256. // Find the next occurrence of the separator
  257. const char *second_separator = strchr(equal_sign + 2, separator);
  258. if (!second_separator) {
  259. log2stderr("Error: rewrite second separator not found in: %s", param);
  260. return false;
  261. }
  262. // Check if the search pattern is empty
  263. if (equal_sign + 1 == second_separator) {
  264. log2stderr("Error: rewrite search pattern is empty in: %s", param);
  265. return false;
  266. }
  267. // Check if the replacement pattern is empty
  268. if (*(second_separator + 1) == '\0') {
  269. log2stderr("Error: rewrite replacement pattern is empty in: %s", param);
  270. return false;
  271. }
  272. // Reserve a slot in rewrites
  273. if (jb->rewrites.used >= MAX_REWRITES) {
  274. log2stderr("Error: Exceeded maximum number of rewrite rules, while processing: %s", param);
  275. return false;
  276. }
  277. // Extract key, search pattern, and replacement pattern
  278. char *key = strndupz(param, equal_sign - param);
  279. char *search_pattern = strndupz(equal_sign + 2, second_separator - (equal_sign + 2));
  280. char *replace_pattern = strdupz(second_separator + 1);
  281. bool ret = log_job_add_rewrite(jb, key, search_pattern, replace_pattern);
  282. freez(key);
  283. freez(search_pattern);
  284. freez(replace_pattern);
  285. return ret;
  286. }
  287. static bool parse_inject(struct log_job *jb, const char *value, bool unmatched) {
  288. const char *equal = strchr(value, '=');
  289. if (!equal) {
  290. log2stderr("Error: injection '%s' does not have an equal sign.", value);
  291. return false;
  292. }
  293. const char *key = value;
  294. const char *val = equal + 1;
  295. log_job_add_injection(jb, key, equal - key, val, strlen(val), unmatched);
  296. return true;
  297. }
  298. static bool parse_duplicate(struct log_job *jb, const char *value) {
  299. const char *target = value;
  300. const char *equal_sign = strchr(value, '=');
  301. if (!equal_sign || equal_sign == target) {
  302. log2stderr("Error: Invalid duplicate format, '=' not found or at the start in %s", value);
  303. return false;
  304. }
  305. size_t target_len = equal_sign - target;
  306. struct key_dup *kd = log_job_add_duplication_to_job(jb, target, target_len);
  307. if(!kd) return false;
  308. const char *key = equal_sign + 1;
  309. while (key) {
  310. if (kd->used >= MAX_KEY_DUPS_KEYS) {
  311. log2stderr("Error: too many keys in duplication of target '%s'.", kd->target);
  312. return false;
  313. }
  314. const char *comma = strchr(key, ',');
  315. size_t key_len;
  316. if (comma) {
  317. key_len = comma - key;
  318. log_job_add_key_to_duplication(kd, key, key_len);
  319. key = comma + 1;
  320. }
  321. else {
  322. log_job_add_key_to_duplication(kd, key, strlen(key));
  323. break; // No more keys
  324. }
  325. }
  326. return true;
  327. }
  328. bool parse_log2journal_parameters(struct log_job *jb, int argc, char **argv) {
  329. for (int i = 1; i < argc; i++) {
  330. char *arg = argv[i];
  331. if (strcmp(arg, "--help") == 0 || strcmp(arg, "-h") == 0) {
  332. log2journal_command_line_help(argv[0]);
  333. exit(0);
  334. }
  335. #if defined(NETDATA_DEV_MODE) || defined(NETDATA_INTERNAL_CHECKS)
  336. else if(strcmp(arg, "--test") == 0) {
  337. // logfmt_test();
  338. json_test();
  339. exit(1);
  340. }
  341. #endif
  342. else if (strcmp(arg, "--show-config") == 0) {
  343. jb->show_config = true;
  344. }
  345. else {
  346. char buffer[1024];
  347. char *param = NULL;
  348. char *value = NULL;
  349. char *equal_sign = strchr(arg, '=');
  350. if (equal_sign) {
  351. copy_to_buffer(buffer, sizeof(buffer), arg, equal_sign - arg);
  352. param = buffer;
  353. value = equal_sign + 1;
  354. }
  355. else {
  356. param = arg;
  357. if (i + 1 < argc) {
  358. value = argv[++i];
  359. }
  360. else {
  361. if (!jb->pattern) {
  362. jb->pattern = arg;
  363. continue;
  364. } else {
  365. log2stderr("Error: Multiple patterns detected. Specify only one pattern. The first is '%s', the second is '%s'", jb->pattern, arg);
  366. return false;
  367. }
  368. }
  369. }
  370. if (strcmp(param, "--filename-key") == 0) {
  371. if(!log_job_add_filename_key(jb, value, value ? strlen(value) : 0))
  372. return false;
  373. }
  374. if (strcmp(param, "--prefix") == 0) {
  375. if(!log_job_add_key_prefix(jb, value, value ? strlen(value) : 0))
  376. return false;
  377. }
  378. #ifdef HAVE_LIBYAML
  379. else if (strcmp(param, "-f") == 0 || strcmp(param, "--file") == 0) {
  380. if (!yaml_parse_file(value, jb))
  381. return false;
  382. }
  383. else if (strcmp(param, "--config") == 0) {
  384. if (!yaml_parse_config(value, jb))
  385. return false;
  386. }
  387. #endif
  388. else if (strcmp(param, "--unmatched-key") == 0)
  389. jb->unmatched.key = value;
  390. else if (strcmp(param, "--duplicate") == 0) {
  391. if (!parse_duplicate(jb, value))
  392. return false;
  393. }
  394. else if (strcmp(param, "--inject") == 0) {
  395. if (!parse_inject(jb, value, false))
  396. return false;
  397. }
  398. else if (strcmp(param, "--inject-unmatched") == 0) {
  399. if (!parse_inject(jb, value, true))
  400. return false;
  401. }
  402. else if (strcmp(param, "--rewrite") == 0) {
  403. if (!parse_rewrite(jb, value))
  404. return false;
  405. }
  406. else if (strcmp(param, "--rename") == 0) {
  407. if (!parse_rename(jb, value))
  408. return false;
  409. }
  410. else {
  411. i--;
  412. if (!jb->pattern) {
  413. jb->pattern = arg;
  414. continue;
  415. } else {
  416. log2stderr("Error: Multiple patterns detected. Specify only one pattern. The first is '%s', the second is '%s'", jb->pattern, arg);
  417. return false;
  418. }
  419. }
  420. }
  421. }
  422. // Check if a pattern is set and exactly one pattern is specified
  423. if (!jb->pattern) {
  424. log2stderr("Error: Pattern not specified.");
  425. log2journal_command_line_help(argv[0]);
  426. return false;
  427. }
  428. return true;
  429. }