/external/protobuf/src/google/protobuf/compiler/javamicro/ |
javamicro_message.cc | 75 new const FieldDescriptor*[descriptor->field_count()]; 76 for (int i = 0; i < descriptor->field_count(); i++) { 79 sort(fields, fields + descriptor->field_count(), 117 for (int i = 0; i < type->field_count(); i++) { 214 for (int i = 0; i < descriptor_->field_count(); i++) { 245 if (descriptor_->field_count() > 0) { 258 for (int i = 0; i < descriptor_->field_count(); i++) { 281 for (int i = 0; i < descriptor_->field_count(); i++) { 333 for (int i = 0; i < descriptor_->field_count(); i++) { 397 for (int i = 0; i < descriptor_->field_count(); i++) [all...] |
javamicro_field.cc | 52 new scoped_ptr<FieldGenerator>[descriptor->field_count()]), 57 for (int i = 0; i < descriptor->field_count(); i++) {
|
/external/protobuf/src/google/protobuf/compiler/javanano/ |
javanano_message.cc | 75 new const FieldDescriptor*[descriptor->field_count()]; 76 for (int i = 0; i < descriptor->field_count(); i++) { 79 sort(fields, fields + descriptor->field_count(), 169 for (int i = 0; i < descriptor_->field_count(); i++) { 196 if (descriptor_->field_count() > 0) { 209 for (int i = 0; i < descriptor_->field_count(); i++) { 232 for (int i = 0; i < descriptor_->field_count(); i++) { 276 for (int i = 0; i < descriptor_->field_count(); i++) { 340 for (int i = 0; i < descriptor_->field_count(); i++) {
|
javanano_field.cc | 52 new scoped_ptr<FieldGenerator>[descriptor->field_count()]), 57 for (int i = 0; i < descriptor->field_count(); i++) {
|
/external/protobuf/src/google/protobuf/ |
reflection_ops_unittest.cc | 146 ASSERT_EQ(2, message1.unknown_fields().field_count()); 220 EXPECT_EQ(0, message.unknown_fields().field_count()); 237 EXPECT_EQ(1, message.unknown_fields().field_count()); 239 .unknown_fields().field_count()); 241 .unknown_fields().field_count()); 247 EXPECT_EQ(0, message.unknown_fields().field_count()); 249 .unknown_fields().field_count()); 251 .unknown_fields().field_count()); 268 EXPECT_EQ(1, message.unknown_fields().field_count()); 271 .unknown_fields().field_count()); [all...] |
unknown_field_set_unittest.cc | 71 for (int i = 0; i < unknown_fields_->field_count(); i++) { 86 for (int i = 0; i < unknown_fields_->field_count(); i++) { 120 ASSERT_LT(pos, unknown_fields_->field_count()); 124 ASSERT_LT(pos, unknown_fields_->field_count()); 129 EXPECT_EQ(unknown_fields_->field_count(), pos); 169 ASSERT_EQ(1, field->group().field_count()); 260 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0); 261 EXPECT_GT(other_message.unknown_fields().field_count(), 0); 273 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0); 276 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0) [all...] |
dynamic_message.cc | 242 for (int i = 0; i < descriptor->field_count(); i++) { 322 for (int i = 0; i < descriptor->field_count(); i++) { 389 for (int i = 0; i < descriptor->field_count(); i++) { 487 int* offsets = new int[type->field_count()]; 499 DivideRoundingUp(type->field_count(), bitsizeof(uint32)); 514 for (int i = 0; i < type->field_count(); i++) {
|
unknown_field_set.h | 89 inline int field_count() const; 90 // Get a field in the set, where 0 <= index < field_count(). The fields 94 // 0 <= index < field_count(). The fields appear in the order in which 199 inline int UnknownFieldSet::field_count() const { function in class:google::protobuf::UnknownFieldSet
|
generated_message_reflection_unittest.cc | 202 EXPECT_EQ(1, message1.unknown_fields().field_count()); 203 EXPECT_EQ(0, message2.unknown_fields().field_count()); 206 EXPECT_EQ(0, message1.unknown_fields().field_count()); 207 EXPECT_EQ(1, message2.unknown_fields().field_count());
|
reflection_ops.cc | 140 for (int i = 0; i < descriptor->field_count(); i++) { 225 for (int i = 0; i < descriptor->field_count(); i++) {
|
wire_format.cc | 164 for (int i = 0; i < unknown_fields.field_count(); i++) { 202 for (int i = 0; i < unknown_fields.field_count(); i++) { 237 for (int i = 0; i < unknown_fields.field_count(); i++) { 265 for (int i = 0; i < unknown_fields.field_count(); i++) { 301 for (int i = 0; i < unknown_fields.field_count(); i++) { 349 for (int i = 0; i < unknown_fields.field_count(); i++) { [all...] |
/external/protobuf/src/google/protobuf/compiler/cpp/ |
cpp_message.cc | 88 new const FieldDescriptor*[descriptor->field_count()]; 89 for (int i = 0; i < descriptor->field_count(); i++) { 92 sort(fields, fields + descriptor->field_count(), 126 for (int i = 0; i < type->field_count(); i++) { 214 for (int i = 0; i < descriptor_->field_count(); i++) { 251 for (int i = 0; i < descriptor_->field_count(); i++) { 305 vars["field_count"] = SimpleItoa(descriptor_->field_count()); 466 for (int i = 0; i < descriptor_->field_count(); i++) { 488 if (descriptor_->field_count() > 0) [all...] |
cpp_field.cc | 86 new scoped_ptr<FieldGenerator>[descriptor->field_count()]) { 88 for (int i = 0; i < descriptor->field_count(); i++) {
|
/external/protobuf/src/google/protobuf/compiler/java/ |
java_message.cc | 83 new const FieldDescriptor*[descriptor->field_count()]; 84 for (int i = 0; i < descriptor->field_count(); i++) { 87 sort(fields, fields + descriptor->field_count(), 125 for (int i = 0; i < type->field_count(); i++) { 230 for (int i = 0; i < descriptor_->field_count(); i++) { 343 for (int i = 0; i < descriptor_->field_count(); i++) { 356 for (int i = 0; i < descriptor_->field_count(); i++) { 437 i < descriptor_->field_count() || j < sorted_extensions.size(); 439 if (i == descriptor_->field_count()) { 472 for (int i = 0; i < descriptor_->field_count(); i++) [all...] |
java_field.cc | 62 new scoped_ptr<FieldGenerator>[descriptor->field_count()]), 67 for (int i = 0; i < descriptor->field_count(); i++) {
|
/external/chromium/chrome/browser/autofill/ |
form_structure_unittest.cc | 75 EXPECT_EQ(3U, form_structure.field_count()); 263 ASSERT_EQ(9U, form_structure->field_count()); 365 ASSERT_EQ(10U, form_structure->field_count()); 451 ASSERT_EQ(7U, form_structure->field_count()); 535 ASSERT_EQ(9U, form_structure->field_count()); 603 ASSERT_EQ(6U, form_structure->field_count()); 673 ASSERT_EQ(7U, form_structure->field_count()); [all...] |
form_structure.cc | 98 for (size_t index = 0; index < field_count(); index++) { 316 if (field_count() < kRequiredFillableFields) 331 for (size_t i = 0; i < cached_form.field_count(); ++i) { 358 for (size_t i = 0; i < field_count(); ++i) { 470 int num_fields = static_cast<int>(field_count()); 480 size_t FormStructure::field_count() const { function in class:FormStructure 537 if (!field_count()) // Nothing to add. 545 if (field_count() > kMaxFieldsOnTheForm) 549 for (size_t index = 0; index < field_count(); ++index) { 585 for (size_t i = 0; i < field_count(); ++i) [all...] |
form_structure.h | 98 size_t field_count() const;
|
autofill_manager.cc | 122 *section_end = form.field_count(); 126 for (size_t i = 0; i < form.field_count(); ++i) { 205 while (k < form_structure->field_count() && 211 if (k >= form_structure->field_count()) 683 for (size_t i = 0; i < submitted_form->field_count(); i++) { 869 form_fields.reserve(form->field_count()); [all...] |
/bionic/libc/kernel/common/linux/ |
audit.h | 341 __u32 field_count; member in struct:audit_rule_data 355 __u32 field_count; member in struct:audit_rule
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
audit.h | 324 __u32 field_count; member in struct:audit_rule_data 340 __u32 field_count; member in struct:audit_rule
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
audit.h | 324 __u32 field_count; member in struct:audit_rule_data 340 __u32 field_count; member in struct:audit_rule
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
audit.h | 324 __u32 field_count; member in struct:audit_rule_data 340 __u32 field_count; member in struct:audit_rule
|
/external/v8/tools/ |
gc-nvp-trace-processor.py | 74 fields[field] = field_count 75 field_count = field_count + 1
|
/external/kernel-headers/original/linux/ |
audit.h | 380 __u32 field_count; member in struct:audit_rule_data 396 __u32 field_count; member in struct:audit_rule 429 u32 field_count; member in struct:audit_krule
|