grpc 1.31.0.pre1 → 1.33.0.pre1

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 (614) hide show
  1. checksums.yaml +4 -4
  2. data/Makefile +693 -16022
  3. data/include/grpc/grpc.h +0 -5
  4. data/include/grpc/grpc_security.h +47 -14
  5. data/include/grpc/impl/codegen/README.md +22 -0
  6. data/include/grpc/impl/codegen/grpc_types.h +0 -5
  7. data/include/grpc/impl/codegen/port_platform.h +6 -1
  8. data/src/core/ext/filters/client_channel/backup_poller.cc +3 -2
  9. data/src/core/ext/filters/client_channel/client_channel.cc +264 -186
  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 +34 -5
  14. data/src/core/ext/filters/client_channel/health/health_check_client.cc +6 -1
  15. data/src/core/ext/filters/client_channel/http_connect_handshaker.cc +2 -3
  16. data/src/core/ext/filters/client_channel/lb_policy.h +3 -1
  17. data/src/core/ext/filters/client_channel/lb_policy/address_filtering.cc +48 -35
  18. data/src/core/ext/filters/client_channel/lb_policy/address_filtering.h +7 -5
  19. data/src/core/ext/filters/client_channel/lb_policy/child_policy_handler.cc +9 -6
  20. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb.cc +126 -119
  21. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_balancer_addresses.cc +0 -13
  22. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_balancer_addresses.h +0 -3
  23. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_channel_secure.cc +1 -37
  24. data/src/core/ext/filters/client_channel/lb_policy/pick_first/pick_first.cc +21 -15
  25. data/src/core/ext/filters/client_channel/lb_policy/priority/priority.cc +32 -13
  26. data/src/core/ext/filters/client_channel/lb_policy/round_robin/round_robin.cc +8 -7
  27. data/src/core/ext/filters/client_channel/lb_policy/subchannel_list.h +9 -32
  28. data/src/core/ext/filters/client_channel/lb_policy/weighted_target/weighted_target.cc +26 -16
  29. data/src/core/ext/filters/client_channel/lb_policy/xds/cds.cc +207 -129
  30. data/src/core/ext/filters/client_channel/lb_policy/xds/eds.cc +453 -255
  31. data/src/core/ext/filters/client_channel/lb_policy/xds/eds_drop.cc +571 -0
  32. data/src/core/ext/filters/client_channel/lb_policy/xds/xds_cluster_manager.cc +727 -0
  33. data/src/core/ext/filters/client_channel/lb_policy_registry.cc +8 -1
  34. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/dns_resolver_ares.cc +1 -1
  35. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper.cc +3 -3
  36. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper_libuv.cc +1 -1
  37. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper_windows.cc +1 -1
  38. data/src/core/ext/filters/client_channel/resolver/fake/fake_resolver.cc +1 -1
  39. data/src/core/ext/filters/client_channel/resolver/sockaddr/sockaddr_resolver.cc +1 -1
  40. data/src/core/ext/filters/client_channel/resolver/xds/xds_resolver.cc +602 -58
  41. data/src/core/ext/filters/client_channel/resolver/xds/xds_resolver.h +28 -0
  42. data/src/core/ext/filters/client_channel/resolver_result_parsing.cc +8 -39
  43. data/src/core/ext/filters/client_channel/resolver_result_parsing.h +4 -3
  44. data/src/core/ext/filters/client_channel/resolving_lb_policy.cc +49 -47
  45. data/src/core/ext/filters/client_channel/resolving_lb_policy.h +5 -9
  46. data/src/core/ext/filters/client_channel/server_address.cc +120 -7
  47. data/src/core/ext/filters/client_channel/server_address.h +48 -21
  48. data/src/core/ext/filters/client_channel/service_config.cc +16 -13
  49. data/src/core/ext/filters/client_channel/service_config.h +7 -4
  50. data/src/core/ext/filters/client_channel/service_config_channel_arg_filter.cc +2 -2
  51. data/src/core/ext/filters/client_channel/service_config_parser.cc +8 -6
  52. data/src/core/ext/filters/client_channel/service_config_parser.h +8 -5
  53. data/src/core/ext/filters/client_channel/subchannel.cc +64 -23
  54. data/src/core/ext/filters/client_channel/subchannel.h +16 -4
  55. data/src/core/ext/filters/client_channel/subchannel_interface.h +44 -0
  56. data/src/core/ext/filters/max_age/max_age_filter.cc +2 -1
  57. data/src/core/ext/filters/message_size/message_size_filter.cc +2 -1
  58. data/src/core/ext/filters/message_size/message_size_filter.h +2 -1
  59. data/src/core/ext/transport/chttp2/client/chttp2_connector.cc +87 -31
  60. data/src/core/ext/transport/chttp2/client/chttp2_connector.h +18 -1
  61. data/src/core/ext/transport/chttp2/client/secure/secure_channel_create.cc +10 -35
  62. data/src/core/ext/transport/chttp2/server/chttp2_server.cc +19 -25
  63. data/src/core/ext/transport/chttp2/server/chttp2_server.h +2 -1
  64. data/src/core/ext/transport/chttp2/server/insecure/server_chttp2.cc +2 -2
  65. data/src/core/ext/transport/chttp2/server/insecure/server_chttp2_posix.cc +6 -6
  66. data/src/core/ext/transport/chttp2/server/secure/server_secure_chttp2.cc +3 -2
  67. data/src/core/ext/transport/chttp2/transport/chttp2_transport.cc +256 -287
  68. data/src/core/ext/transport/chttp2/transport/flow_control.cc +11 -3
  69. data/src/core/ext/transport/chttp2/transport/flow_control.h +10 -0
  70. data/src/core/ext/transport/chttp2/transport/frame_settings.cc +2 -2
  71. data/src/core/ext/transport/chttp2/transport/internal.h +10 -1
  72. data/src/core/ext/transport/chttp2/transport/parsing.cc +17 -30
  73. data/src/core/ext/transport/chttp2/transport/writing.cc +6 -5
  74. data/src/core/ext/transport/inproc/inproc_transport.cc +12 -12
  75. data/src/core/ext/upb-generated/envoy/config/accesslog/v3/accesslog.upb.c +244 -0
  76. data/src/core/ext/upb-generated/envoy/config/accesslog/v3/accesslog.upb.h +766 -0
  77. data/src/core/ext/upb-generated/envoy/config/cluster/v3/circuit_breaker.upb.c +74 -0
  78. data/src/core/ext/upb-generated/envoy/config/cluster/v3/circuit_breaker.upb.h +226 -0
  79. data/src/core/ext/upb-generated/envoy/config/cluster/v3/cluster.upb.c +458 -0
  80. data/src/core/ext/upb-generated/envoy/config/cluster/v3/cluster.upb.h +1635 -0
  81. data/src/core/ext/upb-generated/envoy/{api/v2/cluster → config/cluster/v3}/filter.upb.c +8 -8
  82. data/src/core/ext/upb-generated/envoy/config/cluster/v3/filter.upb.h +69 -0
  83. data/src/core/ext/upb-generated/envoy/{api/v2/cluster → config/cluster/v3}/outlier_detection.upb.c +8 -8
  84. data/src/core/ext/upb-generated/envoy/config/cluster/v3/outlier_detection.upb.h +323 -0
  85. data/src/core/ext/upb-generated/envoy/config/core/v3/address.upb.c +124 -0
  86. data/src/core/ext/upb-generated/envoy/config/core/v3/address.upb.h +379 -0
  87. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/backoff.upb.c +8 -8
  88. data/src/core/ext/upb-generated/envoy/config/core/v3/backoff.upb.h +79 -0
  89. data/src/core/ext/upb-generated/envoy/config/core/v3/base.upb.c +310 -0
  90. data/src/core/ext/upb-generated/envoy/config/core/v3/base.upb.h +869 -0
  91. data/src/core/ext/upb-generated/envoy/config/core/v3/config_source.upb.c +103 -0
  92. data/src/core/ext/upb-generated/envoy/config/core/v3/config_source.upb.h +351 -0
  93. data/src/core/ext/upb-generated/envoy/config/core/v3/event_service_config.upb.c +34 -0
  94. data/src/core/ext/upb-generated/envoy/config/core/v3/event_service_config.upb.h +71 -0
  95. data/src/core/ext/upb-generated/envoy/config/core/v3/extension.upb.c +53 -0
  96. data/src/core/ext/upb-generated/envoy/config/core/v3/extension.upb.h +133 -0
  97. data/src/core/ext/upb-generated/envoy/config/core/v3/grpc_service.upb.c +241 -0
  98. data/src/core/ext/upb-generated/envoy/config/core/v3/grpc_service.upb.h +752 -0
  99. data/src/core/ext/upb-generated/envoy/config/core/v3/health_check.upb.c +170 -0
  100. data/src/core/ext/upb-generated/envoy/config/core/v3/health_check.upb.h +684 -0
  101. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/http_uri.upb.c +8 -8
  102. data/src/core/ext/upb-generated/envoy/config/core/v3/http_uri.upb.h +80 -0
  103. data/src/core/ext/upb-generated/envoy/config/core/v3/protocol.upb.c +176 -0
  104. data/src/core/ext/upb-generated/envoy/config/core/v3/protocol.upb.h +645 -0
  105. data/src/core/ext/upb-generated/envoy/config/core/v3/proxy_protocol.upb.c +28 -0
  106. data/src/core/ext/upb-generated/envoy/config/core/v3/proxy_protocol.upb.h +58 -0
  107. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/socket_option.upb.c +6 -6
  108. data/src/core/ext/upb-generated/envoy/config/core/v3/socket_option.upb.h +88 -0
  109. data/src/core/ext/upb-generated/envoy/config/core/v3/substitution_format_string.upb.c +36 -0
  110. data/src/core/ext/upb-generated/envoy/config/core/v3/substitution_format_string.upb.h +85 -0
  111. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint.upb.c +91 -0
  112. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint.upb.h +220 -0
  113. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint_components.upb.c +91 -0
  114. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint_components.upb.h +273 -0
  115. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/load_report.upb.c +112 -0
  116. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/load_report.upb.h +332 -0
  117. data/src/core/ext/upb-generated/envoy/config/listener/{v2 → v3}/api_listener.upb.c +8 -8
  118. data/src/core/ext/upb-generated/envoy/config/listener/v3/api_listener.upb.h +65 -0
  119. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener.upb.c +128 -0
  120. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener.upb.h +467 -0
  121. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener_components.upb.c +155 -0
  122. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener_components.upb.h +539 -0
  123. data/src/core/ext/upb-generated/envoy/config/listener/v3/udp_listener_config.upb.c +41 -0
  124. data/src/core/ext/upb-generated/envoy/config/listener/v3/udp_listener_config.upb.h +94 -0
  125. data/src/core/ext/upb-generated/envoy/config/rbac/v3/rbac.upb.c +178 -0
  126. data/src/core/ext/upb-generated/envoy/config/rbac/v3/rbac.upb.h +616 -0
  127. data/src/core/ext/upb-generated/envoy/config/route/v3/route.upb.c +63 -0
  128. data/src/core/ext/upb-generated/envoy/config/route/v3/route.upb.h +204 -0
  129. data/src/core/ext/upb-generated/envoy/config/route/v3/route_components.upb.c +900 -0
  130. data/src/core/ext/upb-generated/envoy/config/route/v3/route_components.upb.h +3290 -0
  131. data/src/core/ext/upb-generated/envoy/config/route/v3/scoped_route.upb.c +60 -0
  132. data/src/core/ext/upb-generated/envoy/config/route/v3/scoped_route.upb.h +139 -0
  133. data/src/core/ext/upb-generated/envoy/config/trace/v3/http_tracer.upb.c +50 -0
  134. data/src/core/ext/upb-generated/envoy/config/trace/v3/http_tracer.upb.h +108 -0
  135. data/src/core/ext/upb-generated/envoy/extensions/filters/network/http_connection_manager/v3/http_connection_manager.upb.c +364 -0
  136. data/src/core/ext/upb-generated/envoy/extensions/filters/network/http_connection_manager/v3/http_connection_manager.upb.h +1336 -0
  137. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/cert.upb.c +20 -0
  138. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/cert.upb.h +34 -0
  139. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/common.upb.c +110 -0
  140. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/common.upb.h +387 -0
  141. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/secret.upb.c +76 -0
  142. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/secret.upb.h +214 -0
  143. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/tls.upb.c +147 -0
  144. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/tls.upb.h +570 -0
  145. data/src/core/ext/upb-generated/envoy/{api/v2 → service/cluster/v3}/cds.upb.c +5 -6
  146. data/src/core/ext/upb-generated/envoy/service/cluster/v3/cds.upb.h +49 -0
  147. data/src/core/ext/upb-generated/envoy/service/discovery/{v2 → v3}/ads.upb.c +5 -4
  148. data/src/core/ext/upb-generated/envoy/service/discovery/v3/ads.upb.h +49 -0
  149. data/src/core/ext/upb-generated/envoy/service/discovery/v3/discovery.upb.c +139 -0
  150. data/src/core/ext/upb-generated/envoy/service/discovery/v3/discovery.upb.h +449 -0
  151. data/src/core/ext/upb-generated/envoy/{api/v2 → service/endpoint/v3}/eds.upb.c +5 -6
  152. data/src/core/ext/upb-generated/envoy/service/endpoint/v3/eds.upb.h +49 -0
  153. data/src/core/ext/upb-generated/envoy/{api/v2 → service/listener/v3}/lds.upb.c +5 -6
  154. data/src/core/ext/upb-generated/envoy/service/listener/v3/lds.upb.h +49 -0
  155. data/src/core/ext/upb-generated/envoy/service/load_stats/v3/lrs.upb.c +55 -0
  156. data/src/core/ext/upb-generated/envoy/service/load_stats/v3/lrs.upb.h +136 -0
  157. data/src/core/ext/upb-generated/envoy/{api/v2 → service/route/v3}/rds.upb.c +5 -6
  158. data/src/core/ext/upb-generated/envoy/service/route/v3/rds.upb.h +49 -0
  159. data/src/core/ext/upb-generated/envoy/{api/v2 → service/route/v3}/srds.upb.c +5 -6
  160. data/src/core/ext/upb-generated/envoy/service/route/v3/srds.upb.h +49 -0
  161. data/src/core/ext/upb-generated/envoy/type/matcher/v3/metadata.upb.c +47 -0
  162. data/src/core/ext/upb-generated/envoy/type/matcher/v3/metadata.upb.h +114 -0
  163. data/src/core/ext/upb-generated/envoy/type/matcher/v3/number.upb.c +35 -0
  164. data/src/core/ext/upb-generated/envoy/type/matcher/v3/number.upb.h +77 -0
  165. data/src/core/ext/upb-generated/envoy/type/matcher/v3/path.upb.c +34 -0
  166. data/src/core/ext/upb-generated/envoy/type/matcher/v3/path.upb.h +71 -0
  167. data/src/core/ext/upb-generated/envoy/type/matcher/v3/regex.upb.c +64 -0
  168. data/src/core/ext/upb-generated/envoy/type/matcher/v3/regex.upb.h +145 -0
  169. data/src/core/ext/upb-generated/envoy/type/matcher/v3/string.upb.c +54 -0
  170. data/src/core/ext/upb-generated/envoy/type/matcher/v3/string.upb.h +133 -0
  171. data/src/core/ext/upb-generated/envoy/type/matcher/v3/value.upb.c +63 -0
  172. data/src/core/ext/upb-generated/envoy/type/matcher/v3/value.upb.h +188 -0
  173. data/src/core/ext/upb-generated/envoy/type/metadata/v3/metadata.upb.c +88 -0
  174. data/src/core/ext/upb-generated/envoy/type/metadata/v3/metadata.upb.h +258 -0
  175. data/src/core/ext/upb-generated/envoy/type/tracing/v3/custom_tag.upb.c +90 -0
  176. data/src/core/ext/upb-generated/envoy/type/tracing/v3/custom_tag.upb.h +250 -0
  177. data/src/core/ext/upb-generated/envoy/type/{http.upb.c → v3/http.upb.c} +2 -2
  178. data/src/core/ext/upb-generated/envoy/type/{http.upb.h → v3/http.upb.h} +8 -8
  179. data/src/core/ext/upb-generated/envoy/type/{percent.upb.c → v3/percent.upb.c} +9 -8
  180. data/src/core/ext/upb-generated/envoy/type/v3/percent.upb.h +86 -0
  181. data/src/core/ext/upb-generated/envoy/type/{range.upb.c → v3/range.upb.c} +12 -11
  182. data/src/core/ext/upb-generated/envoy/type/v3/range.upb.h +111 -0
  183. data/src/core/ext/upb-generated/envoy/type/{semantic_version.upb.c → v3/semantic_version.upb.c} +6 -5
  184. data/src/core/ext/upb-generated/envoy/type/v3/semantic_version.upb.h +61 -0
  185. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/checked.upb.c +242 -0
  186. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/checked.upb.h +753 -0
  187. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/syntax.upb.c +234 -0
  188. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/syntax.upb.h +759 -0
  189. data/src/core/ext/upb-generated/google/protobuf/descriptor.upb.c +36 -36
  190. data/src/core/ext/upb-generated/google/protobuf/struct.upb.h +1 -1
  191. data/src/core/ext/upb-generated/udpa/annotations/security.upb.c +31 -0
  192. data/src/core/ext/upb-generated/udpa/annotations/security.upb.h +57 -0
  193. data/src/core/ext/upb-generated/udpa/annotations/versioning.upb.c +27 -0
  194. data/src/core/ext/upb-generated/udpa/annotations/versioning.upb.h +53 -0
  195. data/src/core/ext/upb-generated/udpa/core/v1/authority.upb.c +28 -0
  196. data/src/core/ext/upb-generated/udpa/core/v1/authority.upb.h +53 -0
  197. data/src/core/ext/upb-generated/udpa/core/v1/collection_entry.upb.c +52 -0
  198. data/src/core/ext/upb-generated/udpa/core/v1/collection_entry.upb.h +129 -0
  199. data/src/core/ext/upb-generated/udpa/core/v1/context_params.upb.c +42 -0
  200. data/src/core/ext/upb-generated/udpa/core/v1/context_params.upb.h +77 -0
  201. data/src/core/ext/upb-generated/udpa/core/v1/resource.upb.c +36 -0
  202. data/src/core/ext/upb-generated/udpa/core/v1/resource.upb.h +85 -0
  203. data/src/core/ext/upb-generated/udpa/core/v1/resource_locator.upb.c +54 -0
  204. data/src/core/ext/upb-generated/udpa/core/v1/resource_locator.upb.h +160 -0
  205. data/src/core/ext/upb-generated/udpa/core/v1/resource_name.upb.c +36 -0
  206. data/src/core/ext/upb-generated/udpa/core/v1/resource_name.upb.h +84 -0
  207. data/src/core/ext/upb-generated/validate/validate.upb.c +11 -11
  208. data/src/core/ext/upb-generated/validate/validate.upb.h +1 -1
  209. data/src/core/ext/xds/certificate_provider_factory.h +59 -0
  210. data/src/core/ext/xds/certificate_provider_registry.cc +103 -0
  211. data/src/core/ext/xds/certificate_provider_registry.h +57 -0
  212. data/src/core/ext/xds/certificate_provider_store.h +50 -0
  213. data/src/core/ext/xds/google_mesh_ca_certificate_provider_factory.cc +377 -0
  214. data/src/core/ext/xds/google_mesh_ca_certificate_provider_factory.h +102 -0
  215. data/src/core/ext/xds/xds_api.cc +2596 -0
  216. data/src/core/ext/xds/xds_api.h +397 -0
  217. data/src/core/ext/{filters/client_channel/xds → xds}/xds_bootstrap.cc +44 -2
  218. data/src/core/ext/{filters/client_channel/xds → xds}/xds_bootstrap.h +8 -3
  219. data/src/core/ext/{filters/client_channel/xds → xds}/xds_channel_args.h +9 -6
  220. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client.cc +541 -785
  221. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client.h +114 -93
  222. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client_stats.cc +20 -14
  223. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client_stats.h +36 -8
  224. data/src/core/lib/channel/channel_args.h +0 -1
  225. data/src/core/lib/channel/channelz.cc +24 -60
  226. data/src/core/lib/channel/channelz.h +12 -20
  227. data/src/core/lib/channel/channelz_registry.cc +15 -12
  228. data/src/core/lib/channel/channelz_registry.h +3 -0
  229. data/src/core/lib/gpr/sync_posix.cc +2 -8
  230. data/src/core/lib/gpr/time_precise.cc +2 -0
  231. data/src/core/lib/gpr/time_precise.h +6 -2
  232. data/src/core/lib/gprpp/dual_ref_counted.h +336 -0
  233. data/src/core/lib/gprpp/ref_counted.h +51 -22
  234. data/src/core/lib/gprpp/ref_counted_ptr.h +153 -0
  235. data/src/core/lib/iomgr/endpoint.cc +5 -1
  236. data/src/core/lib/iomgr/endpoint.h +7 -3
  237. data/src/core/lib/iomgr/endpoint_cfstream.cc +36 -11
  238. data/src/core/lib/iomgr/ev_posix.cc +0 -2
  239. data/src/core/lib/iomgr/exec_ctx.h +10 -8
  240. data/src/core/lib/iomgr/iomgr.cc +0 -10
  241. data/src/core/lib/iomgr/iomgr.h +0 -10
  242. data/src/core/{ext/filters/client_channel → lib/iomgr}/parse_address.cc +1 -1
  243. data/src/core/{ext/filters/client_channel → lib/iomgr}/parse_address.h +3 -3
  244. data/src/core/lib/iomgr/sockaddr_utils.cc +2 -1
  245. data/src/core/lib/iomgr/sockaddr_utils.h +2 -1
  246. data/src/core/lib/iomgr/tcp_custom.cc +32 -16
  247. data/src/core/lib/iomgr/tcp_posix.cc +31 -13
  248. data/src/core/lib/iomgr/tcp_windows.cc +26 -10
  249. data/src/core/lib/json/json_util.cc +58 -0
  250. data/src/core/lib/json/json_util.h +37 -0
  251. data/src/core/lib/security/authorization/authorization_engine.cc +177 -0
  252. data/src/core/lib/security/authorization/authorization_engine.h +84 -0
  253. data/src/core/lib/security/authorization/evaluate_args.cc +153 -0
  254. data/src/core/lib/security/authorization/evaluate_args.h +59 -0
  255. data/src/core/lib/security/authorization/mock_cel/activation.h +57 -0
  256. data/src/core/lib/security/authorization/mock_cel/cel_expr_builder_factory.h +42 -0
  257. data/src/core/lib/security/authorization/mock_cel/cel_expression.h +68 -0
  258. data/src/core/lib/security/authorization/mock_cel/cel_value.h +93 -0
  259. data/src/core/lib/security/authorization/mock_cel/evaluator_core.h +67 -0
  260. data/src/core/lib/security/authorization/mock_cel/flat_expr_builder.h +56 -0
  261. data/src/core/lib/security/authorization/mock_cel/statusor.h +50 -0
  262. data/src/core/lib/security/certificate_provider.h +60 -0
  263. data/src/core/lib/security/credentials/google_default/google_default_credentials.cc +56 -38
  264. data/src/core/lib/security/credentials/tls/grpc_tls_certificate_distributor.cc +321 -0
  265. data/src/core/lib/security/credentials/tls/grpc_tls_certificate_distributor.h +214 -0
  266. data/src/core/lib/security/credentials/xds/xds_credentials.cc +45 -0
  267. data/src/core/lib/security/credentials/xds/xds_credentials.h +51 -0
  268. data/src/core/lib/security/security_connector/fake/fake_security_connector.cc +7 -12
  269. data/src/core/lib/security/security_connector/ssl_utils.h +5 -0
  270. data/src/core/lib/security/transport/secure_endpoint.cc +7 -1
  271. data/src/core/lib/surface/call.cc +12 -12
  272. data/src/core/lib/surface/call.h +2 -1
  273. data/src/core/lib/surface/channel.cc +37 -51
  274. data/src/core/lib/surface/channel.h +18 -3
  275. data/src/core/lib/surface/completion_queue.cc +10 -272
  276. data/src/core/lib/surface/completion_queue.h +0 -8
  277. data/src/core/lib/surface/init.cc +27 -12
  278. data/src/core/lib/surface/server.cc +1066 -1244
  279. data/src/core/lib/surface/server.h +363 -87
  280. data/src/core/lib/surface/version.cc +2 -2
  281. data/src/core/lib/transport/authority_override.cc +38 -0
  282. data/src/core/lib/transport/authority_override.h +32 -0
  283. data/src/core/lib/transport/bdp_estimator.h +2 -1
  284. data/src/core/lib/transport/connectivity_state.cc +18 -13
  285. data/src/core/lib/transport/connectivity_state.h +20 -8
  286. data/src/core/lib/transport/error_utils.cc +13 -0
  287. data/src/core/lib/transport/error_utils.h +6 -0
  288. data/src/core/lib/transport/metadata.cc +11 -1
  289. data/src/core/lib/transport/static_metadata.cc +295 -276
  290. data/src/core/lib/transport/static_metadata.h +80 -73
  291. data/src/core/lib/transport/transport.h +7 -0
  292. data/src/core/lib/uri/uri_parser.cc +23 -21
  293. data/src/core/lib/uri/uri_parser.h +3 -1
  294. data/src/core/plugin_registry/grpc_plugin_registry.cc +35 -20
  295. data/src/core/tsi/alts/handshaker/alts_tsi_handshaker.cc +22 -0
  296. data/src/core/tsi/ssl_transport_security.cc +2 -2
  297. data/src/ruby/bin/math_services_pb.rb +4 -4
  298. data/src/ruby/ext/grpc/rb_channel_credentials.c +9 -0
  299. data/src/ruby/ext/grpc/rb_grpc_imports.generated.c +4 -4
  300. data/src/ruby/ext/grpc/rb_grpc_imports.generated.h +7 -7
  301. data/src/ruby/lib/grpc/generic/client_stub.rb +1 -1
  302. data/src/ruby/lib/grpc/version.rb +1 -1
  303. data/src/ruby/pb/grpc/health/v1/health_services_pb.rb +2 -2
  304. data/src/ruby/pb/src/proto/grpc/testing/messages_pb.rb +5 -0
  305. data/src/ruby/pb/src/proto/grpc/testing/test_services_pb.rb +28 -12
  306. data/src/ruby/spec/channel_credentials_spec.rb +10 -0
  307. data/src/ruby/spec/generic/active_call_spec.rb +19 -8
  308. data/src/ruby/spec/pb/codegen/grpc/testing/same_package_service_name.proto +27 -0
  309. data/src/ruby/spec/pb/codegen/grpc/testing/same_ruby_package_service_name.proto +29 -0
  310. data/src/ruby/spec/pb/codegen/package_option_spec.rb +20 -0
  311. data/src/ruby/spec/user_agent_spec.rb +74 -0
  312. data/third_party/abseil-cpp/absl/algorithm/container.h +1727 -0
  313. data/third_party/abseil-cpp/absl/base/internal/direct_mmap.h +161 -0
  314. data/third_party/abseil-cpp/absl/base/internal/exponential_biased.cc +93 -0
  315. data/third_party/abseil-cpp/absl/base/internal/exponential_biased.h +130 -0
  316. data/third_party/abseil-cpp/absl/base/internal/low_level_alloc.cc +620 -0
  317. data/third_party/abseil-cpp/absl/base/internal/low_level_alloc.h +126 -0
  318. data/third_party/abseil-cpp/absl/container/fixed_array.h +515 -0
  319. data/third_party/abseil-cpp/absl/container/flat_hash_set.h +503 -0
  320. data/third_party/abseil-cpp/absl/container/internal/common.h +202 -0
  321. data/third_party/abseil-cpp/absl/container/internal/container_memory.h +440 -0
  322. data/third_party/abseil-cpp/absl/container/internal/hash_function_defaults.h +146 -0
  323. data/third_party/abseil-cpp/absl/container/internal/hash_policy_traits.h +191 -0
  324. data/third_party/abseil-cpp/absl/container/internal/hashtable_debug_hooks.h +85 -0
  325. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler.cc +269 -0
  326. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler.h +297 -0
  327. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler_force_weak_definition.cc +30 -0
  328. data/third_party/abseil-cpp/absl/container/internal/have_sse.h +49 -0
  329. data/third_party/abseil-cpp/absl/container/internal/layout.h +741 -0
  330. data/third_party/abseil-cpp/absl/container/internal/raw_hash_set.cc +48 -0
  331. data/third_party/abseil-cpp/absl/container/internal/raw_hash_set.h +1882 -0
  332. data/third_party/abseil-cpp/absl/debugging/internal/address_is_readable.cc +138 -0
  333. data/third_party/abseil-cpp/absl/debugging/internal/address_is_readable.h +32 -0
  334. data/third_party/abseil-cpp/absl/debugging/internal/demangle.cc +1895 -0
  335. data/third_party/abseil-cpp/absl/debugging/internal/demangle.h +71 -0
  336. data/third_party/abseil-cpp/absl/debugging/internal/elf_mem_image.cc +382 -0
  337. data/third_party/abseil-cpp/absl/debugging/internal/elf_mem_image.h +134 -0
  338. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_aarch64-inl.inc +192 -0
  339. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_arm-inl.inc +125 -0
  340. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_config.h +70 -0
  341. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_generic-inl.inc +99 -0
  342. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_powerpc-inl.inc +248 -0
  343. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_unimplemented-inl.inc +24 -0
  344. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_win32-inl.inc +85 -0
  345. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_x86-inl.inc +346 -0
  346. data/third_party/abseil-cpp/absl/debugging/internal/symbolize.h +128 -0
  347. data/third_party/abseil-cpp/absl/debugging/internal/vdso_support.cc +194 -0
  348. data/third_party/abseil-cpp/absl/debugging/internal/vdso_support.h +158 -0
  349. data/third_party/abseil-cpp/absl/debugging/stacktrace.cc +140 -0
  350. data/third_party/abseil-cpp/absl/debugging/stacktrace.h +231 -0
  351. data/third_party/abseil-cpp/absl/debugging/symbolize.cc +25 -0
  352. data/third_party/abseil-cpp/absl/debugging/symbolize.h +99 -0
  353. data/third_party/abseil-cpp/absl/debugging/symbolize_elf.inc +1480 -0
  354. data/third_party/abseil-cpp/absl/debugging/symbolize_unimplemented.inc +40 -0
  355. data/third_party/abseil-cpp/absl/debugging/symbolize_win32.inc +81 -0
  356. data/third_party/abseil-cpp/absl/functional/function_ref.h +139 -0
  357. data/third_party/abseil-cpp/absl/functional/internal/function_ref.h +106 -0
  358. data/third_party/abseil-cpp/absl/hash/hash.h +324 -0
  359. data/third_party/abseil-cpp/absl/hash/internal/city.cc +346 -0
  360. data/third_party/abseil-cpp/absl/hash/internal/city.h +96 -0
  361. data/third_party/abseil-cpp/absl/hash/internal/hash.cc +55 -0
  362. data/third_party/abseil-cpp/absl/hash/internal/hash.h +988 -0
  363. data/third_party/abseil-cpp/absl/status/status.cc +447 -0
  364. data/third_party/abseil-cpp/absl/status/status.h +428 -0
  365. data/third_party/abseil-cpp/absl/status/status_payload_printer.cc +43 -0
  366. data/third_party/abseil-cpp/absl/status/status_payload_printer.h +51 -0
  367. data/third_party/abseil-cpp/absl/strings/cord.cc +2019 -0
  368. data/third_party/abseil-cpp/absl/strings/cord.h +1121 -0
  369. data/third_party/abseil-cpp/absl/strings/internal/cord_internal.h +151 -0
  370. data/third_party/abseil-cpp/absl/synchronization/barrier.cc +52 -0
  371. data/third_party/abseil-cpp/absl/synchronization/barrier.h +79 -0
  372. data/third_party/abseil-cpp/absl/synchronization/blocking_counter.cc +57 -0
  373. data/third_party/abseil-cpp/absl/synchronization/blocking_counter.h +99 -0
  374. data/third_party/abseil-cpp/absl/synchronization/internal/create_thread_identity.cc +140 -0
  375. data/third_party/abseil-cpp/absl/synchronization/internal/create_thread_identity.h +60 -0
  376. data/third_party/abseil-cpp/absl/synchronization/internal/graphcycles.cc +697 -0
  377. data/third_party/abseil-cpp/absl/synchronization/internal/graphcycles.h +141 -0
  378. data/third_party/abseil-cpp/absl/synchronization/internal/kernel_timeout.h +155 -0
  379. data/third_party/abseil-cpp/absl/synchronization/internal/mutex_nonprod.inc +261 -0
  380. data/third_party/abseil-cpp/absl/synchronization/internal/per_thread_sem.cc +106 -0
  381. data/third_party/abseil-cpp/absl/synchronization/internal/per_thread_sem.h +115 -0
  382. data/third_party/abseil-cpp/absl/synchronization/internal/waiter.cc +484 -0
  383. data/third_party/abseil-cpp/absl/synchronization/internal/waiter.h +159 -0
  384. data/third_party/abseil-cpp/absl/synchronization/mutex.cc +2728 -0
  385. data/third_party/abseil-cpp/absl/synchronization/mutex.h +1056 -0
  386. data/third_party/abseil-cpp/absl/synchronization/notification.cc +78 -0
  387. data/third_party/abseil-cpp/absl/synchronization/notification.h +123 -0
  388. data/third_party/abseil-cpp/absl/types/bad_variant_access.cc +64 -0
  389. data/third_party/abseil-cpp/absl/types/bad_variant_access.h +82 -0
  390. data/third_party/abseil-cpp/absl/types/internal/variant.h +1646 -0
  391. data/third_party/abseil-cpp/absl/types/variant.h +861 -0
  392. data/third_party/boringssl-with-bazel/err_data.c +475 -467
  393. data/third_party/boringssl-with-bazel/src/crypto/asn1/asn1_lib.c +0 -6
  394. data/third_party/boringssl-with-bazel/src/crypto/dsa/dsa.c +9 -43
  395. data/third_party/boringssl-with-bazel/src/crypto/dsa/dsa_asn1.c +55 -4
  396. data/third_party/boringssl-with-bazel/src/crypto/dsa/internal.h +34 -0
  397. data/third_party/boringssl-with-bazel/src/crypto/evp/evp.c +4 -0
  398. data/third_party/boringssl-with-bazel/src/crypto/evp/evp_asn1.c +16 -0
  399. data/third_party/boringssl-with-bazel/src/crypto/evp/p_dsa_asn1.c +6 -2
  400. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/digest/digest.c +2 -0
  401. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/rsa/internal.h +4 -0
  402. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/rsa/rsa.c +30 -10
  403. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/rsa/rsa_impl.c +10 -15
  404. data/third_party/boringssl-with-bazel/src/crypto/hpke/hpke.c +543 -0
  405. data/third_party/boringssl-with-bazel/src/crypto/hpke/internal.h +237 -0
  406. data/third_party/boringssl-with-bazel/src/crypto/trust_token/internal.h +44 -2
  407. data/third_party/boringssl-with-bazel/src/crypto/trust_token/pmbtoken.c +221 -49
  408. data/third_party/boringssl-with-bazel/src/crypto/trust_token/trust_token.c +64 -20
  409. data/third_party/boringssl-with-bazel/src/crypto/x509/a_strex.c +3 -3
  410. data/third_party/boringssl-with-bazel/src/crypto/x509/algorithm.c +0 -8
  411. data/third_party/boringssl-with-bazel/src/crypto/x509/t_crl.c +3 -3
  412. data/third_party/boringssl-with-bazel/src/crypto/x509/t_x509.c +1 -1
  413. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_cmp.c +7 -2
  414. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_ext.c +21 -18
  415. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_obj.c +1 -1
  416. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_set.c +24 -3
  417. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_trs.c +3 -3
  418. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_txt.c +67 -67
  419. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_v3.c +3 -3
  420. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_vfy.c +29 -35
  421. data/third_party/boringssl-with-bazel/src/crypto/x509/x509cset.c +13 -2
  422. data/third_party/boringssl-with-bazel/src/crypto/x509/x509name.c +9 -8
  423. data/third_party/boringssl-with-bazel/src/crypto/x509/x_all.c +10 -10
  424. data/third_party/boringssl-with-bazel/src/crypto/x509/x_crl.c +2 -2
  425. data/third_party/boringssl-with-bazel/src/crypto/x509/x_name.c +28 -40
  426. data/third_party/boringssl-with-bazel/src/crypto/x509/x_sig.c +20 -0
  427. data/third_party/boringssl-with-bazel/src/crypto/x509/x_x509.c +3 -1
  428. data/third_party/boringssl-with-bazel/src/crypto/x509v3/ext_dat.h +1 -4
  429. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_conf.c +7 -3
  430. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_genn.c +2 -2
  431. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_info.c +1 -1
  432. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_purp.c +55 -8
  433. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_skey.c +1 -1
  434. data/third_party/boringssl-with-bazel/src/include/openssl/arm_arch.h +52 -0
  435. data/third_party/boringssl-with-bazel/src/include/openssl/asn1.h +0 -1
  436. data/third_party/boringssl-with-bazel/src/include/openssl/base.h +2 -2
  437. data/third_party/boringssl-with-bazel/src/include/openssl/cipher.h +6 -0
  438. data/third_party/boringssl-with-bazel/src/include/openssl/crypto.h +1 -1
  439. data/third_party/boringssl-with-bazel/src/include/openssl/dh.h +12 -0
  440. data/third_party/boringssl-with-bazel/src/include/openssl/digest.h +9 -0
  441. data/third_party/boringssl-with-bazel/src/include/openssl/evp.h +4 -1
  442. data/third_party/boringssl-with-bazel/src/include/openssl/ssl.h +48 -9
  443. data/third_party/boringssl-with-bazel/src/include/openssl/tls1.h +2 -3
  444. data/third_party/boringssl-with-bazel/src/include/openssl/trust_token.h +26 -6
  445. data/third_party/boringssl-with-bazel/src/include/openssl/x509.h +199 -78
  446. data/third_party/boringssl-with-bazel/src/include/openssl/x509v3.h +52 -43
  447. data/third_party/boringssl-with-bazel/src/ssl/handshake.cc +18 -18
  448. data/third_party/boringssl-with-bazel/src/ssl/handshake_client.cc +2 -3
  449. data/third_party/boringssl-with-bazel/src/ssl/handshake_server.cc +1 -1
  450. data/third_party/boringssl-with-bazel/src/ssl/internal.h +13 -9
  451. data/third_party/boringssl-with-bazel/src/ssl/ssl_cert.cc +3 -6
  452. data/third_party/boringssl-with-bazel/src/ssl/ssl_cipher.cc +8 -9
  453. data/third_party/boringssl-with-bazel/src/ssl/ssl_lib.cc +10 -0
  454. data/third_party/boringssl-with-bazel/src/ssl/t1_lib.cc +34 -9
  455. data/third_party/boringssl-with-bazel/src/ssl/tls13_both.cc +1 -2
  456. data/third_party/boringssl-with-bazel/src/ssl/tls13_client.cc +4 -8
  457. data/third_party/boringssl-with-bazel/src/ssl/tls13_server.cc +7 -2
  458. data/third_party/boringssl-with-bazel/src/ssl/tls_record.cc +5 -3
  459. data/third_party/re2/re2/bitmap256.h +117 -0
  460. data/third_party/re2/re2/bitstate.cc +385 -0
  461. data/third_party/re2/re2/compile.cc +1279 -0
  462. data/third_party/re2/re2/dfa.cc +2130 -0
  463. data/third_party/re2/re2/filtered_re2.cc +121 -0
  464. data/third_party/re2/re2/filtered_re2.h +109 -0
  465. data/third_party/re2/re2/mimics_pcre.cc +197 -0
  466. data/third_party/re2/re2/nfa.cc +713 -0
  467. data/third_party/re2/re2/onepass.cc +623 -0
  468. data/third_party/re2/re2/parse.cc +2464 -0
  469. data/third_party/re2/re2/perl_groups.cc +119 -0
  470. data/third_party/re2/re2/pod_array.h +55 -0
  471. data/third_party/re2/re2/prefilter.cc +710 -0
  472. data/third_party/re2/re2/prefilter.h +108 -0
  473. data/third_party/re2/re2/prefilter_tree.cc +407 -0
  474. data/third_party/re2/re2/prefilter_tree.h +139 -0
  475. data/third_party/re2/re2/prog.cc +988 -0
  476. data/third_party/re2/re2/prog.h +436 -0
  477. data/third_party/re2/re2/re2.cc +1362 -0
  478. data/third_party/re2/re2/re2.h +1002 -0
  479. data/third_party/re2/re2/regexp.cc +980 -0
  480. data/third_party/re2/re2/regexp.h +659 -0
  481. data/third_party/re2/re2/set.cc +154 -0
  482. data/third_party/re2/re2/set.h +80 -0
  483. data/third_party/re2/re2/simplify.cc +657 -0
  484. data/third_party/re2/re2/sparse_array.h +392 -0
  485. data/third_party/re2/re2/sparse_set.h +264 -0
  486. data/third_party/re2/re2/stringpiece.cc +65 -0
  487. data/third_party/re2/re2/stringpiece.h +210 -0
  488. data/third_party/re2/re2/tostring.cc +351 -0
  489. data/third_party/re2/re2/unicode_casefold.cc +582 -0
  490. data/third_party/re2/re2/unicode_casefold.h +78 -0
  491. data/third_party/re2/re2/unicode_groups.cc +6269 -0
  492. data/third_party/re2/re2/unicode_groups.h +67 -0
  493. data/third_party/re2/re2/walker-inl.h +246 -0
  494. data/third_party/re2/util/benchmark.h +156 -0
  495. data/third_party/re2/util/flags.h +26 -0
  496. data/third_party/re2/util/logging.h +109 -0
  497. data/third_party/re2/util/malloc_counter.h +19 -0
  498. data/third_party/re2/util/mix.h +41 -0
  499. data/third_party/re2/util/mutex.h +148 -0
  500. data/third_party/re2/util/pcre.cc +1025 -0
  501. data/third_party/re2/util/pcre.h +681 -0
  502. data/third_party/re2/util/rune.cc +260 -0
  503. data/third_party/re2/util/strutil.cc +149 -0
  504. data/third_party/re2/util/strutil.h +21 -0
  505. data/third_party/re2/util/test.h +50 -0
  506. data/third_party/re2/util/utf.h +44 -0
  507. data/third_party/re2/util/util.h +42 -0
  508. data/third_party/upb/upb/decode.c +64 -15
  509. data/third_party/upb/upb/encode.c +2 -2
  510. data/third_party/upb/upb/msg.h +2 -2
  511. data/third_party/upb/upb/port_def.inc +1 -1
  512. data/third_party/upb/upb/table.c +0 -11
  513. data/third_party/upb/upb/table.int.h +0 -9
  514. data/third_party/upb/upb/upb.c +16 -14
  515. data/third_party/upb/upb/upb.h +26 -0
  516. data/third_party/upb/upb/upb.hpp +2 -0
  517. metadata +340 -153
  518. data/src/core/ext/filters/client_channel/lb_policy/xds/lrs.cc +0 -528
  519. data/src/core/ext/filters/client_channel/lb_policy/xds/xds_routing.cc +0 -1142
  520. data/src/core/ext/filters/client_channel/xds/xds_api.cc +0 -2110
  521. data/src/core/ext/filters/client_channel/xds/xds_api.h +0 -345
  522. data/src/core/ext/filters/client_channel/xds/xds_channel.h +0 -46
  523. data/src/core/ext/filters/client_channel/xds/xds_channel_secure.cc +0 -106
  524. data/src/core/ext/upb-generated/envoy/api/v2/auth/cert.upb.c +0 -21
  525. data/src/core/ext/upb-generated/envoy/api/v2/auth/cert.upb.h +0 -34
  526. data/src/core/ext/upb-generated/envoy/api/v2/auth/common.upb.c +0 -114
  527. data/src/core/ext/upb-generated/envoy/api/v2/auth/common.upb.h +0 -429
  528. data/src/core/ext/upb-generated/envoy/api/v2/auth/secret.upb.c +0 -72
  529. data/src/core/ext/upb-generated/envoy/api/v2/auth/secret.upb.h +0 -198
  530. data/src/core/ext/upb-generated/envoy/api/v2/auth/tls.upb.c +0 -105
  531. data/src/core/ext/upb-generated/envoy/api/v2/auth/tls.upb.h +0 -388
  532. data/src/core/ext/upb-generated/envoy/api/v2/cds.upb.h +0 -52
  533. data/src/core/ext/upb-generated/envoy/api/v2/cluster.upb.c +0 -403
  534. data/src/core/ext/upb-generated/envoy/api/v2/cluster.upb.h +0 -1453
  535. data/src/core/ext/upb-generated/envoy/api/v2/cluster/circuit_breaker.upb.c +0 -74
  536. data/src/core/ext/upb-generated/envoy/api/v2/cluster/circuit_breaker.upb.h +0 -226
  537. data/src/core/ext/upb-generated/envoy/api/v2/cluster/filter.upb.h +0 -69
  538. data/src/core/ext/upb-generated/envoy/api/v2/cluster/outlier_detection.upb.h +0 -323
  539. data/src/core/ext/upb-generated/envoy/api/v2/core/address.upb.c +0 -112
  540. data/src/core/ext/upb-generated/envoy/api/v2/core/address.upb.h +0 -334
  541. data/src/core/ext/upb-generated/envoy/api/v2/core/backoff.upb.h +0 -79
  542. data/src/core/ext/upb-generated/envoy/api/v2/core/base.upb.c +0 -313
  543. data/src/core/ext/upb-generated/envoy/api/v2/core/base.upb.h +0 -891
  544. data/src/core/ext/upb-generated/envoy/api/v2/core/config_source.upb.c +0 -96
  545. data/src/core/ext/upb-generated/envoy/api/v2/core/config_source.upb.h +0 -328
  546. data/src/core/ext/upb-generated/envoy/api/v2/core/event_service_config.upb.c +0 -34
  547. data/src/core/ext/upb-generated/envoy/api/v2/core/event_service_config.upb.h +0 -71
  548. data/src/core/ext/upb-generated/envoy/api/v2/core/grpc_service.upb.c +0 -197
  549. data/src/core/ext/upb-generated/envoy/api/v2/core/grpc_service.upb.h +0 -649
  550. data/src/core/ext/upb-generated/envoy/api/v2/core/health_check.upb.c +0 -172
  551. data/src/core/ext/upb-generated/envoy/api/v2/core/health_check.upb.h +0 -693
  552. data/src/core/ext/upb-generated/envoy/api/v2/core/http_uri.upb.h +0 -80
  553. data/src/core/ext/upb-generated/envoy/api/v2/core/protocol.upb.c +0 -152
  554. data/src/core/ext/upb-generated/envoy/api/v2/core/protocol.upb.h +0 -536
  555. data/src/core/ext/upb-generated/envoy/api/v2/core/socket_option.upb.h +0 -88
  556. data/src/core/ext/upb-generated/envoy/api/v2/discovery.upb.c +0 -129
  557. data/src/core/ext/upb-generated/envoy/api/v2/discovery.upb.h +0 -386
  558. data/src/core/ext/upb-generated/envoy/api/v2/eds.upb.h +0 -52
  559. data/src/core/ext/upb-generated/envoy/api/v2/endpoint.upb.c +0 -92
  560. data/src/core/ext/upb-generated/envoy/api/v2/endpoint.upb.h +0 -224
  561. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint.upb.c +0 -18
  562. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint.upb.h +0 -32
  563. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint_components.upb.c +0 -91
  564. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint_components.upb.h +0 -273
  565. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/load_report.upb.c +0 -112
  566. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/load_report.upb.h +0 -332
  567. data/src/core/ext/upb-generated/envoy/api/v2/lds.upb.h +0 -52
  568. data/src/core/ext/upb-generated/envoy/api/v2/listener.upb.c +0 -109
  569. data/src/core/ext/upb-generated/envoy/api/v2/listener.upb.h +0 -415
  570. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener.upb.c +0 -18
  571. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener.upb.h +0 -32
  572. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener_components.upb.c +0 -145
  573. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener_components.upb.h +0 -538
  574. data/src/core/ext/upb-generated/envoy/api/v2/listener/udp_listener_config.upb.c +0 -43
  575. data/src/core/ext/upb-generated/envoy/api/v2/listener/udp_listener_config.upb.h +0 -111
  576. data/src/core/ext/upb-generated/envoy/api/v2/rds.upb.h +0 -52
  577. data/src/core/ext/upb-generated/envoy/api/v2/route.upb.c +0 -63
  578. data/src/core/ext/upb-generated/envoy/api/v2/route.upb.h +0 -204
  579. data/src/core/ext/upb-generated/envoy/api/v2/route/route.upb.c +0 -18
  580. data/src/core/ext/upb-generated/envoy/api/v2/route/route.upb.h +0 -32
  581. data/src/core/ext/upb-generated/envoy/api/v2/route/route_components.upb.c +0 -815
  582. data/src/core/ext/upb-generated/envoy/api/v2/route/route_components.upb.h +0 -2984
  583. data/src/core/ext/upb-generated/envoy/api/v2/scoped_route.upb.c +0 -59
  584. data/src/core/ext/upb-generated/envoy/api/v2/scoped_route.upb.h +0 -135
  585. data/src/core/ext/upb-generated/envoy/api/v2/srds.upb.h +0 -52
  586. data/src/core/ext/upb-generated/envoy/config/filter/accesslog/v2/accesslog.upb.c +0 -228
  587. data/src/core/ext/upb-generated/envoy/config/filter/accesslog/v2/accesslog.upb.h +0 -732
  588. data/src/core/ext/upb-generated/envoy/config/filter/network/http_connection_manager/v2/http_connection_manager.upb.c +0 -316
  589. data/src/core/ext/upb-generated/envoy/config/filter/network/http_connection_manager/v2/http_connection_manager.upb.h +0 -1167
  590. data/src/core/ext/upb-generated/envoy/config/listener/v2/api_listener.upb.h +0 -65
  591. data/src/core/ext/upb-generated/envoy/config/trace/v2/http_tracer.upb.c +0 -51
  592. data/src/core/ext/upb-generated/envoy/config/trace/v2/http_tracer.upb.h +0 -125
  593. data/src/core/ext/upb-generated/envoy/service/discovery/v2/ads.upb.h +0 -49
  594. data/src/core/ext/upb-generated/envoy/service/load_stats/v2/lrs.upb.c +0 -54
  595. data/src/core/ext/upb-generated/envoy/service/load_stats/v2/lrs.upb.h +0 -136
  596. data/src/core/ext/upb-generated/envoy/type/matcher/regex.upb.c +0 -63
  597. data/src/core/ext/upb-generated/envoy/type/matcher/regex.upb.h +0 -145
  598. data/src/core/ext/upb-generated/envoy/type/matcher/string.upb.c +0 -53
  599. data/src/core/ext/upb-generated/envoy/type/matcher/string.upb.h +0 -133
  600. data/src/core/ext/upb-generated/envoy/type/metadata/v2/metadata.upb.c +0 -88
  601. data/src/core/ext/upb-generated/envoy/type/metadata/v2/metadata.upb.h +0 -258
  602. data/src/core/ext/upb-generated/envoy/type/percent.upb.h +0 -86
  603. data/src/core/ext/upb-generated/envoy/type/range.upb.h +0 -111
  604. data/src/core/ext/upb-generated/envoy/type/semantic_version.upb.h +0 -61
  605. data/src/core/ext/upb-generated/envoy/type/tracing/v2/custom_tag.upb.c +0 -89
  606. data/src/core/ext/upb-generated/envoy/type/tracing/v2/custom_tag.upb.h +0 -250
  607. data/src/core/ext/upb-generated/gogoproto/gogo.upb.c +0 -17
  608. data/src/core/ext/upb-generated/gogoproto/gogo.upb.h +0 -29
  609. data/src/core/lib/security/transport/target_authority_table.cc +0 -75
  610. data/src/core/lib/security/transport/target_authority_table.h +0 -40
  611. data/src/core/lib/slice/slice_hash_table.h +0 -199
  612. data/src/core/lib/slice/slice_weak_hash_table.h +0 -102
  613. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_pku.c +0 -110
  614. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_sxnet.c +0 -274
