1 /*
2 * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3 * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without modification,
6 * are permitted provided that the following conditions are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright notice, this list of
9 * conditions and the following disclaimer.
10 *
11 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
12 * of conditions and the following disclaimer in the documentation and/or other materials
13 * provided with the distribution.
14 *
15 * 3. Neither the name of the copyright holder nor the names of its contributors may be used
16 * to endorse or promote products derived from this software without specific prior written
17 * permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
28 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
29 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31
32
33 #include <lt_net_resolv.h>
34 #include <string.h>
dump(unsigned char * s,int len)35 static void dump(unsigned char *s, int len) {
36 if (!s) return;
37 for (int i = 0; i < len; ++i) {
38 printf("%02x ", s[i]);
39 }
40 printf("\n");
41 }
42
DnCompTest(void)43 static int DnCompTest(void)
44 {
45 unsigned char comp_dn[100] = "example";
46 unsigned char *dnptrs[6] = {comp_dn, 0};
47 unsigned char **lastdnptr = &dnptrs[6];
48 int offset, ret;
49
50 offset = strlen((const char *)dnptrs[0])+1;
51 ret = dn_comp("x.y.z.example.com", comp_dn+offset, sizeof(comp_dn)-offset, dnptrs, lastdnptr);
52 dump(comp_dn+offset, ret);
53 ICUNIT_ASSERT_EQUAL(ret, 19, ret);
54 ICUNIT_ASSERT_EQUAL(dnptrs[1], comp_dn+offset, dnptrs[1]);
55
56 offset += ret+1;
57 ret = dn_comp("zz.example.com", comp_dn+offset, sizeof(comp_dn)-offset, dnptrs, lastdnptr);
58 dump(comp_dn+offset, ret);
59 ICUNIT_ASSERT_EQUAL(ret, 5, ret);
60 ICUNIT_ASSERT_EQUAL(dnptrs[2], comp_dn+offset, dnptrs[2]);
61
62 offset += ret+1;
63 ret = dn_comp("a.example.com", comp_dn+offset, sizeof(comp_dn)-offset, dnptrs, lastdnptr);
64 dump(comp_dn+offset, ret);
65 ICUNIT_ASSERT_EQUAL(ret, 4, ret);
66 ICUNIT_ASSERT_EQUAL(dnptrs[3], comp_dn+offset, dnptrs[3]);
67
68 offset += ret+1;
69 ret = dn_comp("example.com.cn", comp_dn+offset, sizeof(comp_dn)-offset, dnptrs, lastdnptr);
70 dump(comp_dn+offset, ret);
71 ICUNIT_ASSERT_EQUAL(ret, 16, ret);
72 ICUNIT_ASSERT_EQUAL(dnptrs[4], comp_dn+offset, dnptrs[4]);
73
74 offset += ret+1;
75 ret = dn_comp("2example.com", comp_dn+offset, sizeof(comp_dn)-offset, dnptrs, lastdnptr);
76 dump(comp_dn+offset, ret);
77 ICUNIT_ASSERT_EQUAL(ret, 11, ret);
78 ICUNIT_ASSERT_EQUAL(dnptrs[5], /*comp_dn+offset*/ NULL, dnptrs[5]); //last one is always NULL
79
80 for (int i = 0; i < 6; ++i) {
81 printf("%p: %s\n", dnptrs[i], dnptrs[i]);
82 }
83 ICUNIT_ASSERT_EQUAL(offset+ret<100, 1, ret);
84 return ICUNIT_SUCCESS;
85 }
86
NetResolvTest001(void)87 void NetResolvTest001(void)
88 {
89 TEST_ADD_CASE(__FUNCTION__, DnCompTest, TEST_POSIX, TEST_TCP, TEST_LEVEL0, TEST_FUNCTION);
90 }
91