Home
last modified time | relevance | path

Searched refs:len_a (Results 1 – 25 of 469) sorted by relevance

12345678910>>...19

/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/DDACE/tests/
H A Darrcmp.cpp12 int len_a = a.size(); in Arrcmp_d() local
15 if( len_a != len_b ) in Arrcmp_d()
35 int len_a = a.size(); in Arrcmp_d_est() local
38 if( len_a != len_b ) in Arrcmp_d_est()
66 int len_a = a.size(); in Arrcmp_i() local
69 if( len_a != len_b ) in Arrcmp_i()
95 int len_a = a.size(); in Arrcmp_ad() local
98 if( len_a != len_b ) in Arrcmp_ad()
125 int len_a = a.size(); in Arrcmp_ad_est() local
128 if( len_a != len_b ) in Arrcmp_ad_est()
[all …]
H A DTestDDaceSamplePoint.cpp5 int len_a = a.size(); in Arrcmp() local
8 if( len_a != len_b ) { in Arrcmp()
12 for( int i = 0; i < len_a; i++ ) { in Arrcmp()
24 int len_a = a.size(); in Arrcmp() local
27 if( len_a != len_b ) { in Arrcmp()
31 for( int i = 0; i < len_a; i++ ) { in Arrcmp()
/dports/devel/monotone/monotone-1.1/src/
H A Dlcs.cc506 I(len_a <= len_b); in diff_to_ez()
512 if (len_a == len_b) in diff_to_ez()
547 else if (len_a <= p_lim) in diff_to_ez()
549 I(len_a == p_lim); in diff_to_ez()
558 return len_a + len_b; in diff_to_ez()
574 I(len_a <= len_b); in diff_to_edits()
576 long edit_distance = compare(costs, a, len_a, b, len_b, min(len_a, len_b), false); in diff_to_edits()
593 while (adx < len_a) in edits_to_lcs()
621 long len_a = end_a - begin_a; in _edit_script() local
628 if (len_b < len_a) in _edit_script()
[all …]
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/kalign/src/kalign2/
H A Dkalign2_alignment_types.c32 int len_a; in default_alignment() local
68 len_a = aln->sl[a]; in default_alignment()
70 dp = dp_matrix_realloc(dp,len_a,len_b); in default_alignment()
72 map[c] = malloc(sizeof(int) * (len_a+len_b+2)); in default_alignment()
73 for (j = len_a+len_b+2;j--;){ in default_alignment()
98 if (len_a > len_b){ in default_alignment()
632 int len_a; in ntree_sub_alignment() local
729 len_a = local_sl[a]; in ntree_sub_alignment()
731 dp = dp_matrix_realloc(dp,len_a,len_b); in ntree_sub_alignment()
734 for (j = len_a+len_b+2;j--;){ in ntree_sub_alignment()
[all …]
/dports/news/slrn/slrn-1.0.3/src/
H A Dstrutil.c175 int len_a,len_b; in slrn_case_strcmp() local
190 len_a=strlen(a); in slrn_case_strcmp()
193 return SLutf8_compare((SLuchar_Type *)a, (SLuchar_Type *)a+len_a, in slrn_case_strcmp()
195 ((len_a > len_b) ? len_a : len_b), 0); in slrn_case_strcmp()
309 unsigned int len_a, len_b, len_s, len; in slrn_substrjoin() local
316 len_a = (amax == NULL) ? strlen (a) : (unsigned int)(amax - a); in slrn_substrjoin()
319 if ((len_a == 0) || (len_b == 0)) in slrn_substrjoin()
324 len = len_a + len_s + len_b; in slrn_substrjoin()
329 strncpy (c, a, len_a); in slrn_substrjoin()
331 strcpy (c+len_a, s); in slrn_substrjoin()
[all …]
/dports/security/yara/yara-4.1.1/libyara/
H A Dbitmask.c61 uint32_t len_a, in yr_bitmask_find_non_colliding_offset() argument
75 i <= len_a / YR_BITMASK_SLOT_BITS && a[i] == -1L; in yr_bitmask_find_non_colliding_offset()
81 for (; i <= len_a / YR_BITMASK_SLOT_BITS; i++) in yr_bitmask_find_non_colliding_offset()
87 for (j = 0; j <= yr_min(len_a, YR_BITMASK_SLOT_BITS - 1); j++) in yr_bitmask_find_non_colliding_offset()
98 if ((i + k <= len_a / YR_BITMASK_SLOT_BITS) && (m & a[i + k]) != 0) in yr_bitmask_find_non_colliding_offset()
110 return len_a; in yr_bitmask_find_non_colliding_offset()
/dports/textproc/aiksaurus/aiksaurus-1.2.1/gtk/src/
H A DAiksaurusGTK_utils.cpp87 int len_a = strlen(a); in AiksaurusGTK_strConcat() local
90 char* ret = new(std::nothrow) char[len_a + len_b + 1]; in AiksaurusGTK_strConcat()
97 while(i < len_a) in AiksaurusGTK_strConcat()
103 while(i < len_b + len_a) in AiksaurusGTK_strConcat()
105 ret[i] = b[i - len_a]; in AiksaurusGTK_strConcat()
109 ret[len_a + len_b] = '\0'; in AiksaurusGTK_strConcat()
/dports/editors/abiword/abiword-3.0.5/plugins/aiksaurus/aiksaurusgtk3/
H A DAiksaurusGTK_utils.cpp87 int len_a = strlen(a); in AiksaurusGTK_strConcat() local
90 char* ret = new(std::nothrow) char[len_a + len_b + 1]; in AiksaurusGTK_strConcat()
97 while(i < len_a) in AiksaurusGTK_strConcat()
103 while(i < len_b + len_a) in AiksaurusGTK_strConcat()
105 ret[i] = b[i - len_a]; in AiksaurusGTK_strConcat()
109 ret[len_a + len_b] = '\0'; in AiksaurusGTK_strConcat()
/dports/dns/dnstable/dnstable-0.12.0/dnstable/
H A Ddnstable-private.h92 bytes_compare(const uint8_t *a, size_t len_a, in bytes_compare() argument
95 size_t len = len_a > len_b ? len_b : len_a; in bytes_compare()
98 if (len_a < len_b) { in bytes_compare()
100 } else if (len_a == len_b) { in bytes_compare()
102 } else if (len_a > len_b) { in bytes_compare()
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll7 ; CHECK-NEXT: %len_a = load i32, i32* %a_len_ptr, align 4, !range !0
8 ; CHECK-NEXT: --> %len_a U: [0,2147483647) S: [0,2147483647)
11 ; CHECK-NEXT: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
20 %len_a = load i32, i32* %a_len_ptr, !range !0
28 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
37 ; CHECK-NEXT: %len_a = load i32, i32* %a_len_ptr, align 4, !range !0
38 ; CHECK-NEXT: --> %len_a U: [0,2147483647) S: [0,2147483647)
41 ; CHECK-NEXT: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
58 %len_a = load i32, i32* %a_len_ptr, !range !0
63 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/ncurses/ncurses-6.3/ncurses/tinfo/
H A Dtrim_sgr0.c111 size_t len_a = strlen(attr); in rewrite_sgr() local
113 if (len_s > len_a && !strncmp(attr, s, len_a)) { in rewrite_sgr()
116 for (n = 0; n < len_s - len_a; ++n) { in rewrite_sgr()
117 s[n] = s[n + len_a]; in rewrite_sgr()
135 size_t len_a; in similar_sgr() local
149 len_a = strlen(a); in similar_sgr()
151 if (len_a && len_b) { in similar_sgr()
152 if (len_a > len_b) in similar_sgr()
155 result = (strncmp(a, b, len_a) == 0); in similar_sgr()
/dports/devel/mtbl/mtbl-1.4.0/mtbl/
H A Dmtbl-private.h135 bytes_compare(const uint8_t *a, size_t len_a, in bytes_compare() argument
138 size_t len = len_a > len_b ? len_b : len_a; in bytes_compare()
141 if (len_a < len_b) { in bytes_compare()
143 } else if (len_a == len_b) { in bytes_compare()
145 } else if (len_a > len_b) { in bytes_compare()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll7 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
14 %len_a = load i32, i32* %a_len_ptr, !range !0
22 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
32 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
38 %len_a = load i32, i32* %a_len_ptr, !range !0
43 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll6 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
13 %len_a = load i32, i32* %a_len_ptr, !range !0
21 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
31 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
37 %len_a = load i32, i32* %a_len_ptr, !range !0
42 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/llvm10/llvm-10.0.1.src/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll6 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
13 %len_a = load i32, i32* %a_len_ptr, !range !0
21 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
31 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
37 %len_a = load i32, i32* %a_len_ptr, !range !0
42 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll7 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
14 %len_a = load i32, i32* %a_len_ptr, !range !0
22 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
32 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
38 %len_a = load i32, i32* %a_len_ptr, !range !0
43 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/security/py-pycrypto/pycrypto-2.6.1/src/
H A Dstrxor.c137 Py_ssize_t len_a, len_b;
142 len_a = PyBytes_GET_SIZE(a);
145 assert(len_a >= 0);
148 if (len_a != len_b) {
154 retval = PyBytes_FromStringAndSize(NULL, len_a);
160 xor_strings(PyBytes_AS_STRING(retval), PyBytes_AS_STRING(a), PyBytes_AS_STRING(b), len_a);
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll7 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
14 %len_a = load i32, i32* %a_len_ptr, !range !0
22 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
32 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
38 %len_a = load i32, i32* %a_len_ptr, !range !0
43 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/llvm11/llvm-11.0.1.src/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll6 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
13 %len_a = load i32, i32* %a_len_ptr, !range !0
21 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
31 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
37 %len_a = load i32, i32* %a_len_ptr, !range !0
42 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll7 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
14 %len_a = load i32, i32* %a_len_ptr, !range !0
22 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
32 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
38 %len_a = load i32, i32* %a_len_ptr, !range !0
43 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll6 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
13 %len_a = load i32, i32* %a_len_ptr, !range !0
21 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
31 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
37 %len_a = load i32, i32* %a_len_ptr, !range !0
42 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll7 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
14 %len_a = load i32, i32* %a_len_ptr, !range !0
22 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
32 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
38 %len_a = load i32, i32* %a_len_ptr, !range !0
43 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll7 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
14 %len_a = load i32, i32* %a_len_ptr, !range !0
22 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
32 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
38 %len_a = load i32, i32* %a_len_ptr, !range !0
43 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/llvm90/llvm-9.0.1.src/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll6 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
13 %len_a = load i32, i32* %a_len_ptr, !range !0
21 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
31 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
37 %len_a = load i32, i32* %a_len_ptr, !range !0
42 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
/dports/devel/llvm80/llvm-8.0.1.src/test/Analysis/ScalarEvolution/
H A Dunknown_phis.ll6 ; CHECK: %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
13 %len_a = load i32, i32* %a_len_ptr, !range !0
21 %len = phi i32 [ %len_a, %if.true ], [ %len_b, %if.false ]
31 ; CHECK: %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]
37 %len_a = load i32, i32* %a_len_ptr, !range !0
42 %p1 = phi i32 [ %len_a, %entry ], [ %p2, %loop ]

12345678910>>...19