@@ -0,0 +1,60 @@
1
+ /*
2
+ * Copyright 2017 The Abseil Authors.
3
+ *
4
+ * Licensed under the Apache License, Version 2.0 (the "License");
5
+ * you may not use this file except in compliance with the License.
6
+ * You may obtain a copy of the License at
7
+ *
8
+ * https://www.apache.org/licenses/LICENSE-2.0
9
+ *
10
+ * Unless required by applicable law or agreed to in writing, software
11
+ * distributed under the License is distributed on an "AS IS" BASIS,
12
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13
+ * See the License for the specific language governing permissions and
14
+ * limitations under the License.
15
+ */
16
+
17
+ // Interface for getting the current ThreadIdentity, creating one if necessary.
18
+ // See thread_identity.h.
19
+ //
20
+ // This file is separate from thread_identity.h because creating a new
21
+ // ThreadIdentity requires slightly higher level libraries (per_thread_sem
22
+ // and low_level_alloc) than accessing an existing one. This separation allows
23
+ // us to have a smaller //absl/base:base.
24
+
25
+ #ifndef ABSL_SYNCHRONIZATION_INTERNAL_CREATE_THREAD_IDENTITY_H_
26
+ #define ABSL_SYNCHRONIZATION_INTERNAL_CREATE_THREAD_IDENTITY_H_
27
+
28
+ #include "absl/base/internal/thread_identity.h"
29
+ #include "absl/base/port.h"
30
+
31
+ namespace absl {
32
+ ABSL_NAMESPACE_BEGIN
33
+ namespace synchronization_internal {
34
+
35
+ // Allocates and attaches a ThreadIdentity object for the calling thread.
36
+ // For private use only.
37
+ base_internal::ThreadIdentity* CreateThreadIdentity();
38
+
39
+ // A per-thread destructor for reclaiming associated ThreadIdentity objects.
40
+ // For private use only.
41
+ void ReclaimThreadIdentity(void* v);
42
+
43
+ // Returns the ThreadIdentity object representing the calling thread; guaranteed
44
+ // to be unique for its lifetime. The returned object will remain valid for the
45
+ // program's lifetime; although it may be re-assigned to a subsequent thread.
46
+ // If one does not exist for the calling thread, allocate it now.
47
+ inline base_internal::ThreadIdentity* GetOrCreateCurrentThreadIdentity() {
48
+ base_internal::ThreadIdentity* identity =
49
+ base_internal::CurrentThreadIdentityIfPresent();
50
+ if (ABSL_PREDICT_FALSE(identity == nullptr)) {
51
+ return CreateThreadIdentity();
52
+ }
53
+ return identity;
54
+ }
55
+
56
+ } // namespace synchronization_internal
57
+ ABSL_NAMESPACE_END
58
+ } // namespace absl
59
+
60
+ #endif // ABSL_SYNCHRONIZATION_INTERNAL_CREATE_THREAD_IDENTITY_H_
@@ -0,0 +1,697 @@
1
+ // Copyright 2017 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
+ // GraphCycles provides incremental cycle detection on a dynamic
16
+ // graph using the following algorithm:
17
+ //
18
+ // A dynamic topological sort algorithm for directed acyclic graphs
19
+ // David J. Pearce, Paul H. J. Kelly
20
+ // Journal of Experimental Algorithmics (JEA) JEA Homepage archive
21
+ // Volume 11, 2006, Article No. 1.7
22
+ //
23
+ // Brief summary of the algorithm:
24
+ //
25
+ // (1) Maintain a rank for each node that is consistent
26
+ // with the topological sort of the graph. I.e., path from x to y
27
+ // implies rank[x] < rank[y].
28
+ // (2) When a new edge (x->y) is inserted, do nothing if rank[x] < rank[y].
29
+ // (3) Otherwise: adjust ranks in the neighborhood of x and y.
30
+
31
+ #include "absl/base/attributes.h"
32
+ // This file is a no-op if the required LowLevelAlloc support is missing.
33
+ #include "absl/base/internal/low_level_alloc.h"
34
+ #ifndef ABSL_LOW_LEVEL_ALLOC_MISSING
35
+
36
+ #include "absl/synchronization/internal/graphcycles.h"
37
+
38
+ #include <algorithm>
39
+ #include <array>
40
+ #include "absl/base/internal/hide_ptr.h"
41
+ #include "absl/base/internal/raw_logging.h"
42
+ #include "absl/base/internal/spinlock.h"
43
+
44
+ // Do not use STL. This module does not use standard memory allocation.
45
+
46
+ namespace absl {
47
+ ABSL_NAMESPACE_BEGIN
48
+ namespace synchronization_internal {
49
+
50
+ namespace {
51
+
52
+ // Avoid LowLevelAlloc's default arena since it calls malloc hooks in
53
+ // which people are doing things like acquiring Mutexes.
54
+ static absl::base_internal::SpinLock arena_mu(
55
+ absl::base_internal::kLinkerInitialized);
56
+ static base_internal::LowLevelAlloc::Arena* arena;
57
+
58
+ static void InitArenaIfNecessary() {
59
+ arena_mu.Lock();
60
+ if (arena == nullptr) {
61
+ arena = base_internal::LowLevelAlloc::NewArena(0);
62
+ }
63
+ arena_mu.Unlock();
64
+ }
65
+
66
+ // Number of inlined elements in Vec. Hash table implementation
67
+ // relies on this being a power of two.
68
+ static const uint32_t kInline = 8;
69
+
70
+ // A simple LowLevelAlloc based resizable vector with inlined storage
71
+ // for a few elements. T must be a plain type since constructor
72
+ // and destructor are not run on elements of type T managed by Vec.
73
+ template <typename T>
74
+ class Vec {
75
+ public:
76
+ Vec() { Init(); }
77
+ ~Vec() { Discard(); }
78
+
79
+ void clear() {
80
+ Discard();
81
+ Init();
82
+ }
83
+
84
+ bool empty() const { return size_ == 0; }
85
+ uint32_t size() const { return size_; }
86
+ T* begin() { return ptr_; }
87
+ T* end() { return ptr_ + size_; }
88
+ const T& operator[](uint32_t i) const { return ptr_[i]; }
89
+ T& operator[](uint32_t i) { return ptr_[i]; }
90
+ const T& back() const { return ptr_[size_-1]; }
91
+ void pop_back() { size_--; }
92
+
93
+ void push_back(const T& v) {
94
+ if (size_ == capacity_) Grow(size_ + 1);
95
+ ptr_[size_] = v;
96
+ size_++;
97
+ }
98
+
99
+ void resize(uint32_t n) {
100
+ if (n > capacity_) Grow(n);
101
+ size_ = n;
102
+ }
103
+
104
+ void fill(const T& val) {
105
+ for (uint32_t i = 0; i < size(); i++) {
106
+ ptr_[i] = val;
107
+ }
108
+ }
109
+
110
+ // Guarantees src is empty at end.
111
+ // Provided for the hash table resizing code below.
112
+ void MoveFrom(Vec<T>* src) {
113
+ if (src->ptr_ == src->space_) {
114
+ // Need to actually copy
115
+ resize(src->size_);
116
+ std::copy(src->ptr_, src->ptr_ + src->size_, ptr_);
117
+ src->size_ = 0;
118
+ } else {
119
+ Discard();
120
+ ptr_ = src->ptr_;
121
+ size_ = src->size_;
122
+ capacity_ = src->capacity_;
123
+ src->Init();
124
+ }
125
+ }
126
+
127
+ private:
128
+ T* ptr_;
129
+ T space_[kInline];
130
+ uint32_t size_;
131
+ uint32_t capacity_;
132
+
133
+ void Init() {
134
+ ptr_ = space_;
135
+ size_ = 0;
136
+ capacity_ = kInline;
137
+ }
138
+
139
+ void Discard() {
140
+ if (ptr_ != space_) base_internal::LowLevelAlloc::Free(ptr_);
141
+ }
142
+
143
+ void Grow(uint32_t n) {
144
+ while (capacity_ < n) {
145
+ capacity_ *= 2;
146
+ }
147
+ size_t request = static_cast<size_t>(capacity_) * sizeof(T);
148
+ T* copy = static_cast<T*>(
149
+ base_internal::LowLevelAlloc::AllocWithArena(request, arena));
150
+ std::copy(ptr_, ptr_ + size_, copy);
151
+ Discard();
152
+ ptr_ = copy;
153
+ }
154
+
155
+ Vec(const Vec&) = delete;
156
+ Vec& operator=(const Vec&) = delete;
157
+ };
158
+
159
+ // A hash set of non-negative int32_t that uses Vec for its underlying storage.
160
+ class NodeSet {
161
+ public:
162
+ NodeSet() { Init(); }
163
+
164
+ void clear() { Init(); }
165
+ bool contains(int32_t v) const { return table_[FindIndex(v)] == v; }
166
+
167
+ bool insert(int32_t v) {
168
+ uint32_t i = FindIndex(v);
169
+ if (table_[i] == v) {
170
+ return false;
171
+ }
172
+ if (table_[i] == kEmpty) {
173
+ // Only inserting over an empty cell increases the number of occupied
174
+ // slots.
175
+ occupied_++;
176
+ }
177
+ table_[i] = v;
178
+ // Double when 75% full.
179
+ if (occupied_ >= table_.size() - table_.size()/4) Grow();
180
+ return true;
181
+ }
182
+
183
+ void erase(uint32_t v) {
184
+ uint32_t i = FindIndex(v);
185
+ if (static_cast<uint32_t>(table_[i]) == v) {
186
+ table_[i] = kDel;
187
+ }
188
+ }
189
+
190
+ // Iteration: is done via HASH_FOR_EACH
191
+ // Example:
192
+ // HASH_FOR_EACH(elem, node->out) { ... }
193
+ #define HASH_FOR_EACH(elem, eset) \
194
+ for (int32_t elem, _cursor = 0; (eset).Next(&_cursor, &elem); )
195
+ bool Next(int32_t* cursor, int32_t* elem) {
196
+ while (static_cast<uint32_t>(*cursor) < table_.size()) {
197
+ int32_t v = table_[*cursor];
198
+ (*cursor)++;
199
+ if (v >= 0) {
200
+ *elem = v;
201
+ return true;
202
+ }
203
+ }
204
+ return false;
205
+ }
206
+
207
+ private:
208
+ enum : int32_t { kEmpty = -1, kDel = -2 };
209
+ Vec<int32_t> table_;
210
+ uint32_t occupied_; // Count of non-empty slots (includes deleted slots)
211
+
212
+ static uint32_t Hash(uint32_t a) { return a * 41; }
213
+
214
+ // Return index for storing v. May return an empty index or deleted index
215
+ int FindIndex(int32_t v) const {
216
+ // Search starting at hash index.
217
+ const uint32_t mask = table_.size() - 1;
218
+ uint32_t i = Hash(v) & mask;
219
+ int deleted_index = -1; // If >= 0, index of first deleted element we see
220
+ while (true) {
221
+ int32_t e = table_[i];
222
+ if (v == e) {
223
+ return i;
224
+ } else if (e == kEmpty) {
225
+ // Return any previously encountered deleted slot.
226
+ return (deleted_index >= 0) ? deleted_index : i;
227
+ } else if (e == kDel && deleted_index < 0) {
228
+ // Keep searching since v might be present later.
229
+ deleted_index = i;
230
+ }
231
+ i = (i + 1) & mask; // Linear probing; quadratic is slightly slower.
232
+ }
233
+ }
234
+
235
+ void Init() {
236
+ table_.clear();
237
+ table_.resize(kInline);
238
+ table_.fill(kEmpty);
239
+ occupied_ = 0;
240
+ }
241
+
242
+ void Grow() {
243
+ Vec<int32_t> copy;
244
+ copy.MoveFrom(&table_);
245
+ occupied_ = 0;
246
+ table_.resize(copy.size() * 2);
247
+ table_.fill(kEmpty);
248
+
249
+ for (const auto& e : copy) {
250
+ if (e >= 0) insert(e);
251
+ }
252
+ }
253
+
254
+ NodeSet(const NodeSet&) = delete;
255
+ NodeSet& operator=(const NodeSet&) = delete;
256
+ };
257
+
258
+ // We encode a node index and a node version in GraphId. The version
259
+ // number is incremented when the GraphId is freed which automatically
260
+ // invalidates all copies of the GraphId.
261
+
262
+ inline GraphId MakeId(int32_t index, uint32_t version) {
263
+ GraphId g;
264
+ g.handle =
265
+ (static_cast<uint64_t>(version) << 32) | static_cast<uint32_t>(index);
266
+ return g;
267
+ }
268
+
269
+ inline int32_t NodeIndex(GraphId id) {
270
+ return static_cast<uint32_t>(id.handle & 0xfffffffful);
271
+ }
272
+
273
+ inline uint32_t NodeVersion(GraphId id) {
274
+ return static_cast<uint32_t>(id.handle >> 32);
275
+ }
276
+
277
+ struct Node {
278
+ int32_t rank; // rank number assigned by Pearce-Kelly algorithm
279
+ uint32_t version; // Current version number
280
+ int32_t next_hash; // Next entry in hash table
281
+ bool visited; // Temporary marker used by depth-first-search
282
+ uintptr_t masked_ptr; // User-supplied pointer
283
+ NodeSet in; // List of immediate predecessor nodes in graph
284
+ NodeSet out; // List of immediate successor nodes in graph
285
+ int priority; // Priority of recorded stack trace.
286
+ int nstack; // Depth of recorded stack trace.
287
+ void* stack[40]; // stack[0,nstack-1] holds stack trace for node.
288
+ };
289
+
290
+ // Hash table for pointer to node index lookups.
291
+ class PointerMap {
292
+ public:
293
+ explicit PointerMap(const Vec<Node*>* nodes) : nodes_(nodes) {
294
+ table_.fill(-1);
295
+ }
296
+
297
+ int32_t Find(void* ptr) {
298
+ auto masked = base_internal::HidePtr(ptr);
299
+ for (int32_t i = table_[Hash(ptr)]; i != -1;) {
300
+ Node* n = (*nodes_)[i];
301
+ if (n->masked_ptr == masked) return i;
302
+ i = n->next_hash;
303
+ }
304
+ return -1;
305
+ }
306
+
307
+ void Add(void* ptr, int32_t i) {
308
+ int32_t* head = &table_[Hash(ptr)];
309
+ (*nodes_)[i]->next_hash = *head;
310
+ *head = i;
311
+ }
312
+
313
+ int32_t Remove(void* ptr) {
314
+ // Advance through linked list while keeping track of the
315
+ // predecessor slot that points to the current entry.
316
+ auto masked = base_internal::HidePtr(ptr);
317
+ for (int32_t* slot = &table_[Hash(ptr)]; *slot != -1; ) {
318
+ int32_t index = *slot;
319
+ Node* n = (*nodes_)[index];
320
+ if (n->masked_ptr == masked) {
321
+ *slot = n->next_hash; // Remove n from linked list
322
+ n->next_hash = -1;
323
+ return index;
324
+ }
325
+ slot = &n->next_hash;
326
+ }
327
+ return -1;
328
+ }
329
+
330
+ private:
331
+ // Number of buckets in hash table for pointer lookups.
332
+ static constexpr uint32_t kHashTableSize = 8171; // should be prime
333
+
334
+ const Vec<Node*>* nodes_;
335
+ std::array<int32_t, kHashTableSize> table_;
336
+
337
+ static uint32_t Hash(void* ptr) {
338
+ return reinterpret_cast<uintptr_t>(ptr) % kHashTableSize;
339
+ }
340
+ };
341
+
342
+ } // namespace
343
+
344
+ struct GraphCycles::Rep {
345
+ Vec<Node*> nodes_;
346
+ Vec<int32_t> free_nodes_; // Indices for unused entries in nodes_
347
+ PointerMap ptrmap_;
348
+
349
+ // Temporary state.
350
+ Vec<int32_t> deltaf_; // Results of forward DFS
351
+ Vec<int32_t> deltab_; // Results of backward DFS
352
+ Vec<int32_t> list_; // All nodes to reprocess
353
+ Vec<int32_t> merged_; // Rank values to assign to list_ entries
354
+ Vec<int32_t> stack_; // Emulates recursion stack for depth-first searches
355
+
356
+ Rep() : ptrmap_(&nodes_) {}
357
+ };
358
+
359
+ static Node* FindNode(GraphCycles::Rep* rep, GraphId id) {
360
+ Node* n = rep->nodes_[NodeIndex(id)];
361
+ return (n->version == NodeVersion(id)) ? n : nullptr;
362
+ }
363
+
364
+ GraphCycles::GraphCycles() {
365
+ InitArenaIfNecessary();
366
+ rep_ = new (base_internal::LowLevelAlloc::AllocWithArena(sizeof(Rep), arena))
367
+ Rep;
368
+ }
369
+
370
+ GraphCycles::~GraphCycles() {
371
+ for (auto* node : rep_->nodes_) {
372
+ node->Node::~Node();
373
+ base_internal::LowLevelAlloc::Free(node);
374
+ }
375
+ rep_->Rep::~Rep();
376
+ base_internal::LowLevelAlloc::Free(rep_);
377
+ }
378
+
379
+ bool GraphCycles::CheckInvariants() const {
380
+ Rep* r = rep_;
381
+ NodeSet ranks; // Set of ranks seen so far.
382
+ for (uint32_t x = 0; x < r->nodes_.size(); x++) {
383
+ Node* nx = r->nodes_[x];
384
+ void* ptr = base_internal::UnhidePtr<void>(nx->masked_ptr);
385
+ if (ptr != nullptr && static_cast<uint32_t>(r->ptrmap_.Find(ptr)) != x) {
386
+ ABSL_RAW_LOG(FATAL, "Did not find live node in hash table %u %p", x, ptr);
387
+ }
388
+ if (nx->visited) {
389
+ ABSL_RAW_LOG(FATAL, "Did not clear visited marker on node %u", x);
390
+ }
391
+ if (!ranks.insert(nx->rank)) {
392
+ ABSL_RAW_LOG(FATAL, "Duplicate occurrence of rank %d", nx->rank);
393
+ }
394
+ HASH_FOR_EACH(y, nx->out) {
395
+ Node* ny = r->nodes_[y];
396
+ if (nx->rank >= ny->rank) {
397
+ ABSL_RAW_LOG(FATAL, "Edge %u->%d has bad rank assignment %d->%d", x, y,
398
+ nx->rank, ny->rank);
399
+ }
400
+ }
401
+ }
402
+ return true;
403
+ }
404
+
405
+ GraphId GraphCycles::GetId(void* ptr) {
406
+ int32_t i = rep_->ptrmap_.Find(ptr);
407
+ if (i != -1) {
408
+ return MakeId(i, rep_->nodes_[i]->version);
409
+ } else if (rep_->free_nodes_.empty()) {
410
+ Node* n =
411
+ new (base_internal::LowLevelAlloc::AllocWithArena(sizeof(Node), arena))
412
+ Node;
413
+ n->version = 1; // Avoid 0 since it is used by InvalidGraphId()
414
+ n->visited = false;
415
+ n->rank = rep_->nodes_.size();
416
+ n->masked_ptr = base_internal::HidePtr(ptr);
417
+ n->nstack = 0;
418
+ n->priority = 0;
419
+ rep_->nodes_.push_back(n);
420
+ rep_->ptrmap_.Add(ptr, n->rank);
421
+ return MakeId(n->rank, n->version);
422
+ } else {
423
+ // Preserve preceding rank since the set of ranks in use must be
424
+ // a permutation of [0,rep_->nodes_.size()-1].
425
+ int32_t r = rep_->free_nodes_.back();
426
+ rep_->free_nodes_.pop_back();
427
+ Node* n = rep_->nodes_[r];
428
+ n->masked_ptr = base_internal::HidePtr(ptr);
429
+ n->nstack = 0;
430
+ n->priority = 0;
431
+ rep_->ptrmap_.Add(ptr, r);
432
+ return MakeId(r, n->version);
433
+ }
434
+ }
435
+
436
+ void GraphCycles::RemoveNode(void* ptr) {
437
+ int32_t i = rep_->ptrmap_.Remove(ptr);
438
+ if (i == -1) {
439
+ return;
440
+ }
441
+ Node* x = rep_->nodes_[i];
442
+ HASH_FOR_EACH(y, x->out) {
443
+ rep_->nodes_[y]->in.erase(i);
444
+ }
445
+ HASH_FOR_EACH(y, x->in) {
446
+ rep_->nodes_[y]->out.erase(i);
447
+ }
448
+ x->in.clear();
449
+ x->out.clear();
450
+ x->masked_ptr = base_internal::HidePtr<void>(nullptr);
451
+ if (x->version == std::numeric_limits<uint32_t>::max()) {
452
+ // Cannot use x any more
453
+ } else {
454
+ x->version++; // Invalidates all copies of node.
455
+ rep_->free_nodes_.push_back(i);
456
+ }
457
+ }
458
+
459
+ void* GraphCycles::Ptr(GraphId id) {
460
+ Node* n = FindNode(rep_, id);
461
+ return n == nullptr ? nullptr
462
+ : base_internal::UnhidePtr<void>(n->masked_ptr);
463
+ }
464
+
465
+ bool GraphCycles::HasNode(GraphId node) {
466
+ return FindNode(rep_, node) != nullptr;
467
+ }
468
+
469
+ bool GraphCycles::HasEdge(GraphId x, GraphId y) const {
470
+ Node* xn = FindNode(rep_, x);
471
+ return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y));
472
+ }
473
+
474
+ void GraphCycles::RemoveEdge(GraphId x, GraphId y) {
475
+ Node* xn = FindNode(rep_, x);
476
+ Node* yn = FindNode(rep_, y);
477
+ if (xn && yn) {
478
+ xn->out.erase(NodeIndex(y));
479
+ yn->in.erase(NodeIndex(x));
480
+ // No need to update the rank assignment since a previous valid
481
+ // rank assignment remains valid after an edge deletion.
482
+ }
483
+ }
484
+
485
+ static bool ForwardDFS(GraphCycles::Rep* r, int32_t n, int32_t upper_bound);
486
+ static void BackwardDFS(GraphCycles::Rep* r, int32_t n, int32_t lower_bound);
487
+ static void Reorder(GraphCycles::Rep* r);
488
+ static void Sort(const Vec<Node*>&, Vec<int32_t>* delta);
489
+ static void MoveToList(
490
+ GraphCycles::Rep* r, Vec<int32_t>* src, Vec<int32_t>* dst);
491
+
492
+ bool GraphCycles::InsertEdge(GraphId idx, GraphId idy) {
493
+ Rep* r = rep_;
494
+ const int32_t x = NodeIndex(idx);
495
+ const int32_t y = NodeIndex(idy);
496
+ Node* nx = FindNode(r, idx);
497
+ Node* ny = FindNode(r, idy);
498
+ if (nx == nullptr || ny == nullptr) return true; // Expired ids
499
+
500
+ if (nx == ny) return false; // Self edge
501
+ if (!nx->out.insert(y)) {
502
+ // Edge already exists.
503
+ return true;
504
+ }
505
+
506
+ ny->in.insert(x);
507
+
508
+ if (nx->rank <= ny->rank) {
509
+ // New edge is consistent with existing rank assignment.
510
+ return true;
511
+ }
512
+
513
+ // Current rank assignments are incompatible with the new edge. Recompute.
514
+ // We only need to consider nodes that fall in the range [ny->rank,nx->rank].
515
+ if (!ForwardDFS(r, y, nx->rank)) {
516
+ // Found a cycle. Undo the insertion and tell caller.
517
+ nx->out.erase(y);
518
+ ny->in.erase(x);
519
+ // Since we do not call Reorder() on this path, clear any visited
520
+ // markers left by ForwardDFS.
521
+ for (const auto& d : r->deltaf_) {
522
+ r->nodes_[d]->visited = false;
523
+ }
524
+ return false;
525
+ }
526
+ BackwardDFS(r, x, ny->rank);
527
+ Reorder(r);
528
+ return true;
529
+ }
530
+
531
+ static bool ForwardDFS(GraphCycles::Rep* r, int32_t n, int32_t upper_bound) {
532
+ // Avoid recursion since stack space might be limited.
533
+ // We instead keep a stack of nodes to visit.
534
+ r->deltaf_.clear();
535
+ r->stack_.clear();
536
+ r->stack_.push_back(n);
537
+ while (!r->stack_.empty()) {
538
+ n = r->stack_.back();
539
+ r->stack_.pop_back();
540
+ Node* nn = r->nodes_[n];
541
+ if (nn->visited) continue;
542
+
543
+ nn->visited = true;
544
+ r->deltaf_.push_back(n);
545
+
546
+ HASH_FOR_EACH(w, nn->out) {
547
+ Node* nw = r->nodes_[w];
548
+ if (nw->rank == upper_bound) {
549
+ return false; // Cycle
550
+ }
551
+ if (!nw->visited && nw->rank < upper_bound) {
552
+ r->stack_.push_back(w);
553
+ }
554
+ }
555
+ }
556
+ return true;
557
+ }
558
+
559
+ static void BackwardDFS(GraphCycles::Rep* r, int32_t n, int32_t lower_bound) {
560
+ r->deltab_.clear();
561
+ r->stack_.clear();
562
+ r->stack_.push_back(n);
563
+ while (!r->stack_.empty()) {
564
+ n = r->stack_.back();
565
+ r->stack_.pop_back();
566
+ Node* nn = r->nodes_[n];
567
+ if (nn->visited) continue;
568
+
569
+ nn->visited = true;
570
+ r->deltab_.push_back(n);
571
+
572
+ HASH_FOR_EACH(w, nn->in) {
573
+ Node* nw = r->nodes_[w];
574
+ if (!nw->visited && lower_bound < nw->rank) {
575
+ r->stack_.push_back(w);
576
+ }
577
+ }
578
+ }
579
+ }
580
+
581
+ static void Reorder(GraphCycles::Rep* r) {
582
+ Sort(r->nodes_, &r->deltab_);
583
+ Sort(r->nodes_, &r->deltaf_);
584
+
585
+ // Adds contents of delta lists to list_ (backwards deltas first).
586
+ r->list_.clear();
587
+ MoveToList(r, &r->deltab_, &r->list_);
588
+ MoveToList(r, &r->deltaf_, &r->list_);
589
+
590
+ // Produce sorted list of all ranks that will be reassigned.
591
+ r->merged_.resize(r->deltab_.size() + r->deltaf_.size());
592
+ std::merge(r->deltab_.begin(), r->deltab_.end(),
593
+ r->deltaf_.begin(), r->deltaf_.end(),
594
+ r->merged_.begin());
595
+
596
+ // Assign the ranks in order to the collected list.
597
+ for (uint32_t i = 0; i < r->list_.size(); i++) {
598
+ r->nodes_[r->list_[i]]->rank = r->merged_[i];
599
+ }
600
+ }
601
+
602
+ static void Sort(const Vec<Node*>& nodes, Vec<int32_t>* delta) {
603
+ struct ByRank {
604
+ const Vec<Node*>* nodes;
605
+ bool operator()(int32_t a, int32_t b) const {
606
+ return (*nodes)[a]->rank < (*nodes)[b]->rank;
607
+ }
608
+ };
609
+ ByRank cmp;
610
+ cmp.nodes = &nodes;
611
+ std::sort(delta->begin(), delta->end(), cmp);
612
+ }
613
+
614
+ static void MoveToList(
615
+ GraphCycles::Rep* r, Vec<int32_t>* src, Vec<int32_t>* dst) {
616
+ for (auto& v : *src) {
617
+ int32_t w = v;
618
+ v = r->nodes_[w]->rank; // Replace v entry with its rank
619
+ r->nodes_[w]->visited = false; // Prepare for future DFS calls
620
+ dst->push_back(w);
621
+ }
622
+ }
623
+
624
+ int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len,
625
+ GraphId path[]) const {
626
+ Rep* r = rep_;
627
+ if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0;
628
+ const int32_t x = NodeIndex(idx);
629
+ const int32_t y = NodeIndex(idy);
630
+
631
+ // Forward depth first search starting at x until we hit y.
632
+ // As we descend into a node, we push it onto the path.
633
+ // As we leave a node, we remove it from the path.
634
+ int path_len = 0;
635
+
636
+ NodeSet seen;
637
+ r->stack_.clear();
638
+ r->stack_.push_back(x);
639
+ while (!r->stack_.empty()) {
640
+ int32_t n = r->stack_.back();
641
+ r->stack_.pop_back();
642
+ if (n < 0) {
643
+ // Marker to indicate that we are leaving a node
644
+ path_len--;
645
+ continue;
646
+ }
647
+
648
+ if (path_len < max_path_len) {
649
+ path[path_len] = MakeId(n, rep_->nodes_[n]->version);
650
+ }
651
+ path_len++;
652
+ r->stack_.push_back(-1); // Will remove tentative path entry
653
+
654
+ if (n == y) {
655
+ return path_len;
656
+ }
657
+
658
+ HASH_FOR_EACH(w, r->nodes_[n]->out) {
659
+ if (seen.insert(w)) {
660
+ r->stack_.push_back(w);
661
+ }
662
+ }
663
+ }
664
+
665
+ return 0;
666
+ }
667
+
668
+ bool GraphCycles::IsReachable(GraphId x, GraphId y) const {
669
+ return FindPath(x, y, 0, nullptr) > 0;
670
+ }
671
+
672
+ void GraphCycles::UpdateStackTrace(GraphId id, int priority,
673
+ int (*get_stack_trace)(void** stack, int)) {
674
+ Node* n = FindNode(rep_, id);
675
+ if (n == nullptr || n->priority >= priority) {
676
+ return;
677
+ }
678
+ n->nstack = (*get_stack_trace)(n->stack, ABSL_ARRAYSIZE(n->stack));
679
+ n->priority = priority;
680
+ }
681
+
682
+ int GraphCycles::GetStackTrace(GraphId id, void*** ptr) {
683
+ Node* n = FindNode(rep_, id);
684
+ if (n == nullptr) {
685
+ *ptr = nullptr;
686
+ return 0;
687
+ } else {
688
+ *ptr = n->stack;
689
+ return n->nstack;
690
+ }
691
+ }
692
+
693
+ } // namespace synchronization_internal
694
+ ABSL_NAMESPACE_END
695
+ } // namespace absl
696
+
697
+ #endif // ABSL_LOW_LEVEL_ALLOC_MISSING