Updated cURL version.
This commit is contained in:
@@ -0,0 +1,76 @@
|
||||
#***************************************************************************
|
||||
# _ _ ____ _
|
||||
# Project ___| | | | _ \| |
|
||||
# / __| | | | |_) | |
|
||||
# | (__| |_| | _ <| |___
|
||||
# \___|\___/|_| \_\_____|
|
||||
#
|
||||
# Copyright (C) 1998 - 2012, Daniel Stenberg, <[email protected]>, et al.
|
||||
#
|
||||
# This software is licensed as described in the file COPYING, which
|
||||
# you should have received as part of this distribution. The terms
|
||||
# are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
#
|
||||
# You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
# copies of the Software, and permit persons to whom the Software is
|
||||
# furnished to do so, under the terms of the COPYING file.
|
||||
#
|
||||
# This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
# KIND, either express or implied.
|
||||
#
|
||||
###########################################################################
|
||||
AUTOMAKE_OPTIONS = foreign nostdinc
|
||||
|
||||
# Specify our include paths here, and do it relative to $(top_srcdir) and
|
||||
# $(top_builddir), to ensure that these paths which belong to the library
|
||||
# being currently built and tested are searched before the library which
|
||||
# might possibly already be installed in the system.
|
||||
#
|
||||
# $(top_builddir)/include/curl for generated curlbuild.h included from curl.h
|
||||
# $(top_builddir)/include for generated curlbuild.h inc. from lib/curl_setup.h
|
||||
# $(top_srcdir)/include is for libcurl's external include files
|
||||
# $(top_builddir)/lib is for libcurl's generated lib/curl_config.h file
|
||||
# $(top_srcdir)/lib for libcurl's lib/curl_setup.h and other "borrowed" files
|
||||
# $(top_builddir)/ares is for in-tree c-ares's generated ares_build.h file
|
||||
# $(top_srcdir)/ares is for in-tree c-ares's external include files
|
||||
|
||||
if USE_EMBEDDED_ARES
|
||||
AM_CPPFLAGS = -I$(top_builddir)/include/curl \
|
||||
-I$(top_builddir)/include \
|
||||
-I$(top_srcdir)/include \
|
||||
-I$(top_builddir)/lib \
|
||||
-I$(top_srcdir)/lib \
|
||||
-I$(top_srcdir)/tests/libtest \
|
||||
-I$(top_builddir)/ares \
|
||||
-I$(top_srcdir)/ares
|
||||
else
|
||||
AM_CPPFLAGS = -I$(top_builddir)/include/curl \
|
||||
-I$(top_builddir)/include \
|
||||
-I$(top_srcdir)/include \
|
||||
-I$(top_builddir)/lib \
|
||||
-I$(top_srcdir)/lib \
|
||||
-I$(top_srcdir)/tests/libtest
|
||||
endif
|
||||
|
||||
EXTRA_DIST = Makefile.inc
|
||||
|
||||
# Prevent LIBS from being used for all link targets
|
||||
LIBS = $(BLANK_AT_MAKETIME)
|
||||
|
||||
LDADD = $(top_builddir)/lib/libcurlu.la @LDFLAGS@ @LIBCURL_LIBS@
|
||||
DEPENDENCIES = $(top_builddir)/lib/libcurlu.la
|
||||
AM_CPPFLAGS += -DUNITTESTS
|
||||
|
||||
# Mostly for Windows build targets, when using static libcurl
|
||||
if USE_CPPFLAG_CURL_STATICLIB
|
||||
AM_CPPFLAGS += -DCURL_STATICLIB
|
||||
endif
|
||||
|
||||
# Makefile.inc provides neat definitions
|
||||
include Makefile.inc
|
||||
|
||||
if BUILD_UNITTESTS
|
||||
noinst_PROGRAMS = $(UNITPROGS)
|
||||
else
|
||||
noinst_PROGRAMS =
|
||||
endif
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,37 @@
|
||||
# these files are used in every single unit test program
|
||||
|
||||
UNITFILES = curlcheck.h \
|
||||
../libtest/test.h \
|
||||
../libtest/first.c
|
||||
|
||||
# These are all unit test programs
|
||||
UNITPROGS = unit1300 unit1301 unit1302 unit1303 unit1304 unit1305 unit1307 \
|
||||
unit1308 unit1309
|
||||
|
||||
unit1300_SOURCES = unit1300.c $(UNITFILES)
|
||||
unit1300_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
unit1301_SOURCES = unit1301.c $(UNITFILES)
|
||||
unit1301_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
unit1302_SOURCES = unit1302.c $(UNITFILES)
|
||||
unit1302_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
unit1303_SOURCES = unit1303.c $(UNITFILES)
|
||||
unit1303_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
unit1304_SOURCES = unit1304.c $(UNITFILES)
|
||||
unit1304_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
unit1305_SOURCES = unit1305.c $(UNITFILES)
|
||||
unit1305_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
unit1307_SOURCES = unit1307.c $(UNITFILES)
|
||||
unit1307_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
unit1308_SOURCES = unit1308.c $(UNITFILES)
|
||||
unit1308_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
unit1309_SOURCES = unit1309.c $(UNITFILES)
|
||||
unit1309_CPPFLAGS = $(AM_CPPFLAGS)
|
||||
|
||||
@@ -0,0 +1,70 @@
|
||||
Unit tests
|
||||
==========
|
||||
|
||||
The goal is to add tests for *ALL* functions in libcurl. If functions are too
|
||||
big and complicated, we should split them into smaller and testable ones.
|
||||
|
||||
Build Unit Tests
|
||||
================
|
||||
|
||||
'./configure --enable-debug' is required for the unit tests to build. To
|
||||
enable unit tests, there will be a separate static libcurl built that will be
|
||||
used exclusively for linking unit test programs. Just build everything as
|
||||
normal, and then you can run the unit test cases as well.
|
||||
|
||||
Run Unit Tests
|
||||
==============
|
||||
|
||||
Unit tests are run as part of the regular test suite. If you have built
|
||||
everything to run unit tests, to can do 'make test' at the root level. Or you
|
||||
can 'cd tests' and then invoke individual unit tests with ./runtests.pl NNNN
|
||||
where NNNN is the specific test number.
|
||||
|
||||
Debug Unit Tests
|
||||
================
|
||||
|
||||
If a specific test fails you will get told. The test case then has output left
|
||||
in the log/ subdirectory, but most importantly you can re-run the test again
|
||||
using gdb by doing ./runtests.pl -g NNNN. That is, add a -g to make it start
|
||||
up gdb and run the same case using that.
|
||||
|
||||
Write Unit Tests
|
||||
================
|
||||
|
||||
We put tests that focus on an area or a specific function into a single C
|
||||
source file. The source file should be named 'unitNNNN.c' where NNNN is a
|
||||
number that starts with 1300 and you can pick the next free number.
|
||||
|
||||
You also need a separate file called tests/data/testNNNN (using the same
|
||||
number) that describes your test case. See the test1300 file for inspiration
|
||||
and the tests/FILEFORMAT documentation.
|
||||
|
||||
For the actual C file, here's a very simple example:
|
||||
|
||||
----------------------- start -------------------------------
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include "a libcurl header.h" /* from the lib dir */
|
||||
|
||||
static void unit_setup( void )
|
||||
{
|
||||
/* whatever you want done first */
|
||||
}
|
||||
|
||||
static void unit_stop( void )
|
||||
{
|
||||
/* done before shutting down and exiting */
|
||||
}
|
||||
|
||||
UNITTEST_START
|
||||
|
||||
/* here you start doing things and checking that the results are good */
|
||||
|
||||
fail_unless( size == 0 , "initial size should be zero" );
|
||||
fail_if( head == NULL , "head should not be initiated to NULL" );
|
||||
|
||||
/* you end the test code like this: */
|
||||
|
||||
UNITTEST_STOP
|
||||
|
||||
----------------------- end -------------------------------
|
||||
@@ -0,0 +1,98 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "test.h"
|
||||
|
||||
/* The fail macros mark the current test step as failed, and continue */
|
||||
#define fail_if(expr, msg) \
|
||||
if(expr) { \
|
||||
fprintf(stderr, "%s:%d Assertion '%s' met: %s\n" , \
|
||||
__FILE__, __LINE__, #expr, msg); \
|
||||
unitfail++; \
|
||||
}
|
||||
|
||||
#define fail_unless(expr, msg) \
|
||||
if(!(expr)) { \
|
||||
fprintf(stderr, "%s:%d Assertion '%s' failed: %s\n", \
|
||||
__FILE__, __LINE__, #expr, msg); \
|
||||
unitfail++; \
|
||||
}
|
||||
|
||||
#define verify_memory(dynamic, check, len) \
|
||||
if(dynamic && memcmp(dynamic, check, len)) { \
|
||||
fprintf(stderr, "%s:%d The dynamic string didn't match '%s'\n", \
|
||||
__FILE__, __LINE__, check); \
|
||||
unitfail++; \
|
||||
}
|
||||
|
||||
/* fail() is for when the test case figured out by itself that a check
|
||||
proved a failure */
|
||||
#define fail(msg) do { \
|
||||
fprintf(stderr, "%s:%d test failed: '%s'\n", \
|
||||
__FILE__, __LINE__, msg); \
|
||||
unitfail++; \
|
||||
} WHILE_FALSE
|
||||
|
||||
|
||||
/* The abort macros mark the current test step as failed, and exit the test */
|
||||
#define abort_if(expr, msg) \
|
||||
if(expr) { \
|
||||
fprintf(stderr, "%s:%d Abort assertion '%s' met: %s\n" , \
|
||||
__FILE__, __LINE__, #expr, msg); \
|
||||
unitfail++; \
|
||||
goto unit_test_abort; \
|
||||
}
|
||||
|
||||
#define abort_unless(expr, msg) \
|
||||
if(!(expr)) { \
|
||||
fprintf(stderr, "%s:%d Abort assertion '%s' failed: %s\n", \
|
||||
__FILE__, __LINE__, #expr, msg); \
|
||||
unitfail++; \
|
||||
goto unit_test_abort; \
|
||||
}
|
||||
|
||||
#define abort_test(msg) do { \
|
||||
fprintf(stderr, "%s:%d test aborted: '%s'\n", \
|
||||
__FILE__, __LINE__, msg); \
|
||||
unitfail++; \
|
||||
goto unit_test_abort; \
|
||||
} WHILE_FALSE
|
||||
|
||||
|
||||
|
||||
extern int unitfail;
|
||||
|
||||
#define UNITTEST_START \
|
||||
int test(char *arg) \
|
||||
{ \
|
||||
(void)arg; \
|
||||
if (unit_setup()) { \
|
||||
fail("unit_setup() failure"); \
|
||||
} else {
|
||||
|
||||
#define UNITTEST_STOP \
|
||||
goto unit_test_abort; /* avoid warning */ \
|
||||
unit_test_abort: \
|
||||
unit_stop(); \
|
||||
} \
|
||||
return unitfail; \
|
||||
}
|
||||
|
||||
@@ -0,0 +1,292 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include "llist.h"
|
||||
|
||||
static struct curl_llist *llist;
|
||||
|
||||
static struct curl_llist *llist_destination;
|
||||
|
||||
static void test_curl_llist_dtor(void *key, void *value)
|
||||
{
|
||||
/* used by the llist API, does nothing here */
|
||||
(void)key;
|
||||
(void)value;
|
||||
}
|
||||
|
||||
static CURLcode unit_setup(void)
|
||||
{
|
||||
llist = Curl_llist_alloc(test_curl_llist_dtor);
|
||||
if(!llist)
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
llist_destination = Curl_llist_alloc(test_curl_llist_dtor);
|
||||
if(!llist_destination) {
|
||||
Curl_llist_destroy(llist, NULL);
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
}
|
||||
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
static void unit_stop(void)
|
||||
{
|
||||
Curl_llist_destroy(llist, NULL);
|
||||
Curl_llist_destroy(llist_destination, NULL);
|
||||
}
|
||||
|
||||
UNITTEST_START
|
||||
int unusedData_case1 = 1;
|
||||
int unusedData_case2 = 2;
|
||||
int unusedData_case3 = 3;
|
||||
struct curl_llist_element *head;
|
||||
struct curl_llist_element *element_next;
|
||||
struct curl_llist_element *element_prev;
|
||||
struct curl_llist_element *to_remove;
|
||||
size_t llist_size = Curl_llist_count(llist);
|
||||
int curlErrCode = 0;
|
||||
|
||||
/**
|
||||
* testing llist_init
|
||||
* case 1:
|
||||
* list initiation
|
||||
* @assumptions:
|
||||
* 1: list size will be 0
|
||||
* 2: list head will be NULL
|
||||
* 3: list tail will be NULL
|
||||
* 4: list dtor will be NULL
|
||||
*/
|
||||
|
||||
fail_unless(llist->size == 0, "list initial size should be zero");
|
||||
fail_unless(llist->head == NULL, "list head should initiate to NULL");
|
||||
fail_unless(llist->tail == NULL, "list tail should intiate to NULL");
|
||||
fail_unless(llist->dtor == test_curl_llist_dtor,
|
||||
"list dtor shold initiate to test_curl_llist_dtor");
|
||||
|
||||
/**
|
||||
* testing Curl_llist_insert_next
|
||||
* case 1:
|
||||
* list is empty
|
||||
* @assumptions:
|
||||
* 1: list size will be 1
|
||||
* 2: list head will hold the data "unusedData_case1"
|
||||
* 3: list tail will be the same as list head
|
||||
*/
|
||||
|
||||
curlErrCode = Curl_llist_insert_next(llist, llist->head, &unusedData_case1);
|
||||
if(curlErrCode == 1) {
|
||||
fail_unless(Curl_llist_count(llist) == 1,
|
||||
"List size should be 1 after adding a new element");
|
||||
/*test that the list head data holds my unusedData */
|
||||
fail_unless(llist->head->ptr == &unusedData_case1,
|
||||
"List size should be 1 after adding a new element");
|
||||
/*same goes for the list tail */
|
||||
fail_unless(llist->tail == llist->head,
|
||||
"List size should be 1 after adding a new element");
|
||||
|
||||
/**
|
||||
* testing Curl_llist_insert_next
|
||||
* case 2:
|
||||
* list has 1 element, adding one element after the head
|
||||
* @assumptions:
|
||||
* 1: the element next to head should be our newly created element
|
||||
* 2: the list tail should be our newly created element
|
||||
*/
|
||||
|
||||
curlErrCode = Curl_llist_insert_next(llist, llist->head,
|
||||
&unusedData_case3);
|
||||
if(curlErrCode == 1) {
|
||||
fail_unless(llist->head->next->ptr == &unusedData_case3,
|
||||
"the node next to head is not getting set correctly");
|
||||
fail_unless(llist->tail->ptr == &unusedData_case3,
|
||||
"the list tail is not getting set correctly");
|
||||
}
|
||||
else {
|
||||
printf("skipping Curl_llist_insert_next as a non "
|
||||
"success error code was returned\n");
|
||||
}
|
||||
|
||||
/**
|
||||
* testing Curl_llist_insert_next
|
||||
* case 3:
|
||||
* list has >1 element, adding one element after "NULL"
|
||||
* @assumptions:
|
||||
* 1: the element next to head should be our newly created element
|
||||
* 2: the list tail should different from newly created element
|
||||
*/
|
||||
|
||||
curlErrCode = Curl_llist_insert_next(llist, llist->head,
|
||||
&unusedData_case2);
|
||||
if(curlErrCode == 1) {
|
||||
fail_unless(llist->head->next->ptr == &unusedData_case2,
|
||||
"the node next to head is not getting set correctly");
|
||||
/* better safe than sorry, check that the tail isn't corrupted */
|
||||
fail_unless(llist->tail->ptr != &unusedData_case2,
|
||||
"the list tail is not getting set correctly");
|
||||
}
|
||||
else {
|
||||
printf("skipping Curl_llist_insert_next as a non "
|
||||
"success error code was returned\n");
|
||||
}
|
||||
|
||||
}
|
||||
else {
|
||||
printf("skipping Curl_llist_insert_next as a non "
|
||||
"success error code was returned\n");
|
||||
}
|
||||
|
||||
/* unit tests for Curl_llist_remove */
|
||||
|
||||
/**
|
||||
* case 1:
|
||||
* list has >1 element, removing head
|
||||
* @assumptions:
|
||||
* 1: list size will be decremented by one
|
||||
* 2: head will be the head->next
|
||||
* 3: "new" head's previous will be NULL
|
||||
*/
|
||||
|
||||
head=llist->head;
|
||||
abort_unless(head, "llist->head is NULL");
|
||||
element_next = head->next;
|
||||
llist_size = Curl_llist_count(llist);
|
||||
|
||||
Curl_llist_remove(llist, llist->head, NULL);
|
||||
|
||||
fail_unless(Curl_llist_count(llist) == (llist_size-1),
|
||||
"llist size not decremented as expected");
|
||||
fail_unless(llist->head == element_next,
|
||||
"llist new head not modified properly");
|
||||
abort_unless(llist->head, "llist->head is NULL");
|
||||
fail_unless(llist->head->prev == NULL,
|
||||
"new head previous not set to null");
|
||||
|
||||
/**
|
||||
* case 2:
|
||||
* removing non head element, with list having >=2 elements
|
||||
* @setup:
|
||||
* 1: insert another element to the list to make element >=2
|
||||
* @assumptions:
|
||||
* 1: list size will be decremented by one ; tested
|
||||
* 2: element->previous->next will be element->next
|
||||
* 3: element->next->previous will be element->previous
|
||||
*/
|
||||
Curl_llist_insert_next(llist, llist->head, &unusedData_case3);
|
||||
llist_size = Curl_llist_count(llist);
|
||||
to_remove = llist->head->next;
|
||||
abort_unless(to_remove, "to_remove is NULL");
|
||||
element_next = to_remove->next;
|
||||
element_prev = to_remove->prev;
|
||||
Curl_llist_remove(llist, to_remove, NULL);
|
||||
fail_unless(element_prev->next == element_next,
|
||||
"element previous->next is not being adjusted");
|
||||
abort_unless(element_next, "element_next is NULL");
|
||||
fail_unless(element_next->prev == element_prev,
|
||||
"element next->previous is not being adjusted");
|
||||
|
||||
/**
|
||||
* case 3:
|
||||
* removing the tail with list having >=1 element
|
||||
* @assumptions
|
||||
* 1: list size will be decremented by one ;tested
|
||||
* 2: element->previous->next will be element->next ;tested
|
||||
* 3: element->next->previous will be element->previous ;tested
|
||||
* 4: list->tail will be tail->previous
|
||||
*/
|
||||
|
||||
to_remove = llist->tail;
|
||||
element_prev = to_remove->prev;
|
||||
Curl_llist_remove(llist, to_remove, NULL);
|
||||
fail_unless(llist->tail == element_prev,
|
||||
"llist tail is not being adjusted when removing tail");
|
||||
|
||||
/**
|
||||
* case 4:
|
||||
* removing head with list having 1 element
|
||||
* @assumptions:
|
||||
* 1: list size will be decremented by one ;tested
|
||||
* 2: list head will be null
|
||||
* 3: list tail will be null
|
||||
*/
|
||||
|
||||
to_remove = llist->head;
|
||||
Curl_llist_remove(llist, to_remove, NULL);
|
||||
fail_unless(llist->head == NULL,
|
||||
"llist head is not NULL while the llist is empty");
|
||||
fail_unless(llist->tail == NULL,
|
||||
"llist tail is not NULL while the llist is empty");
|
||||
|
||||
/* @testing Curl_llist_move(struct curl_llist *,
|
||||
* struct curl_llist_element *, struct curl_llist *,
|
||||
* struct curl_llist_element *);
|
||||
*/
|
||||
|
||||
/**
|
||||
* @case 1:
|
||||
* moving head from an llist containg one element to an empty llist
|
||||
* @assumptions:
|
||||
* 1: llist size will be 0
|
||||
* 2: llist_destination size will be 1
|
||||
* 3: llist head will be NULL
|
||||
* 4: llist_destination head == llist_destination tail != NULL
|
||||
*/
|
||||
|
||||
/*
|
||||
* @setup
|
||||
* add one element to the list
|
||||
*/
|
||||
|
||||
curlErrCode = Curl_llist_insert_next(llist, llist->head, &unusedData_case1);
|
||||
/* necessary assertions */
|
||||
|
||||
abort_unless(curlErrCode == 1,
|
||||
"Curl_llist_insert_next returned an error, Can't move on with test");
|
||||
abort_unless(Curl_llist_count(llist) == 1,
|
||||
"Number of list elements is not as expected, Aborting");
|
||||
abort_unless(Curl_llist_count(llist_destination) == 0,
|
||||
"Number of list elements is not as expected, Aborting");
|
||||
|
||||
/*actual testing code*/
|
||||
curlErrCode = Curl_llist_move(llist, llist->head, llist_destination, NULL);
|
||||
abort_unless(curlErrCode == 1,
|
||||
"Curl_llist_move returned an error, Can't move on with test");
|
||||
fail_unless(Curl_llist_count(llist) == 0,
|
||||
"moving element from llist didn't decrement the size");
|
||||
|
||||
fail_unless(Curl_llist_count(llist_destination) == 1,
|
||||
"moving element to llist_destination didn't increment the size");
|
||||
|
||||
fail_unless(llist->head == NULL,
|
||||
"llist head not set to null after moving the head");
|
||||
|
||||
fail_unless(llist_destination->head != NULL,
|
||||
"llist_destination head set to null after moving an element");
|
||||
|
||||
fail_unless(llist_destination->tail != NULL,
|
||||
"llist_destination tail set to null after moving an element");
|
||||
|
||||
fail_unless(llist_destination->tail == llist_destination->tail,
|
||||
"llist_destination tail doesn't equal llist_destination head");
|
||||
|
||||
|
||||
|
||||
UNITTEST_STOP
|
||||
@@ -0,0 +1,54 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include "strequal.h"
|
||||
|
||||
static CURLcode unit_setup( void ) {return CURLE_OK;}
|
||||
static void unit_stop( void ) {}
|
||||
|
||||
UNITTEST_START
|
||||
|
||||
int rc;
|
||||
|
||||
rc = curl_strequal("iii", "III");
|
||||
fail_unless( rc != 0 , "return code should be zero" );
|
||||
|
||||
rc = curl_strequal("iiia", "III");
|
||||
fail_unless( rc == 0 , "return code should be zero" );
|
||||
|
||||
rc = curl_strequal("iii", "IIIa");
|
||||
fail_unless( rc == 0 , "return code should be zero" );
|
||||
|
||||
rc = curl_strequal("iiiA", "IIIa");
|
||||
fail_unless( rc != 0 , "return code should be non-zero" );
|
||||
|
||||
rc = curl_strnequal("iii", "III", 3);
|
||||
fail_unless( rc != 0 , "return code should be non-zero" );
|
||||
|
||||
rc = curl_strnequal("iiiABC", "IIIcba", 3);
|
||||
fail_unless( rc != 0 , "return code should be non-zero" );
|
||||
|
||||
rc = curl_strnequal("ii", "II", 3);
|
||||
fail_unless( rc != 0 , "return code should be non-zero" );
|
||||
|
||||
UNITTEST_STOP
|
||||
@@ -0,0 +1,124 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include "urldata.h"
|
||||
#include "url.h" /* for Curl_safefree */
|
||||
#include "curl_base64.h"
|
||||
#include "memdebug.h" /* LAST include file */
|
||||
|
||||
static struct SessionHandle *data;
|
||||
|
||||
static CURLcode unit_setup( void )
|
||||
{
|
||||
data = curl_easy_init();
|
||||
if (!data)
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
static void unit_stop( void )
|
||||
{
|
||||
curl_easy_cleanup(data);
|
||||
}
|
||||
|
||||
UNITTEST_START
|
||||
|
||||
char *output;
|
||||
unsigned char *decoded;
|
||||
size_t size = 0;
|
||||
unsigned char anychar = 'x';
|
||||
CURLcode rc;
|
||||
|
||||
rc = Curl_base64_encode(data, "i", 1, &output, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 4, "size should be 4");
|
||||
verify_memory( output, "aQ==", 4);
|
||||
Curl_safefree(output);
|
||||
|
||||
rc = Curl_base64_encode(data, "ii", 2, &output, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 4, "size should be 4");
|
||||
verify_memory( output, "aWk=", 4);
|
||||
Curl_safefree(output);
|
||||
|
||||
rc = Curl_base64_encode(data, "iii", 3, &output, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 4, "size should be 4");
|
||||
verify_memory( output, "aWlp", 4);
|
||||
Curl_safefree(output);
|
||||
|
||||
rc = Curl_base64_encode(data, "iiii", 4, &output, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 8, "size should be 8");
|
||||
verify_memory( output, "aWlpaQ==", 8);
|
||||
Curl_safefree(output);
|
||||
|
||||
/* 0 length makes it do strlen() */
|
||||
rc = Curl_base64_encode(data, "iiii", 0, &output, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 8, "size should be 8");
|
||||
verify_memory( output, "aWlpaQ==", 8);
|
||||
Curl_safefree(output);
|
||||
|
||||
rc = Curl_base64_decode("aWlpaQ==", &decoded, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 4, "size should be 4");
|
||||
verify_memory(decoded, "iiii", 4);
|
||||
Curl_safefree(decoded);
|
||||
|
||||
rc = Curl_base64_decode("aWlp", &decoded, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 3, "size should be 3");
|
||||
verify_memory(decoded, "iii", 3);
|
||||
Curl_safefree(decoded);
|
||||
|
||||
rc = Curl_base64_decode("aWk=", &decoded, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 2, "size should be 2");
|
||||
verify_memory(decoded, "ii", 2);
|
||||
Curl_safefree(decoded);
|
||||
|
||||
rc = Curl_base64_decode("aQ==", &decoded, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 1, "size should be 1");
|
||||
verify_memory(decoded, "i", 2);
|
||||
Curl_safefree(decoded);
|
||||
|
||||
/* this is an illegal input */
|
||||
size = 1; /* not zero */
|
||||
decoded = &anychar; /* not NULL */
|
||||
rc = Curl_base64_decode("aQ", &decoded, &size);
|
||||
/* return code indiferent, but output shall be as follows */
|
||||
fail_unless(size == 0, "size should be 0");
|
||||
fail_if(decoded, "returned pointer should be NULL");
|
||||
|
||||
/* this is garbage input that libcurl decodes as far as possible */
|
||||
size = 0;
|
||||
decoded = NULL;
|
||||
rc = Curl_base64_decode("a\x1f==", &decoded, &size);
|
||||
fail_unless(rc == CURLE_OK, "return code should be CURLE_OK");
|
||||
fail_unless(size == 1, "size should be 1");
|
||||
fail_if(!decoded, "returned pointer should not be NULL");
|
||||
Curl_safefree(decoded);
|
||||
|
||||
UNITTEST_STOP
|
||||
@@ -0,0 +1,144 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include "urldata.h"
|
||||
#include "connect.h"
|
||||
#include "memdebug.h" /* LAST include file */
|
||||
|
||||
static struct SessionHandle *data;
|
||||
|
||||
static CURLcode unit_setup( void )
|
||||
{
|
||||
data = curl_easy_init();
|
||||
if (!data)
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
static void unit_stop( void )
|
||||
{
|
||||
curl_easy_cleanup(data);
|
||||
}
|
||||
|
||||
/* BASE is just a define to make us fool around with decently large number so
|
||||
that we aren't zero-based */
|
||||
#define BASE 1000000
|
||||
|
||||
/* macro to set the pretended current time */
|
||||
#define NOW(x,y) now.tv_sec = x; now.tv_usec = y
|
||||
/* macro to set the millisecond based timeouts to use */
|
||||
#define TIMEOUTS(x,y) data->set.timeout = x; data->set.connecttimeout = y
|
||||
|
||||
/*
|
||||
* To test:
|
||||
*
|
||||
* 00/10/01/11 timeouts set
|
||||
* 0/1 during connect
|
||||
* T various values on the timeouts
|
||||
* N various values of now
|
||||
*/
|
||||
|
||||
struct timetest {
|
||||
int now_s;
|
||||
int now_us;
|
||||
int timeout_ms;
|
||||
int connecttimeout_ms;
|
||||
bool connecting;
|
||||
long result;
|
||||
const char *comment;
|
||||
};
|
||||
|
||||
UNITTEST_START
|
||||
|
||||
struct timeval now;
|
||||
long timeout;
|
||||
unsigned int i;
|
||||
|
||||
const struct timetest run[] = {
|
||||
/* both timeouts set, not connecting */
|
||||
{BASE + 4, 0, 10000, 8000, FALSE, 6000, "6 seconds should be left"},
|
||||
{BASE + 4, 990000, 10000, 8000, FALSE, 5010, "5010 ms should be left"},
|
||||
{BASE + 10, 0, 10000, 8000, FALSE, -1, "timeout is -1, expired"},
|
||||
{BASE + 12, 0, 10000, 8000, FALSE, -2000, "-2000, overdue 2 seconds"},
|
||||
|
||||
/* both timeouts set, connecting */
|
||||
{BASE + 4, 0, 10000, 8000, TRUE, 4000, "4 seconds should be left"},
|
||||
{BASE + 4, 990000, 10000, 8000, TRUE, 3010, "3010 ms should be left"},
|
||||
{BASE + 8, 0, 10000, 8000, TRUE, -1, "timeout is -1, expired"},
|
||||
{BASE + 10, 0, 10000, 8000, TRUE, -2000, "-2000, overdue 2 seconds"},
|
||||
|
||||
/* no connect timeout set, not connecting */
|
||||
{BASE + 4, 0, 10000, 0, FALSE, 6000, "6 seconds should be left"},
|
||||
{BASE + 4, 990000, 10000, 0, FALSE, 5010, "5010 ms should be left"},
|
||||
{BASE + 10, 0, 10000, 0, FALSE, -1, "timeout is -1, expired"},
|
||||
{BASE + 12, 0, 10000, 0, FALSE, -2000, "-2000, overdue 2 seconds"},
|
||||
|
||||
/* no connect timeout set, connecting */
|
||||
{BASE + 4, 0, 10000, 0, FALSE, 6000, "6 seconds should be left"},
|
||||
{BASE + 4, 990000, 10000, 0, FALSE, 5010, "5010 ms should be left"},
|
||||
{BASE + 10, 0, 10000, 0, FALSE, -1, "timeout is -1, expired"},
|
||||
{BASE + 12, 0, 10000, 0, FALSE, -2000, "-2000, overdue 2 seconds"},
|
||||
|
||||
/* only connect timeout set, not connecting */
|
||||
{BASE + 4, 0, 0, 10000, FALSE, 0, "no timeout active"},
|
||||
{BASE + 4, 990000, 0, 10000, FALSE, 0, "no timeout active"},
|
||||
{BASE + 10, 0, 0, 10000, FALSE, 0, "no timeout active"},
|
||||
{BASE + 12, 0, 0, 10000, FALSE, 0, "no timeout active"},
|
||||
|
||||
/* only connect timeout set, connecting */
|
||||
{BASE + 4, 0, 0, 10000, TRUE, 6000, "6 seconds should be left"},
|
||||
{BASE + 4, 990000, 0, 10000, TRUE, 5010, "5010 ms should be left"},
|
||||
{BASE + 10, 0, 0, 10000, TRUE, -1, "timeout is -1, expired"},
|
||||
{BASE + 12, 0, 0, 10000, TRUE, -2000, "-2000, overdue 2 seconds"},
|
||||
|
||||
/* no timeout set, not connecting */
|
||||
{BASE + 4, 0, 0, 0, FALSE, 0, "no timeout active"},
|
||||
{BASE + 4, 990000, 0, 0, FALSE, 0, "no timeout active"},
|
||||
{BASE + 10, 0, 0, 0, FALSE, 0, "no timeout active"},
|
||||
{BASE + 12, 0, 0, 0, FALSE, 0, "no timeout active"},
|
||||
|
||||
/* no timeout set, connecting */
|
||||
{BASE + 4, 0, 0, 0, TRUE, 296000, "no timeout active"},
|
||||
{BASE + 4, 990000, 0, 0, TRUE, 295010, "no timeout active"},
|
||||
{BASE + 10, 0, 0, 0, TRUE, 290000, "no timeout active"},
|
||||
{BASE + 12, 0, 0, 0, TRUE, 288000, "no timeout active"},
|
||||
|
||||
/* both timeouts set, connecting, connect timeout the longer one */
|
||||
{BASE + 4, 0, 10000, 12000, TRUE, 6000, "6 seconds should be left"},
|
||||
|
||||
};
|
||||
|
||||
/* this is the pretended start time of the transfer */
|
||||
data->progress.t_startsingle.tv_sec = BASE;
|
||||
data->progress.t_startsingle.tv_usec = 0;
|
||||
|
||||
for(i=0; i < sizeof(run)/sizeof(run[0]); i++) {
|
||||
NOW(run[i].now_s, run[i].now_us);
|
||||
TIMEOUTS(run[i].timeout_ms, run[i].connecttimeout_ms);
|
||||
timeout = Curl_timeleft(data, &now, run[i].connecting);
|
||||
if(timeout != run[i].result)
|
||||
fail(run[i].comment);
|
||||
}
|
||||
|
||||
|
||||
UNITTEST_STOP
|
||||
@@ -0,0 +1,142 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include "netrc.h"
|
||||
|
||||
static char login[LOGINSIZE];
|
||||
static char password[PASSWORDSIZE];
|
||||
static char filename[64];
|
||||
|
||||
static CURLcode unit_setup(void)
|
||||
{
|
||||
password[0] = 0;
|
||||
login[0] = 0;
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
static void unit_stop(void)
|
||||
{
|
||||
}
|
||||
|
||||
UNITTEST_START
|
||||
int result;
|
||||
|
||||
static const char* filename1 = "log/netrc1304";
|
||||
memcpy(filename, filename1, strlen(filename1));
|
||||
|
||||
/*
|
||||
* Test a non existent host in our netrc file.
|
||||
*/
|
||||
result = Curl_parsenetrc("test.example.com", login, password, filename);
|
||||
fail_unless(result == 1, "Host not found should return 1");
|
||||
fail_unless(password[0] == 0, "password should not have been changed");
|
||||
fail_unless(login[0] == 0, "login should not have been changed");
|
||||
|
||||
/*
|
||||
* Test a non existent login in our netrc file.
|
||||
*/
|
||||
memcpy(login, "me", 2);
|
||||
result = Curl_parsenetrc("example.com", login, password, filename);
|
||||
fail_unless(result == 0, "Host should be found");
|
||||
fail_unless(password[0] == 0, "password should not have been changed");
|
||||
fail_unless(strncmp(login, "me", 2) == 0, "login should not have been changed");
|
||||
|
||||
/*
|
||||
* Test a non existent login and host in our netrc file.
|
||||
*/
|
||||
memcpy(login, "me", 2);
|
||||
result = Curl_parsenetrc("test.example.com", login, password, filename);
|
||||
fail_unless(result == 1, "Host should be found");
|
||||
fail_unless(password[0] == 0, "password should not have been changed");
|
||||
fail_unless(strncmp(login, "me", 2) == 0, "login should not have been changed");
|
||||
|
||||
/*
|
||||
* Test a non existent login (substring of an existing one) in our
|
||||
* netrc file.
|
||||
*/
|
||||
memcpy(login, "admi", 4);
|
||||
result = Curl_parsenetrc("example.com", login, password, filename);
|
||||
fail_unless(result == 0, "Host should be found");
|
||||
fail_unless(password[0] == 0, "password should not have been changed");
|
||||
fail_unless(strncmp(login, "admi", 4) == 0, "login should not have been changed");
|
||||
|
||||
/*
|
||||
* Test a non existent login (superstring of an existing one)
|
||||
* in our netrc file.
|
||||
*/
|
||||
memcpy(login, "adminn", 6);
|
||||
result = Curl_parsenetrc("example.com", login, password, filename);
|
||||
fail_unless(result == 0, "Host should be found");
|
||||
fail_unless(password[0] == 0, "password should not have been changed");
|
||||
fail_unless(strncmp(login, "adminn", 6) == 0, "login should not have been changed");
|
||||
|
||||
/*
|
||||
* Test for the first existing host in our netrc file
|
||||
* with login[0] = 0.
|
||||
*/
|
||||
login[0] = 0;
|
||||
result = Curl_parsenetrc("example.com", login, password, filename);
|
||||
fail_unless(result == 0, "Host should have been found");
|
||||
fail_unless(strncmp(password, "passwd", 6) == 0,
|
||||
"password should be 'passwd'");
|
||||
fail_unless(strncmp(login, "admin", 5) == 0, "login should be 'admin'");
|
||||
|
||||
/*
|
||||
* Test for the first existing host in our netrc file
|
||||
* with login[0] != 0.
|
||||
*/
|
||||
password[0] = 0;
|
||||
result = Curl_parsenetrc("example.com", login, password, filename);
|
||||
fail_unless(result == 0, "Host should have been found");
|
||||
fail_unless(strncmp(password, "passwd", 6) == 0,
|
||||
"password should be 'passwd'");
|
||||
fail_unless(strncmp(login, "admin", 5) == 0, "login should be 'admin'");
|
||||
|
||||
/*
|
||||
* Test for the second existing host in our netrc file
|
||||
* with login[0] = 0.
|
||||
*/
|
||||
password[0] = 0;
|
||||
login[0] = 0;
|
||||
result = Curl_parsenetrc("curl.example.com", login, password, filename);
|
||||
fail_unless(result == 0, "Host should have been found");
|
||||
fail_unless(strncmp(password, "none", 4) == 0,
|
||||
"password should be 'none'");
|
||||
fail_unless(strncmp(login, "none", 4) == 0, "login should be 'none'");
|
||||
|
||||
/*
|
||||
* Test for the second existing host in our netrc file
|
||||
* with login[0] != 0.
|
||||
*/
|
||||
password[0] = 0;
|
||||
result = Curl_parsenetrc("curl.example.com", login, password, filename);
|
||||
fail_unless(result == 0, "Host should have been found");
|
||||
fail_unless(strncmp(password, "none", 4) == 0,
|
||||
"password should be 'none'");
|
||||
fail_unless(strncmp(login, "none", 4) == 0, "login should be 'none'");
|
||||
|
||||
/* TODO:
|
||||
* Test over the size limit password / login!
|
||||
* Test files with a bad format
|
||||
*/
|
||||
UNITTEST_STOP
|
||||
@@ -0,0 +1,142 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#ifdef HAVE_NETINET_IN_H
|
||||
# include <netinet/in.h>
|
||||
#endif
|
||||
#ifdef HAVE_NETDB_H
|
||||
# include <netdb.h>
|
||||
#endif
|
||||
#ifdef HAVE_ARPA_INET_H
|
||||
# include <arpa/inet.h>
|
||||
#endif
|
||||
|
||||
#define ENABLE_CURLX_PRINTF
|
||||
#include "curlx.h"
|
||||
|
||||
#include "hash.h"
|
||||
#include "hostip.h"
|
||||
|
||||
#include "curl_memory.h"
|
||||
#include "memdebug.h" /* LAST include file */
|
||||
|
||||
static struct SessionHandle *data;
|
||||
static struct curl_hash *hp;
|
||||
static char *data_key;
|
||||
static struct Curl_dns_entry *data_node;
|
||||
|
||||
static CURLcode unit_setup( void )
|
||||
{
|
||||
data = curl_easy_init();
|
||||
if (!data)
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
|
||||
hp = Curl_mk_dnscache();
|
||||
if(!hp) {
|
||||
curl_easy_cleanup(data);
|
||||
curl_global_cleanup();
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
}
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
static void unit_stop( void )
|
||||
{
|
||||
if (data_node) {
|
||||
Curl_freeaddrinfo(data_node->addr);
|
||||
free(data_node);
|
||||
}
|
||||
if (data_key)
|
||||
free(data_key);
|
||||
|
||||
Curl_hash_destroy(hp);
|
||||
|
||||
curl_easy_cleanup(data);
|
||||
curl_global_cleanup();
|
||||
}
|
||||
|
||||
static Curl_addrinfo *fake_ai(void)
|
||||
{
|
||||
static Curl_addrinfo *ai;
|
||||
int ss_size;
|
||||
|
||||
ss_size = sizeof (struct sockaddr_in);
|
||||
|
||||
if((ai = calloc(1, sizeof(Curl_addrinfo))) == NULL)
|
||||
return NULL;
|
||||
|
||||
if((ai->ai_canonname = strdup("dummy")) == NULL) {
|
||||
free(ai);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
if((ai->ai_addr = calloc(1, ss_size)) == NULL) {
|
||||
free(ai->ai_canonname);
|
||||
free(ai);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
ai->ai_family = AF_INET;
|
||||
ai->ai_addrlen = ss_size;
|
||||
|
||||
return ai;
|
||||
}
|
||||
|
||||
static CURLcode create_node(void)
|
||||
{
|
||||
data_key = aprintf("%s:%d", "dummy", 0);
|
||||
if (!data_key)
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
|
||||
data_node = calloc(1, sizeof(struct Curl_dns_entry));
|
||||
if (!data_node)
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
|
||||
data_node->addr = fake_ai();
|
||||
if (!data_node->addr)
|
||||
return CURLE_OUT_OF_MEMORY;
|
||||
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
|
||||
UNITTEST_START
|
||||
|
||||
struct Curl_dns_entry *nodep;
|
||||
size_t key_len;
|
||||
|
||||
/* Test 1305 exits without adding anything to the hash */
|
||||
if (strcmp(arg, "1305") != 0) {
|
||||
CURLcode rc = create_node();
|
||||
abort_unless(rc == CURLE_OK, "data node creation failed");
|
||||
key_len = strlen(data_key);
|
||||
|
||||
nodep = Curl_hash_add(hp, data_key, key_len+1, data_node);
|
||||
abort_unless(nodep, "insertion into hash failed");
|
||||
/* Freeing will now be done by Curl_hash_destroy */
|
||||
data_node = NULL;
|
||||
|
||||
/* To do: test retrieval, deletion, edge conditions */
|
||||
}
|
||||
|
||||
UNITTEST_STOP
|
||||
@@ -0,0 +1,234 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include "curl_fnmatch.h"
|
||||
|
||||
#define MATCH CURL_FNMATCH_MATCH
|
||||
#define NOMATCH CURL_FNMATCH_NOMATCH
|
||||
#define RE_ERR CURL_FNMATCH_FAIL
|
||||
|
||||
#define MAX_PATTERN_L 100
|
||||
#define MAX_STRING_L 100
|
||||
|
||||
struct testcase {
|
||||
char pattern[MAX_PATTERN_L];
|
||||
char string[MAX_STRING_L];
|
||||
int result;
|
||||
};
|
||||
|
||||
static const struct testcase tests[] = {
|
||||
/* brackets syntax */
|
||||
{ "\\[", "[", MATCH },
|
||||
{ "[", "[", RE_ERR },
|
||||
{ "[]", "[]", RE_ERR },
|
||||
{ "[][]", "[", MATCH },
|
||||
{ "[][]", "]", MATCH },
|
||||
{ "[[]", "[", MATCH },
|
||||
{ "[[[]", "[", MATCH },
|
||||
{ "[[[[]", "[", MATCH },
|
||||
{ "[[[[]", "[", MATCH },
|
||||
|
||||
{ "[][[]", "]", MATCH },
|
||||
{ "[][[[]", "[", MATCH },
|
||||
{ "[[]", "]", NOMATCH },
|
||||
|
||||
{ "[a-z]", "a", MATCH },
|
||||
{ "[a-z]", "A", NOMATCH },
|
||||
{ "?[a-z]", "?Z", NOMATCH },
|
||||
{ "[A-Z]", "C", MATCH },
|
||||
{ "[A-Z]", "c", NOMATCH },
|
||||
{ "[0-9]", "7", MATCH },
|
||||
{ "[7-8]", "7", MATCH },
|
||||
{ "[7-]", "7", MATCH },
|
||||
{ "[7-]", "-", MATCH },
|
||||
{ "[7-]", "[", NOMATCH },
|
||||
{ "[a-bA-F]", "F", MATCH },
|
||||
{ "[a-bA-B9]", "9", MATCH },
|
||||
{ "[a-bA-B98]", "8", MATCH },
|
||||
{ "[a-bA-B98]", "C", NOMATCH },
|
||||
{ "[a-bA-Z9]", "F", MATCH },
|
||||
{ "[a-bA-Z9]ero*", "Zero chance.", MATCH },
|
||||
{ "S[a-][x]opho*", "Saxophone", MATCH },
|
||||
{ "S[a-][x]opho*", "SaXophone", NOMATCH },
|
||||
{ "S[a-][x]*.txt", "S-x.txt", MATCH },
|
||||
{ "[\\a-\\b]", "a", MATCH },
|
||||
{ "[\\a-\\b]", "b", MATCH },
|
||||
{ "[?*[][?*[][?*[]", "?*[", MATCH },
|
||||
{ "[][?*-]", "]", MATCH },
|
||||
{ "[][?*-]", "[", MATCH },
|
||||
{ "[][?*-]", "?", MATCH },
|
||||
{ "[][?*-]", "*", MATCH },
|
||||
{ "[][?*-]", "-", MATCH },
|
||||
{ "[]?*-]", "-", MATCH },
|
||||
{ "?/b/c", "a/b/c", MATCH },
|
||||
{ "^_{}~", "^_{}~", MATCH },
|
||||
{ "!#%+,-./01234567889", "!#%+,-./01234567889", MATCH },
|
||||
{ "PQRSTUVWXYZ]abcdefg", "PQRSTUVWXYZ]abcdefg", MATCH },
|
||||
{ ":;=@ABCDEFGHIJKLMNO", ":;=@ABCDEFGHIJKLMNO", MATCH },
|
||||
|
||||
/* negate */
|
||||
{ "[!a]", "b", MATCH },
|
||||
{ "[!a]", "a", NOMATCH },
|
||||
{ "[^a]", "b", MATCH },
|
||||
{ "[^a]", "a", NOMATCH },
|
||||
{ "[^a-z0-9A-Z]", "a", NOMATCH },
|
||||
{ "[^a-z0-9A-Z]", "-", MATCH },
|
||||
{ "curl[!a-z]lib", "curl lib", MATCH },
|
||||
{ "curl[! ]lib", "curl lib", NOMATCH },
|
||||
{ "[! ][ ]", " ", NOMATCH },
|
||||
{ "[! ][ ]", "a ", MATCH },
|
||||
{ "*[^a].t?t", "a.txt", NOMATCH },
|
||||
{ "*[^a].t?t", "ba.txt", NOMATCH },
|
||||
{ "*[^a].t?t", "ab.txt", MATCH },
|
||||
{ "[!?*[]", "?", NOMATCH },
|
||||
{ "[!!]", "!", NOMATCH },
|
||||
{ "[!!]", "x", MATCH },
|
||||
|
||||
{ "[[:alpha:]]", "a", MATCH },
|
||||
{ "[[:alpha:]]", "9", NOMATCH },
|
||||
{ "[[:alnum:]]", "a", MATCH },
|
||||
{ "[[:alnum:]]", "[", NOMATCH },
|
||||
{ "[[:alnum:]]", "]", NOMATCH },
|
||||
{ "[[:alnum:]]", "9", MATCH },
|
||||
{ "[[:digit:]]", "9", MATCH },
|
||||
{ "[[:xdigit:]]", "9", MATCH },
|
||||
{ "[[:xdigit:]]", "F", MATCH },
|
||||
{ "[[:xdigit:]]", "G", NOMATCH },
|
||||
{ "[[:upper:]]", "U", MATCH },
|
||||
{ "[[:upper:]]", "u", NOMATCH },
|
||||
{ "[[:lower:]]", "l", MATCH },
|
||||
{ "[[:lower:]]", "L", NOMATCH },
|
||||
{ "[[:print:]]", "L", MATCH },
|
||||
{ "[[:print:]]", {'\10'}, NOMATCH },
|
||||
{ "[[:print:]]", {'\10'}, NOMATCH },
|
||||
{ "[[:space:]]", " ", MATCH },
|
||||
{ "[[:space:]]", "x", NOMATCH },
|
||||
{ "[[:graph:]]", " ", NOMATCH },
|
||||
{ "[[:graph:]]", "x", MATCH },
|
||||
{ "[[:blank:]]", {'\t'}, MATCH },
|
||||
{ "[[:blank:]]", {' '}, MATCH },
|
||||
{ "[[:blank:]]", {'\r'}, NOMATCH },
|
||||
{ "[^[:blank:]]", {'\t'}, NOMATCH },
|
||||
{ "[^[:print:]]", {'\10'}, MATCH },
|
||||
{ "[[:lower:]][[:lower:]]", "ll", MATCH },
|
||||
|
||||
{ "Curl[[:blank:]];-)", "Curl ;-)", MATCH },
|
||||
{ "*[[:blank:]]*", " ", MATCH },
|
||||
{ "*[[:blank:]]*", "", NOMATCH },
|
||||
{ "*[[:blank:]]*", "hi, im_Pavel", MATCH },
|
||||
|
||||
/* common using */
|
||||
{ "filename.dat", "filename.dat", MATCH },
|
||||
{ "*curl*", "lets use curl!!", MATCH },
|
||||
{ "filename.txt", "filename.dat", NOMATCH },
|
||||
{ "*.txt", "text.txt", MATCH },
|
||||
{ "*.txt", "a.txt", MATCH },
|
||||
{ "*.txt", ".txt", MATCH },
|
||||
{ "*.txt", "txt", NOMATCH },
|
||||
{ "??.txt", "99.txt", MATCH },
|
||||
{ "??.txt", "a99.txt", NOMATCH },
|
||||
{ "?.???", "a.txt", MATCH },
|
||||
{ "*.???", "somefile.dat", MATCH },
|
||||
{ "*.???", "photo.jpeg", NOMATCH },
|
||||
{ ".*", ".htaccess", MATCH },
|
||||
{ ".*", ".", MATCH },
|
||||
{ ".*", "..", MATCH },
|
||||
|
||||
/* many stars => one star */
|
||||
{ "**.txt", "text.txt", MATCH },
|
||||
{ "***.txt", "t.txt", MATCH },
|
||||
{ "****.txt", ".txt", MATCH },
|
||||
|
||||
/* empty string or pattern */
|
||||
{ "", "", MATCH } ,
|
||||
{ "", "hello", NOMATCH },
|
||||
{ "file", "", NOMATCH },
|
||||
{ "?", "", NOMATCH },
|
||||
{ "*", "", MATCH },
|
||||
{ "x", "", NOMATCH },
|
||||
|
||||
/* backslash */
|
||||
{ "\\", "\\", RE_ERR },
|
||||
{ "\\\\", "\\", MATCH },
|
||||
{ "\\\\", "\\\\", NOMATCH },
|
||||
{ "\\?", "?", MATCH },
|
||||
{ "\\*", "*", MATCH },
|
||||
{ "?.txt", "?.txt", MATCH },
|
||||
{ "*.txt", "*.txt", MATCH },
|
||||
{ "\\?.txt", "?.txt", MATCH },
|
||||
{ "\\*.txt", "*.txt", MATCH },
|
||||
{ "\\?.txt", "x.txt", NOMATCH },
|
||||
{ "\\*.txt", "x.txt", NOMATCH },
|
||||
{ "\\*\\\\.txt", "*\\.txt", MATCH },
|
||||
{ "*\\**\\?*\\\\*", "cc*cc?cc\\cc*cc", MATCH },
|
||||
{ "*\\**\\?*\\\\*", "cc*cc?cccc", NOMATCH },
|
||||
{ "*\\**\\?*\\\\*", "cc*cc?cc\\cc*cc", MATCH },
|
||||
{ "*\\?*\\**", "cc?c*c", MATCH },
|
||||
{ "*\\?*\\**curl*", "cc?c*curl", MATCH },
|
||||
{ "*\\?*\\**", "cc?cc", NOMATCH },
|
||||
{ "\\\"\\$\\&\\'\\(\\)", "\"$&'()", MATCH },
|
||||
{ "\\*\\?\\[\\\\\\`\\|", "*?[\\`|", MATCH },
|
||||
{ "[\\a\\b]c", "ac", MATCH },
|
||||
{ "[\\a\\b]c", "bc", MATCH },
|
||||
{ "[\\a\\b]d", "bc", NOMATCH },
|
||||
{ "[a-bA-B\\?]", "?", MATCH },
|
||||
{ "cu[a-ab-b\\r]l", "curl", MATCH },
|
||||
{ "[\\a-z]", "c", MATCH },
|
||||
|
||||
{ "?*?*?.*?*", "abc.c", MATCH },
|
||||
{ "?*?*?.*?*", "abcc", NOMATCH },
|
||||
{ "?*?*?.*?*", "abc.", NOMATCH },
|
||||
{ "?*?*?.*?*", "abc.c++", MATCH },
|
||||
{ "?*?*?.*?*", "abcdef.c++", MATCH },
|
||||
{ "?*?*?.?", "abcdef.c", MATCH },
|
||||
{ "?*?*?.?", "abcdef.cd", NOMATCH },
|
||||
|
||||
{ "Lindmätarv", "Lindmätarv", MATCH },
|
||||
|
||||
{ "", "", MATCH }
|
||||
};
|
||||
|
||||
static CURLcode unit_setup( void )
|
||||
{
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
static void unit_stop( void )
|
||||
{
|
||||
}
|
||||
|
||||
UNITTEST_START
|
||||
|
||||
int testnum = sizeof(tests) / sizeof(struct testcase);
|
||||
int i, rc;
|
||||
|
||||
for(i = 0; i < testnum; i++) {
|
||||
rc = Curl_fnmatch(NULL, tests[i].pattern, tests[i].string);
|
||||
if(rc != tests[i].result) {
|
||||
printf("Curl_fnmatch(\"%s\", \"%s\") should return %d (returns %d)\n",
|
||||
tests[i].pattern, tests[i].string, tests[i].result, rc);
|
||||
fail("pattern mismatch");
|
||||
}
|
||||
}
|
||||
|
||||
UNITTEST_STOP
|
||||
@@ -0,0 +1,95 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include <curl/curl.h>
|
||||
|
||||
static CURLcode unit_setup(void)
|
||||
{
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
static void unit_stop(void)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
static size_t print_httppost_callback(void *arg, const char *buf, size_t len)
|
||||
{
|
||||
fwrite(buf, len, 1, stdout);
|
||||
(*(size_t *) arg) += len;
|
||||
return len;
|
||||
}
|
||||
|
||||
UNITTEST_START
|
||||
int rc;
|
||||
struct curl_httppost* post = NULL;
|
||||
struct curl_httppost* last = NULL;
|
||||
size_t total_size = 0;
|
||||
char buffer[] = "test buffer";
|
||||
|
||||
rc = curl_formadd(&post, &last, CURLFORM_COPYNAME, "name",
|
||||
CURLFORM_COPYCONTENTS, "content", CURLFORM_END);
|
||||
|
||||
fail_unless(rc == 0, "curl_formadd returned error");
|
||||
|
||||
/* after the first curl_formadd when there's a single entry, both pointers
|
||||
should point to the same struct */
|
||||
fail_unless(post == last, "post and last weren't the same");
|
||||
|
||||
rc = curl_formadd(&post, &last, CURLFORM_COPYNAME, "htmlcode",
|
||||
CURLFORM_COPYCONTENTS, "<HTML></HTML>",
|
||||
CURLFORM_CONTENTTYPE, "text/html", CURLFORM_END);
|
||||
|
||||
fail_unless(rc == 0, "curl_formadd returned error");
|
||||
|
||||
rc = curl_formadd(&post, &last, CURLFORM_COPYNAME, "name_for_ptrcontent",
|
||||
CURLFORM_PTRCONTENTS, buffer, CURLFORM_END);
|
||||
|
||||
fail_unless(rc == 0, "curl_formadd returned error");
|
||||
|
||||
rc = curl_formget(post, &total_size, print_httppost_callback);
|
||||
|
||||
fail_unless(rc == 0, "curl_formget returned error");
|
||||
|
||||
fail_unless(total_size == 486, "curl_formget got wrong size back");
|
||||
|
||||
curl_formfree(post);
|
||||
|
||||
/* start a new formpost with a file upload and formget */
|
||||
post = last = NULL;
|
||||
|
||||
rc = curl_formadd(&post, &last,
|
||||
CURLFORM_PTRNAME, "name of file field",
|
||||
CURLFORM_FILE, "log/test-1308",
|
||||
CURLFORM_FILENAME, "custom named file",
|
||||
CURLFORM_END);
|
||||
|
||||
fail_unless(rc == 0, "curl_formadd returned error");
|
||||
|
||||
rc = curl_formget(post, &total_size, print_httppost_callback);
|
||||
fail_unless(rc == 0, "curl_formget returned error");
|
||||
fail_unless(total_size == 847, "curl_formget got wrong size back");
|
||||
|
||||
curl_formfree(post);
|
||||
|
||||
UNITTEST_STOP
|
||||
@@ -0,0 +1,110 @@
|
||||
/***************************************************************************
|
||||
* _ _ ____ _
|
||||
* Project ___| | | | _ \| |
|
||||
* / __| | | | |_) | |
|
||||
* | (__| |_| | _ <| |___
|
||||
* \___|\___/|_| \_\_____|
|
||||
*
|
||||
* Copyright (C) 1998 - 2011, Daniel Stenberg, <[email protected]>, et al.
|
||||
*
|
||||
* This software is licensed as described in the file COPYING, which
|
||||
* you should have received as part of this distribution. The terms
|
||||
* are also available at http://curl.haxx.se/docs/copyright.html.
|
||||
*
|
||||
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
||||
* copies of the Software, and permit persons to whom the Software is
|
||||
* furnished to do so, under the terms of the COPYING file.
|
||||
*
|
||||
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
||||
* KIND, either express or implied.
|
||||
*
|
||||
***************************************************************************/
|
||||
#include "curlcheck.h"
|
||||
|
||||
#include "splay.h"
|
||||
|
||||
|
||||
static CURLcode unit_setup(void)
|
||||
{
|
||||
return CURLE_OK;
|
||||
}
|
||||
|
||||
static void unit_stop(void)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
static void splayprint(struct Curl_tree * t, int d, char output)
|
||||
{
|
||||
struct Curl_tree *node;
|
||||
int i;
|
||||
int count;
|
||||
if(t == NULL)
|
||||
return;
|
||||
|
||||
splayprint(t->larger, d+1, output);
|
||||
for(i=0; i<d; i++)
|
||||
if(output)
|
||||
printf(" ");
|
||||
|
||||
if(output) {
|
||||
printf("%ld.%ld[%d]", (long)t->key.tv_sec,
|
||||
(long)t->key.tv_usec, i);
|
||||
}
|
||||
|
||||
for(count=0, node = t->same; node; node = node->same, count++)
|
||||
;
|
||||
|
||||
if(output) {
|
||||
if(count)
|
||||
printf(" [%d more]\n", count);
|
||||
else
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
splayprint(t->smaller, d+1, output);
|
||||
}
|
||||
|
||||
UNITTEST_START
|
||||
|
||||
/* number of nodes to add to the splay tree */
|
||||
#define NUM_NODES 50
|
||||
|
||||
struct Curl_tree *root;
|
||||
struct Curl_tree nodes[NUM_NODES];
|
||||
int rc;
|
||||
int i;
|
||||
root = NULL; /* the empty tree */
|
||||
|
||||
for(i = 0; i < NUM_NODES; i++) {
|
||||
struct timeval key;
|
||||
|
||||
key.tv_sec = 0;
|
||||
key.tv_usec = (541*i)%1023;
|
||||
|
||||
nodes[i].payload = (void *)key.tv_usec; /* for simplicity */
|
||||
root = Curl_splayinsert(key, root, &nodes[i]);
|
||||
}
|
||||
|
||||
puts("Result:");
|
||||
splayprint(root, 0, 1);
|
||||
|
||||
for(i = 0; i < NUM_NODES; i++) {
|
||||
int rem = (i+7)%NUM_NODES;
|
||||
printf("Tree look:\n");
|
||||
splayprint(root, 0, 1);
|
||||
printf("remove pointer %d, payload %ld\n", rem,
|
||||
(long)(nodes[rem].payload));
|
||||
rc = Curl_splayremovebyaddr(root, &nodes[rem], &root);
|
||||
if(rc) {
|
||||
/* failed! */
|
||||
printf("remove %d failed!\n", rem);
|
||||
fail("remove");
|
||||
}
|
||||
}
|
||||
|
||||
UNITTEST_STOP
|
||||
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user