codec.h 9.4 KB

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