HomeSort by: relevance | last modified time | path
    Searched defs:unsorted (Results 1 - 10 of 10) sorted by relevancy

  /src/crypto/external/bsd/openssl/dist/test/
stack_test.c 60 int unsorted; member in struct:__anon1775
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
stack_test.c 60 int unsorted; member in struct:__anon1775
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
  /src/crypto/external/bsd/openssl.old/dist/test/
stack_test.c 60 int unsorted; member in struct:__anon2287
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
stack_test.c 60 int unsorted; member in struct:__anon2287
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
  /src/crypto/external/apache2/openssl/dist/test/
stack_test.c 60 int unsorted; member in struct:__anon190
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
stack_test.c 60 int unsorted; member in struct:__anon190
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
  /src/external/bsd/zstd/dist/lib/dictBuilder/
divsufsort.c 1406 int t, skip, unsorted; local
1413 unsorted = 0;
1422 if(budget.count != 0) { unsorted += budget.count; }
1431 if(unsorted == 0) { break; }
divsufsort.c 1406 int t, skip, unsorted; local
1413 unsorted = 0;
1422 if(budget.count != 0) { unsorted += budget.count; }
1431 if(unsorted == 0) { break; }
  /src/external/gpl2/groff/dist/src/preproc/tbl/
table.cpp 1993 horizontal_span *unsorted = span_list; local
1995 while (unsorted) {
1998 if (unsorted->end_col < (*pp)->end_col
1999 || (unsorted->end_col == (*pp)->end_col
2000 && (unsorted->start_col > (*pp)->start_col)))
2002 horizontal_span *tem = unsorted->next;
2003 unsorted->next = *pp;
2004 *pp = unsorted;
2005 unsorted = tem;
table.cpp 1993 horizontal_span *unsorted = span_list; local
1995 while (unsorted) {
1998 if (unsorted->end_col < (*pp)->end_col
1999 || (unsorted->end_col == (*pp)->end_col
2000 && (unsorted->start_col > (*pp)->start_col)))
2002 horizontal_span *tem = unsorted->next;
2003 unsorted->next = *pp;
2004 *pp = unsorted;
2005 unsorted = tem;

Completed in 50 milliseconds