Searched refs:sorted (Results 1 – 14 of 14) sorted by relevance
/openssl/test/ |
H A D | priority_queue_test.c | 55 static size_t values[MAX_SAMPLES], sorted[MAX_SAMPLES], ref[MAX_SAMPLES]; in test_size_t_priority_queue_int() local 69 memset(sorted, 0, sizeof(sorted)); in test_size_t_priority_queue_int() 74 memcpy(sorted, values, sizeof(*sorted) * count); in test_size_t_priority_queue_int() 75 qsort(sorted, count, sizeof(*sorted), &qsort_size_t_compare); in test_size_t_priority_queue_int() 78 memcpy(values, sorted, sizeof(*values) * count); in test_size_t_priority_queue_int() 93 if (!TEST_size_t_eq(*ossl_pqueue_size_t_peek(pq), *sorted) in test_size_t_priority_queue_int() 107 memcpy(sorted, values, sizeof(*sorted) * count); in test_size_t_priority_queue_int() 108 qsort(sorted, count, sizeof(*sorted), &qsort_size_t_compare); in test_size_t_priority_queue_int() 111 if (!TEST_size_t_eq(*ossl_pqueue_size_t_peek(pq), sorted[i]) in test_size_t_priority_queue_int() 112 || !TEST_size_t_eq(*ossl_pqueue_size_t_pop(pq), sorted[i])) in test_size_t_priority_queue_int()
|
H A D | stack_test.c | 61 int sorted; in test_int_stack() member 141 if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) { in test_int_stack()
|
/openssl/crypto/stack/ |
H A D | stack.c | 30 int sorted; member 41 sk->sorted = 0; in OPENSSL_sk_set_cmp_func() 56 ret->sorted = 0; in OPENSSL_sk_dup() 94 ret->sorted = 0; in OPENSSL_sk_deep_copy() 280 st->sorted = 0; in OPENSSL_sk_insert() 343 if (!st->sorted) { in internal_find() 475 st->sorted = 0; in OPENSSL_sk_set() 481 if (st != NULL && !st->sorted && st->comp != NULL) { in OPENSSL_sk_sort() 484 st->sorted = 1; /* empty or single-element stack is considered sorted */ in OPENSSL_sk_sort() 490 return st == NULL ? 1 : st->sorted; in OPENSSL_sk_is_sorted()
|
/openssl/doc/man3/ |
H A D | SSL_get_ciphers.pod | 31 sorted by preference. If B<ssl> is NULL or no ciphers are available, NULL 37 B<ssl> as would be sent in a ClientHello (that is, sorted by preference). 86 sorted list of available ciphers, until NULL is returned.
|
H A D | DEFINE_STACK_OF.pod | 177 where a comparison function has been specified, I<sk> is sorted and 188 element in the sorted stack is returned. 197 B<sk_I<TYPE>_is_sorted>() returns B<1> if I<sk> is sorted and B<0> otherwise. 280 B<sk_I<TYPE>_is_sorted>() returns B<1> if the stack is sorted and B<0> if it is
|
H A D | SSL_CTX_use_certificate.pod | 86 be sorted starting with the subject's certificate (actual client or server
|
/openssl/crypto/property/ |
H A D | README.md | 42 properties can be sorted by the string index which makes comparisons linear 77 lists are sorted by the name index. Some additional utility functions
|
/openssl/doc/HOWTO/ |
H A D | documenting-functions-and-macros.md | 59 This file gets sorted alphabetically prior to each major release,
|
/openssl/doc/designs/quic-design/ |
H A D | stream-receive-buffers.md | 100 structure. This is a sorted list of partially (never fully) overlapping
|
H A D | connection-id-cache.md | 17 QUIC_CONNECTION object. The queue will be sorted by sequence number
|
H A D | quic-ackm.md | 275 * The ranges must be sorted in descending order, for example:
|
H A D | quic-fifm.md | 387 * The chunks are sorted by (stream_id, start) in ascending order.
|
/openssl/include/openssl/ |
H A D | asn1t.h.in | 533 * Special case: this refers to a SET OF that will be sorted into DER order
|
/openssl/ |
H A D | CHANGES.md | 12018 * Keep cipherlists sorted in the source instead of sorting them at 14775 cleanup (among others, algorithm keywords are now sorted 18096 attributes because these will be a SET OF encoding which is sorted
|
Completed in 111 milliseconds