HomeSort by: relevance | last modified time | path
    Searched refs:bv1 (Results 1 - 8 of 8) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_bitvector_test.cc 80 BV bv, bv1, t_bv; local
120 bv1.clear();
131 bv1.setBit(bits[bv.size() / 2 + i]);
134 CheckBV(bv1, s1);
139 EXPECT_EQ(bv.intersectsWith(bv1), !vec.empty());
145 EXPECT_EQ(t_bv.setUnion(bv1), s.size() != t_s.size());
151 EXPECT_EQ(t_bv.setIntersection(bv1), s.size() != t_s.size());
160 EXPECT_EQ(t_bv.setDifference(bv1), s.size() != t_s.size());
  /src/external/bsd/openldap/dist/libraries/liblunicode/
ucstr.c 329 struct berval *bv1,
342 if (bv1 == NULL) {
349 l1 = bv1->bv_len;
357 s1 = bv1->bv_val;
  /src/external/bsd/openldap/dist/servers/slapd/
value.c 623 struct berval bv1, bv2; local
642 bv1 = *v1;
662 if ( bv1.bv_val[0] == '{' ) {
663 ptr = ber_bvchr( &bv1, '}' );
665 ns1.bv_val = bv1.bv_val + 1;
670 bv1.bv_len -= ptr - bv1.bv_val;
671 bv1.bv_val = ptr;
672 v1 = &bv1;
entry.c 108 #define bvcasematch(bv1, bv2) (ber_bvstrcasecmp(bv1, bv2) == 0)
proto-slap.h 918 #define bvmatch(bv1, bv2) ( ((bv1)->bv_len == (bv2)->bv_len) && (memcmp((bv1)->bv_val, (bv2)->bv_val, (bv1)->bv_len) == 0) )
syncrepl.c 2662 struct berval *bv1, *bv2; local
2666 bv1 = m1->sml_nvalues;
2669 bv1 = m1->sml_values;
2673 if ( !ber_bvcmp( &bv1[i], &bv2[j] )) {
  /src/external/bsd/openldap/dist/servers/slapd/back-mdb/
id2entry.c 79 struct berval bv1, bv2; local
91 bv1.bv_val = usrkey[1].mv_data;
92 bv1.bv_len = usrkey[1].mv_size;
100 ad->ad_type->sat_syntax, mr, &bv1, &bv2);
102 match = ber_bvcmp(&bv1, &bv2);
  /src/external/bsd/openldap/dist/servers/slapd/overlays/
pcache.c 922 static int lex_bvcmp( struct berval *bv1, struct berval *bv2 )
925 dif = bv1->bv_len - bv2->bv_len;
926 len = bv1->bv_len;
928 len = memcmp( bv1->bv_val, bv2->bv_val, len );

Completed in 31 milliseconds