out2x 8build/make/tools/ide_query/prober_scripts/cpp/general.cc8build/make/tools/ide_query/prober_scripts/cpp/general.cc: 8build/make/tools/ide_query/prober_scripts/cpp/general.cc8build/make/tools/ide_query/prober_scripts/cpp/general.cc"8prebuilts/clang/host/linux-x86/clang-r563880/bin/clang++" -nostdlibinc"-mthumb"-Os"-fomit-frame-pointer"-mllvm"-enable-shrink-wrap=false"-O2"-Wall"-Wextra"-Wpointer-arith"-Wunguarded-availability"-Werror=bool-operation"-Werror=date-time"-Werror=int-conversion"-Werror=multichar"-Werror=pragma-pack"&-Werror=pragma-pack-suspicious-include"-Werror=sizeof-array-div" -Werror=sizeof-pointer-memaccess"-Werror=string-plus-int"'-Werror=unreachable-code-loop-increment""-Wno-error=deprecated-declarations"-Wno-c23-extensions"-Wno-c99-designator"-Wno-gnu-folding-constant""-Wno-inconsistent-missing-override"-Wno-error=reorder-init-list"-Wno-reorder-init-list"-Wno-sign-compare" -Wno-unused" -DANDROID"-DNDEBUG"-UDEBUG"(-D__compiler_offsetof=__builtin_offsetof"*-D__ANDROID_UNAVAILABLE_SYMBOLS_ARE_WEAK__" -faddrsig"-fdebug-default-version=5"-fcolor-diagnostics"-ffp-contract=off"-fno-exceptions"-fno-strict-aliasing"-fmessage-length=0"-gsimple-template-names"-gz=zstd"-no-canonical-prefixes""-fdebug-prefix-map=/proc/self/cwd="-ftrivial-auto-var-init=zero"-g"-ffunction-sections"-fdata-sections"-fno-short-enums"-funwind-tables"-fstack-protector-strong"-Wa,--noexecstack"-D_FORTIFY_SOURCE=3"-Werror=non-virtual-dtor"-Werror=address"-Werror=sequence-point"-Werror=format-security" -msoft-float"-march=armv7-a"-mfloat-abi=softfp" -mfpu=neon"/-Ibuild/make/tools/ide_query/prober_scripts/cpp"-Iout/soong/.intermediates/build/make/tools/ide_query/prober_scripts/cpp/ide_query_proberscript_cc/android_arm_armv7-a-neon/gen/proto/build/make/tools/ide_query/prober_scripts/cpp"-Iout/soong/.intermediates/build/make/tools/ide_query/prober_scripts/cpp/ide_query_proberscript_cc/android_arm_armv7-a-neon/gen/proto"-D__LIBC_API__=10000"-D__LIBM_API__=10000"-D__LIBDL_API__=10000"-Iexternal/protobuf/src"k-Iout/soong/.intermediates/external/abseil-cpp/absl_base_config_hdrs/gen/external/abseil-cpp/my_include_dir"W-Iout/soong/.intermediates/external/abseil-cpp/absl_base_config_hdrs/gen/my_include_dir"q-Iout/soong/.intermediates/external/abseil-cpp/absl_base_core_headers_hdrs/gen/external/abseil-cpp/my_include_dir"]-Iout/soong/.intermediates/external/abseil-cpp/absl_base_core_headers_hdrs/gen/my_include_dir"x-Iout/soong/.intermediates/external/abseil-cpp/absl_base_dynamic_annotations_hdrs/gen/external/abseil-cpp/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_base_dynamic_annotations_hdrs/gen/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_meta_type_traits_hdrs/gen/external/abseil-cpp/my_include_dir"\-Iout/soong/.intermediates/external/abseil-cpp/absl_meta_type_traits_hdrs/gen/my_include_dir"g-Iout/soong/.intermediates/external/abseil-cpp/absl_utility_hdrs/gen/external/abseil-cpp/my_include_dir"S-Iout/soong/.intermediates/external/abseil-cpp/absl_utility_hdrs/gen/my_include_dir"n-Iout/soong/.intermediates/external/abseil-cpp/absl_types_optional_hdrs/gen/external/abseil-cpp/my_include_dir"Z-Iout/soong/.intermediates/external/abseil-cpp/absl_types_optional_hdrs/gen/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_container_common_hdrs/gen/external/abseil-cpp/my_include_dir"\-Iout/soong/.intermediates/external/abseil-cpp/absl_container_common_hdrs/gen/my_include_dir"~-Iout/soong/.intermediates/external/abseil-cpp/absl_container_common_policy_traits_hdrs/gen/external/abseil-cpp/my_include_dir"j-Iout/soong/.intermediates/external/abseil-cpp/absl_container_common_policy_traits_hdrs/gen/my_include_dir"z-Iout/soong/.intermediates/external/abseil-cpp/absl_container_compressed_tuple_hdrs/gen/external/abseil-cpp/my_include_dir"f-Iout/soong/.intermediates/external/abseil-cpp/absl_container_compressed_tuple_hdrs/gen/my_include_dir"f-Iout/soong/.intermediates/external/abseil-cpp/absl_memory_hdrs/gen/external/abseil-cpp/my_include_dir"R-Iout/soong/.intermediates/external/abseil-cpp/absl_memory_hdrs/gen/my_include_dir"z-Iout/soong/.intermediates/external/abseil-cpp/absl_container_container_memory_hdrs/gen/external/abseil-cpp/my_include_dir"f-Iout/soong/.intermediates/external/abseil-cpp/absl_container_container_memory_hdrs/gen/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_base_atomic_hook_hdrs/gen/external/abseil-cpp/my_include_dir"\-Iout/soong/.intermediates/external/abseil-cpp/absl_base_atomic_hook_hdrs/gen/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_base_base_internal_hdrs/gen/external/abseil-cpp/my_include_dir"^-Iout/soong/.intermediates/external/abseil-cpp/absl_base_base_internal_hdrs/gen/my_include_dir"x-Iout/soong/.intermediates/external/abseil-cpp/absl_base_cycleclock_internal_hdrs/gen/external/abseil-cpp/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_base_cycleclock_internal_hdrs/gen/my_include_dir"q-Iout/soong/.intermediates/external/abseil-cpp/absl_base_log_severity_hdrs/gen/external/abseil-cpp/my_include_dir"]-Iout/soong/.intermediates/external/abseil-cpp/absl_base_log_severity_hdrs/gen/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_base_nullability_hdrs/gen/external/abseil-cpp/my_include_dir"\-Iout/soong/.intermediates/external/abseil-cpp/absl_base_nullability_hdrs/gen/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_base_errno_saver_hdrs/gen/external/abseil-cpp/my_include_dir"\-Iout/soong/.intermediates/external/abseil-cpp/absl_base_errno_saver_hdrs/gen/my_include_dir"y-Iout/soong/.intermediates/external/abseil-cpp/absl_base_raw_logging_internal_hdrs/gen/external/abseil-cpp/my_include_dir"e-Iout/soong/.intermediates/external/abseil-cpp/absl_base_raw_logging_internal_hdrs/gen/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_base_spinlock_wait_hdrs/gen/external/abseil-cpp/my_include_dir"^-Iout/soong/.intermediates/external/abseil-cpp/absl_base_spinlock_wait_hdrs/gen/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_base_hdrs/gen/external/abseil-cpp/my_include_dir"P-Iout/soong/.intermediates/external/abseil-cpp/absl_base_hdrs/gen/my_include_dir"k-Iout/soong/.intermediates/external/abseil-cpp/absl_base_endian_hdrs/gen/external/abseil-cpp/my_include_dir"W-Iout/soong/.intermediates/external/abseil-cpp/absl_base_endian_hdrs/gen/my_include_dir"l-Iout/soong/.intermediates/external/abseil-cpp/absl_numeric_bits_hdrs/gen/external/abseil-cpp/my_include_dir"X-Iout/soong/.intermediates/external/abseil-cpp/absl_numeric_bits_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_bounded_utf8_length_sequence_hdrs/gen/external/abseil-cpp/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_bounded_utf8_length_sequence_hdrs/gen/my_include_dir"}-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_utf8_for_code_point_hdrs/gen/external/abseil-cpp/my_include_dir"i-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_utf8_for_code_point_hdrs/gen/my_include_dir"~-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_decode_rust_punycode_hdrs/gen/external/abseil-cpp/my_include_dir"j-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_decode_rust_punycode_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_demangle_rust_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_demangle_rust_hdrs/gen/my_include_dir"{-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_demangle_internal_hdrs/gen/external/abseil-cpp/my_include_dir"g-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_demangle_internal_hdrs/gen/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_base_throw_delegate_hdrs/gen/external/abseil-cpp/my_include_dir"_-Iout/soong/.intermediates/external/abseil-cpp/absl_base_throw_delegate_hdrs/gen/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_string_view_hdrs/gen/external/abseil-cpp/my_include_dir"_-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_string_view_hdrs/gen/my_include_dir"o-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_charset_hdrs/gen/external/abseil-cpp/my_include_dir"[-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_charset_hdrs/gen/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_internal_hdrs/gen/external/abseil-cpp/my_include_dir"\-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_internal_hdrs/gen/my_include_dir"}-Iout/soong/.intermediates/external/abseil-cpp/absl_base_iterator_traits_internal_hdrs/gen/external/abseil-cpp/my_include_dir"i-Iout/soong/.intermediates/external/abseil-cpp/absl_base_iterator_traits_internal_hdrs/gen/my_include_dir"m-Iout/soong/.intermediates/external/abseil-cpp/absl_types_compare_hdrs/gen/external/abseil-cpp/my_include_dir"Y-Iout/soong/.intermediates/external/abseil-cpp/absl_types_compare_hdrs/gen/my_include_dir"n-Iout/soong/.intermediates/external/abseil-cpp/absl_numeric_int128_hdrs/gen/external/abseil-cpp/my_include_dir"Z-Iout/soong/.intermediates/external/abseil-cpp/absl_numeric_int128_hdrs/gen/my_include_dir"g-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_hdrs/gen/external/abseil-cpp/my_include_dir"S-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_hdrs/gen/my_include_dir"i-Iout/soong/.intermediates/external/abseil-cpp/absl_algorithm_hdrs/gen/external/abseil-cpp/my_include_dir"U-Iout/soong/.intermediates/external/abseil-cpp/absl_algorithm_hdrs/gen/my_include_dir"y-Iout/soong/.intermediates/external/abseil-cpp/absl_hash_weakly_mixed_integer_hdrs/gen/external/abseil-cpp/my_include_dir"e-Iout/soong/.intermediates/external/abseil-cpp/absl_hash_weakly_mixed_integer_hdrs/gen/my_include_dir"j-Iout/soong/.intermediates/external/abseil-cpp/absl_types_span_hdrs/gen/external/abseil-cpp/my_include_dir"V-Iout/soong/.intermediates/external/abseil-cpp/absl_types_span_hdrs/gen/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_container_layout_hdrs/gen/external/abseil-cpp/my_include_dir"\-Iout/soong/.intermediates/external/abseil-cpp/absl_container_layout_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_container_inlined_vector_internal_hdrs/gen/external/abseil-cpp/my_include_dir"m-Iout/soong/.intermediates/external/abseil-cpp/absl_container_inlined_vector_internal_hdrs/gen/my_include_dir"x-Iout/soong/.intermediates/external/abseil-cpp/absl_container_inlined_vector_hdrs/gen/external/abseil-cpp/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_container_inlined_vector_hdrs/gen/my_include_dir"n-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_cpu_detect_hdrs/gen/external/abseil-cpp/my_include_dir"Z-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_cpu_detect_hdrs/gen/my_include_dir"m-Iout/soong/.intermediates/external/abseil-cpp/absl_base_prefetch_hdrs/gen/external/abseil-cpp/my_include_dir"Y-Iout/soong/.intermediates/external/abseil-cpp/absl_base_prefetch_hdrs/gen/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_crc_internal_hdrs/gen/external/abseil-cpp/my_include_dir"\-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_crc_internal_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_non_temporal_arm_intrinsics_hdrs/gen/external/abseil-cpp/my_include_dir"k-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_non_temporal_arm_intrinsics_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_non_temporal_memcpy_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_non_temporal_memcpy_hdrs/gen/my_include_dir"u-Iout/soong/.intermediates/external/abseil-cpp/absl_container_fixed_array_hdrs/gen/external/abseil-cpp/my_include_dir"a-Iout/soong/.intermediates/external/abseil-cpp/absl_container_fixed_array_hdrs/gen/my_include_dir"x-Iout/soong/.intermediates/external/abseil-cpp/absl_functional_any_invocable_hdrs/gen/external/abseil-cpp/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_functional_any_invocable_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_functional_function_ref_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_functional_function_ref_hdrs/gen/my_include_dir"v-Iout/soong/.intermediates/external/abseil-cpp/absl_numeric_representation_hdrs/gen/external/abseil-cpp/my_include_dir"b-Iout/soong/.intermediates/external/abseil-cpp/absl_numeric_representation_hdrs/gen/my_include_dir"{-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_str_format_internal_hdrs/gen/external/abseil-cpp/my_include_dir"g-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_str_format_internal_hdrs/gen/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_str_format_hdrs/gen/external/abseil-cpp/my_include_dir"^-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_str_format_hdrs/gen/my_include_dir"j-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_crc32c_hdrs/gen/external/abseil-cpp/my_include_dir"V-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_crc32c_hdrs/gen/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_base_no_destructor_hdrs/gen/external/abseil-cpp/my_include_dir"^-Iout/soong/.intermediates/external/abseil-cpp/absl_base_no_destructor_hdrs/gen/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_crc_cord_state_hdrs/gen/external/abseil-cpp/my_include_dir"^-Iout/soong/.intermediates/external/abseil-cpp/absl_crc_crc_cord_state_hdrs/gen/my_include_dir"u-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cord_internal_hdrs/gen/external/abseil-cpp/my_include_dir"a-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cord_internal_hdrs/gen/my_include_dir"|-Iout/soong/.intermediates/external/abseil-cpp/absl_profiling_exponential_biased_hdrs/gen/external/abseil-cpp/my_include_dir"h-Iout/soong/.intermediates/external/abseil-cpp/absl_profiling_exponential_biased_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_functions_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_functions_hdrs/gen/my_include_dir"t-Iout/soong/.intermediates/external/abseil-cpp/absl_base_malloc_internal_hdrs/gen/external/abseil-cpp/my_include_dir"`-Iout/soong/.intermediates/external/abseil-cpp/absl_base_malloc_internal_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_synchronization_graphcycles_internal_hdrs/gen/external/abseil-cpp/my_include_dir"p-Iout/soong/.intermediates/external/abseil-cpp/absl_synchronization_graphcycles_internal_hdrs/gen/my_include_dir"}-Iout/soong/.intermediates/external/abseil-cpp/absl_time_internal_cctz_civil_time_hdrs/gen/external/abseil-cpp/my_include_dir"i-Iout/soong/.intermediates/external/abseil-cpp/absl_time_internal_cctz_civil_time_hdrs/gen/my_include_dir"|-Iout/soong/.intermediates/external/abseil-cpp/absl_time_internal_cctz_time_zone_hdrs/gen/external/abseil-cpp/my_include_dir"h-Iout/soong/.intermediates/external/abseil-cpp/absl_time_internal_cctz_time_zone_hdrs/gen/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_time_hdrs/gen/external/abseil-cpp/my_include_dir"P-Iout/soong/.intermediates/external/abseil-cpp/absl_time_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_synchronization_kernel_timeout_internal_hdrs/gen/external/abseil-cpp/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_synchronization_kernel_timeout_internal_hdrs/gen/my_include_dir"u-Iout/soong/.intermediates/external/abseil-cpp/absl_base_tracing_internal_hdrs/gen/external/abseil-cpp/my_include_dir"a-Iout/soong/.intermediates/external/abseil-cpp/absl_base_tracing_internal_hdrs/gen/my_include_dir"|-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_debugging_internal_hdrs/gen/external/abseil-cpp/my_include_dir"h-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_debugging_internal_hdrs/gen/my_include_dir"t-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_stacktrace_hdrs/gen/external/abseil-cpp/my_include_dir"`-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_stacktrace_hdrs/gen/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_symbolize_hdrs/gen/external/abseil-cpp/my_include_dir"_-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_symbolize_hdrs/gen/my_include_dir"o-Iout/soong/.intermediates/external/abseil-cpp/absl_synchronization_hdrs/gen/external/abseil-cpp/my_include_dir"[-Iout/soong/.intermediates/external/abseil-cpp/absl_synchronization_hdrs/gen/my_include_dir"t-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_handle_hdrs/gen/external/abseil-cpp/my_include_dir"`-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_handle_hdrs/gen/my_include_dir"|-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_update_tracker_hdrs/gen/external/abseil-cpp/my_include_dir"h-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_update_tracker_hdrs/gen/my_include_dir"x-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_statistics_hdrs/gen/external/abseil-cpp/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_statistics_hdrs/gen/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_info_hdrs/gen/external/abseil-cpp/my_include_dir"^-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_info_hdrs/gen/my_include_dir"z-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_update_scope_hdrs/gen/external/abseil-cpp/my_include_dir"f-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cordz_update_scope_hdrs/gen/my_include_dir"l-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cord_hdrs/gen/external/abseil-cpp/my_include_dir"X-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_cord_hdrs/gen/my_include_dir"o-Iout/soong/.intermediates/external/abseil-cpp/absl_container_btree_hdrs/gen/external/abseil-cpp/my_include_dir"[-Iout/soong/.intermediates/external/abseil-cpp/absl_container_btree_hdrs/gen/my_include_dir"i-Iout/soong/.intermediates/external/abseil-cpp/absl_hash_city_hdrs/gen/external/abseil-cpp/my_include_dir"U-Iout/soong/.intermediates/external/abseil-cpp/absl_hash_city_hdrs/gen/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_hash_low_level_hash_hdrs/gen/external/abseil-cpp/my_include_dir"_-Iout/soong/.intermediates/external/abseil-cpp/absl_hash_low_level_hash_hdrs/gen/my_include_dir"m-Iout/soong/.intermediates/external/abseil-cpp/absl_types_variant_hdrs/gen/external/abseil-cpp/my_include_dir"Y-Iout/soong/.intermediates/external/abseil-cpp/absl_types_variant_hdrs/gen/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_hash_hdrs/gen/external/abseil-cpp/my_include_dir"P-Iout/soong/.intermediates/external/abseil-cpp/absl_hash_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hash_function_defaults_hdrs/gen/external/abseil-cpp/my_include_dir"l-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hash_function_defaults_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hash_container_defaults_hdrs/gen/external/abseil-cpp/my_include_dir"m-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hash_container_defaults_hdrs/gen/my_include_dir"|-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hash_policy_traits_hdrs/gen/external/abseil-cpp/my_include_dir"h-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hash_policy_traits_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hashtable_control_bytes_hdrs/gen/external/abseil-cpp/my_include_dir"m-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hashtable_control_bytes_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hashtable_debug_hooks_hdrs/gen/external/abseil-cpp/my_include_dir"k-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hashtable_debug_hooks_hdrs/gen/my_include_dir"y-Iout/soong/.intermediates/external/abseil-cpp/absl_profiling_sample_recorder_hdrs/gen/external/abseil-cpp/my_include_dir"e-Iout/soong/.intermediates/external/abseil-cpp/absl_profiling_sample_recorder_hdrs/gen/my_include_dir"|-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hashtablez_sampler_hdrs/gen/external/abseil-cpp/my_include_dir"h-Iout/soong/.intermediates/external/abseil-cpp/absl_container_hashtablez_sampler_hdrs/gen/my_include_dir"-Iout/soong/.intermediates/external/abseil-cpp/absl_container_raw_hash_set_resize_impl_hdrs/gen/external/abseil-cpp/my_include_dir"n-Iout/soong/.intermediates/external/abseil-cpp/absl_container_raw_hash_set_resize_impl_hdrs/gen/my_include_dir"v-Iout/soong/.intermediates/external/abseil-cpp/absl_container_raw_hash_set_hdrs/gen/external/abseil-cpp/my_include_dir"b-Iout/soong/.intermediates/external/abseil-cpp/absl_container_raw_hash_set_hdrs/gen/my_include_dir"v-Iout/soong/.intermediates/external/abseil-cpp/absl_container_raw_hash_map_hdrs/gen/external/abseil-cpp/my_include_dir"b-Iout/soong/.intermediates/external/abseil-cpp/absl_container_raw_hash_map_hdrs/gen/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_algorithm_container_hdrs/gen/external/abseil-cpp/my_include_dir"_-Iout/soong/.intermediates/external/abseil-cpp/absl_algorithm_container_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_container_flat_hash_map_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_container_flat_hash_map_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_container_flat_hash_set_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_container_flat_hash_set_hdrs/gen/my_include_dir"v-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_nullguard_hdrs/gen/external/abseil-cpp/my_include_dir"b-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_nullguard_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_nullstream_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_nullstream_hdrs/gen/my_include_dir"}-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_append_truncated_hdrs/gen/external/abseil-cpp/my_include_dir"i-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_append_truncated_hdrs/gen/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_config_hdrs/gen/external/abseil-cpp/my_include_dir"_-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_config_hdrs/gen/my_include_dir"t-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_globals_hdrs/gen/external/abseil-cpp/my_include_dir"`-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_globals_hdrs/gen/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_format_hdrs/gen/external/abseil-cpp/my_include_dir"_-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_format_hdrs/gen/my_include_dir"x-Iout/soong/.intermediates/external/abseil-cpp/absl_cleanup_cleanup_internal_hdrs/gen/external/abseil-cpp/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_cleanup_cleanup_internal_hdrs/gen/my_include_dir"g-Iout/soong/.intermediates/external/abseil-cpp/absl_cleanup_hdrs/gen/external/abseil-cpp/my_include_dir"S-Iout/soong/.intermediates/external/abseil-cpp/absl_cleanup_hdrs/gen/my_include_dir"t-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_fnmatch_hdrs/gen/external/abseil-cpp/my_include_dir"`-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_fnmatch_hdrs/gen/my_include_dir"x-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_vlog_config_hdrs/gen/external/abseil-cpp/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_vlog_config_hdrs/gen/my_include_dir"k-Iout/soong/.intermediates/external/abseil-cpp/absl_log_globals_hdrs/gen/external/abseil-cpp/my_include_dir"W-Iout/soong/.intermediates/external/abseil-cpp/absl_log_globals_hdrs/gen/my_include_dir"m-Iout/soong/.intermediates/external/abseil-cpp/absl_log_log_entry_hdrs/gen/external/abseil-cpp/my_include_dir"Y-Iout/soong/.intermediates/external/abseil-cpp/absl_log_log_entry_hdrs/gen/my_include_dir"l-Iout/soong/.intermediates/external/abseil-cpp/absl_log_log_sink_hdrs/gen/external/abseil-cpp/my_include_dir"X-Iout/soong/.intermediates/external/abseil-cpp/absl_log_log_sink_hdrs/gen/my_include_dir"y-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_log_sink_set_hdrs/gen/external/abseil-cpp/my_include_dir"e-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_log_sink_set_hdrs/gen/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_proto_hdrs/gen/external/abseil-cpp/my_include_dir"^-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_proto_hdrs/gen/my_include_dir"}-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_structured_proto_hdrs/gen/external/abseil-cpp/my_include_dir"i-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_structured_proto_hdrs/gen/my_include_dir"m-Iout/soong/.intermediates/external/abseil-cpp/absl_base_strerror_hdrs/gen/external/abseil-cpp/my_include_dir"Y-Iout/soong/.intermediates/external/abseil-cpp/absl_base_strerror_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_examine_stack_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_examine_stack_hdrs/gen/my_include_dir"u-Iout/soong/.intermediates/external/abseil-cpp/absl_log_log_sink_registry_hdrs/gen/external/abseil-cpp/my_include_dir"a-Iout/soong/.intermediates/external/abseil-cpp/absl_log_log_sink_registry_hdrs/gen/my_include_dir"x-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_log_message_hdrs/gen/external/abseil-cpp/my_include_dir"d-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_log_message_hdrs/gen/my_include_dir"r-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_strip_hdrs/gen/external/abseil-cpp/my_include_dir"^-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_strip_hdrs/gen/my_include_dir"t-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_leak_check_hdrs/gen/external/abseil-cpp/my_include_dir"`-Iout/soong/.intermediates/external/abseil-cpp/absl_debugging_leak_check_hdrs/gen/my_include_dir"u-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_check_op_hdrs/gen/external/abseil-cpp/my_include_dir"a-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_check_op_hdrs/gen/my_include_dir"t-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_voidify_hdrs/gen/external/abseil-cpp/my_include_dir"`-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_voidify_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_conditions_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_conditions_hdrs/gen/my_include_dir"w-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_check_impl_hdrs/gen/external/abseil-cpp/my_include_dir"c-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_check_impl_hdrs/gen/my_include_dir"n-Iout/soong/.intermediates/external/abseil-cpp/absl_log_absl_check_hdrs/gen/external/abseil-cpp/my_include_dir"Z-Iout/soong/.intermediates/external/abseil-cpp/absl_log_absl_check_hdrs/gen/my_include_dir"s-Iout/soong/.intermediates/external/abseil-cpp/absl_log_absl_vlog_is_on_hdrs/gen/external/abseil-cpp/my_include_dir"_-Iout/soong/.intermediates/external/abseil-cpp/absl_log_absl_vlog_is_on_hdrs/gen/my_include_dir"u-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_log_impl_hdrs/gen/external/abseil-cpp/my_include_dir"a-Iout/soong/.intermediates/external/abseil-cpp/absl_log_internal_log_impl_hdrs/gen/my_include_dir"l-Iout/soong/.intermediates/external/abseil-cpp/absl_log_absl_log_hdrs/gen/external/abseil-cpp/my_include_dir"X-Iout/soong/.intermediates/external/abseil-cpp/absl_log_absl_log_hdrs/gen/my_include_dir"f-Iout/soong/.intermediates/external/abseil-cpp/absl_status_hdrs/gen/external/abseil-cpp/my_include_dir"R-Iout/soong/.intermediates/external/abseil-cpp/absl_status_hdrs/gen/my_include_dir"|-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_has_ostream_operator_hdrs/gen/external/abseil-cpp/my_include_dir"h-Iout/soong/.intermediates/external/abseil-cpp/absl_strings_has_ostream_operator_hdrs/gen/my_include_dir"o-Iout/soong/.intermediates/external/abseil-cpp/absl_status_statusor_hdrs/gen/external/abseil-cpp/my_include_dir"[-Iout/soong/.intermediates/external/abseil-cpp/absl_status_statusor_hdrs/gen/my_include_dir"Y-Iprebuilts/clang/host/linux-x86/clang-r563880/android_libc++/platform/arm/include/c++/v1"=-Iprebuilts/clang/host/linux-x86/clang-r563880/include/c++/v1" -Ibionic/libc/async_safe/include"-Isystem/logging/liblog/include"'-Ibionic/libc/system_properties/include"<-Isystem/core/property_service/libpropertyinfoparser/include"-isystem"bionic/libc/include"-isystem"bionic/libc/kernel/uapi/asm-arm"-isystem"bionic/libc/kernel/uapi"-isystem"bionic/libc/kernel/android/scsi"-isystem"bionic/libc/kernel/android/uapi"-target"armv7a-linux-androideabi10000"-DANDROID_STRICT"-fPIE"-Werror"-Wno-unused-parameter"-DGOOGLE_PROTOBUF_NO_RTTI"-Wimplicit-fallthrough"*-D_LIBCPP_ENABLE_THREAD_SAFETY_ANNOTATIONS"-Wno-gnu-include-next"-fvisibility-inlines-hidden"-mllvm"-enable-shrink-wrap=false" -std=gnu++20" -fno-rtti"-Isystem/core/include"-Isystem/logging/liblog/include"-Isystem/media/audio/include"-Ihardware/libhardware/include"%-Ihardware/libhardware_legacy/include"-Ihardware/ril/include"-Iframeworks/native/include""-Iframeworks/native/opengl/include"-Iframeworks/av/include"-Werror=address-of-temporary"-Werror=dangling" -Werror=format-insufficient-args"-Werror=fortify-source"+-Werror=incompatible-function-pointer-types"-Werror=int-in-bool-context"-Werror=int-to-pointer-cast"-Werror=null-dereference"-Werror=return-type"-Werror=xor-used-as-pow"-Wno-pointer-to-int-cast"-Wno-error=unused-variable"-Wno-missing-field-initializers"-Wno-packed-non-pod"(-Wno-error=tautological-constant-compare""-Wno-implicit-int-float-conversion"!-Wno-tautological-overlap-compare"-Wno-deprecated-copy"-Wno-range-loop-construct""-Wno-zero-as-null-pointer-constant")-Wno-deprecated-anon-enum-enum-conversion"$-Wno-deprecated-enum-enum-conversion"-Wno-error=pessimizing-move"-Wno-non-c-typedef-for-linkage"-Wno-align-mismatch"#-Wno-error=unused-but-set-parameter"-Wno-error=deprecated"-Wno-error=invalid-offsetof"-Wno-nontrivial-memcall"-Wno-invalid-specialization"-Wno-vla-cxx-extension" -Wno-cast-function-type-mismatch"8build/make/tools/ide_query/prober_scripts/cpp/general.cc2Egenfiles_for_build/make/tools/ide_query/prober_scripts/cpp/general.cc:f Egenfiles_for_build/make/tools/ide_query/prober_scripts/cpp/general.cc* soong/.intermediates/external/abseil-cpp/absl_container_btree_hdrs/gen/my_include_dir/absl/container/internal/btree_container.hޡ// Copyright 2018 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_CONTAINER_INTERNAL_BTREE_CONTAINER_H_ #define ABSL_CONTAINER_INTERNAL_BTREE_CONTAINER_H_ #include #include #include #include #include #include "absl/base/attributes.h" #include "absl/base/internal/throw_delegate.h" #include "absl/container/internal/btree.h" // IWYU pragma: export #include "absl/container/internal/common.h" #include "absl/hash/internal/weakly_mixed_integer.h" #include "absl/memory/memory.h" #include "absl/meta/type_traits.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace container_internal { // A common base class for btree_set, btree_map, btree_multiset, and // btree_multimap. template class btree_container { using params_type = typename Tree::params_type; protected: // Alias used for heterogeneous lookup functions. // `key_arg` evaluates to `K` when the functors are transparent and to // `key_type` otherwise. It permits template argument deduction on `K` for the // transparent case. template using key_arg = typename KeyArg::template type< K, typename Tree::key_type>; public: using key_type = typename Tree::key_type; using value_type = typename Tree::value_type; using size_type = typename Tree::size_type; using difference_type = typename Tree::difference_type; using key_compare = typename Tree::original_key_compare; using value_compare = typename Tree::value_compare; using allocator_type = typename Tree::allocator_type; using reference = typename Tree::reference; using const_reference = typename Tree::const_reference; using pointer = typename Tree::pointer; using const_pointer = typename Tree::const_pointer; using iterator = typename Tree::iterator; using const_iterator = typename Tree::const_iterator; using reverse_iterator = typename Tree::reverse_iterator; using const_reverse_iterator = typename Tree::const_reverse_iterator; using node_type = typename Tree::node_handle_type; struct extract_and_get_next_return_type { node_type node; iterator next; }; // Constructors/assignments. btree_container() : tree_(key_compare(), allocator_type()) {} explicit btree_container(const key_compare &comp, const allocator_type &alloc = allocator_type()) : tree_(comp, alloc) {} explicit btree_container(const allocator_type &alloc) : tree_(key_compare(), alloc) {} btree_container(const btree_container &other) : btree_container(other, absl::allocator_traits:: select_on_container_copy_construction( other.get_allocator())) {} btree_container(const btree_container &other, const allocator_type &alloc) : tree_(other.tree_, alloc) {} btree_container(btree_container &&other) noexcept( std::is_nothrow_move_constructible::value) = default; btree_container(btree_container &&other, const allocator_type &alloc) : tree_(std::move(other.tree_), alloc) {} btree_container &operator=(const btree_container &other) = default; btree_container &operator=(btree_container &&other) noexcept( std::is_nothrow_move_assignable::value) = default; // Iterator routines. iterator begin() ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.begin(); } const_iterator begin() const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.begin(); } const_iterator cbegin() const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.begin(); } iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.end(); } const_iterator end() const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.end(); } const_iterator cend() const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.end(); } reverse_iterator rbegin() ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.rbegin(); } const_reverse_iterator rbegin() const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.rbegin(); } const_reverse_iterator crbegin() const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.rbegin(); } reverse_iterator rend() ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.rend(); } const_reverse_iterator rend() const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.rend(); } const_reverse_iterator crend() const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.rend(); } // Lookup routines. template size_type count(const key_arg &key) const { auto equal_range = this->equal_range(key); return equal_range.second - equal_range.first; } template iterator find(const key_arg &key) ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.find(key); } template const_iterator find(const key_arg &key) const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.find(key); } template bool contains(const key_arg &key) const { return find(key) != end(); } template iterator lower_bound(const key_arg &key) ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.lower_bound(key); } template const_iterator lower_bound(const key_arg &key) const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.lower_bound(key); } template iterator upper_bound(const key_arg &key) ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.upper_bound(key); } template const_iterator upper_bound(const key_arg &key) const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.upper_bound(key); } template std::pair equal_range(const key_arg &key) ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.equal_range(key); } template std::pair equal_range( const key_arg &key) const ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.equal_range(key); } // Deletion routines. Note that there is also a deletion routine that is // specific to btree_set_container/btree_multiset_container. // Erase the specified iterator from the btree. The iterator must be valid // (i.e. not equal to end()). Return an iterator pointing to the node after // the one that was erased (or end() if none exists). iterator erase(const_iterator iter) ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.erase(iterator(iter)); } iterator erase(iterator iter) ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.erase(iter); } iterator erase(const_iterator first, const_iterator last) ABSL_ATTRIBUTE_LIFETIME_BOUND { return tree_.erase_range(iterator(first), iterator(last)).second; } template size_type erase(const key_arg &key) { auto equal_range = this->equal_range(key); return tree_.erase_range(equal_range.first, equal_range.second).first; } // Extract routines. extract_and_get_next_return_type extract_and_get_next(const_iterator position) ABSL_ATTRIBUTE_LIFETIME_BOUND { // Use Construct instead of Transfer because the rebalancing code will // destroy the slot later. // Note: we rely on erase() taking place after Construct(). return {CommonAccess::Construct(get_allocator(), iterator(position).slot()), erase(position)}; } node_type extract(iterator position) { // Use Construct instead of Transfer because the rebalancing code will // destroy the slot later. auto node = CommonAccess::Construct(get_allocator(), position.slot()); erase(position); return node; } node_type extract(const_iterator position) { return extract(iterator(position)); } // Utility routines. ABSL_ATTRIBUTE_REINITIALIZES void clear() { tree_.clear(); } void swap(btree_container &other) { tree_.swap(other.tree_); } void verify() const { tree_.verify(); } // Size routines. size_type size() const { return tree_.size(); } size_type max_size() const { return tree_.max_size(); } bool empty() const { return tree_.empty(); } friend bool operator==(const btree_container &x, const btree_container &y) { if (x.size() != y.size()) return false; return std::equal(x.begin(), x.end(), y.begin()); } friend bool operator!=(const btree_container &x, const btree_container &y) { return !(x == y); } friend bool operator<(const btree_container &x, const btree_container &y) { return std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()); } friend bool operator>(const btree_container &x, const btree_container &y) { return y < x; } friend bool operator<=(const btree_container &x, const btree_container &y) { return !(y < x); } friend bool operator>=(const btree_container &x, const btree_container &y) { return !(x < y); } // The allocator used by the btree. allocator_type get_allocator() const { return tree_.get_allocator(); } // The key comparator used by the btree. key_compare key_comp() const { return key_compare(tree_.key_comp()); } value_compare value_comp() const { return tree_.value_comp(); } // Support absl::Hash. template friend State AbslHashValue(State h, const btree_container &b) { for (const auto &v : b) { h = State::combine(std::move(h), v); } return State::combine(std::move(h), hash_internal::WeaklyMixedInteger{b.size()}); } protected: friend struct btree_access; Tree tree_; }; // A common base class for btree_set and btree_map. template class btree_set_container : public btree_container { using super_type = btree_container; using params_type = typename Tree::params_type; using init_type = typename params_type::init_type; using is_key_compare_to = typename params_type::is_key_compare_to; friend class BtreeNodePeer; protected: template using key_arg = typename super_type::template key_arg; public: using key_type = typename Tree::key_type; using value_type = typename Tree::value_type; using size_type = typename Tree::size_type; using key_compare = typename Tree::original_key_compare; using allocator_type = typename Tree::allocator_type; using iterator = typename Tree::iterator; using const_iterator = typename Tree::const_iterator; using node_type = typename super_type::node_type; using insert_return_type = InsertReturnType; // Inherit constructors. using super_type::super_type; btree_set_container() {} // Range constructors. template btree_set_container(InputIterator b, InputIterator e, const key_compare &comp = key_compare(), const allocator_type &alloc = allocator_type()) : super_type(comp, alloc) { insert(b, e); } template btree_set_container(InputIterator b, InputIterator e, const allocator_type &alloc) : btree_set_container(b, e, key_compare(), alloc) {} // Initializer list constructors. btree_set_container(std::initializer_list init, const key_compare &comp = key_compare(), const allocator_type &alloc = allocator_type()) : btree_set_container(init.begin(), init.end(), comp, alloc) {} btree_set_container(std::initializer_list init, const allocator_type &alloc) : btree_set_container(init.begin(), init.end(), alloc) {} // Insertion routines. std::pair insert(const value_type &v) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->tree_.insert_unique(params_type::key(v), v); } std::pair insert(value_type &&v) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->tree_.insert_unique(params_type::key(v), std::move(v)); } template std::pair emplace(Args &&...args) ABSL_ATTRIBUTE_LIFETIME_BOUND { // Use a node handle to manage a temp slot. auto node = CommonAccess::Construct(this->get_allocator(), std::forward(args)...); auto *slot = CommonAccess::GetSlot(node); return this->tree_.insert_unique(params_type::key(slot), slot); } iterator insert(const_iterator hint, const value_type &v) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->tree_ .insert_hint_unique(iterator(hint), params_type::key(v), v) .first; } iterator insert(const_iterator hint, value_type &&v) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->tree_ .insert_hint_unique(iterator(hint), params_type::key(v), std::move(v)) .first; } template iterator emplace_hint(const_iterator hint, Args &&...args) ABSL_ATTRIBUTE_LIFETIME_BOUND { // Use a node handle to manage a temp slot. auto node = CommonAccess::Construct(this->get_allocator(), std::forward(args)...); auto *slot = CommonAccess::GetSlot(node); return this->tree_ .insert_hint_unique(iterator(hint), params_type::key(slot), slot) .first; } template void insert(InputIterator b, InputIterator e) { this->tree_.insert_iterator_unique(b, e, 0); } void insert(std::initializer_list init) { this->tree_.insert_iterator_unique(init.begin(), init.end(), 0); } insert_return_type insert(node_type &&node) ABSL_ATTRIBUTE_LIFETIME_BOUND { if (!node) return {this->end(), false, node_type()}; std::pair res = this->tree_.insert_unique(params_type::key(CommonAccess::GetSlot(node)), CommonAccess::GetSlot(node)); if (res.second) { CommonAccess::Destroy(&node); return {res.first, true, node_type()}; } else { return {res.first, false, std::move(node)}; } } iterator insert(const_iterator hint, node_type &&node) ABSL_ATTRIBUTE_LIFETIME_BOUND { if (!node) return this->end(); std::pair res = this->tree_.insert_hint_unique( iterator(hint), params_type::key(CommonAccess::GetSlot(node)), CommonAccess::GetSlot(node)); if (res.second) CommonAccess::Destroy(&node); return res.first; } // Node extraction routines. template node_type extract(const key_arg &key) { const std::pair lower_and_equal = this->tree_.lower_bound_equal(key); return lower_and_equal.second ? extract(lower_and_equal.first) : node_type(); } using super_type::extract; // Merge routines. // Moves elements from `src` into `this`. If the element already exists in // `this`, it is left unmodified in `src`. template < typename T, typename absl::enable_if_t< absl::conjunction< std::is_same, std::is_same, std::is_same>::value, int> = 0> void merge(btree_container &src) { // NOLINT for (auto src_it = src.begin(); src_it != src.end();) { if (insert(std::move(params_type::element(src_it.slot()))).second) { src_it = src.erase(src_it); } else { ++src_it; } } } template < typename T, typename absl::enable_if_t< absl::conjunction< std::is_same, std::is_same, std::is_same>::value, int> = 0> void merge(btree_container &&src) { merge(src); } }; // Base class for btree_map. template class btree_map_container : public btree_set_container { using super_type = btree_set_container; using params_type = typename Tree::params_type; friend class BtreeNodePeer; private: template using key_arg = typename super_type::template key_arg; // NOTE: The mess here is to shorten the code for the (very repetitive) // function overloads, and to allow the lifetime-bound overloads to dispatch // to the non-lifetime-bound overloads, to ensure there is a single source of // truth for each overload set. // // Enabled if an assignment from the given type would require the // source object to remain alive for the life of the element. // // TODO(b/402804213): Remove these traits and simplify the overloads whenever // we have a better mechanism available to handle lifetime analysis. template using LifetimeBoundK = HasValue>; template using LifetimeBoundV = HasValue>; template using LifetimeBoundKV = absl::conjunction>, LifetimeBoundV>; public: using key_type = typename Tree::key_type; using mapped_type = typename params_type::mapped_type; using value_type = typename Tree::value_type; using key_compare = typename Tree::original_key_compare; using allocator_type = typename Tree::allocator_type; using iterator = typename Tree::iterator; using const_iterator = typename Tree::const_iterator; // Inherit constructors. using super_type::super_type; btree_map_container() {} // TODO(b/402804213): Remove these macros whenever we have a better mechanism // available to handle lifetime analysis. #define ABSL_INTERNAL_X(Func, Callee, KQual, MQual, KValue, MValue, ...) \ template < \ typename K = key_type, class M, \ ABSL_INTERNAL_IF_##KValue##_NOR_##MValue( \ int = (EnableIf::AddPtr, \ IfRRef::AddPtr>>()), \ ABSL_INTERNAL_SINGLE_ARG( \ int &..., \ decltype(EnableIf>()) = \ 0))> \ decltype(auto) Func( \ __VA_ARGS__ key_arg KQual k ABSL_INTERNAL_IF_##KValue( \ ABSL_INTERNAL_ATTRIBUTE_CAPTURED_BY(this)), \ M MQual obj ABSL_INTERNAL_IF_##MValue( \ ABSL_INTERNAL_ATTRIBUTE_CAPTURED_BY(this))) \ ABSL_ATTRIBUTE_LIFETIME_BOUND { \ return ABSL_INTERNAL_IF_##KValue##_OR_##MValue( \ (this->template Func), Callee)( \ __VA_ARGS__ std::forward(k), \ std::forward(obj)); \ } \ friend struct std::enable_if /* just to force a semicolon */ // Insertion routines. // Note: the nullptr template arguments and extra `const M&` overloads allow // for supporting bitfield arguments. ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, const &, const &, false, false); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, const &, const &, false, true); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, const &, const &, true, false); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, const &, const &, true, true); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, const &, &&, false, false); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, const &, &&, false, true); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, const &, &&, true, false); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, const &, &&, true, true); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, &&, const &, false, false); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, &&, const &, false, true); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, &&, const &, true, false); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, &&, const &, true, true); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, &&, &&, false, false); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, &&, &&, false, true); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, &&, &&, true, false); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_impl, &&, &&, true, true); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, const &, const &, false, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, const &, const &, false, true, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, const &, const &, true, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, const &, const &, true, true, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, const &, &&, false, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, const &, &&, false, true, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, const &, &&, true, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, const &, &&, true, true, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, &&, const &, false, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, &&, const &, false, true, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, &&, const &, true, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, &&, const &, true, true, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, &&, &&, false, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, &&, &&, false, true, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, &&, &&, true, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(insert_or_assign, insert_or_assign_hint_impl, &&, &&, true, true, const_iterator(hint) ABSL_INTERNAL_COMMA); #undef ABSL_INTERNAL_X #define ABSL_INTERNAL_X(Func, Callee, KQual, KValue, ...) \ template < \ class K = key_type, \ ABSL_INTERNAL_IF_##KValue( \ class... Args, \ int = (EnableIf< \ LifetimeBoundK::AddPtr>>())), \ ABSL_INTERNAL_IF_##KValue( \ decltype(EnableIf::AddPtr>>()) = 0, \ class... Args), \ std::enable_if_t::value, int> = \ 0> \ decltype(auto) Func( \ __VA_ARGS__ key_arg KQual k ABSL_INTERNAL_IF_##KValue( \ ABSL_INTERNAL_ATTRIBUTE_CAPTURED_BY(this)), \ Args &&...args) ABSL_ATTRIBUTE_LIFETIME_BOUND { \ return ABSL_INTERNAL_IF_##KValue((this->template Func), Callee)( \ __VA_ARGS__ std::forward(k), \ std::forward(args)...); \ } \ friend struct std::enable_if /* just to force a semicolon */ ABSL_INTERNAL_X(try_emplace, try_emplace_impl, const &, false); ABSL_INTERNAL_X(try_emplace, try_emplace_impl, const &, true); ABSL_INTERNAL_X(try_emplace, try_emplace_impl, &&, false); ABSL_INTERNAL_X(try_emplace, try_emplace_impl, &&, true); ABSL_INTERNAL_X(try_emplace, try_emplace_hint_impl, const &, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(try_emplace, try_emplace_hint_impl, const &, true, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(try_emplace, try_emplace_hint_impl, &&, false, const_iterator(hint) ABSL_INTERNAL_COMMA); ABSL_INTERNAL_X(try_emplace, try_emplace_hint_impl, &&, true, const_iterator(hint) ABSL_INTERNAL_COMMA); #undef ABSL_INTERNAL_X template >()> mapped_type &operator[](const key_arg &k) ABSL_ATTRIBUTE_LIFETIME_BOUND { return try_emplace(k).first->second; } template > = 0> mapped_type &operator[]( const key_arg &k ABSL_INTERNAL_ATTRIBUTE_CAPTURED_BY(this)) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->template operator[](k); } template >()> mapped_type &operator[](key_arg &&k) ABSL_ATTRIBUTE_LIFETIME_BOUND { return try_emplace(std::forward(k)).first->second; } template > = 0> mapped_type &operator[](key_arg &&k ABSL_INTERNAL_ATTRIBUTE_CAPTURED_BY( this)) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->template operator[](std::forward(k)); } template mapped_type &at(const key_arg &key) ABSL_ATTRIBUTE_LIFETIME_BOUND { auto it = this->find(key); if (it == this->end()) base_internal::ThrowStdOutOfRange("absl::btree_map::at"); return it->second; } template const mapped_type &at(const key_arg &key) const ABSL_ATTRIBUTE_LIFETIME_BOUND { auto it = this->find(key); if (it == this->end()) base_internal::ThrowStdOutOfRange("absl::btree_map::at"); return it->second; } private: // Note: when we call `std::forward(obj)` twice, it's safe because // insert_unique/insert_hint_unique are guaranteed to not consume `obj` when // `ret.second` is false. template std::pair insert_or_assign_impl(K &&k, M &&obj) { const std::pair ret = this->tree_.insert_unique(k, std::forward(k), std::forward(obj)); if (!ret.second) ret.first->second = std::forward(obj); return ret; } template iterator insert_or_assign_hint_impl(const_iterator hint, K &&k, M &&obj) { const std::pair ret = this->tree_.insert_hint_unique( iterator(hint), k, std::forward(k), std::forward(obj)); if (!ret.second) ret.first->second = std::forward(obj); return ret.first; } template std::pair try_emplace_impl(K &&k, Args &&... args) { return this->tree_.insert_unique( k, std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...)); } template iterator try_emplace_hint_impl(const_iterator hint, K &&k, Args &&... args) { return this->tree_ .insert_hint_unique(iterator(hint), k, std::piecewise_construct, std::forward_as_tuple(std::forward(k)), std::forward_as_tuple(std::forward(args)...)) .first; } }; // A common base class for btree_multiset and btree_multimap. template class btree_multiset_container : public btree_container { using super_type = btree_container; using params_type = typename Tree::params_type; using init_type = typename params_type::init_type; using is_key_compare_to = typename params_type::is_key_compare_to; friend class BtreeNodePeer; template using key_arg = typename super_type::template key_arg; public: using key_type = typename Tree::key_type; using value_type = typename Tree::value_type; using size_type = typename Tree::size_type; using key_compare = typename Tree::original_key_compare; using allocator_type = typename Tree::allocator_type; using iterator = typename Tree::iterator; using const_iterator = typename Tree::const_iterator; using node_type = typename super_type::node_type; // Inherit constructors. using super_type::super_type; btree_multiset_container() {} // Range constructors. template btree_multiset_container(InputIterator b, InputIterator e, const key_compare &comp = key_compare(), const allocator_type &alloc = allocator_type()) : super_type(comp, alloc) { insert(b, e); } template btree_multiset_container(InputIterator b, InputIterator e, const allocator_type &alloc) : btree_multiset_container(b, e, key_compare(), alloc) {} // Initializer list constructors. btree_multiset_container(std::initializer_list init, const key_compare &comp = key_compare(), const allocator_type &alloc = allocator_type()) : btree_multiset_container(init.begin(), init.end(), comp, alloc) {} btree_multiset_container(std::initializer_list init, const allocator_type &alloc) : btree_multiset_container(init.begin(), init.end(), alloc) {} // Insertion routines. iterator insert(const value_type &v) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->tree_.insert_multi(v); } iterator insert(value_type &&v) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->tree_.insert_multi(std::move(v)); } iterator insert(const_iterator hint, const value_type &v) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->tree_.insert_hint_multi(iterator(hint), v); } iterator insert(const_iterator hint, value_type &&v) ABSL_ATTRIBUTE_LIFETIME_BOUND { return this->tree_.insert_hint_multi(iterator(hint), std::move(v)); } template void insert(InputIterator b, InputIterator e) { this->tree_.insert_iterator_multi(b, e); } void insert(std::initializer_list init) { this->tree_.insert_iterator_multi(init.begin(), init.end()); } template iterator emplace(Args &&...args) ABSL_ATTRIBUTE_LIFETIME_BOUND { // Use a node handle to manage a temp slot. auto node = CommonAccess::Construct(this->get_allocator(), std::forward(args)...); return this->tree_.insert_multi(CommonAccess::GetSlot(node)); } template iterator emplace_hint(const_iterator hint, Args &&...args) ABSL_ATTRIBUTE_LIFETIME_BOUND { // Use a node handle to manage a temp slot. auto node = CommonAccess::Construct(this->get_allocator(), std::forward(args)...); return this->tree_.insert_hint_multi(iterator(hint), CommonAccess::GetSlot(node)); } iterator insert(node_type &&node) ABSL_ATTRIBUTE_LIFETIME_BOUND { if (!node) return this->end(); iterator res = this->tree_.insert_multi(params_type::key(CommonAccess::GetSlot(node)), CommonAccess::GetSlot(node)); CommonAccess::Destroy(&node); return res; } iterator insert(const_iterator hint, node_type &&node) ABSL_ATTRIBUTE_LIFETIME_BOUND { if (!node) return this->end(); iterator res = this->tree_.insert_hint_multi( iterator(hint), std::move(params_type::element(CommonAccess::GetSlot(node)))); CommonAccess::Destroy(&node); return res; } // Node extraction routines. template node_type extract(const key_arg &key) { const std::pair lower_and_equal = this->tree_.lower_bound_equal(key); return lower_and_equal.second ? extract(lower_and_equal.first) : node_type(); } using super_type::extract; // Merge routines. // Moves all elements from `src` into `this`. template < typename T, typename absl::enable_if_t< absl::conjunction< std::is_same, std::is_same, std::is_same>::value, int> = 0> void merge(btree_container &src) { // NOLINT for (auto src_it = src.begin(), end = src.end(); src_it != end; ++src_it) { insert(std::move(params_type::element(src_it.slot()))); } src.clear(); } template < typename T, typename absl::enable_if_t< absl::conjunction< std::is_same, std::is_same, std::is_same>::value, int> = 0> void merge(btree_container &&src) { merge(src); } }; // A base class for btree_multimap. template class btree_multimap_container : public btree_multiset_container { using super_type = btree_multiset_container; using params_type = typename Tree::params_type; friend class BtreeNodePeer; public: using mapped_type = typename params_type::mapped_type; // Inherit constructors. using super_type::super_type; btree_multimap_container() {} }; } // namespace container_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_CONTAINER_INTERNAL_BTREE_CONTAINER_H_ * tsoong/.intermediates/external/abseil-cpp/absl_strings_hdrs/gen/my_include_dir/absl/strings/internal/stringify_sink.h // Copyright 2022 The Abseil Authors // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_STRINGIFY_SINK_H_ #define ABSL_STRINGS_INTERNAL_STRINGIFY_SINK_H_ #include #include #include #include "absl/strings/string_view.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace strings_internal { class StringifySink { public: void Append(size_t count, char ch); void Append(string_view v); // Support `absl::Format(&sink, format, args...)`. friend void AbslFormatFlush(StringifySink* sink, absl::string_view v) { sink->Append(v); } private: template friend string_view ExtractStringification(StringifySink& sink, const T& v); std::string buffer_; }; template string_view ExtractStringification(StringifySink& sink, const T& v) { AbslStringify(sink, v); return sink.buffer_; } } // namespace strings_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_STRINGIFY_SINK_H_ *# soong/.intermediates/external/abseil-cpp/absl_strings_internal_hdrs/gen/my_include_dir/absl/strings/internal/resize_uninitialized.h"// // Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // #ifndef ABSL_STRINGS_INTERNAL_RESIZE_UNINITIALIZED_H_ #define ABSL_STRINGS_INTERNAL_RESIZE_UNINITIALIZED_H_ #include #include #include #include #include "absl/base/port.h" #include "absl/meta/type_traits.h" // for void_t namespace absl { ABSL_NAMESPACE_BEGIN namespace strings_internal { // In this type trait, we look for a __resize_default_init member function, and // we use it if available, otherwise, we use resize. We provide HasMember to // indicate whether __resize_default_init is present. template struct ResizeUninitializedTraits { using HasMember = std::false_type; static void Resize(string_type* s, size_t new_size) { s->resize(new_size); } }; // __resize_default_init is provided by libc++ >= 8.0 template struct ResizeUninitializedTraits< string_type, absl::void_t() .__resize_default_init(237))> > { using HasMember = std::true_type; static void Resize(string_type* s, size_t new_size) { s->__resize_default_init(new_size); } }; // Returns true if the std::string implementation supports a resize where // the new characters added to the std::string are left untouched. // // (A better name might be "STLStringSupportsUninitializedResize", alluding to // the previous function.) template inline constexpr bool STLStringSupportsNontrashingResize(string_type*) { return ResizeUninitializedTraits::HasMember::value; } // Like str->resize(new_size), except any new characters added to "*str" as a // result of resizing may be left uninitialized, rather than being filled with // '0' bytes. Typically used when code is then going to overwrite the backing // store of the std::string with known data. template inline void STLStringResizeUninitialized(string_type* s, size_t new_size) { ResizeUninitializedTraits::Resize(s, new_size); } // Used to ensure exponential growth so that the amortized complexity of // increasing the string size by a small amount is O(1), in contrast to // O(str->size()) in the case of precise growth. template void STLStringReserveAmortized(string_type* s, size_t new_size) { const size_t cap = s->capacity(); if (new_size > cap) { // Make sure to always grow by at least a factor of 2x. s->reserve((std::max)(new_size, 2 * cap)); } } // In this type trait, we look for an __append_default_init member function, and // we use it if available, otherwise, we use append. template struct AppendUninitializedTraits { static void Append(string_type* s, size_t n) { s->append(n, typename string_type::value_type()); } }; template struct AppendUninitializedTraits< string_type, absl::void_t() .__append_default_init(237))> > { static void Append(string_type* s, size_t n) { s->__append_default_init(n); } }; // Like STLStringResizeUninitialized(str, new_size), except guaranteed to use // exponential growth so that the amortized complexity of increasing the string // size by a small amount is O(1), in contrast to O(str->size()) in the case of // precise growth. template void STLStringResizeUninitializedAmortized(string_type* s, size_t new_size) { const size_t size = s->size(); if (new_size > size) { AppendUninitializedTraits::Append(s, new_size - size); } else { s->erase(new_size); } } } // namespace strings_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_RESIZE_UNINITIALIZED_H_ * soong/.intermediates/external/abseil-cpp/absl_debugging_demangle_internal_hdrs/gen/my_include_dir/absl/debugging/internal/demangle.h// Copyright 2018 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_DEBUGGING_INTERNAL_DEMANGLE_H_ #define ABSL_DEBUGGING_INTERNAL_DEMANGLE_H_ #include #include "absl/base/config.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace debugging_internal { // Demangle `mangled`. On success, return true and write the // demangled symbol name to `out`. Otherwise, return false. // `out` is modified even if demangling is unsuccessful. // // This function provides an alternative to libstdc++'s abi::__cxa_demangle, // which is not async signal safe (it uses malloc internally). It's intended to // be used in async signal handlers to symbolize stack traces. // // Note that this demangler doesn't support full demangling. More // specifically, it doesn't print types of function parameters and // types of template arguments. It just skips them. However, it's // still very useful to extract basic information such as class, // function, constructor, destructor, and operator names. // // See the implementation note in demangle.cc if you are interested. // // Example: // // | Mangled Name | Demangle | DemangleString // |---------------|-------------|----------------------- // | _Z1fv | f() | f() // | _Z1fi | f() | f(int) // | _Z3foo3bar | foo() | foo(bar) // | _Z1fIiEvi | f<>() | void f(int) // | _ZN1N1fE | N::f | N::f // | _ZN3Foo3BarEv | Foo::Bar() | Foo::Bar() // | _Zrm1XS_" | operator%() | operator%(X, X) // | _ZN3FooC1Ev | Foo::Foo() | Foo::Foo() // | _Z1fSs | f() | f(std::basic_string, // | | | std::allocator >) // // See the unit test for more examples. // // Demangle also recognizes Rust mangled names by delegating the parsing of // anything that starts with _R to DemangleRustSymbolEncoding (demangle_rust.h). // // Note: we might want to write demanglers for ABIs other than Itanium // C++ ABI in the future. bool Demangle(const char* mangled, char* out, size_t out_size); // A wrapper around `abi::__cxa_demangle()`. On success, returns the demangled // name. On failure, returns the input mangled name. // // This function is not async-signal-safe. std::string DemangleString(const char* mangled); } // namespace debugging_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_DEBUGGING_INTERNAL_DEMANGLE_H_ * wsoong/.intermediates/external/abseil-cpp/absl_container_layout_hdrs/gen/my_include_dir/absl/container/internal/layout.h// Copyright 2018 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // MOTIVATION AND TUTORIAL // // If you want to put in a single heap allocation N doubles followed by M ints, // it's easy if N and M are known at compile time. // // struct S { // double a[N]; // int b[M]; // }; // // S* p = new S; // // But what if N and M are known only in run time? Class template Layout to the // rescue! It's a portable generalization of the technique known as struct hack. // // // This object will tell us everything we need to know about the memory // // layout of double[N] followed by int[M]. It's structurally identical to // // size_t[2] that stores N and M. It's very cheap to create. // const Layout layout(N, M); // // // Allocate enough memory for both arrays. `AllocSize()` tells us how much // // memory is needed. We are free to use any allocation function we want as // // long as it returns aligned memory. // std::unique_ptr p(new unsigned char[layout.AllocSize()]); // // // Obtain the pointer to the array of doubles. // // Equivalent to `reinterpret_cast(p.get())`. // // // // We could have written layout.Pointer<0>(p) instead. If all the types are // // unique you can use either form, but if some types are repeated you must // // use the index form. // double* a = layout.Pointer(p.get()); // // // Obtain the pointer to the array of ints. // // Equivalent to `reinterpret_cast(p.get() + N * 8)`. // int* b = layout.Pointer(p); // // If we are unable to specify sizes of all fields, we can pass as many sizes as // we can to `Partial()`. In return, it'll allow us to access the fields whose // locations and sizes can be computed from the provided information. // `Partial()` comes in handy when the array sizes are embedded into the // allocation. // // // size_t[0] containing N, size_t[1] containing M, double[N], int[M]. // using L = Layout; // // unsigned char* Allocate(size_t n, size_t m) { // const L layout(1, 1, n, m); // unsigned char* p = new unsigned char[layout.AllocSize()]; // *layout.Pointer<0>(p) = n; // *layout.Pointer<1>(p) = m; // return p; // } // // void Use(unsigned char* p) { // // First, extract N and M. // // Specify that the first array has only one element. Using `prefix` we // // can access the first two arrays but not more. // constexpr auto prefix = L::Partial(1); // size_t n = *prefix.Pointer<0>(p); // size_t m = *prefix.Pointer<1>(p); // // // Now we can get pointers to the payload. // const L layout(1, 1, n, m); // double* a = layout.Pointer(p); // int* b = layout.Pointer(p); // } // // The layout we used above combines fixed-size with dynamically-sized fields. // This is quite common. Layout is optimized for this use case and attempts to // generate optimal code. To help the compiler do that in more cases, you can // specify the fixed sizes using `WithStaticSizes`. This ensures that all // computations that can be performed at compile time are indeed performed at // compile time. Note that sometimes the `template` keyword is needed. E.g.: // // using SL = L::template WithStaticSizes<1, 1>; // // void Use(unsigned char* p) { // // First, extract N and M. // // Using `prefix` we can access the first three arrays but not more. // // // // More details: The first element always has offset 0. `SL` // // has offsets for the second and third array based on sizes of // // the first and second array, specified via `WithStaticSizes`. // constexpr auto prefix = SL::Partial(); // size_t n = *prefix.Pointer<0>(p); // size_t m = *prefix.Pointer<1>(p); // // // Now we can get a pointer to the final payload. // const SL layout(n, m); // double* a = layout.Pointer(p); // int* b = layout.Pointer(p); // } // // Efficiency tip: The order of fields matters. In `Layout` try to // ensure that `alignof(T1) >= ... >= alignof(TN)`. This way you'll have no // padding in between arrays. // // You can manually override the alignment of an array by wrapping the type in // `Aligned`. `Layout<..., Aligned, ...>` has exactly the same API // and behavior as `Layout<..., T, ...>` except that the first element of the // array of `T` is aligned to `N` (the rest of the elements follow without // padding). `N` cannot be less than `alignof(T)`. // // `AllocSize()` and `Pointer()` are the most basic methods for dealing with // memory layouts. Check out the reference or code below to discover more. // // EXAMPLE // // // Immutable move-only string with sizeof equal to sizeof(void*). The // // string size and the characters are kept in the same heap allocation. // class CompactString { // public: // CompactString(const char* s = "") { // const size_t size = strlen(s); // // size_t[1] followed by char[size + 1]. // const L layout(size + 1); // p_.reset(new unsigned char[layout.AllocSize()]); // // If running under ASAN, mark the padding bytes, if any, to catch // // memory errors. // layout.PoisonPadding(p_.get()); // // Store the size in the allocation. // *layout.Pointer(p_.get()) = size; // // Store the characters in the allocation. // memcpy(layout.Pointer(p_.get()), s, size + 1); // } // // size_t size() const { // // Equivalent to reinterpret_cast(*p). // return *L::Partial().Pointer(p_.get()); // } // // const char* c_str() const { // // Equivalent to reinterpret_cast(p.get() + sizeof(size_t)). // return L::Partial().Pointer(p_.get()); // } // // private: // // Our heap allocation contains a single size_t followed by an array of // // chars. // using L = Layout::WithStaticSizes<1>; // std::unique_ptr p_; // }; // // int main() { // CompactString s = "hello"; // assert(s.size() == 5); // assert(strcmp(s.c_str(), "hello") == 0); // } // // DOCUMENTATION // // The interface exported by this file consists of: // - class `Layout<>` and its public members. // - The public members of classes `internal_layout::LayoutWithStaticSizes<>` // and `internal_layout::LayoutImpl<>`. Those classes aren't intended to be // used directly, and their name and template parameter list are internal // implementation details, but the classes themselves provide most of the // functionality in this file. See comments on their members for detailed // documentation. // // `Layout::Partial(count1,..., countm)` (where `m` <= `n`) returns a // `LayoutImpl<>` object. `Layout layout(count1,..., countn)` // creates a `Layout` object, which exposes the same functionality by inheriting // from `LayoutImpl<>`. #ifndef ABSL_CONTAINER_INTERNAL_LAYOUT_H_ #define ABSL_CONTAINER_INTERNAL_LAYOUT_H_ #include #include #include #include #include #include #include #include #include #include "absl/base/config.h" #include "absl/debugging/internal/demangle.h" #include "absl/meta/type_traits.h" #include "absl/strings/str_cat.h" #include "absl/types/span.h" #include "absl/utility/utility.h" #ifdef ABSL_HAVE_ADDRESS_SANITIZER #include #endif namespace absl { ABSL_NAMESPACE_BEGIN namespace container_internal { // A type wrapper that instructs `Layout` to use the specific alignment for the // array. `Layout<..., Aligned, ...>` has exactly the same API // and behavior as `Layout<..., T, ...>` except that the first element of the // array of `T` is aligned to `N` (the rest of the elements follow without // padding). // // Requires: `N >= alignof(T)` and `N` is a power of 2. template struct Aligned; namespace internal_layout { template struct NotAligned {}; template struct NotAligned> { static_assert(sizeof(T) == 0, "Aligned cannot be const-qualified"); }; template using IntToSize = size_t; template struct Type : NotAligned { using type = T; }; template struct Type> { using type = T; }; template struct SizeOf : NotAligned, std::integral_constant {}; template struct SizeOf> : std::integral_constant {}; // Note: workaround for https://gcc.gnu.org/PR88115 template struct AlignOf : NotAligned { static constexpr size_t value = alignof(T); }; template struct AlignOf> { static_assert(N % alignof(T) == 0, "Custom alignment can't be lower than the type's alignment"); static constexpr size_t value = N; }; // Does `Ts...` contain `T`? template using Contains = absl::disjunction...>; template using CopyConst = typename std::conditional::value, const To, To>::type; // Note: We're not qualifying this with absl:: because it doesn't compile under // MSVC. template using SliceType = Span; // This namespace contains no types. It prevents functions defined in it from // being found by ADL. namespace adl_barrier { template constexpr size_t Find(Needle, Needle, Ts...) { static_assert(!Contains(), "Duplicate element type"); return 0; } template constexpr size_t Find(Needle, T, Ts...) { return adl_barrier::Find(Needle(), Ts()...) + 1; } constexpr bool IsPow2(size_t n) { return !(n & (n - 1)); } // Returns `q * m` for the smallest `q` such that `q * m >= n`. // Requires: `m` is a power of two. It's enforced by IsLegalElementType below. constexpr size_t Align(size_t n, size_t m) { return (n + m - 1) & ~(m - 1); } constexpr size_t Min(size_t a, size_t b) { return b < a ? b : a; } constexpr size_t Max(size_t a) { return a; } template constexpr size_t Max(size_t a, size_t b, Ts... rest) { return adl_barrier::Max(b < a ? a : b, rest...); } template std::string TypeName() { std::string out; #ifdef ABSL_INTERNAL_HAS_RTTI absl::StrAppend(&out, "<", absl::debugging_internal::DemangleString(typeid(T).name()), ">"); #endif return out; } } // namespace adl_barrier // Can `T` be a template argument of `Layout`? template using IsLegalElementType = std::integral_constant< bool, !std::is_reference::value && !std::is_volatile::value && !std::is_reference::type>::value && !std::is_volatile::type>::value && adl_barrier::IsPow2(AlignOf::value)>; template class LayoutImpl; // Public base class of `Layout` and the result type of `Layout::Partial()`. // // `Elements...` contains all template arguments of `Layout` that created this // instance. // // `StaticSizeSeq...` is an index_sequence containing the sizes specified at // compile-time. // // `RuntimeSizeSeq...` is `[0, NumRuntimeSizes)`, where `NumRuntimeSizes` is the // number of arguments passed to `Layout::Partial()` or `Layout::Layout()`. // // `SizeSeq...` is `[0, NumSizes)` where `NumSizes` is `NumRuntimeSizes` plus // the number of sizes in `StaticSizeSeq`. // // `OffsetSeq...` is `[0, NumOffsets)` where `NumOffsets` is // `Min(sizeof...(Elements), NumSizes + 1)` (the number of arrays for which we // can compute offsets). template class LayoutImpl< std::tuple, absl::index_sequence, absl::index_sequence, absl::index_sequence, absl::index_sequence> { private: static_assert(sizeof...(Elements) > 0, "At least one field is required"); static_assert(absl::conjunction...>::value, "Invalid element type (see IsLegalElementType)"); static_assert(sizeof...(StaticSizeSeq) <= sizeof...(Elements), "Too many static sizes specified"); enum { NumTypes = sizeof...(Elements), NumStaticSizes = sizeof...(StaticSizeSeq), NumRuntimeSizes = sizeof...(RuntimeSizeSeq), NumSizes = sizeof...(SizeSeq), NumOffsets = sizeof...(OffsetSeq), }; // These are guaranteed by `Layout`. static_assert(NumStaticSizes + NumRuntimeSizes == NumSizes, "Internal error"); static_assert(NumSizes <= NumTypes, "Internal error"); static_assert(NumOffsets == adl_barrier::Min(NumTypes, NumSizes + 1), "Internal error"); static_assert(NumTypes > 0, "Internal error"); static constexpr std::array kStaticSizes = { StaticSizeSeq...}; // Returns the index of `T` in `Elements...`. Results in a compilation error // if `Elements...` doesn't contain exactly one instance of `T`. template static constexpr size_t ElementIndex() { static_assert(Contains, Type::type>...>(), "Type not found"); return adl_barrier::Find(Type(), Type::type>()...); } template using ElementAlignment = AlignOf>::type>; public: // Element types of all arrays packed in a tuple. using ElementTypes = std::tuple::type...>; // Element type of the Nth array. template using ElementType = typename std::tuple_element::type; constexpr explicit LayoutImpl(IntToSize... sizes) : size_{sizes...} {} // Alignment of the layout, equal to the strictest alignment of all elements. // All pointers passed to the methods of layout must be aligned to this value. static constexpr size_t Alignment() { return adl_barrier::Max(AlignOf::value...); } // Offset in bytes of the Nth array. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // assert(x.Offset<0>() == 0); // The ints starts from 0. // assert(x.Offset<1>() == 16); // The doubles starts from 16. // // Requires: `N <= NumSizes && N < sizeof...(Ts)`. template constexpr size_t Offset() const { if constexpr (N == 0) { return 0; } else { static_assert(N < NumOffsets, "Index out of bounds"); return adl_barrier::Align( Offset() + SizeOf>::value * Size(), ElementAlignment::value); } } // Offset in bytes of the array with the specified element type. There must // be exactly one such array and its zero-based index must be at most // `NumSizes`. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // assert(x.Offset() == 0); // The ints starts from 0. // assert(x.Offset() == 16); // The doubles starts from 16. template constexpr size_t Offset() const { return Offset()>(); } // Offsets in bytes of all arrays for which the offsets are known. constexpr std::array Offsets() const { return {{Offset()...}}; } // The number of elements in the Nth array (zero-based). // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // assert(x.Size<0>() == 3); // assert(x.Size<1>() == 4); // // Requires: `N < NumSizes`. template constexpr size_t Size() const { if constexpr (N < NumStaticSizes) { return kStaticSizes[N]; } else { static_assert(N < NumSizes, "Index out of bounds"); return size_[N - NumStaticSizes]; } } // The number of elements in the array with the specified element type. // There must be exactly one such array and its zero-based index must be // at most `NumSizes`. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // assert(x.Size() == 3); // assert(x.Size() == 4); template constexpr size_t Size() const { return Size()>(); } // The number of elements of all arrays for which they are known. constexpr std::array Sizes() const { return {{Size()...}}; } // Pointer to the beginning of the Nth array. // // `Char` must be `[const] [signed|unsigned] char`. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // unsigned char* p = new unsigned char[x.AllocSize()]; // int* ints = x.Pointer<0>(p); // double* doubles = x.Pointer<1>(p); // // Requires: `N <= NumSizes && N < sizeof...(Ts)`. // Requires: `p` is aligned to `Alignment()`. template CopyConst>* Pointer(Char* p) const { using C = typename std::remove_const::type; static_assert( std::is_same() || std::is_same() || std::is_same(), "The argument must be a pointer to [const] [signed|unsigned] char"); constexpr size_t alignment = Alignment(); (void)alignment; assert(reinterpret_cast(p) % alignment == 0); return reinterpret_cast>*>(p + Offset()); } // Pointer to the beginning of the array with the specified element type. // There must be exactly one such array and its zero-based index must be at // most `NumSizes`. // // `Char` must be `[const] [signed|unsigned] char`. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // unsigned char* p = new unsigned char[x.AllocSize()]; // int* ints = x.Pointer(p); // double* doubles = x.Pointer(p); // // Requires: `p` is aligned to `Alignment()`. template CopyConst* Pointer(Char* p) const { return Pointer()>(p); } // Pointers to all arrays for which pointers are known. // // `Char` must be `[const] [signed|unsigned] char`. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // unsigned char* p = new unsigned char[x.AllocSize()]; // // int* ints; // double* doubles; // std::tie(ints, doubles) = x.Pointers(p); // // Requires: `p` is aligned to `Alignment()`. template auto Pointers(Char* p) const { return std::tuple>*...>( Pointer(p)...); } // The Nth array. // // `Char` must be `[const] [signed|unsigned] char`. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // unsigned char* p = new unsigned char[x.AllocSize()]; // Span ints = x.Slice<0>(p); // Span doubles = x.Slice<1>(p); // // Requires: `N < NumSizes`. // Requires: `p` is aligned to `Alignment()`. template SliceType>> Slice(Char* p) const { return SliceType>>(Pointer(p), Size()); } // The array with the specified element type. There must be exactly one // such array and its zero-based index must be less than `NumSizes`. // // `Char` must be `[const] [signed|unsigned] char`. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // unsigned char* p = new unsigned char[x.AllocSize()]; // Span ints = x.Slice(p); // Span doubles = x.Slice(p); // // Requires: `p` is aligned to `Alignment()`. template SliceType> Slice(Char* p) const { return Slice()>(p); } // All arrays with known sizes. // // `Char` must be `[const] [signed|unsigned] char`. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // unsigned char* p = new unsigned char[x.AllocSize()]; // // Span ints; // Span doubles; // std::tie(ints, doubles) = x.Slices(p); // // Requires: `p` is aligned to `Alignment()`. // // Note: We mark the parameter as maybe_unused because GCC detects it is not // used when `SizeSeq` is empty [-Werror=unused-but-set-parameter]. template auto Slices([[maybe_unused]] Char* p) const { return std::tuple>>...>( Slice(p)...); } // The size of the allocation that fits all arrays. // // // int[3], 4 bytes of padding, double[4]. // Layout x(3, 4); // unsigned char* p = new unsigned char[x.AllocSize()]; // 48 bytes // // Requires: `NumSizes == sizeof...(Ts)`. constexpr size_t AllocSize() const { static_assert(NumTypes == NumSizes, "You must specify sizes of all fields"); return Offset() + SizeOf>::value * Size(); } // If built with --config=asan, poisons padding bytes (if any) in the // allocation. The pointer must point to a memory block at least // `AllocSize()` bytes in length. // // `Char` must be `[const] [signed|unsigned] char`. // // Requires: `p` is aligned to `Alignment()`. template void PoisonPadding(const Char* p) const { if constexpr (N == 0) { Pointer<0>(p); // verify the requirements on `Char` and `p` } else { static_assert(N < NumOffsets, "Index out of bounds"); (void)p; #ifdef ABSL_HAVE_ADDRESS_SANITIZER PoisonPadding(p); // The `if` is an optimization. It doesn't affect the observable behaviour. if (ElementAlignment::value % ElementAlignment::value) { size_t start = Offset() + SizeOf>::value * Size(); ASAN_POISON_MEMORY_REGION(p + start, Offset() - start); } #endif } } // Human-readable description of the memory layout. Useful for debugging. // Slow. // // // char[5], 3 bytes of padding, int[3], 4 bytes of padding, followed // // by an unknown number of doubles. // auto x = Layout::Partial(5, 3); // assert(x.DebugString() == // "@0(1)[5]; @8(4)[3]; @24(8)"); // // Each field is in the following format: @offset(sizeof)[size] ( // may be missing depending on the target platform). For example, // @8(4)[3] means that at offset 8 we have an array of ints, where each // int is 4 bytes, and we have 3 of those ints. The size of the last field may // be missing (as in the example above). Only fields with known offsets are // described. Type names may differ across platforms: one compiler might // produce "unsigned*" where another produces "unsigned int *". std::string DebugString() const { const auto offsets = Offsets(); const size_t sizes[] = {SizeOf>::value...}; const std::string types[] = { adl_barrier::TypeName>()...}; std::string res = absl::StrCat("@0", types[0], "(", sizes[0], ")"); for (size_t i = 0; i != NumOffsets - 1; ++i) { absl::StrAppend(&res, "[", DebugSize(i), "]; @", offsets[i + 1], types[i + 1], "(", sizes[i + 1], ")"); } // NumSizes is a constant that may be zero. Some compilers cannot see that // inside the if statement "size_[NumSizes - 1]" must be valid. int last = static_cast(NumSizes) - 1; if (NumTypes == NumSizes && last >= 0) { absl::StrAppend(&res, "[", DebugSize(static_cast(last)), "]"); } return res; } private: size_t DebugSize(size_t n) const { if (n < NumStaticSizes) { return kStaticSizes[n]; } else { return size_[n - NumStaticSizes]; } } // Arguments of `Layout::Partial()` or `Layout::Layout()`. size_t size_[NumRuntimeSizes > 0 ? NumRuntimeSizes : 1]; }; template using LayoutType = LayoutImpl< std::tuple, StaticSizeSeq, absl::make_index_sequence, absl::make_index_sequence, absl::make_index_sequence>; template class LayoutWithStaticSizes : public LayoutType { private: using Super = LayoutType; public: // The result type of `Partial()` with `NumSizes` arguments. template using PartialType = internal_layout::LayoutType; // `Layout` knows the element types of the arrays we want to lay out in // memory but not the number of elements in each array. // `Partial(size1, ..., sizeN)` allows us to specify the latter. The // resulting immutable object can be used to obtain pointers to the // individual arrays. // // It's allowed to pass fewer array sizes than the number of arrays. E.g., // if all you need is to the offset of the second array, you only need to // pass one argument -- the number of elements in the first array. // // // int[3] followed by 4 bytes of padding and an unknown number of // // doubles. // auto x = Layout::Partial(3); // // doubles start at byte 16. // assert(x.Offset<1>() == 16); // // If you know the number of elements in all arrays, you can still call // `Partial()` but it's more convenient to use the constructor of `Layout`. // // Layout x(3, 5); // // Note: The sizes of the arrays must be specified in number of elements, // not in bytes. // // Requires: `sizeof...(Sizes) + NumStaticSizes <= sizeof...(Ts)`. // Requires: all arguments are convertible to `size_t`. template static constexpr PartialType Partial(Sizes&&... sizes) { static_assert(sizeof...(Sizes) + StaticSizeSeq::size() <= sizeof...(Ts), ""); return PartialType( static_cast(std::forward(sizes))...); } // Inherit LayoutType's constructor. // // Creates a layout with the sizes of all arrays specified. If you know // only the sizes of the first N arrays (where N can be zero), you can use // `Partial()` defined above. The constructor is essentially equivalent to // calling `Partial()` and passing in all array sizes; the constructor is // provided as a convenient abbreviation. // // Note: The sizes of the arrays must be specified in number of elements, // not in bytes. // // Implementation note: we do this via a `using` declaration instead of // defining our own explicit constructor because the signature of LayoutType's // constructor depends on RuntimeSizeSeq, which we don't have access to here. // If we defined our own constructor here, it would have to use a parameter // pack and then cast the arguments to size_t when calling the superclass // constructor, similar to what Partial() does. But that would suffer from the // same problem that Partial() has, which is that the parameter types are // inferred from the arguments, which may be signed types, which must then be // cast to size_t. This can lead to negative values being silently (i.e. with // no compiler warnings) cast to an unsigned type. Having a constructor with // size_t parameters helps the compiler generate better warnings about // potential bad casts, while avoiding false warnings when positive literal // arguments are used. If an argument is a positive literal integer (e.g. // `1`), the compiler will understand that it can be safely converted to // size_t, and hence not generate a warning. But if a negative literal (e.g. // `-1`) or a variable with signed type is used, then it can generate a // warning about a potentially unsafe implicit cast. It would be great if we // could do this for Partial() too, but unfortunately as of C++23 there seems // to be no way to define a function with a variable number of parameters of a // certain type, a.k.a. homogeneous function parameter packs. So we're forced // to choose between explicitly casting the arguments to size_t, which // suppresses all warnings, even potentially valid ones, or implicitly casting // them to size_t, which generates bogus warnings whenever literal arguments // are used, even if they're positive. using Super::Super; }; } // namespace internal_layout // Descriptor of arrays of various types and sizes laid out in memory one after // another. See the top of the file for documentation. // // Check out the public API of internal_layout::LayoutWithStaticSizes and // internal_layout::LayoutImpl above. Those types are internal to the library // but their methods are public, and they are inherited by `Layout`. template class Layout : public internal_layout::LayoutWithStaticSizes< absl::make_index_sequence<0>, Ts...> { private: using Super = internal_layout::LayoutWithStaticSizes, Ts...>; public: // If you know the sizes of some or all of the arrays at compile time, you can // use `WithStaticSizes` or `WithStaticSizeSequence` to create a `Layout` type // with those sizes baked in. This can help the compiler generate optimal code // for calculating array offsets and AllocSize(). // // Like `Partial()`, the N sizes you specify are for the first N arrays, and // they specify the number of elements in each array, not the number of bytes. template using WithStaticSizeSequence = internal_layout::LayoutWithStaticSizes; template using WithStaticSizes = WithStaticSizeSequence>; // Inherit LayoutWithStaticSizes's constructor, which requires you to specify // all the array sizes. using Super::Super; }; } // namespace container_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_CONTAINER_INTERNAL_LAYOUT_H_ *, soong/.intermediates/external/abseil-cpp/absl_container_common_policy_traits_hdrs/gen/my_include_dir/absl/container/internal/common_policy_traits.h+// Copyright 2022 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_CONTAINER_INTERNAL_COMMON_POLICY_TRAITS_H_ #define ABSL_CONTAINER_INTERNAL_COMMON_POLICY_TRAITS_H_ #include #include #include #include #include #include #include "absl/meta/type_traits.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace container_internal { template struct policy_trait_element_is_owner : std::false_type {}; template struct policy_trait_element_is_owner< Policy, std::enable_if_t::value>> : Policy::element_is_owner {}; // Defines how slots are initialized/destroyed/moved. template struct common_policy_traits { // The actual object stored in the container. using slot_type = typename Policy::slot_type; using reference = decltype(Policy::element(std::declval())); using value_type = typename std::remove_reference::type; // PRECONDITION: `slot` is UNINITIALIZED // POSTCONDITION: `slot` is INITIALIZED template static void construct(Alloc* alloc, slot_type* slot, Args&&... args) { Policy::construct(alloc, slot, std::forward(args)...); } // PRECONDITION: `slot` is INITIALIZED // POSTCONDITION: `slot` is UNINITIALIZED // Returns std::true_type in case destroy is trivial. template static auto destroy(Alloc* alloc, slot_type* slot) { return Policy::destroy(alloc, slot); } // Transfers the `old_slot` to `new_slot`. Any memory allocated by the // allocator inside `old_slot` to `new_slot` can be transferred. // // OPTIONAL: defaults to: // // clone(new_slot, std::move(*old_slot)); // destroy(old_slot); // // PRECONDITION: `new_slot` is UNINITIALIZED and `old_slot` is INITIALIZED // POSTCONDITION: `new_slot` is INITIALIZED and `old_slot` is // UNINITIALIZED template static void transfer(Alloc* alloc, slot_type* new_slot, slot_type* old_slot) { transfer_impl(alloc, new_slot, old_slot, Rank2{}); } // PRECONDITION: `slot` is INITIALIZED // POSTCONDITION: `slot` is INITIALIZED // Note: we use remove_const_t so that the two overloads have different args // in the case of sets with explicitly const value_types. template static auto element(absl::remove_const_t* slot) -> decltype(P::element(slot)) { return P::element(slot); } template static auto element(const slot_type* slot) -> decltype(P::element(slot)) { return P::element(slot); } static constexpr bool transfer_uses_memcpy() { return std::is_same>( nullptr, nullptr, nullptr, Rank2{})), std::true_type>::value; } // Returns true if destroy is trivial and can be omitted. template static constexpr bool destroy_is_trivial() { return std::is_same(nullptr, nullptr)), std::true_type>::value; } private: // Use go/ranked-overloads for dispatching. struct Rank0 {}; struct Rank1 : Rank0 {}; struct Rank2 : Rank1 {}; // Use auto -> decltype as an enabler. // P::transfer returns std::true_type if transfer uses memcpy (e.g. in // node_slot_policy). template static auto transfer_impl(Alloc* alloc, slot_type* new_slot, slot_type* old_slot, Rank2) -> decltype(P::transfer(alloc, new_slot, old_slot)) { return P::transfer(alloc, new_slot, old_slot); } // This overload returns true_type for the trait below. // The conditional_t is to make the enabler type dependent. template >::value>> static std::true_type transfer_impl(Alloc*, slot_type* new_slot, slot_type* old_slot, Rank1) { // TODO(b/247130232): remove casts after fixing warnings. // TODO(b/251814870): remove casts after fixing warnings. std::memcpy( static_cast(std::launder( const_cast*>(&element(new_slot)))), static_cast(&element(old_slot)), sizeof(value_type)); return {}; } template static void transfer_impl(Alloc* alloc, slot_type* new_slot, slot_type* old_slot, Rank0) { construct(alloc, new_slot, std::move(element(old_slot))); destroy(alloc, old_slot); } }; } // namespace container_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_CONTAINER_INTERNAL_COMMON_POLICY_TRAITS_H_ * psoong/.intermediates/external/abseil-cpp/absl_container_btree_hdrs/gen/my_include_dir/absl/container/btree_map.h// Copyright 2018 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // File: btree_map.h // ----------------------------------------------------------------------------- // // This header file defines B-tree maps: sorted associative containers mapping // keys to values. // // * `absl::btree_map<>` // * `absl::btree_multimap<>` // // These B-tree types are similar to the corresponding types in the STL // (`std::map` and `std::multimap`) and generally conform to the STL interfaces // of those types. However, because they are implemented using B-trees, they // are more efficient in most situations. // // Unlike `std::map` and `std::multimap`, which are commonly implemented using // red-black tree nodes, B-tree maps use more generic B-tree nodes able to hold // multiple values per node. Holding multiple values per node often makes // B-tree maps perform better than their `std::map` counterparts, because // multiple entries can be checked within the same cache hit. // // However, these types should not be considered drop-in replacements for // `std::map` and `std::multimap` as there are some API differences, which are // noted in this header file. The most consequential differences with respect to // migrating to b-tree from the STL types are listed in the next paragraph. // Other API differences are minor. // // Importantly, insertions and deletions may invalidate outstanding iterators, // pointers, and references to elements. Such invalidations are typically only // an issue if insertion and deletion operations are interleaved with the use of // more than one iterator, pointer, or reference simultaneously. For this // reason, `insert()`, `erase()`, and `extract_and_get_next()` return a valid // iterator at the current position. Another important difference is that // key-types must be copy-constructible. // // There are other API differences: first, btree iterators can be subtracted, // and this is faster than using `std::distance`. Additionally, btree // iterators can be advanced via `operator+=` and `operator-=`, which is faster // than using `std::advance`. // // B-tree maps are not exception-safe. #ifndef ABSL_CONTAINER_BTREE_MAP_H_ #define ABSL_CONTAINER_BTREE_MAP_H_ #include "absl/base/attributes.h" #include "absl/container/internal/btree.h" // IWYU pragma: export #include "absl/container/internal/btree_container.h" // IWYU pragma: export namespace absl { ABSL_NAMESPACE_BEGIN namespace container_internal { template struct map_params; } // namespace container_internal // absl::btree_map<> // // An `absl::btree_map` is an ordered associative container of // unique keys and associated values designed to be a more efficient replacement // for `std::map` (in most cases). // // Keys are sorted using an (optional) comparison function, which defaults to // `std::less`. // // An `absl::btree_map` uses a default allocator of // `std::allocator>` to allocate (and deallocate) // nodes, and construct and destruct values within those nodes. You may // instead specify a custom allocator `A` (which in turn requires specifying a // custom comparator `C`) as in `absl::btree_map`. // template , typename Alloc = std::allocator>> class ABSL_ATTRIBUTE_OWNER btree_map : public container_internal::btree_map_container< container_internal::btree>> { using Base = typename btree_map::btree_map_container; public: // Constructors and Assignment Operators // // A `btree_map` supports the same overload set as `std::map` // for construction and assignment: // // * Default constructor // // absl::btree_map map1; // // * Initializer List constructor // // absl::btree_map map2 = // {{1, "huey"}, {2, "dewey"}, {3, "louie"},}; // // * Copy constructor // // absl::btree_map map3(map2); // // * Copy assignment operator // // absl::btree_map map4; // map4 = map3; // // * Move constructor // // // Move is guaranteed efficient // absl::btree_map map5(std::move(map4)); // // * Move assignment operator // // // May be efficient if allocators are compatible // absl::btree_map map6; // map6 = std::move(map5); // // * Range constructor // // std::vector> v = {{1, "a"}, {2, "b"}}; // absl::btree_map map7(v.begin(), v.end()); btree_map() {} using Base::Base; // btree_map::begin() // // Returns an iterator to the beginning of the `btree_map`. using Base::begin; // btree_map::cbegin() // // Returns a const iterator to the beginning of the `btree_map`. using Base::cbegin; // btree_map::end() // // Returns an iterator to the end of the `btree_map`. using Base::end; // btree_map::cend() // // Returns a const iterator to the end of the `btree_map`. using Base::cend; // btree_map::empty() // // Returns whether or not the `btree_map` is empty. using Base::empty; // btree_map::max_size() // // Returns the largest theoretical possible number of elements within a // `btree_map` under current memory constraints. This value can be thought // of as the largest value of `std::distance(begin(), end())` for a // `btree_map`. using Base::max_size; // btree_map::size() // // Returns the number of elements currently within the `btree_map`. using Base::size; // btree_map::clear() // // Removes all elements from the `btree_map`. Invalidates any references, // pointers, or iterators referring to contained elements. using Base::clear; // btree_map::erase() // // Erases elements within the `btree_map`. If an erase occurs, any references, // pointers, or iterators are invalidated. // Overloads are listed below. // // iterator erase(iterator position): // iterator erase(const_iterator position): // // Erases the element at `position` of the `btree_map`, returning // the iterator pointing to the element after the one that was erased // (or end() if none exists). // // iterator erase(const_iterator first, const_iterator last): // // Erases the elements in the open interval [`first`, `last`), returning // the iterator pointing to the element after the interval that was erased // (or end() if none exists). // // template size_type erase(const K& key): // // Erases the element with the matching key, if it exists, returning the // number of elements erased (0 or 1). using Base::erase; // btree_map::insert() // // Inserts an element of the specified value into the `btree_map`, // returning an iterator pointing to the newly inserted element, provided that // an element with the given key does not already exist. If an insertion // occurs, any references, pointers, or iterators are invalidated. // Overloads are listed below. // // std::pair insert(const value_type& value): // // Inserts a value into the `btree_map`. Returns a pair consisting of an // iterator to the inserted element (or to the element that prevented the // insertion) and a bool denoting whether the insertion took place. // // std::pair insert(value_type&& value): // // Inserts a moveable value into the `btree_map`. Returns a pair // consisting of an iterator to the inserted element (or to the element that // prevented the insertion) and a bool denoting whether the insertion took // place. // // iterator insert(const_iterator hint, const value_type& value): // iterator insert(const_iterator hint, value_type&& value): // // Inserts a value, using the position of `hint` as a non-binding suggestion // for where to begin the insertion search. Returns an iterator to the // inserted element, or to the existing element that prevented the // insertion. // // void insert(InputIterator first, InputIterator last): // // Inserts a range of values [`first`, `last`). // // void insert(std::initializer_list ilist): // // Inserts the elements within the initializer list `ilist`. using Base::insert; // btree_map::insert_or_assign() // // Inserts an element of the specified value into the `btree_map` provided // that a value with the given key does not already exist, or replaces the // corresponding mapped type with the forwarded `obj` argument if a key for // that value already exists, returning an iterator pointing to the newly // inserted element. Overloads are listed below. // // pair insert_or_assign(const key_type& k, M&& obj): // pair insert_or_assign(key_type&& k, M&& obj): // // Inserts/Assigns (or moves) the element of the specified key into the // `btree_map`. If the returned bool is true, insertion took place, and if // it's false, assignment took place. // // iterator insert_or_assign(const_iterator hint, // const key_type& k, M&& obj): // iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj): // // Inserts/Assigns (or moves) the element of the specified key into the // `btree_map` using the position of `hint` as a non-binding suggestion // for where to begin the insertion search. using Base::insert_or_assign; // btree_map::emplace() // // Inserts an element of the specified value by constructing it in-place // within the `btree_map`, provided that no element with the given key // already exists. // // The element may be constructed even if there already is an element with the // key in the container, in which case the newly constructed element will be // destroyed immediately. Prefer `try_emplace()` unless your key is not // copyable or moveable. // // If an insertion occurs, any references, pointers, or iterators are // invalidated. using Base::emplace; // btree_map::emplace_hint() // // Inserts an element of the specified value by constructing it in-place // within the `btree_map`, using the position of `hint` as a non-binding // suggestion for where to begin the insertion search, and only inserts // provided that no element with the given key already exists. // // The element may be constructed even if there already is an element with the // key in the container, in which case the newly constructed element will be // destroyed immediately. Prefer `try_emplace()` unless your key is not // copyable or moveable. // // If an insertion occurs, any references, pointers, or iterators are // invalidated. using Base::emplace_hint; // btree_map::try_emplace() // // Inserts an element of the specified value by constructing it in-place // within the `btree_map`, provided that no element with the given key // already exists. Unlike `emplace()`, if an element with the given key // already exists, we guarantee that no element is constructed. // // If an insertion occurs, any references, pointers, or iterators are // invalidated. // // Overloads are listed below. // // std::pair try_emplace(const key_type& k, Args&&... args): // std::pair try_emplace(key_type&& k, Args&&... args): // // Inserts (via copy or move) the element of the specified key into the // `btree_map`. // // iterator try_emplace(const_iterator hint, // const key_type& k, Args&&... args): // iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args): // // Inserts (via copy or move) the element of the specified key into the // `btree_map` using the position of `hint` as a non-binding suggestion // for where to begin the insertion search. using Base::try_emplace; // btree_map::extract() // // Extracts the indicated element, erasing it in the process, and returns it // as a C++17-compatible node handle. Any references, pointers, or iterators // are invalidated. Overloads are listed below. // // node_type extract(const_iterator position): // // Extracts the element at the indicated position and returns a node handle // owning that extracted data. // // template node_type extract(const K& k): // // Extracts the element with the key matching the passed key value and // returns a node handle owning that extracted data. If the `btree_map` // does not contain an element with a matching key, this function returns an // empty node handle. // // NOTE: when compiled in an earlier version of C++ than C++17, // `node_type::key()` returns a const reference to the key instead of a // mutable reference. We cannot safely return a mutable reference without // std::launder (which is not available before C++17). // // NOTE: In this context, `node_type` refers to the C++17 concept of a // move-only type that owns and provides access to the elements in associative // containers (https://en.cppreference.com/w/cpp/container/node_handle). // It does NOT refer to the data layout of the underlying btree. using Base::extract; // btree_map::extract_and_get_next() // // Extracts the indicated element, erasing it in the process, and returns it // as a C++17-compatible node handle along with an iterator to the next // element. // // extract_and_get_next_return_type extract_and_get_next( // const_iterator position): // // Extracts the element at the indicated position, returns a struct // containing a member named `node`: a node handle owning that extracted // data and a member named `next`: an iterator pointing to the next element // in the btree. using Base::extract_and_get_next; // btree_map::merge() // // Extracts elements from a given `source` btree_map into this // `btree_map`. If the destination `btree_map` already contains an // element with an equivalent key, that element is not extracted. using Base::merge; // btree_map::swap(btree_map& other) // // Exchanges the contents of this `btree_map` with those of the `other` // btree_map, avoiding invocation of any move, copy, or swap operations on // individual elements. // // All iterators and references on the `btree_map` remain valid, excepting // for the past-the-end iterator, which is invalidated. using Base::swap; // btree_map::at() // // Returns a reference to the mapped value of the element with key equivalent // to the passed key. using Base::at; // btree_map::contains() // // template bool contains(const K& key) const: // // Determines whether an element comparing equal to the given `key` exists // within the `btree_map`, returning `true` if so or `false` otherwise. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::contains; // btree_map::count() // // template size_type count(const K& key) const: // // Returns the number of elements comparing equal to the given `key` within // the `btree_map`. Note that this function will return either `1` or `0` // since duplicate elements are not allowed within a `btree_map`. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::count; // btree_map::equal_range() // // Returns a half-open range [first, last), defined by a `std::pair` of two // iterators, containing all elements with the passed key in the `btree_map`. using Base::equal_range; // btree_map::find() // // template iterator find(const K& key): // template const_iterator find(const K& key) const: // // Finds an element with the passed `key` within the `btree_map`. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::find; // btree_map::lower_bound() // // template iterator lower_bound(const K& key): // template const_iterator lower_bound(const K& key) const: // // Finds the first element with a key that is not less than `key` within the // `btree_map`. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::lower_bound; // btree_map::upper_bound() // // template iterator upper_bound(const K& key): // template const_iterator upper_bound(const K& key) const: // // Finds the first element with a key that is greater than `key` within the // `btree_map`. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::upper_bound; // btree_map::operator[]() // // Returns a reference to the value mapped to the passed key within the // `btree_map`, performing an `insert()` if the key does not already // exist. // // If an insertion occurs, any references, pointers, or iterators are // invalidated. Otherwise iterators are not affected and references are not // invalidated. Overloads are listed below. // // T& operator[](key_type&& key): // T& operator[](const key_type& key): // // Inserts a value_type object constructed in-place if the element with the // given key does not exist. using Base::operator[]; // btree_map::get_allocator() // // Returns the allocator function associated with this `btree_map`. using Base::get_allocator; // btree_map::key_comp(); // // Returns the key comparator associated with this `btree_map`. using Base::key_comp; // btree_map::value_comp(); // // Returns the value comparator associated with this `btree_map`. using Base::value_comp; }; // absl::swap(absl::btree_map<>, absl::btree_map<>) // // Swaps the contents of two `absl::btree_map` containers. template void swap(btree_map &x, btree_map &y) { return x.swap(y); } // absl::erase_if(absl::btree_map<>, Pred) // // Erases all elements that satisfy the predicate pred from the container. // Returns the number of erased elements. template typename btree_map::size_type erase_if( btree_map &map, Pred pred) { return container_internal::btree_access::erase_if(map, std::move(pred)); } // absl::btree_multimap // // An `absl::btree_multimap` is an ordered associative container of // keys and associated values designed to be a more efficient replacement for // `std::multimap` (in most cases). Unlike `absl::btree_map`, a B-tree multimap // allows multiple elements with equivalent keys. // // Keys are sorted using an (optional) comparison function, which defaults to // `std::less`. // // An `absl::btree_multimap` uses a default allocator of // `std::allocator>` to allocate (and deallocate) // nodes, and construct and destruct values within those nodes. You may // instead specify a custom allocator `A` (which in turn requires specifying a // custom comparator `C`) as in `absl::btree_multimap`. // template , typename Alloc = std::allocator>> class ABSL_ATTRIBUTE_OWNER btree_multimap : public container_internal::btree_multimap_container< container_internal::btree>> { using Base = typename btree_multimap::btree_multimap_container; public: // Constructors and Assignment Operators // // A `btree_multimap` supports the same overload set as `std::multimap` // for construction and assignment: // // * Default constructor // // absl::btree_multimap map1; // // * Initializer List constructor // // absl::btree_multimap map2 = // {{1, "huey"}, {2, "dewey"}, {3, "louie"},}; // // * Copy constructor // // absl::btree_multimap map3(map2); // // * Copy assignment operator // // absl::btree_multimap map4; // map4 = map3; // // * Move constructor // // // Move is guaranteed efficient // absl::btree_multimap map5(std::move(map4)); // // * Move assignment operator // // // May be efficient if allocators are compatible // absl::btree_multimap map6; // map6 = std::move(map5); // // * Range constructor // // std::vector> v = {{1, "a"}, {2, "b"}}; // absl::btree_multimap map7(v.begin(), v.end()); btree_multimap() {} using Base::Base; // btree_multimap::begin() // // Returns an iterator to the beginning of the `btree_multimap`. using Base::begin; // btree_multimap::cbegin() // // Returns a const iterator to the beginning of the `btree_multimap`. using Base::cbegin; // btree_multimap::end() // // Returns an iterator to the end of the `btree_multimap`. using Base::end; // btree_multimap::cend() // // Returns a const iterator to the end of the `btree_multimap`. using Base::cend; // btree_multimap::empty() // // Returns whether or not the `btree_multimap` is empty. using Base::empty; // btree_multimap::max_size() // // Returns the largest theoretical possible number of elements within a // `btree_multimap` under current memory constraints. This value can be // thought of as the largest value of `std::distance(begin(), end())` for a // `btree_multimap`. using Base::max_size; // btree_multimap::size() // // Returns the number of elements currently within the `btree_multimap`. using Base::size; // btree_multimap::clear() // // Removes all elements from the `btree_multimap`. Invalidates any references, // pointers, or iterators referring to contained elements. using Base::clear; // btree_multimap::erase() // // Erases elements within the `btree_multimap`. If an erase occurs, any // references, pointers, or iterators are invalidated. // Overloads are listed below. // // iterator erase(iterator position): // iterator erase(const_iterator position): // // Erases the element at `position` of the `btree_multimap`, returning // the iterator pointing to the element after the one that was erased // (or end() if none exists). // // iterator erase(const_iterator first, const_iterator last): // // Erases the elements in the open interval [`first`, `last`), returning // the iterator pointing to the element after the interval that was erased // (or end() if none exists). // // template size_type erase(const K& key): // // Erases the elements matching the key, if any exist, returning the // number of elements erased. using Base::erase; // btree_multimap::insert() // // Inserts an element of the specified value into the `btree_multimap`, // returning an iterator pointing to the newly inserted element. // Any references, pointers, or iterators are invalidated. Overloads are // listed below. // // iterator insert(const value_type& value): // // Inserts a value into the `btree_multimap`, returning an iterator to the // inserted element. // // iterator insert(value_type&& value): // // Inserts a moveable value into the `btree_multimap`, returning an iterator // to the inserted element. // // iterator insert(const_iterator hint, const value_type& value): // iterator insert(const_iterator hint, value_type&& value): // // Inserts a value, using the position of `hint` as a non-binding suggestion // for where to begin the insertion search. Returns an iterator to the // inserted element. // // void insert(InputIterator first, InputIterator last): // // Inserts a range of values [`first`, `last`). // // void insert(std::initializer_list ilist): // // Inserts the elements within the initializer list `ilist`. using Base::insert; // btree_multimap::emplace() // // Inserts an element of the specified value by constructing it in-place // within the `btree_multimap`. Any references, pointers, or iterators are // invalidated. using Base::emplace; // btree_multimap::emplace_hint() // // Inserts an element of the specified value by constructing it in-place // within the `btree_multimap`, using the position of `hint` as a non-binding // suggestion for where to begin the insertion search. // // Any references, pointers, or iterators are invalidated. using Base::emplace_hint; // btree_multimap::extract() // // Extracts the indicated element, erasing it in the process, and returns it // as a C++17-compatible node handle. Overloads are listed below. // // node_type extract(const_iterator position): // // Extracts the element at the indicated position and returns a node handle // owning that extracted data. // // template node_type extract(const K& k): // // Extracts the element with the key matching the passed key value and // returns a node handle owning that extracted data. If the `btree_multimap` // does not contain an element with a matching key, this function returns an // empty node handle. // // NOTE: when compiled in an earlier version of C++ than C++17, // `node_type::key()` returns a const reference to the key instead of a // mutable reference. We cannot safely return a mutable reference without // std::launder (which is not available before C++17). // // NOTE: In this context, `node_type` refers to the C++17 concept of a // move-only type that owns and provides access to the elements in associative // containers (https://en.cppreference.com/w/cpp/container/node_handle). // It does NOT refer to the data layout of the underlying btree. using Base::extract; // btree_multimap::extract_and_get_next() // // Extracts the indicated element, erasing it in the process, and returns it // as a C++17-compatible node handle along with an iterator to the next // element. // // extract_and_get_next_return_type extract_and_get_next( // const_iterator position): // // Extracts the element at the indicated position, returns a struct // containing a member named `node`: a node handle owning that extracted // data and a member named `next`: an iterator pointing to the next element // in the btree. using Base::extract_and_get_next; // btree_multimap::merge() // // Extracts all elements from a given `source` btree_multimap into this // `btree_multimap`. using Base::merge; // btree_multimap::swap(btree_multimap& other) // // Exchanges the contents of this `btree_multimap` with those of the `other` // btree_multimap, avoiding invocation of any move, copy, or swap operations // on individual elements. // // All iterators and references on the `btree_multimap` remain valid, // excepting for the past-the-end iterator, which is invalidated. using Base::swap; // btree_multimap::contains() // // template bool contains(const K& key) const: // // Determines whether an element comparing equal to the given `key` exists // within the `btree_multimap`, returning `true` if so or `false` otherwise. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::contains; // btree_multimap::count() // // template size_type count(const K& key) const: // // Returns the number of elements comparing equal to the given `key` within // the `btree_multimap`. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::count; // btree_multimap::equal_range() // // Returns a half-open range [first, last), defined by a `std::pair` of two // iterators, containing all elements with the passed key in the // `btree_multimap`. using Base::equal_range; // btree_multimap::find() // // template iterator find(const K& key): // template const_iterator find(const K& key) const: // // Finds an element with the passed `key` within the `btree_multimap`. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::find; // btree_multimap::lower_bound() // // template iterator lower_bound(const K& key): // template const_iterator lower_bound(const K& key) const: // // Finds the first element with a key that is not less than `key` within the // `btree_multimap`. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::lower_bound; // btree_multimap::upper_bound() // // template iterator upper_bound(const K& key): // template const_iterator upper_bound(const K& key) const: // // Finds the first element with a key that is greater than `key` within the // `btree_multimap`. // // Supports heterogeneous lookup, provided that the map has a compatible // heterogeneous comparator. using Base::upper_bound; // btree_multimap::get_allocator() // // Returns the allocator function associated with this `btree_multimap`. using Base::get_allocator; // btree_multimap::key_comp(); // // Returns the key comparator associated with this `btree_multimap`. using Base::key_comp; // btree_multimap::value_comp(); // // Returns the value comparator associated with this `btree_multimap`. using Base::value_comp; }; // absl::swap(absl::btree_multimap<>, absl::btree_multimap<>) // // Swaps the contents of two `absl::btree_multimap` containers. template void swap(btree_multimap &x, btree_multimap &y) { return x.swap(y); } // absl::erase_if(absl::btree_multimap<>, Pred) // // Erases all elements that satisfy the predicate pred from the container. // Returns the number of erased elements. template typename btree_multimap::size_type erase_if( btree_multimap &map, Pred pred) { return container_internal::btree_access::erase_if(map, std::move(pred)); } namespace container_internal { // A parameters structure for holding the type parameters for a btree_map. // Compare and Alloc should be nothrow copy-constructible. template struct map_params : common_params> { using super_type = typename map_params::common_params; using mapped_type = Data; // This type allows us to move keys when it is safe to do so. It is safe // for maps in which value_type and mutable_value_type are layout compatible. using slot_policy = typename super_type::slot_policy; using slot_type = typename super_type::slot_type; using value_type = typename super_type::value_type; using init_type = typename super_type::init_type; template static auto key(const V &value ABSL_ATTRIBUTE_LIFETIME_BOUND) -> decltype((value.first)) { return value.first; } static const Key &key(const slot_type *s) { return slot_policy::key(s); } static const Key &key(slot_type *s) { return slot_policy::key(s); } // For use in node handle. static auto mutable_key(slot_type *s) -> decltype(slot_policy::mutable_key(s)) { return slot_policy::mutable_key(s); } static mapped_type &value(value_type *value) { return value->second; } }; } // namespace container_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_CONTAINER_BTREE_MAP_H_ * {soong/.intermediates/external/abseil-cpp/absl_base_spinlock_wait_hdrs/gen/my_include_dir/absl/base/internal/spinlock_wait.h// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_BASE_INTERNAL_SPINLOCK_WAIT_H_ #define ABSL_BASE_INTERNAL_SPINLOCK_WAIT_H_ // Operations to make atomic transitions on a word, and to allow // waiting for those transitions to become possible. #include #include #include "absl/base/internal/scheduling_mode.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace base_internal { // SpinLockWait() waits until it can perform one of several transitions from // "from" to "to". It returns when it performs a transition where done==true. struct SpinLockWaitTransition { uint32_t from; uint32_t to; bool done; }; // Wait until *w can transition from trans[i].from to trans[i].to for some i // satisfying 0<=i *w, int n, const SpinLockWaitTransition trans[], SchedulingMode scheduling_mode); // If possible, wake some thread that has called SpinLockDelay(w, ...). If `all` // is true, wake all such threads. On some systems, this may be a no-op; on // those systems, threads calling SpinLockDelay() will always wake eventually // even if SpinLockWake() is never called. void SpinLockWake(std::atomic *w, bool all); // Wait for an appropriate spin delay on iteration "loop" of a // spin loop on location *w, whose previously observed value was "value". // SpinLockDelay() may do nothing, may yield the CPU, may sleep a clock tick, // or may wait for a call to SpinLockWake(w). void SpinLockDelay(std::atomic *w, uint32_t value, int loop, base_internal::SchedulingMode scheduling_mode); // Helper used by AbslInternalSpinLockDelay. // Returns a suggested delay in nanoseconds for iteration number "loop". int SpinLockSuggestedDelayNS(int loop); } // namespace base_internal ABSL_NAMESPACE_END } // namespace absl // In some build configurations we pass --detect-odr-violations to the // gold linker. This causes it to flag weak symbol overrides as ODR // violations. Because ODR only applies to C++ and not C, // --detect-odr-violations ignores symbols not mangled with C++ names. // By changing our extension points to be extern "C", we dodge this // check. extern "C" { void ABSL_INTERNAL_C_SYMBOL(AbslInternalSpinLockWake)(std::atomic *w, bool all); void ABSL_INTERNAL_C_SYMBOL(AbslInternalSpinLockDelay)( std::atomic *w, uint32_t value, int loop, absl::base_internal::SchedulingMode scheduling_mode); } inline void absl::base_internal::SpinLockWake(std::atomic *w, bool all) { ABSL_INTERNAL_C_SYMBOL(AbslInternalSpinLockWake)(w, all); } inline void absl::base_internal::SpinLockDelay( std::atomic *w, uint32_t value, int loop, absl::base_internal::SchedulingMode scheduling_mode) { ABSL_INTERNAL_C_SYMBOL(AbslInternalSpinLockDelay) (w, value, loop, scheduling_mode); } #endif // ABSL_BASE_INTERNAL_SPINLOCK_WAIT_H_ *B `soong/.intermediates/external/abseil-cpp/absl_base_hdrs/gen/my_include_dir/absl/base/call_once.hA// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // File: call_once.h // ----------------------------------------------------------------------------- // // This header file provides an Abseil version of `std::call_once` for invoking // a given function at most once, across all threads. This Abseil version is // faster than the C++11 version and incorporates the C++17 argument-passing // fix, so that (for example) non-const references may be passed to the invoked // function. #ifndef ABSL_BASE_CALL_ONCE_H_ #define ABSL_BASE_CALL_ONCE_H_ #include #include #include #include #include #include #include "absl/base/attributes.h" #include "absl/base/config.h" #include "absl/base/internal/low_level_scheduling.h" #include "absl/base/internal/raw_logging.h" #include "absl/base/internal/scheduling_mode.h" #include "absl/base/internal/spinlock_wait.h" #include "absl/base/macros.h" #include "absl/base/nullability.h" #include "absl/base/optimization.h" #include "absl/base/port.h" namespace absl { ABSL_NAMESPACE_BEGIN class once_flag; namespace base_internal { std::atomic* absl_nonnull ControlWord( absl::once_flag* absl_nonnull flag); } // namespace base_internal // call_once() // // For all invocations using a given `once_flag`, invokes a given `fn` exactly // once across all threads. The first call to `call_once()` with a particular // `once_flag` argument (that does not throw an exception) will run the // specified function with the provided `args`; other calls with the same // `once_flag` argument will not run the function, but will wait // for the provided function to finish running (if it is still running). // // This mechanism provides a safe, simple, and fast mechanism for one-time // initialization in a multi-threaded process. // // Example: // // class MyInitClass { // public: // ... // mutable absl::once_flag once_; // // MyInitClass* init() const { // absl::call_once(once_, &MyInitClass::Init, this); // return ptr_; // } // template void call_once(absl::once_flag& flag, Callable&& fn, Args&&... args); // once_flag // // Objects of this type are used to distinguish calls to `call_once()` and // ensure the provided function is only invoked once across all threads. This // type is not copyable or movable. However, it has a `constexpr` // constructor, and is safe to use as a namespace-scoped global variable. class once_flag { public: constexpr once_flag() : control_(0) {} once_flag(const once_flag&) = delete; once_flag& operator=(const once_flag&) = delete; private: friend std::atomic* absl_nonnull base_internal::ControlWord( once_flag* absl_nonnull flag); std::atomic control_; }; //------------------------------------------------------------------------------ // End of public interfaces. // Implementation details follow. //------------------------------------------------------------------------------ namespace base_internal { // Like call_once, but uses KERNEL_ONLY scheduling. Intended to be used to // initialize entities used by the scheduler implementation. template void LowLevelCallOnce(absl::once_flag* absl_nonnull flag, Callable&& fn, Args&&... args); // Disables scheduling while on stack when scheduling mode is non-cooperative. // No effect for cooperative scheduling modes. class SchedulingHelper { public: explicit SchedulingHelper(base_internal::SchedulingMode mode) : mode_(mode) { if (mode_ == base_internal::SCHEDULE_KERNEL_ONLY) { guard_result_ = base_internal::SchedulingGuard::DisableRescheduling(); } } ~SchedulingHelper() { if (mode_ == base_internal::SCHEDULE_KERNEL_ONLY) { base_internal::SchedulingGuard::EnableRescheduling(guard_result_); } } private: base_internal::SchedulingMode mode_; bool guard_result_ = false; }; // Bit patterns for call_once state machine values. Internal implementation // detail, not for use by clients. // // The bit patterns are arbitrarily chosen from unlikely values, to aid in // debugging. However, kOnceInit must be 0, so that a zero-initialized // once_flag will be valid for immediate use. enum { kOnceInit = 0, kOnceRunning = 0x65C2937B, kOnceWaiter = 0x05A308D2, // A very small constant is chosen for kOnceDone so that it fit in a single // compare with immediate instruction for most common ISAs. This is verified // for x86, POWER and ARM. kOnceDone = 221, // Random Number }; template void CallOnceImpl(std::atomic* absl_nonnull control, base_internal::SchedulingMode scheduling_mode, Callable&& fn, Args&&... args) { #ifndef NDEBUG { uint32_t old_control = control->load(std::memory_order_relaxed); if (old_control != kOnceInit && old_control != kOnceRunning && old_control != kOnceWaiter && old_control != kOnceDone) { ABSL_RAW_LOG(FATAL, "Unexpected value for control word: 0x%lx", static_cast(old_control)); // NOLINT } } #endif // NDEBUG static const base_internal::SpinLockWaitTransition trans[] = { {kOnceInit, kOnceRunning, true}, {kOnceRunning, kOnceWaiter, false}, {kOnceDone, kOnceDone, true}}; // Must do this before potentially modifying control word's state. base_internal::SchedulingHelper maybe_disable_scheduling(scheduling_mode); // Short circuit the simplest case to avoid procedure call overhead. // The base_internal::SpinLockWait() call returns either kOnceInit or // kOnceDone. If it returns kOnceDone, it must have loaded the control word // with std::memory_order_acquire and seen a value of kOnceDone. uint32_t old_control = kOnceInit; if (control->compare_exchange_strong(old_control, kOnceRunning, std::memory_order_relaxed) || base_internal::SpinLockWait(control, ABSL_ARRAYSIZE(trans), trans, scheduling_mode) == kOnceInit) { std::invoke(std::forward(fn), std::forward(args)...); old_control = control->exchange(base_internal::kOnceDone, std::memory_order_release); if (old_control == base_internal::kOnceWaiter) { base_internal::SpinLockWake(control, true); } } // else *control is already kOnceDone } inline std::atomic* absl_nonnull ControlWord( once_flag* absl_nonnull flag) { return &flag->control_; } template void LowLevelCallOnce(absl::once_flag* absl_nonnull flag, Callable&& fn, Args&&... args) { std::atomic* once = base_internal::ControlWord(flag); uint32_t s = once->load(std::memory_order_acquire); if (ABSL_PREDICT_FALSE(s != base_internal::kOnceDone)) { base_internal::CallOnceImpl(once, base_internal::SCHEDULE_KERNEL_ONLY, std::forward(fn), std::forward(args)...); } } } // namespace base_internal template void call_once(absl::once_flag& flag, Callable&& fn, Args&&... args) { std::atomic* once = base_internal::ControlWord(&flag); uint32_t s = once->load(std::memory_order_acquire); if (ABSL_PREDICT_FALSE(s != base_internal::kOnceDone)) { base_internal::CallOnceImpl( once, base_internal::SCHEDULE_COOPERATIVE_AND_KERNEL, std::forward(fn), std::forward(args)...); } } ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_BASE_CALL_ONCE_H_ *" tsoong/.intermediates/external/abseil-cpp/absl_log_absl_vlog_is_on_hdrs/gen/my_include_dir/absl/log/absl_vlog_is_on.h!// Copyright 2022 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // File: log/absl_vlog_is_on.h // ----------------------------------------------------------------------------- // // This header defines the `ABSL_VLOG_IS_ON()` macro that controls the // variable-verbosity conditional logging. // // It's used by `VLOG` in log.h, or it can also be used directly like this: // // if (ABSL_VLOG_IS_ON(2)) { // foo_server.RecomputeStatisticsExpensive(); // LOG(INFO) << foo_server.LastStatisticsAsString(); // } // // Each source file has an effective verbosity level that's a non-negative // integer computed from the `--vmodule` and `--v` flags. // `ABSL_VLOG_IS_ON(n)` is true, and `VLOG(n)` logs, if that effective verbosity // level is greater than or equal to `n`. // // `--vmodule` takes a comma-delimited list of key=value pairs. Each key is a // pattern matched against filenames, and the values give the effective severity // level applied to matching files. '?' and '*' characters in patterns are // interpreted as single-character and zero-or-more-character wildcards. // Patterns including a slash character are matched against full pathnames, // while those without are matched against basenames only. One suffix (i.e. the // last . and everything after it) is stripped from each filename prior to // matching, as is the special suffix "-inl". // // Example: --vmodule=module_a=1,module_b=2 // // Files are matched against globs in `--vmodule` in order, and the first match // determines the verbosity level. // // Files which do not match any pattern in `--vmodule` use the value of `--v` as // their effective verbosity level. The default is 0. // // SetVLogLevel helper function is provided to do limited dynamic control over // V-logging by appending to `--vmodule`. Because these go at the beginning of // the list, they take priority over any globs previously added. // // Resetting --vmodule will override all previous modifications to `--vmodule`, // including via SetVLogLevel. #ifndef ABSL_LOG_ABSL_VLOG_IS_ON_H_ #define ABSL_LOG_ABSL_VLOG_IS_ON_H_ #include "absl/base/attributes.h" #include "absl/base/config.h" #include "absl/log/internal/vlog_config.h" // IWYU pragma: export #include "absl/strings/string_view.h" // IWYU pragma: private, include "absl/log/log.h" // This is expanded at the callsite to allow the compiler to optimize // always-false cases out of the build. // An ABSL_MAX_VLOG_VERBOSITY of 2 means that VLOG(3) and above should never // log. #ifdef ABSL_MAX_VLOG_VERBOSITY #define ABSL_LOG_INTERNAL_MAX_LOG_VERBOSITY_CHECK(x) \ ((x) <= ABSL_MAX_VLOG_VERBOSITY)&& #else #define ABSL_LOG_INTERNAL_MAX_LOG_VERBOSITY_CHECK(x) #endif // Each ABSL_VLOG_IS_ON call site gets its own VLogSite that registers with the // global linked list of sites to asynchronously update its verbosity level on // changes to --v or --vmodule. The verbosity can also be set by manually // calling SetVLogLevel. // // ABSL_VLOG_IS_ON is not async signal safe, but it is guaranteed not to // allocate new memory. #define ABSL_VLOG_IS_ON(verbose_level) \ (ABSL_LOG_INTERNAL_MAX_LOG_VERBOSITY_CHECK(verbose_level)[]() \ ->::absl::log_internal::VLogSite * \ { \ ABSL_CONST_INIT static ::absl::log_internal::VLogSite site(__FILE__); \ return &site; \ }() \ ->IsEnabled(verbose_level)) #endif // ABSL_LOG_ABSL_VLOG_IS_ON_H_ ** fsoong/.intermediates/external/abseil-cpp/absl_log_absl_log_hdrs/gen/my_include_dir/absl/log/absl_log.h)// Copyright 2022 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // File: log/absl_log.h // ----------------------------------------------------------------------------- // // This header declares a family of `ABSL_LOG` macros as alternative spellings // for macros in `log.h`. // // Basic invocation looks like this: // // ABSL_LOG(INFO) << "Found " << num_cookies << " cookies"; // // Most `ABSL_LOG` macros take a severity level argument. The severity levels // are `INFO`, `WARNING`, `ERROR`, and `FATAL`. // // For full documentation, see comments in `log.h`, which includes full // reference documentation on use of the equivalent `LOG` macro and has an // identical set of macros without the ABSL_* prefix. #ifndef ABSL_LOG_ABSL_LOG_H_ #define ABSL_LOG_ABSL_LOG_H_ #include "absl/log/internal/log_impl.h" #define ABSL_LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity) #define ABSL_PLOG(severity) ABSL_LOG_INTERNAL_PLOG_IMPL(_##severity) #define ABSL_DLOG(severity) ABSL_LOG_INTERNAL_DLOG_IMPL(_##severity) #define ABSL_VLOG(verbose_level) ABSL_LOG_INTERNAL_VLOG_IMPL(verbose_level) #define ABSL_DVLOG(verbose_level) ABSL_LOG_INTERNAL_DVLOG_IMPL(verbose_level) #define ABSL_LOG_IF(severity, condition) \ ABSL_LOG_INTERNAL_LOG_IF_IMPL(_##severity, condition) #define ABSL_PLOG_IF(severity, condition) \ ABSL_LOG_INTERNAL_PLOG_IF_IMPL(_##severity, condition) #define ABSL_DLOG_IF(severity, condition) \ ABSL_LOG_INTERNAL_DLOG_IF_IMPL(_##severity, condition) #define ABSL_LOG_EVERY_N(severity, n) \ ABSL_LOG_INTERNAL_LOG_EVERY_N_IMPL(_##severity, n) #define ABSL_LOG_FIRST_N(severity, n) \ ABSL_LOG_INTERNAL_LOG_FIRST_N_IMPL(_##severity, n) #define ABSL_LOG_EVERY_POW_2(severity) \ ABSL_LOG_INTERNAL_LOG_EVERY_POW_2_IMPL(_##severity) #define ABSL_LOG_EVERY_N_SEC(severity, n_seconds) \ ABSL_LOG_INTERNAL_LOG_EVERY_N_SEC_IMPL(_##severity, n_seconds) #define ABSL_PLOG_EVERY_N(severity, n) \ ABSL_LOG_INTERNAL_PLOG_EVERY_N_IMPL(_##severity, n) #define ABSL_PLOG_FIRST_N(severity, n) \ ABSL_LOG_INTERNAL_PLOG_FIRST_N_IMPL(_##severity, n) #define ABSL_PLOG_EVERY_POW_2(severity) \ ABSL_LOG_INTERNAL_PLOG_EVERY_POW_2_IMPL(_##severity) #define ABSL_PLOG_EVERY_N_SEC(severity, n_seconds) \ ABSL_LOG_INTERNAL_PLOG_EVERY_N_SEC_IMPL(_##severity, n_seconds) #define ABSL_DLOG_EVERY_N(severity, n) \ ABSL_LOG_INTERNAL_DLOG_EVERY_N_IMPL(_##severity, n) #define ABSL_DLOG_FIRST_N(severity, n) \ ABSL_LOG_INTERNAL_DLOG_FIRST_N_IMPL(_##severity, n) #define ABSL_DLOG_EVERY_POW_2(severity) \ ABSL_LOG_INTERNAL_DLOG_EVERY_POW_2_IMPL(_##severity) #define ABSL_DLOG_EVERY_N_SEC(severity, n_seconds) \ ABSL_LOG_INTERNAL_DLOG_EVERY_N_SEC_IMPL(_##severity, n_seconds) #define ABSL_VLOG_EVERY_N(verbose_level, n) \ ABSL_LOG_INTERNAL_VLOG_EVERY_N_IMPL(verbose_level, n) #define ABSL_VLOG_FIRST_N(verbose_level, n) \ ABSL_LOG_INTERNAL_VLOG_FIRST_N_IMPL(verbose_level, n) #define ABSL_VLOG_EVERY_POW_2(verbose_level, n) \ ABSL_LOG_INTERNAL_VLOG_EVERY_POW_2_IMPL(verbose_level, n) #define ABSL_VLOG_EVERY_N_SEC(verbose_level, n) \ ABSL_LOG_INTERNAL_VLOG_EVERY_N_SEC_IMPL(verbose_level, n) #define ABSL_LOG_IF_EVERY_N(severity, condition, n) \ ABSL_LOG_INTERNAL_LOG_IF_EVERY_N_IMPL(_##severity, condition, n) #define ABSL_LOG_IF_FIRST_N(severity, condition, n) \ ABSL_LOG_INTERNAL_LOG_IF_FIRST_N_IMPL(_##severity, condition, n) #define ABSL_LOG_IF_EVERY_POW_2(severity, condition) \ ABSL_LOG_INTERNAL_LOG_IF_EVERY_POW_2_IMPL(_##severity, condition) #define ABSL_LOG_IF_EVERY_N_SEC(severity, condition, n_seconds) \ ABSL_LOG_INTERNAL_LOG_IF_EVERY_N_SEC_IMPL(_##severity, condition, n_seconds) #define ABSL_PLOG_IF_EVERY_N(severity, condition, n) \ ABSL_LOG_INTERNAL_PLOG_IF_EVERY_N_IMPL(_##severity, condition, n) #define ABSL_PLOG_IF_FIRST_N(severity, condition, n) \ ABSL_LOG_INTERNAL_PLOG_IF_FIRST_N_IMPL(_##severity, condition, n) #define ABSL_PLOG_IF_EVERY_POW_2(severity, condition) \ ABSL_LOG_INTERNAL_PLOG_IF_EVERY_POW_2_IMPL(_##severity, condition) #define ABSL_PLOG_IF_EVERY_N_SEC(severity, condition, n_seconds) \ ABSL_LOG_INTERNAL_PLOG_IF_EVERY_N_SEC_IMPL(_##severity, condition, n_seconds) #define ABSL_DLOG_IF_EVERY_N(severity, condition, n) \ ABSL_LOG_INTERNAL_DLOG_IF_EVERY_N_IMPL(_##severity, condition, n) #define ABSL_DLOG_IF_FIRST_N(severity, condition, n) \ ABSL_LOG_INTERNAL_DLOG_IF_FIRST_N_IMPL(_##severity, condition, n) #define ABSL_DLOG_IF_EVERY_POW_2(severity, condition) \ ABSL_LOG_INTERNAL_DLOG_IF_EVERY_POW_2_IMPL(_##severity, condition) #define ABSL_DLOG_IF_EVERY_N_SEC(severity, condition, n_seconds) \ ABSL_LOG_INTERNAL_DLOG_IF_EVERY_N_SEC_IMPL(_##severity, condition, n_seconds) #endif // ABSL_LOG_ABSL_LOG_H_ * usoong/.intermediates/external/abseil-cpp/absl_strings_hdrs/gen/my_include_dir/absl/strings/internal/string_constant.h// Copyright 2020 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_STRING_CONSTANT_H_ #define ABSL_STRINGS_INTERNAL_STRING_CONSTANT_H_ #include "absl/meta/type_traits.h" #include "absl/strings/string_view.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace strings_internal { // StringConstant represents a compile time string constant. // It can be accessed via its `absl::string_view value` static member. // It is guaranteed that the `string_view` returned has constant `.data()`, // constant `.size()` and constant `value[i]` for all `0 <= i < .size()` // // The `T` is an opaque type. It is guaranteed that different string constants // will have different values of `T`. This allows users to associate the string // constant with other static state at compile time. // // Instances should be made using the `MakeStringConstant()` factory function // below. template struct StringConstant { private: static constexpr bool TryConstexprEval(absl::string_view view) { return view.empty() || 2 * view[0] != 1; } public: static constexpr absl::string_view value = T{}(); constexpr absl::string_view operator()() const { return value; } // Check to be sure `view` points to constant data. // Otherwise, it can't be constant evaluated. static_assert(TryConstexprEval(value), "The input string_view must point to constant data."); }; // Factory function for `StringConstant` instances. // It supports callables that have a constexpr default constructor and a // constexpr operator(). // It must return an `absl::string_view` or `const char*` pointing to constant // data. This is validated at compile time. template constexpr StringConstant MakeStringConstant(T) { return {}; } } // namespace strings_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_STRING_CONSTANT_H_ * soong/.intermediates/external/abseil-cpp/absl_synchronization_hdrs/gen/my_include_dir/absl/synchronization/internal/create_thread_identity.h/* * Copyright 2017 The Abseil Authors. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * https://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ // Interface for getting the current ThreadIdentity, creating one if necessary. // See thread_identity.h. // // This file is separate from thread_identity.h because creating a new // ThreadIdentity requires slightly higher level libraries (per_thread_sem // and low_level_alloc) than accessing an existing one. This separation allows // us to have a smaller //absl/base:base. #ifndef ABSL_SYNCHRONIZATION_INTERNAL_CREATE_THREAD_IDENTITY_H_ #define ABSL_SYNCHRONIZATION_INTERNAL_CREATE_THREAD_IDENTITY_H_ #include "absl/base/internal/thread_identity.h" #include "absl/base/port.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace synchronization_internal { // Allocates and attaches a ThreadIdentity object for the calling thread. // For private use only. base_internal::ThreadIdentity* CreateThreadIdentity(); // Returns the ThreadIdentity object representing the calling thread; guaranteed // to be unique for its lifetime. The returned object will remain valid for the // program's lifetime; although it may be re-assigned to a subsequent thread. // If one does not exist for the calling thread, allocate it now. inline base_internal::ThreadIdentity* GetOrCreateCurrentThreadIdentity() { base_internal::ThreadIdentity* identity = base_internal::CurrentThreadIdentityIfPresent(); if (ABSL_PREDICT_FALSE(identity == nullptr)) { return CreateThreadIdentity(); } return identity; } } // namespace synchronization_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_SYNCHRONIZATION_INTERNAL_CREATE_THREAD_IDENTITY_H_ * \soong/.intermediates/external/abseil-cpp/absl_time_hdrs/gen/my_include_dir/absl/time/clock.h// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // File: clock.h // ----------------------------------------------------------------------------- // // This header file contains utility functions for working with the system-wide // realtime clock. For descriptions of the main time abstractions used within // this header file, consult the time.h header file. #ifndef ABSL_TIME_CLOCK_H_ #define ABSL_TIME_CLOCK_H_ #include #include "absl/base/config.h" #include "absl/base/macros.h" #include "absl/time/time.h" namespace absl { ABSL_NAMESPACE_BEGIN // Now() // // Returns the current time, expressed as an `absl::Time` absolute time value. absl::Time Now(); // GetCurrentTimeNanos() // // Returns the current time, expressed as a count of nanoseconds since the Unix // Epoch (https://en.wikipedia.org/wiki/Unix_time). Prefer `absl::Now()` instead // for all but the most performance-sensitive cases (i.e. when you are calling // this function hundreds of thousands of times per second). int64_t GetCurrentTimeNanos(); // SleepFor() // // Sleeps for the specified duration, expressed as an `absl::Duration`. // // Notes: // * Signal interruptions will not reduce the sleep duration. // * Returns immediately when passed a nonpositive duration. void SleepFor(absl::Duration duration); ABSL_NAMESPACE_END } // namespace absl // ----------------------------------------------------------------------------- // Implementation Details // ----------------------------------------------------------------------------- // In some build configurations we pass --detect-odr-violations to the // gold linker. This causes it to flag weak symbol overrides as ODR // violations. Because ODR only applies to C++ and not C, // --detect-odr-violations ignores symbols not mangled with C++ names. // By changing our extension points to be extern "C", we dodge this // check. extern "C" { ABSL_DLL void ABSL_INTERNAL_C_SYMBOL(AbslInternalSleepFor)( absl::Duration duration); } // extern "C" inline void absl::SleepFor(absl::Duration duration) { ABSL_INTERNAL_C_SYMBOL(AbslInternalSleepFor)(duration); } #endif // ABSL_TIME_CLOCK_H_ *% soong/.intermediates/external/abseil-cpp/absl_base_malloc_internal_hdrs/gen/my_include_dir/absl/base/internal/low_level_alloc.h$// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // #ifndef ABSL_BASE_INTERNAL_LOW_LEVEL_ALLOC_H_ #define ABSL_BASE_INTERNAL_LOW_LEVEL_ALLOC_H_ // A simple thread-safe memory allocator that does not depend on // mutexes or thread-specific data. It is intended to be used // sparingly, and only when malloc() would introduce an unwanted // dependency, such as inside the heap-checker, or the Mutex // implementation. // IWYU pragma: private, include "base/low_level_alloc.h" #include #include #include "absl/base/attributes.h" #include "absl/base/config.h" // LowLevelAlloc requires that the platform support low-level // allocation of virtual memory. Platforms lacking this cannot use // LowLevelAlloc. #ifdef ABSL_LOW_LEVEL_ALLOC_MISSING #error ABSL_LOW_LEVEL_ALLOC_MISSING cannot be directly set #elif !defined(ABSL_HAVE_MMAP) && !defined(_WIN32) #define ABSL_LOW_LEVEL_ALLOC_MISSING 1 #endif // Using LowLevelAlloc with kAsyncSignalSafe isn't supported on Windows or // asm.js / WebAssembly. // See https://kripken.github.io/emscripten-site/docs/porting/pthreads.html // for more information. #ifdef ABSL_LOW_LEVEL_ALLOC_ASYNC_SIGNAL_SAFE_MISSING #error ABSL_LOW_LEVEL_ALLOC_ASYNC_SIGNAL_SAFE_MISSING cannot be directly set #elif defined(_WIN32) || defined(__asmjs__) || defined(__wasm__) || \ defined(__hexagon__) #define ABSL_LOW_LEVEL_ALLOC_ASYNC_SIGNAL_SAFE_MISSING 1 #endif #include #include "absl/base/port.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace base_internal { class LowLevelAlloc { public: struct Arena; // an arena from which memory may be allocated // Returns a pointer to a block of at least "request" bytes // that have been newly allocated from the specific arena. // for Alloc() call the DefaultArena() is used. // Returns 0 if passed request==0. // Does not return 0 under other circumstances; it crashes if memory // is not available. static void *Alloc(size_t request) ABSL_ATTRIBUTE_SECTION(malloc_hook); static void *AllocWithArena(size_t request, Arena *arena) ABSL_ATTRIBUTE_SECTION(malloc_hook); // Deallocates a region of memory that was previously allocated with // Alloc(). Does nothing if passed 0. "s" must be either 0, // or must have been returned from a call to Alloc() and not yet passed to // Free() since that call to Alloc(). The space is returned to the arena // from which it was allocated. static void Free(void *s) ABSL_ATTRIBUTE_SECTION(malloc_hook); // ABSL_ATTRIBUTE_SECTION(malloc_hook) for Alloc* and Free // are to put all callers of MallocHook::Invoke* in this module // into special section, // so that MallocHook::GetCallerStackTrace can function accurately. // Create a new arena. // The root metadata for the new arena is allocated in the // meta_data_arena; the DefaultArena() can be passed for meta_data_arena. // These values may be ored into flags: enum { // Report calls to Alloc() and Free() via the MallocHook interface. // Set in the DefaultArena. kCallMallocHook = 0x0001, #ifndef ABSL_LOW_LEVEL_ALLOC_ASYNC_SIGNAL_SAFE_MISSING // Make calls to Alloc(), Free() be async-signal-safe. Not set in // DefaultArena(). Not supported on all platforms. kAsyncSignalSafe = 0x0002, #endif }; // Construct a new arena. The allocation of the underlying metadata honors // the provided flags. For example, the call NewArena(kAsyncSignalSafe) // is itself async-signal-safe, as well as generatating an arena that provides // async-signal-safe Alloc/Free. static Arena *NewArena(uint32_t flags); // Destroys an arena allocated by NewArena and returns true, // provided no allocated blocks remain in the arena. // If allocated blocks remain in the arena, does nothing and // returns false. // It is illegal to attempt to destroy the DefaultArena(). static bool DeleteArena(Arena *arena); // The default arena that always exists. static Arena *DefaultArena(); private: LowLevelAlloc(); // no instances }; } // namespace base_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_BASE_INTERNAL_LOW_LEVEL_ALLOC_H_ * soong/.intermediates/external/abseil-cpp/absl_strings_cordz_update_tracker_hdrs/gen/my_include_dir/absl/strings/internal/cordz_update_tracker.h// Copyright 2021 The Abseil Authors // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_CORDZ_UPDATE_TRACKER_H_ #define ABSL_STRINGS_INTERNAL_CORDZ_UPDATE_TRACKER_H_ #include #include #include "absl/base/config.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace cord_internal { // CordzUpdateTracker tracks counters for Cord update methods. // // The purpose of CordzUpdateTracker is to track the number of calls to methods // updating Cord data for sampled cords. The class internally uses 'lossy' // atomic operations: Cord is thread-compatible, so there is no need to // synchronize updates. However, Cordz collection threads may call 'Value()' at // any point, so the class needs to provide thread safe access. // // This class is thread-safe. But as per above comments, all non-const methods // should be used single-threaded only: updates are thread-safe but lossy. class CordzUpdateTracker { public: // Tracked update methods. enum MethodIdentifier { kUnknown, kAppendCord, kAppendCordBuffer, kAppendExternalMemory, kAppendString, kAssignCord, kAssignString, kClear, kConstructorCord, kConstructorString, kCordReader, kFlatten, kGetAppendBuffer, kGetAppendRegion, kMakeCordFromExternal, kMoveAppendCord, kMoveAssignCord, kMovePrependCord, kPrependCord, kPrependCordBuffer, kPrependString, kRemovePrefix, kRemoveSuffix, kSetExpectedChecksum, kSubCord, // kNumMethods defines the number of entries: must be the last entry. kNumMethods, }; // Constructs a new instance. All counters are zero-initialized. constexpr CordzUpdateTracker() noexcept : values_{} {} // Copy constructs a new instance. CordzUpdateTracker(const CordzUpdateTracker& rhs) noexcept { *this = rhs; } // Assigns the provided value to this instance. CordzUpdateTracker& operator=(const CordzUpdateTracker& rhs) noexcept { for (int i = 0; i < kNumMethods; ++i) { values_[i].store(rhs.values_[i].load(std::memory_order_relaxed), std::memory_order_relaxed); } return *this; } // Returns the value for the specified method. int64_t Value(MethodIdentifier method) const { return values_[method].load(std::memory_order_relaxed); } // Increases the value for the specified method by `n` void LossyAdd(MethodIdentifier method, int64_t n = 1) { auto& value = values_[method]; value.store(value.load(std::memory_order_relaxed) + n, std::memory_order_relaxed); } // Adds all the values from `src` to this instance void LossyAdd(const CordzUpdateTracker& src) { for (int i = 0; i < kNumMethods; ++i) { MethodIdentifier method = static_cast(i); if (int64_t value = src.Value(method)) { LossyAdd(method, value); } } } private: // Until C++20 std::atomic is not constexpr default-constructible, so we need // a wrapper for this class to be constexpr constructible. class Counter : public std::atomic { public: constexpr Counter() noexcept : std::atomic(0) {} }; Counter values_[kNumMethods]; }; } // namespace cord_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_CORDZ_UPDATE_TRACKER_H_ * soong/.intermediates/external/abseil-cpp/absl_strings_cordz_statistics_hdrs/gen/my_include_dir/absl/strings/internal/cordz_statistics.h// Copyright 2019 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_CORDZ_STATISTICS_H_ #define ABSL_STRINGS_INTERNAL_CORDZ_STATISTICS_H_ #include #include "absl/base/config.h" #include "absl/strings/internal/cordz_update_tracker.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace cord_internal { // CordzStatistics captures some meta information about a Cord's shape. struct CordzStatistics { using MethodIdentifier = CordzUpdateTracker::MethodIdentifier; // Node counts information struct NodeCounts { size_t flat = 0; // #flats size_t flat_64 = 0; // #flats up to 64 bytes size_t flat_128 = 0; // #flats up to 128 bytes size_t flat_256 = 0; // #flats up to 256 bytes size_t flat_512 = 0; // #flats up to 512 bytes size_t flat_1k = 0; // #flats up to 1K bytes size_t external = 0; // #external reps size_t substring = 0; // #substring reps size_t concat = 0; // #concat reps size_t ring = 0; // #ring buffer reps size_t btree = 0; // #btree reps size_t crc = 0; // #crc reps }; // The size of the cord in bytes. This matches the result of Cord::size(). size_t size = 0; // The estimated memory used by the sampled cord. This value matches the // value as reported by Cord::EstimatedMemoryUsage(). // A value of 0 implies the property has not been recorded. size_t estimated_memory_usage = 0; // The effective memory used by the sampled cord, inversely weighted by the // effective indegree of each allocated node. This is a representation of the // fair share of memory usage that should be attributed to the sampled cord. // This value is more useful for cases where one or more nodes are referenced // by multiple Cord instances, and for cases where a Cord includes the same // node multiple times (either directly or indirectly). // A value of 0 implies the property has not been recorded. size_t estimated_fair_share_memory_usage = 0; // The total number of nodes referenced by this cord. // For ring buffer Cords, this includes the 'ring buffer' node. // For btree Cords, this includes all 'CordRepBtree' tree nodes as well as all // the substring, flat and external nodes referenced by the tree. // A value of 0 implies the property has not been recorded. size_t node_count = 0; // Detailed node counts per type NodeCounts node_counts; // The cord method responsible for sampling the cord. MethodIdentifier method = MethodIdentifier::kUnknown; // The cord method responsible for sampling the parent cord if applicable. MethodIdentifier parent_method = MethodIdentifier::kUnknown; // Update tracker tracking invocation count per cord method. CordzUpdateTracker update_tracker; }; } // namespace cord_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_CORDZ_STATISTICS_H_ *} soong/.intermediates/external/abseil-cpp/absl_base_dynamic_annotations_hdrs/gen/my_include_dir/absl/base/internal/dynamic_annotations.h|// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // This file defines dynamic annotations for use with dynamic analysis tool // such as valgrind, PIN, etc. // // Dynamic annotation is a source code annotation that affects the generated // code (that is, the annotation is not a comment). Each such annotation is // attached to a particular instruction and/or to a particular object (address) // in the program. // // The annotations that should be used by users are macros in all upper-case // (e.g., ANNOTATE_THREAD_NAME). // // Actual implementation of these macros may differ depending on the dynamic // analysis tool being used. // // This file supports the following configurations: // - Dynamic Annotations enabled (with static thread-safety warnings disabled). // In this case, macros expand to functions implemented by Thread Sanitizer, // when building with TSan. When not provided an external implementation, // dynamic_annotations.cc provides no-op implementations. // // - Static Clang thread-safety warnings enabled. // When building with a Clang compiler that supports thread-safety warnings, // a subset of annotations can be statically-checked at compile-time. We // expand these macros to static-inline functions that can be analyzed for // thread-safety, but afterwards elided when building the final binary. // // - All annotations are disabled. // If neither Dynamic Annotations nor Clang thread-safety warnings are // enabled, then all annotation-macros expand to empty. #ifndef ABSL_BASE_INTERNAL_DYNAMIC_ANNOTATIONS_H_ #define ABSL_BASE_INTERNAL_DYNAMIC_ANNOTATIONS_H_ #include #include "absl/base/config.h" // ------------------------------------------------------------------------- // Decide which features are enabled #ifndef DYNAMIC_ANNOTATIONS_ENABLED #define DYNAMIC_ANNOTATIONS_ENABLED 0 #endif #if defined(__clang__) && !defined(SWIG) #define ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED 1 #endif #if DYNAMIC_ANNOTATIONS_ENABLED != 0 #define ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED 1 #define ABSL_INTERNAL_READS_ANNOTATIONS_ENABLED 1 #define ABSL_INTERNAL_WRITES_ANNOTATIONS_ENABLED 1 #define ABSL_INTERNAL_ANNOTALYSIS_ENABLED 0 #define ABSL_INTERNAL_READS_WRITES_ANNOTATIONS_ENABLED 1 #else #define ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED 0 #define ABSL_INTERNAL_READS_ANNOTATIONS_ENABLED 0 #define ABSL_INTERNAL_WRITES_ANNOTATIONS_ENABLED 0 // Clang provides limited support for static thread-safety analysis through a // feature called Annotalysis. We configure macro-definitions according to // whether Annotalysis support is available. When running in opt-mode, GCC // will issue a warning, if these attributes are compiled. Only include them // when compiling using Clang. // ANNOTALYSIS_ENABLED == 1 when IGNORE_READ_ATTRIBUTE_ENABLED == 1 #define ABSL_INTERNAL_ANNOTALYSIS_ENABLED \ defined(ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED) // Read/write annotations are enabled in Annotalysis mode; disabled otherwise. #define ABSL_INTERNAL_READS_WRITES_ANNOTATIONS_ENABLED \ ABSL_INTERNAL_ANNOTALYSIS_ENABLED #endif // Memory annotations are also made available to LLVM's Memory Sanitizer #if defined(ABSL_HAVE_MEMORY_SANITIZER) && !defined(__native_client__) #define ABSL_INTERNAL_MEMORY_ANNOTATIONS_ENABLED 1 #endif #ifndef ABSL_INTERNAL_MEMORY_ANNOTATIONS_ENABLED #define ABSL_INTERNAL_MEMORY_ANNOTATIONS_ENABLED 0 #endif #ifdef __cplusplus #define ABSL_INTERNAL_BEGIN_EXTERN_C extern "C" { #define ABSL_INTERNAL_END_EXTERN_C } // extern "C" #define ABSL_INTERNAL_GLOBAL_SCOPED(F) ::F #define ABSL_INTERNAL_STATIC_INLINE inline #else #define ABSL_INTERNAL_BEGIN_EXTERN_C // empty #define ABSL_INTERNAL_END_EXTERN_C // empty #define ABSL_INTERNAL_GLOBAL_SCOPED(F) F #define ABSL_INTERNAL_STATIC_INLINE static inline #endif // ------------------------------------------------------------------------- // Define race annotations. #if ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED == 1 // ------------------------------------------------------------- // Annotations that suppress errors. It is usually better to express the // program's synchronization using the other annotations, but these can be used // when all else fails. // Report that we may have a benign race at `pointer`, with size // "sizeof(*(pointer))". `pointer` must be a non-void* pointer. Insert at the // point where `pointer` has been allocated, preferably close to the point // where the race happens. See also ANNOTATE_BENIGN_RACE_STATIC. #define ANNOTATE_BENIGN_RACE(pointer, description) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateBenignRaceSized) \ (__FILE__, __LINE__, pointer, sizeof(*(pointer)), description) // Same as ANNOTATE_BENIGN_RACE(`address`, `description`), but applies to // the memory range [`address`, `address`+`size`). #define ANNOTATE_BENIGN_RACE_SIZED(address, size, description) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateBenignRaceSized) \ (__FILE__, __LINE__, address, size, description) // Enable (`enable`!=0) or disable (`enable`==0) race detection for all threads. // This annotation could be useful if you want to skip expensive race analysis // during some period of program execution, e.g. during initialization. #define ANNOTATE_ENABLE_RACE_DETECTION(enable) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateEnableRaceDetection) \ (__FILE__, __LINE__, enable) // ------------------------------------------------------------- // Annotations useful for debugging. // Report the current thread `name` to a race detector. #define ANNOTATE_THREAD_NAME(name) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateThreadName)(__FILE__, __LINE__, name) // ------------------------------------------------------------- // Annotations useful when implementing locks. They are not normally needed by // modules that merely use locks. The `lock` argument is a pointer to the lock // object. // Report that a lock has been created at address `lock`. #define ANNOTATE_RWLOCK_CREATE(lock) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockCreate)(__FILE__, __LINE__, lock) // Report that a linker initialized lock has been created at address `lock`. #ifdef ABSL_HAVE_THREAD_SANITIZER #define ANNOTATE_RWLOCK_CREATE_STATIC(lock) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockCreateStatic) \ (__FILE__, __LINE__, lock) #else #define ANNOTATE_RWLOCK_CREATE_STATIC(lock) ANNOTATE_RWLOCK_CREATE(lock) #endif // Report that the lock at address `lock` is about to be destroyed. #define ANNOTATE_RWLOCK_DESTROY(lock) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockDestroy)(__FILE__, __LINE__, lock) // Report that the lock at address `lock` has been acquired. // `is_w`=1 for writer lock, `is_w`=0 for reader lock. #define ANNOTATE_RWLOCK_ACQUIRED(lock, is_w) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockAcquired) \ (__FILE__, __LINE__, lock, is_w) // Report that the lock at address `lock` is about to be released. // `is_w`=1 for writer lock, `is_w`=0 for reader lock. #define ANNOTATE_RWLOCK_RELEASED(lock, is_w) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockReleased) \ (__FILE__, __LINE__, lock, is_w) // Apply ANNOTATE_BENIGN_RACE_SIZED to a static variable `static_var`. #define ANNOTATE_BENIGN_RACE_STATIC(static_var, description) \ namespace { \ class static_var##_annotator { \ public: \ static_var##_annotator() { \ ANNOTATE_BENIGN_RACE_SIZED(&static_var, sizeof(static_var), \ #static_var ": " description); \ } \ }; \ static static_var##_annotator the##static_var##_annotator; \ } // namespace #else // ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED == 0 #define ANNOTATE_RWLOCK_CREATE(lock) // empty #define ANNOTATE_RWLOCK_CREATE_STATIC(lock) // empty #define ANNOTATE_RWLOCK_DESTROY(lock) // empty #define ANNOTATE_RWLOCK_ACQUIRED(lock, is_w) // empty #define ANNOTATE_RWLOCK_RELEASED(lock, is_w) // empty #define ANNOTATE_BENIGN_RACE(address, description) // empty #define ANNOTATE_BENIGN_RACE_SIZED(address, size, description) // empty #define ANNOTATE_THREAD_NAME(name) // empty #define ANNOTATE_ENABLE_RACE_DETECTION(enable) // empty #define ANNOTATE_BENIGN_RACE_STATIC(static_var, description) // empty #endif // ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED // ------------------------------------------------------------------------- // Define memory annotations. #if ABSL_INTERNAL_MEMORY_ANNOTATIONS_ENABLED == 1 #include #define ANNOTATE_MEMORY_IS_INITIALIZED(address, size) \ __msan_unpoison(address, size) #define ANNOTATE_MEMORY_IS_UNINITIALIZED(address, size) \ __msan_allocated_memory(address, size) #else // ABSL_INTERNAL_MEMORY_ANNOTATIONS_ENABLED == 0 #if DYNAMIC_ANNOTATIONS_ENABLED == 1 #define ANNOTATE_MEMORY_IS_INITIALIZED(address, size) \ do { \ (void)(address); \ (void)(size); \ } while (0) #define ANNOTATE_MEMORY_IS_UNINITIALIZED(address, size) \ do { \ (void)(address); \ (void)(size); \ } while (0) #else #define ANNOTATE_MEMORY_IS_INITIALIZED(address, size) // empty #define ANNOTATE_MEMORY_IS_UNINITIALIZED(address, size) // empty #endif #endif // ABSL_INTERNAL_MEMORY_ANNOTATIONS_ENABLED // ------------------------------------------------------------------------- // Define IGNORE_READS_BEGIN/_END attributes. #if defined(ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED) #define ABSL_INTERNAL_IGNORE_READS_BEGIN_ATTRIBUTE \ __attribute((exclusive_lock_function("*"))) #define ABSL_INTERNAL_IGNORE_READS_END_ATTRIBUTE \ __attribute((unlock_function("*"))) #else // !defined(ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED) #define ABSL_INTERNAL_IGNORE_READS_BEGIN_ATTRIBUTE // empty #define ABSL_INTERNAL_IGNORE_READS_END_ATTRIBUTE // empty #endif // defined(ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED) // ------------------------------------------------------------------------- // Define IGNORE_READS_BEGIN/_END annotations. #if ABSL_INTERNAL_READS_ANNOTATIONS_ENABLED == 1 // Request the analysis tool to ignore all reads in the current thread until // ANNOTATE_IGNORE_READS_END is called. Useful to ignore intentional racey // reads, while still checking other reads and all writes. // See also ANNOTATE_UNPROTECTED_READ. #define ANNOTATE_IGNORE_READS_BEGIN() \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateIgnoreReadsBegin)(__FILE__, __LINE__) // Stop ignoring reads. #define ANNOTATE_IGNORE_READS_END() \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateIgnoreReadsEnd)(__FILE__, __LINE__) #elif defined(ABSL_INTERNAL_ANNOTALYSIS_ENABLED) // When Annotalysis is enabled without Dynamic Annotations, the use of // static-inline functions allows the annotations to be read at compile-time, // while still letting the compiler elide the functions from the final build. // // TODO(delesley) -- The exclusive lock here ignores writes as well, but // allows IGNORE_READS_AND_WRITES to work properly. #define ANNOTATE_IGNORE_READS_BEGIN() \ ABSL_INTERNAL_GLOBAL_SCOPED(AbslInternalAnnotateIgnoreReadsBegin)() #define ANNOTATE_IGNORE_READS_END() \ ABSL_INTERNAL_GLOBAL_SCOPED(AbslInternalAnnotateIgnoreReadsEnd)() #else #define ANNOTATE_IGNORE_READS_BEGIN() // empty #define ANNOTATE_IGNORE_READS_END() // empty #endif // ------------------------------------------------------------------------- // Define IGNORE_WRITES_BEGIN/_END annotations. #if ABSL_INTERNAL_WRITES_ANNOTATIONS_ENABLED == 1 // Similar to ANNOTATE_IGNORE_READS_BEGIN, but ignore writes instead. #define ANNOTATE_IGNORE_WRITES_BEGIN() \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateIgnoreWritesBegin)(__FILE__, __LINE__) // Stop ignoring writes. #define ANNOTATE_IGNORE_WRITES_END() \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateIgnoreWritesEnd)(__FILE__, __LINE__) #else #define ANNOTATE_IGNORE_WRITES_BEGIN() // empty #define ANNOTATE_IGNORE_WRITES_END() // empty #endif // ------------------------------------------------------------------------- // Define the ANNOTATE_IGNORE_READS_AND_WRITES_* annotations using the more // primitive annotations defined above. // // Instead of doing // ANNOTATE_IGNORE_READS_BEGIN(); // ... = x; // ANNOTATE_IGNORE_READS_END(); // one can use // ... = ANNOTATE_UNPROTECTED_READ(x); #if defined(ABSL_INTERNAL_READS_WRITES_ANNOTATIONS_ENABLED) // Start ignoring all memory accesses (both reads and writes). #define ANNOTATE_IGNORE_READS_AND_WRITES_BEGIN() \ do { \ ANNOTATE_IGNORE_READS_BEGIN(); \ ANNOTATE_IGNORE_WRITES_BEGIN(); \ } while (0) // Stop ignoring both reads and writes. #define ANNOTATE_IGNORE_READS_AND_WRITES_END() \ do { \ ANNOTATE_IGNORE_WRITES_END(); \ ANNOTATE_IGNORE_READS_END(); \ } while (0) #ifdef __cplusplus // ANNOTATE_UNPROTECTED_READ is the preferred way to annotate racey reads. #define ANNOTATE_UNPROTECTED_READ(x) \ absl::base_internal::AnnotateUnprotectedRead(x) #endif #else #define ANNOTATE_IGNORE_READS_AND_WRITES_BEGIN() // empty #define ANNOTATE_IGNORE_READS_AND_WRITES_END() // empty #define ANNOTATE_UNPROTECTED_READ(x) (x) #endif // ------------------------------------------------------------------------- // Address sanitizer annotations #ifdef ABSL_HAVE_ADDRESS_SANITIZER // Describe the current state of a contiguous container such as e.g. // std::vector or std::string. For more details see // sanitizer/common_interface_defs.h, which is provided by the compiler. #include #define ANNOTATE_CONTIGUOUS_CONTAINER(beg, end, old_mid, new_mid) \ __sanitizer_annotate_contiguous_container(beg, end, old_mid, new_mid) #define ADDRESS_SANITIZER_REDZONE(name) \ struct { \ char x[8] __attribute__((aligned(8))); \ } name #else #define ANNOTATE_CONTIGUOUS_CONTAINER(beg, end, old_mid, new_mid) #define ADDRESS_SANITIZER_REDZONE(name) static_assert(true, "") #endif // ABSL_HAVE_ADDRESS_SANITIZER // ------------------------------------------------------------------------- // Undefine the macros intended only for this file. #undef ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_MEMORY_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_READS_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_WRITES_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_ANNOTALYSIS_ENABLED #undef ABSL_INTERNAL_READS_WRITES_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_BEGIN_EXTERN_C #undef ABSL_INTERNAL_END_EXTERN_C #undef ABSL_INTERNAL_STATIC_INLINE #endif // ABSL_BASE_INTERNAL_DYNAMIC_ANNOTATIONS_H_ *ז ~soong/.intermediates/external/abseil-cpp/absl_base_dynamic_annotations_hdrs/gen/my_include_dir/absl/base/dynamic_annotations.hӕ// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // This file defines dynamic annotations for use with dynamic analysis tool // such as valgrind, PIN, etc. // // Dynamic annotation is a source code annotation that affects the generated // code (that is, the annotation is not a comment). Each such annotation is // attached to a particular instruction and/or to a particular object (address) // in the program. // // The annotations that should be used by users are macros in all upper-case // (e.g., ABSL_ANNOTATE_THREAD_NAME). // // Actual implementation of these macros may differ depending on the dynamic // analysis tool being used. // // This file supports the following configurations: // - Dynamic Annotations enabled (with static thread-safety warnings disabled). // In this case, macros expand to functions implemented by Thread Sanitizer, // when building with TSan. When not provided an external implementation, // dynamic_annotations.cc provides no-op implementations. // // - Static Clang thread-safety warnings enabled. // When building with a Clang compiler that supports thread-safety warnings, // a subset of annotations can be statically-checked at compile-time. We // expand these macros to static-inline functions that can be analyzed for // thread-safety, but afterwards elided when building the final binary. // // - All annotations are disabled. // If neither Dynamic Annotations nor Clang thread-safety warnings are // enabled, then all annotation-macros expand to empty. #ifndef ABSL_BASE_DYNAMIC_ANNOTATIONS_H_ #define ABSL_BASE_DYNAMIC_ANNOTATIONS_H_ #include #include #include "absl/base/attributes.h" #include "absl/base/config.h" #ifdef __cplusplus #include "absl/base/macros.h" #endif #ifdef ABSL_HAVE_HWADDRESS_SANITIZER #include #endif // TODO(rogeeff): Remove after the backward compatibility period. #include "absl/base/internal/dynamic_annotations.h" // IWYU pragma: export // ------------------------------------------------------------------------- // Decide which features are enabled. #ifdef ABSL_HAVE_THREAD_SANITIZER #define ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED 1 #define ABSL_INTERNAL_READS_ANNOTATIONS_ENABLED 1 #define ABSL_INTERNAL_WRITES_ANNOTATIONS_ENABLED 1 #define ABSL_INTERNAL_ANNOTALYSIS_ENABLED 0 #define ABSL_INTERNAL_READS_WRITES_ANNOTATIONS_ENABLED 1 #else #define ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED 0 #define ABSL_INTERNAL_READS_ANNOTATIONS_ENABLED 0 #define ABSL_INTERNAL_WRITES_ANNOTATIONS_ENABLED 0 // Clang provides limited support for static thread-safety analysis through a // feature called Annotalysis. We configure macro-definitions according to // whether Annotalysis support is available. When running in opt-mode, GCC // will issue a warning, if these attributes are compiled. Only include them // when compiling using Clang. #if defined(__clang__) #define ABSL_INTERNAL_ANNOTALYSIS_ENABLED 1 #if !defined(SWIG) #define ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED 1 #endif #else #define ABSL_INTERNAL_ANNOTALYSIS_ENABLED 0 #endif // Read/write annotations are enabled in Annotalysis mode; disabled otherwise. #define ABSL_INTERNAL_READS_WRITES_ANNOTATIONS_ENABLED \ ABSL_INTERNAL_ANNOTALYSIS_ENABLED #endif // ABSL_HAVE_THREAD_SANITIZER #ifdef __cplusplus #define ABSL_INTERNAL_BEGIN_EXTERN_C extern "C" { #define ABSL_INTERNAL_END_EXTERN_C } // extern "C" #define ABSL_INTERNAL_GLOBAL_SCOPED(F) ::F #define ABSL_INTERNAL_STATIC_INLINE inline #else #define ABSL_INTERNAL_BEGIN_EXTERN_C // empty #define ABSL_INTERNAL_END_EXTERN_C // empty #define ABSL_INTERNAL_GLOBAL_SCOPED(F) F #define ABSL_INTERNAL_STATIC_INLINE static inline #endif // ------------------------------------------------------------------------- // Define race annotations. #if ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED == 1 // Some of the symbols used in this section (e.g. AnnotateBenignRaceSized) are // defined by the compiler-based sanitizer implementation, not by the Abseil // library. Therefore they do not use ABSL_INTERNAL_C_SYMBOL. // ------------------------------------------------------------- // Annotations that suppress errors. It is usually better to express the // program's synchronization using the other annotations, but these can be used // when all else fails. // Report that we may have a benign race at `pointer`, with size // "sizeof(*(pointer))". `pointer` must be a non-void* pointer. Insert at the // point where `pointer` has been allocated, preferably close to the point // where the race happens. See also ABSL_ANNOTATE_BENIGN_RACE_STATIC. #define ABSL_ANNOTATE_BENIGN_RACE(pointer, description) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateBenignRaceSized) \ (__FILE__, __LINE__, pointer, sizeof(*(pointer)), description) // Same as ABSL_ANNOTATE_BENIGN_RACE(`address`, `description`), but applies to // the memory range [`address`, `address`+`size`). #define ABSL_ANNOTATE_BENIGN_RACE_SIZED(address, size, description) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateBenignRaceSized) \ (__FILE__, __LINE__, address, size, description) // Enable (`enable`!=0) or disable (`enable`==0) race detection for all threads. // This annotation could be useful if you want to skip expensive race analysis // during some period of program execution, e.g. during initialization. #define ABSL_ANNOTATE_ENABLE_RACE_DETECTION(enable) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateEnableRaceDetection) \ (__FILE__, __LINE__, enable) // ------------------------------------------------------------- // Annotations useful for debugging. // Report the current thread `name` to a race detector. #define ABSL_ANNOTATE_THREAD_NAME(name) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateThreadName)(__FILE__, __LINE__, name) // ------------------------------------------------------------- // Annotations useful when implementing locks. They are not normally needed by // modules that merely use locks. The `lock` argument is a pointer to the lock // object. // Report that a lock has been created at address `lock`. #define ABSL_ANNOTATE_RWLOCK_CREATE(lock) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockCreate)(__FILE__, __LINE__, lock) // Report that a linker initialized lock has been created at address `lock`. #ifdef ABSL_HAVE_THREAD_SANITIZER #define ABSL_ANNOTATE_RWLOCK_CREATE_STATIC(lock) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockCreateStatic) \ (__FILE__, __LINE__, lock) #else #define ABSL_ANNOTATE_RWLOCK_CREATE_STATIC(lock) \ ABSL_ANNOTATE_RWLOCK_CREATE(lock) #endif // Report that the lock at address `lock` is about to be destroyed. #define ABSL_ANNOTATE_RWLOCK_DESTROY(lock) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockDestroy)(__FILE__, __LINE__, lock) // Report that the lock at address `lock` has been acquired. // `is_w`=1 for writer lock, `is_w`=0 for reader lock. #define ABSL_ANNOTATE_RWLOCK_ACQUIRED(lock, is_w) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockAcquired) \ (__FILE__, __LINE__, lock, is_w) // Report that the lock at address `lock` is about to be released. // `is_w`=1 for writer lock, `is_w`=0 for reader lock. #define ABSL_ANNOTATE_RWLOCK_RELEASED(lock, is_w) \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateRWLockReleased) \ (__FILE__, __LINE__, lock, is_w) // Apply ABSL_ANNOTATE_BENIGN_RACE_SIZED to a static variable `static_var`. #define ABSL_ANNOTATE_BENIGN_RACE_STATIC(static_var, description) \ namespace { \ class static_var##_annotator { \ public: \ static_var##_annotator() { \ ABSL_ANNOTATE_BENIGN_RACE_SIZED(&static_var, sizeof(static_var), \ #static_var ": " description); \ } \ }; \ static static_var##_annotator the##static_var##_annotator; \ } // namespace // Function prototypes of annotations provided by the compiler-based sanitizer // implementation. ABSL_INTERNAL_BEGIN_EXTERN_C void AnnotateRWLockCreate(const char* file, int line, const volatile void* lock); void AnnotateRWLockCreateStatic(const char* file, int line, const volatile void* lock); void AnnotateRWLockDestroy(const char* file, int line, const volatile void* lock); void AnnotateRWLockAcquired(const char* file, int line, const volatile void* lock, long is_w); // NOLINT void AnnotateRWLockReleased(const char* file, int line, const volatile void* lock, long is_w); // NOLINT void AnnotateBenignRace(const char* file, int line, const volatile void* address, const char* description); void AnnotateBenignRaceSized(const char* file, int line, const volatile void* address, size_t size, const char* description); void AnnotateThreadName(const char* file, int line, const char* name); void AnnotateEnableRaceDetection(const char* file, int line, int enable); ABSL_INTERNAL_END_EXTERN_C #else // ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED == 0 #define ABSL_ANNOTATE_RWLOCK_CREATE(lock) // empty #define ABSL_ANNOTATE_RWLOCK_CREATE_STATIC(lock) // empty #define ABSL_ANNOTATE_RWLOCK_DESTROY(lock) // empty #define ABSL_ANNOTATE_RWLOCK_ACQUIRED(lock, is_w) // empty #define ABSL_ANNOTATE_RWLOCK_RELEASED(lock, is_w) // empty #define ABSL_ANNOTATE_BENIGN_RACE(address, description) // empty #define ABSL_ANNOTATE_BENIGN_RACE_SIZED(address, size, description) // empty #define ABSL_ANNOTATE_THREAD_NAME(name) // empty #define ABSL_ANNOTATE_ENABLE_RACE_DETECTION(enable) // empty #define ABSL_ANNOTATE_BENIGN_RACE_STATIC(static_var, description) // empty #endif // ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED // ------------------------------------------------------------------------- // Define memory annotations. #ifdef ABSL_HAVE_MEMORY_SANITIZER #include #define ABSL_ANNOTATE_MEMORY_IS_INITIALIZED(address, size) \ __msan_unpoison(address, size) #define ABSL_ANNOTATE_MEMORY_IS_UNINITIALIZED(address, size) \ __msan_allocated_memory(address, size) #else // !defined(ABSL_HAVE_MEMORY_SANITIZER) #define ABSL_ANNOTATE_MEMORY_IS_INITIALIZED(address, size) // empty #define ABSL_ANNOTATE_MEMORY_IS_UNINITIALIZED(address, size) // empty #endif // ABSL_HAVE_MEMORY_SANITIZER // ------------------------------------------------------------------------- // Define IGNORE_READS_BEGIN/_END attributes. #if defined(ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED) #define ABSL_INTERNAL_IGNORE_READS_BEGIN_ATTRIBUTE \ __attribute((exclusive_lock_function("*"))) #define ABSL_INTERNAL_IGNORE_READS_END_ATTRIBUTE \ __attribute((unlock_function("*"))) #else // !defined(ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED) #define ABSL_INTERNAL_IGNORE_READS_BEGIN_ATTRIBUTE // empty #define ABSL_INTERNAL_IGNORE_READS_END_ATTRIBUTE // empty #endif // defined(ABSL_INTERNAL_IGNORE_READS_ATTRIBUTE_ENABLED) // ------------------------------------------------------------------------- // Define IGNORE_READS_BEGIN/_END annotations. #if ABSL_INTERNAL_READS_ANNOTATIONS_ENABLED == 1 // Some of the symbols used in this section (e.g. AnnotateIgnoreReadsBegin) are // defined by the compiler-based implementation, not by the Abseil // library. Therefore they do not use ABSL_INTERNAL_C_SYMBOL. // Request the analysis tool to ignore all reads in the current thread until // ABSL_ANNOTATE_IGNORE_READS_END is called. Useful to ignore intentional racey // reads, while still checking other reads and all writes. // See also ABSL_ANNOTATE_UNPROTECTED_READ. #define ABSL_ANNOTATE_IGNORE_READS_BEGIN() \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateIgnoreReadsBegin) \ (__FILE__, __LINE__) // Stop ignoring reads. #define ABSL_ANNOTATE_IGNORE_READS_END() \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateIgnoreReadsEnd) \ (__FILE__, __LINE__) // Function prototypes of annotations provided by the compiler-based sanitizer // implementation. ABSL_INTERNAL_BEGIN_EXTERN_C void AnnotateIgnoreReadsBegin(const char* file, int line) ABSL_INTERNAL_IGNORE_READS_BEGIN_ATTRIBUTE; void AnnotateIgnoreReadsEnd(const char* file, int line) ABSL_INTERNAL_IGNORE_READS_END_ATTRIBUTE; ABSL_INTERNAL_END_EXTERN_C #elif defined(ABSL_INTERNAL_ANNOTALYSIS_ENABLED) // When Annotalysis is enabled without Dynamic Annotations, the use of // static-inline functions allows the annotations to be read at compile-time, // while still letting the compiler elide the functions from the final build. // // TODO(delesley) -- The exclusive lock here ignores writes as well, but // allows IGNORE_READS_AND_WRITES to work properly. #define ABSL_ANNOTATE_IGNORE_READS_BEGIN() \ ABSL_INTERNAL_GLOBAL_SCOPED( \ ABSL_INTERNAL_C_SYMBOL(AbslInternalAnnotateIgnoreReadsBegin)) \ () #define ABSL_ANNOTATE_IGNORE_READS_END() \ ABSL_INTERNAL_GLOBAL_SCOPED( \ ABSL_INTERNAL_C_SYMBOL(AbslInternalAnnotateIgnoreReadsEnd)) \ () ABSL_INTERNAL_STATIC_INLINE void ABSL_INTERNAL_C_SYMBOL( AbslInternalAnnotateIgnoreReadsBegin)() ABSL_INTERNAL_IGNORE_READS_BEGIN_ATTRIBUTE {} ABSL_INTERNAL_STATIC_INLINE void ABSL_INTERNAL_C_SYMBOL( AbslInternalAnnotateIgnoreReadsEnd)() ABSL_INTERNAL_IGNORE_READS_END_ATTRIBUTE {} #else #define ABSL_ANNOTATE_IGNORE_READS_BEGIN() // empty #define ABSL_ANNOTATE_IGNORE_READS_END() // empty #endif // ------------------------------------------------------------------------- // Define IGNORE_WRITES_BEGIN/_END annotations. #if ABSL_INTERNAL_WRITES_ANNOTATIONS_ENABLED == 1 // Similar to ABSL_ANNOTATE_IGNORE_READS_BEGIN, but ignore writes instead. #define ABSL_ANNOTATE_IGNORE_WRITES_BEGIN() \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateIgnoreWritesBegin)(__FILE__, __LINE__) // Stop ignoring writes. #define ABSL_ANNOTATE_IGNORE_WRITES_END() \ ABSL_INTERNAL_GLOBAL_SCOPED(AnnotateIgnoreWritesEnd)(__FILE__, __LINE__) // Function prototypes of annotations provided by the compiler-based sanitizer // implementation. ABSL_INTERNAL_BEGIN_EXTERN_C void AnnotateIgnoreWritesBegin(const char* file, int line); void AnnotateIgnoreWritesEnd(const char* file, int line); ABSL_INTERNAL_END_EXTERN_C #else #define ABSL_ANNOTATE_IGNORE_WRITES_BEGIN() // empty #define ABSL_ANNOTATE_IGNORE_WRITES_END() // empty #endif // ------------------------------------------------------------------------- // Define the ABSL_ANNOTATE_IGNORE_READS_AND_WRITES_* annotations using the more // primitive annotations defined above. // // Instead of doing // ABSL_ANNOTATE_IGNORE_READS_BEGIN(); // ... = x; // ABSL_ANNOTATE_IGNORE_READS_END(); // one can use // ... = ABSL_ANNOTATE_UNPROTECTED_READ(x); #if defined(ABSL_INTERNAL_READS_WRITES_ANNOTATIONS_ENABLED) // Start ignoring all memory accesses (both reads and writes). #define ABSL_ANNOTATE_IGNORE_READS_AND_WRITES_BEGIN() \ do { \ ABSL_ANNOTATE_IGNORE_READS_BEGIN(); \ ABSL_ANNOTATE_IGNORE_WRITES_BEGIN(); \ } while (0) // Stop ignoring both reads and writes. #define ABSL_ANNOTATE_IGNORE_READS_AND_WRITES_END() \ do { \ ABSL_ANNOTATE_IGNORE_WRITES_END(); \ ABSL_ANNOTATE_IGNORE_READS_END(); \ } while (0) #ifdef __cplusplus // ABSL_ANNOTATE_UNPROTECTED_READ is the preferred way to annotate racey reads. #define ABSL_ANNOTATE_UNPROTECTED_READ(x) \ absl::base_internal::AnnotateUnprotectedRead(x) namespace absl { ABSL_NAMESPACE_BEGIN namespace base_internal { template inline T AnnotateUnprotectedRead(const volatile T& x) { // NOLINT ABSL_ANNOTATE_IGNORE_READS_BEGIN(); T res = x; ABSL_ANNOTATE_IGNORE_READS_END(); return res; } } // namespace base_internal ABSL_NAMESPACE_END } // namespace absl #endif #else #define ABSL_ANNOTATE_IGNORE_READS_AND_WRITES_BEGIN() // empty #define ABSL_ANNOTATE_IGNORE_READS_AND_WRITES_END() // empty #define ABSL_ANNOTATE_UNPROTECTED_READ(x) (x) #endif // ------------------------------------------------------------------------- // Address sanitizer annotations #ifdef ABSL_HAVE_ADDRESS_SANITIZER // Describe the current state of a contiguous container such as e.g. // std::vector or std::string. For more details see // sanitizer/common_interface_defs.h, which is provided by the compiler. #include #define ABSL_ANNOTATE_CONTIGUOUS_CONTAINER(beg, end, old_mid, new_mid) \ __sanitizer_annotate_contiguous_container(beg, end, old_mid, new_mid) #define ABSL_ADDRESS_SANITIZER_REDZONE(name) \ struct { \ alignas(8) char x[8]; \ } name #else #define ABSL_ANNOTATE_CONTIGUOUS_CONTAINER(beg, end, old_mid, new_mid) // empty #define ABSL_ADDRESS_SANITIZER_REDZONE(name) static_assert(true, "") #endif // ABSL_HAVE_ADDRESS_SANITIZER // ------------------------------------------------------------------------- // HWAddress sanitizer annotations #ifdef __cplusplus namespace absl { #ifdef ABSL_HAVE_HWADDRESS_SANITIZER // Under HWASAN changes the tag of the pointer. template T* HwasanTagPointer(T* ptr, uintptr_t tag) { return reinterpret_cast(__hwasan_tag_pointer(ptr, tag)); } #else template T* HwasanTagPointer(T* ptr, uintptr_t) { return ptr; } #endif } // namespace absl #endif // ------------------------------------------------------------------------- // Undefine the macros intended only for this file. #undef ABSL_INTERNAL_RACE_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_READS_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_WRITES_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_ANNOTALYSIS_ENABLED #undef ABSL_INTERNAL_READS_WRITES_ANNOTATIONS_ENABLED #undef ABSL_INTERNAL_BEGIN_EXTERN_C #undef ABSL_INTERNAL_END_EXTERN_C #undef ABSL_INTERNAL_STATIC_INLINE #endif // ABSL_BASE_DYNAMIC_ANNOTATIONS_H_ *g {soong/.intermediates/external/abseil-cpp/absl_strings_cordz_info_hdrs/gen/my_include_dir/absl/strings/internal/cordz_info.hf// Copyright 2019 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_CORDZ_INFO_H_ #define ABSL_STRINGS_INTERNAL_CORDZ_INFO_H_ #include #include #include #include "absl/base/config.h" #include "absl/base/internal/raw_logging.h" #include "absl/base/internal/spinlock.h" #include "absl/base/thread_annotations.h" #include "absl/strings/internal/cord_internal.h" #include "absl/strings/internal/cordz_functions.h" #include "absl/strings/internal/cordz_handle.h" #include "absl/strings/internal/cordz_statistics.h" #include "absl/strings/internal/cordz_update_tracker.h" #include "absl/synchronization/mutex.h" #include "absl/types/span.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace cord_internal { // CordzInfo tracks a profiled Cord. Each of these objects can be in two places. // If a Cord is alive, the CordzInfo will be in the global_cordz_infos map, and // can also be retrieved via the linked list starting with // global_cordz_infos_head and continued via the cordz_info_next() method. When // a Cord has reached the end of its lifespan, the CordzInfo object will be // migrated out of the global_cordz_infos list and the global_cordz_infos_map, // and will either be deleted or appended to the global_delete_queue. If it is // placed on the global_delete_queue, the CordzInfo object will be cleaned in // the destructor of a CordzSampleToken object. class ABSL_LOCKABLE CordzInfo : public CordzHandle { public: using MethodIdentifier = CordzUpdateTracker::MethodIdentifier; // TrackCord creates a CordzInfo instance which tracks important metrics of // a sampled cord, and stores the created CordzInfo instance into `cord'. All // CordzInfo instances are placed in a global list which is used to discover // and snapshot all actively tracked cords. Callers are responsible for // calling UntrackCord() before the tracked Cord instance is deleted, or to // stop tracking the sampled Cord. Callers are also responsible for guarding // changes to the 'tree' value of a Cord (InlineData.tree) through the Lock() // and Unlock() calls. Any change resulting in a new tree value for the cord // requires a call to SetCordRep() before the old tree has been unreffed // and/or deleted. `method` identifies the Cord public API method initiating // the cord to be sampled. // Requires `cord` to hold a tree, and `cord.cordz_info()` to be null. static void TrackCord(InlineData& cord, MethodIdentifier method, int64_t sampling_stride); // Identical to TrackCord(), except that this function fills the // `parent_stack` and `parent_method` properties of the returned CordzInfo // instance from the provided `src` instance if `src` is sampled. // This function should be used for sampling 'copy constructed' and 'copy // assigned' cords. This function allows 'cord` to be already sampled, in // which case the CordzInfo will be newly created from `src`. static void TrackCord(InlineData& cord, const InlineData& src, MethodIdentifier method); // Maybe sample the cord identified by 'cord' for method 'method'. // Uses `cordz_should_profile` to randomly pick cords to be sampled, and if // so, invokes `TrackCord` to start sampling `cord`. static void MaybeTrackCord(InlineData& cord, MethodIdentifier method); // Maybe sample the cord identified by 'cord' for method 'method'. // `src` identifies a 'parent' cord which is assigned to `cord`, typically the // input cord for a copy constructor, or an assign method such as `operator=` // `cord` will be sampled if (and only if) `src` is sampled. // If `cord` is currently being sampled and `src` is not being sampled, then // this function will stop sampling the cord and reset the cord's cordz_info. // // Previously this function defined that `cord` will be sampled if either // `src` is sampled, or if `cord` is randomly picked for sampling. However, // this can cause issues, as there may be paths where some cord is assigned an // indirect copy of it's own value. As such a 'string of copies' would then // remain sampled (`src.is_profiled`), then assigning such a cord back to // 'itself' creates a cycle where the cord will converge to 'always sampled`. // // For example: // // Cord x; // for (...) { // // Copy ctor --> y.is_profiled := x.is_profiled | random(...) // Cord y = x; // ... // // Assign x = y --> x.is_profiled = y.is_profiled | random(...) // // ==> x.is_profiled |= random(...) // // ==> x converges to 'always profiled' // x = y; // } static void MaybeTrackCord(InlineData& cord, const InlineData& src, MethodIdentifier method); // Stops tracking changes for a sampled cord, and deletes the provided info. // This function must be called before the sampled cord instance is deleted, // and before the root cordrep of the sampled cord is unreffed. // This function may extend the lifetime of the cordrep in cases where the // CordInfo instance is being held by a concurrent collection thread. void Untrack(); // Invokes UntrackCord() on `info` if `info` is not null. static void MaybeUntrackCord(CordzInfo* info); CordzInfo() = delete; CordzInfo(const CordzInfo&) = delete; CordzInfo& operator=(const CordzInfo&) = delete; // Retrieves the oldest existing CordzInfo. static CordzInfo* Head(const CordzSnapshot& snapshot) ABSL_NO_THREAD_SAFETY_ANALYSIS; // Retrieves the next oldest existing CordzInfo older than 'this' instance. CordzInfo* Next(const CordzSnapshot& snapshot) const ABSL_NO_THREAD_SAFETY_ANALYSIS; // Locks this instance for the update identified by `method`. // Increases the count for `method` in `update_tracker`. void Lock(MethodIdentifier method) ABSL_EXCLUSIVE_LOCK_FUNCTION(mutex_); // Unlocks this instance. If the contained `rep` has been set to null // indicating the Cord has been cleared or is otherwise no longer sampled, // then this method will delete this CordzInfo instance. void Unlock() ABSL_UNLOCK_FUNCTION(mutex_); // Asserts that this CordzInfo instance is locked. void AssertHeld() ABSL_ASSERT_EXCLUSIVE_LOCK(mutex_); // Updates the `rep` property of this instance. This methods is invoked by // Cord logic each time the root node of a sampled Cord changes, and before // the old root reference count is deleted. This guarantees that collection // code can always safely take a reference on the tracked cord. // Requires a lock to be held through the `Lock()` method. // TODO(b/117940323): annotate with ABSL_EXCLUSIVE_LOCKS_REQUIRED once all // Cord code is in a state where this can be proven true by the compiler. void SetCordRep(CordRep* rep); // Returns the current `rep` property of this instance with a reference // added, or null if this instance represents a cord that has since been // deleted or untracked. CordRep* RefCordRep() const ABSL_LOCKS_EXCLUDED(mutex_); // Returns the current value of `rep_` for testing purposes only. CordRep* GetCordRepForTesting() const ABSL_NO_THREAD_SAFETY_ANALYSIS { return rep_; } // Sets the current value of `rep_` for testing purposes only. void SetCordRepForTesting(CordRep* rep) ABSL_NO_THREAD_SAFETY_ANALYSIS { rep_ = rep; } // Returns the stack trace for where the cord was first sampled. Cords are // potentially sampled when they promote from an inlined cord to a tree or // ring representation, which is not necessarily the location where the cord // was first created. Some cords are created as inlined cords, and only as // data is added do they become a non-inlined cord. However, typically the // location represents reasonably well where the cord is 'created'. absl::Span GetStack() const; // Returns the stack trace for a sampled cord's 'parent stack trace'. This // value may be set if the cord is sampled (promoted) after being created // from, or being assigned the value of an existing (sampled) cord. absl::Span GetParentStack() const; // Retrieves the CordzStatistics associated with this Cord. The statistics // are only updated when a Cord goes through a mutation, such as an Append // or RemovePrefix. CordzStatistics GetCordzStatistics() const; int64_t sampling_stride() const { return sampling_stride_; } private: using SpinLock = absl::base_internal::SpinLock; using SpinLockHolder = ::absl::base_internal::SpinLockHolder; // Global cordz info list. CordzInfo stores a pointer to the global list // instance to harden against ODR violations. struct List { constexpr explicit List(absl::ConstInitType) : mutex(absl::kConstInit, absl::base_internal::SCHEDULE_COOPERATIVE_AND_KERNEL) {} SpinLock mutex; std::atomic head ABSL_GUARDED_BY(mutex){nullptr}; }; static constexpr size_t kMaxStackDepth = 64; explicit CordzInfo(CordRep* rep, const CordzInfo* src, MethodIdentifier method, int64_t weight); ~CordzInfo() override; // Sets `rep_` without holding a lock. void UnsafeSetCordRep(CordRep* rep) ABSL_NO_THREAD_SAFETY_ANALYSIS; void Track(); // Returns the parent method from `src`, which is either `parent_method_` or // `method_` depending on `parent_method_` being kUnknown. // Returns kUnknown if `src` is null. static MethodIdentifier GetParentMethod(const CordzInfo* src); // Fills the provided stack from `src`, copying either `parent_stack_` or // `stack_` depending on `parent_stack_` being empty, returning the size of // the parent stack. // Returns 0 if `src` is null. static size_t FillParentStack(const CordzInfo* src, void** stack); void ODRCheck() const { #ifndef NDEBUG ABSL_RAW_CHECK(list_ == &global_list_, "ODR violation in Cord"); #endif } // Non-inlined implementation of `MaybeTrackCord`, which is executed if // either `src` is sampled or `cord` is sampled, and either untracks or // tracks `cord` as documented per `MaybeTrackCord`. static void MaybeTrackCordImpl(InlineData& cord, const InlineData& src, MethodIdentifier method); ABSL_CONST_INIT static List global_list_; List* const list_ = &global_list_; // ci_prev_ and ci_next_ require the global list mutex to be held. // Unfortunately we can't use thread annotations such that the thread safety // analysis understands that list_ and global_list_ are one and the same. std::atomic ci_prev_{nullptr}; std::atomic ci_next_{nullptr}; mutable absl::Mutex mutex_; CordRep* rep_ ABSL_GUARDED_BY(mutex_); void* stack_[kMaxStackDepth]; void* parent_stack_[kMaxStackDepth]; const size_t stack_depth_; const size_t parent_stack_depth_; const MethodIdentifier method_; const MethodIdentifier parent_method_; CordzUpdateTracker update_tracker_; const absl::Time create_time_; const int64_t sampling_stride_; }; inline ABSL_ATTRIBUTE_ALWAYS_INLINE void CordzInfo::MaybeTrackCord( InlineData& cord, MethodIdentifier method) { auto stride = cordz_should_profile(); if (ABSL_PREDICT_FALSE(stride > 0)) { TrackCord(cord, method, stride); } } inline ABSL_ATTRIBUTE_ALWAYS_INLINE void CordzInfo::MaybeTrackCord( InlineData& cord, const InlineData& src, MethodIdentifier method) { if (ABSL_PREDICT_FALSE(InlineData::is_either_profiled(cord, src))) { MaybeTrackCordImpl(cord, src, method); } } inline ABSL_ATTRIBUTE_ALWAYS_INLINE void CordzInfo::MaybeUntrackCord( CordzInfo* info) { if (ABSL_PREDICT_FALSE(info)) { info->Untrack(); } } inline void CordzInfo::AssertHeld() ABSL_ASSERT_EXCLUSIVE_LOCK(mutex_) { #ifndef NDEBUG mutex_.AssertHeld(); #endif } inline void CordzInfo::SetCordRep(CordRep* rep) { AssertHeld(); rep_ = rep; } inline void CordzInfo::UnsafeSetCordRep(CordRep* rep) { rep_ = rep; } // Android local modification: locally silence an incorrect warning that // causes build failures in code that uses -Werror. #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wthread-safety-negative" inline CordRep* CordzInfo::RefCordRep() const ABSL_LOCKS_EXCLUDED(mutex_) { MutexLock lock(&mutex_); return rep_ ? CordRep::Ref(rep_) : nullptr; } #pragma clang diagnostic pop } // namespace cord_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_CORDZ_INFO_H_ *D soong/.intermediates/external/abseil-cpp/absl_strings_cord_internal_hdrs/gen/my_include_dir/absl/strings/internal/cord_rep_btree_reader.hC// Copyright 2021 The Abseil Authors // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_CORD_REP_BTREE_READER_H_ #define ABSL_STRINGS_INTERNAL_CORD_REP_BTREE_READER_H_ #include #include "absl/base/config.h" #include "absl/strings/internal/cord_data_edge.h" #include "absl/strings/internal/cord_internal.h" #include "absl/strings/internal/cord_rep_btree.h" #include "absl/strings/internal/cord_rep_btree_navigator.h" #include "absl/strings/internal/cord_rep_flat.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace cord_internal { // CordRepBtreeReader implements logic to iterate over cord btrees. // References to the underlying data are returned as absl::string_view values. // The most typical use case is a forward only iteration over tree data. // The class also provides `Skip()`, `Seek()` and `Read()` methods similar to // CordRepBtreeNavigator that allow more advanced navigation. // // Example: iterate over all data inside a cord btree: // // CordRepBtreeReader reader; // for (string_view sv = reader.Init(tree); !sv.Empty(); sv = sv.Next()) { // DoSomethingWithDataIn(sv); // } // // All navigation methods always return the next 'chunk' of data. The class // assumes that all data is directly 'consumed' by the caller. For example: // invoking `Skip()` will skip the desired number of bytes, and directly // read and return the next chunk of data directly after the skipped bytes. // // Example: iterate over all data inside a btree skipping the first 100 bytes: // // CordRepBtreeReader reader; // absl::string_view sv = reader.Init(tree); // if (sv.length() > 100) { // sv.RemovePrefix(100); // } else { // sv = reader.Skip(100 - sv.length()); // } // while (!sv.empty()) { // DoSomethingWithDataIn(sv); // absl::string_view sv = reader.Next(); // } // // It is important to notice that `remaining` is based on the end position of // the last data edge returned to the caller, not the cumulative data returned // to the caller which can be less in cases of skipping or seeking over data. // // For example, consider a cord btree with five data edges: "abc", "def", "ghi", // "jkl" and "mno": // // absl::string_view sv; // CordRepBtreeReader reader; // // sv = reader.Init(tree); // sv = "abc", remaining = 12 // sv = reader.Skip(4); // sv = "hi", remaining = 6 // sv = reader.Skip(2); // sv = "l", remaining = 3 // sv = reader.Next(); // sv = "mno", remaining = 0 // sv = reader.Seek(1); // sv = "bc", remaining = 12 // class CordRepBtreeReader { public: using ReadResult = CordRepBtreeNavigator::ReadResult; using Position = CordRepBtreeNavigator::Position; // Returns true if this instance is not empty. explicit operator bool() const { return navigator_.btree() != nullptr; } // Returns the tree referenced by this instance or nullptr if empty. CordRepBtree* btree() const { return navigator_.btree(); } // Returns the current data edge inside the referenced btree. // Requires that the current instance is not empty. CordRep* node() const { return navigator_.Current(); } // Returns the length of the referenced tree. // Requires that the current instance is not empty. size_t length() const; // Returns the number of remaining bytes available for iteration, which is the // number of bytes directly following the end of the last chunk returned. // This value will be zero if we iterated over the last edge in the bound // tree, in which case any call to Next() or Skip() will return an empty // string_view reflecting the EOF state. // Note that a call to `Seek()` resets `remaining` to a value based on the // end position of the chunk returned by that call. size_t remaining() const { return remaining_; } // Resets this instance to an empty value. void Reset() { navigator_.Reset(); } // Initializes this instance with `tree`. `tree` must not be null. // Returns a reference to the first data edge of the provided tree. absl::string_view Init(CordRepBtree* tree); // Navigates to and returns the next data edge of the referenced tree. // Returns an empty string_view if an attempt is made to read beyond the end // of the tree, i.e.: if `remaining()` is zero indicating an EOF condition. // Requires that the current instance is not empty. absl::string_view Next(); // Skips the provided amount of bytes and returns a reference to the data // directly following the skipped bytes. absl::string_view Skip(size_t skip); // Reads `n` bytes into `tree`. // If `chunk_size` is zero, starts reading at the next data edge. If // `chunk_size` is non zero, the read starts at the last `chunk_size` bytes of // the last returned data edge. Effectively, this means that the read starts // at offset `consumed() - chunk_size`. // Requires that `chunk_size` is less than or equal to the length of the // last returned data edge. The purpose of `chunk_size` is to simplify code // partially consuming a returned chunk and wanting to include the remaining // bytes in the Read call. For example, the below code will read 1000 bytes of // data into a cord tree if the first chunk starts with "big:": // // CordRepBtreeReader reader; // absl::string_view sv = reader.Init(tree); // if (absl::StartsWith(sv, "big:")) { // CordRepBtree tree; // sv = reader.Read(1000, sv.size() - 4 /* "big:" */, &tree); // } // // This method will return an empty string view if all remaining data was // read. If `n` exceeded the amount of remaining data this function will // return an empty string view and `tree` will be set to nullptr. // In both cases, `consumed` will be set to `length`. absl::string_view Read(size_t n, size_t chunk_size, CordRep*& tree); // Navigates to the chunk at offset `offset`. // Returns a reference into the navigated to chunk, adjusted for the relative // position of `offset` into that chunk. For example, calling `Seek(13)` on a // cord tree containing 2 chunks of 10 and 20 bytes respectively will return // a string view into the second chunk starting at offset 3 with a size of 17. // Returns an empty string view if `offset` is equal to or greater than the // length of the referenced tree. absl::string_view Seek(size_t offset); private: size_t remaining_ = 0; CordRepBtreeNavigator navigator_; }; inline size_t CordRepBtreeReader::length() const { assert(btree() != nullptr); return btree()->length; } inline absl::string_view CordRepBtreeReader::Init(CordRepBtree* tree) { assert(tree != nullptr); const CordRep* edge = navigator_.InitFirst(tree); remaining_ = tree->length - edge->length; return EdgeData(edge); } inline absl::string_view CordRepBtreeReader::Next() { if (remaining_ == 0) return {}; const CordRep* edge = navigator_.Next(); assert(edge != nullptr); remaining_ -= edge->length; return EdgeData(edge); } inline absl::string_view CordRepBtreeReader::Skip(size_t skip) { // As we are always positioned on the last 'consumed' edge, we // need to skip the current edge as well as `skip`. const size_t edge_length = navigator_.Current()->length; CordRepBtreeNavigator::Position pos = navigator_.Skip(skip + edge_length); if (ABSL_PREDICT_FALSE(pos.edge == nullptr)) { remaining_ = 0; return {}; } // The combined length of all edges skipped before `pos.edge` is `skip - // pos.offset`, all of which are 'consumed', as well as the current edge. remaining_ -= skip - pos.offset + pos.edge->length; return EdgeData(pos.edge).substr(pos.offset); } inline absl::string_view CordRepBtreeReader::Seek(size_t offset) { const CordRepBtreeNavigator::Position pos = navigator_.Seek(offset); if (ABSL_PREDICT_FALSE(pos.edge == nullptr)) { remaining_ = 0; return {}; } absl::string_view chunk = EdgeData(pos.edge).substr(pos.offset); remaining_ = length() - offset - chunk.length(); return chunk; } } // namespace cord_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_CORD_REP_BTREE_READER_H_ *; wsoong/.intermediates/external/abseil-cpp/absl_base_atomic_hook_hdrs/gen/my_include_dir/absl/base/internal/atomic_hook.h:// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_BASE_INTERNAL_ATOMIC_HOOK_H_ #define ABSL_BASE_INTERNAL_ATOMIC_HOOK_H_ #include #include #include #include #include "absl/base/attributes.h" #include "absl/base/config.h" #if defined(_MSC_VER) && !defined(__clang__) #define ABSL_HAVE_WORKING_CONSTEXPR_STATIC_INIT 0 #else #define ABSL_HAVE_WORKING_CONSTEXPR_STATIC_INIT 1 #endif #if defined(_MSC_VER) #define ABSL_HAVE_WORKING_ATOMIC_POINTER 0 #else #define ABSL_HAVE_WORKING_ATOMIC_POINTER 1 #endif namespace absl { ABSL_NAMESPACE_BEGIN namespace base_internal { template class AtomicHook; // To workaround AtomicHook not being constant-initializable on some platforms, // prefer to annotate instances with `ABSL_INTERNAL_ATOMIC_HOOK_ATTRIBUTES` // instead of `ABSL_CONST_INIT`. #if ABSL_HAVE_WORKING_CONSTEXPR_STATIC_INIT #define ABSL_INTERNAL_ATOMIC_HOOK_ATTRIBUTES ABSL_CONST_INIT #else #define ABSL_INTERNAL_ATOMIC_HOOK_ATTRIBUTES #endif // `AtomicHook` is a helper class, templatized on a raw function pointer type, // for implementing Abseil customization hooks. It is a callable object that // dispatches to the registered hook. Objects of type `AtomicHook` must have // static or thread storage duration. // // A default constructed object performs a no-op (and returns a default // constructed object) if no hook has been registered. // // Hooks can be pre-registered via constant initialization, for example: // // ABSL_INTERNAL_ATOMIC_HOOK_ATTRIBUTES static AtomicHook // my_hook(DefaultAction); // // and then changed at runtime via a call to `Store()`. // // Reads and writes guarantee memory_order_acquire/memory_order_release // semantics. template class AtomicHook { public: using FnPtr = ReturnType (*)(Args...); // Constructs an object that by default performs a no-op (and // returns a default constructed object) when no hook as been registered. constexpr AtomicHook() : AtomicHook(DummyFunction) {} // Constructs an object that by default dispatches to/returns the // pre-registered default_fn when no hook has been registered at runtime. #if ABSL_HAVE_WORKING_ATOMIC_POINTER && ABSL_HAVE_WORKING_CONSTEXPR_STATIC_INIT explicit constexpr AtomicHook(FnPtr default_fn) : hook_(default_fn), default_fn_(default_fn) {} #elif ABSL_HAVE_WORKING_CONSTEXPR_STATIC_INIT explicit constexpr AtomicHook(FnPtr default_fn) : hook_(kUninitialized), default_fn_(default_fn) {} #else // As of January 2020, on all known versions of MSVC this constructor runs in // the global constructor sequence. If `Store()` is called by a dynamic // initializer, we want to preserve the value, even if this constructor runs // after the call to `Store()`. If not, `hook_` will be // zero-initialized by the linker and we have no need to set it. // https://developercommunity.visualstudio.com/content/problem/336946/class-with-constexpr-constructor-not-using-static.html explicit constexpr AtomicHook(FnPtr default_fn) : /* hook_(deliberately omitted), */ default_fn_(default_fn) { static_assert(kUninitialized == 0, "here we rely on zero-initialization"); } #endif // Stores the provided function pointer as the value for this hook. // // This is intended to be called once. Multiple calls are legal only if the // same function pointer is provided for each call. The store is implemented // as a memory_order_release operation, and read accesses are implemented as // memory_order_acquire. void Store(FnPtr fn) { bool success = DoStore(fn); static_cast(success); assert(success); } // Invokes the registered callback. If no callback has yet been registered, a // default-constructed object of the appropriate type is returned instead. template ReturnType operator()(CallArgs&&... args) const { return DoLoad()(std::forward(args)...); } // Returns the registered callback, or nullptr if none has been registered. // Useful if client code needs to conditionalize behavior based on whether a // callback was registered. // // Note that atomic_hook.Load()() and atomic_hook() have different semantics: // operator()() will perform a no-op if no callback was registered, while // Load()() will dereference a null function pointer. Prefer operator()() to // Load()() unless you must conditionalize behavior on whether a hook was // registered. FnPtr Load() const { FnPtr ptr = DoLoad(); return (ptr == DummyFunction) ? nullptr : ptr; } private: static ReturnType DummyFunction(Args...) { return ReturnType(); } // Current versions of MSVC (as of September 2017) have a broken // implementation of std::atomic: Its constructor attempts to do the // equivalent of a reinterpret_cast in a constexpr context, which is not // allowed. // // This causes an issue when building with LLVM under Windows. To avoid this, // we use a less-efficient, intptr_t-based implementation on Windows. #if ABSL_HAVE_WORKING_ATOMIC_POINTER // Return the stored value, or DummyFunction if no value has been stored. FnPtr DoLoad() const { return hook_.load(std::memory_order_acquire); } // Store the given value. Returns false if a different value was already // stored to this object. bool DoStore(FnPtr fn) { assert(fn); FnPtr expected = default_fn_; const bool store_succeeded = hook_.compare_exchange_strong( expected, fn, std::memory_order_acq_rel, std::memory_order_acquire); const bool same_value_already_stored = (expected == fn); return store_succeeded || same_value_already_stored; } std::atomic hook_; #else // !ABSL_HAVE_WORKING_ATOMIC_POINTER // Use a sentinel value unlikely to be the address of an actual function. static constexpr intptr_t kUninitialized = 0; static_assert(sizeof(intptr_t) >= sizeof(FnPtr), "intptr_t can't contain a function pointer"); FnPtr DoLoad() const { const intptr_t value = hook_.load(std::memory_order_acquire); if (value == kUninitialized) { return default_fn_; } return reinterpret_cast(value); } bool DoStore(FnPtr fn) { assert(fn); const auto value = reinterpret_cast(fn); intptr_t expected = kUninitialized; const bool store_succeeded = hook_.compare_exchange_strong( expected, value, std::memory_order_acq_rel, std::memory_order_acquire); const bool same_value_already_stored = (expected == value); return store_succeeded || same_value_already_stored; } std::atomic hook_; #endif const FnPtr default_fn_; }; #undef ABSL_HAVE_WORKING_ATOMIC_POINTER #undef ABSL_HAVE_WORKING_CONSTEXPR_STATIC_INIT } // namespace base_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_BASE_INTERNAL_ATOMIC_HOOK_H_ * soong/.intermediates/external/abseil-cpp/absl_container_container_memory_hdrs/gen/my_include_dir/absl/container/internal/container_memory.h// Copyright 2018 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_CONTAINER_INTERNAL_CONTAINER_MEMORY_H_ #define ABSL_CONTAINER_INTERNAL_CONTAINER_MEMORY_H_ #include #include #include #include #include #include #include #include #include #include "absl/base/config.h" #include "absl/memory/memory.h" #include "absl/meta/type_traits.h" #include "absl/utility/utility.h" #ifdef ABSL_HAVE_ADDRESS_SANITIZER #include #endif #ifdef ABSL_HAVE_MEMORY_SANITIZER #include #endif namespace absl { ABSL_NAMESPACE_BEGIN namespace container_internal { template struct alignas(Alignment) AlignedType {}; // Allocates at least n bytes aligned to the specified alignment. // Alignment must be a power of 2. It must be positive. // // Note that many allocators don't honor alignment requirements above certain // threshold (usually either alignof(std::max_align_t) or alignof(void*)). // Allocate() doesn't apply alignment corrections. If the underlying allocator // returns insufficiently alignment pointer, that's what you are going to get. template void* Allocate(Alloc* alloc, size_t n) { static_assert(Alignment > 0, ""); assert(n && "n must be positive"); using M = AlignedType; using A = typename absl::allocator_traits::template rebind_alloc; using AT = typename absl::allocator_traits::template rebind_traits; // On macOS, "mem_alloc" is a #define with one argument defined in // rpc/types.h, so we can't name the variable "mem_alloc" and initialize it // with the "foo(bar)" syntax. A my_mem_alloc(*alloc); void* p = AT::allocate(my_mem_alloc, (n + sizeof(M) - 1) / sizeof(M)); assert(reinterpret_cast(p) % Alignment == 0 && "allocator does not respect alignment"); return p; } // Returns true if the destruction of the value with given Allocator will be // trivial. template constexpr auto IsDestructionTrivial() { constexpr bool result = std::is_trivially_destructible::value && std::is_same::template rebind_alloc, std::allocator>::value; return std::integral_constant(); } // The pointer must have been previously obtained by calling // Allocate(alloc, n). template void Deallocate(Alloc* alloc, void* p, size_t n) { static_assert(Alignment > 0, ""); assert(n && "n must be positive"); using M = AlignedType; using A = typename absl::allocator_traits::template rebind_alloc; using AT = typename absl::allocator_traits::template rebind_traits; // On macOS, "mem_alloc" is a #define with one argument defined in // rpc/types.h, so we can't name the variable "mem_alloc" and initialize it // with the "foo(bar)" syntax. A my_mem_alloc(*alloc); AT::deallocate(my_mem_alloc, static_cast(p), (n + sizeof(M) - 1) / sizeof(M)); } namespace memory_internal { // Constructs T into uninitialized storage pointed by `ptr` using the args // specified in the tuple. template void ConstructFromTupleImpl(Alloc* alloc, T* ptr, Tuple&& t, absl::index_sequence) { absl::allocator_traits::construct( *alloc, ptr, std::get(std::forward(t))...); } template struct WithConstructedImplF { template decltype(std::declval()(std::declval())) operator()( Args&&... args) const { return std::forward(f)(T(std::forward(args)...)); } F&& f; }; template decltype(std::declval()(std::declval())) WithConstructedImpl( Tuple&& t, absl::index_sequence, F&& f) { return WithConstructedImplF{std::forward(f)}( std::get(std::forward(t))...); } template auto TupleRefImpl(T&& t, absl::index_sequence) -> decltype(std::forward_as_tuple(std::get(std::forward(t))...)) { return std::forward_as_tuple(std::get(std::forward(t))...); } // Returns a tuple of references to the elements of the input tuple. T must be a // tuple. template auto TupleRef(T&& t) -> decltype(TupleRefImpl( std::forward(t), absl::make_index_sequence< std::tuple_size::type>::value>())) { return TupleRefImpl( std::forward(t), absl::make_index_sequence< std::tuple_size::type>::value>()); } template decltype(std::declval()(std::declval(), std::piecewise_construct, std::declval>(), std::declval())) DecomposePairImpl(F&& f, std::pair, V> p) { const auto& key = std::get<0>(p.first); return std::forward(f)(key, std::piecewise_construct, std::move(p.first), std::move(p.second)); } } // namespace memory_internal // Constructs T into uninitialized storage pointed by `ptr` using the args // specified in the tuple. template void ConstructFromTuple(Alloc* alloc, T* ptr, Tuple&& t) { memory_internal::ConstructFromTupleImpl( alloc, ptr, std::forward(t), absl::make_index_sequence< std::tuple_size::type>::value>()); } // Constructs T using the args specified in the tuple and calls F with the // constructed value. template decltype(std::declval()(std::declval())) WithConstructed(Tuple&& t, F&& f) { return memory_internal::WithConstructedImpl( std::forward(t), absl::make_index_sequence< std::tuple_size::type>::value>(), std::forward(f)); } // Given arguments of an std::pair's constructor, PairArgs() returns a pair of // tuples with references to the passed arguments. The tuples contain // constructor arguments for the first and the second elements of the pair. // // The following two snippets are equivalent. // // 1. std::pair p(args...); // // 2. auto a = PairArgs(args...); // std::pair p(std::piecewise_construct, // std::move(a.first), std::move(a.second)); inline std::pair, std::tuple<>> PairArgs() { return {}; } template std::pair, std::tuple> PairArgs(F&& f, S&& s) { return {std::piecewise_construct, std::forward_as_tuple(std::forward(f)), std::forward_as_tuple(std::forward(s))}; } template std::pair, std::tuple> PairArgs( const std::pair& p) { return PairArgs(p.first, p.second); } template std::pair, std::tuple> PairArgs(std::pair&& p) { return PairArgs(std::forward(p.first), std::forward(p.second)); } template auto PairArgs(std::piecewise_construct_t, F&& f, S&& s) -> decltype(std::make_pair(memory_internal::TupleRef(std::forward(f)), memory_internal::TupleRef(std::forward(s)))) { return std::make_pair(memory_internal::TupleRef(std::forward(f)), memory_internal::TupleRef(std::forward(s))); } // A helper function for implementing apply() in map policies. template auto DecomposePair(F&& f, Args&&... args) -> decltype(memory_internal::DecomposePairImpl( std::forward(f), PairArgs(std::forward(args)...))) { return memory_internal::DecomposePairImpl( std::forward(f), PairArgs(std::forward(args)...)); } // A helper function for implementing apply() in set policies. template decltype(std::declval()(std::declval(), std::declval())) DecomposeValue(F&& f, Arg&& arg) { const auto& key = arg; return std::forward(f)(key, std::forward(arg)); } // Helper functions for asan and msan. inline void SanitizerPoisonMemoryRegion(const void* m, size_t s) { #ifdef ABSL_HAVE_ADDRESS_SANITIZER ASAN_POISON_MEMORY_REGION(m, s); #endif #ifdef ABSL_HAVE_MEMORY_SANITIZER __msan_poison(m, s); #endif (void)m; (void)s; } inline void SanitizerUnpoisonMemoryRegion(const void* m, size_t s) { #ifdef ABSL_HAVE_ADDRESS_SANITIZER ASAN_UNPOISON_MEMORY_REGION(m, s); #endif #ifdef ABSL_HAVE_MEMORY_SANITIZER __msan_unpoison(m, s); #endif (void)m; (void)s; } template inline void SanitizerPoisonObject(const T* object) { SanitizerPoisonMemoryRegion(object, sizeof(T)); } template inline void SanitizerUnpoisonObject(const T* object) { SanitizerUnpoisonMemoryRegion(object, sizeof(T)); } namespace memory_internal { // If Pair is a standard-layout type, OffsetOf::kFirst and // OffsetOf::kSecond are equivalent to offsetof(Pair, first) and // offsetof(Pair, second) respectively. Otherwise they are -1. // // The purpose of OffsetOf is to avoid calling offsetof() on non-standard-layout // type, which is non-portable. template struct OffsetOf { static constexpr size_t kFirst = static_cast(-1); static constexpr size_t kSecond = static_cast(-1); }; template struct OffsetOf::type> { static constexpr size_t kFirst = offsetof(Pair, first); static constexpr size_t kSecond = offsetof(Pair, second); }; template struct IsLayoutCompatible { private: struct Pair { K first; V second; }; // Is P layout-compatible with Pair? template static constexpr bool LayoutCompatible() { return std::is_standard_layout

