misc.h 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446
  1. /*
  2. * Header for misc.c.
  3. */
  4. #ifndef PUTTY_MISC_H
  5. #define PUTTY_MISC_H
  6. #include "defs.h"
  7. #include "puttymem.h"
  8. #include "marshal.h"
  9. #include <stdio.h> /* for FILE * */
  10. #include <stdarg.h> /* for va_list */
  11. #include <stdlib.h> /* for abort */
  12. #include <time.h> /* for struct tm */
  13. #include <limits.h> /* for INT_MAX/MIN */
  14. #include <assert.h> /* for assert (obviously) */
  15. unsigned long parse_blocksize(const char *bs);
  16. char ctrlparse(char *s, char **next);
  17. size_t host_strcspn(const char *s, const char *set);
  18. char *host_strchr(const char *s, int c);
  19. char *host_strrchr(const char *s, int c);
  20. char *host_strduptrim(const char *s);
  21. char *dupstr(const char *s);
  22. char *dupcat_fn(const char *s1, ...);
  23. #define dupcat(...) dupcat_fn(__VA_ARGS__, (const char *)NULL)
  24. char *dupprintf(const char *fmt, ...) PRINTF_LIKE(1, 2);
  25. char *dupvprintf(const char *fmt, va_list ap);
  26. void burnstr(char *string);
  27. /*
  28. * The visible part of a strbuf structure. There's a surrounding
  29. * implementation struct in misc.c, which isn't exposed to client
  30. * code.
  31. */
  32. struct strbuf {
  33. char *s;
  34. unsigned char *u;
  35. size_t len;
  36. BinarySink_IMPLEMENTATION;
  37. };
  38. /* strbuf constructors: strbuf_new_nm and strbuf_new differ in that a
  39. * strbuf constructed using the _nm version will resize itself by
  40. * alloc/copy/smemclr/free instead of realloc. Use that version for
  41. * data sensitive enough that it's worth costing performance to
  42. * avoid copies of it lingering in process memory. */
  43. strbuf *strbuf_new(void);
  44. strbuf *strbuf_new_nm(void);
  45. void strbuf_free(strbuf *buf);
  46. void *strbuf_append(strbuf *buf, size_t len);
  47. void strbuf_shrink_to(strbuf *buf, size_t new_len);
  48. void strbuf_shrink_by(strbuf *buf, size_t amount_to_remove);
  49. char *strbuf_to_str(strbuf *buf); /* does free buf, but you must free result */
  50. void strbuf_catf(strbuf *buf, const char *fmt, ...) PRINTF_LIKE(2, 3);
  51. void strbuf_catfv(strbuf *buf, const char *fmt, va_list ap);
  52. static inline void strbuf_clear(strbuf *buf) { strbuf_shrink_to(buf, 0); }
  53. bool strbuf_chomp(strbuf *buf, char char_to_remove);
  54. strbuf *strbuf_new_for_agent_query(void);
  55. void strbuf_finalise_agent_query(strbuf *buf);
  56. /* String-to-Unicode converters that auto-allocate the destination and
  57. * work around the rather deficient interface of mb_to_wc.
  58. *
  59. * These actually live in miscucs.c, not misc.c (the distinction being
  60. * that the former is only linked into tools that also have the main
  61. * Unicode support). */
  62. wchar_t *dup_mb_to_wc_c(int codepage, int flags, const char *string, int len);
  63. wchar_t *dup_mb_to_wc(int codepage, int flags, const char *string);
  64. static inline int toint(unsigned u)
  65. {
  66. /*
  67. * Convert an unsigned to an int, without running into the
  68. * undefined behaviour which happens by the strict C standard if
  69. * the value overflows. You'd hope that sensible compilers would
  70. * do the sensible thing in response to a cast, but actually I
  71. * don't trust modern compilers not to do silly things like
  72. * assuming that _obviously_ you wouldn't have caused an overflow
  73. * and so they can elide an 'if (i < 0)' test immediately after
  74. * the cast.
  75. *
  76. * Sensible compilers ought of course to optimise this entire
  77. * function into 'just return the input value', and since it's
  78. * also declared inline, elide it completely in their output.
  79. */
  80. if (u <= (unsigned)INT_MAX)
  81. return (int)u;
  82. else if (u >= (unsigned)INT_MIN) /* wrap in cast _to_ unsigned is OK */
  83. return INT_MIN + (int)(u - (unsigned)INT_MIN);
  84. else
  85. return INT_MIN; /* fallback; should never occur on binary machines */
  86. }
  87. char *fgetline(FILE *fp);
  88. bool read_file_into(BinarySink *bs, FILE *fp);
  89. char *chomp(char *str);
  90. bool strstartswith(const char *s, const char *t);
  91. bool strendswith(const char *s, const char *t);
  92. void base64_encode_atom(const unsigned char *data, int n, char *out);
  93. int base64_decode_atom(const char *atom, unsigned char *out);
  94. struct bufchain_granule;
  95. struct bufchain_tag {
  96. struct bufchain_granule *head, *tail;
  97. size_t buffersize; /* current amount of buffered data */
  98. void (*queue_idempotent_callback)(IdempotentCallback *ic);
  99. IdempotentCallback *ic;
  100. };
  101. void bufchain_init(bufchain *ch);
  102. void bufchain_clear(bufchain *ch);
  103. size_t bufchain_size(bufchain *ch);
  104. void bufchain_add(bufchain *ch, const void *data, size_t len);
  105. ptrlen bufchain_prefix(bufchain *ch);
  106. void bufchain_consume(bufchain *ch, size_t len);
  107. void bufchain_fetch(bufchain *ch, void *data, size_t len);
  108. void bufchain_fetch_consume(bufchain *ch, void *data, size_t len);
  109. bool bufchain_try_fetch_consume(bufchain *ch, void *data, size_t len);
  110. size_t bufchain_fetch_consume_up_to(bufchain *ch, void *data, size_t len);
  111. void bufchain_set_callback_inner(
  112. bufchain *ch, IdempotentCallback *ic,
  113. void (*queue_idempotent_callback)(IdempotentCallback *ic));
  114. static inline void bufchain_set_callback(bufchain *ch, IdempotentCallback *ic)
  115. {
  116. extern void queue_idempotent_callback(struct IdempotentCallback *ic);
  117. /* Wrapper that puts in the standard queue_idempotent_callback
  118. * function. Lives here rather than in utils.c so that standalone
  119. * programs can use the bufchain facility without this optional
  120. * callback feature and not need to provide a stub of
  121. * queue_idempotent_callback. */
  122. bufchain_set_callback_inner(ch, ic, queue_idempotent_callback);
  123. }
  124. bool validate_manual_hostkey(char *key);
  125. struct tm ltime(void);
  126. /*
  127. * Special form of strcmp which can cope with NULL inputs. NULL is
  128. * defined to sort before even the empty string.
  129. */
  130. int nullstrcmp(const char *a, const char *b);
  131. static inline ptrlen make_ptrlen(const void *ptr, size_t len)
  132. {
  133. ptrlen pl;
  134. pl.ptr = ptr;
  135. pl.len = len;
  136. return pl;
  137. }
  138. static inline ptrlen ptrlen_from_asciz(const char *str)
  139. {
  140. return make_ptrlen(str, strlen(str));
  141. }
  142. static inline ptrlen ptrlen_from_strbuf(strbuf *sb)
  143. {
  144. return make_ptrlen(sb->u, sb->len);
  145. }
  146. bool ptrlen_eq_string(ptrlen pl, const char *str);
  147. bool ptrlen_eq_ptrlen(ptrlen pl1, ptrlen pl2);
  148. int ptrlen_strcmp(ptrlen pl1, ptrlen pl2);
  149. /* ptrlen_startswith and ptrlen_endswith write through their 'tail'
  150. * argument if and only if it is non-NULL and they return true. Hence
  151. * you can write ptrlen_startswith(thing, prefix, &thing), writing
  152. * back to the same ptrlen it read from, to remove a prefix if present
  153. * and say whether it did so. */
  154. bool ptrlen_startswith(ptrlen whole, ptrlen prefix, ptrlen *tail);
  155. bool ptrlen_endswith(ptrlen whole, ptrlen suffix, ptrlen *tail);
  156. ptrlen ptrlen_get_word(ptrlen *input, const char *separators);
  157. char *mkstr(ptrlen pl);
  158. int string_length_for_printf(size_t);
  159. /* Derive two printf arguments from a ptrlen, suitable for "%.*s" */
  160. #define PTRLEN_PRINTF(pl) \
  161. string_length_for_printf((pl).len), (const char *)(pl).ptr
  162. /* Make a ptrlen out of a compile-time string literal. We try to
  163. * enforce that it _is_ a string literal by token-pasting "" on to it,
  164. * which should provoke a compile error if it's any other kind of
  165. * string. */
  166. #define PTRLEN_LITERAL(stringlit) \
  167. TYPECHECK("" stringlit "", make_ptrlen(stringlit, sizeof(stringlit)-1))
  168. /* Make a ptrlen out of a compile-time string literal in a way that
  169. * allows you to declare the ptrlen itself as a compile-time initialiser. */
  170. #define PTRLEN_DECL_LITERAL(stringlit) \
  171. { TYPECHECK("" stringlit "", stringlit), sizeof(stringlit)-1 }
  172. /* Make a ptrlen out of a constant byte array. */
  173. #define PTRLEN_FROM_CONST_BYTES(a) make_ptrlen(a, sizeof(a))
  174. /* Wipe sensitive data out of memory that's about to be freed. Simpler
  175. * than memset because we don't need the fill char parameter; also
  176. * attempts (by fiddly use of volatile) to inhibit the compiler from
  177. * over-cleverly trying to optimise the memset away because it knows
  178. * the variable is going out of scope. */
  179. void smemclr(void *b, size_t len);
  180. /* Compare two fixed-length chunks of memory for equality, without
  181. * data-dependent control flow (so an attacker with a very accurate
  182. * stopwatch can't try to guess where the first mismatching byte was).
  183. * Returns false for mismatch or true for equality (unlike memcmp),
  184. * hinted at by the 'eq' in the name. */
  185. bool smemeq(const void *av, const void *bv, size_t len);
  186. /* Encode a single UTF-8 character. Assumes that illegal characters
  187. * (such as things in the surrogate range, or > 0x10FFFF) have already
  188. * been removed. */
  189. size_t encode_utf8(void *output, unsigned long ch);
  190. char *buildinfo(const char *newline);
  191. /*
  192. * A function you can put at points in the code where execution should
  193. * never reach in the first place. Better than assert(false), or even
  194. * assert(false && "some explanatory message"), because some compilers
  195. * don't interpret assert(false) as a declaration of unreachability,
  196. * so they may still warn about pointless things like some variable
  197. * not being initialised on the unreachable code path.
  198. *
  199. * I follow the assertion with a call to abort() just in case someone
  200. * compiles with -DNDEBUG, and I wrap that abort inside my own
  201. * function labelled NORETURN just in case some unusual kind of system
  202. * header wasn't foresighted enough to label abort() itself that way.
  203. */
  204. static inline NORETURN void unreachable_internal(void) {
  205. #ifndef WINSCP_VS
  206. // Not to try to link to VS abort
  207. abort();
  208. #endif
  209. }
  210. #define unreachable(msg) (assert(false && msg), unreachable_internal())
  211. /*
  212. * Debugging functions.
  213. *
  214. * Output goes to debug.log
  215. *
  216. * debug() is like printf().
  217. *
  218. * dmemdump() and dmemdumpl() both do memory dumps. The difference
  219. * is that dmemdumpl() is more suited for when the memory address is
  220. * important (say because you'll be recording pointer values later
  221. * on). dmemdump() is more concise.
  222. */
  223. #ifdef DEBUG
  224. void debug_printf(const char *fmt, ...) PRINTF_LIKE(1, 2);
  225. void debug_memdump(const void *buf, int len, bool L);
  226. #define debug(...) (debug_printf(__VA_ARGS__))
  227. #define dmemdump(buf,len) (debug_memdump(buf, len, false))
  228. #define dmemdumpl(buf,len) (debug_memdump(buf, len, true))
  229. #else
  230. #define debug(...) ((void)0)
  231. #define dmemdump(buf,len) ((void)0)
  232. #define dmemdumpl(buf,len) ((void)0)
  233. #endif
  234. #ifndef lenof
  235. #define lenof(x) ( (sizeof((x))) / (sizeof(*(x))))
  236. #endif
  237. #ifndef min
  238. #define min(x,y) ( (x) < (y) ? (x) : (y) )
  239. #endif
  240. #ifndef max
  241. #define max(x,y) ( (x) > (y) ? (x) : (y) )
  242. #endif
  243. static inline uint64_t GET_64BIT_LSB_FIRST(const void *vp)
  244. {
  245. const uint8_t *p = (const uint8_t *)vp;
  246. return (((uint64_t)p[0] ) | ((uint64_t)p[1] << 8) |
  247. ((uint64_t)p[2] << 16) | ((uint64_t)p[3] << 24) |
  248. ((uint64_t)p[4] << 32) | ((uint64_t)p[5] << 40) |
  249. ((uint64_t)p[6] << 48) | ((uint64_t)p[7] << 56));
  250. }
  251. static inline void PUT_64BIT_LSB_FIRST(void *vp, uint64_t value)
  252. {
  253. uint8_t *p = (uint8_t *)vp;
  254. p[0] = (uint8_t)(value);
  255. p[1] = (uint8_t)(value >> 8);
  256. p[2] = (uint8_t)(value >> 16);
  257. p[3] = (uint8_t)(value >> 24);
  258. p[4] = (uint8_t)(value >> 32);
  259. p[5] = (uint8_t)(value >> 40);
  260. p[6] = (uint8_t)(value >> 48);
  261. p[7] = (uint8_t)(value >> 56);
  262. }
  263. static inline uint32_t GET_32BIT_LSB_FIRST(const void *vp)
  264. {
  265. const uint8_t *p = (const uint8_t *)vp;
  266. return (((uint32_t)p[0] ) | ((uint32_t)p[1] << 8) |
  267. ((uint32_t)p[2] << 16) | ((uint32_t)p[3] << 24));
  268. }
  269. static inline void PUT_32BIT_LSB_FIRST(void *vp, uint32_t value)
  270. {
  271. uint8_t *p = (uint8_t *)vp;
  272. p[0] = (uint8_t)(value);
  273. p[1] = (uint8_t)(value >> 8);
  274. p[2] = (uint8_t)(value >> 16);
  275. p[3] = (uint8_t)(value >> 24);
  276. }
  277. static inline uint16_t GET_16BIT_LSB_FIRST(const void *vp)
  278. {
  279. const uint8_t *p = (const uint8_t *)vp;
  280. return (((uint16_t)p[0] ) | ((uint16_t)p[1] << 8));
  281. }
  282. static inline void PUT_16BIT_LSB_FIRST(void *vp, uint16_t value)
  283. {
  284. uint8_t *p = (uint8_t *)vp;
  285. p[0] = (uint8_t)(value);
  286. p[1] = (uint8_t)(value >> 8);
  287. }
  288. static inline uint64_t GET_64BIT_MSB_FIRST(const void *vp)
  289. {
  290. const uint8_t *p = (const uint8_t *)vp;
  291. return (((uint64_t)p[7] ) | ((uint64_t)p[6] << 8) |
  292. ((uint64_t)p[5] << 16) | ((uint64_t)p[4] << 24) |
  293. ((uint64_t)p[3] << 32) | ((uint64_t)p[2] << 40) |
  294. ((uint64_t)p[1] << 48) | ((uint64_t)p[0] << 56));
  295. }
  296. static inline void PUT_64BIT_MSB_FIRST(void *vp, uint64_t value)
  297. {
  298. uint8_t *p = (uint8_t *)vp;
  299. p[7] = (uint8_t)(value);
  300. p[6] = (uint8_t)(value >> 8);
  301. p[5] = (uint8_t)(value >> 16);
  302. p[4] = (uint8_t)(value >> 24);
  303. p[3] = (uint8_t)(value >> 32);
  304. p[2] = (uint8_t)(value >> 40);
  305. p[1] = (uint8_t)(value >> 48);
  306. p[0] = (uint8_t)(value >> 56);
  307. }
  308. static inline uint32_t GET_32BIT_MSB_FIRST(const void *vp)
  309. {
  310. const uint8_t *p = (const uint8_t *)vp;
  311. return (((uint32_t)p[3] ) | ((uint32_t)p[2] << 8) |
  312. ((uint32_t)p[1] << 16) | ((uint32_t)p[0] << 24));
  313. }
  314. static inline void PUT_32BIT_MSB_FIRST(void *vp, uint32_t value)
  315. {
  316. uint8_t *p = (uint8_t *)vp;
  317. p[3] = (uint8_t)(value);
  318. p[2] = (uint8_t)(value >> 8);
  319. p[1] = (uint8_t)(value >> 16);
  320. p[0] = (uint8_t)(value >> 24);
  321. }
  322. static inline uint16_t GET_16BIT_MSB_FIRST(const void *vp)
  323. {
  324. const uint8_t *p = (const uint8_t *)vp;
  325. return (((uint16_t)p[1] ) | ((uint16_t)p[0] << 8));
  326. }
  327. static inline void PUT_16BIT_MSB_FIRST(void *vp, uint16_t value)
  328. {
  329. uint8_t *p = (uint8_t *)vp;
  330. p[1] = (uint8_t)(value);
  331. p[0] = (uint8_t)(value >> 8);
  332. }
  333. /* Replace NULL with the empty string, permitting an idiom in which we
  334. * get a string (pointer,length) pair that might be NULL,0 and can
  335. * then safely say things like printf("%.*s", length, NULLTOEMPTY(ptr)) */
  336. static inline const char *NULLTOEMPTY(const char *s)
  337. {
  338. return s ? s : "";
  339. }
  340. /* StripCtrlChars, defined in stripctrl.c: an adapter you can put on
  341. * the front of one BinarySink and which functions as one in turn.
  342. * Interprets its input as a stream of multibyte characters in the
  343. * system locale, and removes any that are not either printable
  344. * characters or newlines. */
  345. struct StripCtrlChars {
  346. BinarySink_IMPLEMENTATION;
  347. /* and this is contained in a larger structure */
  348. };
  349. StripCtrlChars *stripctrl_new(
  350. BinarySink *bs_out, bool permit_cr, wchar_t substitution);
  351. StripCtrlChars *stripctrl_new_term_fn(
  352. BinarySink *bs_out, bool permit_cr, wchar_t substitution,
  353. Terminal *term, unsigned long (*translate)(
  354. Terminal *, term_utf8_decode *, unsigned char));
  355. #define stripctrl_new_term(bs, cr, sub, term) \
  356. stripctrl_new_term_fn(bs, cr, sub, term, term_translate)
  357. void stripctrl_retarget(StripCtrlChars *sccpub, BinarySink *new_bs_out);
  358. void stripctrl_reset(StripCtrlChars *sccpub);
  359. void stripctrl_free(StripCtrlChars *sanpub);
  360. void stripctrl_enable_line_limiting(StripCtrlChars *sccpub);
  361. #ifndef WINSCP
  362. char *stripctrl_string_ptrlen(StripCtrlChars *sccpub, ptrlen str);
  363. static inline char *stripctrl_string(StripCtrlChars *sccpub, const char *str)
  364. {
  365. return stripctrl_string_ptrlen(sccpub, ptrlen_from_asciz(str));
  366. }
  367. #endif
  368. #ifdef MPEXT
  369. // Recent PuTTY code uses C99 standard that allows code before initialization.
  370. // Frequently that code are assertions. This assert implementation allows being used before code.
  371. #define pinitassert(P) const int __assert_dummy = 1/((int)(P))
  372. #endif
  373. /*
  374. * A mechanism for loading a file from disk into a memory buffer where
  375. * it can be picked apart as a BinarySource.
  376. */
  377. struct LoadedFile {
  378. char *data;
  379. size_t len, max_size;
  380. BinarySource_IMPLEMENTATION;
  381. };
  382. typedef enum {
  383. LF_OK, /* file loaded successfully */
  384. LF_TOO_BIG, /* file didn't fit in buffer */
  385. LF_ERROR, /* error from stdio layer */
  386. } LoadFileStatus;
  387. /* Set the memory block of 'size' bytes at 'out' to the bitwise XOR of
  388. * the two blocks of the same size at 'in1' and 'in2'.
  389. *
  390. * 'out' may point to exactly the same address as one of the inputs,
  391. * but if the input and output blocks overlap in any other way, the
  392. * result of this function is not guaranteed. No memmove-style effort
  393. * is made to handle difficult overlap cases. */
  394. void memxor(uint8_t *out, const uint8_t *in1, const uint8_t *in2, size_t size);
  395. #endif