codec.h 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297
  1. #ifndef _LSUP_CODEC_BASE_H
  2. #define _LSUP_CODEC_BASE_H
  3. #include "graph.h"
  4. /**
  5. * Max data size passed to the scanner and parser at each iteration.
  6. */
  7. #ifdef LSUP_RDF_STREAM_CHUNK_SIZE
  8. #define CHUNK_SIZE LSUP_RDF_STREAM_CHUNK_SIZE
  9. #else
  10. #define CHUNK_SIZE 8192
  11. #endif
  12. typedef struct codec_t LSUP_Codec;
  13. /// Parser state.
  14. typedef struct {
  15. LSUP_GraphIterator * it; ///< Iterator used to build the graph.
  16. LSUP_NSMap * nsm; ///< NS map used in the document.
  17. LSUP_Term * base; ///< Base IRI used in the document.
  18. size_t ct; ///< Statements parsed.
  19. LSUP_rc rc; ///< Internal return code.
  20. } LSUP_TTLParserState;
  21. /** @brief Parse error information.
  22. *
  23. */
  24. /* TODO A plain string will suffice for now.
  25. typedef struct parse_error_t {
  26. unsigned int line; // Line number where the error occurred.
  27. unsigned int linec; // Position in line of the offending token.
  28. char * token; // String representation of the token.
  29. } LSUP_ParseError;
  30. */
  31. /*
  32. * Interface prototypes.
  33. */
  34. /** @brief Term encoder callback type.
  35. *
  36. * @param[in] term Single term handle.
  37. *
  38. * @param[in] nsm Namespace map. May be NULL for no prefix shortening.
  39. *
  40. * @param[out] rep Pointer to a string to be filled with the encoded term. The
  41. * string is reallocated and, if reused for multiple calls to this function,
  42. * it only needs to be freed after the last call. It should be initialized to
  43. * NULL at the beginning.
  44. *
  45. * @return LSUP_OK on successful encoding; <0 for other errors.
  46. */
  47. typedef LSUP_rc (*term_enc_fn_t)(
  48. const LSUP_Term *term, const LSUP_NSMap *nsm, char **rep);
  49. /** @brief Initialize a graph encoding loop.
  50. *
  51. * This prototype is to be implemented by graph encoding loops. It should
  52. * create an iterator and perform all initial setup for finding triples.
  53. *
  54. * Implementations MUST set the "codec" member of the iterator to the address
  55. * of the codec that generated it.
  56. *
  57. * @param[in] gr The graph to be encoded. The graph's namespace map is used by
  58. * the codec for namespace prefixing. The graph may only be freed after the
  59. * loop is finalized.
  60. *
  61. * @return A codec iterator handle to be passed to a #gr_encode_iter_fn_t
  62. * function and, eventually, to a #gr_encode_done_fn_t function. This
  63. * structure is opaque and defined by each codec according to its own needs.
  64. */
  65. typedef void * (*gr_encode_init_fn_t)(const LSUP_Graph *gr);
  66. /** @brief Perform one encoding iteration.
  67. *
  68. * Implementations of this prototype MUST perform all the steps to encode one
  69. * or more complete triples into an RDF fragment representing those triples.
  70. * The input and output units are up to the implementation and a caller SHOULD
  71. * assume that multiple lines may be yielded at each iteration.
  72. *
  73. * @param[in] it Iterator handle.
  74. *
  75. * @param[out] res Handle to be populated with a string obtained from encoding.
  76. * The output data should be UTF-8 encoded. This pointer must be initialized
  77. * (even to NULL) and should be eventually freed manually at the end of the
  78. * loop. It is reallocated at each iteration, so memory from a previous
  79. * iteration may be overwritten with new data.
  80. *
  81. * @return LSUP_OK if a new token was processed; LSUP_END if the end of the
  82. * loop was reached.
  83. */
  84. typedef LSUP_rc (*gr_encode_iter_fn_t)(void *it, char **res);
  85. /** @brief Finalize an encoding operation.
  86. *
  87. * Implementations SHOULD use this function to perform all necessary steps to
  88. * clean up memory and free the iterator handle after a graph has been
  89. * completely encoded.
  90. *
  91. * @param[in] it Iterator handle.
  92. */
  93. typedef void (*gr_encode_done_fn_t)(void *it);
  94. /** @brief Prototype for decoding a string into a LSUP_Term.
  95. *
  96. * Implementations MAY ignore any other tokens after finding the first one.
  97. *
  98. * @param[in] rep NT representation of the term.
  99. *
  100. * @param[in] nsm Namespace map handle.
  101. *
  102. * @param[out] Pointer to the term handle to be created. Implementaions SHOULD
  103. * return NULL on a parse error.
  104. *
  105. * @return Implementations MUST return LSUP_OK on success and a negative value
  106. * on parsing error.
  107. */
  108. typedef LSUP_rc (*term_decode_fn_t)(
  109. const char *rep, const LSUP_NSMap *nsm, LSUP_Term **term);
  110. /** @brief Prototype for decoding a complete RDF document into a graph.
  111. *
  112. * Implementations SHOULD consume data from the file handle in chunks.
  113. *
  114. * @param[in] rep Open file handle pointing to the RDF data. Implementations
  115. * MUST NOT close the file handle.
  116. *
  117. * @param[out] gr Pointer to a graph handle to be generated from decoding.
  118. *
  119. * @param[out] ct If not NULL, it may be populated with the number of triples
  120. * parsed (which may be different from the resulting graph size).
  121. * Implementations may choose not not use this, and they must account for the
  122. * value to be NULL.
  123. *
  124. * @param[out] err Pointer to error info string. If no error occurs, it yields
  125. * NULL.
  126. *
  127. * @return Implementations MUST return LSUP_OK on success and a negative value
  128. * on parsing error.
  129. */
  130. typedef LSUP_rc (*gr_decode_fn_t)(
  131. FILE *rep, LSUP_Graph **gr, size_t *ct, char **err);
  132. /** @brief Codec structure.
  133. *
  134. * An instance of this structure is usually defined at compile time (see
  135. * examples in "include/codec_*.h" and "src/codec_*.c") and should have the
  136. * following defined:
  137. *
  138. * - name: A brief (16-char max), human-readable to identify the codec.
  139. * - mimetype: MIME type (32-char max) associated with the codec.
  140. * - extension: File extension associated with the serialized file.
  141. *
  142. * - encode_term: Encode a single term.
  143. *
  144. * - encode_graph_init: Initialize a graph decoding loop.
  145. * - encode_graph_iter: Run one iteration of encoding on one or more triples.
  146. * - encode_graph_done: Finalize the encoding loop and free the support data.
  147. *
  148. * - decode_term: Decode a single term.
  149. * - decode_graph: Decode a RDF document into a graph.
  150. *
  151. * For documentation on the individual encoding and decoding callbacks, see the
  152. * related function prototypes.
  153. */
  154. struct codec_t {
  155. char name[16]; // Name of the codec.
  156. char mimetype[32]; // MIME type associated with the codec.
  157. char extension[8]; // Serialized file extension.
  158. // Encoding.
  159. term_enc_fn_t encode_term; // Term encoder function.
  160. gr_encode_init_fn_t encode_graph_init; // Graph encoder initialization.
  161. gr_encode_iter_fn_t encode_graph_iter; // Graph encoder iteration.
  162. gr_encode_done_fn_t encode_graph_done; // Graph encoder finalization.
  163. // Decoding.
  164. term_decode_fn_t decode_term; // Term decoder function.
  165. gr_decode_fn_t decode_graph; // Graph decoder function.
  166. };
  167. /*
  168. * Common utility functions.
  169. */
  170. /** @brief strdup() for unsigned char.
  171. *
  172. * This is to be used with uint8_t sequences considered to be UTF-8 sequences,
  173. * requird by re2c (it won't work with byte sequences containing `NUL`).
  174. */
  175. inline uint8_t
  176. *uint8_dup (const uint8_t *str)
  177. { return (uint8_t *) strdup ((char *) str); }
  178. /** @brief strndup() for unsigned char.
  179. *
  180. * This is to be used with uint8_t sequences considered to be UTF-8 sequences,
  181. * requird by re2c (it won't work with byte sequences containing `NUL`).
  182. */
  183. inline uint8_t
  184. *uint8_ndup (const uint8_t *str, size_t size)
  185. { return (uint8_t *) strndup ((char *) str, size); }
  186. /** @brief Add escape character (backslash) to illegal literal characters.
  187. *
  188. * @param[in] in Input string.
  189. *
  190. * @param[out] out Output string.
  191. *
  192. * @return LSUP_OK on success; LSUP_MEM_ERR on memory error.
  193. */
  194. LSUP_rc
  195. escape_lit (const char *in, char **out);
  196. /** @brief Replace non-printable characters with their literal byte.
  197. *
  198. * Escape backslash is to be added separately.
  199. */
  200. static inline char
  201. escape_char (const char c) {
  202. switch (c) {
  203. case '\t': return 't';
  204. case '\b': return 'b';
  205. case '\n': return 'n';
  206. case '\r': return 'r';
  207. case '\f': return 'f';
  208. default: return c;
  209. }
  210. }
  211. /** @brief Unescape a single character.
  212. *
  213. * Convert escaped special characters such as `\t`, `\n`, etc. into their
  214. * corresponding code points.
  215. *
  216. * Non-special characters are returned unchanged.
  217. *
  218. * @param[in] c Character to unescape. Note that this is the single character
  219. * after `\`.
  220. *
  221. * @return Code point corresponding to the escaped character.
  222. */
  223. inline char
  224. unescape_char (const char c)
  225. {
  226. switch (c) {
  227. case 't': return '\t';
  228. case 'b': return '\b';
  229. case 'n': return '\n';
  230. case 'r': return '\r';
  231. case 'f': return '\f';
  232. default: return c;
  233. }
  234. }
  235. /** @brief Replace `\uxxxx` and `\Uxxxxxxxx` with Unicode bytes.
  236. *
  237. * @param[in] esc_str Escaped string.
  238. *
  239. * @param[in] size Maximum number of characters to scan, à la strncpy().
  240. *
  241. * @return String with escape sequences replaced by Unicode bytes.
  242. */
  243. uint8_t *unescape_unicode (const uint8_t *esc_str, size_t size);
  244. /** @brief Format an informational header.
  245. *
  246. * The information includes software version and current date. It is terminated
  247. * by a newline + NUL and prefixed with the string specified in `pfx`. It is
  248. * NOT prefixed by any comment characters.
  249. *
  250. * @param[in] pfx Prefix to add to the string. It may be a comment starter,
  251. * such as `# `.
  252. */
  253. char *fmt_header (char *pfx);
  254. #endif