() && sizeof(P) == sizeof(Pair) && alignof(P) == alignof(Pair) && memory_internal::OffsetOf

::kFirst == memory_internal::OffsetOf::kFirst && memory_internal::OffsetOf

::kSecond == memory_internal::OffsetOf::kSecond; } public: // Whether pair and pair are layout-compatible. If they are, // then it is safe to store them in a union and read from either. static constexpr bool value = std::is_standard_layout() && std::is_standard_layout() && memory_internal::OffsetOf::kFirst == 0 && LayoutCompatible>() && LayoutCompatible>(); }; } // namespace memory_internal // The internal storage type for key-value containers like flat_hash_map. // // It is convenient for the value_type of a flat_hash_map to be // pair; the "const K" prevents accidental modification of the key // when dealing with the reference returned from find() and similar methods. // However, this creates other problems; we want to be able to emplace(K, V) // efficiently with move operations, and similarly be able to move a // pair in insert(). // // The solution is this union, which aliases the const and non-const versions // of the pair. This also allows flat_hash_map to work, even though // that has the same efficiency issues with move in emplace() and insert() - // but people do it anyway. // // If kMutableKeys is false, only the value member can be accessed. // // If kMutableKeys is true, key can be accessed through all slots while value // and mutable_value must be accessed only via INITIALIZED slots. Slots are // created and destroyed via mutable_value so that the key can be moved later. // // Accessing one of the union fields while the other is active is safe as // long as they are layout-compatible, which is guaranteed by the definition of // kMutableKeys. For C++11, the relevant section of the standard is // https://timsong-cpp.github.io/cppwp/n3337/class.mem#19 (9.2.19) template union map_slot_type { map_slot_type() {} ~map_slot_type() = delete; using value_type = std::pair; using mutable_value_type = std::pair, absl::remove_const_t>; value_type value; mutable_value_type mutable_value; absl::remove_const_t key; }; template struct map_slot_policy { using slot_type = map_slot_type; using value_type = std::pair; using mutable_value_type = std::pair, absl::remove_const_t>; private: static void emplace(slot_type* slot) { // The construction of union doesn't do anything at runtime but it allows us // to access its members without violating aliasing rules. new (slot) slot_type; } // If pair and pair are layout-compatible, we can accept one // or the other via slot_type. We are also free to access the key via // slot_type::key in this case. using kMutableKeys = memory_internal::IsLayoutCompatible; public: static value_type& element(slot_type* slot) { return slot->value; } static const value_type& element(const slot_type* slot) { return slot->value; } static K& mutable_key(slot_type* slot) { // Still check for kMutableKeys so that we can avoid calling std::launder // unless necessary because it can interfere with optimizations. return kMutableKeys::value ? slot->key : *std::launder(const_cast( std::addressof(slot->value.first))); } static const K& key(const slot_type* slot) { return kMutableKeys::value ? slot->key : slot->value.first; } template static void construct(Allocator* alloc, slot_type* slot, Args&&... args) { emplace(slot); if (kMutableKeys::value) { absl::allocator_traits::construct(*alloc, &slot->mutable_value, std::forward(args)...); } else { absl::allocator_traits::construct(*alloc, &slot->value, std::forward(args)...); } } // Construct this slot by moving from another slot. template static void construct(Allocator* alloc, slot_type* slot, slot_type* other) { emplace(slot); if (kMutableKeys::value) { absl::allocator_traits::construct( *alloc, &slot->mutable_value, std::move(other->mutable_value)); } else { absl::allocator_traits::construct(*alloc, &slot->value, std::move(other->value)); } } // Construct this slot by copying from another slot. template static void construct(Allocator* alloc, slot_type* slot, const slot_type* other) { emplace(slot); absl::allocator_traits::construct(*alloc, &slot->value, other->value); } template static auto destroy(Allocator* alloc, slot_type* slot) { if (kMutableKeys::value) { absl::allocator_traits::destroy(*alloc, &slot->mutable_value); } else { absl::allocator_traits::destroy(*alloc, &slot->value); } return IsDestructionTrivial(); } template static auto transfer(Allocator* alloc, slot_type* new_slot, slot_type* old_slot) { // This should really just be // typename absl::is_trivially_relocatable::type() // but std::pair is not trivially copyable in C++23 in some standard // library versions. // See https://github.com/llvm/llvm-project/pull/95444 for instance. auto is_relocatable = typename std::conjunction< absl::is_trivially_relocatable, absl::is_trivially_relocatable>:: type(); emplace(new_slot); if (is_relocatable) { // TODO(b/247130232,b/251814870): remove casts after fixing warnings. std::memcpy(static_cast(std::launder(&new_slot->value)), static_cast(&old_slot->value), sizeof(value_type)); return is_relocatable; } if (kMutableKeys::value) { absl::allocator_traits::construct( *alloc, &new_slot->mutable_value, std::move(old_slot->mutable_value)); } else { absl::allocator_traits::construct(*alloc, &new_slot->value, std::move(old_slot->value)); } destroy(alloc, old_slot); return is_relocatable; } }; // Type erased function for computing hash of the slot. using HashSlotFn = size_t (*)(const void* hash_fn, void* slot); // Type erased function to apply `Fn` to data inside of the `slot`. // The data is expected to have type `T`. template size_t TypeErasedApplyToSlotFn(const void* fn, void* slot) { const auto* f = static_cast(fn); return (*f)(*static_cast(slot)); } // Type erased function to apply `Fn` to data inside of the `*slot_ptr`. // The data is expected to have type `T`. template size_t TypeErasedDerefAndApplyToSlotFn(const void* fn, void* slot_ptr) { const auto* f = static_cast(fn); const T* slot = *static_cast(slot_ptr); return (*f)(*slot); } } // namespace container_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_CONTAINER_INTERNAL_CONTAINER_MEMORY_H_ * soong/.intermediates/external/abseil-cpp/absl_strings_cord_internal_hdrs/gen/my_include_dir/absl/strings/internal/cord_internal.h// Copyright 2021 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_CORD_INTERNAL_H_ #define ABSL_STRINGS_INTERNAL_CORD_INTERNAL_H_ #include #include #include #include #include #include #include "absl/base/attributes.h" #include "absl/base/config.h" #include "absl/base/internal/endian.h" #include "absl/base/macros.h" #include "absl/base/nullability.h" #include "absl/base/optimization.h" #include "absl/container/internal/compressed_tuple.h" #include "absl/container/internal/container_memory.h" #include "absl/strings/string_view.h" // We can only add poisoning if we can detect consteval executions. #if defined(ABSL_HAVE_CONSTANT_EVALUATED) && \ (defined(ABSL_HAVE_ADDRESS_SANITIZER) || \ defined(ABSL_HAVE_MEMORY_SANITIZER)) #define ABSL_INTERNAL_CORD_HAVE_SANITIZER 1 #endif #define ABSL_CORD_INTERNAL_NO_SANITIZE \ ABSL_ATTRIBUTE_NO_SANITIZE_ADDRESS ABSL_ATTRIBUTE_NO_SANITIZE_MEMORY namespace absl { ABSL_NAMESPACE_BEGIN namespace cord_internal { // The overhead of a vtable is too much for Cord, so we roll our own subclasses // using only a single byte to differentiate classes from each other - the "tag" // byte. Define the subclasses first so we can provide downcasting helper // functions in the base class. struct CordRep; struct CordRepConcat; struct CordRepExternal; struct CordRepFlat; struct CordRepSubstring; struct CordRepCrc; class CordRepBtree; class CordzInfo; // Default feature enable states for cord ring buffers enum CordFeatureDefaults { kCordShallowSubcordsDefault = false }; extern std::atomic shallow_subcords_enabled; inline void enable_shallow_subcords(bool enable) { shallow_subcords_enabled.store(enable, std::memory_order_relaxed); } enum Constants { // The inlined size to use with absl::InlinedVector. // // Note: The InlinedVectors in this file (and in cord.h) do not need to use // the same value for their inlined size. The fact that they do is historical. // It may be desirable for each to use a different inlined size optimized for // that InlinedVector's usage. // // TODO(jgm): Benchmark to see if there's a more optimal value than 47 for // the inlined vector size (47 exists for backward compatibility). kInlinedVectorSize = 47, // Prefer copying blocks of at most this size, otherwise reference count. kMaxBytesToCopy = 511 }; // Emits a fatal error "Unexpected node type: xyz" and aborts the program. [[noreturn]] void LogFatalNodeType(CordRep* rep); // Fast implementation of memmove for up to 15 bytes. This implementation is // safe for overlapping regions. If nullify_tail is true, the destination is // padded with '\0' up to 15 bytes. template inline void SmallMemmove(char* dst, const char* src, size_t n) { if (n >= 8) { assert(n <= 15); uint64_t buf1; uint64_t buf2; memcpy(&buf1, src, 8); memcpy(&buf2, src + n - 8, 8); if (nullify_tail) { memset(dst + 7, 0, 8); } // GCC 12 has a false-positive -Wstringop-overflow warning here. #if ABSL_INTERNAL_HAVE_MIN_GNUC_VERSION(12, 0) #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wstringop-overflow" #endif memcpy(dst, &buf1, 8); memcpy(dst + n - 8, &buf2, 8); #if ABSL_INTERNAL_HAVE_MIN_GNUC_VERSION(12, 0) #pragma GCC diagnostic pop #endif } else if (n >= 4) { uint32_t buf1; uint32_t buf2; memcpy(&buf1, src, 4); memcpy(&buf2, src + n - 4, 4); if (nullify_tail) { memset(dst + 4, 0, 4); memset(dst + 7, 0, 8); } memcpy(dst, &buf1, 4); memcpy(dst + n - 4, &buf2, 4); } else { if (n != 0) { dst[0] = src[0]; dst[n / 2] = src[n / 2]; dst[n - 1] = src[n - 1]; } if (nullify_tail) { memset(dst + 7, 0, 8); memset(dst + n, 0, 8); } } } // Compact class for tracking the reference count and state flags for CordRep // instances. Data is stored in an atomic int32_t for compactness and speed. class RefcountAndFlags { public: constexpr RefcountAndFlags() : count_{kRefIncrement} {} struct Immortal {}; explicit constexpr RefcountAndFlags(Immortal) : count_(kImmortalFlag) {} // Increments the reference count. Imposes no memory ordering. inline void Increment() { count_.fetch_add(kRefIncrement, std::memory_order_relaxed); } // Asserts that the current refcount is greater than 0. If the refcount is // greater than 1, decrements the reference count. // // Returns false if there are no references outstanding; true otherwise. // Inserts barriers to ensure that state written before this method returns // false will be visible to a thread that just observed this method returning // false. Always returns false when the immortal bit is set. inline bool Decrement() { int32_t refcount = count_.load(std::memory_order_acquire); assert(refcount > 0 || refcount & kImmortalFlag); return refcount != kRefIncrement && count_.fetch_sub(kRefIncrement, std::memory_order_acq_rel) != kRefIncrement; } // Same as Decrement but expect that refcount is greater than 1. inline bool DecrementExpectHighRefcount() { int32_t refcount = count_.fetch_sub(kRefIncrement, std::memory_order_acq_rel); assert(refcount > 0 || refcount & kImmortalFlag); return refcount != kRefIncrement; } // Returns the current reference count using acquire semantics. inline size_t Get() const { return static_cast(count_.load(std::memory_order_acquire) >> kNumFlags); } // Returns whether the atomic integer is 1. // If the reference count is used in the conventional way, a // reference count of 1 implies that the current thread owns the // reference and no other thread shares it. // This call performs the test for a reference count of one, and // performs the memory barrier needed for the owning thread // to act on the object, knowing that it has exclusive access to the // object. Always returns false when the immortal bit is set. inline bool IsOne() { return count_.load(std::memory_order_acquire) == kRefIncrement; } bool IsImmortal() const { return (count_.load(std::memory_order_relaxed) & kImmortalFlag) != 0; } private: // We reserve the bottom bit for flag. // kImmortalBit indicates that this entity should never be collected; it is // used for the StringConstant constructor to avoid collecting immutable // constant cords. enum Flags { kNumFlags = 1, kImmortalFlag = 0x1, kRefIncrement = (1 << kNumFlags), }; std::atomic count_; }; // Various representations that we allow enum CordRepKind { UNUSED_0 = 0, SUBSTRING = 1, CRC = 2, BTREE = 3, UNUSED_4 = 4, EXTERNAL = 5, // We have different tags for different sized flat arrays, // starting with FLAT, and limited to MAX_FLAT_TAG. The below values map to an // allocated range of 32 bytes to 256 KB. The current granularity is: // - 8 byte granularity for flat sizes in [32 - 512] // - 64 byte granularity for flat sizes in (512 - 8KiB] // - 4KiB byte granularity for flat sizes in (8KiB, 256 KiB] // If a new tag is needed in the future, then 'FLAT' and 'MAX_FLAT_TAG' should // be adjusted as well as the Tag <---> Size mapping logic so that FLAT still // represents the minimum flat allocation size. (32 bytes as of now). FLAT = 6, MAX_FLAT_TAG = 248 }; // There are various locations where we want to check if some rep is a 'plain' // data edge, i.e. an external or flat rep. By having FLAT == EXTERNAL + 1, we // can perform this check in a single branch as 'tag >= EXTERNAL' // Note that we can leave this optimization to the compiler. The compiler will // DTRT when it sees a condition like `tag == EXTERNAL || tag >= FLAT`. static_assert(FLAT == EXTERNAL + 1, "EXTERNAL and FLAT not consecutive"); struct CordRep { // Result from an `extract edge` operation. Contains the (possibly changed) // tree node as well as the extracted edge, or {tree, nullptr} if no edge // could be extracted. // On success, the returned `tree` value is null if `extracted` was the only // data edge inside the tree, a data edge if there were only two data edges in // the tree, or the (possibly new / smaller) remaining tree with the extracted // data edge removed. struct ExtractResult { CordRep* tree; CordRep* extracted; }; CordRep() = default; constexpr CordRep(RefcountAndFlags::Immortal immortal, size_t l) : length(l), refcount(immortal), tag(EXTERNAL), storage{} {} // The following three fields have to be less than 32 bytes since // that is the smallest supported flat node size. Some code optimizations rely // on the specific layout of these fields. Notably: the non-trivial field // `refcount` being preceded by `length`, and being tailed by POD data // members only. // LINT.IfChange size_t length; RefcountAndFlags refcount; // If tag < FLAT, it represents CordRepKind and indicates the type of node. // Otherwise, the node type is CordRepFlat and the tag is the encoded size. uint8_t tag; // `storage` provides two main purposes: // - the starting point for FlatCordRep.Data() [flexible-array-member] // - 3 bytes of additional storage for use by derived classes. // The latter is used by CordrepConcat and CordRepBtree. CordRepConcat stores // a 'depth' value in storage[0], and the (future) CordRepBtree class stores // `height`, `begin` and `end` in the 3 entries. Otherwise we would need to // allocate room for these in the derived class, as not all compilers reuse // padding space from the base class (clang and gcc do, MSVC does not, etc) uint8_t storage[3]; // LINT.ThenChange(cord_rep_btree.h:copy_raw) // Returns true if this instance's tag matches the requested type. constexpr bool IsSubstring() const { return tag == SUBSTRING; } constexpr bool IsCrc() const { return tag == CRC; } constexpr bool IsExternal() const { return tag == EXTERNAL; } constexpr bool IsFlat() const { return tag >= FLAT; } constexpr bool IsBtree() const { return tag == BTREE; } inline CordRepSubstring* substring(); inline const CordRepSubstring* substring() const; inline CordRepCrc* crc(); inline const CordRepCrc* crc() const; inline CordRepExternal* external(); inline const CordRepExternal* external() const; inline CordRepFlat* flat(); inline const CordRepFlat* flat() const; inline CordRepBtree* btree(); inline const CordRepBtree* btree() const; // -------------------------------------------------------------------- // Memory management // Destroys the provided `rep`. static void Destroy(CordRep* rep); // Increments the reference count of `rep`. // Requires `rep` to be a non-null pointer value. static inline CordRep* Ref(CordRep* rep); // Decrements the reference count of `rep`. Destroys rep if count reaches // zero. Requires `rep` to be a non-null pointer value. static inline void Unref(CordRep* rep); }; struct CordRepSubstring : public CordRep { size_t start; // Starting offset of substring in child CordRep* child; // Creates a substring on `child`, adopting a reference on `child`. // Requires `child` to be either a flat or external node, and `pos` and `n` to // form a non-empty partial sub range of `'child`, i.e.: // `n > 0 && n < length && n + pos <= length` static inline CordRepSubstring* Create(CordRep* child, size_t pos, size_t n); // Creates a substring of `rep`. Does not adopt a reference on `rep`. // Requires `IsDataEdge(rep) && n > 0 && pos + n <= rep->length`. // If `n == rep->length` then this method returns `CordRep::Ref(rep)` // If `rep` is a substring of a flat or external node, then this method will // return a new substring of that flat or external node with `pos` adjusted // with the original `start` position. static inline CordRep* Substring(CordRep* rep, size_t pos, size_t n); }; // Type for function pointer that will invoke the releaser function and also // delete the `CordRepExternalImpl` corresponding to the passed in // `CordRepExternal`. using ExternalReleaserInvoker = void (*)(CordRepExternal*); // External CordReps are allocated together with a type erased releaser. The // releaser is stored in the memory directly following the CordRepExternal. struct CordRepExternal : public CordRep { CordRepExternal() = default; explicit constexpr CordRepExternal(absl::string_view str) : CordRep(RefcountAndFlags::Immortal{}, str.size()), base(str.data()), releaser_invoker(nullptr) {} const char* base; // Pointer to function that knows how to call and destroy the releaser. ExternalReleaserInvoker releaser_invoker; // Deletes (releases) the external rep. // Requires rep != nullptr and rep->IsExternal() static void Delete(CordRep* rep); }; // Use go/ranked-overloads for dispatching. struct Rank0 {}; struct Rank1 : Rank0 {}; template > void InvokeReleaser(Rank1, Releaser&& releaser, absl::string_view data) { ::std::invoke(std::forward(releaser), data); } template > void InvokeReleaser(Rank0, Releaser&& releaser, absl::string_view) { ::std::invoke(std::forward(releaser)); } // We use CompressedTuple so that we can benefit from EBCO. template struct CordRepExternalImpl : public CordRepExternal, public ::absl::container_internal::CompressedTuple { // The extra int arg is so that we can avoid interfering with copy/move // constructors while still benefitting from perfect forwarding. template CordRepExternalImpl(T&& releaser, int) : CordRepExternalImpl::CompressedTuple(std::forward(releaser)) { this->releaser_invoker = &Release; } ~CordRepExternalImpl() { InvokeReleaser(Rank1{}, std::move(this->template get<0>()), absl::string_view(base, length)); } static void Release(CordRepExternal* rep) { delete static_cast(rep); } }; inline CordRepSubstring* CordRepSubstring::Create(CordRep* child, size_t pos, size_t n) { assert(child != nullptr); assert(n > 0); assert(n < child->length); assert(pos < child->length); assert(n <= child->length - pos); // Move to strategical places inside the Cord logic and make this an assert. if (ABSL_PREDICT_FALSE(!(child->IsExternal() || child->IsFlat()))) { LogFatalNodeType(child); } CordRepSubstring* rep = new CordRepSubstring(); rep->length = n; rep->tag = SUBSTRING; rep->start = pos; rep->child = child; return rep; } inline CordRep* CordRepSubstring::Substring(CordRep* rep, size_t pos, size_t n) { assert(rep != nullptr); assert(n != 0); assert(pos < rep->length); assert(n <= rep->length - pos); if (n == rep->length) return CordRep::Ref(rep); if (rep->IsSubstring()) { pos += rep->substring()->start; rep = rep->substring()->child; } CordRepSubstring* substr = new CordRepSubstring(); substr->length = n; substr->tag = SUBSTRING; substr->start = pos; substr->child = CordRep::Ref(rep); return substr; } inline void CordRepExternal::Delete(CordRep* rep) { assert(rep != nullptr && rep->IsExternal()); auto* rep_external = static_cast(rep); assert(rep_external->releaser_invoker != nullptr); rep_external->releaser_invoker(rep_external); } template struct ConstInitExternalStorage { ABSL_CONST_INIT static CordRepExternal value; }; template ABSL_CONST_INIT CordRepExternal ConstInitExternalStorage::value(Str::value); enum { kMaxInline = 15, }; constexpr char GetOrNull(absl::string_view data, size_t pos) { return pos < data.size() ? data[pos] : '\0'; } // We store cordz_info as 64 bit pointer value in little endian format. This // guarantees that the least significant byte of cordz_info matches the first // byte of the inline data representation in `data`, which holds the inlined // size or the 'is_tree' bit. using cordz_info_t = int64_t; // Assert that the `cordz_info` pointer value perfectly overlaps the last half // of `data` and can hold a pointer value. static_assert(sizeof(cordz_info_t) * 2 == kMaxInline + 1, ""); static_assert(sizeof(cordz_info_t) >= sizeof(intptr_t), ""); // LittleEndianByte() creates a little endian representation of 'value', i.e.: // a little endian value where the first byte in the host's representation // holds 'value`, with all other bytes being 0. static constexpr cordz_info_t LittleEndianByte(unsigned char value) { #if defined(ABSL_IS_BIG_ENDIAN) return static_cast(value) << ((sizeof(cordz_info_t) - 1) * 8); #else return value; #endif } class InlineData { public: // DefaultInitType forces the use of the default initialization constructor. enum DefaultInitType { kDefaultInit }; // kNullCordzInfo holds the little endian representation of intptr_t(1) // This is the 'null' / initial value of 'cordz_info'. The null value // is specifically big endian 1 as with 64-bit pointers, the last // byte of cordz_info overlaps with the last byte holding the tag. static constexpr cordz_info_t kNullCordzInfo = LittleEndianByte(1); // kTagOffset contains the offset of the control byte / tag. This constant is // intended mostly for debugging purposes: do not remove this constant as it // is actively inspected and used by gdb pretty printing code. static constexpr size_t kTagOffset = 0; // Implement `~InlineData()` conditionally: we only need this destructor to // unpoison poisoned instances under *SAN, and it will only compile correctly // if the current compiler supports `absl::is_constant_evaluated()`. #ifdef ABSL_INTERNAL_CORD_HAVE_SANITIZER ~InlineData() noexcept { unpoison(); } #endif constexpr InlineData() noexcept { poison_this(); } explicit InlineData(DefaultInitType) noexcept : rep_(kDefaultInit) { poison_this(); } explicit InlineData(CordRep* rep) noexcept : rep_(rep) { ABSL_ASSERT(rep != nullptr); } // Explicit constexpr constructor to create a constexpr InlineData // value. Creates an inlined SSO value if `rep` is null, otherwise // creates a tree instance value. constexpr InlineData(absl::string_view sv, CordRep* rep) noexcept : rep_(rep ? Rep(rep) : Rep(sv)) { poison(); } constexpr InlineData(const InlineData& rhs) noexcept; InlineData& operator=(const InlineData& rhs) noexcept; friend void swap(InlineData& lhs, InlineData& rhs) noexcept; friend bool operator==(const InlineData& lhs, const InlineData& rhs) { #ifdef ABSL_INTERNAL_CORD_HAVE_SANITIZER const Rep l = lhs.rep_.SanitizerSafeCopy(); const Rep r = rhs.rep_.SanitizerSafeCopy(); return memcmp(&l, &r, sizeof(l)) == 0; #else return memcmp(&lhs, &rhs, sizeof(lhs)) == 0; #endif } friend bool operator!=(const InlineData& lhs, const InlineData& rhs) { return !operator==(lhs, rhs); } // Poisons the unused inlined SSO data if the current instance // is inlined, else un-poisons the entire instance. constexpr void poison(); // Un-poisons this instance. constexpr void unpoison(); // Poisons the current instance. This is used on default initialization. constexpr void poison_this(); // Returns true if the current instance is empty. // The 'empty value' is an inlined data value of zero length. bool is_empty() const { return rep_.tag() == 0; } // Returns true if the current instance holds a tree value. bool is_tree() const { return (rep_.tag() & 1) != 0; } // Returns true if the current instance holds a cordz_info value. // Requires the current instance to hold a tree value. bool is_profiled() const { assert(is_tree()); return rep_.cordz_info() != kNullCordzInfo; } // Returns true if either of the provided instances hold a cordz_info value. // This method is more efficient than the equivalent `data1.is_profiled() || // data2.is_profiled()`. Requires both arguments to hold a tree. static bool is_either_profiled(const InlineData& data1, const InlineData& data2) { assert(data1.is_tree() && data2.is_tree()); return (data1.rep_.cordz_info() | data2.rep_.cordz_info()) != kNullCordzInfo; } // Returns the cordz_info sampling instance for this instance, or nullptr // if the current instance is not sampled and does not have CordzInfo data. // Requires the current instance to hold a tree value. CordzInfo* cordz_info() const { assert(is_tree()); intptr_t info = static_cast(absl::little_endian::ToHost64( static_cast(rep_.cordz_info()))); assert(info & 1); return reinterpret_cast(info - 1); } // Sets the current cordz_info sampling instance for this instance, or nullptr // if the current instance is not sampled and does not have CordzInfo data. // Requires the current instance to hold a tree value. void set_cordz_info(CordzInfo* cordz_info) { assert(is_tree()); uintptr_t info = reinterpret_cast(cordz_info) | 1; rep_.set_cordz_info( static_cast(absl::little_endian::FromHost64(info))); } // Resets the current cordz_info to null / empty. void clear_cordz_info() { assert(is_tree()); rep_.set_cordz_info(kNullCordzInfo); } // Returns a read only pointer to the character data inside this instance. // Requires the current instance to hold inline data. const char* as_chars() const { assert(!is_tree()); return rep_.as_chars(); } // Returns a mutable pointer to the character data inside this instance. // Should be used for 'write only' operations setting an inlined value. // Applications can set the value of inlined data either before or after // setting the inlined size, i.e., both of the below are valid: // // // Set inlined data and inline size // memcpy(data_.as_chars(), data, size); // data_.set_inline_size(size); // // // Set inlined size and inline data // data_.set_inline_size(size); // memcpy(data_.as_chars(), data, size); // // It's an error to read from the returned pointer without a preceding write // if the current instance does not hold inline data, i.e.: is_tree() == true. char* as_chars() { return rep_.as_chars(); } // Returns the tree value of this value. // Requires the current instance to hold a tree value. CordRep* as_tree() const { assert(is_tree()); return rep_.tree(); } void set_inline_data(const char* data, size_t n) { ABSL_ASSERT(n <= kMaxInline); unpoison(); rep_.set_tag(static_cast(n << 1)); SmallMemmove(rep_.as_chars(), data, n); poison(); } void CopyInlineToString(std::string* dst) const { assert(!is_tree()); // As Cord can store only 15 bytes it is smaller than std::string's // small string optimization buffer size. Therefore we will always trigger // the fast assign short path. // // Copying with a size equal to the maximum allows more efficient, wider // stores to be used and no branching. dst->assign(rep_.SanitizerSafeCopy().as_chars(), kMaxInline); // After the copy we then change the size and put in a 0 byte. dst->erase(inline_size()); } void copy_max_inline_to(char* dst) const { assert(!is_tree()); memcpy(dst, rep_.SanitizerSafeCopy().as_chars(), kMaxInline); } // Initialize this instance to holding the tree value `rep`, // initializing the cordz_info to null, i.e.: 'not profiled'. void make_tree(CordRep* rep) { unpoison(); rep_.make_tree(rep); } // Set the tree value of this instance to 'rep`. // Requires the current instance to already hold a tree value. // Does not affect the value of cordz_info. void set_tree(CordRep* rep) { assert(is_tree()); rep_.set_tree(rep); } // Returns the size of the inlined character data inside this instance. // Requires the current instance to hold inline data. size_t inline_size() const { return rep_.inline_size(); } // Sets the size of the inlined character data inside this instance. // Requires `size` to be <= kMaxInline. // See the documentation on 'as_chars()' for more information and examples. void set_inline_size(size_t size) { unpoison(); rep_.set_inline_size(size); poison(); } // Compares 'this' inlined data with rhs. The comparison is a straightforward // lexicographic comparison. `Compare()` returns values as follows: // // -1 'this' InlineData instance is smaller // 0 the InlineData instances are equal // 1 'this' InlineData instance larger int Compare(const InlineData& rhs) const { return Compare(rep_.SanitizerSafeCopy(), rhs.rep_.SanitizerSafeCopy()); } private: struct Rep { // See cordz_info_t for forced alignment and size of `cordz_info` details. struct AsTree { explicit constexpr AsTree(absl::cord_internal::CordRep* tree) : rep(tree) {} cordz_info_t cordz_info = kNullCordzInfo; absl::cord_internal::CordRep* rep; }; explicit Rep(DefaultInitType) {} constexpr Rep() : data{0} {} constexpr Rep(const Rep&) = default; constexpr Rep& operator=(const Rep&) = default; explicit constexpr Rep(CordRep* rep) : as_tree(rep) {} explicit constexpr Rep(absl::string_view chars) : data{static_cast((chars.size() << 1)), GetOrNull(chars, 0), GetOrNull(chars, 1), GetOrNull(chars, 2), GetOrNull(chars, 3), GetOrNull(chars, 4), GetOrNull(chars, 5), GetOrNull(chars, 6), GetOrNull(chars, 7), GetOrNull(chars, 8), GetOrNull(chars, 9), GetOrNull(chars, 10), GetOrNull(chars, 11), GetOrNull(chars, 12), GetOrNull(chars, 13), GetOrNull(chars, 14)} {} #ifdef ABSL_INTERNAL_CORD_HAVE_SANITIZER // Break compiler optimization for cases when value is allocated on the // stack. Compiler assumes that the the variable is fully accessible // regardless of our poisoning. // Missing report: https://github.com/llvm/llvm-project/issues/100640 const Rep* self() const { const Rep* volatile ptr = this; return ptr; } Rep* self() { Rep* volatile ptr = this; return ptr; } #else constexpr const Rep* self() const { return this; } constexpr Rep* self() { return this; } #endif // Disable sanitizer as we must always be able to read `tag`. ABSL_CORD_INTERNAL_NO_SANITIZE int8_t tag() const { return reinterpret_cast(this)[0]; } void set_tag(int8_t rhs) { reinterpret_cast(self())[0] = rhs; } char* as_chars() { return self()->data + 1; } const char* as_chars() const { return self()->data + 1; } bool is_tree() const { return (self()->tag() & 1) != 0; } size_t inline_size() const { ABSL_ASSERT(!self()->is_tree()); return static_cast(self()->tag()) >> 1; } void set_inline_size(size_t size) { ABSL_ASSERT(size <= kMaxInline); self()->set_tag(static_cast(size << 1)); } CordRep* tree() const { return self()->as_tree.rep; } void set_tree(CordRep* rhs) { self()->as_tree.rep = rhs; } cordz_info_t cordz_info() const { return self()->as_tree.cordz_info; } void set_cordz_info(cordz_info_t rhs) { self()->as_tree.cordz_info = rhs; } void make_tree(CordRep* tree) { self()->as_tree.rep = tree; self()->as_tree.cordz_info = kNullCordzInfo; } #ifdef ABSL_INTERNAL_CORD_HAVE_SANITIZER constexpr Rep SanitizerSafeCopy() const { if (!absl::is_constant_evaluated()) { Rep res; if (is_tree()) { res = *this; } else { res.set_tag(tag()); memcpy(res.as_chars(), as_chars(), inline_size()); } return res; } else { return *this; } } #else constexpr const Rep& SanitizerSafeCopy() const { return *this; } #endif // If the data has length <= kMaxInline, we store it in `data`, and // store the size in the first char of `data` shifted left + 1. // Else we store it in a tree and store a pointer to that tree in // `as_tree.rep` with a tagged pointer to make `tag() & 1` non zero. union { char data[kMaxInline + 1]; AsTree as_tree; }; // TODO(b/145829486): see swap(InlineData, InlineData) for more info. inline void SwapValue(Rep rhs, Rep& refrhs) { memcpy(&refrhs, this, sizeof(*this)); memcpy(this, &rhs, sizeof(*this)); } }; // Private implementation of `Compare()` static inline int Compare(const Rep& lhs, const Rep& rhs) { uint64_t x, y; memcpy(&x, lhs.as_chars(), sizeof(x)); memcpy(&y, rhs.as_chars(), sizeof(y)); if (x == y) { memcpy(&x, lhs.as_chars() + 7, sizeof(x)); memcpy(&y, rhs.as_chars() + 7, sizeof(y)); if (x == y) { if (lhs.inline_size() == rhs.inline_size()) return 0; return lhs.inline_size() < rhs.inline_size() ? -1 : 1; } } x = absl::big_endian::FromHost64(x); y = absl::big_endian::FromHost64(y); return x < y ? -1 : 1; } Rep rep_; }; static_assert(sizeof(InlineData) == kMaxInline + 1, ""); #ifdef ABSL_INTERNAL_CORD_HAVE_SANITIZER constexpr InlineData::InlineData(const InlineData& rhs) noexcept : rep_(rhs.rep_.SanitizerSafeCopy()) { poison(); } inline InlineData& InlineData::operator=(const InlineData& rhs) noexcept { unpoison(); rep_ = rhs.rep_.SanitizerSafeCopy(); poison(); return *this; } constexpr void InlineData::poison_this() { if (!absl::is_constant_evaluated()) { container_internal::SanitizerPoisonObject(this); } } constexpr void InlineData::unpoison() { if (!absl::is_constant_evaluated()) { container_internal::SanitizerUnpoisonObject(this); } } constexpr void InlineData::poison() { if (!absl::is_constant_evaluated()) { if (is_tree()) { container_internal::SanitizerUnpoisonObject(this); } else if (const size_t size = inline_size()) { if (size < kMaxInline) { const char* end = rep_.as_chars() + size; container_internal::SanitizerPoisonMemoryRegion(end, kMaxInline - size); } } else { container_internal::SanitizerPoisonObject(this); } } } #else // ABSL_INTERNAL_CORD_HAVE_SANITIZER constexpr InlineData::InlineData(const InlineData&) noexcept = default; inline InlineData& InlineData::operator=(const InlineData&) noexcept = default; constexpr void InlineData::poison_this() {} constexpr void InlineData::unpoison() {} constexpr void InlineData::poison() {} #endif // ABSL_INTERNAL_CORD_HAVE_SANITIZER inline CordRepSubstring* CordRep::substring() { assert(IsSubstring()); return static_cast(this); } inline const CordRepSubstring* CordRep::substring() const { assert(IsSubstring()); return static_cast(this); } inline CordRepExternal* CordRep::external() { assert(IsExternal()); return static_cast(this); } inline const CordRepExternal* CordRep::external() const { assert(IsExternal()); return static_cast(this); } inline CordRep* CordRep::Ref(CordRep* rep) { // ABSL_ASSUME is a workaround for // https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105585 ABSL_ASSUME(rep != nullptr); rep->refcount.Increment(); return rep; } inline void CordRep::Unref(CordRep* rep) { assert(rep != nullptr); // Expect refcount to be 0. Avoiding the cost of an atomic decrement should // typically outweigh the cost of an extra branch checking for ref == 1. if (ABSL_PREDICT_FALSE(!rep->refcount.DecrementExpectHighRefcount())) { Destroy(rep); } } inline void swap(InlineData& lhs, InlineData& rhs) noexcept { lhs.unpoison(); rhs.unpoison(); // TODO(b/145829486): `std::swap(lhs.rep_, rhs.rep_)` results in bad codegen // on clang, spilling the temporary swap value on the stack. Since `Rep` is // trivial, we can make clang DTRT by calling a hand-rolled `SwapValue` where // we pass `rhs` both by value (register allocated) and by reference. The IR // then folds and inlines correctly into an optimized swap without spill. lhs.rep_.SwapValue(rhs.rep_, rhs.rep_); rhs.poison(); lhs.poison(); } } // namespace cord_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_CORD_INTERNAL_H_ * osoong/.intermediates/external/abseil-cpp/absl_strings_cord_hdrs/gen/my_include_dir/absl/strings/cord_analysis.h// Copyright 2021 The Abseil Authors // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_CORD_ANALYSIS_H_ #define ABSL_STRINGS_CORD_ANALYSIS_H_ #include #include #include "absl/base/config.h" #include "absl/base/nullability.h" #include "absl/strings/internal/cord_internal.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace cord_internal { // Returns the *approximate* number of bytes held in full or in part by this // Cord (which may not remain the same between invocations). Cords that share // memory could each be "charged" independently for the same shared memory. size_t GetEstimatedMemoryUsage(const CordRep* absl_nonnull rep); // Returns the *approximate* number of bytes held in full or in part by this // Cord for the distinct memory held by this cord. This is similar to // `GetEstimatedMemoryUsage()`, except that if the cord has multiple references // to the same memory, that memory is only counted once. // // For example: // absl::Cord cord; // cord.append(some_other_cord); // cord.append(some_other_cord); // // Calls GetEstimatedMemoryUsage() and counts `other_cord` twice: // cord.EstimatedMemoryUsage(kTotal); // // Calls GetMorePreciseMemoryUsage() and counts `other_cord` once: // cord.EstimatedMemoryUsage(kTotalMorePrecise); // // This is more expensive than `GetEstimatedMemoryUsage()` as it requires // deduplicating all memory references. size_t GetMorePreciseMemoryUsage(const CordRep* absl_nonnull rep); // Returns the *approximate* number of bytes held in full or in part by this // CordRep weighted by the sharing ratio of that data. For example, if some data // edge is shared by 4 different Cords, then each cord is attribute 1/4th of // the total memory usage as a 'fair share' of the total memory usage. size_t GetEstimatedFairShareMemoryUsage(const CordRep* absl_nonnull rep); } // namespace cord_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_CORD_ANALYSIS_H_ *f ~soong/.intermediates/external/abseil-cpp/absl_functional_any_invocable_hdrs/gen/my_include_dir/absl/functional/any_invocable.he// Copyright 2022 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // File: any_invocable.h // ----------------------------------------------------------------------------- // // This header file defines an `absl::AnyInvocable` type that assumes ownership // and wraps an object of an invocable type. (Invocable types adhere to the // concept specified in https://en.cppreference.com/w/cpp/concepts/invocable.) // // In general, prefer `absl::AnyInvocable` when you need a type-erased // function parameter that needs to take ownership of the type. // // NOTE: `absl::AnyInvocable` is similar to the C++23 `std::move_only_function` // abstraction, but has a slightly different API and is not designed to be a // drop-in replacement or backfill of that type. // // Credits to Matt Calabrese (https://github.com/mattcalabrese) for the original // implementation. #ifndef ABSL_FUNCTIONAL_ANY_INVOCABLE_H_ #define ABSL_FUNCTIONAL_ANY_INVOCABLE_H_ #include #include #include #include #include #include "absl/base/config.h" #include "absl/functional/internal/any_invocable.h" #include "absl/meta/type_traits.h" #include "absl/utility/utility.h" namespace absl { ABSL_NAMESPACE_BEGIN // absl::AnyInvocable // // `absl::AnyInvocable` is a functional wrapper type, like `std::function`, that // assumes ownership of an invocable object. Unlike `std::function`, an // `absl::AnyInvocable` is more type-safe and provides the following additional // benefits: // // * Properly adheres to const correctness of the underlying type // * Is move-only so avoids concurrency problems with copied invocables and // unnecessary copies in general. // * Supports reference qualifiers allowing it to perform unique actions (noted // below). // // `absl::AnyInvocable` is a template, and an `absl::AnyInvocable` instantiation // may wrap any invocable object with a compatible function signature, e.g. // having arguments and return types convertible to types matching the // `absl::AnyInvocable` signature, and also matching any stated reference // qualifiers, as long as that type is moveable. It therefore provides broad // type erasure for functional objects. // // An `absl::AnyInvocable` is typically used as a type-erased function parameter // for accepting various functional objects: // // // Define a function taking an AnyInvocable parameter. // void my_func(absl::AnyInvocable f) { // ... // }; // // // That function can accept any invocable type: // // // Accept a function reference. We don't need to move a reference. // int func1() { return 0; }; // my_func(func1); // // // Accept a lambda. We use std::move here because otherwise my_func would // // copy the lambda. // auto lambda = []() { return 0; }; // my_func(std::move(lambda)); // // // Accept a function pointer. We don't need to move a function pointer. // func2 = &func1; // my_func(func2); // // // Accept an std::function by moving it. Note that the lambda is copyable // // (satisfying std::function requirements) and moveable (satisfying // // absl::AnyInvocable requirements). // std::function func6 = []() { return 0; }; // my_func(std::move(func6)); // // `AnyInvocable` also properly respects `const` qualifiers, reference // qualifiers, and the `noexcept` specification as part of the user-specified // function type (e.g. `AnyInvocable`). These // qualifiers will be applied to the `AnyInvocable` object's `operator()`, and // the underlying invocable must be compatible with those qualifiers. // // Comparison of const and non-const function types: // // // Store a closure inside of `func` with the function type `int()`. // // Note that we have made `func` itself `const`. // const AnyInvocable func = [](){ return 0; }; // // func(); // Compile-error: the passed type `int()` isn't `const`. // // // Store a closure inside of `const_func` with the function type // // `int() const`. // // Note that we have also made `const_func` itself `const`. // const AnyInvocable const_func = [](){ return 0; }; // // const_func(); // Fine: `int() const` is `const`. // // In the above example, the call `func()` would have compiled if // `std::function` were used even though the types are not const compatible. // This is a bug, and using `absl::AnyInvocable` properly detects that bug. // // In addition to affecting the signature of `operator()`, the `const` and // reference qualifiers of the function type also appropriately constrain which // kinds of invocable objects you are allowed to place into the `AnyInvocable` // instance. If you specify a function type that is const-qualified, then // anything that you attempt to put into the `AnyInvocable` must be callable on // a `const` instance of that type. // // Constraint example: // // // Fine because the lambda is callable when `const`. // AnyInvocable func = [=](){ return 0; }; // // // This is a compile-error because the lambda isn't callable when `const`. // AnyInvocable error = [=]() mutable { return 0; }; // // An `&&` qualifier can be used to express that an `absl::AnyInvocable` // instance should be invoked at most once: // // // Invokes `continuation` with the logical result of an operation when // // that operation completes (common in asynchronous code). // void CallOnCompletion(AnyInvocable continuation) { // int result_of_foo = foo(); // // // `std::move` is required because the `operator()` of `continuation` is // // rvalue-reference qualified. // std::move(continuation)(result_of_foo); // } // // Attempting to call `absl::AnyInvocable` multiple times in such a case // results in undefined behavior. // // Invoking an empty `absl::AnyInvocable` results in undefined behavior: // // // Create an empty instance using the default constructor. // AnyInvocable empty; // empty(); // WARNING: Undefined behavior! template class AnyInvocable : private internal_any_invocable::Impl { private: static_assert( std::is_function::value, "The template argument of AnyInvocable must be a function type."); using Impl = internal_any_invocable::Impl; public: // The return type of Sig using result_type = typename Impl::result_type; // Constructors // Constructs the `AnyInvocable` in an empty state. // Invoking it results in undefined behavior. AnyInvocable() noexcept = default; AnyInvocable(std::nullptr_t) noexcept {} // NOLINT // Constructs the `AnyInvocable` from an existing `AnyInvocable` by a move. // Note that `f` is not guaranteed to be empty after move-construction, // although it may be. AnyInvocable(AnyInvocable&& /*f*/) noexcept = default; // Constructs an `AnyInvocable` from an invocable object. // // Upon construction, `*this` is only empty if `f` is a function pointer or // member pointer type and is null, or if `f` is an `AnyInvocable` that is // empty. template ::value>> AnyInvocable(F&& f) // NOLINT : Impl(internal_any_invocable::ConversionConstruct(), std::forward(f)) {} // Constructs an `AnyInvocable` that holds an invocable object of type `T`, // which is constructed in-place from the given arguments. // // Example: // // AnyInvocable func( // absl::in_place_type, arg1, arg2); // template ::value>> explicit AnyInvocable(absl::in_place_type_t, Args&&... args) : Impl(absl::in_place_type>, std::forward(args)...) { static_assert(std::is_same>::value, "The explicit template argument of in_place_type is required " "to be an unqualified object type."); } // Overload of the above constructor to support list-initialization. template &, Args...>::value>> explicit AnyInvocable(absl::in_place_type_t, std::initializer_list ilist, Args&&... args) : Impl(absl::in_place_type>, ilist, std::forward(args)...) { static_assert(std::is_same>::value, "The explicit template argument of in_place_type is required " "to be an unqualified object type."); } // Assignment Operators // Assigns an `AnyInvocable` through move-assignment. // Note that `f` is not guaranteed to be empty after move-assignment // although it may be. AnyInvocable& operator=(AnyInvocable&& /*f*/) noexcept = default; // Assigns an `AnyInvocable` from a nullptr, clearing the `AnyInvocable`. If // not empty, destroys the target, putting `*this` into an empty state. AnyInvocable& operator=(std::nullptr_t) noexcept { this->Clear(); return *this; } // Assigns an `AnyInvocable` from an existing `AnyInvocable` instance. // // Upon assignment, `*this` is only empty if `f` is a function pointer or // member pointer type and is null, or if `f` is an `AnyInvocable` that is // empty. template ::value>> AnyInvocable& operator=(F&& f) { *this = AnyInvocable(std::forward(f)); return *this; } // Assigns an `AnyInvocable` from a reference to an invocable object. // Upon assignment, stores a reference to the invocable object in the // `AnyInvocable` instance. template < class F, typename = absl::enable_if_t< internal_any_invocable::CanAssignReferenceWrapper::value>> AnyInvocable& operator=(std::reference_wrapper f) noexcept { *this = AnyInvocable(f); return *this; } // Destructor // If not empty, destroys the target. ~AnyInvocable() = default; // absl::AnyInvocable::swap() // // Exchanges the targets of `*this` and `other`. void swap(AnyInvocable& other) noexcept { std::swap(*this, other); } // absl::AnyInvocable::operator bool() // // Returns `true` if `*this` is not empty. // // WARNING: An `AnyInvocable` that wraps an empty `std::function` is not // itself empty. This behavior is consistent with the standard equivalent // `std::move_only_function`. In the following example, `a()` will actually // invoke `f()`, leading to an `std::bad_function_call` exception: // std::function f; // empty // absl::AnyInvocable a = f; // not empty // // Invoking an empty `AnyInvocable` results in undefined behavior. explicit operator bool() const noexcept { return this->HasValue(); } // Invokes the target object of `*this`. `*this` must not be empty. // // Note: The signature of this function call operator is the same as the // template parameter `Sig`. using Impl::operator(); // Equality operators // Returns `true` if `*this` is empty. friend bool operator==(const AnyInvocable& f, std::nullptr_t) noexcept { return !f.HasValue(); } // Returns `true` if `*this` is empty. friend bool operator==(std::nullptr_t, const AnyInvocable& f) noexcept { return !f.HasValue(); } // Returns `false` if `*this` is empty. friend bool operator!=(const AnyInvocable& f, std::nullptr_t) noexcept { return f.HasValue(); } // Returns `false` if `*this` is empty. friend bool operator!=(std::nullptr_t, const AnyInvocable& f) noexcept { return f.HasValue(); } // swap() // // Exchanges the targets of `f1` and `f2`. friend void swap(AnyInvocable& f1, AnyInvocable& f2) noexcept { f1.swap(f2); } private: // Friending other instantiations is necessary for conversions. template friend class internal_any_invocable::CoreImpl; }; ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_FUNCTIONAL_ANY_INVOCABLE_H_ *- |soong/.intermediates/external/abseil-cpp/absl_functional_function_ref_hdrs/gen/my_include_dir/absl/functional/function_ref.h,// Copyright 2019 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // File: function_ref.h // ----------------------------------------------------------------------------- // // This header file defines the `absl::FunctionRef` type for holding a // non-owning reference to an object of any invocable type. This function // reference is typically most useful as a type-erased argument type for // accepting function types that neither take ownership nor copy the type; using // the reference type in this case avoids a copy and an allocation. Best // practices of other non-owning reference-like objects (such as // `absl::string_view`) apply here. // // An `absl::FunctionRef` is similar in usage to a `std::function` but has the // following differences: // // * It doesn't own the underlying object. // * It doesn't have a null or empty state. // * It never performs deep copies or allocations. // * It's much faster and cheaper to construct. // * It's trivially copyable and destructable. // // Generally, `absl::FunctionRef` should not be used as a return value, data // member, or to initialize a `std::function`. Such usages will often lead to // problematic lifetime issues. Once you convert something to an // `absl::FunctionRef` you cannot make a deep copy later. // // This class is suitable for use wherever a "const std::function<>&" // would be used without making a copy. ForEach functions and other versions of // the visitor pattern are a good example of when this class should be used. // // This class is trivial to copy and should be passed by value. #ifndef ABSL_FUNCTIONAL_FUNCTION_REF_H_ #define ABSL_FUNCTIONAL_FUNCTION_REF_H_ #include #include #include #include "absl/base/attributes.h" #include "absl/functional/internal/function_ref.h" #include "absl/meta/type_traits.h" namespace absl { ABSL_NAMESPACE_BEGIN // FunctionRef // // Dummy class declaration to allow the partial specialization based on function // types below. template class FunctionRef; // FunctionRef // // An `absl::FunctionRef` is a lightweight wrapper to any invocable object with // a compatible signature. Generally, an `absl::FunctionRef` should only be used // as an argument type and should be preferred as an argument over a const // reference to a `std::function`. `absl::FunctionRef` itself does not allocate, // although the wrapped invocable may. // // Example: // // // The following function takes a function callback by const reference // bool Visitor(const std::function& callback); // // // Assuming that the function is not stored or otherwise copied, it can be // // replaced by an `absl::FunctionRef`: // bool Visitor(absl::FunctionRef // callback); template class FunctionRef { private: // Used to disable constructors for objects that are not compatible with the // signature of this FunctionRef. template > using EnableIfCompatible = typename std::enable_if::value || std::is_convertible::value>::type; public: // Constructs a FunctionRef from any invocable type. template > // NOLINTNEXTLINE(runtime/explicit) FunctionRef(const F& f ABSL_ATTRIBUTE_LIFETIME_BOUND) : invoker_(&absl::functional_internal::InvokeObject) { absl::functional_internal::AssertNonNull(f); ptr_.obj = &f; } // Overload for function pointers. This eliminates a level of indirection that // would happen if the above overload was used (it lets us store the pointer // instead of a pointer to a pointer). // // This overload is also used for references to functions, since references to // functions can decay to function pointers implicitly. template < typename F, typename = EnableIfCompatible, absl::functional_internal::EnableIf::value> = 0> FunctionRef(F* f) // NOLINT(runtime/explicit) : invoker_(&absl::functional_internal::InvokeFunction) { assert(f != nullptr); ptr_.fun = reinterpret_cast(f); } FunctionRef& operator=(const FunctionRef& rhs) = default; FunctionRef(const FunctionRef& rhs) = default; // Call the underlying object. R operator()(Args... args) const { return invoker_(ptr_, std::forward(args)...); } private: absl::functional_internal::VoidPtr ptr_; absl::functional_internal::Invoker invoker_; }; // Allow const qualified function signatures. Since FunctionRef requires // constness anyway we can just make this a no-op. template class FunctionRef : public FunctionRef { public: using FunctionRef::FunctionRef; }; ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_FUNCTIONAL_FUNCTION_REF_H_ *N soong/.intermediates/external/abseil-cpp/absl_strings_str_format_internal_hdrs/gen/my_include_dir/absl/strings/internal/str_format/parser.hM// Copyright 2020 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_STR_FORMAT_PARSER_H_ #define ABSL_STRINGS_INTERNAL_STR_FORMAT_PARSER_H_ #include #include #include #include #include #include #include #include #include #include "absl/base/config.h" #include "absl/base/optimization.h" #include "absl/strings/internal/str_format/checker.h" #include "absl/strings/internal/str_format/constexpr_parser.h" #include "absl/strings/internal/str_format/extension.h" #include "absl/strings/string_view.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace str_format_internal { std::string LengthModToString(LengthMod v); const char* ConsumeUnboundConversionNoInline(const char* p, const char* end, UnboundConversion* conv, int* next_arg); // Parse the format string provided in 'src' and pass the identified items into // 'consumer'. // Text runs will be passed by calling // Consumer::Append(string_view); // ConversionItems will be passed by calling // Consumer::ConvertOne(UnboundConversion, string_view); // In the case of ConvertOne, the string_view that is passed is the // portion of the format string corresponding to the conversion, not including // the leading %. On success, it returns true. On failure, it stops and returns // false. template bool ParseFormatString(string_view src, Consumer consumer) { int next_arg = 0; const char* p = src.data(); const char* const end = p + src.size(); while (p != end) { const char* percent = static_cast(memchr(p, '%', static_cast(end - p))); if (!percent) { // We found the last substring. return consumer.Append(string_view(p, static_cast(end - p))); } // We found a percent, so push the text run then process the percent. if (ABSL_PREDICT_FALSE(!consumer.Append( string_view(p, static_cast(percent - p))))) { return false; } if (ABSL_PREDICT_FALSE(percent + 1 >= end)) return false; auto tag = GetTagForChar(percent[1]); if (tag.is_conv()) { if (ABSL_PREDICT_FALSE(next_arg < 0)) { // This indicates an error in the format string. // The only way to get `next_arg < 0` here is to have a positional // argument first which sets next_arg to -1 and then a non-positional // argument. return false; } p = percent + 2; // Keep this case separate from the one below. // ConvertOne is more efficient when the compiler can see that the `basic` // flag is set. UnboundConversion conv; conv.conv = tag.as_conv(); conv.arg_position = ++next_arg; if (ABSL_PREDICT_FALSE( !consumer.ConvertOne(conv, string_view(percent + 1, 1)))) { return false; } } else if (percent[1] != '%') { UnboundConversion conv; p = ConsumeUnboundConversionNoInline(percent + 1, end, &conv, &next_arg); if (ABSL_PREDICT_FALSE(p == nullptr)) return false; if (ABSL_PREDICT_FALSE(!consumer.ConvertOne( conv, string_view(percent + 1, static_cast(p - (percent + 1)))))) { return false; } } else { if (ABSL_PREDICT_FALSE(!consumer.Append("%"))) return false; p = percent + 2; continue; } } return true; } // Always returns true, or fails to compile in a constexpr context if s does not // point to a constexpr char array. constexpr bool EnsureConstexpr(string_view s) { return s.empty() || s[0] == s[0]; } class ParsedFormatBase { public: explicit ParsedFormatBase( string_view format, bool allow_ignored, std::initializer_list convs); ParsedFormatBase(const ParsedFormatBase& other) { *this = other; } ParsedFormatBase(ParsedFormatBase&& other) { *this = std::move(other); } ParsedFormatBase& operator=(const ParsedFormatBase& other) { if (this == &other) return *this; has_error_ = other.has_error_; items_ = other.items_; size_t text_size = items_.empty() ? 0 : items_.back().text_end; data_ = std::make_unique(text_size); if (text_size > 0) { memcpy(data_.get(), other.data_.get(), text_size); } return *this; } ParsedFormatBase& operator=(ParsedFormatBase&& other) { if (this == &other) return *this; has_error_ = other.has_error_; data_ = std::move(other.data_); items_ = std::move(other.items_); // Reset the vector to make sure the invariants hold. other.items_.clear(); return *this; } template bool ProcessFormat(Consumer consumer) const { const char* const base = data_.get(); string_view text(base, 0); for (const auto& item : items_) { const char* const end = text.data() + text.size(); text = string_view(end, static_cast((base + item.text_end) - end)); if (item.is_conversion) { if (!consumer.ConvertOne(item.conv, text)) return false; } else { if (!consumer.Append(text)) return false; } } return !has_error_; } bool has_error() const { return has_error_; } private: // Returns whether the conversions match and if !allow_ignored it verifies // that all conversions are used by the format. bool MatchesConversions( bool allow_ignored, std::initializer_list convs) const; struct ParsedFormatConsumer; struct ConversionItem { bool is_conversion; // Points to the past-the-end location of this element in the data_ array. size_t text_end; UnboundConversion conv; }; bool has_error_; std::unique_ptr data_; std::vector items_; }; // A value type representing a preparsed format. These can be created, copied // around, and reused to speed up formatting loops. // The user must specify through the template arguments the conversion // characters used in the format. This will be checked at compile time. // // This class uses Conv enum values to specify each argument. // This allows for more flexibility as you can specify multiple possible // conversion characters for each argument. // ParsedFormat is a simplified alias for when the user only // needs to specify a single conversion character for each argument. // // Example: // // Extended format supports multiple characters per argument: // using MyFormat = ExtendedParsedFormat; // MyFormat GetFormat(bool use_hex) { // if (use_hex) return MyFormat("foo %x bar"); // return MyFormat("foo %d bar"); // } // // 'format' can be used with any value that supports 'd' and 'x', // // like `int`. // auto format = GetFormat(use_hex); // value = StringF(format, i); // // This class also supports runtime format checking with the ::New() and // ::NewAllowIgnored() factory functions. // This is the only API that allows the user to pass a runtime specified format // string. These factory functions will return NULL if the format does not match // the conversions requested by the user. template class ExtendedParsedFormat : public str_format_internal::ParsedFormatBase { public: explicit ExtendedParsedFormat(string_view format) #ifdef ABSL_INTERNAL_ENABLE_FORMAT_CHECKER __attribute__(( enable_if(str_format_internal::EnsureConstexpr(format), "Format string is not constexpr."), enable_if(str_format_internal::ValidFormatImpl(format), "Format specified does not match the template arguments."))) #endif // ABSL_INTERNAL_ENABLE_FORMAT_CHECKER : ExtendedParsedFormat(format, false) { } // ExtendedParsedFormat factory function. // The user still has to specify the conversion characters, but they will not // be checked at compile time. Instead, it will be checked at runtime. // This delays the checking to runtime, but allows the user to pass // dynamically sourced formats. // It returns NULL if the format does not match the conversion characters. // The user is responsible for checking the return value before using it. // // The 'New' variant will check that all the specified arguments are being // consumed by the format and return NULL if any argument is being ignored. // The 'NewAllowIgnored' variant will not verify this and will allow formats // that ignore arguments. static std::unique_ptr New(string_view format) { return New(format, false); } static std::unique_ptr NewAllowIgnored( string_view format) { return New(format, true); } private: static std::unique_ptr New(string_view format, bool allow_ignored) { std::unique_ptr conv( new ExtendedParsedFormat(format, allow_ignored)); if (conv->has_error()) return nullptr; return conv; } ExtendedParsedFormat(string_view s, bool allow_ignored) : ParsedFormatBase(s, allow_ignored, {C...}) {} }; } // namespace str_format_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_STR_FORMAT_PARSER_H_ * nsoong/.intermediates/external/abseil-cpp/absl_base_core_headers_hdrs/gen/my_include_dir/absl/base/const_init.h// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // kConstInit // ----------------------------------------------------------------------------- // // A constructor tag used to mark an object as safe for use as a global // variable, avoiding the usual lifetime issues that can affect globals. #ifndef ABSL_BASE_CONST_INIT_H_ #define ABSL_BASE_CONST_INIT_H_ #include "absl/base/config.h" // In general, objects with static storage duration (such as global variables) // can trigger tricky object lifetime situations. Attempting to access them // from the constructors or destructors of other global objects can result in // undefined behavior, unless their constructors and destructors are designed // with this issue in mind. // // The normal way to deal with this issue in C++11 is to use constant // initialization and trivial destructors. // // Constant initialization is guaranteed to occur before any other code // executes. Constructors that are declared 'constexpr' are eligible for // constant initialization. You can annotate a variable declaration with the // ABSL_CONST_INIT macro to express this intent. For compilers that support // it, this annotation will cause a compilation error for declarations that // aren't subject to constant initialization (perhaps because a runtime value // was passed as a constructor argument). // // On program shutdown, lifetime issues can be avoided on global objects by // ensuring that they contain trivial destructors. A class has a trivial // destructor unless it has a user-defined destructor, a virtual method or base // class, or a data member or base class with a non-trivial destructor of its // own. Objects with static storage duration and a trivial destructor are not // cleaned up on program shutdown, and are thus safe to access from other code // running during shutdown. // // For a few core Abseil classes, we make a best effort to allow for safe global // instances, even though these classes have non-trivial destructors. These // objects can be created with the absl::kConstInit tag. For example: // ABSL_CONST_INIT absl::Mutex global_mutex(absl::kConstInit); // // The line above declares a global variable of type absl::Mutex which can be // accessed at any point during startup or shutdown. global_mutex's destructor // will still run, but will not invalidate the object. Note that C++ specifies // that accessing an object after its destructor has run results in undefined // behavior, but this pattern works on the toolchains we support. // // The absl::kConstInit tag should only be used to define objects with static // or thread_local storage duration. namespace absl { ABSL_NAMESPACE_BEGIN enum ConstInitType { kConstInit, }; ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_BASE_CONST_INIT_H_ *k soong/.intermediates/external/abseil-cpp/absl_strings_str_format_internal_hdrs/gen/my_include_dir/absl/strings/internal/str_format/constexpr_parser.hj// Copyright 2022 The Abseil Authors // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #ifndef ABSL_STRINGS_INTERNAL_STR_FORMAT_CONSTEXPR_PARSER_H_ #define ABSL_STRINGS_INTERNAL_STR_FORMAT_CONSTEXPR_PARSER_H_ #include #include #include #include #include "absl/base/config.h" #include "absl/base/const_init.h" #include "absl/base/optimization.h" #include "absl/strings/internal/str_format/extension.h" namespace absl { ABSL_NAMESPACE_BEGIN namespace str_format_internal { // The analyzed properties of a single specified conversion. struct UnboundConversion { // This is a user defined default constructor on purpose to skip the // initialization of parts of the object that are not necessary. UnboundConversion() {} // NOLINT // This constructor is provided for the static checker. We don't want to do // the unnecessary initialization in the normal case. explicit constexpr UnboundConversion(absl::ConstInitType) : arg_position{}, width{}, precision{} {} class InputValue { public: constexpr void set_value(int value) { assert(value >= 0); value_ = value; } constexpr int value() const { return value_; } // Marks the value as "from arg". aka the '*' format. // Requires `value >= 1`. // When set, is_from_arg() return true and get_from_arg() returns the // original value. // `value()`'s return value is unspecified in this state. constexpr void set_from_arg(int value) { assert(value > 0); value_ = -value - 1; } constexpr bool is_from_arg() const { return value_ < -1; } constexpr int get_from_arg() const { assert(is_from_arg()); return -value_ - 1; } private: int value_ = -1; }; // No need to initialize. It will always be set in the parser. int arg_position; InputValue width; InputValue precision; Flags flags = Flags::kBasic; LengthMod length_mod = LengthMod::none; FormatConversionChar conv = FormatConversionCharInternal::kNone; }; // Helper tag class for the table below. // It allows fast `char -> ConversionChar/LengthMod/Flags` checking and // conversions. class ConvTag { public: constexpr ConvTag(FormatConversionChar conversion_char) // NOLINT : tag_(static_cast(conversion_char)) {} constexpr ConvTag(LengthMod length_mod) // NOLINT : tag_(0x80 | static_cast(length_mod)) {} constexpr ConvTag(Flags flags) // NOLINT : tag_(0xc0 | static_cast(flags)) {} constexpr ConvTag() : tag_(0xFF) {} constexpr bool is_conv() const { return (tag_ & 0x80) == 0; } constexpr bool is_length() const { return (tag_ & 0xC0) == 0x80; } constexpr bool is_flags() const { return (tag_ & 0xE0) == 0xC0; } constexpr FormatConversionChar as_conv() const { assert(is_conv()); assert(!is_length()); assert(!is_flags()); return static_cast(tag_); } constexpr LengthMod as_length() const { assert(!is_conv()); assert(is_length()); assert(!is_flags()); return static_cast(tag_ & 0x3F); } constexpr Flags as_flags() const { assert(!is_conv()); assert(!is_length()); assert(is_flags()); return static_cast(tag_ & 0x1F); } private: uint8_t tag_; }; struct ConvTagHolder { using CC = FormatConversionCharInternal; using LM = LengthMod; // Abbreviations to fit in the table below. static constexpr auto kFSign = Flags::kSignCol; static constexpr auto kFAlt = Flags::kAlt; static constexpr auto kFPos = Flags::kShowPos; static constexpr auto kFLeft = Flags::kLeft; static constexpr auto kFZero = Flags::kZero; static constexpr ConvTag value[256] = { {}, {}, {}, {}, {}, {}, {}, {}, // 00-07 {}, {}, {}, {}, {}, {}, {}, {}, // 08-0f {}, {}, {}, {}, {}, {}, {}, {}, // 10-17 {}, {}, {}, {}, {}, {}, {}, {}, // 18-1f kFSign, {}, {}, kFAlt, {}, {}, {}, {}, // !"#$%&' {}, {}, {}, kFPos, {}, kFLeft, {}, {}, // ()*+,-./ kFZero, {}, {}, {}, {}, {}, {}, {}, // 01234567 {}, {}, {}, {}, {}, {}, {}, {}, // 89:;<=>? {}, CC::A, {}, {}, {}, CC::E, CC::F, CC::G, // @ABCDEFG {}, {}, {}, {}, LM::L, {}, {}, {}, // HIJKLMNO {}, {}, {}, {}, {}, {}, {}, {}, // PQRSTUVW CC::X, {}, {}, {}, {}, {}, {}, {}, // XYZ[\]^_ {}, CC::a, {}, CC::c, CC::d, CC::e, CC::f, CC::g, // `abcdefg LM::h, CC::i, LM::j, {}, LM::l, {}, CC::n, CC::o, // hijklmno CC::p, LM::q, {}, CC::s, LM::t, CC::u, CC::v, {}, // pqrstuvw CC::x, {}, LM::z, {}, {}, {}, {}, {}, // xyz{|}! {}, {}, {}, {}, {}, {}, {}, {}, // 80-87 {}, {}, {}, {}, {}, {}, {}, {}, // 88-8f {}, {}, {}, {}, {}, {}, {}, {}, // 90-97 {}, {}, {}, {}, {}, {}, {}, {}, // 98-9f {}, {}, {}, {}, {}, {}, {}, {}, // a0-a7 {}, {}, {}, {}, {}, {}, {}, {}, // a8-af {}, {}, {}, {}, {}, {}, {}, {}, // b0-b7 {}, {}, {}, {}, {}, {}, {}, {}, // b8-bf {}, {}, {}, {}, {}, {}, {}, {}, // c0-c7 {}, {}, {}, {}, {}, {}, {}, {}, // c8-cf {}, {}, {}, {}, {}, {}, {}, {}, // d0-d7 {}, {}, {}, {}, {}, {}, {}, {}, // d8-df {}, {}, {}, {}, {}, {}, {}, {}, // e0-e7 {}, {}, {}, {}, {}, {}, {}, {}, // e8-ef {}, {}, {}, {}, {}, {}, {}, {}, // f0-f7 {}, {}, {}, {}, {}, {}, {}, {}, // f8-ff }; }; // Keep a single table for all the conversion chars and length modifiers. constexpr ConvTag GetTagForChar(char c) { return ConvTagHolder::value[static_cast(c)]; } constexpr bool CheckFastPathSetting(const UnboundConversion& conv) { bool width_precision_needed = conv.width.value() >= 0 || conv.precision.value() >= 0; if (width_precision_needed && conv.flags == Flags::kBasic) { #if defined(__clang__) // Some compilers complain about this in constexpr even when not executed, // so only enable the error dump in clang. fprintf(stderr, "basic=%d left=%d show_pos=%d sign_col=%d alt=%d zero=%d " "width=%d precision=%d\n", conv.flags == Flags::kBasic ? 1 : 0, FlagsContains(conv.flags, Flags::kLeft) ? 1 : 0, FlagsContains(conv.flags, Flags::kShowPos) ? 1 : 0, FlagsContains(conv.flags, Flags::kSignCol) ? 1 : 0, FlagsContains(conv.flags, Flags::kAlt) ? 1 : 0, FlagsContains(conv.flags, Flags::kZero) ? 1 : 0, conv.width.value(), conv.precision.value()); #endif // defined(__clang__) return false; } return true; } constexpr int ParseDigits(char& c, const char*& pos, const char* const end) { int digits = c - '0'; // We do not want to overflow `digits` so we consume at most digits10 // digits. If there are more digits the parsing will fail later on when the // digit doesn't match the expected characters. int num_digits = std::numeric_limits::digits10; for (;;) { if (ABSL_PREDICT_FALSE(pos == end)) break; c = *pos++; if ('0' > c || c > '9') break; --num_digits; if (ABSL_PREDICT_FALSE(!num_digits)) break; digits = 10 * digits + c - '0'; } return digits; } template constexpr const char* ConsumeConversion(const char* pos, const char* const end, UnboundConversion* conv, int* next_arg) { const char* const original_pos = pos; char c = 0; // Read the next char into `c` and update `pos`. Returns false if there are // no more chars to read. #define ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR() \ do { \ if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \ c = *pos++; \ } while (0) if (is_positional) { ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); if (ABSL_PREDICT_FALSE(c < '1' || c > '9')) return nullptr; conv->arg_position = ParseDigits(c, pos, end); assert(conv->arg_position > 0); if (ABSL_PREDICT_FALSE(c != '$')) return nullptr; } ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); // We should start with the basic flag on. assert(conv->flags == Flags::kBasic); // Any non alpha character makes this conversion not basic. // This includes flags (-+ #0), width (1-9, *) or precision (.). // All conversion characters and length modifiers are alpha characters. if (c < 'A') { while (c <= '0') { auto tag = GetTagForChar(c); if (tag.is_flags()) { conv->flags = conv->flags | tag.as_flags(); ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); } else { break; } } if (c <= '9') { if (c >= '0') { int maybe_width = ParseDigits(c, pos, end); if (!is_positional && c == '$') { if (ABSL_PREDICT_FALSE(*next_arg != 0)) return nullptr; // Positional conversion. *next_arg = -1; return ConsumeConversion(original_pos, end, conv, next_arg); } conv->flags = conv->flags | Flags::kNonBasic; conv->width.set_value(maybe_width); } else if (c == '*') { conv->flags = conv->flags | Flags::kNonBasic; ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); if (is_positional) { if (ABSL_PREDICT_FALSE(c < '1' || c > '9')) return nullptr; conv->width.set_from_arg(ParseDigits(c, pos, end)); if (ABSL_PREDICT_FALSE(c != '$')) return nullptr; ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); } else { conv->width.set_from_arg(++*next_arg); } } } if (c == '.') { conv->flags = conv->flags | Flags::kNonBasic; ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); if ('0' <= c && c <= '9') { conv->precision.set_value(ParseDigits(c, pos, end)); } else if (c == '*') { ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); if (is_positional) { if (ABSL_PREDICT_FALSE(c < '1' || c > '9')) return nullptr; conv->precision.set_from_arg(ParseDigits(c, pos, end)); if (c != '$') return nullptr; ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); } else { conv->precision.set_from_arg(++*next_arg); } } else { conv->precision.set_value(0); } } } auto tag = GetTagForChar(c); if (ABSL_PREDICT_FALSE(c == 'v' && conv->flags != Flags::kBasic)) { return nullptr; } if (ABSL_PREDICT_FALSE(!tag.is_conv())) { if (ABSL_PREDICT_FALSE(!tag.is_length())) return nullptr; // It is a length modifier. LengthMod length_mod = tag.as_length(); ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); if (c == 'h' && length_mod == LengthMod::h) { conv->length_mod = LengthMod::hh; ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); } else if (c == 'l' && length_mod == LengthMod::l) { conv->length_mod = LengthMod::ll; ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR(); } else { conv->length_mod = length_mod; } tag = GetTagForChar(c); if (ABSL_PREDICT_FALSE(c == 'v')) return nullptr; if (ABSL_PREDICT_FALSE(!tag.is_conv())) return nullptr; // `wchar_t` args are marked non-basic so `Bind()` will copy the length mod. if (conv->length_mod == LengthMod::l && c == 'c') { conv->flags = conv->flags | Flags::kNonBasic; } } #undef ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR assert(CheckFastPathSetting(*conv)); (void)(&CheckFastPathSetting); conv->conv = tag.as_conv(); if (!is_positional) conv->arg_position = ++*next_arg; return pos; } // Consume conversion spec prefix (not including '%') of [p, end) if valid. // Examples of valid specs would be e.g.: "s", "d", "-12.6f". // If valid, it returns the first character following the conversion spec, // and the spec part is broken down and returned in 'conv'. // If invalid, returns nullptr. constexpr const char* ConsumeUnboundConversion(const char* p, const char* end, UnboundConversion* conv, int* next_arg) { if (*next_arg < 0) return ConsumeConversion(p, end, conv, next_arg); return ConsumeConversion(p, end, conv, next_arg); } } // namespace str_format_internal ABSL_NAMESPACE_END } // namespace absl #endif // ABSL_STRINGS_INTERNAL_STR_FORMAT_CONSTEXPR_PARSER_H_ *Y asoong/.intermediates/external/abseil-cpp/absl_memory_hdrs/gen/my_include_dir/absl/memory/memory.hX// Copyright 2017 The Abseil Authors. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // https://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // ----------------------------------------------------------------------------- // File: memory.h // ----------------------------------------------------------------------------- // // This header file contains utility functions for managing the creation and // conversion of smart pointers. This file is an extension to the C++ // standard library header file. #ifndef ABSL_MEMORY_MEMORY_H_ #define ABSL_MEMORY_MEMORY_H_ #include #include #include #include #include #include #include "absl/base/macros.h" #include "absl/meta/type_traits.h" namespace absl { ABSL_NAMESPACE_BEGIN // ----------------------------------------------------------------------------- // Function Template: WrapUnique() // ----------------------------------------------------------------------------- // // Adopts ownership from a raw pointer and transfers it to the returned // `std::unique_ptr`, whose type is deduced. Because of this deduction, *do not* // specify the template type `T` when calling `WrapUnique`. // // Example: // X* NewX(int, int); // auto x = WrapUnique(NewX(1, 2)); // 'x' is std::unique_ptr. // // Do not call WrapUnique with an explicit type, as in // `WrapUnique(NewX(1, 2))`. The purpose of WrapUnique is to automatically // deduce the pointer type. If you wish to make the type explicit, just use // `std::unique_ptr` directly. // // auto x = std::unique_ptr(NewX(1, 2)); // - or - // std::unique_ptr x(NewX(1, 2)); // // While `absl::WrapUnique` is useful for capturing the output of a raw // pointer factory, prefer 'absl::make_unique(args...)' over // 'absl::WrapUnique(new T(args...))'. // // auto x = WrapUnique(new X(1, 2)); // works, but nonideal. // auto x = make_unique(1, 2); // safer, standard, avoids raw 'new'. // // Note that `absl::WrapUnique(p)` is valid only if `delete p` is a valid // expression. In particular, `absl::WrapUnique()` cannot wrap pointers to // arrays, functions or void, and it must not be used to capture pointers // obtained from array-new expressions (even though that would compile!). template std::unique_ptr WrapUnique(T* ptr) { static_assert(!std::is_array::value, "array types are unsupported"); static_assert(std::is_object::value, "non-object types are unsupported"); return std::unique_ptr(ptr); } // ----------------------------------------------------------------------------- // Function Template: make_unique() // ----------------------------------------------------------------------------- // // Creates a `std::unique_ptr<>`, while avoiding issues creating temporaries // during the construction process. `absl::make_unique<>` also avoids redundant // type declarations, by avoiding the need to explicitly use the `new` operator. // // https://en.cppreference.com/w/cpp/memory/unique_ptr/make_unique // // For more background on why `std::unique_ptr(new T(a,b))` is problematic, // see Herb Sutter's explanation on // (Exception-Safe Function Calls)[https://herbsutter.com/gotw/_102/]. // (In general, reviewers should treat `new T(a,b)` with scrutiny.) // // Historical note: Abseil once provided a C++11 compatible implementation of // the C++14's `std::make_unique`. Now that C++11 support has been sunsetted, // `absl::make_unique` simply uses the STL-provided implementation. New code // should use `std::make_unique`. using std::make_unique; // ----------------------------------------------------------------------------- // Function Template: RawPtr() // ----------------------------------------------------------------------------- // // Extracts the raw pointer from a pointer-like value `ptr`. `absl::RawPtr` is // useful within templates that need to handle a complement of raw pointers, // `std::nullptr_t`, and smart pointers. template auto RawPtr(T&& ptr) -> decltype(std::addressof(*ptr)) { // ptr is a forwarding reference to support Ts with non-const operators. return (ptr != nullptr) ? std::addressof(*ptr) : nullptr; } inline std::nullptr_t RawPtr(std::nullptr_t) { return nullptr; } // ----------------------------------------------------------------------------- // Function Template: ShareUniquePtr() // ----------------------------------------------------------------------------- // // Adopts a `std::unique_ptr` rvalue and returns a `std::shared_ptr` of deduced // type. Ownership (if any) of the held value is transferred to the returned // shared pointer. // // Example: // // auto up = absl::make_unique(10); // auto sp = absl::ShareUniquePtr(std::move(up)); // shared_ptr // CHECK_EQ(*sp, 10); // CHECK(up == nullptr); // // Note that this conversion is correct even when T is an array type, and more // generally it works for *any* deleter of the `unique_ptr` (single-object // deleter, array deleter, or any custom deleter), since the deleter is adopted // by the shared pointer as well. The deleter is copied (unless it is a // reference). // // Implements the resolution of [LWG 2415](http://wg21.link/lwg2415), by which a // null shared pointer does not attempt to call the deleter. template std::shared_ptr ShareUniquePtr(std::unique_ptr&& ptr) { return ptr ? std::shared_ptr(std::move(ptr)) : std::shared_ptr(); } // ----------------------------------------------------------------------------- // Function Template: WeakenPtr() // ----------------------------------------------------------------------------- // // Creates a weak pointer associated with a given shared pointer. The returned // value is a `std::weak_ptr` of deduced type. // // Example: // // auto sp = std::make_shared(10); // auto wp = absl::WeakenPtr(sp); // CHECK_EQ(sp.get(), wp.lock().get()); // sp.reset(); // CHECK(wp.lock() == nullptr); // template std::weak_ptr WeakenPtr(const std::shared_ptr& ptr) { return std::weak_ptr(ptr); } // ----------------------------------------------------------------------------- // Class Template: pointer_traits // ----------------------------------------------------------------------------- // // Historical note: Abseil once provided an implementation of // `std::pointer_traits` for platforms that had not yet provided it. Those // platforms are no longer supported. New code should simply use // `std::pointer_traits`. using std::pointer_traits; // ----------------------------------------------------------------------------- // Class Template: allocator_traits // ----------------------------------------------------------------------------- // // Historical note: Abseil once provided an implementation of // `std::allocator_traits` for platforms that had not yet provided it. Those // platforms are no longer supported. New code should simply use // `std::allocator_traits`. using std::allocator_traits; namespace memory_internal { // ExtractOr::type evaluates to E if possible. Otherwise, D. template