test_suite_asn1write.function 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601
  1. /* BEGIN_HEADER */
  2. #include "mbedtls/asn1write.h"
  3. #define GUARD_LEN 4
  4. #define GUARD_VAL 0x2a
  5. typedef struct {
  6. unsigned char *output;
  7. unsigned char *start;
  8. unsigned char *end;
  9. unsigned char *p;
  10. size_t size;
  11. } generic_write_data_t;
  12. int generic_write_start_step(generic_write_data_t *data)
  13. {
  14. mbedtls_test_set_step(data->size);
  15. mbedtls_free(data->output);
  16. data->output = NULL;
  17. ASSERT_ALLOC(data->output, data->size == 0 ? 1 : data->size);
  18. data->end = data->output + data->size;
  19. data->p = data->end;
  20. data->start = data->end - data->size;
  21. return 1;
  22. exit:
  23. return 0;
  24. }
  25. int generic_write_finish_step(generic_write_data_t *data,
  26. const data_t *expected, int ret)
  27. {
  28. int ok = 0;
  29. if (data->size < expected->len) {
  30. TEST_EQUAL(ret, MBEDTLS_ERR_ASN1_BUF_TOO_SMALL);
  31. } else {
  32. TEST_EQUAL(ret, data->end - data->p);
  33. TEST_ASSERT(data->p >= data->start);
  34. TEST_ASSERT(data->p <= data->end);
  35. ASSERT_COMPARE(data->p, (size_t) (data->end - data->p),
  36. expected->x, expected->len);
  37. }
  38. ok = 1;
  39. exit:
  40. return ok;
  41. }
  42. /* END_HEADER */
  43. /* BEGIN_DEPENDENCIES
  44. * depends_on:MBEDTLS_ASN1_WRITE_C
  45. * END_DEPENDENCIES
  46. */
  47. /* BEGIN_CASE */
  48. void mbedtls_asn1_write_null(data_t *expected)
  49. {
  50. generic_write_data_t data = { NULL, NULL, NULL, NULL, 0 };
  51. int ret;
  52. for (data.size = 0; data.size <= expected->len + 1; data.size++) {
  53. if (!generic_write_start_step(&data)) {
  54. goto exit;
  55. }
  56. ret = mbedtls_asn1_write_null(&data.p, data.start);
  57. if (!generic_write_finish_step(&data, expected, ret)) {
  58. goto exit;
  59. }
  60. /* There's no parsing function for NULL. */
  61. }
  62. exit:
  63. mbedtls_free(data.output);
  64. }
  65. /* END_CASE */
  66. /* BEGIN_CASE */
  67. void mbedtls_asn1_write_bool(int val, data_t *expected)
  68. {
  69. generic_write_data_t data = { NULL, NULL, NULL, NULL, 0 };
  70. int ret;
  71. for (data.size = 0; data.size <= expected->len + 1; data.size++) {
  72. if (!generic_write_start_step(&data)) {
  73. goto exit;
  74. }
  75. ret = mbedtls_asn1_write_bool(&data.p, data.start, val);
  76. if (!generic_write_finish_step(&data, expected, ret)) {
  77. goto exit;
  78. }
  79. #if defined(MBEDTLS_ASN1_PARSE_C)
  80. if (ret >= 0) {
  81. int read = 0xdeadbeef;
  82. TEST_EQUAL(mbedtls_asn1_get_bool(&data.p, data.end, &read), 0);
  83. TEST_EQUAL(val, read);
  84. }
  85. #endif /* MBEDTLS_ASN1_PARSE_C */
  86. }
  87. exit:
  88. mbedtls_free(data.output);
  89. }
  90. /* END_CASE */
  91. /* BEGIN_CASE */
  92. void mbedtls_asn1_write_int(int val, data_t *expected)
  93. {
  94. generic_write_data_t data = { NULL, NULL, NULL, NULL, 0 };
  95. int ret;
  96. for (data.size = 0; data.size <= expected->len + 1; data.size++) {
  97. if (!generic_write_start_step(&data)) {
  98. goto exit;
  99. }
  100. ret = mbedtls_asn1_write_int(&data.p, data.start, val);
  101. if (!generic_write_finish_step(&data, expected, ret)) {
  102. goto exit;
  103. }
  104. #if defined(MBEDTLS_ASN1_PARSE_C)
  105. if (ret >= 0) {
  106. int read = 0xdeadbeef;
  107. TEST_EQUAL(mbedtls_asn1_get_int(&data.p, data.end, &read), 0);
  108. TEST_EQUAL(val, read);
  109. }
  110. #endif /* MBEDTLS_ASN1_PARSE_C */
  111. }
  112. exit:
  113. mbedtls_free(data.output);
  114. }
  115. /* END_CASE */
  116. /* BEGIN_CASE */
  117. void mbedtls_asn1_write_enum(int val, data_t *expected)
  118. {
  119. generic_write_data_t data = { NULL, NULL, NULL, NULL, 0 };
  120. int ret;
  121. for (data.size = 0; data.size <= expected->len + 1; data.size++) {
  122. if (!generic_write_start_step(&data)) {
  123. goto exit;
  124. }
  125. ret = mbedtls_asn1_write_enum(&data.p, data.start, val);
  126. if (!generic_write_finish_step(&data, expected, ret)) {
  127. goto exit;
  128. }
  129. #if defined(MBEDTLS_ASN1_PARSE_C)
  130. if (ret >= 0) {
  131. int read = 0xdeadbeef;
  132. TEST_EQUAL(mbedtls_asn1_get_enum(&data.p, data.end, &read), 0);
  133. TEST_EQUAL(val, read);
  134. }
  135. #endif /* MBEDTLS_ASN1_PARSE_C */
  136. }
  137. exit:
  138. mbedtls_free(data.output);
  139. }
  140. /* END_CASE */
  141. /* BEGIN_CASE depends_on:MBEDTLS_BIGNUM_C */
  142. void mbedtls_asn1_write_mpi(data_t *val, data_t *expected)
  143. {
  144. generic_write_data_t data = { NULL, NULL, NULL, NULL, 0 };
  145. mbedtls_mpi mpi, read;
  146. int ret;
  147. mbedtls_mpi_init(&mpi);
  148. mbedtls_mpi_init(&read);
  149. TEST_ASSERT(mbedtls_mpi_read_binary(&mpi, val->x, val->len) == 0);
  150. for (data.size = 0; data.size <= expected->len + 1; data.size++) {
  151. if (!generic_write_start_step(&data)) {
  152. goto exit;
  153. }
  154. ret = mbedtls_asn1_write_mpi(&data.p, data.start, &mpi);
  155. if (!generic_write_finish_step(&data, expected, ret)) {
  156. goto exit;
  157. }
  158. #if defined(MBEDTLS_ASN1_PARSE_C)
  159. if (ret >= 0) {
  160. TEST_EQUAL(mbedtls_asn1_get_mpi(&data.p, data.end, &read), 0);
  161. TEST_EQUAL(0, mbedtls_mpi_cmp_mpi(&mpi, &read));
  162. }
  163. #endif /* MBEDTLS_ASN1_PARSE_C */
  164. /* Skip some intermediate lengths, they're boring. */
  165. if (expected->len > 10 && data.size == 8) {
  166. data.size = expected->len - 2;
  167. }
  168. }
  169. exit:
  170. mbedtls_mpi_free(&mpi);
  171. mbedtls_mpi_free(&read);
  172. mbedtls_free(data.output);
  173. }
  174. /* END_CASE */
  175. /* BEGIN_CASE */
  176. void mbedtls_asn1_write_string(int tag, data_t *content, data_t *expected)
  177. {
  178. generic_write_data_t data = { NULL, NULL, NULL, NULL, 0 };
  179. int ret;
  180. for (data.size = 0; data.size <= expected->len + 1; data.size++) {
  181. if (!generic_write_start_step(&data)) {
  182. goto exit;
  183. }
  184. switch (tag) {
  185. case MBEDTLS_ASN1_OCTET_STRING:
  186. ret = mbedtls_asn1_write_octet_string(
  187. &data.p, data.start, content->x, content->len);
  188. break;
  189. case MBEDTLS_ASN1_OID:
  190. ret = mbedtls_asn1_write_oid(
  191. &data.p, data.start,
  192. (const char *) content->x, content->len);
  193. break;
  194. case MBEDTLS_ASN1_UTF8_STRING:
  195. ret = mbedtls_asn1_write_utf8_string(
  196. &data.p, data.start,
  197. (const char *) content->x, content->len);
  198. break;
  199. case MBEDTLS_ASN1_PRINTABLE_STRING:
  200. ret = mbedtls_asn1_write_printable_string(
  201. &data.p, data.start,
  202. (const char *) content->x, content->len);
  203. break;
  204. case MBEDTLS_ASN1_IA5_STRING:
  205. ret = mbedtls_asn1_write_ia5_string(
  206. &data.p, data.start,
  207. (const char *) content->x, content->len);
  208. break;
  209. default:
  210. ret = mbedtls_asn1_write_tagged_string(
  211. &data.p, data.start, tag,
  212. (const char *) content->x, content->len);
  213. }
  214. if (!generic_write_finish_step(&data, expected, ret)) {
  215. goto exit;
  216. }
  217. /* There's no parsing function for octet or character strings. */
  218. /* Skip some intermediate lengths, they're boring. */
  219. if (expected->len > 10 && data.size == 8) {
  220. data.size = expected->len - 2;
  221. }
  222. }
  223. exit:
  224. mbedtls_free(data.output);
  225. }
  226. /* END_CASE */
  227. /* BEGIN_CASE */
  228. void mbedtls_asn1_write_algorithm_identifier(data_t *oid,
  229. int par_len,
  230. data_t *expected)
  231. {
  232. generic_write_data_t data = { NULL, NULL, NULL, NULL, 0 };
  233. int ret;
  234. #if defined(MBEDTLS_ASN1_PARSE_C)
  235. unsigned char *buf_complete = NULL;
  236. #endif /* MBEDTLS_ASN1_PARSE_C */
  237. for (data.size = 0; data.size <= expected->len + 1; data.size++) {
  238. if (!generic_write_start_step(&data)) {
  239. goto exit;
  240. }
  241. ret = mbedtls_asn1_write_algorithm_identifier(
  242. &data.p, data.start,
  243. (const char *) oid->x, oid->len, par_len);
  244. /* If params_len != 0, mbedtls_asn1_write_algorithm_identifier()
  245. * assumes that the parameters are already present in the buffer
  246. * and returns a length that accounts for this, but our test
  247. * data omits the parameters. */
  248. if (ret >= 0) {
  249. ret -= par_len;
  250. }
  251. if (!generic_write_finish_step(&data, expected, ret)) {
  252. goto exit;
  253. }
  254. #if defined(MBEDTLS_ASN1_PARSE_C)
  255. /* Only do a parse-back test if the parameters aren't too large for
  256. * a small-heap environment. The boundary is somewhat arbitrary. */
  257. if (ret >= 0 && par_len <= 1234) {
  258. mbedtls_asn1_buf alg = { 0, 0, NULL };
  259. mbedtls_asn1_buf params = { 0, 0, NULL };
  260. /* The writing function doesn't write the parameters unless
  261. * they're null: it only takes their length as input. But the
  262. * parsing function requires the parameters to be present.
  263. * Thus make up parameters. */
  264. size_t data_len = data.end - data.p;
  265. size_t len_complete = data_len + par_len;
  266. unsigned char expected_params_tag;
  267. size_t expected_params_len;
  268. ASSERT_ALLOC(buf_complete, len_complete);
  269. unsigned char *end_complete = buf_complete + len_complete;
  270. memcpy(buf_complete, data.p, data_len);
  271. if (par_len == 0) {
  272. /* mbedtls_asn1_write_algorithm_identifier() wrote a NULL */
  273. expected_params_tag = 0x05;
  274. expected_params_len = 0;
  275. } else if (par_len >= 2 && par_len < 2 + 128) {
  276. /* Write an OCTET STRING with a short length encoding */
  277. expected_params_tag = buf_complete[data_len] = 0x04;
  278. expected_params_len = par_len - 2;
  279. buf_complete[data_len + 1] = (unsigned char) expected_params_len;
  280. } else if (par_len >= 4 + 128 && par_len < 3 + 256 * 256) {
  281. /* Write an OCTET STRING with a two-byte length encoding */
  282. expected_params_tag = buf_complete[data_len] = 0x04;
  283. expected_params_len = par_len - 4;
  284. buf_complete[data_len + 1] = 0x82;
  285. buf_complete[data_len + 2] = (unsigned char) (expected_params_len >> 8);
  286. buf_complete[data_len + 3] = (unsigned char) (expected_params_len);
  287. } else {
  288. TEST_ASSERT(!"Bad test data: invalid length of ASN.1 element");
  289. }
  290. unsigned char *p = buf_complete;
  291. TEST_EQUAL(mbedtls_asn1_get_alg(&p, end_complete,
  292. &alg, &params), 0);
  293. TEST_EQUAL(alg.tag, MBEDTLS_ASN1_OID);
  294. ASSERT_COMPARE(alg.p, alg.len, oid->x, oid->len);
  295. TEST_EQUAL(params.tag, expected_params_tag);
  296. TEST_EQUAL(params.len, expected_params_len);
  297. mbedtls_free(buf_complete);
  298. buf_complete = NULL;
  299. }
  300. #endif /* MBEDTLS_ASN1_PARSE_C */
  301. }
  302. exit:
  303. mbedtls_free(data.output);
  304. #if defined(MBEDTLS_ASN1_PARSE_C)
  305. mbedtls_free(buf_complete);
  306. #endif /* MBEDTLS_ASN1_PARSE_C */
  307. }
  308. /* END_CASE */
  309. /* BEGIN_CASE depends_on:MBEDTLS_ASN1_PARSE_C */
  310. void mbedtls_asn1_write_len(int len, data_t *asn1, int buf_len,
  311. int result)
  312. {
  313. int ret;
  314. unsigned char buf[150];
  315. unsigned char *p;
  316. size_t i;
  317. size_t read_len;
  318. memset(buf, GUARD_VAL, sizeof(buf));
  319. p = buf + GUARD_LEN + buf_len;
  320. ret = mbedtls_asn1_write_len(&p, buf + GUARD_LEN, (size_t) len);
  321. TEST_ASSERT(ret == result);
  322. /* Check for buffer overwrite on both sides */
  323. for (i = 0; i < GUARD_LEN; i++) {
  324. TEST_ASSERT(buf[i] == GUARD_VAL);
  325. TEST_ASSERT(buf[GUARD_LEN + buf_len + i] == GUARD_VAL);
  326. }
  327. if (result >= 0) {
  328. TEST_ASSERT(p + asn1->len == buf + GUARD_LEN + buf_len);
  329. TEST_ASSERT(memcmp(p, asn1->x, asn1->len) == 0);
  330. /* Read back with mbedtls_asn1_get_len() to check */
  331. ret = mbedtls_asn1_get_len(&p, buf + GUARD_LEN + buf_len, &read_len);
  332. if (len == 0) {
  333. TEST_ASSERT(ret == 0);
  334. } else {
  335. /* Return will be MBEDTLS_ERR_ASN1_OUT_OF_DATA because the rest of
  336. * the buffer is missing
  337. */
  338. TEST_ASSERT(ret == MBEDTLS_ERR_ASN1_OUT_OF_DATA);
  339. }
  340. TEST_ASSERT(read_len == (size_t) len);
  341. TEST_ASSERT(p == buf + GUARD_LEN + buf_len);
  342. }
  343. }
  344. /* END_CASE */
  345. /* BEGIN_CASE */
  346. void test_asn1_write_bitstrings(data_t *bitstring, int bits,
  347. data_t *expected, int is_named)
  348. {
  349. generic_write_data_t data = { NULL, NULL, NULL, NULL, 0 };
  350. int ret;
  351. int (*func)(unsigned char **p, const unsigned char *start,
  352. const unsigned char *buf, size_t bits) =
  353. (is_named ? mbedtls_asn1_write_named_bitstring :
  354. mbedtls_asn1_write_bitstring);
  355. #if defined(MBEDTLS_ASN1_PARSE_C)
  356. unsigned char *masked_bitstring = NULL;
  357. #endif /* MBEDTLS_ASN1_PARSE_C */
  358. /* The API expects `bitstring->x` to contain `bits` bits. */
  359. size_t byte_length = (bits + 7) / 8;
  360. TEST_ASSERT(bitstring->len >= byte_length);
  361. #if defined(MBEDTLS_ASN1_PARSE_C)
  362. ASSERT_ALLOC(masked_bitstring, byte_length);
  363. if (byte_length != 0) {
  364. memcpy(masked_bitstring, bitstring->x, byte_length);
  365. if (bits % 8 != 0) {
  366. masked_bitstring[byte_length - 1] &= ~(0xff >> (bits % 8));
  367. }
  368. }
  369. size_t value_bits = bits;
  370. if (is_named) {
  371. /* In a named bit string, all trailing 0 bits are removed. */
  372. while (byte_length > 0 && masked_bitstring[byte_length - 1] == 0) {
  373. --byte_length;
  374. }
  375. value_bits = 8 * byte_length;
  376. if (byte_length > 0) {
  377. unsigned char last_byte = masked_bitstring[byte_length - 1];
  378. for (unsigned b = 1; b < 0xff && (last_byte & b) == 0; b <<= 1) {
  379. --value_bits;
  380. }
  381. }
  382. }
  383. #endif /* MBEDTLS_ASN1_PARSE_C */
  384. for (data.size = 0; data.size <= expected->len + 1; data.size++) {
  385. if (!generic_write_start_step(&data)) {
  386. goto exit;
  387. }
  388. ret = (*func)(&data.p, data.start, bitstring->x, bits);
  389. if (!generic_write_finish_step(&data, expected, ret)) {
  390. goto exit;
  391. }
  392. #if defined(MBEDTLS_ASN1_PARSE_C)
  393. if (ret >= 0) {
  394. mbedtls_asn1_bitstring read = { 0, 0, NULL };
  395. TEST_EQUAL(mbedtls_asn1_get_bitstring(&data.p, data.end,
  396. &read), 0);
  397. ASSERT_COMPARE(read.p, read.len,
  398. masked_bitstring, byte_length);
  399. TEST_EQUAL(read.unused_bits, 8 * byte_length - value_bits);
  400. }
  401. #endif /* MBEDTLS_ASN1_PARSE_C */
  402. }
  403. exit:
  404. mbedtls_free(data.output);
  405. #if defined(MBEDTLS_ASN1_PARSE_C)
  406. mbedtls_free(masked_bitstring);
  407. #endif /* MBEDTLS_ASN1_PARSE_C */
  408. }
  409. /* END_CASE */
  410. /* BEGIN_CASE */
  411. void store_named_data_find(data_t *oid0, data_t *oid1,
  412. data_t *oid2, data_t *oid3,
  413. data_t *needle, int from, int position)
  414. {
  415. data_t *oid[4] = { oid0, oid1, oid2, oid3 };
  416. mbedtls_asn1_named_data nd[] = {
  417. { { 0x06, 0, NULL }, { 0, 0, NULL }, NULL, 0 },
  418. { { 0x06, 0, NULL }, { 0, 0, NULL }, NULL, 0 },
  419. { { 0x06, 0, NULL }, { 0, 0, NULL }, NULL, 0 },
  420. { { 0x06, 0, NULL }, { 0, 0, NULL }, NULL, 0 },
  421. };
  422. mbedtls_asn1_named_data *pointers[ARRAY_LENGTH(nd) + 1];
  423. size_t i;
  424. mbedtls_asn1_named_data *head = NULL;
  425. mbedtls_asn1_named_data *found = NULL;
  426. for (i = 0; i < ARRAY_LENGTH(nd); i++) {
  427. pointers[i] = &nd[i];
  428. }
  429. pointers[ARRAY_LENGTH(nd)] = NULL;
  430. for (i = 0; i < ARRAY_LENGTH(nd); i++) {
  431. ASSERT_ALLOC(nd[i].oid.p, oid[i]->len);
  432. memcpy(nd[i].oid.p, oid[i]->x, oid[i]->len);
  433. nd[i].oid.len = oid[i]->len;
  434. nd[i].next = pointers[i+1];
  435. }
  436. head = pointers[from];
  437. found = mbedtls_asn1_store_named_data(&head,
  438. (const char *) needle->x,
  439. needle->len,
  440. NULL, 0);
  441. /* In any case, the existing list structure must be unchanged. */
  442. for (i = 0; i < ARRAY_LENGTH(nd); i++) {
  443. TEST_ASSERT(nd[i].next == pointers[i+1]);
  444. }
  445. if (position >= 0) {
  446. /* position should have been found and modified. */
  447. TEST_ASSERT(head == pointers[from]);
  448. TEST_ASSERT(found == pointers[position]);
  449. } else {
  450. /* A new entry should have been created. */
  451. TEST_ASSERT(found == head);
  452. TEST_ASSERT(head->next == pointers[from]);
  453. for (i = 0; i < ARRAY_LENGTH(nd); i++) {
  454. TEST_ASSERT(found != &nd[i]);
  455. }
  456. }
  457. exit:
  458. if (found != NULL && found == head && found != pointers[from]) {
  459. mbedtls_free(found->oid.p);
  460. mbedtls_free(found);
  461. }
  462. for (i = 0; i < ARRAY_LENGTH(nd); i++) {
  463. mbedtls_free(nd[i].oid.p);
  464. }
  465. }
  466. /* END_CASE */
  467. /* BEGIN_CASE */
  468. void store_named_data_val_found(int old_len, int new_len)
  469. {
  470. mbedtls_asn1_named_data nd =
  471. { { 0x06, 3, (unsigned char *) "OID" }, { 0, 0, NULL }, NULL, 0 };
  472. mbedtls_asn1_named_data *head = &nd;
  473. mbedtls_asn1_named_data *found = NULL;
  474. unsigned char *old_val = NULL;
  475. unsigned char *new_val = (unsigned char *) "new value";
  476. if (old_len != 0) {
  477. ASSERT_ALLOC(nd.val.p, (size_t) old_len);
  478. old_val = nd.val.p;
  479. nd.val.len = old_len;
  480. memset(old_val, 'x', old_len);
  481. }
  482. if (new_len <= 0) {
  483. new_len = -new_len;
  484. new_val = NULL;
  485. }
  486. found = mbedtls_asn1_store_named_data(&head, "OID", 3,
  487. new_val, new_len);
  488. TEST_ASSERT(head == &nd);
  489. TEST_ASSERT(found == head);
  490. if (new_val != NULL) {
  491. ASSERT_COMPARE(found->val.p, found->val.len,
  492. new_val, (size_t) new_len);
  493. }
  494. if (new_len == 0) {
  495. TEST_ASSERT(found->val.p == NULL);
  496. } else if (new_len == old_len) {
  497. TEST_ASSERT(found->val.p == old_val);
  498. } else {
  499. TEST_ASSERT(found->val.p != old_val);
  500. }
  501. exit:
  502. mbedtls_free(nd.val.p);
  503. }
  504. /* END_CASE */
  505. /* BEGIN_CASE */
  506. void store_named_data_val_new(int new_len, int set_new_val)
  507. {
  508. mbedtls_asn1_named_data *head = NULL;
  509. mbedtls_asn1_named_data *found = NULL;
  510. const unsigned char *oid = (unsigned char *) "OID";
  511. size_t oid_len = strlen((const char *) oid);
  512. const unsigned char *new_val = (unsigned char *) "new value";
  513. if (set_new_val == 0) {
  514. new_val = NULL;
  515. }
  516. found = mbedtls_asn1_store_named_data(&head,
  517. (const char *) oid, oid_len,
  518. new_val, (size_t) new_len);
  519. TEST_ASSERT(found != NULL);
  520. TEST_ASSERT(found == head);
  521. TEST_ASSERT(found->oid.p != oid);
  522. ASSERT_COMPARE(found->oid.p, found->oid.len, oid, oid_len);
  523. if (new_len == 0) {
  524. TEST_ASSERT(found->val.p == NULL);
  525. } else if (new_val == NULL) {
  526. TEST_ASSERT(found->val.p != NULL);
  527. } else {
  528. TEST_ASSERT(found->val.p != new_val);
  529. ASSERT_COMPARE(found->val.p, found->val.len,
  530. new_val, (size_t) new_len);
  531. }
  532. exit:
  533. if (found != NULL) {
  534. mbedtls_free(found->oid.p);
  535. mbedtls_free(found->val.p);
  536. }
  537. mbedtls_free(found);
  538. }
  539. /* END_CASE */