Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 356) sorted by relevance

12345678910>>...15

/curl/docs/libcurl/
H A Dmksymbolsmanpage.pl71 my ($n)=@_;
72 if($n =~ /^CURLOPT_/) {
83 return "$n(3)";
87 return "$n(3)";
99 if($infotypes{$n}) {
112 elsif($n =~ /^CURLKH/) {
115 elsif($n =~ /^CURLE_/) {
118 elsif($n =~ /^CURLM_/) {
151 elsif($n =~ /^CURLU_/) {
161 return "$n(3)";
[all …]
/curl/tests/unit/
H A Dunit2601.c65 size_t n; in dump_bufq() local
79 n = 0; in dump_bufq()
82 ++n; in dump_bufq()
99 ssize_t n, i; in check_bufq() local
127 if(n >= 0) { in check_bufq()
146 if(n >= 0) { in check_bufq()
184 if(n < 0 || (size_t)n != wsize) { in check_bufq()
204 if(n <= 0) { in check_bufq()
239 roffset, (int)n, buf, (int)n, rbuf); in check_bufq()
242 roffset += n; in check_bufq()
[all …]
H A Dunit1614.c40 const char *n; member
47 const char *n; member
135 bool match = Curl_cidr4_match(list4[i].a, list4[i].n, list4[i].bits);
138 list4[i].a, list4[i].n, list4[i].bits,
145 bool match = Curl_cidr6_match(list6[i].a, list6[i].n, list6[i].bits);
148 list6[i].a, list6[i].n, list6[i].bits,
155 bool match = Curl_check_noproxy(list[i].a, list[i].n);
158 list[i].a, list[i].n,
/curl/lib/
H A Dbufq.c65 if(n) { in chunk_append()
66 n = CURLMIN(n, len); in chunk_append()
70 return n; in chunk_append()
79 if(!n) { in chunk_read()
98 if(!n) { in chunk_unwrite()
120 if(!n) { in chunk_slurpn()
155 if(n) { in chunk_skip()
156 n = CURLMIN(n, amount); in chunk_skip()
161 return n; in chunk_skip()
487 *pnwritten = (n < 0) ? 0 : (size_t)n; in Curl_bufq_cwrite()
[all …]
H A Dllist.c44 DEBUGASSERT(!n || (n->_init == NODEINIT)); in verifynode()
45 return n; in verifynode()
234 DEBUGASSERT(n); in Curl_node_elem()
236 return n->_ptr; in Curl_node_elem()
243 DEBUGASSERT(n); in Curl_node_next()
245 return VERIFYNODE(n->_next); in Curl_node_next()
254 DEBUGASSERT(n); in Curl_node_prev()
256 return VERIFYNODE(n->_prev); in Curl_node_prev()
263 DEBUGASSERT(n); in Curl_node_llist()
264 DEBUGASSERT(!n->_list || n->_init == NODEINIT); in Curl_node_llist()
[all …]
H A Dfopen.c66 size_t n; in dirslash() local
70 n = strlen(path); in dirslash()
71 if(n) { in dirslash()
73 while(n && !IS_SEP(path[n-1])) in dirslash()
74 --n; in dirslash()
76 while(n && IS_SEP(path[n-1])) in dirslash()
77 --n; in dirslash()
79 if(Curl_dyn_addn(&out, path, n)) in dirslash()
82 if(n && Curl_dyn_addn(&out, PATHSEP, 1)) in dirslash()
H A Dstrcase.c149 void Curl_strntoupper(char *dest, const char *src, size_t n) in Curl_strntoupper() argument
151 if(n < 1) in Curl_strntoupper()
156 } while(*src++ && --n); in Curl_strntoupper()
164 void Curl_strntolower(char *dest, const char *src, size_t n) in Curl_strntolower() argument
166 if(n < 1) in Curl_strntolower()
171 } while(*src++ && --n); in Curl_strntolower()
H A Dcurl_memrchr.c50 Curl_memrchr(const void *s, int c, size_t n) in Curl_memrchr() argument
52 if(n > 0) { in Curl_memrchr()
56 p += n - 1; in Curl_memrchr()
H A Dllist.h76 void *Curl_node_elem(struct Curl_llist_node *n);
80 struct Curl_llist_node *Curl_node_next(struct Curl_llist_node *n);
84 struct Curl_llist_node *Curl_node_prev(struct Curl_llist_node *n);
87 struct Curl_llist *Curl_node_llist(struct Curl_llist_node *n);
H A Dcookie.c392 for(n = Curl_llist_head(&ci->cookielist[i]); n; n = e) { in remove_expired()
992 for(n = Curl_llist_head(&ci->cookielist[myhash]); n; n = Curl_node_next(n)) { in replace_existing()
1373 n; n = Curl_node_next(n)) { in Curl_cookie_getlist()
1426 for(i = 0; n; n = Curl_node_next(n)) in Curl_cookie_getlist()
1460 for(n = Curl_llist_head(&ci->cookielist[i]); n;) { in Curl_cookie_clearall()
1465 n = e; in Curl_cookie_clearall()
1488 for(; n; n = e) { in Curl_cookie_clearsess()
1600 for(n = Curl_llist_head(&ci->cookielist[i]); n; in cookie_output()
1601 n = Curl_node_next(n)) { in cookie_output()
1661 for(n = Curl_llist_head(&data->cookies->cookielist[i]); n; in cookie_list()
[all …]
/curl/src/
H A Dmkhelp.pl204 for my $n (@out) {
205 chomp $n;
206 $n =~ s/\\/\\\\/g;
207 $n =~ s/\"/\\\"/g;
208 $n =~ s/\t/\\t/g;
210 if(!$n) {
214 $n =~ s/ /\\t/g;
215 printf(" \"%s%s\",\n", $blank?"\\n":"", $n);
/curl/tests/
H A Dtest1177.pl82 for my $n (keys %sourcename) {
83 if(!$manname{$n}) {
84 print STDERR "$manpage: missing feature name $n\n";
88 for my $n (keys %manname) {
89 if(!$sourcename{$n} && ($n ne "\"no name\"")) {
90 print STDERR "$manpage: $n is not in the source!\n";
H A Dech_combos.py60 if start > n:
79 def CombinationRepetition(arr, badarr, n, r): argument
87 CombinationRepetitionUtil(chosen, arr, badarr, 0, r, 0, n)
94 n = len(arr) - 1 variable
96 CombinationRepetition(arr, badarr, n, r)
/curl/scripts/
H A Dschemetable.c33 const char *n; member
99 for(i = 0; scheme[i].n; ++i) in showtable()
100 num[i] = calc(scheme[i].n, init, shift); in showtable()
101 for(i = 0; scheme[i].n; ++i) in showtable()
119 for(j = 0; scheme[j].n; j++) { in showtable()
123 printf(" &Curl_handler_%s,\n", scheme[j].n); in showtable()
154 for(i = 0; scheme[i].n; ++i) { in main()
174 for(i = 0; scheme[i].n; ++i) { in main()
175 printf("%u - %s\n", num[i], scheme[i].n); in main()
181 for(i = 0; scheme[i].n; ++i) { in main()
[all …]
/curl/lib/vtls/
H A Dmbedtls_threadlock.c94 int Curl_mbedtlsthreadlock_lock_function(int n) in Curl_mbedtlsthreadlock_lock_function() argument
96 if(n < NUMT) { in Curl_mbedtlsthreadlock_lock_function()
98 if(pthread_mutex_lock(&mutex_buf[n])) { in Curl_mbedtlsthreadlock_lock_function()
104 if(WaitForSingleObject(mutex_buf[n], INFINITE) == WAIT_FAILED) { in Curl_mbedtlsthreadlock_lock_function()
114 int Curl_mbedtlsthreadlock_unlock_function(int n) in Curl_mbedtlsthreadlock_unlock_function() argument
116 if(n < NUMT) { in Curl_mbedtlsthreadlock_unlock_function()
118 if(pthread_mutex_unlock(&mutex_buf[n])) { in Curl_mbedtlsthreadlock_unlock_function()
124 if(!ReleaseMutex(mutex_buf[n])) { in Curl_mbedtlsthreadlock_unlock_function()
/curl/docs/libcurl/opts/
H A DCURLOPT_SSL_CTX_DATA.md66 printf("PEM_read_bio_X509 failed...\n");
73 printf("error adding certificate\n");
88 "-----BEGIN CERTIFICATE-----\n"
89 "MIIHPTCCBSWgAwIBAgIBADANBgkqhkiG9w0BAQQFADB5MRAwDgYDVQQKEwdSb290\n"
90 "IENBMR4wHAYDVQQLExVodHRwOi8vd3d3LmNhY2VydC5vcmcxIjAgBgNVBAMTGUNB\n"
91 "IENlcnQgU2lnbmluZyBBdXRob3JpdHkxITAfBgkqhkiG9w0BCQEWEnN1cHBvcnRA\n"
92 "Y2FjZXJ0Lm9yZzAeFw0wMzAzMzAxMjI5NDlaFw0zMzAzMjkxMjI5NDlaMHkxEDAO\n"
95 "omTxJBzcoTWcFbLUvFUufQb1nA5V9FrWk9p2rSVzTMVD\n"
96 "-----END CERTIFICATE-----\n";
109 printf("*** transfer succeeded ***\n");
[all …]
/curl/tests/libtest/
H A Dlib1597.c43 int n; in test() local
84 n = 0; in test()
86 if((size_t) n >= sizeof(protolist)) { in test()
91 n += msnprintf(protolist + n, sizeof(protolist) - n, ",%s", *proto); in test()
H A Dlib1901.c79 struct curl_slist *n = in test() local
81 if(n) in test()
82 chunk = n; in test()
83 if(n) in test()
84 easy_setopt(curl, CURLOPT_HTTPHEADER, n); in test()
H A Dlib1555.c42 size_t n = 0; in progressCallback() local
48 res = curl_easy_recv(curl, buffer, 256, &n); in progressCallback()
50 res = curl_easy_send(curl, buffer, n, &n); in progressCallback()
/curl/tests/data/
H A Dtest55848 s/^MEM escape.c:\d+ free\(\(nil\)\)[\n]$//
53 s/\r\n/\n/
54 s/^MEM getenv.c: realloc\(\)[\n]$//
55 s/^MEM getenv.c: free\(\)[\n]$//
H A Dtest133043 s/\r\n/\n/
44 s/^MEM getenv.c: realloc\(\)[\n]$//
45 s/^MEM getenv.c: free\(\)[\n]$//
H A Dtest108946 …TESTNUMBER -w "%{num_connects}\n%{num_redirects}\n%{size_download}\n%{url_effective}\n%{content_ty…
H A Dtest109053 …TESTNUMBER -w "%{num_connects}\n%{num_redirects}\n%{size_download}\n%{url_effective}\n%{content_ty…
H A Dtest204654 …RT:%HOSTIP -w "%{num_connects}\n%{num_redirects}\n%{size_download}\n%{url_effective}\n%{content_ty…
H A Dtest204755 …:%HTTPPORT -w "%{num_connects}\n%{num_redirects}\n%{size_download}\n%{url_effective}\n%{content_ty…

Completed in 46 milliseconds

12345678910>>...15