Home
last modified time | relevance | path

Searched refs:hasbit (Results 1 – 14 of 14) sorted by relevance

/external/rust/crates/grpcio-sys/grpc/third_party/upb/upb/
Dhandlers.c456 int32_t hasbit; member
464 if (d->hasbit > 0) \
465 *(uint8_t*)&m[d->hasbit / 8] |= 1 << (d->hasbit % 8); \
479 size_t offset, int32_t hasbit) { in MSG_WRITER()
486 d->hasbit = hasbit; in MSG_WRITER()
518 int32_t *hasbit) { in upb_msg_getscalarhandlerdata() argument
543 *hasbit = d->hasbit; in upb_msg_getscalarhandlerdata()
Dhandlers.h715 int32_t hasbit);
723 int32_t *hasbit);
Ddef.c1034 size_t hasbit; in make_layout() local
1092 for (upb_msg_field_begin(&it, m), hasbit = 0; in make_layout()
1124 field->presence = ++hasbit; in make_layout()
1131 l->size = div_round_up(hasbit, 8); in make_layout()
/external/cronet/third_party/protobuf/src/google/protobuf/
Dgenerated_message_util.h136 inline bool IsPresent(const void* base, uint32_t hasbit) { in IsPresent() argument
138 return (has_bits_array[hasbit / 32] & (1u << (hasbit & 31))) != 0; in IsPresent()
/external/protobuf/src/google/protobuf/
Dgenerated_message_util.h136 inline bool IsPresent(const void* base, uint32_t hasbit) { in IsPresent() argument
138 return (has_bits_array[hasbit / 32] & (1u << (hasbit & 31))) != 0; in IsPresent()
/external/protobuf/src/google/protobuf/compiler/cpp/
Dmessage.cc728 int hasbit = HasBitIndex(field); in HasByteIndex() local
729 return hasbit == kNoHasbit ? kNoHasbit : hasbit / 8; in HasByteIndex()
733 int hasbit = HasBitIndex(field); in HasWordIndex() local
734 return hasbit == kNoHasbit ? kNoHasbit : hasbit / 32; in HasWordIndex()
/external/cronet/third_party/protobuf/src/google/protobuf/compiler/cpp/
Dcpp_message.cc731 int hasbit = HasBitIndex(field); in HasByteIndex() local
732 return hasbit == kNoHasbit ? kNoHasbit : hasbit / 8; in HasByteIndex()
736 int hasbit = HasBitIndex(field); in HasWordIndex() local
737 return hasbit == kNoHasbit ? kNoHasbit : hasbit / 32; in HasWordIndex()
/external/protobuf/docs/
Dimplementing_proto3_presence.md349 the hasbit to determine if the oneof is present or not.
351 method like `Reflection::HasField()` should know to look for the hasbit for a
/external/cronet/third_party/protobuf/docs/
Dimplementing_proto3_presence.md349 the hasbit to determine if the oneof is present or not.
351 method like `Reflection::HasField()` should know to look for the hasbit for a
/external/cldr/common/testData/transforms/
Dund-Latn-t-und-orya.txt1001 ହସ୍ବିତା hasbitā
/external/protobuf/ruby/ext/google/protobuf_c/
Druby-upb.c6705 size_t hasbit = 0; in make_layout() local
6711 field->presence = ++hasbit; in make_layout()
6712 if (hasbit >= 63) { in make_layout()
6744 field->presence = ++hasbit; in make_layout()
6751 l->size = hasbit ? div_round_up(hasbit + 1, 8) : 0; in make_layout()
/external/cronet/third_party/protobuf/ruby/ext/google/protobuf_c/
Druby-upb.c6705 size_t hasbit = 0; in make_layout() local
6711 field->presence = ++hasbit; in make_layout()
6712 if (hasbit >= 63) { in make_layout()
6744 field->presence = ++hasbit; in make_layout()
6751 l->size = hasbit ? div_round_up(hasbit + 1, 8) : 0; in make_layout()
/external/cronet/third_party/protobuf/php/ext/google/protobuf/
Dphp-upb.c6995 size_t hasbit = 0; in make_layout() local
7001 field->presence = ++hasbit; in make_layout()
7002 if (hasbit >= 63) { in make_layout()
7034 field->presence = ++hasbit; in make_layout()
7041 l->size = hasbit ? div_round_up(hasbit + 1, 8) : 0; in make_layout()
/external/protobuf/php/ext/google/protobuf/
Dphp-upb.c6995 size_t hasbit = 0; in make_layout() local
7001 field->presence = ++hasbit; in make_layout()
7002 if (hasbit >= 63) { in make_layout()
7034 field->presence = ++hasbit; in make_layout()
7041 l->size = hasbit ? div_round_up(hasbit + 1, 8) : 0; in make_layout()