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#include "lwip_test.h"
33#include "lwipopts.h"
34#include <arch/sys_arch.h>
35#include <lwip/sys.h>
36
37static char g_buf[BUF_SIZE + 1] = { 0 };
38static char g_buf_temp[BUF_SIZE + 1] = { 0 };
39
40#define SEND_UDP_COUNT 10000  // send count
41#define TEST_CASE 170
42
43static void UdpTestMoreTask(void *p)
44{
45    (void)p;
46    LogPrintln("net_socket_test_007.c enter");
47    if (g_testCase < TEST_CASE) {
48        g_testCase = TEST_CASE;
49    } else {
50        g_testCase++;
51    }
52
53    int sfd;
54    struct sockaddr_in srvAddr = { 0 };
55    struct sockaddr_in clnAddr = { 0 };
56    socklen_t clnAddrLen = sizeof(clnAddr);
57    int ret;
58    int i;
59
60    /* socket creation */
61    sfd = socket(AF_INET, SOCK_DGRAM, 0);
62    LWIP_ASSERT("socket invalid param.", sfd != -1);
63
64    srvAddr.sin_family = AF_INET;
65    srvAddr.sin_addr.s_addr = inet_addr(STACK_IP);
66    srvAddr.sin_port = htons(STACK_PORT);
67    ret = bind(sfd, (struct sockaddr*)&srvAddr, sizeof(srvAddr));
68    LWIP_ASSERT("socket invalid param.", ret == 0);
69
70    /* send */
71    clnAddr.sin_family = AF_INET;
72    clnAddr.sin_addr.s_addr = inet_addr(PEER_IP);
73    clnAddr.sin_port = htons(PEER_PORT);
74    if (g_buf_temp[0] == '\0') {
75        for (i = 0; i < BUF_SIZE; i++) {
76            g_buf_temp[i] = 'U';
77        }
78        g_buf_temp[BUF_SIZE] = '\0';
79    }
80
81    LogPrintln("udp begin send");
82    for (i = 0; i < SEND_UDP_COUNT; i++) {
83        ret = memcpy_s(g_buf, sizeof(g_buf), g_buf_temp, sizeof(g_buf_temp));
84        ICUNIT_ASSERT_EQUAL(ret, EOK, 1);
85        ret = sendto(sfd, g_buf, BUF_SIZE, 0, (struct sockaddr*)&clnAddr, (socklen_t)sizeof(clnAddr));
86        LWIP_ASSERT("socket invalid param.", ret != -1);
87
88        /* recv */
89        (void)memset_s(g_buf, sizeof(g_buf), 0, sizeof(g_buf));
90        ret = recvfrom(sfd, g_buf, sizeof(g_buf), 0, (struct sockaddr*)&clnAddr,
91            &clnAddrLen);
92        LWIP_ASSERT("socket invalid param.", ret == BUF_SIZE);
93    }
94    LogPrintln("udp end send");
95
96    /* close socket */
97    ret = closesocket(sfd);
98    LWIP_ASSERT("socket invalid param.", ret != -1);
99}
100
101void UdpTestMore()
102{
103    int ret;
104    ret = sys_thread_new("udp_more", UdpTestMoreTask, NULL,
105        STACK_TEST_SIZE * 2, TCPIP_THREAD_PRIO);
106    ICUNIT_ASSERT_NOT_EQUAL(ret, -1, 10);
107}
108
109