grpc 1.31.0.pre2 → 1.34.0

Sign up to get free protection for your applications and to get access to all the features.

Potentially problematic release.


This version of grpc might be problematic. Click here for more details.

Files changed (944) hide show
  1. checksums.yaml +4 -4
  2. data/Makefile +1030 -16151
  3. data/include/grpc/grpc.h +1 -7
  4. data/include/grpc/grpc_security.h +196 -186
  5. data/include/grpc/impl/codegen/README.md +22 -0
  6. data/include/grpc/impl/codegen/grpc_types.h +9 -7
  7. data/include/grpc/impl/codegen/port_platform.h +28 -56
  8. data/src/core/ext/filters/client_channel/backup_poller.cc +3 -2
  9. data/src/core/ext/filters/client_channel/client_channel.cc +243 -188
  10. data/src/core/ext/filters/client_channel/client_channel.h +1 -1
  11. data/src/core/ext/filters/client_channel/client_channel_channelz.h +0 -3
  12. data/src/core/ext/filters/client_channel/config_selector.cc +0 -4
  13. data/src/core/ext/filters/client_channel/config_selector.h +36 -8
  14. data/src/core/ext/filters/client_channel/health/health_check_client.cc +10 -2
  15. data/src/core/ext/filters/client_channel/health/health_check_client.h +2 -2
  16. data/src/core/ext/filters/client_channel/http_connect_handshaker.cc +3 -4
  17. data/src/core/ext/filters/client_channel/lb_policy.cc +5 -1
  18. data/src/core/ext/filters/client_channel/lb_policy.h +6 -4
  19. data/src/core/ext/filters/client_channel/lb_policy/address_filtering.cc +48 -35
  20. data/src/core/ext/filters/client_channel/lb_policy/address_filtering.h +7 -5
  21. data/src/core/ext/filters/client_channel/lb_policy/child_policy_handler.cc +10 -7
  22. data/src/core/ext/filters/client_channel/lb_policy/child_policy_handler.h +1 -1
  23. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb.cc +178 -162
  24. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_balancer_addresses.cc +0 -13
  25. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_balancer_addresses.h +0 -3
  26. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_channel_secure.cc +1 -37
  27. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_client_stats.cc +3 -1
  28. data/src/core/ext/filters/client_channel/lb_policy/pick_first/pick_first.cc +23 -17
  29. data/src/core/ext/filters/client_channel/lb_policy/priority/priority.cc +79 -30
  30. data/src/core/ext/filters/client_channel/lb_policy/round_robin/round_robin.cc +10 -9
  31. data/src/core/ext/filters/client_channel/lb_policy/subchannel_list.h +14 -34
  32. data/src/core/ext/filters/client_channel/lb_policy/weighted_target/weighted_target.cc +26 -15
  33. data/src/core/ext/filters/client_channel/lb_policy/xds/cds.cc +208 -130
  34. data/src/core/ext/filters/client_channel/lb_policy/xds/eds.cc +299 -328
  35. data/src/core/ext/filters/client_channel/lb_policy/xds/xds.h +53 -17
  36. data/src/core/ext/filters/client_channel/lb_policy/xds/xds_cluster_impl.cc +809 -0
  37. data/src/core/ext/filters/client_channel/lb_policy/xds/xds_cluster_manager.cc +722 -0
  38. data/src/core/ext/filters/client_channel/lb_policy_registry.cc +8 -1
  39. data/src/core/ext/filters/client_channel/resolver.cc +3 -1
  40. data/src/core/ext/filters/client_channel/resolver.h +4 -1
  41. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/dns_resolver_ares.cc +2 -2
  42. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_ev_driver_posix.cc +1 -1
  43. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper.cc +3 -3
  44. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper_libuv.cc +1 -1
  45. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper_windows.cc +1 -1
  46. data/src/core/ext/filters/client_channel/resolver/dns/native/dns_resolver.cc +1 -1
  47. data/src/core/ext/filters/client_channel/resolver/fake/fake_resolver.cc +2 -2
  48. data/src/core/ext/filters/client_channel/resolver/fake/fake_resolver.h +1 -1
  49. data/src/core/ext/filters/client_channel/resolver/sockaddr/sockaddr_resolver.cc +21 -1
  50. data/src/core/ext/filters/client_channel/resolver/xds/xds_resolver.cc +661 -58
  51. data/src/core/ext/filters/client_channel/resolver/xds/xds_resolver.h +28 -0
  52. data/src/core/ext/filters/client_channel/resolver_registry.cc +4 -4
  53. data/src/core/ext/filters/client_channel/resolver_result_parsing.cc +18 -61
  54. data/src/core/ext/filters/client_channel/resolver_result_parsing.h +4 -3
  55. data/src/core/ext/filters/client_channel/resolving_lb_policy.cc +50 -48
  56. data/src/core/ext/filters/client_channel/resolving_lb_policy.h +7 -11
  57. data/src/core/ext/filters/client_channel/retry_throttle.h +1 -1
  58. data/src/core/ext/filters/client_channel/server_address.cc +120 -7
  59. data/src/core/ext/filters/client_channel/server_address.h +44 -21
  60. data/src/core/ext/filters/client_channel/service_config.cc +18 -13
  61. data/src/core/ext/filters/client_channel/service_config.h +8 -5
  62. data/src/core/ext/filters/client_channel/service_config_channel_arg_filter.cc +2 -2
  63. data/src/core/ext/filters/client_channel/service_config_parser.cc +8 -6
  64. data/src/core/ext/filters/client_channel/service_config_parser.h +8 -5
  65. data/src/core/ext/filters/client_channel/subchannel.cc +82 -38
  66. data/src/core/ext/filters/client_channel/subchannel.h +18 -6
  67. data/src/core/ext/filters/client_channel/subchannel_interface.h +41 -5
  68. data/src/core/ext/filters/client_channel/subchannel_pool_interface.h +6 -2
  69. data/src/core/ext/filters/deadline/deadline_filter.cc +83 -77
  70. data/src/core/ext/filters/deadline/deadline_filter.h +7 -11
  71. data/src/core/ext/filters/http/client/http_client_filter.cc +1 -1
  72. data/src/core/ext/filters/http/server/http_server_filter.cc +3 -3
  73. data/src/core/ext/filters/max_age/max_age_filter.cc +3 -2
  74. data/src/core/ext/filters/message_size/message_size_filter.cc +2 -1
  75. data/src/core/ext/filters/message_size/message_size_filter.h +2 -1
  76. data/src/core/ext/transport/chttp2/client/chttp2_connector.cc +87 -31
  77. data/src/core/ext/transport/chttp2/client/chttp2_connector.h +19 -2
  78. data/src/core/ext/transport/chttp2/client/secure/secure_channel_create.cc +10 -35
  79. data/src/core/ext/transport/chttp2/server/chttp2_server.cc +36 -28
  80. data/src/core/ext/transport/chttp2/server/chttp2_server.h +2 -1
  81. data/src/core/ext/transport/chttp2/server/insecure/server_chttp2.cc +2 -2
  82. data/src/core/ext/transport/chttp2/server/insecure/server_chttp2_posix.cc +6 -6
  83. data/src/core/ext/transport/chttp2/server/secure/server_secure_chttp2.cc +3 -2
  84. data/src/core/ext/transport/chttp2/transport/bin_decoder.cc +7 -7
  85. data/src/core/ext/transport/chttp2/transport/chttp2_transport.cc +260 -311
  86. data/src/core/ext/transport/chttp2/transport/flow_control.cc +11 -3
  87. data/src/core/ext/transport/chttp2/transport/flow_control.h +12 -2
  88. data/src/core/ext/transport/chttp2/transport/frame_goaway.cc +2 -1
  89. data/src/core/ext/transport/chttp2/transport/frame_settings.cc +2 -2
  90. data/src/core/ext/transport/chttp2/transport/hpack_parser.cc +12 -8
  91. data/src/core/ext/transport/chttp2/transport/internal.h +10 -2
  92. data/src/core/ext/transport/chttp2/transport/parsing.cc +19 -31
  93. data/src/core/ext/transport/chttp2/transport/writing.cc +7 -7
  94. data/src/core/ext/transport/inproc/inproc_transport.cc +12 -12
  95. data/src/core/ext/upb-generated/envoy/config/accesslog/v3/accesslog.upb.c +244 -0
  96. data/src/core/ext/upb-generated/envoy/config/accesslog/v3/accesslog.upb.h +766 -0
  97. data/src/core/ext/upb-generated/envoy/config/cluster/v3/circuit_breaker.upb.c +74 -0
  98. data/src/core/ext/upb-generated/envoy/config/cluster/v3/circuit_breaker.upb.h +226 -0
  99. data/src/core/ext/upb-generated/envoy/config/cluster/v3/cluster.upb.c +458 -0
  100. data/src/core/ext/upb-generated/envoy/config/cluster/v3/cluster.upb.h +1635 -0
  101. data/src/core/ext/upb-generated/envoy/{api/v2/cluster → config/cluster/v3}/filter.upb.c +8 -8
  102. data/src/core/ext/upb-generated/envoy/config/cluster/v3/filter.upb.h +69 -0
  103. data/src/core/ext/upb-generated/envoy/{api/v2/cluster → config/cluster/v3}/outlier_detection.upb.c +8 -8
  104. data/src/core/ext/upb-generated/envoy/config/cluster/v3/outlier_detection.upb.h +323 -0
  105. data/src/core/ext/upb-generated/envoy/config/core/v3/address.upb.c +124 -0
  106. data/src/core/ext/upb-generated/envoy/config/core/v3/address.upb.h +379 -0
  107. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/backoff.upb.c +8 -8
  108. data/src/core/ext/upb-generated/envoy/config/core/v3/backoff.upb.h +79 -0
  109. data/src/core/ext/upb-generated/envoy/config/core/v3/base.upb.c +310 -0
  110. data/src/core/ext/upb-generated/envoy/config/core/v3/base.upb.h +869 -0
  111. data/src/core/ext/upb-generated/envoy/config/core/v3/config_source.upb.c +103 -0
  112. data/src/core/ext/upb-generated/envoy/config/core/v3/config_source.upb.h +351 -0
  113. data/src/core/ext/upb-generated/envoy/config/core/v3/event_service_config.upb.c +34 -0
  114. data/src/core/ext/upb-generated/envoy/config/core/v3/event_service_config.upb.h +71 -0
  115. data/src/core/ext/upb-generated/envoy/config/core/v3/extension.upb.c +53 -0
  116. data/src/core/ext/upb-generated/envoy/config/core/v3/extension.upb.h +133 -0
  117. data/src/core/ext/upb-generated/envoy/config/core/v3/grpc_service.upb.c +241 -0
  118. data/src/core/ext/upb-generated/envoy/config/core/v3/grpc_service.upb.h +752 -0
  119. data/src/core/ext/upb-generated/envoy/config/core/v3/health_check.upb.c +170 -0
  120. data/src/core/ext/upb-generated/envoy/config/core/v3/health_check.upb.h +684 -0
  121. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/http_uri.upb.c +8 -8
  122. data/src/core/ext/upb-generated/envoy/config/core/v3/http_uri.upb.h +80 -0
  123. data/src/core/ext/upb-generated/envoy/config/core/v3/protocol.upb.c +176 -0
  124. data/src/core/ext/upb-generated/envoy/config/core/v3/protocol.upb.h +645 -0
  125. data/src/core/ext/upb-generated/envoy/config/core/v3/proxy_protocol.upb.c +28 -0
  126. data/src/core/ext/upb-generated/envoy/config/core/v3/proxy_protocol.upb.h +58 -0
  127. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/socket_option.upb.c +6 -6
  128. data/src/core/ext/upb-generated/envoy/config/core/v3/socket_option.upb.h +88 -0
  129. data/src/core/ext/upb-generated/envoy/config/core/v3/substitution_format_string.upb.c +36 -0
  130. data/src/core/ext/upb-generated/envoy/config/core/v3/substitution_format_string.upb.h +85 -0
  131. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint.upb.c +91 -0
  132. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint.upb.h +220 -0
  133. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint_components.upb.c +91 -0
  134. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint_components.upb.h +273 -0
  135. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/load_report.upb.c +112 -0
  136. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/load_report.upb.h +332 -0
  137. data/src/core/ext/upb-generated/envoy/config/listener/{v2 → v3}/api_listener.upb.c +8 -8
  138. data/src/core/ext/upb-generated/envoy/config/listener/v3/api_listener.upb.h +65 -0
  139. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener.upb.c +128 -0
  140. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener.upb.h +467 -0
  141. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener_components.upb.c +155 -0
  142. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener_components.upb.h +539 -0
  143. data/src/core/ext/upb-generated/envoy/config/listener/v3/udp_listener_config.upb.c +41 -0
  144. data/src/core/ext/upb-generated/envoy/config/listener/v3/udp_listener_config.upb.h +94 -0
  145. data/src/core/ext/upb-generated/envoy/config/rbac/v3/rbac.upb.c +178 -0
  146. data/src/core/ext/upb-generated/envoy/config/rbac/v3/rbac.upb.h +616 -0
  147. data/src/core/ext/upb-generated/envoy/config/route/v3/route.upb.c +63 -0
  148. data/src/core/ext/upb-generated/envoy/config/route/v3/route.upb.h +204 -0
  149. data/src/core/ext/upb-generated/envoy/config/route/v3/route_components.upb.c +900 -0
  150. data/src/core/ext/upb-generated/envoy/config/route/v3/route_components.upb.h +3290 -0
  151. data/src/core/ext/upb-generated/envoy/config/route/v3/scoped_route.upb.c +60 -0
  152. data/src/core/ext/upb-generated/envoy/config/route/v3/scoped_route.upb.h +139 -0
  153. data/src/core/ext/upb-generated/envoy/config/trace/v3/http_tracer.upb.c +50 -0
  154. data/src/core/ext/upb-generated/envoy/config/trace/v3/http_tracer.upb.h +108 -0
  155. data/src/core/ext/upb-generated/envoy/extensions/filters/network/http_connection_manager/v3/http_connection_manager.upb.c +364 -0
  156. data/src/core/ext/upb-generated/envoy/extensions/filters/network/http_connection_manager/v3/http_connection_manager.upb.h +1336 -0
  157. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/cert.upb.c +20 -0
  158. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/cert.upb.h +34 -0
  159. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/common.upb.c +110 -0
  160. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/common.upb.h +387 -0
  161. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/secret.upb.c +76 -0
  162. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/secret.upb.h +214 -0
  163. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/tls.upb.c +147 -0
  164. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/tls.upb.h +570 -0
  165. data/src/core/ext/upb-generated/envoy/{api/v2 → service/cluster/v3}/cds.upb.c +5 -6
  166. data/src/core/ext/upb-generated/envoy/service/cluster/v3/cds.upb.h +49 -0
  167. data/src/core/ext/upb-generated/envoy/service/discovery/{v2 → v3}/ads.upb.c +5 -4
  168. data/src/core/ext/upb-generated/envoy/service/discovery/v3/ads.upb.h +49 -0
  169. data/src/core/ext/upb-generated/envoy/service/discovery/v3/discovery.upb.c +139 -0
  170. data/src/core/ext/upb-generated/envoy/service/discovery/v3/discovery.upb.h +449 -0
  171. data/src/core/ext/upb-generated/envoy/{api/v2 → service/endpoint/v3}/eds.upb.c +5 -6
  172. data/src/core/ext/upb-generated/envoy/service/endpoint/v3/eds.upb.h +49 -0
  173. data/src/core/ext/upb-generated/envoy/{api/v2 → service/listener/v3}/lds.upb.c +5 -6
  174. data/src/core/ext/upb-generated/envoy/service/listener/v3/lds.upb.h +49 -0
  175. data/src/core/ext/upb-generated/envoy/service/load_stats/v3/lrs.upb.c +55 -0
  176. data/src/core/ext/upb-generated/envoy/service/load_stats/v3/lrs.upb.h +136 -0
  177. data/src/core/ext/upb-generated/envoy/{api/v2 → service/route/v3}/rds.upb.c +5 -6
  178. data/src/core/ext/upb-generated/envoy/service/route/v3/rds.upb.h +49 -0
  179. data/src/core/ext/upb-generated/envoy/{api/v2 → service/route/v3}/srds.upb.c +5 -6
  180. data/src/core/ext/upb-generated/envoy/service/route/v3/srds.upb.h +49 -0
  181. data/src/core/ext/upb-generated/envoy/type/matcher/v3/metadata.upb.c +47 -0
  182. data/src/core/ext/upb-generated/envoy/type/matcher/v3/metadata.upb.h +114 -0
  183. data/src/core/ext/upb-generated/envoy/type/matcher/v3/number.upb.c +35 -0
  184. data/src/core/ext/upb-generated/envoy/type/matcher/v3/number.upb.h +77 -0
  185. data/src/core/ext/upb-generated/envoy/type/matcher/v3/path.upb.c +34 -0
  186. data/src/core/ext/upb-generated/envoy/type/matcher/v3/path.upb.h +71 -0
  187. data/src/core/ext/upb-generated/envoy/type/matcher/v3/regex.upb.c +64 -0
  188. data/src/core/ext/upb-generated/envoy/type/matcher/v3/regex.upb.h +145 -0
  189. data/src/core/ext/upb-generated/envoy/type/matcher/v3/string.upb.c +54 -0
  190. data/src/core/ext/upb-generated/envoy/type/matcher/v3/string.upb.h +133 -0
  191. data/src/core/ext/upb-generated/envoy/type/matcher/v3/value.upb.c +63 -0
  192. data/src/core/ext/upb-generated/envoy/type/matcher/v3/value.upb.h +188 -0
  193. data/src/core/ext/upb-generated/envoy/type/metadata/v3/metadata.upb.c +88 -0
  194. data/src/core/ext/upb-generated/envoy/type/metadata/v3/metadata.upb.h +258 -0
  195. data/src/core/ext/upb-generated/envoy/type/tracing/v3/custom_tag.upb.c +90 -0
  196. data/src/core/ext/upb-generated/envoy/type/tracing/v3/custom_tag.upb.h +250 -0
  197. data/src/core/ext/upb-generated/envoy/type/{http.upb.c → v3/http.upb.c} +2 -2
  198. data/src/core/ext/upb-generated/envoy/type/{http.upb.h → v3/http.upb.h} +8 -8
  199. data/src/core/ext/upb-generated/envoy/type/{percent.upb.c → v3/percent.upb.c} +9 -8
  200. data/src/core/ext/upb-generated/envoy/type/v3/percent.upb.h +86 -0
  201. data/src/core/ext/upb-generated/envoy/type/{range.upb.c → v3/range.upb.c} +12 -11
  202. data/src/core/ext/upb-generated/envoy/type/v3/range.upb.h +111 -0
  203. data/src/core/ext/upb-generated/envoy/type/{semantic_version.upb.c → v3/semantic_version.upb.c} +6 -5
  204. data/src/core/ext/upb-generated/envoy/type/v3/semantic_version.upb.h +61 -0
  205. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/checked.upb.c +242 -0
  206. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/checked.upb.h +753 -0
  207. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/syntax.upb.c +234 -0
  208. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/syntax.upb.h +759 -0
  209. data/src/core/ext/upb-generated/google/protobuf/descriptor.upb.c +36 -36
  210. data/src/core/ext/upb-generated/google/protobuf/struct.upb.h +1 -1
  211. data/src/core/ext/upb-generated/udpa/annotations/security.upb.c +31 -0
  212. data/src/core/ext/upb-generated/udpa/annotations/security.upb.h +57 -0
  213. data/src/core/ext/upb-generated/udpa/annotations/versioning.upb.c +27 -0
  214. data/src/core/ext/upb-generated/udpa/annotations/versioning.upb.h +53 -0
  215. data/src/core/ext/upb-generated/udpa/core/v1/authority.upb.c +28 -0
  216. data/src/core/ext/upb-generated/udpa/core/v1/authority.upb.h +53 -0
  217. data/src/core/ext/upb-generated/udpa/core/v1/collection_entry.upb.c +52 -0
  218. data/src/core/ext/upb-generated/udpa/core/v1/collection_entry.upb.h +129 -0
  219. data/src/core/ext/upb-generated/udpa/core/v1/context_params.upb.c +42 -0
  220. data/src/core/ext/upb-generated/udpa/core/v1/context_params.upb.h +77 -0
  221. data/src/core/ext/upb-generated/udpa/core/v1/resource.upb.c +36 -0
  222. data/src/core/ext/upb-generated/udpa/core/v1/resource.upb.h +85 -0
  223. data/src/core/ext/upb-generated/udpa/core/v1/resource_locator.upb.c +54 -0
  224. data/src/core/ext/upb-generated/udpa/core/v1/resource_locator.upb.h +160 -0
  225. data/src/core/ext/upb-generated/udpa/core/v1/resource_name.upb.c +36 -0
  226. data/src/core/ext/upb-generated/udpa/core/v1/resource_name.upb.h +84 -0
  227. data/src/core/ext/upb-generated/validate/validate.upb.c +11 -11
  228. data/src/core/ext/upb-generated/validate/validate.upb.h +1 -1
  229. data/src/core/ext/upbdefs-generated/envoy/annotations/deprecation.upbdefs.c +38 -0
  230. data/src/core/ext/upbdefs-generated/envoy/annotations/deprecation.upbdefs.h +30 -0
  231. data/src/core/ext/upbdefs-generated/envoy/annotations/resource.upbdefs.c +41 -0
  232. data/src/core/ext/upbdefs-generated/envoy/annotations/resource.upbdefs.h +35 -0
  233. data/src/core/ext/upbdefs-generated/envoy/config/accesslog/v3/accesslog.upbdefs.c +254 -0
  234. data/src/core/ext/upbdefs-generated/envoy/config/accesslog/v3/accesslog.upbdefs.h +105 -0
  235. data/src/core/ext/upbdefs-generated/envoy/config/cluster/v3/circuit_breaker.upbdefs.c +100 -0
  236. data/src/core/ext/upbdefs-generated/envoy/config/cluster/v3/circuit_breaker.upbdefs.h +45 -0
  237. data/src/core/ext/upbdefs-generated/envoy/config/cluster/v3/cluster.upbdefs.c +558 -0
  238. data/src/core/ext/upbdefs-generated/envoy/config/cluster/v3/cluster.upbdefs.h +145 -0
  239. data/src/core/ext/upbdefs-generated/envoy/config/cluster/v3/filter.upbdefs.c +53 -0
  240. data/src/core/ext/upbdefs-generated/envoy/config/cluster/v3/filter.upbdefs.h +35 -0
  241. data/src/core/ext/upbdefs-generated/envoy/config/cluster/v3/outlier_detection.upbdefs.c +133 -0
  242. data/src/core/ext/upbdefs-generated/envoy/config/cluster/v3/outlier_detection.upbdefs.h +35 -0
  243. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/address.upbdefs.c +127 -0
  244. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/address.upbdefs.h +65 -0
  245. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/backoff.upbdefs.c +56 -0
  246. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/backoff.upbdefs.h +35 -0
  247. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/base.upbdefs.c +266 -0
  248. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/base.upbdefs.h +125 -0
  249. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/config_source.upbdefs.c +143 -0
  250. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/config_source.upbdefs.h +55 -0
  251. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/event_service_config.upbdefs.c +56 -0
  252. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/event_service_config.upbdefs.h +35 -0
  253. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/extension.upbdefs.c +66 -0
  254. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/extension.upbdefs.h +40 -0
  255. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/grpc_service.upbdefs.c +263 -0
  256. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/grpc_service.upbdefs.h +100 -0
  257. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/health_check.upbdefs.c +233 -0
  258. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/health_check.upbdefs.h +70 -0
  259. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/http_uri.upbdefs.c +56 -0
  260. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/http_uri.upbdefs.h +35 -0
  261. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/protocol.upbdefs.c +228 -0
  262. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/protocol.upbdefs.h +80 -0
  263. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/proxy_protocol.upbdefs.c +46 -0
  264. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/proxy_protocol.upbdefs.h +35 -0
  265. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/socket_option.upbdefs.c +59 -0
  266. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/socket_option.upbdefs.h +35 -0
  267. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/substitution_format_string.upbdefs.c +55 -0
  268. data/src/core/ext/upbdefs-generated/envoy/config/core/v3/substitution_format_string.upbdefs.h +35 -0
  269. data/src/core/ext/upbdefs-generated/envoy/config/endpoint/v3/endpoint.upbdefs.c +110 -0
  270. data/src/core/ext/upbdefs-generated/envoy/config/endpoint/v3/endpoint.upbdefs.h +50 -0
  271. data/src/core/ext/upbdefs-generated/envoy/config/endpoint/v3/endpoint_components.upbdefs.c +113 -0
  272. data/src/core/ext/upbdefs-generated/envoy/config/endpoint/v3/endpoint_components.upbdefs.h +50 -0
  273. data/src/core/ext/upbdefs-generated/envoy/config/endpoint/v3/load_report.upbdefs.c +146 -0
  274. data/src/core/ext/upbdefs-generated/envoy/config/endpoint/v3/load_report.upbdefs.h +55 -0
  275. data/src/core/ext/upbdefs-generated/envoy/config/listener/v3/api_listener.upbdefs.c +50 -0
  276. data/src/core/ext/upbdefs-generated/envoy/config/listener/v3/api_listener.upbdefs.h +35 -0
  277. data/src/core/ext/upbdefs-generated/envoy/config/listener/v3/listener.upbdefs.c +190 -0
  278. data/src/core/ext/upbdefs-generated/envoy/config/listener/v3/listener.upbdefs.h +55 -0
  279. data/src/core/ext/upbdefs-generated/envoy/config/listener/v3/listener_components.upbdefs.c +185 -0
  280. data/src/core/ext/upbdefs-generated/envoy/config/listener/v3/listener_components.upbdefs.h +65 -0
  281. data/src/core/ext/upbdefs-generated/envoy/config/listener/v3/udp_listener_config.upbdefs.c +62 -0
  282. data/src/core/ext/upbdefs-generated/envoy/config/listener/v3/udp_listener_config.upbdefs.h +40 -0
  283. data/src/core/ext/upbdefs-generated/envoy/config/route/v3/route.upbdefs.c +97 -0
  284. data/src/core/ext/upbdefs-generated/envoy/config/route/v3/route.upbdefs.h +40 -0
  285. data/src/core/ext/upbdefs-generated/envoy/config/route/v3/route_components.upbdefs.c +915 -0
  286. data/src/core/ext/upbdefs-generated/envoy/config/route/v3/route_components.upbdefs.h +280 -0
  287. data/src/core/ext/upbdefs-generated/envoy/config/route/v3/scoped_route.upbdefs.c +71 -0
  288. data/src/core/ext/upbdefs-generated/envoy/config/route/v3/scoped_route.upbdefs.h +45 -0
  289. data/src/core/ext/upbdefs-generated/envoy/config/trace/v3/http_tracer.upbdefs.c +64 -0
  290. data/src/core/ext/upbdefs-generated/envoy/config/trace/v3/http_tracer.upbdefs.h +40 -0
  291. data/src/core/ext/upbdefs-generated/envoy/extensions/filters/network/http_connection_manager/v3/http_connection_manager.upbdefs.c +511 -0
  292. data/src/core/ext/upbdefs-generated/envoy/extensions/filters/network/http_connection_manager/v3/http_connection_manager.upbdefs.h +115 -0
  293. data/src/core/ext/upbdefs-generated/envoy/extensions/transport_sockets/tls/v3/cert.upbdefs.c +48 -0
  294. data/src/core/ext/upbdefs-generated/envoy/extensions/transport_sockets/tls/v3/cert.upbdefs.h +30 -0
  295. data/src/core/ext/upbdefs-generated/envoy/extensions/transport_sockets/tls/v3/common.upbdefs.c +166 -0
  296. data/src/core/ext/upbdefs-generated/envoy/extensions/transport_sockets/tls/v3/common.upbdefs.h +55 -0
  297. data/src/core/ext/upbdefs-generated/envoy/extensions/transport_sockets/tls/v3/secret.upbdefs.c +105 -0
  298. data/src/core/ext/upbdefs-generated/envoy/extensions/transport_sockets/tls/v3/secret.upbdefs.h +45 -0
  299. data/src/core/ext/upbdefs-generated/envoy/extensions/transport_sockets/tls/v3/tls.upbdefs.c +249 -0
  300. data/src/core/ext/upbdefs-generated/envoy/extensions/transport_sockets/tls/v3/tls.upbdefs.h +60 -0
  301. data/src/core/ext/upbdefs-generated/envoy/service/cluster/v3/cds.upbdefs.c +72 -0
  302. data/src/core/ext/upbdefs-generated/envoy/service/cluster/v3/cds.upbdefs.h +35 -0
  303. data/src/core/ext/upbdefs-generated/envoy/service/discovery/v3/ads.upbdefs.c +60 -0
  304. data/src/core/ext/upbdefs-generated/envoy/service/discovery/v3/ads.upbdefs.h +35 -0
  305. data/src/core/ext/upbdefs-generated/envoy/service/discovery/v3/discovery.upbdefs.c +152 -0
  306. data/src/core/ext/upbdefs-generated/envoy/service/discovery/v3/discovery.upbdefs.h +60 -0
  307. data/src/core/ext/upbdefs-generated/envoy/service/endpoint/v3/eds.upbdefs.c +83 -0
  308. data/src/core/ext/upbdefs-generated/envoy/service/endpoint/v3/eds.upbdefs.h +35 -0
  309. data/src/core/ext/upbdefs-generated/envoy/service/listener/v3/lds.upbdefs.c +82 -0
  310. data/src/core/ext/upbdefs-generated/envoy/service/listener/v3/lds.upbdefs.h +35 -0
  311. data/src/core/ext/upbdefs-generated/envoy/service/load_stats/v3/lrs.upbdefs.c +83 -0
  312. data/src/core/ext/upbdefs-generated/envoy/service/load_stats/v3/lrs.upbdefs.h +40 -0
  313. data/src/core/ext/upbdefs-generated/envoy/service/route/v3/rds.upbdefs.c +86 -0
  314. data/src/core/ext/upbdefs-generated/envoy/service/route/v3/rds.upbdefs.h +35 -0
  315. data/src/core/ext/upbdefs-generated/envoy/service/route/v3/srds.upbdefs.c +74 -0
  316. data/src/core/ext/upbdefs-generated/envoy/service/route/v3/srds.upbdefs.h +35 -0
  317. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/metadata.upbdefs.c +64 -0
  318. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/metadata.upbdefs.h +40 -0
  319. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/number.upbdefs.c +54 -0
  320. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/number.upbdefs.h +35 -0
  321. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/path.upbdefs.c +53 -0
  322. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/path.upbdefs.h +35 -0
  323. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/regex.upbdefs.c +73 -0
  324. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/regex.upbdefs.h +45 -0
  325. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/string.upbdefs.c +72 -0
  326. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/string.upbdefs.h +40 -0
  327. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/value.upbdefs.c +81 -0
  328. data/src/core/ext/upbdefs-generated/envoy/type/matcher/v3/value.upbdefs.h +45 -0
  329. data/src/core/ext/upbdefs-generated/envoy/type/metadata/v3/metadata.upbdefs.c +92 -0
  330. data/src/core/ext/upbdefs-generated/envoy/type/metadata/v3/metadata.upbdefs.h +65 -0
  331. data/src/core/ext/upbdefs-generated/envoy/type/tracing/v3/custom_tag.upbdefs.c +95 -0
  332. data/src/core/ext/upbdefs-generated/envoy/type/tracing/v3/custom_tag.upbdefs.h +55 -0
  333. data/src/core/ext/upbdefs-generated/envoy/type/v3/http.upbdefs.c +34 -0
  334. data/src/core/ext/{upb-generated/gogoproto/gogo.upb.h → upbdefs-generated/envoy/type/v3/http.upbdefs.h} +10 -9
  335. data/src/core/ext/upbdefs-generated/envoy/type/v3/percent.upbdefs.c +59 -0
  336. data/src/core/ext/upbdefs-generated/envoy/type/v3/percent.upbdefs.h +40 -0
  337. data/src/core/ext/upbdefs-generated/envoy/type/v3/range.upbdefs.c +54 -0
  338. data/src/core/ext/upbdefs-generated/envoy/type/v3/range.upbdefs.h +45 -0
  339. data/src/core/ext/upbdefs-generated/envoy/type/v3/semantic_version.upbdefs.c +47 -0
  340. data/src/core/ext/upbdefs-generated/envoy/type/v3/semantic_version.upbdefs.h +35 -0
  341. data/src/core/ext/upbdefs-generated/google/api/annotations.upbdefs.c +40 -0
  342. data/src/core/ext/upbdefs-generated/google/api/annotations.upbdefs.h +30 -0
  343. data/src/core/ext/upbdefs-generated/google/api/http.upbdefs.c +61 -0
  344. data/src/core/ext/upbdefs-generated/google/api/http.upbdefs.h +45 -0
  345. data/src/core/ext/upbdefs-generated/google/protobuf/any.upbdefs.c +38 -0
  346. data/src/core/ext/upbdefs-generated/google/protobuf/any.upbdefs.h +35 -0
  347. data/src/core/ext/upbdefs-generated/google/protobuf/descriptor.upbdefs.c +386 -0
  348. data/src/core/ext/upbdefs-generated/google/protobuf/descriptor.upbdefs.h +165 -0
  349. data/src/core/ext/upbdefs-generated/google/protobuf/duration.upbdefs.c +39 -0
  350. data/src/core/ext/upbdefs-generated/google/protobuf/duration.upbdefs.h +35 -0
  351. data/src/core/ext/upbdefs-generated/google/protobuf/empty.upbdefs.c +37 -0
  352. data/src/core/ext/upbdefs-generated/google/protobuf/empty.upbdefs.h +35 -0
  353. data/src/core/ext/upbdefs-generated/google/protobuf/struct.upbdefs.c +65 -0
  354. data/src/core/ext/upbdefs-generated/google/protobuf/struct.upbdefs.h +50 -0
  355. data/src/core/ext/upbdefs-generated/google/protobuf/timestamp.upbdefs.c +39 -0
  356. data/src/core/ext/upbdefs-generated/google/protobuf/timestamp.upbdefs.h +35 -0
  357. data/src/core/ext/upbdefs-generated/google/protobuf/wrappers.upbdefs.c +66 -0
  358. data/src/core/ext/upbdefs-generated/google/protobuf/wrappers.upbdefs.h +75 -0
  359. data/src/core/ext/upbdefs-generated/google/rpc/status.upbdefs.c +42 -0
  360. data/src/core/ext/upbdefs-generated/google/rpc/status.upbdefs.h +35 -0
  361. data/src/core/ext/upbdefs-generated/udpa/annotations/migrate.upbdefs.c +70 -0
  362. data/src/core/ext/upbdefs-generated/udpa/annotations/migrate.upbdefs.h +45 -0
  363. data/src/core/ext/upbdefs-generated/udpa/annotations/security.upbdefs.c +56 -0
  364. data/src/core/ext/upbdefs-generated/udpa/annotations/security.upbdefs.h +35 -0
  365. data/src/core/ext/upbdefs-generated/udpa/annotations/sensitive.upbdefs.c +33 -0
  366. data/src/core/ext/upbdefs-generated/udpa/annotations/sensitive.upbdefs.h +30 -0
  367. data/src/core/ext/upbdefs-generated/udpa/annotations/status.upbdefs.c +49 -0
  368. data/src/core/ext/upbdefs-generated/udpa/annotations/status.upbdefs.h +35 -0
  369. data/src/core/ext/upbdefs-generated/udpa/annotations/versioning.upbdefs.c +43 -0
  370. data/src/core/ext/upbdefs-generated/udpa/annotations/versioning.upbdefs.h +35 -0
  371. data/src/core/ext/upbdefs-generated/udpa/core/v1/authority.upbdefs.c +42 -0
  372. data/src/core/ext/upbdefs-generated/udpa/core/v1/authority.upbdefs.h +35 -0
  373. data/src/core/ext/upbdefs-generated/udpa/core/v1/collection_entry.upbdefs.c +62 -0
  374. data/src/core/ext/upbdefs-generated/udpa/core/v1/collection_entry.upbdefs.h +40 -0
  375. data/src/core/ext/upbdefs-generated/udpa/core/v1/context_params.upbdefs.c +45 -0
  376. data/src/core/ext/upbdefs-generated/udpa/core/v1/context_params.upbdefs.h +40 -0
  377. data/src/core/ext/upbdefs-generated/udpa/core/v1/resource.upbdefs.c +49 -0
  378. data/src/core/ext/upbdefs-generated/udpa/core/v1/resource.upbdefs.h +35 -0
  379. data/src/core/ext/upbdefs-generated/udpa/core/v1/resource_locator.upbdefs.c +68 -0
  380. data/src/core/ext/upbdefs-generated/udpa/core/v1/resource_locator.upbdefs.h +40 -0
  381. data/src/core/ext/upbdefs-generated/udpa/core/v1/resource_name.upbdefs.c +51 -0
  382. data/src/core/ext/upbdefs-generated/udpa/core/v1/resource_name.upbdefs.h +35 -0
  383. data/src/core/ext/upbdefs-generated/validate/validate.upbdefs.c +307 -0
  384. data/src/core/ext/upbdefs-generated/validate/validate.upbdefs.h +145 -0
  385. data/src/core/ext/xds/certificate_provider_factory.h +61 -0
  386. data/src/core/ext/xds/certificate_provider_registry.cc +103 -0
  387. data/src/core/ext/xds/certificate_provider_registry.h +57 -0
  388. data/src/core/ext/xds/certificate_provider_store.cc +84 -0
  389. data/src/core/ext/xds/certificate_provider_store.h +107 -0
  390. data/src/core/ext/xds/file_watcher_certificate_provider_factory.cc +119 -0
  391. data/src/core/ext/xds/file_watcher_certificate_provider_factory.h +72 -0
  392. data/src/core/ext/xds/google_mesh_ca_certificate_provider_factory.cc +265 -0
  393. data/src/core/ext/xds/google_mesh_ca_certificate_provider_factory.h +104 -0
  394. data/src/core/ext/xds/xds_api.cc +2119 -0
  395. data/src/core/ext/xds/xds_api.h +438 -0
  396. data/src/core/ext/{filters/client_channel/xds → xds}/xds_bootstrap.cc +208 -19
  397. data/src/core/ext/{filters/client_channel/xds → xds}/xds_bootstrap.h +31 -10
  398. data/src/core/ext/xds/xds_certificate_provider.cc +240 -0
  399. data/src/core/ext/xds/xds_certificate_provider.h +74 -0
  400. data/src/core/ext/{filters/client_channel/xds → xds}/xds_channel_args.h +9 -6
  401. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client.cc +636 -847
  402. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client.h +120 -98
  403. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client_stats.cc +61 -18
  404. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client_stats.h +38 -10
  405. data/src/core/lib/channel/channel_args.cc +2 -1
  406. data/src/core/lib/channel/channel_args.h +0 -1
  407. data/src/core/lib/channel/channel_trace.cc +4 -2
  408. data/src/core/lib/channel/channelz.cc +24 -60
  409. data/src/core/lib/channel/channelz.h +14 -22
  410. data/src/core/lib/channel/channelz_registry.cc +15 -12
  411. data/src/core/lib/channel/channelz_registry.h +3 -0
  412. data/src/core/lib/channel/handshaker.h +2 -2
  413. data/src/core/lib/compression/compression.cc +8 -4
  414. data/src/core/lib/compression/compression_internal.cc +10 -5
  415. data/src/core/lib/compression/compression_internal.h +2 -1
  416. data/src/core/lib/compression/stream_compression_identity.cc +1 -3
  417. data/src/core/lib/debug/stats_data.cc +1 -0
  418. data/src/core/lib/gpr/cpu_iphone.cc +10 -2
  419. data/src/core/lib/gpr/log_linux.cc +17 -3
  420. data/src/core/lib/gpr/log_posix.cc +13 -1
  421. data/src/core/lib/gpr/log_windows.cc +16 -4
  422. data/src/core/lib/gpr/murmur_hash.cc +1 -1
  423. data/src/core/lib/gpr/string.cc +1 -1
  424. data/src/core/lib/gpr/sync_posix.cc +2 -8
  425. data/src/core/lib/gpr/time_precise.cc +5 -2
  426. data/src/core/lib/gpr/time_precise.h +6 -2
  427. data/src/core/lib/gpr/tls.h +4 -0
  428. data/src/core/lib/gpr/tls_msvc.h +2 -0
  429. data/src/core/lib/gpr/tls_stdcpp.h +48 -0
  430. data/src/core/lib/gpr/useful.h +5 -4
  431. data/src/core/lib/gprpp/dual_ref_counted.h +331 -0
  432. data/src/core/lib/gprpp/examine_stack.cc +43 -0
  433. data/src/core/lib/gprpp/examine_stack.h +46 -0
  434. data/src/core/lib/gprpp/fork.cc +2 -2
  435. data/src/core/lib/gprpp/manual_constructor.h +1 -1
  436. data/src/core/lib/gprpp/orphanable.h +4 -8
  437. data/src/core/lib/gprpp/ref_counted.h +91 -68
  438. data/src/core/lib/gprpp/ref_counted_ptr.h +158 -7
  439. data/src/core/lib/gprpp/stat.h +38 -0
  440. data/src/core/lib/gprpp/stat_posix.cc +49 -0
  441. data/src/core/lib/gprpp/stat_windows.cc +48 -0
  442. data/src/core/lib/gprpp/thd.h +2 -2
  443. data/src/core/lib/gprpp/thd_posix.cc +36 -36
  444. data/src/core/lib/http/parser.cc +46 -25
  445. data/src/core/lib/iomgr/endpoint.cc +5 -1
  446. data/src/core/lib/iomgr/endpoint.h +7 -3
  447. data/src/core/lib/iomgr/endpoint_cfstream.cc +36 -11
  448. data/src/core/lib/iomgr/error.cc +2 -1
  449. data/src/core/lib/iomgr/ev_epollex_linux.cc +8 -4
  450. data/src/core/lib/iomgr/ev_posix.cc +0 -2
  451. data/src/core/lib/iomgr/exec_ctx.cc +1 -1
  452. data/src/core/lib/iomgr/exec_ctx.h +10 -8
  453. data/src/core/lib/iomgr/executor/mpmcqueue.h +5 -5
  454. data/src/core/lib/iomgr/executor/threadpool.h +3 -3
  455. data/src/core/lib/iomgr/iomgr.cc +0 -10
  456. data/src/core/lib/iomgr/iomgr.h +0 -10
  457. data/src/core/{ext/filters/client_channel → lib/iomgr}/parse_address.cc +85 -7
  458. data/src/core/{ext/filters/client_channel → lib/iomgr}/parse_address.h +23 -3
  459. data/src/core/lib/iomgr/poller/eventmanager_libuv.cc +2 -1
  460. data/src/core/lib/iomgr/python_util.h +3 -3
  461. data/src/core/lib/iomgr/resolve_address_posix.cc +1 -5
  462. data/src/core/lib/iomgr/sockaddr_utils.cc +2 -1
  463. data/src/core/lib/iomgr/sockaddr_utils.h +2 -1
  464. data/src/core/lib/iomgr/tcp_custom.cc +32 -16
  465. data/src/core/lib/iomgr/tcp_posix.cc +34 -15
  466. data/src/core/lib/iomgr/tcp_windows.cc +26 -10
  467. data/src/core/lib/iomgr/timer_custom.cc +2 -2
  468. data/src/core/lib/iomgr/unix_sockets_posix.cc +27 -15
  469. data/src/core/lib/iomgr/unix_sockets_posix.h +5 -0
  470. data/src/core/lib/iomgr/unix_sockets_posix_noop.cc +7 -0
  471. data/src/core/lib/iomgr/wakeup_fd_pipe.cc +2 -2
  472. data/src/core/lib/json/json.h +2 -2
  473. data/src/core/lib/json/json_reader.cc +8 -4
  474. data/src/core/lib/json/json_util.cc +58 -0
  475. data/src/core/lib/json/json_util.h +204 -0
  476. data/src/core/lib/json/json_writer.cc +2 -1
  477. data/src/core/lib/security/authorization/authorization_engine.cc +177 -0
  478. data/src/core/lib/security/authorization/authorization_engine.h +84 -0
  479. data/src/core/lib/security/authorization/evaluate_args.cc +153 -0
  480. data/src/core/lib/security/authorization/evaluate_args.h +59 -0
  481. data/src/core/lib/security/authorization/mock_cel/activation.h +57 -0
  482. data/src/core/lib/security/authorization/mock_cel/cel_expr_builder_factory.h +44 -0
  483. data/src/core/lib/security/authorization/mock_cel/cel_expression.h +69 -0
  484. data/src/core/lib/security/authorization/mock_cel/cel_value.h +97 -0
  485. data/src/core/lib/security/authorization/mock_cel/evaluator_core.h +67 -0
  486. data/src/core/lib/security/authorization/mock_cel/flat_expr_builder.h +57 -0
  487. data/src/core/lib/security/context/security_context.h +3 -1
  488. data/src/core/lib/security/credentials/credentials.cc +1 -1
  489. data/src/core/lib/security/credentials/credentials.h +3 -3
  490. data/src/core/lib/security/credentials/external/aws_request_signer.cc +208 -0
  491. data/src/core/lib/security/credentials/external/aws_request_signer.h +73 -0
  492. data/src/core/lib/security/credentials/external/external_account_credentials.cc +311 -0
  493. data/src/core/lib/security/credentials/external/external_account_credentials.h +118 -0
  494. data/src/core/lib/security/credentials/external/file_external_account_credentials.cc +136 -0
  495. data/src/core/lib/security/credentials/external/file_external_account_credentials.h +49 -0
  496. data/src/core/lib/security/credentials/external/url_external_account_credentials.cc +211 -0
  497. data/src/core/lib/security/credentials/external/url_external_account_credentials.h +59 -0
  498. data/src/core/lib/security/credentials/google_default/google_default_credentials.cc +56 -38
  499. data/src/core/lib/security/credentials/insecure/insecure_credentials.cc +51 -0
  500. data/src/core/lib/security/credentials/jwt/json_token.cc +5 -2
  501. data/src/core/lib/security/credentials/jwt/jwt_credentials.h +4 -3
  502. data/src/core/lib/security/credentials/jwt/jwt_verifier.cc +5 -1
  503. data/src/core/lib/security/credentials/oauth2/oauth2_credentials.cc +2 -2
  504. data/src/core/lib/security/credentials/tls/grpc_tls_certificate_distributor.cc +351 -0
  505. data/src/core/lib/security/credentials/tls/grpc_tls_certificate_distributor.h +218 -0
  506. data/src/core/lib/security/credentials/tls/grpc_tls_certificate_provider.cc +78 -0
  507. data/src/core/lib/security/credentials/tls/grpc_tls_certificate_provider.h +74 -0
  508. data/src/core/lib/security/credentials/tls/grpc_tls_credentials_options.cc +77 -149
  509. data/src/core/lib/security/credentials/tls/grpc_tls_credentials_options.h +58 -187
  510. data/src/core/lib/security/credentials/tls/tls_credentials.cc +16 -12
  511. data/src/core/lib/security/credentials/tls/tls_credentials.h +2 -2
  512. data/src/core/lib/security/credentials/xds/xds_credentials.cc +45 -0
  513. data/src/core/lib/security/credentials/xds/xds_credentials.h +51 -0
  514. data/src/core/lib/security/security_connector/fake/fake_security_connector.cc +9 -14
  515. data/src/core/lib/security/security_connector/insecure/insecure_security_connector.cc +88 -0
  516. data/src/core/lib/security/security_connector/insecure/insecure_security_connector.h +70 -0
  517. data/src/core/lib/security/security_connector/load_system_roots.h +4 -0
  518. data/src/core/lib/security/security_connector/load_system_roots_linux.h +2 -0
  519. data/src/core/lib/security/security_connector/local/local_security_connector.cc +2 -2
  520. data/src/core/lib/security/security_connector/security_connector.cc +1 -1
  521. data/src/core/lib/security/security_connector/security_connector.h +4 -2
  522. data/src/core/lib/security/security_connector/ssl_utils.h +9 -2
  523. data/src/core/lib/security/security_connector/tls/tls_security_connector.cc +293 -275
  524. data/src/core/lib/security/security_connector/tls/tls_security_connector.h +106 -61
  525. data/src/core/lib/security/transport/secure_endpoint.cc +7 -1
  526. data/src/core/lib/security/transport/security_handshaker.cc +1 -1
  527. data/src/core/lib/security/transport/server_auth_filter.cc +2 -1
  528. data/src/core/lib/security/util/json_util.h +1 -0
  529. data/src/core/lib/slice/slice.cc +7 -4
  530. data/src/core/lib/slice/slice_buffer.cc +2 -1
  531. data/src/core/lib/slice/slice_intern.cc +2 -2
  532. data/src/core/lib/surface/call.cc +21 -20
  533. data/src/core/lib/surface/call.h +2 -1
  534. data/src/core/lib/surface/channel.cc +37 -51
  535. data/src/core/lib/surface/channel.h +18 -3
  536. data/src/core/lib/surface/completion_queue.cc +17 -278
  537. data/src/core/lib/surface/completion_queue.h +0 -8
  538. data/src/core/lib/surface/init.cc +27 -12
  539. data/src/core/lib/surface/server.cc +1069 -1245
  540. data/src/core/lib/surface/server.h +363 -87
  541. data/src/core/lib/surface/validate_metadata.h +3 -0
  542. data/src/core/lib/surface/version.cc +2 -2
  543. data/src/core/lib/transport/authority_override.cc +38 -0
  544. data/src/core/lib/transport/authority_override.h +34 -0
  545. data/src/core/lib/transport/bdp_estimator.cc +1 -1
  546. data/src/core/lib/transport/bdp_estimator.h +2 -1
  547. data/src/core/lib/transport/byte_stream.h +3 -3
  548. data/src/core/lib/transport/connectivity_state.cc +18 -13
  549. data/src/core/lib/transport/connectivity_state.h +22 -10
  550. data/src/core/lib/transport/error_utils.cc +13 -0
  551. data/src/core/lib/transport/error_utils.h +6 -0
  552. data/src/core/lib/transport/metadata.cc +11 -1
  553. data/src/core/lib/transport/metadata.h +2 -2
  554. data/src/core/lib/transport/static_metadata.cc +295 -276
  555. data/src/core/lib/transport/static_metadata.h +80 -73
  556. data/src/core/lib/transport/timeout_encoding.cc +4 -4
  557. data/src/core/lib/transport/transport.cc +5 -3
  558. data/src/core/lib/transport/transport.h +8 -1
  559. data/src/core/lib/uri/uri_parser.cc +23 -21
  560. data/src/core/lib/uri/uri_parser.h +3 -1
  561. data/src/core/plugin_registry/grpc_plugin_registry.cc +35 -20
  562. data/src/core/tsi/alts/handshaker/alts_tsi_handshaker.cc +26 -3
  563. data/src/core/tsi/fake_transport_security.cc +1 -0
  564. data/src/core/tsi/local_transport_security.cc +5 -1
  565. data/src/core/tsi/local_transport_security.h +6 -7
  566. data/src/core/tsi/ssl/session_cache/ssl_session.h +3 -0
  567. data/src/core/tsi/ssl/session_cache/ssl_session_cache.h +4 -1
  568. data/src/core/tsi/ssl_transport_security.cc +16 -9
  569. data/src/core/tsi/ssl_transport_security.h +3 -0
  570. data/src/core/tsi/transport_security.cc +4 -2
  571. data/src/ruby/bin/math_services_pb.rb +4 -4
  572. data/src/ruby/ext/grpc/extconf.rb +1 -1
  573. data/src/ruby/ext/grpc/rb_channel_credentials.c +9 -0
  574. data/src/ruby/ext/grpc/rb_grpc_imports.generated.c +26 -18
  575. data/src/ruby/ext/grpc/rb_grpc_imports.generated.h +43 -31
  576. data/src/ruby/lib/grpc/generic/client_stub.rb +1 -1
  577. data/src/ruby/lib/grpc/version.rb +1 -1
  578. data/src/ruby/pb/grpc/health/v1/health_services_pb.rb +2 -2
  579. data/src/ruby/pb/src/proto/grpc/testing/messages_pb.rb +5 -0
  580. data/src/ruby/pb/src/proto/grpc/testing/test_services_pb.rb +28 -12
  581. data/src/ruby/spec/channel_credentials_spec.rb +10 -0
  582. data/src/ruby/spec/generic/active_call_spec.rb +19 -8
  583. data/src/ruby/spec/pb/codegen/grpc/testing/same_package_service_name.proto +27 -0
  584. data/src/ruby/spec/pb/codegen/grpc/testing/same_ruby_package_service_name.proto +29 -0
  585. data/src/ruby/spec/pb/codegen/package_option_spec.rb +20 -0
  586. data/src/ruby/spec/user_agent_spec.rb +74 -0
  587. data/third_party/abseil-cpp/absl/algorithm/container.h +1764 -0
  588. data/third_party/abseil-cpp/absl/base/attributes.h +99 -38
  589. data/third_party/abseil-cpp/absl/base/call_once.h +1 -1
  590. data/third_party/abseil-cpp/absl/base/casts.h +9 -6
  591. data/third_party/abseil-cpp/absl/base/config.h +60 -17
  592. data/third_party/abseil-cpp/absl/base/dynamic_annotations.h +428 -335
  593. data/third_party/abseil-cpp/absl/base/internal/bits.h +17 -16
  594. data/third_party/abseil-cpp/absl/base/internal/direct_mmap.h +166 -0
  595. data/third_party/abseil-cpp/absl/base/internal/dynamic_annotations.h +398 -0
  596. data/third_party/abseil-cpp/absl/base/internal/exponential_biased.cc +93 -0
  597. data/third_party/abseil-cpp/absl/base/internal/exponential_biased.h +130 -0
  598. data/third_party/abseil-cpp/absl/base/internal/invoke.h +4 -4
  599. data/third_party/abseil-cpp/absl/base/internal/low_level_alloc.cc +620 -0
  600. data/third_party/abseil-cpp/absl/base/internal/low_level_alloc.h +126 -0
  601. data/third_party/abseil-cpp/absl/base/internal/low_level_scheduling.h +29 -1
  602. data/third_party/abseil-cpp/absl/base/internal/raw_logging.cc +2 -2
  603. data/third_party/abseil-cpp/absl/base/internal/raw_logging.h +7 -5
  604. data/third_party/abseil-cpp/absl/base/internal/spinlock.cc +25 -38
  605. data/third_party/abseil-cpp/absl/base/internal/spinlock.h +19 -25
  606. data/third_party/abseil-cpp/absl/base/internal/spinlock_linux.inc +8 -0
  607. data/third_party/abseil-cpp/absl/base/internal/sysinfo.cc +28 -5
  608. data/third_party/abseil-cpp/absl/base/internal/sysinfo.h +8 -0
  609. data/third_party/abseil-cpp/absl/base/internal/tsan_mutex_interface.h +3 -1
  610. data/third_party/abseil-cpp/absl/base/internal/unaligned_access.h +2 -2
  611. data/third_party/abseil-cpp/absl/base/internal/unscaledcycleclock.h +3 -3
  612. data/third_party/abseil-cpp/absl/base/macros.h +36 -109
  613. data/third_party/abseil-cpp/absl/base/optimization.h +61 -1
  614. data/third_party/abseil-cpp/absl/base/options.h +31 -4
  615. data/third_party/abseil-cpp/absl/base/policy_checks.h +1 -1
  616. data/third_party/abseil-cpp/absl/base/thread_annotations.h +94 -39
  617. data/third_party/abseil-cpp/absl/container/fixed_array.h +532 -0
  618. data/third_party/abseil-cpp/absl/container/flat_hash_set.h +504 -0
  619. data/third_party/abseil-cpp/absl/container/inlined_vector.h +33 -36
  620. data/third_party/abseil-cpp/absl/container/internal/common.h +206 -0
  621. data/third_party/abseil-cpp/absl/container/internal/compressed_tuple.h +33 -8
  622. data/third_party/abseil-cpp/absl/container/internal/container_memory.h +460 -0
  623. data/third_party/abseil-cpp/absl/container/internal/hash_function_defaults.h +161 -0
  624. data/third_party/abseil-cpp/absl/container/internal/hash_policy_traits.h +208 -0
  625. data/third_party/abseil-cpp/absl/container/internal/hashtable_debug_hooks.h +85 -0
  626. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler.cc +270 -0
  627. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler.h +321 -0
  628. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler_force_weak_definition.cc +30 -0
  629. data/third_party/abseil-cpp/absl/container/internal/have_sse.h +50 -0
  630. data/third_party/abseil-cpp/absl/container/internal/layout.h +743 -0
  631. data/third_party/abseil-cpp/absl/container/internal/raw_hash_set.cc +48 -0
  632. data/third_party/abseil-cpp/absl/container/internal/raw_hash_set.h +1903 -0
  633. data/third_party/abseil-cpp/absl/debugging/internal/address_is_readable.cc +139 -0
  634. data/third_party/abseil-cpp/absl/debugging/internal/address_is_readable.h +32 -0
  635. data/third_party/abseil-cpp/absl/debugging/internal/demangle.cc +1945 -0
  636. data/third_party/abseil-cpp/absl/debugging/internal/demangle.h +71 -0
  637. data/third_party/abseil-cpp/absl/debugging/internal/elf_mem_image.cc +382 -0
  638. data/third_party/abseil-cpp/absl/debugging/internal/elf_mem_image.h +134 -0
  639. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_aarch64-inl.inc +196 -0
  640. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_arm-inl.inc +134 -0
  641. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_config.h +89 -0
  642. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_generic-inl.inc +108 -0
  643. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_powerpc-inl.inc +248 -0
  644. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_unimplemented-inl.inc +24 -0
  645. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_win32-inl.inc +93 -0
  646. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_x86-inl.inc +346 -0
  647. data/third_party/abseil-cpp/absl/debugging/internal/symbolize.h +149 -0
  648. data/third_party/abseil-cpp/absl/debugging/internal/vdso_support.cc +173 -0
  649. data/third_party/abseil-cpp/absl/debugging/internal/vdso_support.h +158 -0
  650. data/third_party/abseil-cpp/absl/debugging/stacktrace.cc +140 -0
  651. data/third_party/abseil-cpp/absl/debugging/stacktrace.h +231 -0
  652. data/third_party/abseil-cpp/absl/debugging/symbolize.cc +36 -0
  653. data/third_party/abseil-cpp/absl/debugging/symbolize.h +99 -0
  654. data/third_party/abseil-cpp/absl/debugging/symbolize_darwin.inc +101 -0
  655. data/third_party/abseil-cpp/absl/debugging/symbolize_elf.inc +1560 -0
  656. data/third_party/abseil-cpp/absl/debugging/symbolize_unimplemented.inc +40 -0
  657. data/third_party/abseil-cpp/absl/debugging/symbolize_win32.inc +81 -0
  658. data/third_party/abseil-cpp/absl/functional/bind_front.h +184 -0
  659. data/third_party/abseil-cpp/absl/functional/function_ref.h +139 -0
  660. data/third_party/abseil-cpp/absl/functional/internal/front_binder.h +95 -0
  661. data/third_party/abseil-cpp/absl/functional/internal/function_ref.h +106 -0
  662. data/third_party/abseil-cpp/absl/hash/hash.h +325 -0
  663. data/third_party/abseil-cpp/absl/hash/internal/city.cc +346 -0
  664. data/third_party/abseil-cpp/absl/hash/internal/city.h +96 -0
  665. data/third_party/abseil-cpp/absl/hash/internal/hash.cc +55 -0
  666. data/third_party/abseil-cpp/absl/hash/internal/hash.h +996 -0
  667. data/third_party/abseil-cpp/absl/memory/memory.h +4 -0
  668. data/third_party/abseil-cpp/absl/meta/type_traits.h +2 -8
  669. data/third_party/abseil-cpp/absl/numeric/int128.cc +13 -27
  670. data/third_party/abseil-cpp/absl/numeric/int128.h +16 -15
  671. data/third_party/abseil-cpp/absl/status/internal/status_internal.h +51 -0
  672. data/third_party/abseil-cpp/absl/status/status.cc +445 -0
  673. data/third_party/abseil-cpp/absl/status/status.h +817 -0
  674. data/third_party/abseil-cpp/absl/status/status_payload_printer.cc +38 -0
  675. data/third_party/abseil-cpp/absl/status/status_payload_printer.h +51 -0
  676. data/third_party/abseil-cpp/absl/strings/charconv.cc +2 -2
  677. data/third_party/abseil-cpp/absl/strings/cord.cc +1998 -0
  678. data/third_party/abseil-cpp/absl/strings/cord.h +1276 -0
  679. data/third_party/abseil-cpp/absl/strings/escaping.cc +9 -9
  680. data/third_party/abseil-cpp/absl/strings/internal/char_map.h +1 -1
  681. data/third_party/abseil-cpp/absl/strings/internal/charconv_bigint.cc +1 -1
  682. data/third_party/abseil-cpp/absl/strings/internal/charconv_bigint.h +2 -2
  683. data/third_party/abseil-cpp/absl/strings/internal/charconv_parse.cc +2 -2
  684. data/third_party/abseil-cpp/absl/strings/internal/cord_internal.h +173 -0
  685. data/third_party/abseil-cpp/absl/strings/internal/str_format/arg.cc +222 -136
  686. data/third_party/abseil-cpp/absl/strings/internal/str_format/arg.h +136 -64
  687. data/third_party/abseil-cpp/absl/strings/internal/str_format/bind.cc +1 -1
  688. data/third_party/abseil-cpp/absl/strings/internal/str_format/bind.h +14 -21
  689. data/third_party/abseil-cpp/absl/strings/internal/str_format/checker.h +7 -14
  690. data/third_party/abseil-cpp/absl/strings/internal/str_format/extension.cc +31 -7
  691. data/third_party/abseil-cpp/absl/strings/internal/str_format/extension.h +147 -135
  692. data/third_party/abseil-cpp/absl/strings/internal/str_format/float_conversion.cc +999 -87
  693. data/third_party/abseil-cpp/absl/strings/internal/str_format/float_conversion.h +3 -3
  694. data/third_party/abseil-cpp/absl/strings/internal/str_format/output.h +4 -12
  695. data/third_party/abseil-cpp/absl/strings/internal/str_format/parser.cc +8 -6
  696. data/third_party/abseil-cpp/absl/strings/internal/str_format/parser.h +13 -11
  697. data/third_party/abseil-cpp/absl/strings/internal/str_split_internal.h +2 -2
  698. data/third_party/abseil-cpp/absl/strings/str_cat.cc +4 -4
  699. data/third_party/abseil-cpp/absl/strings/str_cat.h +1 -1
  700. data/third_party/abseil-cpp/absl/strings/str_format.h +289 -13
  701. data/third_party/abseil-cpp/absl/strings/str_split.cc +2 -2
  702. data/third_party/abseil-cpp/absl/strings/str_split.h +1 -0
  703. data/third_party/abseil-cpp/absl/strings/string_view.h +26 -19
  704. data/third_party/abseil-cpp/absl/strings/substitute.cc +5 -5
  705. data/third_party/abseil-cpp/absl/strings/substitute.h +32 -29
  706. data/third_party/abseil-cpp/absl/synchronization/barrier.cc +52 -0
  707. data/third_party/abseil-cpp/absl/synchronization/barrier.h +79 -0
  708. data/third_party/abseil-cpp/absl/synchronization/blocking_counter.cc +57 -0
  709. data/third_party/abseil-cpp/absl/synchronization/blocking_counter.h +99 -0
  710. data/third_party/abseil-cpp/absl/synchronization/internal/create_thread_identity.cc +140 -0
  711. data/third_party/abseil-cpp/absl/synchronization/internal/create_thread_identity.h +60 -0
  712. data/third_party/abseil-cpp/absl/synchronization/internal/graphcycles.cc +697 -0
  713. data/third_party/abseil-cpp/absl/synchronization/internal/graphcycles.h +141 -0
  714. data/third_party/abseil-cpp/absl/synchronization/internal/kernel_timeout.h +155 -0
  715. data/third_party/abseil-cpp/absl/synchronization/internal/mutex_nonprod.inc +249 -0
  716. data/third_party/abseil-cpp/absl/synchronization/internal/per_thread_sem.cc +106 -0
  717. data/third_party/abseil-cpp/absl/synchronization/internal/per_thread_sem.h +115 -0
  718. data/third_party/abseil-cpp/absl/synchronization/internal/waiter.cc +492 -0
  719. data/third_party/abseil-cpp/absl/synchronization/internal/waiter.h +159 -0
  720. data/third_party/abseil-cpp/absl/synchronization/mutex.cc +2739 -0
  721. data/third_party/abseil-cpp/absl/synchronization/mutex.h +1065 -0
  722. data/third_party/abseil-cpp/absl/synchronization/notification.cc +78 -0
  723. data/third_party/abseil-cpp/absl/synchronization/notification.h +123 -0
  724. data/third_party/abseil-cpp/absl/time/civil_time.cc +9 -9
  725. data/third_party/abseil-cpp/absl/time/clock.cc +3 -3
  726. data/third_party/abseil-cpp/absl/time/duration.cc +90 -59
  727. data/third_party/abseil-cpp/absl/time/format.cc +43 -36
  728. data/third_party/abseil-cpp/absl/time/internal/cctz/include/cctz/civil_time_detail.h +26 -16
  729. data/third_party/abseil-cpp/absl/time/internal/cctz/include/cctz/time_zone.h +4 -2
  730. data/third_party/abseil-cpp/absl/time/internal/cctz/include/cctz/zone_info_source.h +1 -1
  731. data/third_party/abseil-cpp/absl/time/internal/cctz/src/time_zone_format.cc +136 -29
  732. data/third_party/abseil-cpp/absl/time/internal/cctz/src/time_zone_impl.cc +13 -21
  733. data/third_party/abseil-cpp/absl/time/internal/cctz/src/time_zone_impl.h +1 -1
  734. data/third_party/abseil-cpp/absl/time/internal/cctz/src/time_zone_info.cc +136 -129
  735. data/third_party/abseil-cpp/absl/time/internal/cctz/src/time_zone_info.h +4 -5
  736. data/third_party/abseil-cpp/absl/time/internal/cctz/src/time_zone_libc.cc +8 -7
  737. data/third_party/abseil-cpp/absl/time/internal/cctz/src/tzfile.h +6 -6
  738. data/third_party/abseil-cpp/absl/time/internal/cctz/src/zone_info_source.cc +2 -1
  739. data/third_party/abseil-cpp/absl/time/time.h +15 -16
  740. data/third_party/abseil-cpp/absl/types/bad_variant_access.cc +64 -0
  741. data/third_party/abseil-cpp/absl/types/bad_variant_access.h +82 -0
  742. data/third_party/abseil-cpp/absl/types/internal/variant.h +1646 -0
  743. data/third_party/abseil-cpp/absl/types/optional.h +9 -9
  744. data/third_party/abseil-cpp/absl/types/span.h +49 -36
  745. data/third_party/abseil-cpp/absl/types/variant.h +861 -0
  746. data/third_party/abseil-cpp/absl/utility/utility.h +2 -2
  747. data/third_party/address_sorting/include/address_sorting/address_sorting.h +2 -0
  748. data/third_party/boringssl-with-bazel/err_data.c +479 -467
  749. data/third_party/boringssl-with-bazel/src/crypto/asn1/asn1_lib.c +0 -6
  750. data/third_party/boringssl-with-bazel/src/crypto/bio/bio.c +2 -0
  751. data/third_party/boringssl-with-bazel/src/crypto/dsa/dsa.c +9 -43
  752. data/third_party/boringssl-with-bazel/src/crypto/dsa/dsa_asn1.c +55 -4
  753. data/third_party/boringssl-with-bazel/src/crypto/dsa/internal.h +34 -0
  754. data/third_party/boringssl-with-bazel/src/crypto/evp/evp.c +4 -0
  755. data/third_party/boringssl-with-bazel/src/crypto/evp/evp_asn1.c +16 -0
  756. data/third_party/boringssl-with-bazel/src/crypto/evp/p_dsa_asn1.c +6 -2
  757. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/cipher/e_aes.c +173 -35
  758. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/digest/digest.c +2 -0
  759. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/rsa/internal.h +4 -0
  760. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/rsa/rsa.c +30 -10
  761. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/rsa/rsa_impl.c +56 -22
  762. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/self_check/self_check.c +8 -2
  763. data/third_party/boringssl-with-bazel/src/crypto/hpke/hpke.c +543 -0
  764. data/third_party/boringssl-with-bazel/src/crypto/hpke/internal.h +237 -0
  765. data/third_party/boringssl-with-bazel/src/crypto/trust_token/internal.h +118 -49
  766. data/third_party/boringssl-with-bazel/src/crypto/trust_token/pmbtoken.c +267 -95
  767. data/third_party/boringssl-with-bazel/src/crypto/trust_token/trust_token.c +210 -34
  768. data/third_party/boringssl-with-bazel/src/crypto/trust_token/voprf.c +766 -0
  769. data/third_party/boringssl-with-bazel/src/crypto/x509/a_strex.c +3 -3
  770. data/third_party/boringssl-with-bazel/src/crypto/x509/algorithm.c +6 -4
  771. data/third_party/boringssl-with-bazel/src/crypto/x509/t_crl.c +3 -3
  772. data/third_party/boringssl-with-bazel/src/crypto/x509/t_x509.c +1 -1
  773. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_cmp.c +7 -2
  774. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_ext.c +21 -18
  775. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_obj.c +1 -1
  776. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_set.c +24 -3
  777. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_trs.c +3 -3
  778. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_txt.c +67 -67
  779. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_v3.c +3 -3
  780. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_vfy.c +29 -35
  781. data/third_party/boringssl-with-bazel/src/crypto/x509/x509cset.c +13 -2
  782. data/third_party/boringssl-with-bazel/src/crypto/x509/x509name.c +9 -8
  783. data/third_party/boringssl-with-bazel/src/crypto/x509/x_all.c +10 -10
  784. data/third_party/boringssl-with-bazel/src/crypto/x509/x_crl.c +2 -2
  785. data/third_party/boringssl-with-bazel/src/crypto/x509/x_name.c +28 -40
  786. data/third_party/boringssl-with-bazel/src/crypto/x509/x_sig.c +20 -0
  787. data/third_party/boringssl-with-bazel/src/crypto/x509/x_x509.c +3 -1
  788. data/third_party/boringssl-with-bazel/src/crypto/x509v3/ext_dat.h +1 -4
  789. data/third_party/boringssl-with-bazel/src/crypto/x509v3/pcy_data.c +5 -3
  790. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_alt.c +14 -14
  791. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_conf.c +7 -3
  792. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_genn.c +2 -2
  793. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_info.c +1 -1
  794. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_prn.c +1 -1
  795. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_purp.c +55 -8
  796. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_skey.c +1 -1
  797. data/third_party/boringssl-with-bazel/src/include/openssl/aead.h +24 -0
  798. data/third_party/boringssl-with-bazel/src/include/openssl/arm_arch.h +54 -0
  799. data/third_party/boringssl-with-bazel/src/include/openssl/asn1.h +0 -1
  800. data/third_party/boringssl-with-bazel/src/include/openssl/base.h +6 -3
  801. data/third_party/boringssl-with-bazel/src/include/openssl/bio.h +4 -0
  802. data/third_party/boringssl-with-bazel/src/include/openssl/cipher.h +6 -0
  803. data/third_party/boringssl-with-bazel/src/include/openssl/crypto.h +1 -1
  804. data/third_party/boringssl-with-bazel/src/include/openssl/des.h +6 -0
  805. data/third_party/boringssl-with-bazel/src/include/openssl/dh.h +12 -0
  806. data/third_party/boringssl-with-bazel/src/include/openssl/digest.h +9 -0
  807. data/third_party/boringssl-with-bazel/src/include/openssl/evp.h +4 -1
  808. data/third_party/boringssl-with-bazel/src/include/openssl/opensslconf.h +3 -0
  809. data/third_party/boringssl-with-bazel/src/include/openssl/pem.h +202 -134
  810. data/third_party/boringssl-with-bazel/src/include/openssl/ssl.h +103 -10
  811. data/third_party/boringssl-with-bazel/src/include/openssl/tls1.h +5 -2
  812. data/third_party/boringssl-with-bazel/src/include/openssl/trust_token.h +42 -14
  813. data/third_party/boringssl-with-bazel/src/include/openssl/x509.h +199 -78
  814. data/third_party/boringssl-with-bazel/src/include/openssl/x509v3.h +482 -432
  815. data/third_party/boringssl-with-bazel/src/ssl/bio_ssl.cc +18 -5
  816. data/third_party/boringssl-with-bazel/src/ssl/handoff.cc +35 -0
  817. data/third_party/boringssl-with-bazel/src/ssl/handshake.cc +18 -18
  818. data/third_party/boringssl-with-bazel/src/ssl/handshake_client.cc +2 -3
  819. data/third_party/boringssl-with-bazel/src/ssl/handshake_server.cc +1 -1
  820. data/third_party/boringssl-with-bazel/src/ssl/internal.h +49 -10
  821. data/third_party/boringssl-with-bazel/src/ssl/ssl_asn1.cc +42 -1
  822. data/third_party/boringssl-with-bazel/src/ssl/ssl_cert.cc +3 -6
  823. data/third_party/boringssl-with-bazel/src/ssl/ssl_cipher.cc +8 -9
  824. data/third_party/boringssl-with-bazel/src/ssl/ssl_lib.cc +77 -0
  825. data/third_party/boringssl-with-bazel/src/ssl/ssl_session.cc +11 -14
  826. data/third_party/boringssl-with-bazel/src/ssl/t1_lib.cc +250 -20
  827. data/third_party/boringssl-with-bazel/src/ssl/tls13_both.cc +1 -2
  828. data/third_party/boringssl-with-bazel/src/ssl/tls13_client.cc +57 -19
  829. data/third_party/boringssl-with-bazel/src/ssl/tls13_server.cc +140 -41
  830. data/third_party/boringssl-with-bazel/src/ssl/tls_record.cc +5 -3
  831. data/third_party/upb/upb/decode.c +64 -15
  832. data/third_party/upb/upb/def.c +2169 -0
  833. data/third_party/upb/upb/def.h +330 -0
  834. data/third_party/upb/upb/def.hpp +525 -0
  835. data/third_party/upb/upb/encode.c +2 -2
  836. data/third_party/upb/upb/msg.h +2 -2
  837. data/third_party/upb/upb/port_def.inc +1 -1
  838. data/third_party/upb/upb/reflection.c +391 -0
  839. data/third_party/upb/upb/reflection.h +168 -0
  840. data/third_party/upb/upb/table.c +0 -11
  841. data/third_party/upb/upb/table.int.h +0 -9
  842. data/third_party/upb/upb/text_encode.c +398 -0
  843. data/third_party/upb/upb/text_encode.h +35 -0
  844. data/third_party/upb/upb/upb.c +16 -14
  845. data/third_party/upb/upb/upb.h +26 -0
  846. data/third_party/upb/upb/upb.hpp +2 -0
  847. metadata +489 -161
  848. data/src/core/ext/filters/client_channel/lb_policy/xds/lrs.cc +0 -528
  849. data/src/core/ext/filters/client_channel/lb_policy/xds/xds_routing.cc +0 -1143
  850. data/src/core/ext/filters/client_channel/xds/xds_api.cc +0 -2110
  851. data/src/core/ext/filters/client_channel/xds/xds_api.h +0 -345
  852. data/src/core/ext/filters/client_channel/xds/xds_channel.h +0 -46
  853. data/src/core/ext/filters/client_channel/xds/xds_channel_secure.cc +0 -106
  854. data/src/core/ext/upb-generated/envoy/api/v2/auth/cert.upb.c +0 -21
  855. data/src/core/ext/upb-generated/envoy/api/v2/auth/cert.upb.h +0 -34
  856. data/src/core/ext/upb-generated/envoy/api/v2/auth/common.upb.c +0 -114
  857. data/src/core/ext/upb-generated/envoy/api/v2/auth/common.upb.h +0 -429
  858. data/src/core/ext/upb-generated/envoy/api/v2/auth/secret.upb.c +0 -72
  859. data/src/core/ext/upb-generated/envoy/api/v2/auth/secret.upb.h +0 -198
  860. data/src/core/ext/upb-generated/envoy/api/v2/auth/tls.upb.c +0 -105
  861. data/src/core/ext/upb-generated/envoy/api/v2/auth/tls.upb.h +0 -388
  862. data/src/core/ext/upb-generated/envoy/api/v2/cds.upb.h +0 -52
  863. data/src/core/ext/upb-generated/envoy/api/v2/cluster.upb.c +0 -403
  864. data/src/core/ext/upb-generated/envoy/api/v2/cluster.upb.h +0 -1453
  865. data/src/core/ext/upb-generated/envoy/api/v2/cluster/circuit_breaker.upb.c +0 -74
  866. data/src/core/ext/upb-generated/envoy/api/v2/cluster/circuit_breaker.upb.h +0 -226
  867. data/src/core/ext/upb-generated/envoy/api/v2/cluster/filter.upb.h +0 -69
  868. data/src/core/ext/upb-generated/envoy/api/v2/cluster/outlier_detection.upb.h +0 -323
  869. data/src/core/ext/upb-generated/envoy/api/v2/core/address.upb.c +0 -112
  870. data/src/core/ext/upb-generated/envoy/api/v2/core/address.upb.h +0 -334
  871. data/src/core/ext/upb-generated/envoy/api/v2/core/backoff.upb.h +0 -79
  872. data/src/core/ext/upb-generated/envoy/api/v2/core/base.upb.c +0 -313
  873. data/src/core/ext/upb-generated/envoy/api/v2/core/base.upb.h +0 -891
  874. data/src/core/ext/upb-generated/envoy/api/v2/core/config_source.upb.c +0 -96
  875. data/src/core/ext/upb-generated/envoy/api/v2/core/config_source.upb.h +0 -328
  876. data/src/core/ext/upb-generated/envoy/api/v2/core/event_service_config.upb.c +0 -34
  877. data/src/core/ext/upb-generated/envoy/api/v2/core/event_service_config.upb.h +0 -71
  878. data/src/core/ext/upb-generated/envoy/api/v2/core/grpc_service.upb.c +0 -197
  879. data/src/core/ext/upb-generated/envoy/api/v2/core/grpc_service.upb.h +0 -649
  880. data/src/core/ext/upb-generated/envoy/api/v2/core/health_check.upb.c +0 -172
  881. data/src/core/ext/upb-generated/envoy/api/v2/core/health_check.upb.h +0 -693
  882. data/src/core/ext/upb-generated/envoy/api/v2/core/http_uri.upb.h +0 -80
  883. data/src/core/ext/upb-generated/envoy/api/v2/core/protocol.upb.c +0 -152
  884. data/src/core/ext/upb-generated/envoy/api/v2/core/protocol.upb.h +0 -536
  885. data/src/core/ext/upb-generated/envoy/api/v2/core/socket_option.upb.h +0 -88
  886. data/src/core/ext/upb-generated/envoy/api/v2/discovery.upb.c +0 -129
  887. data/src/core/ext/upb-generated/envoy/api/v2/discovery.upb.h +0 -386
  888. data/src/core/ext/upb-generated/envoy/api/v2/eds.upb.h +0 -52
  889. data/src/core/ext/upb-generated/envoy/api/v2/endpoint.upb.c +0 -92
  890. data/src/core/ext/upb-generated/envoy/api/v2/endpoint.upb.h +0 -224
  891. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint.upb.c +0 -18
  892. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint.upb.h +0 -32
  893. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint_components.upb.c +0 -91
  894. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint_components.upb.h +0 -273
  895. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/load_report.upb.c +0 -112
  896. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/load_report.upb.h +0 -332
  897. data/src/core/ext/upb-generated/envoy/api/v2/lds.upb.h +0 -52
  898. data/src/core/ext/upb-generated/envoy/api/v2/listener.upb.c +0 -109
  899. data/src/core/ext/upb-generated/envoy/api/v2/listener.upb.h +0 -415
  900. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener.upb.c +0 -18
  901. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener.upb.h +0 -32
  902. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener_components.upb.c +0 -145
  903. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener_components.upb.h +0 -538
  904. data/src/core/ext/upb-generated/envoy/api/v2/listener/udp_listener_config.upb.c +0 -43
  905. data/src/core/ext/upb-generated/envoy/api/v2/listener/udp_listener_config.upb.h +0 -111
  906. data/src/core/ext/upb-generated/envoy/api/v2/rds.upb.h +0 -52
  907. data/src/core/ext/upb-generated/envoy/api/v2/route.upb.c +0 -63
  908. data/src/core/ext/upb-generated/envoy/api/v2/route.upb.h +0 -204
  909. data/src/core/ext/upb-generated/envoy/api/v2/route/route.upb.c +0 -18
  910. data/src/core/ext/upb-generated/envoy/api/v2/route/route.upb.h +0 -32
  911. data/src/core/ext/upb-generated/envoy/api/v2/route/route_components.upb.c +0 -815
  912. data/src/core/ext/upb-generated/envoy/api/v2/route/route_components.upb.h +0 -2984
  913. data/src/core/ext/upb-generated/envoy/api/v2/scoped_route.upb.c +0 -59
  914. data/src/core/ext/upb-generated/envoy/api/v2/scoped_route.upb.h +0 -135
  915. data/src/core/ext/upb-generated/envoy/api/v2/srds.upb.h +0 -52
  916. data/src/core/ext/upb-generated/envoy/config/filter/accesslog/v2/accesslog.upb.c +0 -228
  917. data/src/core/ext/upb-generated/envoy/config/filter/accesslog/v2/accesslog.upb.h +0 -732
  918. data/src/core/ext/upb-generated/envoy/config/filter/network/http_connection_manager/v2/http_connection_manager.upb.c +0 -316
  919. data/src/core/ext/upb-generated/envoy/config/filter/network/http_connection_manager/v2/http_connection_manager.upb.h +0 -1167
  920. data/src/core/ext/upb-generated/envoy/config/listener/v2/api_listener.upb.h +0 -65
  921. data/src/core/ext/upb-generated/envoy/config/trace/v2/http_tracer.upb.c +0 -51
  922. data/src/core/ext/upb-generated/envoy/config/trace/v2/http_tracer.upb.h +0 -125
  923. data/src/core/ext/upb-generated/envoy/service/discovery/v2/ads.upb.h +0 -49
  924. data/src/core/ext/upb-generated/envoy/service/load_stats/v2/lrs.upb.c +0 -54
  925. data/src/core/ext/upb-generated/envoy/service/load_stats/v2/lrs.upb.h +0 -136
  926. data/src/core/ext/upb-generated/envoy/type/matcher/regex.upb.c +0 -63
  927. data/src/core/ext/upb-generated/envoy/type/matcher/regex.upb.h +0 -145
  928. data/src/core/ext/upb-generated/envoy/type/matcher/string.upb.c +0 -53
  929. data/src/core/ext/upb-generated/envoy/type/matcher/string.upb.h +0 -133
  930. data/src/core/ext/upb-generated/envoy/type/metadata/v2/metadata.upb.c +0 -88
  931. data/src/core/ext/upb-generated/envoy/type/metadata/v2/metadata.upb.h +0 -258
  932. data/src/core/ext/upb-generated/envoy/type/percent.upb.h +0 -86
  933. data/src/core/ext/upb-generated/envoy/type/range.upb.h +0 -111
  934. data/src/core/ext/upb-generated/envoy/type/semantic_version.upb.h +0 -61
  935. data/src/core/ext/upb-generated/envoy/type/tracing/v2/custom_tag.upb.c +0 -89
  936. data/src/core/ext/upb-generated/envoy/type/tracing/v2/custom_tag.upb.h +0 -250
  937. data/src/core/ext/upb-generated/gogoproto/gogo.upb.c +0 -17
  938. data/src/core/lib/security/transport/target_authority_table.cc +0 -75
  939. data/src/core/lib/security/transport/target_authority_table.h +0 -40
  940. data/src/core/lib/slice/slice_hash_table.h +0 -199
  941. data/src/core/lib/slice/slice_weak_hash_table.h +0 -102
  942. data/third_party/abseil-cpp/absl/base/dynamic_annotations.cc +0 -129
  943. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_pku.c +0 -110
  944. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_sxnet.c +0 -274
