/freebsd-current/contrib/atf/atf-c/detail/ |
H A D | list_test.c | 180 atf_list_t l1, l2; local 182 RE(atf_list_init(&l1)); 185 atf_list_append_list(&l1, &l2); 186 ATF_CHECK_EQ(atf_list_size(&l1), 0); 188 atf_list_fini(&l1); 192 atf_list_t l1, l2; local 195 RE(atf_list_init(&l1)); 196 RE(atf_list_append(&l1, &item, false)); 199 atf_list_append_list(&l1, &l2); 200 ATF_CHECK_EQ(atf_list_size(&l1), 207 atf_list_t l1, l2; local 222 atf_list_t l1, l2; local 240 atf_list_t l1, l2; local [all...] |
/freebsd-current/contrib/atf/atf-c/ |
H A D | utils_test.c | 323 const char *l1 = "First line with % formatting % characters %"; local 327 atf_utils_create_file("test.txt", "%s\n%s\n%s", l1, l2, l3); 335 ATF_REQUIRE_STREQ(l1, line);
|
/freebsd-current/contrib/bc/src/ |
H A D | num.c | 1287 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp; local 1330 bc_num_setup(&l1, dig_ptr, max); 1362 bc_num_split(a, max2, &l1, &h1); 1366 bc_num_sub(&h1, &l1, &m1, 0); 1386 if (BC_NUM_NONZERO(&l1) && BC_NUM_NONZERO(&l2)) 1388 assert(BC_NUM_RDX_VALID_NP(l1)); 1391 bc_num_m(&l1, &l2, &z0, 0);
|
/freebsd-current/contrib/diff/src/ |
H A D | cmp.c | 574 word const *l0, *l1; /* Pointers into each buffer. */ 587 for (l0 = p0, l1 = p1; (l = *l0) == *l1; l0++, l1++) 600 for (c0 = (char const *) l0, c1 = (char const *) l1; 619 word const *l0, *l1; 625 for (l0 = p0, l1 = p1; *l0 == *l1; l0++, l1++) 630 for (c0 = (char const *) l0, c1 = (char const *) l1; 569 word const *l0, *l1; /* Pointers into each buffer. */ local 613 word const *l0, *l1; local [all...] |
H A D | diff3.c | 907 char * const *l1 = list1; 913 if (!*l1 || !*l2 || *lgths1 != *lgths2++ 914 || memcmp (*l1++, *l2++, *lgths1++) != 0) 904 char * const *l1 = list1; local
|
H A D | ed.c | 43 lin f0, l0, f1, l1; 51 changes = analyze_hunk (hunk, &f0, &l0, &f1, &l1); 65 for (i = f1; i <= l1; i++) 97 lin i, f0, l0, f1, l1; 100 enum changes changes = analyze_hunk (hunk, &f0, &l0, &f1, &l1); 118 for (i = f1; i <= l1; i++) 140 lin i, f0, l0, f1, l1; 144 enum changes changes = analyze_hunk (hunk, &f0, &l0, &f1, &l1); 165 translate_range (&files[1], f1, l1, &tf1, &tl1); 169 for (i = f1; i <= l1; 42 lin f0, l0, f1, l1; local 95 lin i, f0, l0, f1, l1; local 137 lin i, f0, l0, f1, l1; local [all...] |
H A D | util.c | 667 lin l0, l1; 689 l1 = next->line1 + next->inserted - 1; 708 for (i = next->line1; i <= l1 && trivial; i++) 726 *last1 = l1; 658 lin l0, l1; local
|
/freebsd-current/contrib/googletest/googletest/test/ |
H A D | googletest-printers-test.cc | 1194 const list<int> l1(a1, a1 + 2); 1198 v.push_back(l1);
|
/freebsd-current/contrib/ldns/ |
H A D | dnssec_zone.c | 1127 ldns_rdf *l1, *l2; local 1170 l1 = ldns_dname_clone_from(cur_name, (uint8_t)lpos); 1172 l1 = NULL; 1176 if (!l1 || ldns_dname_compare(l1, l2) != 0) { 1186 ldns_rdf_deep_free(l1); 1198 ldns_rdf_deep_free(l1); 1207 ldns_rdf_deep_free(l1); 1215 ldns_rdf_deep_free(l1); 1224 ldns_rdf_deep_free(l1); [all...] |
H A D | radix.c | 1110 radix_strlen_t common_len = 0, l1 = 0, l2 = 0; local 1122 array->str, array->len, &s1, &l1)) { 1169 common->array[array->edge->parent_index].len = l1;
|
/freebsd-current/contrib/libarchive/libarchive/test/ |
H A D | main.c | 641 int l1, l2; local 647 l1 = (int)strlen(e1); 649 if (l1 < l2) 650 l1 = l2; 651 strdump(e1, v1, l1, utf8); 652 strdump(e2, v2, l1, utf8);
|
/freebsd-current/contrib/libarchive/test_utils/ |
H A D | test_main.c | 797 int l1, l2; local 803 l1 = (int)strlen(e1); 805 if (l1 < l2) 806 l1 = l2; 807 strdump(e1, v1, l1, utf8); 808 strdump(e2, v2, l1, utf8);
|
/freebsd-current/contrib/libdiff/compat/ |
H A D | merge.c | 98 u_char *f1, *f2, *t, *b, *tp2, *q, *l1, *l2; local 130 f2 = l1 = list1 + (p2 - list2); 134 while (f1 < l1 && f2 < l2) { 137 b = f1, t = l1; 206 } else if (f1 < l1) { 208 ICOPY_LIST(f1, tp2, l1); 210 CCOPY_LIST(f1, tp2, l1);
|
/freebsd-current/contrib/libpcap/ |
H A D | scanner.l | 293 l1 return L1;
|
/freebsd-current/contrib/llvm-project/compiler-rt/include/sanitizer/ |
H A D | dfsan_interface.h | 41 /// Computes the union of \c l1 and \c l2, resulting in a union label. 42 dfsan_label SANITIZER_CDECL dfsan_union(dfsan_label l1, dfsan_label l2);
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/dfsan/ |
H A D | dfsan.cpp | 161 dfsan_union(dfsan_label l1, dfsan_label l2) { argument 162 return l1 | l2;
|
H A D | dfsan.h | 33 dfsan_label dfsan_union(dfsan_label l1, dfsan_label l2);
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_allocator_size_class_map.h | 166 const uptr l1 = l - kMidSizeLog; local 167 return kMidClass + (l1 << S) + hbits + (lbits > 0);
|
H A D | sanitizer_deadlock_detector.h | 347 bool testOnlyHasEdge(uptr l1, uptr l2) { argument 348 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2));
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_dense_alloc.h | 104 for (uptr l1 = 0; l1 < fillpos; l1++) { 105 for (IndexT l2 = l1 == 0 ? 1 : 0; l2 < kL2Size; l2++) func(&map_[l1][l2]);
|
H A D | tsan_fd.cpp | 84 uptr l1 = atomic_load(pl1, memory_order_consume); local 85 if (l1 == 0) { 91 if (atomic_compare_exchange_strong(pl1, &l1, (uptr)p, memory_order_acq_rel)) 92 l1 = (uptr)p; 96 FdDesc *fds = reinterpret_cast<FdDesc *>(l1); 149 for (int l1 = 0; l1 < kTableSizeL1; l1++) { 150 FdDesc *tab = (FdDesc*)atomic_load(&fdctx.tab[l1], memory_order_relaxed); 161 for (int l1 [all...] |
/freebsd-current/contrib/llvm-project/libunwind/src/ |
H A D | UnwindRegistersRestore.S | 1110 ldx [%o0 + 0x88], %l1
|
/freebsd-current/contrib/llvm-project/lld/ELF/Arch/ |
H A D | ARM.cpp | 227 uint64_t l1 = in.plt->getVA() + 8; local 228 write32(buf + 16, gotPlt - l1 - 8); 274 uint64_t l1 = pltEntryAddr + 4; local 275 write32(buf + 12, gotPltEntryAddr - l1 - 8);
|
/freebsd-current/contrib/llvm-project/lldb/source/Plugins/TraceExporter/common/ |
H A D | TraceHTR.cpp | 212 auto are_passes_done = [](IHTRLayer &l1, IHTRLayer &l2) { 213 return l1.GetNumUnits() == l2.GetNumUnits();
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | DebugInfoMetadata.h | 3016 uint64_t l1 = A.OffsetInBits; local 3018 uint64_t r1 = l1 + A.SizeInBits; 3022 else if (r2 <= l1)
|