| Absolute File Name: | /home/opencoverage/opencoverage/guest-scripts/libressl/src/crypto/x509/x509_obj.c |
| Source code | Switch to Preprocessed file |
| Line | Source | Count | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | /* $OpenBSD: x509_obj.c,v 1.18 2018/05/18 18:19:31 tb Exp $ */ | - | ||||||||||||
| 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | - | ||||||||||||
| 3 | * All rights reserved. | - | ||||||||||||
| 4 | * | - | ||||||||||||
| 5 | * This package is an SSL implementation written | - | ||||||||||||
| 6 | * by Eric Young (eay@cryptsoft.com). | - | ||||||||||||
| 7 | * The implementation was written so as to conform with Netscapes SSL. | - | ||||||||||||
| 8 | * | - | ||||||||||||
| 9 | * This library is free for commercial and non-commercial use as long as | - | ||||||||||||
| 10 | * the following conditions are aheared to. The following conditions | - | ||||||||||||
| 11 | * apply to all code found in this distribution, be it the RC4, RSA, | - | ||||||||||||
| 12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | - | ||||||||||||
| 13 | * included with this distribution is covered by the same copyright terms | - | ||||||||||||
| 14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | - | ||||||||||||
| 15 | * | - | ||||||||||||
| 16 | * Copyright remains Eric Young's, and as such any Copyright notices in | - | ||||||||||||
| 17 | * the code are not to be removed. | - | ||||||||||||
| 18 | * If this package is used in a product, Eric Young should be given attribution | - | ||||||||||||
| 19 | * as the author of the parts of the library used. | - | ||||||||||||
| 20 | * This can be in the form of a textual message at program startup or | - | ||||||||||||
| 21 | * in documentation (online or textual) provided with the package. | - | ||||||||||||
| 22 | * | - | ||||||||||||
| 23 | * Redistribution and use in source and binary forms, with or without | - | ||||||||||||
| 24 | * modification, are permitted provided that the following conditions | - | ||||||||||||
| 25 | * are met: | - | ||||||||||||
| 26 | * 1. Redistributions of source code must retain the copyright | - | ||||||||||||
| 27 | * notice, this list of conditions and the following disclaimer. | - | ||||||||||||
| 28 | * 2. Redistributions in binary form must reproduce the above copyright | - | ||||||||||||
| 29 | * notice, this list of conditions and the following disclaimer in the | - | ||||||||||||
| 30 | * documentation and/or other materials provided with the distribution. | - | ||||||||||||
| 31 | * 3. All advertising materials mentioning features or use of this software | - | ||||||||||||
| 32 | * must display the following acknowledgement: | - | ||||||||||||
| 33 | * "This product includes cryptographic software written by | - | ||||||||||||
| 34 | * Eric Young (eay@cryptsoft.com)" | - | ||||||||||||
| 35 | * The word 'cryptographic' can be left out if the rouines from the library | - | ||||||||||||
| 36 | * being used are not cryptographic related :-). | - | ||||||||||||
| 37 | * 4. If you include any Windows specific code (or a derivative thereof) from | - | ||||||||||||
| 38 | * the apps directory (application code) you must include an acknowledgement: | - | ||||||||||||
| 39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | - | ||||||||||||
| 40 | * | - | ||||||||||||
| 41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | - | ||||||||||||
| 42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | - | ||||||||||||
| 43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | - | ||||||||||||
| 44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | - | ||||||||||||
| 45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | - | ||||||||||||
| 46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | - | ||||||||||||
| 47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | - | ||||||||||||
| 48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | - | ||||||||||||
| 49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | - | ||||||||||||
| 50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | - | ||||||||||||
| 51 | * SUCH DAMAGE. | - | ||||||||||||
| 52 | * | - | ||||||||||||
| 53 | * The licence and distribution terms for any publically available version or | - | ||||||||||||
| 54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | - | ||||||||||||
| 55 | * copied and put under another distribution licence | - | ||||||||||||
| 56 | * [including the GNU Public Licence.] | - | ||||||||||||
| 57 | */ | - | ||||||||||||
| 58 | - | |||||||||||||
| 59 | #include <stdio.h> | - | ||||||||||||
| 60 | #include <string.h> | - | ||||||||||||
| 61 | - | |||||||||||||
| 62 | #include <openssl/buffer.h> | - | ||||||||||||
| 63 | #include <openssl/err.h> | - | ||||||||||||
| 64 | #include <openssl/lhash.h> | - | ||||||||||||
| 65 | #include <openssl/objects.h> | - | ||||||||||||
| 66 | #include <openssl/x509.h> | - | ||||||||||||
| 67 | - | |||||||||||||
| 68 | char * | - | ||||||||||||
| 69 | X509_NAME_oneline(const X509_NAME *a, char *buf, int len) | - | ||||||||||||
| 70 | { | - | ||||||||||||
| 71 | X509_NAME_ENTRY *ne; | - | ||||||||||||
| 72 | int i; | - | ||||||||||||
| 73 | int n, lold, l, l1, l2, num, j, type; | - | ||||||||||||
| 74 | const char *s; | - | ||||||||||||
| 75 | char *p; | - | ||||||||||||
| 76 | unsigned char *q; | - | ||||||||||||
| 77 | BUF_MEM *b = NULL; | - | ||||||||||||
| 78 | static const char hex[17] = "0123456789ABCDEF"; | - | ||||||||||||
| 79 | int gs_doit[4]; | - | ||||||||||||
| 80 | char tmp_buf[80]; | - | ||||||||||||
| 81 | - | |||||||||||||
| 82 | if (buf == NULL) {
| 38-233 | ||||||||||||
| 83 | if ((b = BUF_MEM_new()) == NULL)
| 0-233 | ||||||||||||
| 84 | goto err; never executed: goto err; | 0 | ||||||||||||
| 85 | if (!BUF_MEM_grow(b, 200))
| 0-233 | ||||||||||||
| 86 | goto err; never executed: goto err; | 0 | ||||||||||||
| 87 | b->data[0] = '\0'; | - | ||||||||||||
| 88 | len = 200; | - | ||||||||||||
| 89 | } executed 233 times by 7 tests: end of blockExecuted by:
| 233 | ||||||||||||
| 90 | if (a == NULL) {
| 0-271 | ||||||||||||
| 91 | if (b) {
| 0 | ||||||||||||
| 92 | buf = b->data; | - | ||||||||||||
| 93 | free(b); | - | ||||||||||||
| 94 | } never executed: end of block | 0 | ||||||||||||
| 95 | strlcpy(buf, "NO X509_NAME", len); | - | ||||||||||||
| 96 | return buf; never executed: return buf; | 0 | ||||||||||||
| 97 | } | - | ||||||||||||
| 98 | - | |||||||||||||
| 99 | len--; /* space for '\0' */ | - | ||||||||||||
| 100 | l = 0; | - | ||||||||||||
| 101 | for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) {
| 271-1078 | ||||||||||||
| 102 | ne = sk_X509_NAME_ENTRY_value(a->entries, i); | - | ||||||||||||
| 103 | n = OBJ_obj2nid(ne->object); | - | ||||||||||||
| 104 | if ((n == NID_undef) || ((s = OBJ_nid2sn(n)) == NULL)) {
| 0-1078 | ||||||||||||
| 105 | i2t_ASN1_OBJECT(tmp_buf, sizeof(tmp_buf), ne->object); | - | ||||||||||||
| 106 | s = tmp_buf; | - | ||||||||||||
| 107 | } never executed: end of block | 0 | ||||||||||||
| 108 | l1 = strlen(s); | - | ||||||||||||
| 109 | - | |||||||||||||
| 110 | type = ne->value->type; | - | ||||||||||||
| 111 | num = ne->value->length; | - | ||||||||||||
| 112 | q = ne->value->data; | - | ||||||||||||
| 113 | if ((type == V_ASN1_GENERALSTRING) && ((num % 4) == 0)) {
| 0-1078 | ||||||||||||
| 114 | gs_doit[0] = gs_doit[1] = gs_doit[2] = gs_doit[3] = 0; | - | ||||||||||||
| 115 | for (j = 0; j < num; j++)
| 0 | ||||||||||||
| 116 | if (q[j] != 0)
| 0 | ||||||||||||
| 117 | gs_doit[j & 3] = 1; never executed: gs_doit[j & 3] = 1; | 0 | ||||||||||||
| 118 | - | |||||||||||||
| 119 | if (gs_doit[0]|gs_doit[1]|gs_doit[2])
| 0 | ||||||||||||
| 120 | gs_doit[0] = gs_doit[1] = gs_doit[2] = gs_doit[3] = 1; never executed: gs_doit[0] = gs_doit[1] = gs_doit[2] = gs_doit[3] = 1; | 0 | ||||||||||||
| 121 | else { | - | ||||||||||||
| 122 | gs_doit[0] = gs_doit[1] = gs_doit[2] = 0; | - | ||||||||||||
| 123 | gs_doit[3] = 1; | - | ||||||||||||
| 124 | } never executed: end of block | 0 | ||||||||||||
| 125 | } else | - | ||||||||||||
| 126 | gs_doit[0] = gs_doit[1] = gs_doit[2] = gs_doit[3] = 1; executed 1078 times by 7 tests: gs_doit[0] = gs_doit[1] = gs_doit[2] = gs_doit[3] = 1;Executed by:
| 1078 | ||||||||||||
| 127 | - | |||||||||||||
| 128 | for (l2 = j=0; j < num; j++) {
| 1078-15852 | ||||||||||||
| 129 | if (!gs_doit[j&3])
| 0-15852 | ||||||||||||
| 130 | continue; never executed: continue; | 0 | ||||||||||||
| 131 | l2++; | - | ||||||||||||
| 132 | if ((q[j] < ' ') || (q[j] > '~'))
| 0-15852 | ||||||||||||
| 133 | l2 += 3; never executed: l2 += 3; | 0 | ||||||||||||
| 134 | } executed 15852 times by 7 tests: end of blockExecuted by:
| 15852 | ||||||||||||
| 135 | - | |||||||||||||
| 136 | lold = l; | - | ||||||||||||
| 137 | l += 1 + l1 + 1 + l2; | - | ||||||||||||
| 138 | if (b != NULL) {
| 152-926 | ||||||||||||
| 139 | if (!BUF_MEM_grow(b, l + 1))
| 0-926 | ||||||||||||
| 140 | goto err; never executed: goto err; | 0 | ||||||||||||
| 141 | p = &(b->data[lold]); | - | ||||||||||||
| 142 | } else if (l > len) { executed 926 times by 7 tests: end of blockExecuted by:
| 0-926 | ||||||||||||
| 143 | break; never executed: break; | 0 | ||||||||||||
| 144 | } else | - | ||||||||||||
| 145 | p = &(buf[lold]); executed 152 times by 1 test: p = &(buf[lold]);Executed by:
| 152 | ||||||||||||
| 146 | *(p++) = '/'; | - | ||||||||||||
| 147 | memcpy(p, s, l1); | - | ||||||||||||
| 148 | p += l1; | - | ||||||||||||
| 149 | *(p++) = '='; | - | ||||||||||||
| 150 | q = ne->value->data; | - | ||||||||||||
| 151 | for (j = 0; j < num; j++) {
| 1078-15852 | ||||||||||||
| 152 | if (!gs_doit[j & 3])
| 0-15852 | ||||||||||||
| 153 | continue; never executed: continue; | 0 | ||||||||||||
| 154 | n = q[j]; | - | ||||||||||||
| 155 | if ((n < ' ') || (n > '~')) {
| 0-15852 | ||||||||||||
| 156 | *(p++) = '\\'; | - | ||||||||||||
| 157 | *(p++) = 'x'; | - | ||||||||||||
| 158 | *(p++) = hex[(n >> 4) & 0x0f]; | - | ||||||||||||
| 159 | *(p++) = hex[n & 0x0f]; | - | ||||||||||||
| 160 | } else never executed: end of block | 0 | ||||||||||||
| 161 | *(p++) = n; executed 15852 times by 7 tests: *(p++) = n;Executed by:
| 15852 | ||||||||||||
| 162 | } | - | ||||||||||||
| 163 | *p = '\0'; | - | ||||||||||||
| 164 | } executed 1078 times by 7 tests: end of blockExecuted by:
| 1078 | ||||||||||||
| 165 | if (b != NULL) {
| 38-233 | ||||||||||||
| 166 | p = b->data; | - | ||||||||||||
| 167 | free(b); | - | ||||||||||||
| 168 | } else executed 233 times by 7 tests: end of blockExecuted by:
| 233 | ||||||||||||
| 169 | p = buf; executed 38 times by 1 test: p = buf;Executed by:
| 38 | ||||||||||||
| 170 | if (i == 0)
| 0-271 | ||||||||||||
| 171 | *p = '\0'; never executed: *p = '\0'; | 0 | ||||||||||||
| 172 | return (p); executed 271 times by 7 tests: return (p);Executed by:
| 271 | ||||||||||||
| 173 | - | |||||||||||||
| 174 | err: | - | ||||||||||||
| 175 | X509error(ERR_R_MALLOC_FAILURE); | - | ||||||||||||
| 176 | if (b != NULL)
| 0 | ||||||||||||
| 177 | BUF_MEM_free(b); never executed: BUF_MEM_free(b); | 0 | ||||||||||||
| 178 | return (NULL); never executed: return ( ((void *)0) ); | 0 | ||||||||||||
| 179 | } | - | ||||||||||||
| Source code | Switch to Preprocessed file |