@@ -0,0 +1,38 @@
1
+ // Copyright 2019 The Abseil Authors.
2
+ //
3
+ // Licensed under the Apache License, Version 2.0 (the "License");
4
+ // you may not use this file except in compliance with the License.
5
+ // You may obtain a copy of the License at
6
+ //
7
+ // https://www.apache.org/licenses/LICENSE-2.0
8
+ //
9
+ // Unless required by applicable law or agreed to in writing, software
10
+ // distributed under the License is distributed on an "AS IS" BASIS,
11
+ // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
+ // See the License for the specific language governing permissions and
13
+ // limitations under the License.
14
+ #include "absl/status/status_payload_printer.h"
15
+
16
+ #include <atomic>
17
+
18
+ #include "absl/base/attributes.h"
19
+ #include "absl/base/internal/atomic_hook.h"
20
+
21
+ namespace absl {
22
+ ABSL_NAMESPACE_BEGIN
23
+ namespace status_internal {
24
+
25
+ ABSL_INTERNAL_ATOMIC_HOOK_ATTRIBUTES
26
+ static absl::base_internal::AtomicHook<StatusPayloadPrinter> storage;
27
+
28
+ void SetStatusPayloadPrinter(StatusPayloadPrinter printer) {
29
+ storage.Store(printer);
30
+ }
31
+
32
+ StatusPayloadPrinter GetStatusPayloadPrinter() {
33
+ return storage.Load();
34
+ }
35
+
36
+ } // namespace status_internal
37
+ ABSL_NAMESPACE_END
38
+ } // namespace absl
@@ -0,0 +1,51 @@
1
+ // Copyright 2019 The Abseil Authors.
2
+ //
3
+ // Licensed under the Apache License, Version 2.0 (the "License");
4
+ // you may not use this file except in compliance with the License.
5
+ // You may obtain a copy of the License at
6
+ //
7
+ // https://www.apache.org/licenses/LICENSE-2.0
8
+ //
9
+ // Unless required by applicable law or agreed to in writing, software
10
+ // distributed under the License is distributed on an "AS IS" BASIS,
11
+ // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
+ // See the License for the specific language governing permissions and
13
+ // limitations under the License.
14
+ #ifndef ABSL_STATUS_STATUS_PAYLOAD_PRINTER_H_
15
+ #define ABSL_STATUS_STATUS_PAYLOAD_PRINTER_H_
16
+
17
+ #include <string>
18
+
19
+ #include "absl/strings/cord.h"
20
+ #include "absl/strings/string_view.h"
21
+ #include "absl/types/optional.h"
22
+
23
+ namespace absl {
24
+ ABSL_NAMESPACE_BEGIN
25
+ namespace status_internal {
26
+
27
+ // By default, `Status::ToString` and `operator<<(Status)` print a payload by
28
+ // dumping the type URL and the raw bytes. To help debugging, we provide an
29
+ // extension point, which is a global printer function that can be set by users
30
+ // to specify how to print payloads. The function takes the type URL and the
31
+ // payload as input, and should return a valid human-readable string on success
32
+ // or `absl::nullopt` on failure (in which case it falls back to the default
33
+ // approach of printing the raw bytes).
34
+ // NOTE: This is an internal API and the design is subject to change in the
35
+ // future in a non-backward-compatible way. Since it's only meant for debugging
36
+ // purpose, you should not rely on it in any critical logic.
37
+ using StatusPayloadPrinter = absl::optional<std::string> (*)(absl::string_view,
38
+ const absl::Cord&);
39
+
40
+ // Sets the global payload printer. Only one printer should be set per process.
41
+ // If multiple printers are set, it's undefined which one will be used.
42
+ void SetStatusPayloadPrinter(StatusPayloadPrinter);
43
+
44
+ // Returns the global payload printer if previously set, otherwise `nullptr`.
45
+ StatusPayloadPrinter GetStatusPayloadPrinter();
46
+
47
+ } // namespace status_internal
48
+ ABSL_NAMESPACE_END
49
+ } // namespace absl
50
+
51
+ #endif // ABSL_STATUS_STATUS_PAYLOAD_PRINTER_H_
@@ -619,10 +619,10 @@ from_chars_result FromCharsImpl(const char* first, const char* last,
619
619
  // Either we failed to parse a hex float after the "0x", or we read
620
620
  // "0xinf" or "0xnan" which we don't want to match.
621
621
  //
622
- // However, a std::string that begins with "0x" also begins with "0", which
622
+ // However, a string that begins with "0x" also begins with "0", which
623
623
  // is normally a valid match for the number zero. So we want these
624
624
  // strings to match zero unless fmt_flags is `scientific`. (This flag
625
- // means an exponent is required, which the std::string "0" does not have.)
625
+ // means an exponent is required, which the string "0" does not have.)
626
626
  if (fmt_flags == chars_format::scientific) {
627
627
  result.ec = std::errc::invalid_argument;
628
628
  } else {
@@ -0,0 +1,1998 @@
1
+ // Copyright 2020 The Abseil Authors.
2
+ //
3
+ // Licensed under the Apache License, Version 2.0 (the "License");
4
+ // you may not use this file except in compliance with the License.
5
+ // You may obtain a copy of the License at
6
+ //
7
+ // https://www.apache.org/licenses/LICENSE-2.0
8
+ //
9
+ // Unless required by applicable law or agreed to in writing, software
10
+ // distributed under the License is distributed on an "AS IS" BASIS,
11
+ // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
+ // See the License for the specific language governing permissions and
13
+ // limitations under the License.
14
+
15
+ #include "absl/strings/cord.h"
16
+
17
+ #include <algorithm>
18
+ #include <atomic>
19
+ #include <cstddef>
20
+ #include <cstdio>
21
+ #include <cstdlib>
22
+ #include <iomanip>
23
+ #include <iostream>
24
+ #include <limits>
25
+ #include <ostream>
26
+ #include <sstream>
27
+ #include <type_traits>
28
+ #include <unordered_set>
29
+ #include <vector>
30
+
31
+ #include "absl/base/casts.h"
32
+ #include "absl/base/internal/raw_logging.h"
33
+ #include "absl/base/macros.h"
34
+ #include "absl/base/port.h"
35
+ #include "absl/container/fixed_array.h"
36
+ #include "absl/container/inlined_vector.h"
37
+ #include "absl/strings/escaping.h"
38
+ #include "absl/strings/internal/cord_internal.h"
39
+ #include "absl/strings/internal/resize_uninitialized.h"
40
+ #include "absl/strings/str_cat.h"
41
+ #include "absl/strings/str_format.h"
42
+ #include "absl/strings/str_join.h"
43
+ #include "absl/strings/string_view.h"
44
+
45
+ namespace absl {
46
+ ABSL_NAMESPACE_BEGIN
47
+
48
+ using ::absl::cord_internal::CordRep;
49
+ using ::absl::cord_internal::CordRepConcat;
50
+ using ::absl::cord_internal::CordRepExternal;
51
+ using ::absl::cord_internal::CordRepSubstring;
52
+
53
+ // Various representations that we allow
54
+ enum CordRepKind {
55
+ CONCAT = 0,
56
+ EXTERNAL = 1,
57
+ SUBSTRING = 2,
58
+
59
+ // We have different tags for different sized flat arrays,
60
+ // starting with FLAT
61
+ FLAT = 3,
62
+ };
63
+
64
+ namespace cord_internal {
65
+
66
+ inline CordRepConcat* CordRep::concat() {
67
+ assert(tag == CONCAT);
68
+ return static_cast<CordRepConcat*>(this);
69
+ }
70
+
71
+ inline const CordRepConcat* CordRep::concat() const {
72
+ assert(tag == CONCAT);
73
+ return static_cast<const CordRepConcat*>(this);
74
+ }
75
+
76
+ inline CordRepSubstring* CordRep::substring() {
77
+ assert(tag == SUBSTRING);
78
+ return static_cast<CordRepSubstring*>(this);
79
+ }
80
+
81
+ inline const CordRepSubstring* CordRep::substring() const {
82
+ assert(tag == SUBSTRING);
83
+ return static_cast<const CordRepSubstring*>(this);
84
+ }
85
+
86
+ inline CordRepExternal* CordRep::external() {
87
+ assert(tag == EXTERNAL);
88
+ return static_cast<CordRepExternal*>(this);
89
+ }
90
+
91
+ inline const CordRepExternal* CordRep::external() const {
92
+ assert(tag == EXTERNAL);
93
+ return static_cast<const CordRepExternal*>(this);
94
+ }
95
+
96
+ } // namespace cord_internal
97
+
98
+ static const size_t kFlatOverhead = offsetof(CordRep, data);
99
+
100
+ // Largest and smallest flat node lengths we are willing to allocate
101
+ // Flat allocation size is stored in tag, which currently can encode sizes up
102
+ // to 4K, encoded as multiple of either 8 or 32 bytes.
103
+ // If we allow for larger sizes, we need to change this to 8/64, 16/128, etc.
104
+ static constexpr size_t kMaxFlatSize = 4096;
105
+ static constexpr size_t kMaxFlatLength = kMaxFlatSize - kFlatOverhead;
106
+ static constexpr size_t kMinFlatLength = 32 - kFlatOverhead;
107
+
108
+ // Prefer copying blocks of at most this size, otherwise reference count.
109
+ static const size_t kMaxBytesToCopy = 511;
110
+
111
+ // Helper functions for rounded div, and rounding to exact sizes.
112
+ static size_t DivUp(size_t n, size_t m) { return (n + m - 1) / m; }
113
+ static size_t RoundUp(size_t n, size_t m) { return DivUp(n, m) * m; }
114
+
115
+ // Returns the size to the nearest equal or larger value that can be
116
+ // expressed exactly as a tag value.
117
+ static size_t RoundUpForTag(size_t size) {
118
+ return RoundUp(size, (size <= 1024) ? 8 : 32);
119
+ }
120
+
121
+ // Converts the allocated size to a tag, rounding down if the size
122
+ // does not exactly match a 'tag expressible' size value. The result is
123
+ // undefined if the size exceeds the maximum size that can be encoded in
124
+ // a tag, i.e., if size is larger than TagToAllocatedSize(<max tag>).
125
+ static uint8_t AllocatedSizeToTag(size_t size) {
126
+ const size_t tag = (size <= 1024) ? size / 8 : 128 + size / 32 - 1024 / 32;
127
+ assert(tag <= std::numeric_limits<uint8_t>::max());
128
+ return tag;
129
+ }
130
+
131
+ // Converts the provided tag to the corresponding allocated size
132
+ static constexpr size_t TagToAllocatedSize(uint8_t tag) {
133
+ return (tag <= 128) ? (tag * 8) : (1024 + (tag - 128) * 32);
134
+ }
135
+
136
+ // Converts the provided tag to the corresponding available data length
137
+ static constexpr size_t TagToLength(uint8_t tag) {
138
+ return TagToAllocatedSize(tag) - kFlatOverhead;
139
+ }
140
+
141
+ // Enforce that kMaxFlatSize maps to a well-known exact tag value.
142
+ static_assert(TagToAllocatedSize(224) == kMaxFlatSize, "Bad tag logic");
143
+
144
+ constexpr uint64_t Fibonacci(unsigned char n, uint64_t a = 0, uint64_t b = 1) {
145
+ return n == 0 ? a : Fibonacci(n - 1, b, a + b);
146
+ }
147
+
148
+ static_assert(Fibonacci(63) == 6557470319842,
149
+ "Fibonacci values computed incorrectly");
150
+
151
+ // Minimum length required for a given depth tree -- a tree is considered
152
+ // balanced if
153
+ // length(t) >= min_length[depth(t)]
154
+ // The root node depth is allowed to become twice as large to reduce rebalancing
155
+ // for larger strings (see IsRootBalanced).
156
+ static constexpr uint64_t min_length[] = {
157
+ Fibonacci(2), Fibonacci(3), Fibonacci(4), Fibonacci(5),
158
+ Fibonacci(6), Fibonacci(7), Fibonacci(8), Fibonacci(9),
159
+ Fibonacci(10), Fibonacci(11), Fibonacci(12), Fibonacci(13),
160
+ Fibonacci(14), Fibonacci(15), Fibonacci(16), Fibonacci(17),
161
+ Fibonacci(18), Fibonacci(19), Fibonacci(20), Fibonacci(21),
162
+ Fibonacci(22), Fibonacci(23), Fibonacci(24), Fibonacci(25),
163
+ Fibonacci(26), Fibonacci(27), Fibonacci(28), Fibonacci(29),
164
+ Fibonacci(30), Fibonacci(31), Fibonacci(32), Fibonacci(33),
165
+ Fibonacci(34), Fibonacci(35), Fibonacci(36), Fibonacci(37),
166
+ Fibonacci(38), Fibonacci(39), Fibonacci(40), Fibonacci(41),
167
+ Fibonacci(42), Fibonacci(43), Fibonacci(44), Fibonacci(45),
168
+ Fibonacci(46), Fibonacci(47),
169
+ 0xffffffffffffffffull, // Avoid overflow
170
+ };
171
+
172
+ static const int kMinLengthSize = ABSL_ARRAYSIZE(min_length);
173
+
174
+ // The inlined size to use with absl::InlinedVector.
175
+ //
176
+ // Note: The InlinedVectors in this file (and in cord.h) do not need to use
177
+ // the same value for their inlined size. The fact that they do is historical.
178
+ // It may be desirable for each to use a different inlined size optimized for
179
+ // that InlinedVector's usage.
180
+ //
181
+ // TODO(jgm): Benchmark to see if there's a more optimal value than 47 for
182
+ // the inlined vector size (47 exists for backward compatibility).
183
+ static const int kInlinedVectorSize = 47;
184
+
185
+ static inline bool IsRootBalanced(CordRep* node) {
186
+ if (node->tag != CONCAT) {
187
+ return true;
188
+ } else if (node->concat()->depth() <= 15) {
189
+ return true;
190
+ } else if (node->concat()->depth() > kMinLengthSize) {
191
+ return false;
192
+ } else {
193
+ // Allow depth to become twice as large as implied by fibonacci rule to
194
+ // reduce rebalancing for larger strings.
195
+ return (node->length >= min_length[node->concat()->depth() / 2]);
196
+ }
197
+ }
198
+
199
+ static CordRep* Rebalance(CordRep* node);
200
+ static void DumpNode(CordRep* rep, bool include_data, std::ostream* os);
201
+ static bool VerifyNode(CordRep* root, CordRep* start_node,
202
+ bool full_validation);
203
+
204
+ static inline CordRep* VerifyTree(CordRep* node) {
205
+ // Verification is expensive, so only do it in debug mode.
206
+ // Even in debug mode we normally do only light validation.
207
+ // If you are debugging Cord itself, you should define the
208
+ // macro EXTRA_CORD_VALIDATION, e.g. by adding
209
+ // --copt=-DEXTRA_CORD_VALIDATION to the blaze line.
210
+ #ifdef EXTRA_CORD_VALIDATION
211
+ assert(node == nullptr || VerifyNode(node, node, /*full_validation=*/true));
212
+ #else // EXTRA_CORD_VALIDATION
213
+ assert(node == nullptr || VerifyNode(node, node, /*full_validation=*/false));
214
+ #endif // EXTRA_CORD_VALIDATION
215
+ static_cast<void>(&VerifyNode);
216
+
217
+ return node;
218
+ }
219
+
220
+ // --------------------------------------------------------------------
221
+ // Memory management
222
+
223
+ inline CordRep* Ref(CordRep* rep) {
224
+ if (rep != nullptr) {
225
+ rep->refcount.Increment();
226
+ }
227
+ return rep;
228
+ }
229
+
230
+ // This internal routine is called from the cold path of Unref below. Keeping it
231
+ // in a separate routine allows good inlining of Unref into many profitable call
232
+ // sites. However, the call to this function can be highly disruptive to the
233
+ // register pressure in those callers. To minimize the cost to callers, we use
234
+ // a special LLVM calling convention that preserves most registers. This allows
235
+ // the call to this routine in cold paths to not disrupt the caller's register
236
+ // pressure. This calling convention is not available on all platforms; we
237
+ // intentionally allow LLVM to ignore the attribute rather than attempting to
238
+ // hardcode the list of supported platforms.
239
+ #if defined(__clang__) && !defined(__i386__)
240
+ #pragma clang diagnostic push
241
+ #pragma clang diagnostic ignored "-Wattributes"
242
+ __attribute__((preserve_most))
243
+ #pragma clang diagnostic pop
244
+ #endif
245
+ static void UnrefInternal(CordRep* rep) {
246
+ assert(rep != nullptr);
247
+
248
+ absl::InlinedVector<CordRep*, kInlinedVectorSize> pending;
249
+ while (true) {
250
+ if (rep->tag == CONCAT) {
251
+ CordRepConcat* rep_concat = rep->concat();
252
+ CordRep* right = rep_concat->right;
253
+ if (!right->refcount.Decrement()) {
254
+ pending.push_back(right);
255
+ }
256
+ CordRep* left = rep_concat->left;
257
+ delete rep_concat;
258
+ rep = nullptr;
259
+ if (!left->refcount.Decrement()) {
260
+ rep = left;
261
+ continue;
262
+ }
263
+ } else if (rep->tag == EXTERNAL) {
264
+ CordRepExternal* rep_external = rep->external();
265
+ rep_external->releaser_invoker(rep_external);
266
+ rep = nullptr;
267
+ } else if (rep->tag == SUBSTRING) {
268
+ CordRepSubstring* rep_substring = rep->substring();
269
+ CordRep* child = rep_substring->child;
270
+ delete rep_substring;
271
+ rep = nullptr;
272
+ if (!child->refcount.Decrement()) {
273
+ rep = child;
274
+ continue;
275
+ }
276
+ } else {
277
+ // Flat CordReps are allocated and constructed with raw ::operator new
278
+ // and placement new, and must be destructed and deallocated
279
+ // accordingly.
280
+ #if defined(__cpp_sized_deallocation)
281
+ size_t size = TagToAllocatedSize(rep->tag);
282
+ rep->~CordRep();
283
+ ::operator delete(rep, size);
284
+ #else
285
+ rep->~CordRep();
286
+ ::operator delete(rep);
287
+ #endif
288
+ rep = nullptr;
289
+ }
290
+
291
+ if (!pending.empty()) {
292
+ rep = pending.back();
293
+ pending.pop_back();
294
+ } else {
295
+ break;
296
+ }
297
+ }
298
+ }
299
+
300
+ inline void Unref(CordRep* rep) {
301
+ // Fast-path for two common, hot cases: a null rep and a shared root.
302
+ if (ABSL_PREDICT_TRUE(rep == nullptr ||
303
+ rep->refcount.DecrementExpectHighRefcount())) {
304
+ return;
305
+ }
306
+
307
+ UnrefInternal(rep);
308
+ }
309
+
310
+ // Return the depth of a node
311
+ static int Depth(const CordRep* rep) {
312
+ if (rep->tag == CONCAT) {
313
+ return rep->concat()->depth();
314
+ } else {
315
+ return 0;
316
+ }
317
+ }
318
+
319
+ static void SetConcatChildren(CordRepConcat* concat, CordRep* left,
320
+ CordRep* right) {
321
+ concat->left = left;
322
+ concat->right = right;
323
+
324
+ concat->length = left->length + right->length;
325
+ concat->set_depth(1 + std::max(Depth(left), Depth(right)));
326
+ }
327
+
328
+ // Create a concatenation of the specified nodes.
329
+ // Does not change the refcounts of "left" and "right".
330
+ // The returned node has a refcount of 1.
331
+ static CordRep* RawConcat(CordRep* left, CordRep* right) {
332
+ // Avoid making degenerate concat nodes (one child is empty)
333
+ if (left == nullptr || left->length == 0) {
334
+ Unref(left);
335
+ return right;
336
+ }
337
+ if (right == nullptr || right->length == 0) {
338
+ Unref(right);
339
+ return left;
340
+ }
341
+
342
+ CordRepConcat* rep = new CordRepConcat();
343
+ rep->tag = CONCAT;
344
+ SetConcatChildren(rep, left, right);
345
+
346
+ return rep;
347
+ }
348
+
349
+ static CordRep* Concat(CordRep* left, CordRep* right) {
350
+ CordRep* rep = RawConcat(left, right);
351
+ if (rep != nullptr && !IsRootBalanced(rep)) {
352
+ rep = Rebalance(rep);
353
+ }
354
+ return VerifyTree(rep);
355
+ }
356
+
357
+ // Make a balanced tree out of an array of leaf nodes.
358
+ static CordRep* MakeBalancedTree(CordRep** reps, size_t n) {
359
+ // Make repeated passes over the array, merging adjacent pairs
360
+ // until we are left with just a single node.
361
+ while (n > 1) {
362
+ size_t dst = 0;
363
+ for (size_t src = 0; src < n; src += 2) {
364
+ if (src + 1 < n) {
365
+ reps[dst] = Concat(reps[src], reps[src + 1]);
366
+ } else {
367
+ reps[dst] = reps[src];
368
+ }
369
+ dst++;
370
+ }
371
+ n = dst;
372
+ }
373
+
374
+ return reps[0];
375
+ }
376
+
377
+ // Create a new flat node.
378
+ static CordRep* NewFlat(size_t length_hint) {
379
+ if (length_hint <= kMinFlatLength) {
380
+ length_hint = kMinFlatLength;
381
+ } else if (length_hint > kMaxFlatLength) {
382
+ length_hint = kMaxFlatLength;
383
+ }
384
+
385
+ // Round size up so it matches a size we can exactly express in a tag.
386
+ const size_t size = RoundUpForTag(length_hint + kFlatOverhead);
387
+ void* const raw_rep = ::operator new(size);
388
+ CordRep* rep = new (raw_rep) CordRep();
389
+ rep->tag = AllocatedSizeToTag(size);
390
+ return VerifyTree(rep);
391
+ }
392
+
393
+ // Create a new tree out of the specified array.
394
+ // The returned node has a refcount of 1.
395
+ static CordRep* NewTree(const char* data,
396
+ size_t length,
397
+ size_t alloc_hint) {
398
+ if (length == 0) return nullptr;
399
+ absl::FixedArray<CordRep*> reps((length - 1) / kMaxFlatLength + 1);
400
+ size_t n = 0;
401
+ do {
402
+ const size_t len = std::min(length, kMaxFlatLength);
403
+ CordRep* rep = NewFlat(len + alloc_hint);
404
+ rep->length = len;
405
+ memcpy(rep->data, data, len);
406
+ reps[n++] = VerifyTree(rep);
407
+ data += len;
408
+ length -= len;
409
+ } while (length != 0);
410
+ return MakeBalancedTree(reps.data(), n);
411
+ }
412
+
413
+ namespace cord_internal {
414
+
415
+ void InitializeCordRepExternal(absl::string_view data, CordRepExternal* rep) {
416
+ assert(!data.empty());
417
+ rep->length = data.size();
418
+ rep->tag = EXTERNAL;
419
+ rep->base = data.data();
420
+ VerifyTree(rep);
421
+ }
422
+
423
+ } // namespace cord_internal
424
+
425
+ static CordRep* NewSubstring(CordRep* child, size_t offset, size_t length) {
426
+ // Never create empty substring nodes
427
+ if (length == 0) {
428
+ Unref(child);
429
+ return nullptr;
430
+ } else {
431
+ CordRepSubstring* rep = new CordRepSubstring();
432
+ assert((offset + length) <= child->length);
433
+ rep->length = length;
434
+ rep->tag = SUBSTRING;
435
+ rep->start = offset;
436
+ rep->child = child;
437
+ return VerifyTree(rep);
438
+ }
439
+ }
440
+
441
+ // --------------------------------------------------------------------
442
+ // Cord::InlineRep functions
443
+
444
+ constexpr unsigned char Cord::InlineRep::kMaxInline;
445
+
446
+ inline void Cord::InlineRep::set_data(const char* data, size_t n,
447
+ bool nullify_tail) {
448
+ static_assert(kMaxInline == 15, "set_data is hard-coded for a length of 15");
449
+
450
+ cord_internal::SmallMemmove(data_, data, n, nullify_tail);
451
+ data_[kMaxInline] = static_cast<char>(n);
452
+ }
453
+
454
+ inline char* Cord::InlineRep::set_data(size_t n) {
455
+ assert(n <= kMaxInline);
456
+ memset(data_, 0, sizeof(data_));
457
+ data_[kMaxInline] = static_cast<char>(n);
458
+ return data_;
459
+ }
460
+
461
+ inline CordRep* Cord::InlineRep::force_tree(size_t extra_hint) {
462
+ size_t len = data_[kMaxInline];
463
+ CordRep* result;
464
+ if (len > kMaxInline) {
465
+ memcpy(&result, data_, sizeof(result));
466
+ } else {
467
+ result = NewFlat(len + extra_hint);
468
+ result->length = len;
469
+ memcpy(result->data, data_, len);
470
+ set_tree(result);
471
+ }
472
+ return result;
473
+ }
474
+
475
+ inline void Cord::InlineRep::reduce_size(size_t n) {
476
+ size_t tag = data_[kMaxInline];
477
+ assert(tag <= kMaxInline);
478
+ assert(tag >= n);
479
+ tag -= n;
480
+ memset(data_ + tag, 0, n);
481
+ data_[kMaxInline] = static_cast<char>(tag);
482
+ }
483
+
484
+ inline void Cord::InlineRep::remove_prefix(size_t n) {
485
+ cord_internal::SmallMemmove(data_, data_ + n, data_[kMaxInline] - n);
486
+ reduce_size(n);
487
+ }
488
+
489
+ void Cord::InlineRep::AppendTree(CordRep* tree) {
490
+ if (tree == nullptr) return;
491
+ size_t len = data_[kMaxInline];
492
+ if (len == 0) {
493
+ set_tree(tree);
494
+ } else {
495
+ set_tree(Concat(force_tree(0), tree));
496
+ }
497
+ }
498
+
499
+ void Cord::InlineRep::PrependTree(CordRep* tree) {
500
+ assert(tree != nullptr);
501
+ size_t len = data_[kMaxInline];
502
+ if (len == 0) {
503
+ set_tree(tree);
504
+ } else {
505
+ set_tree(Concat(tree, force_tree(0)));
506
+ }
507
+ }
508
+
509
+ // Searches for a non-full flat node at the rightmost leaf of the tree. If a
510
+ // suitable leaf is found, the function will update the length field for all
511
+ // nodes to account for the size increase. The append region address will be
512
+ // written to region and the actual size increase will be written to size.
513
+ static inline bool PrepareAppendRegion(CordRep* root, char** region,
514
+ size_t* size, size_t max_length) {
515
+ // Search down the right-hand path for a non-full FLAT node.
516
+ CordRep* dst = root;
517
+ while (dst->tag == CONCAT && dst->refcount.IsOne()) {
518
+ dst = dst->concat()->right;
519
+ }
520
+
521
+ if (dst->tag < FLAT || !dst->refcount.IsOne()) {
522
+ *region = nullptr;
523
+ *size = 0;
524
+ return false;
525
+ }
526
+
527
+ const size_t in_use = dst->length;
528
+ const size_t capacity = TagToLength(dst->tag);
529
+ if (in_use == capacity) {
530
+ *region = nullptr;
531
+ *size = 0;
532
+ return false;
533
+ }
534
+
535
+ size_t size_increase = std::min(capacity - in_use, max_length);
536
+
537
+ // We need to update the length fields for all nodes, including the leaf node.
538
+ for (CordRep* rep = root; rep != dst; rep = rep->concat()->right) {
539
+ rep->length += size_increase;
540
+ }
541
+ dst->length += size_increase;
542
+
543
+ *region = dst->data + in_use;
544
+ *size = size_increase;
545
+ return true;
546
+ }
547
+
548
+ void Cord::InlineRep::GetAppendRegion(char** region, size_t* size,
549
+ size_t max_length) {
550
+ if (max_length == 0) {
551
+ *region = nullptr;
552
+ *size = 0;
553
+ return;
554
+ }
555
+
556
+ // Try to fit in the inline buffer if possible.
557
+ size_t inline_length = data_[kMaxInline];
558
+ if (inline_length < kMaxInline && max_length <= kMaxInline - inline_length) {
559
+ *region = data_ + inline_length;
560
+ *size = max_length;
561
+ data_[kMaxInline] = static_cast<char>(inline_length + max_length);
562
+ return;
563
+ }
564
+
565
+ CordRep* root = force_tree(max_length);
566
+
567
+ if (PrepareAppendRegion(root, region, size, max_length)) {
568
+ return;
569
+ }
570
+
571
+ // Allocate new node.
572
+ CordRep* new_node =
573
+ NewFlat(std::max(static_cast<size_t>(root->length), max_length));
574
+ new_node->length =
575
+ std::min(static_cast<size_t>(TagToLength(new_node->tag)), max_length);
576
+ *region = new_node->data;
577
+ *size = new_node->length;
578
+ replace_tree(Concat(root, new_node));
579
+ }
580
+
581
+ void Cord::InlineRep::GetAppendRegion(char** region, size_t* size) {
582
+ const size_t max_length = std::numeric_limits<size_t>::max();
583
+
584
+ // Try to fit in the inline buffer if possible.
585
+ size_t inline_length = data_[kMaxInline];
586
+ if (inline_length < kMaxInline) {
587
+ *region = data_ + inline_length;
588
+ *size = kMaxInline - inline_length;
589
+ data_[kMaxInline] = kMaxInline;
590
+ return;
591
+ }
592
+
593
+ CordRep* root = force_tree(max_length);
594
+
595
+ if (PrepareAppendRegion(root, region, size, max_length)) {
596
+ return;
597
+ }
598
+
599
+ // Allocate new node.
600
+ CordRep* new_node = NewFlat(root->length);
601
+ new_node->length = TagToLength(new_node->tag);
602
+ *region = new_node->data;
603
+ *size = new_node->length;
604
+ replace_tree(Concat(root, new_node));
605
+ }
606
+
607
+ // If the rep is a leaf, this will increment the value at total_mem_usage and
608
+ // will return true.
609
+ static bool RepMemoryUsageLeaf(const CordRep* rep, size_t* total_mem_usage) {
610
+ if (rep->tag >= FLAT) {
611
+ *total_mem_usage += TagToAllocatedSize(rep->tag);
612
+ return true;
613
+ }
614
+ if (rep->tag == EXTERNAL) {
615
+ *total_mem_usage += sizeof(CordRepConcat) + rep->length;
616
+ return true;
617
+ }
618
+ return false;
619
+ }
620
+
621
+ void Cord::InlineRep::AssignSlow(const Cord::InlineRep& src) {
622
+ ClearSlow();
623
+
624
+ memcpy(data_, src.data_, sizeof(data_));
625
+ if (is_tree()) {
626
+ Ref(tree());
627
+ }
628
+ }
629
+
630
+ void Cord::InlineRep::ClearSlow() {
631
+ if (is_tree()) {
632
+ Unref(tree());
633
+ }
634
+ memset(data_, 0, sizeof(data_));
635
+ }
636
+
637
+ // --------------------------------------------------------------------
638
+ // Constructors and destructors
639
+
640
+ Cord::Cord(const Cord& src) : contents_(src.contents_) {
641
+ Ref(contents_.tree()); // Does nothing if contents_ has embedded data
642
+ }
643
+
644
+ Cord::Cord(absl::string_view src) {
645
+ const size_t n = src.size();
646
+ if (n <= InlineRep::kMaxInline) {
647
+ contents_.set_data(src.data(), n, false);
648
+ } else {
649
+ contents_.set_tree(NewTree(src.data(), n, 0));
650
+ }
651
+ }
652
+
653
+ template <typename T, Cord::EnableIfString<T>>
654
+ Cord::Cord(T&& src) {
655
+ if (
656
+ // String is short: copy data to avoid external block overhead.
657
+ src.size() <= kMaxBytesToCopy ||
658
+ // String is wasteful: copy data to avoid pinning too much unused memory.
659
+ src.size() < src.capacity() / 2
660
+ ) {
661
+ if (src.size() <= InlineRep::kMaxInline) {
662
+ contents_.set_data(src.data(), src.size(), false);
663
+ } else {
664
+ contents_.set_tree(NewTree(src.data(), src.size(), 0));
665
+ }
666
+ } else {
667
+ struct StringReleaser {
668
+ void operator()(absl::string_view /* data */) {}
669
+ std::string data;
670
+ };
671
+ const absl::string_view original_data = src;
672
+ auto* rep = static_cast<
673
+ ::absl::cord_internal::CordRepExternalImpl<StringReleaser>*>(
674
+ absl::cord_internal::NewExternalRep(
675
+ original_data, StringReleaser{std::forward<T>(src)}));
676
+ // Moving src may have invalidated its data pointer, so adjust it.
677
+ rep->base = rep->template get<0>().data.data();
678
+ contents_.set_tree(rep);
679
+ }
680
+ }
681
+
682
+ template Cord::Cord(std::string&& src);
683
+
684
+ // The destruction code is separate so that the compiler can determine
685
+ // that it does not need to call the destructor on a moved-from Cord.
686
+ void Cord::DestroyCordSlow() {
687
+ Unref(VerifyTree(contents_.tree()));
688
+ }
689
+
690
+ // --------------------------------------------------------------------
691
+ // Mutators
692
+
693
+ void Cord::Clear() {
694
+ Unref(contents_.clear());
695
+ }
696
+
697
+ Cord& Cord::operator=(absl::string_view src) {
698
+
699
+ const char* data = src.data();
700
+ size_t length = src.size();
701
+ CordRep* tree = contents_.tree();
702
+ if (length <= InlineRep::kMaxInline) {
703
+ // Embed into this->contents_
704
+ contents_.set_data(data, length, true);
705
+ Unref(tree);
706
+ return *this;
707
+ }
708
+ if (tree != nullptr && tree->tag >= FLAT &&
709
+ TagToLength(tree->tag) >= length && tree->refcount.IsOne()) {
710
+ // Copy in place if the existing FLAT node is reusable.
711
+ memmove(tree->data, data, length);
712
+ tree->length = length;
713
+ VerifyTree(tree);
714
+ return *this;
715
+ }
716
+ contents_.set_tree(NewTree(data, length, 0));
717
+ Unref(tree);
718
+ return *this;
719
+ }
720
+
721
+ template <typename T, Cord::EnableIfString<T>>
722
+ Cord& Cord::operator=(T&& src) {
723
+ if (src.size() <= kMaxBytesToCopy) {
724
+ *this = absl::string_view(src);
725
+ } else {
726
+ *this = Cord(std::forward<T>(src));
727
+ }
728
+ return *this;
729
+ }
730
+
731
+ template Cord& Cord::operator=(std::string&& src);
732
+
733
+ // TODO(sanjay): Move to Cord::InlineRep section of file. For now,
734
+ // we keep it here to make diffs easier.
735
+ void Cord::InlineRep::AppendArray(const char* src_data, size_t src_size) {
736
+ if (src_size == 0) return; // memcpy(_, nullptr, 0) is undefined.
737
+ // Try to fit in the inline buffer if possible.
738
+ size_t inline_length = data_[kMaxInline];
739
+ if (inline_length < kMaxInline && src_size <= kMaxInline - inline_length) {
740
+ // Append new data to embedded array
741
+ data_[kMaxInline] = static_cast<char>(inline_length + src_size);
742
+ memcpy(data_ + inline_length, src_data, src_size);
743
+ return;
744
+ }
745
+
746
+ CordRep* root = tree();
747
+
748
+ size_t appended = 0;
749
+ if (root) {
750
+ char* region;
751
+ if (PrepareAppendRegion(root, &region, &appended, src_size)) {
752
+ memcpy(region, src_data, appended);
753
+ }
754
+ } else {
755
+ // It is possible that src_data == data_, but when we transition from an
756
+ // InlineRep to a tree we need to assign data_ = root via set_tree. To
757
+ // avoid corrupting the source data before we copy it, delay calling
758
+ // set_tree until after we've copied data.
759
+ // We are going from an inline size to beyond inline size. Make the new size
760
+ // either double the inlined size, or the added size + 10%.
761
+ const size_t size1 = inline_length * 2 + src_size;
762
+ const size_t size2 = inline_length + src_size / 10;
763
+ root = NewFlat(std::max<size_t>(size1, size2));
764
+ appended = std::min(src_size, TagToLength(root->tag) - inline_length);
765
+ memcpy(root->data, data_, inline_length);
766
+ memcpy(root->data + inline_length, src_data, appended);
767
+ root->length = inline_length + appended;
768
+ set_tree(root);
769
+ }
770
+
771
+ src_data += appended;
772
+ src_size -= appended;
773
+ if (src_size == 0) {
774
+ return;
775
+ }
776
+
777
+ // Use new block(s) for any remaining bytes that were not handled above.
778
+ // Alloc extra memory only if the right child of the root of the new tree is
779
+ // going to be a FLAT node, which will permit further inplace appends.
780
+ size_t length = src_size;
781
+ if (src_size < kMaxFlatLength) {
782
+ // The new length is either
783
+ // - old size + 10%
784
+ // - old_size + src_size
785
+ // This will cause a reasonable conservative step-up in size that is still
786
+ // large enough to avoid excessive amounts of small fragments being added.
787
+ length = std::max<size_t>(root->length / 10, src_size);
788
+ }
789
+ set_tree(Concat(root, NewTree(src_data, src_size, length - src_size)));
790
+ }
791
+
792
+ inline CordRep* Cord::TakeRep() const& {
793
+ return Ref(contents_.tree());
794
+ }
795
+
796
+ inline CordRep* Cord::TakeRep() && {
797
+ CordRep* rep = contents_.tree();
798
+ contents_.clear();
799
+ return rep;
800
+ }
801
+
802
+ template <typename C>
803
+ inline void Cord::AppendImpl(C&& src) {
804
+ if (empty()) {
805
+ // In case of an empty destination avoid allocating a new node, do not copy
806
+ // data.
807
+ *this = std::forward<C>(src);
808
+ return;
809
+ }
810
+
811
+ // For short cords, it is faster to copy data if there is room in dst.
812
+ const size_t src_size = src.contents_.size();
813
+ if (src_size <= kMaxBytesToCopy) {
814
+ CordRep* src_tree = src.contents_.tree();
815
+ if (src_tree == nullptr) {
816
+ // src has embedded data.
817
+ contents_.AppendArray(src.contents_.data(), src_size);
818
+ return;
819
+ }
820
+ if (src_tree->tag >= FLAT) {
821
+ // src tree just has one flat node.
822
+ contents_.AppendArray(src_tree->data, src_size);
823
+ return;
824
+ }
825
+ if (&src == this) {
826
+ // ChunkIterator below assumes that src is not modified during traversal.
827
+ Append(Cord(src));
828
+ return;
829
+ }
830
+ // TODO(mec): Should we only do this if "dst" has space?
831
+ for (absl::string_view chunk : src.Chunks()) {
832
+ Append(chunk);
833
+ }
834
+ return;
835
+ }
836
+
837
+ contents_.AppendTree(std::forward<C>(src).TakeRep());
838
+ }
839
+
840
+ void Cord::Append(const Cord& src) { AppendImpl(src); }
841
+
842
+ void Cord::Append(Cord&& src) { AppendImpl(std::move(src)); }
843
+
844
+ template <typename T, Cord::EnableIfString<T>>
845
+ void Cord::Append(T&& src) {
846
+ if (src.size() <= kMaxBytesToCopy) {
847
+ Append(absl::string_view(src));
848
+ } else {
849
+ Append(Cord(std::forward<T>(src)));
850
+ }
851
+ }
852
+
853
+ template void Cord::Append(std::string&& src);
854
+
855
+ void Cord::Prepend(const Cord& src) {
856
+ CordRep* src_tree = src.contents_.tree();
857
+ if (src_tree != nullptr) {
858
+ Ref(src_tree);
859
+ contents_.PrependTree(src_tree);
860
+ return;
861
+ }
862
+
863
+ // `src` cord is inlined.
864
+ absl::string_view src_contents(src.contents_.data(), src.contents_.size());
865
+ return Prepend(src_contents);
866
+ }
867
+
868
+ void Cord::Prepend(absl::string_view src) {
869
+ if (src.empty()) return; // memcpy(_, nullptr, 0) is undefined.
870
+ size_t cur_size = contents_.size();
871
+ if (!contents_.is_tree() && cur_size + src.size() <= InlineRep::kMaxInline) {
872
+ // Use embedded storage.
873
+ char data[InlineRep::kMaxInline + 1] = {0};
874
+ data[InlineRep::kMaxInline] = cur_size + src.size(); // set size
875
+ memcpy(data, src.data(), src.size());
876
+ memcpy(data + src.size(), contents_.data(), cur_size);
877
+ memcpy(reinterpret_cast<void*>(&contents_), data,
878
+ InlineRep::kMaxInline + 1);
879
+ } else {
880
+ contents_.PrependTree(NewTree(src.data(), src.size(), 0));
881
+ }
882
+ }
883
+
884
+ template <typename T, Cord::EnableIfString<T>>
885
+ inline void Cord::Prepend(T&& src) {
886
+ if (src.size() <= kMaxBytesToCopy) {
887
+ Prepend(absl::string_view(src));
888
+ } else {
889
+ Prepend(Cord(std::forward<T>(src)));
890
+ }
891
+ }
892
+
893
+ template void Cord::Prepend(std::string&& src);
894
+
895
+ static CordRep* RemovePrefixFrom(CordRep* node, size_t n) {
896
+ if (n >= node->length) return nullptr;
897
+ if (n == 0) return Ref(node);
898
+ absl::InlinedVector<CordRep*, kInlinedVectorSize> rhs_stack;
899
+
900
+ while (node->tag == CONCAT) {
901
+ assert(n <= node->length);
902
+ if (n < node->concat()->left->length) {
903
+ // Push right to stack, descend left.
904
+ rhs_stack.push_back(node->concat()->right);
905
+ node = node->concat()->left;
906
+ } else {
907
+ // Drop left, descend right.
908
+ n -= node->concat()->left->length;
909
+ node = node->concat()->right;
910
+ }
911
+ }
912
+ assert(n <= node->length);
913
+
914
+ if (n == 0) {
915
+ Ref(node);
916
+ } else {
917
+ size_t start = n;
918
+ size_t len = node->length - n;
919
+ if (node->tag == SUBSTRING) {
920
+ // Consider in-place update of node, similar to in RemoveSuffixFrom().
921
+ start += node->substring()->start;
922
+ node = node->substring()->child;
923
+ }
924
+ node = NewSubstring(Ref(node), start, len);
925
+ }
926
+ while (!rhs_stack.empty()) {
927
+ node = Concat(node, Ref(rhs_stack.back()));
928
+ rhs_stack.pop_back();
929
+ }
930
+ return node;
931
+ }
932
+
933
+ // RemoveSuffixFrom() is very similar to RemovePrefixFrom(), with the
934
+ // exception that removing a suffix has an optimization where a node may be
935
+ // edited in place iff that node and all its ancestors have a refcount of 1.
936
+ static CordRep* RemoveSuffixFrom(CordRep* node, size_t n) {
937
+ if (n >= node->length) return nullptr;
938
+ if (n == 0) return Ref(node);
939
+ absl::InlinedVector<CordRep*, kInlinedVectorSize> lhs_stack;
940
+ bool inplace_ok = node->refcount.IsOne();
941
+
942
+ while (node->tag == CONCAT) {
943
+ assert(n <= node->length);
944
+ if (n < node->concat()->right->length) {
945
+ // Push left to stack, descend right.
946
+ lhs_stack.push_back(node->concat()->left);
947
+ node = node->concat()->right;
948
+ } else {
949
+ // Drop right, descend left.
950
+ n -= node->concat()->right->length;
951
+ node = node->concat()->left;
952
+ }
953
+ inplace_ok = inplace_ok && node->refcount.IsOne();
954
+ }
955
+ assert(n <= node->length);
956
+
957
+ if (n == 0) {
958
+ Ref(node);
959
+ } else if (inplace_ok && node->tag != EXTERNAL) {
960
+ // Consider making a new buffer if the current node capacity is much
961
+ // larger than the new length.
962
+ Ref(node);
963
+ node->length -= n;
964
+ } else {
965
+ size_t start = 0;
966
+ size_t len = node->length - n;
967
+ if (node->tag == SUBSTRING) {
968
+ start = node->substring()->start;
969
+ node = node->substring()->child;
970
+ }
971
+ node = NewSubstring(Ref(node), start, len);
972
+ }
973
+ while (!lhs_stack.empty()) {
974
+ node = Concat(Ref(lhs_stack.back()), node);
975
+ lhs_stack.pop_back();
976
+ }
977
+ return node;
978
+ }
979
+
980
+ void Cord::RemovePrefix(size_t n) {
981
+ ABSL_INTERNAL_CHECK(n <= size(),
982
+ absl::StrCat("Requested prefix size ", n,
983
+ " exceeds Cord's size ", size()));
984
+ CordRep* tree = contents_.tree();
985
+ if (tree == nullptr) {
986
+ contents_.remove_prefix(n);
987
+ } else {
988
+ CordRep* newrep = RemovePrefixFrom(tree, n);
989
+ Unref(tree);
990
+ contents_.replace_tree(VerifyTree(newrep));
991
+ }
992
+ }
993
+
994
+ void Cord::RemoveSuffix(size_t n) {
995
+ ABSL_INTERNAL_CHECK(n <= size(),
996
+ absl::StrCat("Requested suffix size ", n,
997
+ " exceeds Cord's size ", size()));
998
+ CordRep* tree = contents_.tree();
999
+ if (tree == nullptr) {
1000
+ contents_.reduce_size(n);
1001
+ } else {
1002
+ CordRep* newrep = RemoveSuffixFrom(tree, n);
1003
+ Unref(tree);
1004
+ contents_.replace_tree(VerifyTree(newrep));
1005
+ }
1006
+ }
1007
+
1008
+ // Work item for NewSubRange().
1009
+ struct SubRange {
1010
+ SubRange(CordRep* a_node, size_t a_pos, size_t a_n)
1011
+ : node(a_node), pos(a_pos), n(a_n) {}
1012
+ CordRep* node; // nullptr means concat last 2 results.
1013
+ size_t pos;
1014
+ size_t n;
1015
+ };
1016
+
1017
+ static CordRep* NewSubRange(CordRep* node, size_t pos, size_t n) {
1018
+ absl::InlinedVector<CordRep*, kInlinedVectorSize> results;
1019
+ absl::InlinedVector<SubRange, kInlinedVectorSize> todo;
1020
+ todo.push_back(SubRange(node, pos, n));
1021
+ do {
1022
+ const SubRange& sr = todo.back();
1023
+ node = sr.node;
1024
+ pos = sr.pos;
1025
+ n = sr.n;
1026
+ todo.pop_back();
1027
+
1028
+ if (node == nullptr) {
1029
+ assert(results.size() >= 2);
1030
+ CordRep* right = results.back();
1031
+ results.pop_back();
1032
+ CordRep* left = results.back();
1033
+ results.pop_back();
1034
+ results.push_back(Concat(left, right));
1035
+ } else if (pos == 0 && n == node->length) {
1036
+ results.push_back(Ref(node));
1037
+ } else if (node->tag != CONCAT) {
1038
+ if (node->tag == SUBSTRING) {
1039
+ pos += node->substring()->start;
1040
+ node = node->substring()->child;
1041
+ }
1042
+ results.push_back(NewSubstring(Ref(node), pos, n));
1043
+ } else if (pos + n <= node->concat()->left->length) {
1044
+ todo.push_back(SubRange(node->concat()->left, pos, n));
1045
+ } else if (pos >= node->concat()->left->length) {
1046
+ pos -= node->concat()->left->length;
1047
+ todo.push_back(SubRange(node->concat()->right, pos, n));
1048
+ } else {
1049
+ size_t left_n = node->concat()->left->length - pos;
1050
+ todo.push_back(SubRange(nullptr, 0, 0)); // Concat()
1051
+ todo.push_back(SubRange(node->concat()->right, 0, n - left_n));
1052
+ todo.push_back(SubRange(node->concat()->left, pos, left_n));
1053
+ }
1054
+ } while (!todo.empty());
1055
+ assert(results.size() == 1);
1056
+ return results[0];
1057
+ }
1058
+
1059
+ Cord Cord::Subcord(size_t pos, size_t new_size) const {
1060
+ Cord sub_cord;
1061
+ size_t length = size();
1062
+ if (pos > length) pos = length;
1063
+ if (new_size > length - pos) new_size = length - pos;
1064
+ CordRep* tree = contents_.tree();
1065
+ if (tree == nullptr) {
1066
+ // sub_cord is newly constructed, no need to re-zero-out the tail of
1067
+ // contents_ memory.
1068
+ sub_cord.contents_.set_data(contents_.data() + pos, new_size, false);
1069
+ } else if (new_size == 0) {
1070
+ // We want to return empty subcord, so nothing to do.
1071
+ } else if (new_size <= InlineRep::kMaxInline) {
1072
+ Cord::ChunkIterator it = chunk_begin();
1073
+ it.AdvanceBytes(pos);
1074
+ char* dest = sub_cord.contents_.data_;
1075
+ size_t remaining_size = new_size;
1076
+ while (remaining_size > it->size()) {
1077
+ cord_internal::SmallMemmove(dest, it->data(), it->size());
1078
+ remaining_size -= it->size();
1079
+ dest += it->size();
1080
+ ++it;
1081
+ }
1082
+ cord_internal::SmallMemmove(dest, it->data(), remaining_size);
1083
+ sub_cord.contents_.data_[InlineRep::kMaxInline] = new_size;
1084
+ } else {
1085
+ sub_cord.contents_.set_tree(NewSubRange(tree, pos, new_size));
1086
+ }
1087
+ return sub_cord;
1088
+ }
1089
+
1090
+ // --------------------------------------------------------------------
1091
+ // Balancing
1092
+
1093
+ class CordForest {
1094
+ public:
1095
+ explicit CordForest(size_t length)
1096
+ : root_length_(length), trees_(kMinLengthSize, nullptr) {}
1097
+
1098
+ void Build(CordRep* cord_root) {
1099
+ std::vector<CordRep*> pending = {cord_root};
1100
+
1101
+ while (!pending.empty()) {
1102
+ CordRep* node = pending.back();
1103
+ pending.pop_back();
1104
+ CheckNode(node);
1105
+ if (ABSL_PREDICT_FALSE(node->tag != CONCAT)) {
1106
+ AddNode(node);
1107
+ continue;
1108
+ }
1109
+
1110
+ CordRepConcat* concat_node = node->concat();
1111
+ if (concat_node->depth() >= kMinLengthSize ||
1112
+ concat_node->length < min_length[concat_node->depth()]) {
1113
+ pending.push_back(concat_node->right);
1114
+ pending.push_back(concat_node->left);
1115
+
1116
+ if (concat_node->refcount.IsOne()) {
1117
+ concat_node->left = concat_freelist_;
1118
+ concat_freelist_ = concat_node;
1119
+ } else {
1120
+ Ref(concat_node->right);
1121
+ Ref(concat_node->left);
1122
+ Unref(concat_node);
1123
+ }
1124
+ } else {
1125
+ AddNode(node);
1126
+ }
1127
+ }
1128
+ }
1129
+
1130
+ CordRep* ConcatNodes() {
1131
+ CordRep* sum = nullptr;
1132
+ for (auto* node : trees_) {
1133
+ if (node == nullptr) continue;
1134
+
1135
+ sum = PrependNode(node, sum);
1136
+ root_length_ -= node->length;
1137
+ if (root_length_ == 0) break;
1138
+ }
1139
+ ABSL_INTERNAL_CHECK(sum != nullptr, "Failed to locate sum node");
1140
+ return VerifyTree(sum);
1141
+ }
1142
+
1143
+ private:
1144
+ CordRep* AppendNode(CordRep* node, CordRep* sum) {
1145
+ return (sum == nullptr) ? node : MakeConcat(sum, node);
1146
+ }
1147
+
1148
+ CordRep* PrependNode(CordRep* node, CordRep* sum) {
1149
+ return (sum == nullptr) ? node : MakeConcat(node, sum);
1150
+ }
1151
+
1152
+ void AddNode(CordRep* node) {
1153
+ CordRep* sum = nullptr;
1154
+
1155
+ // Collect together everything with which we will merge with node
1156
+ int i = 0;
1157
+ for (; node->length > min_length[i + 1]; ++i) {
1158
+ auto& tree_at_i = trees_[i];
1159
+
1160
+ if (tree_at_i == nullptr) continue;
1161
+ sum = PrependNode(tree_at_i, sum);
1162
+ tree_at_i = nullptr;
1163
+ }
1164
+
1165
+ sum = AppendNode(node, sum);
1166
+
1167
+ // Insert sum into appropriate place in the forest
1168
+ for (; sum->length >= min_length[i]; ++i) {
1169
+ auto& tree_at_i = trees_[i];
1170
+ if (tree_at_i == nullptr) continue;
1171
+
1172
+ sum = MakeConcat(tree_at_i, sum);
1173
+ tree_at_i = nullptr;
1174
+ }
1175
+
1176
+ // min_length[0] == 1, which means sum->length >= min_length[0]
1177
+ assert(i > 0);
1178
+ trees_[i - 1] = sum;
1179
+ }
1180
+
1181
+ // Make concat node trying to resue existing CordRepConcat nodes we
1182
+ // already collected in the concat_freelist_.
1183
+ CordRep* MakeConcat(CordRep* left, CordRep* right) {
1184
+ if (concat_freelist_ == nullptr) return RawConcat(left, right);
1185
+
1186
+ CordRepConcat* rep = concat_freelist_;
1187
+ if (concat_freelist_->left == nullptr) {
1188
+ concat_freelist_ = nullptr;
1189
+ } else {
1190
+ concat_freelist_ = concat_freelist_->left->concat();
1191
+ }
1192
+ SetConcatChildren(rep, left, right);
1193
+
1194
+ return rep;
1195
+ }
1196
+
1197
+ static void CheckNode(CordRep* node) {
1198
+ ABSL_INTERNAL_CHECK(node->length != 0u, "");
1199
+ if (node->tag == CONCAT) {
1200
+ ABSL_INTERNAL_CHECK(node->concat()->left != nullptr, "");
1201
+ ABSL_INTERNAL_CHECK(node->concat()->right != nullptr, "");
1202
+ ABSL_INTERNAL_CHECK(node->length == (node->concat()->left->length +
1203
+ node->concat()->right->length),
1204
+ "");
1205
+ }
1206
+ }
1207
+
1208
+ size_t root_length_;
1209
+
1210
+ // use an inlined vector instead of a flat array to get bounds checking
1211
+ absl::InlinedVector<CordRep*, kInlinedVectorSize> trees_;
1212
+
1213
+ // List of concat nodes we can re-use for Cord balancing.
1214
+ CordRepConcat* concat_freelist_ = nullptr;
1215
+ };
1216
+
1217
+ static CordRep* Rebalance(CordRep* node) {
1218
+ VerifyTree(node);
1219
+ assert(node->tag == CONCAT);
1220
+
1221
+ if (node->length == 0) {
1222
+ return nullptr;
1223
+ }
1224
+
1225
+ CordForest forest(node->length);
1226
+ forest.Build(node);
1227
+ return forest.ConcatNodes();
1228
+ }
1229
+
1230
+ // --------------------------------------------------------------------
1231
+ // Comparators
1232
+
1233
+ namespace {
1234
+
1235
+ int ClampResult(int memcmp_res) {
1236
+ return static_cast<int>(memcmp_res > 0) - static_cast<int>(memcmp_res < 0);
1237
+ }
1238
+
1239
+ int CompareChunks(absl::string_view* lhs, absl::string_view* rhs,
1240
+ size_t* size_to_compare) {
1241
+ size_t compared_size = std::min(lhs->size(), rhs->size());
1242
+ assert(*size_to_compare >= compared_size);
1243
+ *size_to_compare -= compared_size;
1244
+
1245
+ int memcmp_res = ::memcmp(lhs->data(), rhs->data(), compared_size);
1246
+ if (memcmp_res != 0) return memcmp_res;
1247
+
1248
+ lhs->remove_prefix(compared_size);
1249
+ rhs->remove_prefix(compared_size);
1250
+
1251
+ return 0;
1252
+ }
1253
+
1254
+ // This overload set computes comparison results from memcmp result. This
1255
+ // interface is used inside GenericCompare below. Differet implementations
1256
+ // are specialized for int and bool. For int we clamp result to {-1, 0, 1}
1257
+ // set. For bool we just interested in "value == 0".
1258
+ template <typename ResultType>
1259
+ ResultType ComputeCompareResult(int memcmp_res) {
1260
+ return ClampResult(memcmp_res);
1261
+ }
1262
+ template <>
1263
+ bool ComputeCompareResult<bool>(int memcmp_res) {
1264
+ return memcmp_res == 0;
1265
+ }
1266
+
1267
+ } // namespace
1268
+
1269
+ // Helper routine. Locates the first flat chunk of the Cord without
1270
+ // initializing the iterator.
1271
+ inline absl::string_view Cord::InlineRep::FindFlatStartPiece() const {
1272
+ size_t n = data_[kMaxInline];
1273
+ if (n <= kMaxInline) {
1274
+ return absl::string_view(data_, n);
1275
+ }
1276
+
1277
+ CordRep* node = tree();
1278
+ if (node->tag >= FLAT) {
1279
+ return absl::string_view(node->data, node->length);
1280
+ }
1281
+
1282
+ if (node->tag == EXTERNAL) {
1283
+ return absl::string_view(node->external()->base, node->length);
1284
+ }
1285
+
1286
+ // Walk down the left branches until we hit a non-CONCAT node.
1287
+ while (node->tag == CONCAT) {
1288
+ node = node->concat()->left;
1289
+ }
1290
+
1291
+ // Get the child node if we encounter a SUBSTRING.
1292
+ size_t offset = 0;
1293
+ size_t length = node->length;
1294
+ assert(length != 0);
1295
+
1296
+ if (node->tag == SUBSTRING) {
1297
+ offset = node->substring()->start;
1298
+ node = node->substring()->child;
1299
+ }
1300
+
1301
+ if (node->tag >= FLAT) {
1302
+ return absl::string_view(node->data + offset, length);
1303
+ }
1304
+
1305
+ assert((node->tag == EXTERNAL) && "Expect FLAT or EXTERNAL node here");
1306
+
1307
+ return absl::string_view(node->external()->base + offset, length);
1308
+ }
1309
+
1310
+ inline int Cord::CompareSlowPath(absl::string_view rhs, size_t compared_size,
1311
+ size_t size_to_compare) const {
1312
+ auto advance = [](Cord::ChunkIterator* it, absl::string_view* chunk) {
1313
+ if (!chunk->empty()) return true;
1314
+ ++*it;
1315
+ if (it->bytes_remaining_ == 0) return false;
1316
+ *chunk = **it;
1317
+ return true;
1318
+ };
1319
+
1320
+ Cord::ChunkIterator lhs_it = chunk_begin();
1321
+
1322
+ // compared_size is inside first chunk.
1323
+ absl::string_view lhs_chunk =
1324
+ (lhs_it.bytes_remaining_ != 0) ? *lhs_it : absl::string_view();
1325
+ assert(compared_size <= lhs_chunk.size());
1326
+ assert(compared_size <= rhs.size());
1327
+ lhs_chunk.remove_prefix(compared_size);
1328
+ rhs.remove_prefix(compared_size);
1329
+ size_to_compare -= compared_size; // skip already compared size.
1330
+
1331
+ while (advance(&lhs_it, &lhs_chunk) && !rhs.empty()) {
1332
+ int comparison_result = CompareChunks(&lhs_chunk, &rhs, &size_to_compare);
1333
+ if (comparison_result != 0) return comparison_result;
1334
+ if (size_to_compare == 0) return 0;
1335
+ }
1336
+
1337
+ return static_cast<int>(rhs.empty()) - static_cast<int>(lhs_chunk.empty());
1338
+ }
1339
+
1340
+ inline int Cord::CompareSlowPath(const Cord& rhs, size_t compared_size,
1341
+ size_t size_to_compare) const {
1342
+ auto advance = [](Cord::ChunkIterator* it, absl::string_view* chunk) {
1343
+ if (!chunk->empty()) return true;
1344
+ ++*it;
1345
+ if (it->bytes_remaining_ == 0) return false;
1346
+ *chunk = **it;
1347
+ return true;
1348
+ };
1349
+
1350
+ Cord::ChunkIterator lhs_it = chunk_begin();
1351
+ Cord::ChunkIterator rhs_it = rhs.chunk_begin();
1352
+
1353
+ // compared_size is inside both first chunks.
1354
+ absl::string_view lhs_chunk =
1355
+ (lhs_it.bytes_remaining_ != 0) ? *lhs_it : absl::string_view();
1356
+ absl::string_view rhs_chunk =
1357
+ (rhs_it.bytes_remaining_ != 0) ? *rhs_it : absl::string_view();
1358
+ assert(compared_size <= lhs_chunk.size());
1359
+ assert(compared_size <= rhs_chunk.size());
1360
+ lhs_chunk.remove_prefix(compared_size);
1361
+ rhs_chunk.remove_prefix(compared_size);
1362
+ size_to_compare -= compared_size; // skip already compared size.
1363
+
1364
+ while (advance(&lhs_it, &lhs_chunk) && advance(&rhs_it, &rhs_chunk)) {
1365
+ int memcmp_res = CompareChunks(&lhs_chunk, &rhs_chunk, &size_to_compare);
1366
+ if (memcmp_res != 0) return memcmp_res;
1367
+ if (size_to_compare == 0) return 0;
1368
+ }
1369
+
1370
+ return static_cast<int>(rhs_chunk.empty()) -
1371
+ static_cast<int>(lhs_chunk.empty());
1372
+ }
1373
+
1374
+ inline absl::string_view Cord::GetFirstChunk(const Cord& c) {
1375
+ return c.contents_.FindFlatStartPiece();
1376
+ }
1377
+ inline absl::string_view Cord::GetFirstChunk(absl::string_view sv) {
1378
+ return sv;
1379
+ }
1380
+
1381
+ // Compares up to 'size_to_compare' bytes of 'lhs' with 'rhs'. It is assumed
1382
+ // that 'size_to_compare' is greater that size of smallest of first chunks.
1383
+ template <typename ResultType, typename RHS>
1384
+ ResultType GenericCompare(const Cord& lhs, const RHS& rhs,
1385
+ size_t size_to_compare) {
1386
+ absl::string_view lhs_chunk = Cord::GetFirstChunk(lhs);
1387
+ absl::string_view rhs_chunk = Cord::GetFirstChunk(rhs);
1388
+
1389
+ size_t compared_size = std::min(lhs_chunk.size(), rhs_chunk.size());
1390
+ assert(size_to_compare >= compared_size);
1391
+ int memcmp_res = ::memcmp(lhs_chunk.data(), rhs_chunk.data(), compared_size);
1392
+ if (compared_size == size_to_compare || memcmp_res != 0) {
1393
+ return ComputeCompareResult<ResultType>(memcmp_res);
1394
+ }
1395
+
1396
+ return ComputeCompareResult<ResultType>(
1397
+ lhs.CompareSlowPath(rhs, compared_size, size_to_compare));
1398
+ }
1399
+
1400
+ bool Cord::EqualsImpl(absl::string_view rhs, size_t size_to_compare) const {
1401
+ return GenericCompare<bool>(*this, rhs, size_to_compare);
1402
+ }
1403
+
1404
+ bool Cord::EqualsImpl(const Cord& rhs, size_t size_to_compare) const {
1405
+ return GenericCompare<bool>(*this, rhs, size_to_compare);
1406
+ }
1407
+
1408
+ template <typename RHS>
1409
+ inline int SharedCompareImpl(const Cord& lhs, const RHS& rhs) {
1410
+ size_t lhs_size = lhs.size();
1411
+ size_t rhs_size = rhs.size();
1412
+ if (lhs_size == rhs_size) {
1413
+ return GenericCompare<int>(lhs, rhs, lhs_size);
1414
+ }
1415
+ if (lhs_size < rhs_size) {
1416
+ auto data_comp_res = GenericCompare<int>(lhs, rhs, lhs_size);
1417
+ return data_comp_res == 0 ? -1 : data_comp_res;
1418
+ }
1419
+
1420
+ auto data_comp_res = GenericCompare<int>(lhs, rhs, rhs_size);
1421
+ return data_comp_res == 0 ? +1 : data_comp_res;
1422
+ }
1423
+
1424
+ int Cord::Compare(absl::string_view rhs) const {
1425
+ return SharedCompareImpl(*this, rhs);
1426
+ }
1427
+
1428
+ int Cord::CompareImpl(const Cord& rhs) const {
1429
+ return SharedCompareImpl(*this, rhs);
1430
+ }
1431
+
1432
+ bool Cord::EndsWith(absl::string_view rhs) const {
1433
+ size_t my_size = size();
1434
+ size_t rhs_size = rhs.size();
1435
+
1436
+ if (my_size < rhs_size) return false;
1437
+
1438
+ Cord tmp(*this);
1439
+ tmp.RemovePrefix(my_size - rhs_size);
1440
+ return tmp.EqualsImpl(rhs, rhs_size);
1441
+ }
1442
+
1443
+ bool Cord::EndsWith(const Cord& rhs) const {
1444
+ size_t my_size = size();
1445
+ size_t rhs_size = rhs.size();
1446
+
1447
+ if (my_size < rhs_size) return false;
1448
+
1449
+ Cord tmp(*this);
1450
+ tmp.RemovePrefix(my_size - rhs_size);
1451
+ return tmp.EqualsImpl(rhs, rhs_size);
1452
+ }
1453
+
1454
+ // --------------------------------------------------------------------
1455
+ // Misc.
1456
+
1457
+ Cord::operator std::string() const {
1458
+ std::string s;
1459
+ absl::CopyCordToString(*this, &s);
1460
+ return s;
1461
+ }
1462
+
1463
+ void CopyCordToString(const Cord& src, std::string* dst) {
1464
+ if (!src.contents_.is_tree()) {
1465
+ src.contents_.CopyTo(dst);
1466
+ } else {
1467
+ absl::strings_internal::STLStringResizeUninitialized(dst, src.size());
1468
+ src.CopyToArraySlowPath(&(*dst)[0]);
1469
+ }
1470
+ }
1471
+
1472
+ void Cord::CopyToArraySlowPath(char* dst) const {
1473
+ assert(contents_.is_tree());
1474
+ absl::string_view fragment;
1475
+ if (GetFlatAux(contents_.tree(), &fragment)) {
1476
+ memcpy(dst, fragment.data(), fragment.size());
1477
+ return;
1478
+ }
1479
+ for (absl::string_view chunk : Chunks()) {
1480
+ memcpy(dst, chunk.data(), chunk.size());
1481
+ dst += chunk.size();
1482
+ }
1483
+ }
1484
+
1485
+ Cord::ChunkIterator& Cord::ChunkIterator::operator++() {
1486
+ ABSL_HARDENING_ASSERT(bytes_remaining_ > 0 &&
1487
+ "Attempted to iterate past `end()`");
1488
+ assert(bytes_remaining_ >= current_chunk_.size());
1489
+ bytes_remaining_ -= current_chunk_.size();
1490
+
1491
+ if (stack_of_right_children_.empty()) {
1492
+ assert(!current_chunk_.empty()); // Called on invalid iterator.
1493
+ // We have reached the end of the Cord.
1494
+ return *this;
1495
+ }
1496
+
1497
+ // Process the next node on the stack.
1498
+ CordRep* node = stack_of_right_children_.back();
1499
+ stack_of_right_children_.pop_back();
1500
+
1501
+ // Walk down the left branches until we hit a non-CONCAT node. Save the
1502
+ // right children to the stack for subsequent traversal.
1503
+ while (node->tag == CONCAT) {
1504
+ stack_of_right_children_.push_back(node->concat()->right);
1505
+ node = node->concat()->left;
1506
+ }
1507
+
1508
+ // Get the child node if we encounter a SUBSTRING.
1509
+ size_t offset = 0;
1510
+ size_t length = node->length;
1511
+ if (node->tag == SUBSTRING) {
1512
+ offset = node->substring()->start;
1513
+ node = node->substring()->child;
1514
+ }
1515
+
1516
+ assert(node->tag == EXTERNAL || node->tag >= FLAT);
1517
+ assert(length != 0);
1518
+ const char* data =
1519
+ node->tag == EXTERNAL ? node->external()->base : node->data;
1520
+ current_chunk_ = absl::string_view(data + offset, length);
1521
+ current_leaf_ = node;
1522
+ return *this;
1523
+ }
1524
+
1525
+ Cord Cord::ChunkIterator::AdvanceAndReadBytes(size_t n) {
1526
+ ABSL_HARDENING_ASSERT(bytes_remaining_ >= n &&
1527
+ "Attempted to iterate past `end()`");
1528
+ Cord subcord;
1529
+
1530
+ if (n <= InlineRep::kMaxInline) {
1531
+ // Range to read fits in inline data. Flatten it.
1532
+ char* data = subcord.contents_.set_data(n);
1533
+ while (n > current_chunk_.size()) {
1534
+ memcpy(data, current_chunk_.data(), current_chunk_.size());
1535
+ data += current_chunk_.size();
1536
+ n -= current_chunk_.size();
1537
+ ++*this;
1538
+ }
1539
+ memcpy(data, current_chunk_.data(), n);
1540
+ if (n < current_chunk_.size()) {
1541
+ RemoveChunkPrefix(n);
1542
+ } else if (n > 0) {
1543
+ ++*this;
1544
+ }
1545
+ return subcord;
1546
+ }
1547
+ if (n < current_chunk_.size()) {
1548
+ // Range to read is a proper subrange of the current chunk.
1549
+ assert(current_leaf_ != nullptr);
1550
+ CordRep* subnode = Ref(current_leaf_);
1551
+ const char* data =
1552
+ subnode->tag == EXTERNAL ? subnode->external()->base : subnode->data;
1553
+ subnode = NewSubstring(subnode, current_chunk_.data() - data, n);
1554
+ subcord.contents_.set_tree(VerifyTree(subnode));
1555
+ RemoveChunkPrefix(n);
1556
+ return subcord;
1557
+ }
1558
+
1559
+ // Range to read begins with a proper subrange of the current chunk.
1560
+ assert(!current_chunk_.empty());
1561
+ assert(current_leaf_ != nullptr);
1562
+ CordRep* subnode = Ref(current_leaf_);
1563
+ if (current_chunk_.size() < subnode->length) {
1564
+ const char* data =
1565
+ subnode->tag == EXTERNAL ? subnode->external()->base : subnode->data;
1566
+ subnode = NewSubstring(subnode, current_chunk_.data() - data,
1567
+ current_chunk_.size());
1568
+ }
1569
+ n -= current_chunk_.size();
1570
+ bytes_remaining_ -= current_chunk_.size();
1571
+
1572
+ // Process the next node(s) on the stack, reading whole subtrees depending on
1573
+ // their length and how many bytes we are advancing.
1574
+ CordRep* node = nullptr;
1575
+ while (!stack_of_right_children_.empty()) {
1576
+ node = stack_of_right_children_.back();
1577
+ stack_of_right_children_.pop_back();
1578
+ if (node->length > n) break;
1579
+ // TODO(qrczak): This might unnecessarily recreate existing concat nodes.
1580
+ // Avoiding that would need pretty complicated logic (instead of
1581
+ // current_leaf_, keep current_subtree_ which points to the highest node
1582
+ // such that the current leaf can be found on the path of left children
1583
+ // starting from current_subtree_; delay creating subnode while node is
1584
+ // below current_subtree_; find the proper node along the path of left
1585
+ // children starting from current_subtree_ if this loop exits while staying
1586
+ // below current_subtree_; etc.; alternatively, push parents instead of
1587
+ // right children on the stack).
1588
+ subnode = Concat(subnode, Ref(node));
1589
+ n -= node->length;
1590
+ bytes_remaining_ -= node->length;
1591
+ node = nullptr;
1592
+ }
1593
+
1594
+ if (node == nullptr) {
1595
+ // We have reached the end of the Cord.
1596
+ assert(bytes_remaining_ == 0);
1597
+ subcord.contents_.set_tree(VerifyTree(subnode));
1598
+ return subcord;
1599
+ }
1600
+
1601
+ // Walk down the appropriate branches until we hit a non-CONCAT node. Save the
1602
+ // right children to the stack for subsequent traversal.
1603
+ while (node->tag == CONCAT) {
1604
+ if (node->concat()->left->length > n) {
1605
+ // Push right, descend left.
1606
+ stack_of_right_children_.push_back(node->concat()->right);
1607
+ node = node->concat()->left;
1608
+ } else {
1609
+ // Read left, descend right.
1610
+ subnode = Concat(subnode, Ref(node->concat()->left));
1611
+ n -= node->concat()->left->length;
1612
+ bytes_remaining_ -= node->concat()->left->length;
1613
+ node = node->concat()->right;
1614
+ }
1615
+ }
1616
+
1617
+ // Get the child node if we encounter a SUBSTRING.
1618
+ size_t offset = 0;
1619
+ size_t length = node->length;
1620
+ if (node->tag == SUBSTRING) {
1621
+ offset = node->substring()->start;
1622
+ node = node->substring()->child;
1623
+ }
1624
+
1625
+ // Range to read ends with a proper (possibly empty) subrange of the current
1626
+ // chunk.
1627
+ assert(node->tag == EXTERNAL || node->tag >= FLAT);
1628
+ assert(length > n);
1629
+ if (n > 0) subnode = Concat(subnode, NewSubstring(Ref(node), offset, n));
1630
+ const char* data =
1631
+ node->tag == EXTERNAL ? node->external()->base : node->data;
1632
+ current_chunk_ = absl::string_view(data + offset + n, length - n);
1633
+ current_leaf_ = node;
1634
+ bytes_remaining_ -= n;
1635
+ subcord.contents_.set_tree(VerifyTree(subnode));
1636
+ return subcord;
1637
+ }
1638
+
1639
+ void Cord::ChunkIterator::AdvanceBytesSlowPath(size_t n) {
1640
+ assert(bytes_remaining_ >= n && "Attempted to iterate past `end()`");
1641
+ assert(n >= current_chunk_.size()); // This should only be called when
1642
+ // iterating to a new node.
1643
+
1644
+ n -= current_chunk_.size();
1645
+ bytes_remaining_ -= current_chunk_.size();
1646
+
1647
+ // Process the next node(s) on the stack, skipping whole subtrees depending on
1648
+ // their length and how many bytes we are advancing.
1649
+ CordRep* node = nullptr;
1650
+ while (!stack_of_right_children_.empty()) {
1651
+ node = stack_of_right_children_.back();
1652
+ stack_of_right_children_.pop_back();
1653
+ if (node->length > n) break;
1654
+ n -= node->length;
1655
+ bytes_remaining_ -= node->length;
1656
+ node = nullptr;
1657
+ }
1658
+
1659
+ if (node == nullptr) {
1660
+ // We have reached the end of the Cord.
1661
+ assert(bytes_remaining_ == 0);
1662
+ return;
1663
+ }
1664
+
1665
+ // Walk down the appropriate branches until we hit a non-CONCAT node. Save the
1666
+ // right children to the stack for subsequent traversal.
1667
+ while (node->tag == CONCAT) {
1668
+ if (node->concat()->left->length > n) {
1669
+ // Push right, descend left.
1670
+ stack_of_right_children_.push_back(node->concat()->right);
1671
+ node = node->concat()->left;
1672
+ } else {
1673
+ // Skip left, descend right.
1674
+ n -= node->concat()->left->length;
1675
+ bytes_remaining_ -= node->concat()->left->length;
1676
+ node = node->concat()->right;
1677
+ }
1678
+ }
1679
+
1680
+ // Get the child node if we encounter a SUBSTRING.
1681
+ size_t offset = 0;
1682
+ size_t length = node->length;
1683
+ if (node->tag == SUBSTRING) {
1684
+ offset = node->substring()->start;
1685
+ node = node->substring()->child;
1686
+ }
1687
+
1688
+ assert(node->tag == EXTERNAL || node->tag >= FLAT);
1689
+ assert(length > n);
1690
+ const char* data =
1691
+ node->tag == EXTERNAL ? node->external()->base : node->data;
1692
+ current_chunk_ = absl::string_view(data + offset + n, length - n);
1693
+ current_leaf_ = node;
1694
+ bytes_remaining_ -= n;
1695
+ }
1696
+
1697
+ char Cord::operator[](size_t i) const {
1698
+ ABSL_HARDENING_ASSERT(i < size());
1699
+ size_t offset = i;
1700
+ const CordRep* rep = contents_.tree();
1701
+ if (rep == nullptr) {
1702
+ return contents_.data()[i];
1703
+ }
1704
+ while (true) {
1705
+ assert(rep != nullptr);
1706
+ assert(offset < rep->length);
1707
+ if (rep->tag >= FLAT) {
1708
+ // Get the "i"th character directly from the flat array.
1709
+ return rep->data[offset];
1710
+ } else if (rep->tag == EXTERNAL) {
1711
+ // Get the "i"th character from the external array.
1712
+ return rep->external()->base[offset];
1713
+ } else if (rep->tag == CONCAT) {
1714
+ // Recursively branch to the side of the concatenation that the "i"th
1715
+ // character is on.
1716
+ size_t left_length = rep->concat()->left->length;
1717
+ if (offset < left_length) {
1718
+ rep = rep->concat()->left;
1719
+ } else {
1720
+ offset -= left_length;
1721
+ rep = rep->concat()->right;
1722
+ }
1723
+ } else {
1724
+ // This must be a substring a node, so bypass it to get to the child.
1725
+ assert(rep->tag == SUBSTRING);
1726
+ offset += rep->substring()->start;
1727
+ rep = rep->substring()->child;
1728
+ }
1729
+ }
1730
+ }
1731
+
1732
+ absl::string_view Cord::FlattenSlowPath() {
1733
+ size_t total_size = size();
1734
+ CordRep* new_rep;
1735
+ char* new_buffer;
1736
+
1737
+ // Try to put the contents into a new flat rep. If they won't fit in the
1738
+ // biggest possible flat node, use an external rep instead.
1739
+ if (total_size <= kMaxFlatLength) {
1740
+ new_rep = NewFlat(total_size);
1741
+ new_rep->length = total_size;
1742
+ new_buffer = new_rep->data;
1743
+ CopyToArraySlowPath(new_buffer);
1744
+ } else {
1745
+ new_buffer = std::allocator<char>().allocate(total_size);
1746
+ CopyToArraySlowPath(new_buffer);
1747
+ new_rep = absl::cord_internal::NewExternalRep(
1748
+ absl::string_view(new_buffer, total_size), [](absl::string_view s) {
1749
+ std::allocator<char>().deallocate(const_cast<char*>(s.data()),
1750
+ s.size());
1751
+ });
1752
+ }
1753
+ Unref(contents_.tree());
1754
+ contents_.set_tree(new_rep);
1755
+ return absl::string_view(new_buffer, total_size);
1756
+ }
1757
+
1758
+ /* static */ bool Cord::GetFlatAux(CordRep* rep, absl::string_view* fragment) {
1759
+ assert(rep != nullptr);
1760
+ if (rep->tag >= FLAT) {
1761
+ *fragment = absl::string_view(rep->data, rep->length);
1762
+ return true;
1763
+ } else if (rep->tag == EXTERNAL) {
1764
+ *fragment = absl::string_view(rep->external()->base, rep->length);
1765
+ return true;
1766
+ } else if (rep->tag == SUBSTRING) {
1767
+ CordRep* child = rep->substring()->child;
1768
+ if (child->tag >= FLAT) {
1769
+ *fragment =
1770
+ absl::string_view(child->data + rep->substring()->start, rep->length);
1771
+ return true;
1772
+ } else if (child->tag == EXTERNAL) {
1773
+ *fragment = absl::string_view(
1774
+ child->external()->base + rep->substring()->start, rep->length);
1775
+ return true;
1776
+ }
1777
+ }
1778
+ return false;
1779
+ }
1780
+
1781
+ /* static */ void Cord::ForEachChunkAux(
1782
+ absl::cord_internal::CordRep* rep,
1783
+ absl::FunctionRef<void(absl::string_view)> callback) {
1784
+ assert(rep != nullptr);
1785
+ int stack_pos = 0;
1786
+ constexpr int stack_max = 128;
1787
+ // Stack of right branches for tree traversal
1788
+ absl::cord_internal::CordRep* stack[stack_max];
1789
+ absl::cord_internal::CordRep* current_node = rep;
1790
+ while (true) {
1791
+ if (current_node->tag == CONCAT) {
1792
+ if (stack_pos == stack_max) {
1793
+ // There's no more room on our stack array to add another right branch,
1794
+ // and the idea is to avoid allocations, so call this function
1795
+ // recursively to navigate this subtree further. (This is not something
1796
+ // we expect to happen in practice).
1797
+ ForEachChunkAux(current_node, callback);
1798
+
1799
+ // Pop the next right branch and iterate.
1800
+ current_node = stack[--stack_pos];
1801
+ continue;
1802
+ } else {
1803
+ // Save the right branch for later traversal and continue down the left
1804
+ // branch.
1805
+ stack[stack_pos++] = current_node->concat()->right;
1806
+ current_node = current_node->concat()->left;
1807
+ continue;
1808
+ }
1809
+ }
1810
+ // This is a leaf node, so invoke our callback.
1811
+ absl::string_view chunk;
1812
+ bool success = GetFlatAux(current_node, &chunk);
1813
+ assert(success);
1814
+ if (success) {
1815
+ callback(chunk);
1816
+ }
1817
+ if (stack_pos == 0) {
1818
+ // end of traversal
1819
+ return;
1820
+ }
1821
+ current_node = stack[--stack_pos];
1822
+ }
1823
+ }
1824
+
1825
+ static void DumpNode(CordRep* rep, bool include_data, std::ostream* os) {
1826
+ const int kIndentStep = 1;
1827
+ int indent = 0;
1828
+ absl::InlinedVector<CordRep*, kInlinedVectorSize> stack;
1829
+ absl::InlinedVector<int, kInlinedVectorSize> indents;
1830
+ for (;;) {
1831
+ *os << std::setw(3) << rep->refcount.Get();
1832
+ *os << " " << std::setw(7) << rep->length;
1833
+ *os << " [";
1834
+ if (include_data) *os << static_cast<void*>(rep);
1835
+ *os << "]";
1836
+ *os << " " << (IsRootBalanced(rep) ? 'b' : 'u');
1837
+ *os << " " << std::setw(indent) << "";
1838
+ if (rep->tag == CONCAT) {
1839
+ *os << "CONCAT depth=" << Depth(rep) << "\n";
1840
+ indent += kIndentStep;
1841
+ indents.push_back(indent);
1842
+ stack.push_back(rep->concat()->right);
1843
+ rep = rep->concat()->left;
1844
+ } else if (rep->tag == SUBSTRING) {
1845
+ *os << "SUBSTRING @ " << rep->substring()->start << "\n";
1846
+ indent += kIndentStep;
1847
+ rep = rep->substring()->child;
1848
+ } else { // Leaf
1849
+ if (rep->tag == EXTERNAL) {
1850
+ *os << "EXTERNAL [";
1851
+ if (include_data)
1852
+ *os << absl::CEscape(std::string(rep->external()->base, rep->length));
1853
+ *os << "]\n";
1854
+ } else {
1855
+ *os << "FLAT cap=" << TagToLength(rep->tag) << " [";
1856
+ if (include_data)
1857
+ *os << absl::CEscape(std::string(rep->data, rep->length));
1858
+ *os << "]\n";
1859
+ }
1860
+ if (stack.empty()) break;
1861
+ rep = stack.back();
1862
+ stack.pop_back();
1863
+ indent = indents.back();
1864
+ indents.pop_back();
1865
+ }
1866
+ }
1867
+ ABSL_INTERNAL_CHECK(indents.empty(), "");
1868
+ }
1869
+
1870
+ static std::string ReportError(CordRep* root, CordRep* node) {
1871
+ std::ostringstream buf;
1872
+ buf << "Error at node " << node << " in:";
1873
+ DumpNode(root, true, &buf);
1874
+ return buf.str();
1875
+ }
1876
+
1877
+ static bool VerifyNode(CordRep* root, CordRep* start_node,
1878
+ bool full_validation) {
1879
+ absl::InlinedVector<CordRep*, 2> worklist;
1880
+ worklist.push_back(start_node);
1881
+ do {
1882
+ CordRep* node = worklist.back();
1883
+ worklist.pop_back();
1884
+
1885
+ ABSL_INTERNAL_CHECK(node != nullptr, ReportError(root, node));
1886
+ if (node != root) {
1887
+ ABSL_INTERNAL_CHECK(node->length != 0, ReportError(root, node));
1888
+ }
1889
+
1890
+ if (node->tag == CONCAT) {
1891
+ ABSL_INTERNAL_CHECK(node->concat()->left != nullptr,
1892
+ ReportError(root, node));
1893
+ ABSL_INTERNAL_CHECK(node->concat()->right != nullptr,
1894
+ ReportError(root, node));
1895
+ ABSL_INTERNAL_CHECK((node->length == node->concat()->left->length +
1896
+ node->concat()->right->length),
1897
+ ReportError(root, node));
1898
+ if (full_validation) {
1899
+ worklist.push_back(node->concat()->right);
1900
+ worklist.push_back(node->concat()->left);
1901
+ }
1902
+ } else if (node->tag >= FLAT) {
1903
+ ABSL_INTERNAL_CHECK(node->length <= TagToLength(node->tag),
1904
+ ReportError(root, node));
1905
+ } else if (node->tag == EXTERNAL) {
1906
+ ABSL_INTERNAL_CHECK(node->external()->base != nullptr,
1907
+ ReportError(root, node));
1908
+ } else if (node->tag == SUBSTRING) {
1909
+ ABSL_INTERNAL_CHECK(
1910
+ node->substring()->start < node->substring()->child->length,
1911
+ ReportError(root, node));
1912
+ ABSL_INTERNAL_CHECK(node->substring()->start + node->length <=
1913
+ node->substring()->child->length,
1914
+ ReportError(root, node));
1915
+ }
1916
+ } while (!worklist.empty());
1917
+ return true;
1918
+ }
1919
+
1920
+ // Traverses the tree and computes the total memory allocated.
1921
+ /* static */ size_t Cord::MemoryUsageAux(const CordRep* rep) {
1922
+ size_t total_mem_usage = 0;
1923
+
1924
+ // Allow a quick exit for the common case that the root is a leaf.
1925
+ if (RepMemoryUsageLeaf(rep, &total_mem_usage)) {
1926
+ return total_mem_usage;
1927
+ }
1928
+
1929
+ // Iterate over the tree. cur_node is never a leaf node and leaf nodes will
1930
+ // never be appended to tree_stack. This reduces overhead from manipulating
1931
+ // tree_stack.
1932
+ absl::InlinedVector<const CordRep*, kInlinedVectorSize> tree_stack;
1933
+ const CordRep* cur_node = rep;
1934
+ while (true) {
1935
+ const CordRep* next_node = nullptr;
1936
+
1937
+ if (cur_node->tag == CONCAT) {
1938
+ total_mem_usage += sizeof(CordRepConcat);
1939
+ const CordRep* left = cur_node->concat()->left;
1940
+ if (!RepMemoryUsageLeaf(left, &total_mem_usage)) {
1941
+ next_node = left;
1942
+ }
1943
+
1944
+ const CordRep* right = cur_node->concat()->right;
1945
+ if (!RepMemoryUsageLeaf(right, &total_mem_usage)) {
1946
+ if (next_node) {
1947
+ tree_stack.push_back(next_node);
1948
+ }
1949
+ next_node = right;
1950
+ }
1951
+ } else {
1952
+ // Since cur_node is not a leaf or a concat node it must be a substring.
1953
+ assert(cur_node->tag == SUBSTRING);
1954
+ total_mem_usage += sizeof(CordRepSubstring);
1955
+ next_node = cur_node->substring()->child;
1956
+ if (RepMemoryUsageLeaf(next_node, &total_mem_usage)) {
1957
+ next_node = nullptr;
1958
+ }
1959
+ }
1960
+
1961
+ if (!next_node) {
1962
+ if (tree_stack.empty()) {
1963
+ return total_mem_usage;
1964
+ }
1965
+ next_node = tree_stack.back();
1966
+ tree_stack.pop_back();
1967
+ }
1968
+ cur_node = next_node;
1969
+ }
1970
+ }
1971
+
1972
+ std::ostream& operator<<(std::ostream& out, const Cord& cord) {
1973
+ for (absl::string_view chunk : cord.Chunks()) {
1974
+ out.write(chunk.data(), chunk.size());
1975
+ }
1976
+ return out;
1977
+ }
1978
+
1979
+ namespace strings_internal {
1980
+ size_t CordTestAccess::FlatOverhead() { return kFlatOverhead; }
1981
+ size_t CordTestAccess::MaxFlatLength() { return kMaxFlatLength; }
1982
+ size_t CordTestAccess::FlatTagToLength(uint8_t tag) {
1983
+ return TagToLength(tag);
1984
+ }
1985
+ uint8_t CordTestAccess::LengthToTag(size_t s) {
1986
+ ABSL_INTERNAL_CHECK(s <= kMaxFlatLength, absl::StrCat("Invalid length ", s));
1987
+ return AllocatedSizeToTag(s + kFlatOverhead);
1988
+ }
1989
+ size_t CordTestAccess::SizeofCordRepConcat() { return sizeof(CordRepConcat); }
1990
+ size_t CordTestAccess::SizeofCordRepExternal() {
1991
+ return sizeof(CordRepExternal);
1992
+ }
1993
+ size_t CordTestAccess::SizeofCordRepSubstring() {
1994
+ return sizeof(CordRepSubstring);
1995
+ }
1996
+ } // namespace strings_internal
1997
+ ABSL_NAMESPACE_END
1998
+ } // namespace absl