grpc 1.30.1 → 1.32.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 (676) hide show
  1. checksums.yaml +4 -4
  2. data/Makefile +723 -15910
  3. data/include/grpc/grpc_security.h +31 -14
  4. data/include/grpc/grpc_security_constants.h +3 -0
  5. data/include/grpc/impl/codegen/README.md +22 -0
  6. data/include/grpc/impl/codegen/grpc_types.h +7 -5
  7. data/include/grpc/impl/codegen/port_platform.h +6 -33
  8. data/src/core/ext/filters/client_channel/backend_metric.cc +12 -9
  9. data/src/core/ext/filters/client_channel/backup_poller.cc +3 -2
  10. data/src/core/ext/filters/client_channel/client_channel.cc +470 -285
  11. data/src/core/ext/filters/client_channel/client_channel.h +1 -1
  12. data/src/core/ext/filters/client_channel/client_channel_channelz.h +0 -3
  13. data/src/core/ext/filters/client_channel/config_selector.cc +62 -0
  14. data/src/core/ext/filters/client_channel/config_selector.h +93 -0
  15. data/src/core/ext/filters/client_channel/global_subchannel_pool.cc +24 -2
  16. data/src/core/ext/filters/client_channel/health/health_check_client.cc +8 -1
  17. data/src/core/ext/filters/client_channel/http_connect_handshaker.cc +8 -8
  18. data/src/core/ext/filters/client_channel/http_proxy.cc +6 -4
  19. data/src/core/ext/filters/client_channel/lb_policy.h +4 -0
  20. data/src/core/ext/filters/client_channel/lb_policy/child_policy_handler.cc +6 -4
  21. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb.cc +59 -36
  22. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_balancer_addresses.cc +0 -13
  23. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_balancer_addresses.h +0 -3
  24. data/src/core/ext/filters/client_channel/lb_policy/grpclb/grpclb_channel_secure.cc +1 -37
  25. data/src/core/ext/filters/client_channel/lb_policy/pick_first/pick_first.cc +19 -13
  26. data/src/core/ext/filters/client_channel/lb_policy/priority/priority.cc +29 -10
  27. data/src/core/ext/filters/client_channel/lb_policy/round_robin/round_robin.cc +5 -4
  28. data/src/core/ext/filters/client_channel/lb_policy/subchannel_list.h +4 -6
  29. data/src/core/ext/filters/client_channel/lb_policy/weighted_target/weighted_target.cc +23 -13
  30. data/src/core/ext/filters/client_channel/lb_policy/xds/cds.cc +18 -12
  31. data/src/core/ext/filters/client_channel/lb_policy/xds/eds.cc +22 -14
  32. data/src/core/ext/filters/client_channel/lb_policy/xds/lrs.cc +18 -9
  33. data/src/core/ext/filters/client_channel/lb_policy/xds/xds_routing.cc +385 -78
  34. data/src/core/ext/filters/client_channel/lb_policy_registry.cc +4 -5
  35. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/dns_resolver_ares.cc +5 -2
  36. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_ev_driver.cc +6 -5
  37. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_ev_driver_libuv.cc +8 -6
  38. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_ev_driver_posix.cc +9 -7
  39. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_ev_driver_windows.cc +7 -5
  40. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper.cc +36 -51
  41. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper_libuv.cc +1 -1
  42. data/src/core/ext/filters/client_channel/resolver/dns/c_ares/grpc_ares_wrapper_windows.cc +1 -1
  43. data/src/core/ext/filters/client_channel/resolver/dns/native/dns_resolver.cc +6 -2
  44. data/src/core/ext/filters/client_channel/resolver/fake/fake_resolver.cc +1 -1
  45. data/src/core/ext/filters/client_channel/resolver/sockaddr/sockaddr_resolver.cc +1 -1
  46. data/src/core/ext/filters/client_channel/resolver/xds/xds_resolver.cc +383 -31
  47. data/src/core/ext/filters/client_channel/resolver_registry.cc +13 -14
  48. data/src/core/ext/filters/client_channel/resolver_result_parsing.cc +6 -7
  49. data/src/core/ext/filters/client_channel/resolver_result_parsing.h +0 -1
  50. data/src/core/ext/filters/client_channel/resolving_lb_policy.cc +38 -32
  51. data/src/core/ext/filters/client_channel/resolving_lb_policy.h +39 -20
  52. data/src/core/ext/filters/client_channel/server_address.cc +40 -7
  53. data/src/core/ext/filters/client_channel/server_address.h +42 -4
  54. data/src/core/ext/filters/client_channel/service_config_channel_arg_filter.cc +142 -0
  55. data/src/core/ext/filters/client_channel/subchannel.cc +65 -24
  56. data/src/core/ext/filters/client_channel/subchannel.h +16 -4
  57. data/src/core/ext/filters/http/client/http_client_filter.cc +5 -5
  58. data/src/core/ext/filters/http/http_filters_plugin.cc +2 -1
  59. data/src/core/ext/filters/http/message_compress/message_decompress_filter.cc +74 -33
  60. data/src/core/ext/filters/http/message_compress/message_decompress_filter.h +3 -1
  61. data/src/core/ext/filters/max_age/max_age_filter.cc +2 -1
  62. data/src/core/ext/filters/message_size/message_size_filter.cc +56 -80
  63. data/src/core/ext/filters/message_size/message_size_filter.h +6 -0
  64. data/src/core/ext/transport/chttp2/client/chttp2_connector.cc +87 -31
  65. data/src/core/ext/transport/chttp2/client/chttp2_connector.h +18 -1
  66. data/src/core/ext/transport/chttp2/client/secure/secure_channel_create.cc +10 -35
  67. data/src/core/ext/transport/chttp2/server/chttp2_server.cc +378 -348
  68. data/src/core/ext/transport/chttp2/server/chttp2_server.h +7 -2
  69. data/src/core/ext/transport/chttp2/server/insecure/server_chttp2.cc +3 -3
  70. data/src/core/ext/transport/chttp2/server/insecure/server_chttp2_posix.cc +10 -16
  71. data/src/core/ext/transport/chttp2/server/secure/server_secure_chttp2.cc +9 -9
  72. data/src/core/ext/transport/chttp2/transport/chttp2_transport.cc +256 -279
  73. data/src/core/ext/transport/chttp2/transport/flow_control.cc +23 -28
  74. data/src/core/ext/transport/chttp2/transport/flow_control.h +14 -16
  75. data/src/core/ext/transport/chttp2/transport/frame_data.cc +9 -12
  76. data/src/core/ext/transport/chttp2/transport/frame_goaway.cc +4 -6
  77. data/src/core/ext/transport/chttp2/transport/frame_ping.cc +5 -6
  78. data/src/core/ext/transport/chttp2/transport/frame_rst_stream.cc +12 -13
  79. data/src/core/ext/transport/chttp2/transport/frame_settings.cc +8 -9
  80. data/src/core/ext/transport/chttp2/transport/frame_window_update.cc +9 -12
  81. data/src/core/ext/transport/chttp2/transport/hpack_parser.cc +25 -29
  82. data/src/core/ext/transport/chttp2/transport/hpack_table.cc +13 -17
  83. data/src/core/ext/transport/chttp2/transport/internal.h +18 -1
  84. data/src/core/ext/transport/chttp2/transport/parsing.cc +34 -71
  85. data/src/core/ext/transport/chttp2/transport/writing.cc +15 -19
  86. data/src/core/ext/transport/inproc/inproc_transport.cc +47 -27
  87. data/src/core/ext/upb-generated/envoy/annotations/deprecation.upb.h +0 -1
  88. data/src/core/ext/upb-generated/envoy/annotations/resource.upb.h +3 -4
  89. data/src/core/ext/upb-generated/envoy/config/accesslog/v3/accesslog.upb.c +224 -0
  90. data/src/core/ext/upb-generated/envoy/config/accesslog/v3/accesslog.upb.h +700 -0
  91. data/src/core/ext/upb-generated/envoy/config/cluster/v3/circuit_breaker.upb.c +74 -0
  92. data/src/core/ext/upb-generated/envoy/config/cluster/v3/circuit_breaker.upb.h +226 -0
  93. data/src/core/ext/upb-generated/envoy/config/cluster/v3/cluster.upb.c +380 -0
  94. data/src/core/ext/upb-generated/envoy/config/cluster/v3/cluster.upb.h +1378 -0
  95. data/src/core/ext/upb-generated/envoy/{api/v2/cluster → config/cluster/v3}/filter.upb.c +8 -8
  96. data/src/core/ext/upb-generated/envoy/config/cluster/v3/filter.upb.h +69 -0
  97. data/src/core/ext/upb-generated/envoy/{api/v2/cluster → config/cluster/v3}/outlier_detection.upb.c +8 -8
  98. data/src/core/ext/upb-generated/envoy/config/cluster/v3/outlier_detection.upb.h +323 -0
  99. data/src/core/ext/upb-generated/envoy/config/core/v3/address.upb.c +112 -0
  100. data/src/core/ext/upb-generated/envoy/config/core/v3/address.upb.h +334 -0
  101. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/backoff.upb.c +8 -8
  102. data/src/core/ext/upb-generated/envoy/config/core/v3/backoff.upb.h +79 -0
  103. data/src/core/ext/upb-generated/envoy/config/core/v3/base.upb.c +309 -0
  104. data/src/core/ext/upb-generated/envoy/config/core/v3/base.upb.h +869 -0
  105. data/src/core/ext/upb-generated/envoy/config/core/v3/config_source.upb.c +96 -0
  106. data/src/core/ext/upb-generated/envoy/config/core/v3/config_source.upb.h +328 -0
  107. data/src/core/ext/upb-generated/envoy/config/core/v3/event_service_config.upb.c +34 -0
  108. data/src/core/ext/upb-generated/envoy/config/core/v3/event_service_config.upb.h +71 -0
  109. data/src/core/ext/upb-generated/envoy/config/core/v3/grpc_service.upb.c +195 -0
  110. data/src/core/ext/upb-generated/envoy/config/core/v3/grpc_service.upb.h +634 -0
  111. data/src/core/ext/upb-generated/envoy/config/core/v3/health_check.upb.c +170 -0
  112. data/src/core/ext/upb-generated/envoy/config/core/v3/health_check.upb.h +684 -0
  113. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/http_uri.upb.c +8 -8
  114. data/src/core/ext/upb-generated/envoy/config/core/v3/http_uri.upb.h +80 -0
  115. data/src/core/ext/upb-generated/envoy/config/core/v3/protocol.upb.c +152 -0
  116. data/src/core/ext/upb-generated/envoy/config/core/v3/protocol.upb.h +536 -0
  117. data/src/core/ext/upb-generated/envoy/config/core/v3/proxy_protocol.upb.c +28 -0
  118. data/src/core/ext/upb-generated/envoy/config/core/v3/proxy_protocol.upb.h +58 -0
  119. data/src/core/ext/upb-generated/envoy/{api/v2/core → config/core/v3}/socket_option.upb.c +6 -6
  120. data/src/core/ext/upb-generated/envoy/config/core/v3/socket_option.upb.h +88 -0
  121. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint.upb.c +91 -0
  122. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint.upb.h +220 -0
  123. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint_components.upb.c +91 -0
  124. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/endpoint_components.upb.h +273 -0
  125. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/load_report.upb.c +112 -0
  126. data/src/core/ext/upb-generated/envoy/config/endpoint/v3/load_report.upb.h +332 -0
  127. data/src/core/ext/upb-generated/envoy/config/listener/{v2 → v3}/api_listener.upb.c +8 -8
  128. data/src/core/ext/upb-generated/envoy/config/listener/v3/api_listener.upb.h +65 -0
  129. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener.upb.c +108 -0
  130. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener.upb.h +401 -0
  131. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener_components.upb.c +138 -0
  132. data/src/core/ext/upb-generated/envoy/config/listener/v3/listener_components.upb.h +490 -0
  133. data/src/core/ext/upb-generated/envoy/config/listener/v3/udp_listener_config.upb.c +41 -0
  134. data/src/core/ext/upb-generated/envoy/config/listener/v3/udp_listener_config.upb.h +94 -0
  135. data/src/core/ext/upb-generated/envoy/config/rbac/v3/rbac.upb.c +174 -0
  136. data/src/core/ext/upb-generated/envoy/config/rbac/v3/rbac.upb.h +599 -0
  137. data/src/core/ext/upb-generated/envoy/config/route/v3/route.upb.c +63 -0
  138. data/src/core/ext/upb-generated/envoy/config/route/v3/route.upb.h +204 -0
  139. data/src/core/ext/upb-generated/envoy/config/route/v3/route_components.upb.c +773 -0
  140. data/src/core/ext/upb-generated/envoy/config/route/v3/route_components.upb.h +2855 -0
  141. data/src/core/ext/upb-generated/envoy/config/route/v3/scoped_route.upb.c +59 -0
  142. data/src/core/ext/upb-generated/envoy/config/route/v3/scoped_route.upb.h +135 -0
  143. data/src/core/ext/upb-generated/envoy/config/trace/v3/http_tracer.upb.c +50 -0
  144. data/src/core/ext/upb-generated/envoy/config/trace/v3/http_tracer.upb.h +108 -0
  145. data/src/core/ext/upb-generated/envoy/extensions/filters/network/http_connection_manager/v3/http_connection_manager.upb.c +312 -0
  146. data/src/core/ext/upb-generated/envoy/extensions/filters/network/http_connection_manager/v3/http_connection_manager.upb.h +1125 -0
  147. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/cert.upb.c +20 -0
  148. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/cert.upb.h +34 -0
  149. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/common.upb.c +111 -0
  150. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/common.upb.h +401 -0
  151. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/secret.upb.c +72 -0
  152. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/secret.upb.h +198 -0
  153. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/tls.upb.c +105 -0
  154. data/src/core/ext/upb-generated/envoy/extensions/transport_sockets/tls/v3/tls.upb.h +388 -0
  155. data/src/core/ext/upb-generated/envoy/{api/v2 → service/cluster/v3}/cds.upb.c +5 -6
  156. data/src/core/ext/upb-generated/envoy/service/cluster/v3/cds.upb.h +49 -0
  157. data/src/core/ext/upb-generated/envoy/service/discovery/{v2 → v3}/ads.upb.c +5 -4
  158. data/src/core/ext/upb-generated/envoy/service/discovery/v3/ads.upb.h +49 -0
  159. data/src/core/ext/upb-generated/envoy/service/discovery/v3/discovery.upb.c +129 -0
  160. data/src/core/ext/upb-generated/envoy/service/discovery/v3/discovery.upb.h +386 -0
  161. data/src/core/ext/upb-generated/envoy/{api/v2 → service/endpoint/v3}/eds.upb.c +5 -6
  162. data/src/core/ext/upb-generated/envoy/service/endpoint/v3/eds.upb.h +49 -0
  163. data/src/core/ext/upb-generated/envoy/{api/v2 → service/listener/v3}/lds.upb.c +5 -6
  164. data/src/core/ext/upb-generated/envoy/service/listener/v3/lds.upb.h +49 -0
  165. data/src/core/ext/upb-generated/envoy/service/load_stats/v3/lrs.upb.c +55 -0
  166. data/src/core/ext/upb-generated/envoy/service/load_stats/v3/lrs.upb.h +136 -0
  167. data/src/core/ext/upb-generated/envoy/{api/v2 → service/route/v3}/rds.upb.c +5 -6
  168. data/src/core/ext/upb-generated/envoy/service/route/v3/rds.upb.h +49 -0
  169. data/src/core/ext/upb-generated/envoy/{api/v2 → service/route/v3}/srds.upb.c +5 -6
  170. data/src/core/ext/upb-generated/envoy/service/route/v3/srds.upb.h +49 -0
  171. data/src/core/ext/upb-generated/envoy/type/matcher/v3/metadata.upb.c +47 -0
  172. data/src/core/ext/upb-generated/envoy/type/matcher/v3/metadata.upb.h +114 -0
  173. data/src/core/ext/upb-generated/envoy/type/matcher/v3/number.upb.c +35 -0
  174. data/src/core/ext/upb-generated/envoy/type/matcher/v3/number.upb.h +77 -0
  175. data/src/core/ext/upb-generated/envoy/type/matcher/v3/path.upb.c +34 -0
  176. data/src/core/ext/upb-generated/envoy/type/matcher/v3/path.upb.h +71 -0
  177. data/src/core/ext/upb-generated/envoy/type/matcher/v3/regex.upb.c +64 -0
  178. data/src/core/ext/upb-generated/envoy/type/matcher/v3/regex.upb.h +145 -0
  179. data/src/core/ext/upb-generated/envoy/type/matcher/v3/string.upb.c +53 -0
  180. data/src/core/ext/upb-generated/envoy/type/matcher/v3/string.upb.h +127 -0
  181. data/src/core/ext/upb-generated/envoy/type/matcher/v3/value.upb.c +63 -0
  182. data/src/core/ext/upb-generated/envoy/type/matcher/v3/value.upb.h +188 -0
  183. data/src/core/ext/upb-generated/envoy/type/metadata/v3/metadata.upb.c +88 -0
  184. data/src/core/ext/upb-generated/envoy/type/metadata/v3/metadata.upb.h +258 -0
  185. data/src/core/ext/upb-generated/envoy/type/tracing/v3/custom_tag.upb.c +90 -0
  186. data/src/core/ext/upb-generated/envoy/type/tracing/v3/custom_tag.upb.h +250 -0
  187. data/src/core/ext/upb-generated/envoy/type/{http.upb.c → v3/http.upb.c} +2 -2
  188. data/src/core/ext/upb-generated/envoy/type/{http.upb.h → v3/http.upb.h} +8 -9
  189. data/src/core/ext/upb-generated/envoy/type/{percent.upb.c → v3/percent.upb.c} +9 -8
  190. data/src/core/ext/upb-generated/envoy/type/v3/percent.upb.h +86 -0
  191. data/src/core/ext/upb-generated/envoy/type/{range.upb.c → v3/range.upb.c} +12 -11
  192. data/src/core/ext/upb-generated/envoy/type/v3/range.upb.h +111 -0
  193. data/src/core/ext/upb-generated/envoy/type/{semantic_version.upb.c → v3/semantic_version.upb.c} +6 -5
  194. data/src/core/ext/upb-generated/envoy/type/v3/semantic_version.upb.h +61 -0
  195. data/src/core/ext/upb-generated/gogoproto/gogo.upb.h +0 -1
  196. data/src/core/ext/upb-generated/google/api/annotations.upb.h +0 -1
  197. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/syntax.upb.c +234 -0
  198. data/src/core/ext/upb-generated/google/api/expr/v1alpha1/syntax.upb.h +759 -0
  199. data/src/core/ext/upb-generated/google/api/http.upb.h +29 -28
  200. data/src/core/ext/upb-generated/google/protobuf/any.upb.h +5 -6
  201. data/src/core/ext/upb-generated/google/protobuf/descriptor.upb.c +39 -39
  202. data/src/core/ext/upb-generated/google/protobuf/descriptor.upb.h +412 -386
  203. data/src/core/ext/upb-generated/google/protobuf/duration.upb.h +5 -6
  204. data/src/core/ext/upb-generated/google/protobuf/empty.upb.h +1 -2
  205. data/src/core/ext/upb-generated/google/protobuf/struct.upb.c +1 -1
  206. data/src/core/ext/upb-generated/google/protobuf/struct.upb.h +34 -55
  207. data/src/core/ext/upb-generated/google/protobuf/timestamp.upb.h +5 -6
  208. data/src/core/ext/upb-generated/google/protobuf/wrappers.upb.h +27 -28
  209. data/src/core/ext/upb-generated/google/rpc/status.upb.h +8 -8
  210. data/src/core/ext/upb-generated/src/proto/grpc/gcp/altscontext.upb.c +1 -1
  211. data/src/core/ext/upb-generated/src/proto/grpc/gcp/altscontext.upb.h +32 -45
  212. data/src/core/ext/upb-generated/src/proto/grpc/gcp/handshaker.upb.c +4 -4
  213. data/src/core/ext/upb-generated/src/proto/grpc/gcp/handshaker.upb.h +157 -178
  214. data/src/core/ext/upb-generated/src/proto/grpc/gcp/transport_security_common.upb.h +14 -13
  215. data/src/core/ext/upb-generated/src/proto/grpc/health/v1/health.upb.h +6 -7
  216. data/src/core/ext/upb-generated/src/proto/grpc/lb/v1/load_balancer.upb.h +59 -56
  217. data/src/core/ext/upb-generated/udpa/annotations/migrate.upb.h +11 -12
  218. data/src/core/ext/upb-generated/udpa/annotations/sensitive.upb.h +0 -1
  219. data/src/core/ext/upb-generated/udpa/annotations/status.upb.h +5 -6
  220. data/src/core/ext/upb-generated/udpa/annotations/versioning.upb.c +27 -0
  221. data/src/core/ext/upb-generated/udpa/annotations/versioning.upb.h +53 -0
  222. data/src/core/ext/upb-generated/udpa/data/orca/v1/orca_load_report.upb.c +6 -6
  223. data/src/core/ext/upb-generated/udpa/data/orca/v1/orca_load_report.upb.h +41 -68
  224. data/src/core/ext/upb-generated/validate/validate.upb.c +11 -11
  225. data/src/core/ext/upb-generated/validate/validate.upb.h +537 -536
  226. data/src/core/ext/xds/xds_api.cc +2388 -0
  227. data/src/core/ext/{filters/client_channel/xds → xds}/xds_api.h +120 -40
  228. data/src/core/ext/{filters/client_channel/xds → xds}/xds_bootstrap.cc +56 -25
  229. data/src/core/ext/{filters/client_channel/xds → xds}/xds_bootstrap.h +8 -3
  230. data/src/core/ext/{filters/client_channel/xds → xds}/xds_channel.h +4 -4
  231. data/src/core/ext/{filters/client_channel/xds → xds}/xds_channel_args.h +3 -3
  232. data/src/core/ext/{filters/client_channel/xds → xds}/xds_channel_secure.cc +2 -5
  233. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client.cc +94 -347
  234. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client.h +12 -45
  235. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client_stats.cc +2 -2
  236. data/src/core/ext/{filters/client_channel/xds → xds}/xds_client_stats.h +13 -13
  237. data/src/core/lib/channel/channel_trace.cc +2 -6
  238. data/src/core/lib/channel/channelz.cc +19 -30
  239. data/src/core/lib/channel/channelz.h +1 -1
  240. data/src/core/lib/channel/channelz_registry.cc +3 -1
  241. data/src/core/lib/gpr/log_linux.cc +6 -8
  242. data/src/core/lib/gpr/log_posix.cc +6 -8
  243. data/src/core/lib/gpr/string.cc +10 -9
  244. data/src/core/lib/gpr/string.h +4 -2
  245. data/src/core/lib/gpr/sync_posix.cc +2 -8
  246. data/src/core/lib/gprpp/global_config_env.cc +8 -6
  247. data/src/core/lib/http/httpcli.cc +13 -10
  248. data/src/core/lib/http/httpcli_security_connector.cc +5 -5
  249. data/src/core/lib/iomgr/cfstream_handle.cc +1 -0
  250. data/src/core/lib/iomgr/endpoint.cc +5 -1
  251. data/src/core/lib/iomgr/endpoint.h +7 -3
  252. data/src/core/lib/iomgr/endpoint_cfstream.cc +32 -11
  253. data/src/core/lib/iomgr/endpoint_pair_posix.cc +10 -10
  254. data/src/core/lib/iomgr/error_cfstream.cc +9 -8
  255. data/src/core/lib/iomgr/ev_epoll1_linux.cc +5 -6
  256. data/src/core/lib/iomgr/ev_epollex_linux.cc +15 -21
  257. data/src/core/lib/iomgr/ev_poll_posix.cc +6 -5
  258. data/src/core/lib/iomgr/is_epollexclusive_available.cc +14 -0
  259. data/src/core/{ext/filters/client_channel → lib/iomgr}/parse_address.cc +1 -1
  260. data/src/core/{ext/filters/client_channel → lib/iomgr}/parse_address.h +3 -3
  261. data/src/core/lib/iomgr/port.h +1 -21
  262. data/src/core/lib/iomgr/resolve_address_custom.cc +13 -18
  263. data/src/core/lib/iomgr/resolve_address_windows.cc +8 -8
  264. data/src/core/lib/iomgr/resource_quota.cc +34 -31
  265. data/src/core/lib/iomgr/sockaddr_utils.cc +9 -6
  266. data/src/core/lib/iomgr/sockaddr_utils.h +3 -2
  267. data/src/core/lib/iomgr/socket_utils_common_posix.cc +95 -55
  268. data/src/core/lib/iomgr/socket_windows.cc +4 -5
  269. data/src/core/lib/iomgr/tcp_client_cfstream.cc +9 -11
  270. data/src/core/lib/iomgr/tcp_client_custom.cc +6 -9
  271. data/src/core/lib/iomgr/tcp_client_posix.cc +27 -36
  272. data/src/core/lib/iomgr/tcp_client_windows.cc +9 -9
  273. data/src/core/lib/iomgr/tcp_custom.cc +33 -17
  274. data/src/core/lib/iomgr/tcp_custom.h +1 -1
  275. data/src/core/lib/iomgr/tcp_posix.cc +31 -13
  276. data/src/core/lib/iomgr/tcp_server.cc +3 -4
  277. data/src/core/lib/iomgr/tcp_server.h +7 -5
  278. data/src/core/lib/iomgr/tcp_server_custom.cc +6 -14
  279. data/src/core/lib/iomgr/tcp_server_posix.cc +34 -41
  280. data/src/core/lib/iomgr/tcp_server_utils_posix.h +3 -4
  281. data/src/core/lib/iomgr/tcp_server_utils_posix_common.cc +5 -7
  282. data/src/core/lib/iomgr/tcp_server_utils_posix_ifaddrs.cc +4 -9
  283. data/src/core/lib/iomgr/tcp_server_windows.cc +16 -16
  284. data/src/core/lib/iomgr/tcp_windows.cc +26 -10
  285. data/src/core/lib/iomgr/timer_generic.cc +13 -12
  286. data/src/core/lib/iomgr/udp_server.cc +24 -23
  287. data/src/core/lib/iomgr/udp_server.h +5 -2
  288. data/src/core/lib/iomgr/unix_sockets_posix.cc +9 -14
  289. data/src/core/lib/iomgr/unix_sockets_posix.h +3 -1
  290. data/src/core/lib/iomgr/unix_sockets_posix_noop.cc +5 -2
  291. data/src/core/lib/json/json_reader.cc +20 -21
  292. data/src/core/lib/security/authorization/authorization_engine.cc +177 -0
  293. data/src/core/lib/security/authorization/authorization_engine.h +84 -0
  294. data/src/core/lib/security/authorization/evaluate_args.cc +153 -0
  295. data/src/core/lib/security/authorization/evaluate_args.h +59 -0
  296. data/src/core/lib/security/authorization/mock_cel/activation.h +57 -0
  297. data/src/core/lib/security/authorization/mock_cel/cel_expr_builder_factory.h +42 -0
  298. data/src/core/lib/security/authorization/mock_cel/cel_expression.h +68 -0
  299. data/src/core/lib/security/authorization/mock_cel/cel_value.h +93 -0
  300. data/src/core/lib/security/authorization/mock_cel/evaluator_core.h +67 -0
  301. data/src/core/lib/security/authorization/mock_cel/flat_expr_builder.h +56 -0
  302. data/src/core/lib/security/authorization/mock_cel/statusor.h +50 -0
  303. data/src/core/lib/security/credentials/credentials.h +5 -3
  304. data/src/core/lib/security/credentials/google_default/credentials_generic.cc +8 -6
  305. data/src/core/lib/security/credentials/google_default/google_default_credentials.cc +64 -43
  306. data/src/core/lib/security/credentials/jwt/jwt_credentials.cc +7 -4
  307. data/src/core/lib/security/credentials/oauth2/oauth2_credentials.cc +19 -28
  308. data/src/core/lib/security/credentials/plugin/plugin_credentials.cc +6 -6
  309. data/src/core/lib/security/credentials/ssl/ssl_credentials.cc +20 -0
  310. data/src/core/lib/security/credentials/ssl/ssl_credentials.h +10 -0
  311. data/src/core/lib/security/credentials/tls/grpc_tls_credentials_options.h +10 -0
  312. data/src/core/lib/security/security_connector/fake/fake_security_connector.cc +11 -12
  313. data/src/core/lib/security/security_connector/security_connector.cc +2 -0
  314. data/src/core/lib/security/security_connector/security_connector.h +1 -1
  315. data/src/core/lib/security/security_connector/ssl/ssl_security_connector.cc +18 -11
  316. data/src/core/lib/security/security_connector/ssl/ssl_security_connector.h +5 -0
  317. data/src/core/lib/security/security_connector/ssl_utils.cc +44 -23
  318. data/src/core/lib/security/security_connector/ssl_utils.h +6 -2
  319. data/src/core/lib/security/security_connector/tls/tls_security_connector.cc +27 -24
  320. data/src/core/lib/security/transport/client_auth_filter.cc +10 -9
  321. data/src/core/lib/security/transport/secure_endpoint.cc +7 -1
  322. data/src/core/lib/security/util/json_util.cc +12 -13
  323. data/src/core/lib/slice/slice.cc +38 -1
  324. data/src/core/lib/slice/slice_internal.h +1 -0
  325. data/src/core/lib/surface/call.cc +52 -53
  326. data/src/core/lib/surface/call.h +2 -1
  327. data/src/core/lib/surface/channel.cc +28 -20
  328. data/src/core/lib/surface/channel.h +12 -2
  329. data/src/core/lib/surface/completion_queue.cc +0 -5
  330. data/src/core/lib/surface/init.cc +1 -1
  331. data/src/core/lib/surface/server.cc +1102 -1347
  332. data/src/core/lib/surface/server.h +369 -71
  333. data/src/core/lib/surface/version.cc +2 -2
  334. data/src/core/lib/transport/authority_override.cc +38 -0
  335. data/src/core/lib/transport/authority_override.h +32 -0
  336. data/src/core/lib/transport/connectivity_state.cc +18 -13
  337. data/src/core/lib/transport/connectivity_state.h +18 -6
  338. data/src/core/lib/transport/error_utils.cc +13 -0
  339. data/src/core/lib/transport/error_utils.h +6 -0
  340. data/src/core/lib/transport/static_metadata.cc +295 -276
  341. data/src/core/lib/transport/static_metadata.h +80 -73
  342. data/src/core/lib/transport/transport.h +13 -0
  343. data/src/core/lib/uri/uri_parser.cc +30 -35
  344. data/src/core/lib/uri/uri_parser.h +3 -1
  345. data/src/core/plugin_registry/grpc_plugin_registry.cc +4 -0
  346. data/src/core/tsi/alts/handshaker/alts_handshaker_client.cc +23 -13
  347. data/src/core/tsi/alts/handshaker/alts_tsi_handshaker.cc +24 -0
  348. data/src/core/tsi/alts/handshaker/transport_security_common_api.cc +2 -0
  349. data/src/core/tsi/ssl_transport_security.cc +102 -11
  350. data/src/core/tsi/ssl_transport_security.h +14 -2
  351. data/src/core/tsi/transport_security_interface.h +5 -0
  352. data/src/ruby/bin/math_services_pb.rb +4 -4
  353. data/src/ruby/ext/grpc/extconf.rb +5 -2
  354. data/src/ruby/ext/grpc/rb_call.c +3 -2
  355. data/src/ruby/ext/grpc/rb_call.h +4 -0
  356. data/src/ruby/ext/grpc/rb_call_credentials.c +54 -10
  357. data/src/ruby/ext/grpc/rb_channel_credentials.c +9 -0
  358. data/src/ruby/ext/grpc/rb_grpc_imports.generated.c +2 -2
  359. data/src/ruby/ext/grpc/rb_grpc_imports.generated.h +4 -4
  360. data/src/ruby/lib/grpc/generic/client_stub.rb +1 -1
  361. data/src/ruby/lib/grpc/generic/interceptors.rb +1 -1
  362. data/src/ruby/lib/grpc/version.rb +1 -1
  363. data/src/ruby/pb/grpc/health/v1/health_services_pb.rb +2 -2
  364. data/src/ruby/pb/src/proto/grpc/testing/messages_pb.rb +5 -0
  365. data/src/ruby/pb/src/proto/grpc/testing/test_services_pb.rb +28 -12
  366. data/src/ruby/spec/channel_credentials_spec.rb +10 -0
  367. data/src/ruby/spec/generic/active_call_spec.rb +19 -8
  368. data/src/ruby/spec/pb/codegen/grpc/testing/package_options_import2.proto +23 -0
  369. data/src/ruby/spec/pb/codegen/grpc/testing/package_options_ruby_style.proto +2 -0
  370. data/src/ruby/spec/pb/codegen/grpc/testing/same_package_service_name.proto +27 -0
  371. data/src/ruby/spec/pb/codegen/grpc/testing/same_ruby_package_service_name.proto +29 -0
  372. data/src/ruby/spec/pb/codegen/package_option_spec.rb +25 -1
  373. data/src/ruby/spec/user_agent_spec.rb +74 -0
  374. data/third_party/abseil-cpp/absl/algorithm/container.h +1727 -0
  375. data/third_party/abseil-cpp/absl/base/internal/direct_mmap.h +161 -0
  376. data/third_party/abseil-cpp/absl/base/internal/exponential_biased.cc +93 -0
  377. data/third_party/abseil-cpp/absl/base/internal/exponential_biased.h +130 -0
  378. data/third_party/abseil-cpp/absl/base/internal/low_level_alloc.cc +620 -0
  379. data/third_party/abseil-cpp/absl/base/internal/low_level_alloc.h +126 -0
  380. data/third_party/abseil-cpp/absl/container/fixed_array.h +515 -0
  381. data/third_party/abseil-cpp/absl/container/flat_hash_set.h +503 -0
  382. data/third_party/abseil-cpp/absl/container/internal/common.h +202 -0
  383. data/third_party/abseil-cpp/absl/container/internal/container_memory.h +440 -0
  384. data/third_party/abseil-cpp/absl/container/internal/hash_function_defaults.h +146 -0
  385. data/third_party/abseil-cpp/absl/container/internal/hash_policy_traits.h +191 -0
  386. data/third_party/abseil-cpp/absl/container/internal/hashtable_debug_hooks.h +85 -0
  387. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler.cc +269 -0
  388. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler.h +297 -0
  389. data/third_party/abseil-cpp/absl/container/internal/hashtablez_sampler_force_weak_definition.cc +30 -0
  390. data/third_party/abseil-cpp/absl/container/internal/have_sse.h +49 -0
  391. data/third_party/abseil-cpp/absl/container/internal/layout.h +741 -0
  392. data/third_party/abseil-cpp/absl/container/internal/raw_hash_set.cc +48 -0
  393. data/third_party/abseil-cpp/absl/container/internal/raw_hash_set.h +1882 -0
  394. data/third_party/abseil-cpp/absl/debugging/internal/address_is_readable.cc +138 -0
  395. data/third_party/abseil-cpp/absl/debugging/internal/address_is_readable.h +32 -0
  396. data/third_party/abseil-cpp/absl/debugging/internal/demangle.cc +1895 -0
  397. data/third_party/abseil-cpp/absl/debugging/internal/demangle.h +71 -0
  398. data/third_party/abseil-cpp/absl/debugging/internal/elf_mem_image.cc +382 -0
  399. data/third_party/abseil-cpp/absl/debugging/internal/elf_mem_image.h +134 -0
  400. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_aarch64-inl.inc +192 -0
  401. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_arm-inl.inc +125 -0
  402. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_config.h +70 -0
  403. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_generic-inl.inc +99 -0
  404. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_powerpc-inl.inc +248 -0
  405. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_unimplemented-inl.inc +24 -0
  406. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_win32-inl.inc +85 -0
  407. data/third_party/abseil-cpp/absl/debugging/internal/stacktrace_x86-inl.inc +346 -0
  408. data/third_party/abseil-cpp/absl/debugging/internal/symbolize.h +128 -0
  409. data/third_party/abseil-cpp/absl/debugging/internal/vdso_support.cc +194 -0
  410. data/third_party/abseil-cpp/absl/debugging/internal/vdso_support.h +158 -0
  411. data/third_party/abseil-cpp/absl/debugging/stacktrace.cc +140 -0
  412. data/third_party/abseil-cpp/absl/debugging/stacktrace.h +231 -0
  413. data/third_party/abseil-cpp/absl/debugging/symbolize.cc +25 -0
  414. data/third_party/abseil-cpp/absl/debugging/symbolize.h +99 -0
  415. data/third_party/abseil-cpp/absl/debugging/symbolize_elf.inc +1480 -0
  416. data/third_party/abseil-cpp/absl/debugging/symbolize_unimplemented.inc +40 -0
  417. data/third_party/abseil-cpp/absl/debugging/symbolize_win32.inc +81 -0
  418. data/third_party/abseil-cpp/absl/functional/function_ref.h +139 -0
  419. data/third_party/abseil-cpp/absl/functional/internal/function_ref.h +106 -0
  420. data/third_party/abseil-cpp/absl/hash/hash.h +324 -0
  421. data/third_party/abseil-cpp/absl/hash/internal/city.cc +346 -0
  422. data/third_party/abseil-cpp/absl/hash/internal/city.h +96 -0
  423. data/third_party/abseil-cpp/absl/hash/internal/hash.cc +55 -0
  424. data/third_party/abseil-cpp/absl/hash/internal/hash.h +988 -0
  425. data/third_party/abseil-cpp/absl/status/status.cc +447 -0
  426. data/third_party/abseil-cpp/absl/status/status.h +428 -0
  427. data/third_party/abseil-cpp/absl/status/status_payload_printer.cc +43 -0
  428. data/third_party/abseil-cpp/absl/status/status_payload_printer.h +51 -0
  429. data/third_party/abseil-cpp/absl/strings/cord.cc +2019 -0
  430. data/third_party/abseil-cpp/absl/strings/cord.h +1121 -0
  431. data/third_party/abseil-cpp/absl/strings/internal/cord_internal.h +151 -0
  432. data/third_party/abseil-cpp/absl/synchronization/barrier.cc +52 -0
  433. data/third_party/abseil-cpp/absl/synchronization/barrier.h +79 -0
  434. data/third_party/abseil-cpp/absl/synchronization/blocking_counter.cc +57 -0
  435. data/third_party/abseil-cpp/absl/synchronization/blocking_counter.h +99 -0
  436. data/third_party/abseil-cpp/absl/synchronization/internal/create_thread_identity.cc +140 -0
  437. data/third_party/abseil-cpp/absl/synchronization/internal/create_thread_identity.h +60 -0
  438. data/third_party/abseil-cpp/absl/synchronization/internal/graphcycles.cc +697 -0
  439. data/third_party/abseil-cpp/absl/synchronization/internal/graphcycles.h +141 -0
  440. data/third_party/abseil-cpp/absl/synchronization/internal/kernel_timeout.h +155 -0
  441. data/third_party/abseil-cpp/absl/synchronization/internal/mutex_nonprod.inc +261 -0
  442. data/third_party/abseil-cpp/absl/synchronization/internal/per_thread_sem.cc +106 -0
  443. data/third_party/abseil-cpp/absl/synchronization/internal/per_thread_sem.h +115 -0
  444. data/third_party/abseil-cpp/absl/synchronization/internal/waiter.cc +484 -0
  445. data/third_party/abseil-cpp/absl/synchronization/internal/waiter.h +159 -0
  446. data/third_party/abseil-cpp/absl/synchronization/mutex.cc +2728 -0
  447. data/third_party/abseil-cpp/absl/synchronization/mutex.h +1056 -0
  448. data/third_party/abseil-cpp/absl/synchronization/notification.cc +78 -0
  449. data/third_party/abseil-cpp/absl/synchronization/notification.h +123 -0
  450. data/third_party/abseil-cpp/absl/types/bad_variant_access.cc +64 -0
  451. data/third_party/abseil-cpp/absl/types/bad_variant_access.h +82 -0
  452. data/third_party/abseil-cpp/absl/types/internal/variant.h +1646 -0
  453. data/third_party/abseil-cpp/absl/types/variant.h +861 -0
  454. data/third_party/boringssl-with-bazel/err_data.c +266 -254
  455. data/third_party/boringssl-with-bazel/src/crypto/asn1/a_bitstr.c +3 -3
  456. data/third_party/boringssl-with-bazel/src/crypto/asn1/a_enum.c +3 -3
  457. data/third_party/boringssl-with-bazel/src/crypto/asn1/a_int.c +1 -1
  458. data/third_party/boringssl-with-bazel/src/crypto/asn1/a_object.c +3 -3
  459. data/third_party/boringssl-with-bazel/src/crypto/asn1/a_time.c +2 -2
  460. data/third_party/boringssl-with-bazel/src/crypto/asn1/a_type.c +1 -1
  461. data/third_party/boringssl-with-bazel/src/crypto/asn1/asn1_lib.c +1 -1
  462. data/third_party/boringssl-with-bazel/src/crypto/asn1/asn_pack.c +1 -1
  463. data/third_party/boringssl-with-bazel/src/crypto/asn1/f_enum.c +1 -1
  464. data/third_party/boringssl-with-bazel/src/crypto/asn1/f_int.c +1 -1
  465. data/third_party/boringssl-with-bazel/src/crypto/asn1/f_string.c +1 -1
  466. data/third_party/boringssl-with-bazel/src/crypto/cipher_extra/tls_cbc.c +1 -0
  467. data/third_party/boringssl-with-bazel/src/crypto/ec_extra/hash_to_curve.c +12 -52
  468. data/third_party/boringssl-with-bazel/src/crypto/ec_extra/internal.h +0 -22
  469. data/third_party/boringssl-with-bazel/src/crypto/evp/evp_asn1.c +159 -0
  470. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/aes/mode_wrappers.c +17 -1
  471. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/bn/internal.h +11 -1
  472. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/ec/internal.h +2 -1
  473. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/ec/p224-64.c +13 -11
  474. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/ec/p256-x86_64.c +24 -23
  475. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/ec/p256.c +20 -16
  476. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/ec/simple_mul.c +2 -2
  477. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/ec/util.c +3 -3
  478. data/third_party/boringssl-with-bazel/src/crypto/fipsmodule/self_check/self_check.c +62 -0
  479. data/third_party/boringssl-with-bazel/src/crypto/hpke/hpke.c +456 -0
  480. data/third_party/boringssl-with-bazel/src/crypto/hpke/internal.h +192 -0
  481. data/third_party/boringssl-with-bazel/src/crypto/mem.c +29 -15
  482. data/third_party/boringssl-with-bazel/src/crypto/pkcs8/internal.h +7 -0
  483. data/third_party/boringssl-with-bazel/src/crypto/pkcs8/pkcs8_x509.c +36 -5
  484. data/third_party/boringssl-with-bazel/src/crypto/trust_token/internal.h +0 -29
  485. data/third_party/boringssl-with-bazel/src/crypto/trust_token/pmbtoken.c +116 -363
  486. data/third_party/boringssl-with-bazel/src/crypto/trust_token/trust_token.c +7 -45
  487. data/third_party/boringssl-with-bazel/src/crypto/x509/a_strex.c +4 -4
  488. data/third_party/boringssl-with-bazel/src/crypto/x509/algorithm.c +8 -0
  489. data/third_party/boringssl-with-bazel/src/crypto/x509/asn1_gen.c +4 -4
  490. data/third_party/boringssl-with-bazel/src/crypto/x509/x509.c +0 -67
  491. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_cmp.c +13 -6
  492. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_req.c +10 -0
  493. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_set.c +41 -0
  494. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_trs.c +4 -1
  495. data/third_party/boringssl-with-bazel/src/crypto/x509/x509_vfy.c +28 -9
  496. data/third_party/boringssl-with-bazel/src/crypto/x509/x509cset.c +25 -0
  497. data/third_party/boringssl-with-bazel/src/crypto/x509/x_crl.c +35 -13
  498. data/third_party/boringssl-with-bazel/src/crypto/x509/x_pubkey.c +0 -154
  499. data/third_party/boringssl-with-bazel/src/crypto/x509/x_sig.c +20 -0
  500. data/third_party/boringssl-with-bazel/src/crypto/x509/x_x509.c +28 -6
  501. data/third_party/boringssl-with-bazel/src/crypto/x509v3/internal.h +5 -0
  502. data/third_party/boringssl-with-bazel/src/crypto/x509v3/v3_purp.c +74 -35
  503. data/third_party/boringssl-with-bazel/src/include/openssl/aes.h +16 -4
  504. data/third_party/boringssl-with-bazel/src/include/openssl/arm_arch.h +52 -0
  505. data/third_party/boringssl-with-bazel/src/include/openssl/asn1.h +22 -22
  506. data/third_party/boringssl-with-bazel/src/include/openssl/base.h +2 -2
  507. data/third_party/boringssl-with-bazel/src/include/openssl/evp.h +69 -0
  508. data/third_party/boringssl-with-bazel/src/include/openssl/ssl.h +72 -23
  509. data/third_party/boringssl-with-bazel/src/include/openssl/tls1.h +2 -3
  510. data/third_party/boringssl-with-bazel/src/include/openssl/trust_token.h +1 -10
  511. data/third_party/boringssl-with-bazel/src/include/openssl/x509.h +800 -715
  512. data/third_party/boringssl-with-bazel/src/ssl/handoff.cc +3 -3
  513. data/third_party/boringssl-with-bazel/src/ssl/handshake.cc +9 -2
  514. data/third_party/boringssl-with-bazel/src/ssl/handshake_client.cc +2 -2
  515. data/third_party/boringssl-with-bazel/src/ssl/handshake_server.cc +9 -0
  516. data/third_party/boringssl-with-bazel/src/ssl/internal.h +21 -14
  517. data/third_party/boringssl-with-bazel/src/ssl/ssl_asn1.cc +7 -7
  518. data/third_party/boringssl-with-bazel/src/ssl/ssl_cert.cc +3 -6
  519. data/third_party/boringssl-with-bazel/src/ssl/ssl_lib.cc +38 -0
  520. data/third_party/boringssl-with-bazel/src/ssl/ssl_session.cc +4 -24
  521. data/third_party/boringssl-with-bazel/src/ssl/ssl_versions.cc +5 -5
  522. data/third_party/boringssl-with-bazel/src/ssl/t1_enc.cc +45 -24
  523. data/third_party/boringssl-with-bazel/src/ssl/t1_lib.cc +34 -9
  524. data/third_party/boringssl-with-bazel/src/ssl/tls13_client.cc +31 -21
  525. data/third_party/boringssl-with-bazel/src/ssl/tls13_server.cc +17 -9
  526. data/third_party/boringssl-with-bazel/src/ssl/tls_record.cc +5 -3
  527. data/third_party/re2/re2/bitmap256.h +117 -0
  528. data/third_party/re2/re2/bitstate.cc +385 -0
  529. data/third_party/re2/re2/compile.cc +1279 -0
  530. data/third_party/re2/re2/dfa.cc +2130 -0
  531. data/third_party/re2/re2/filtered_re2.cc +121 -0
  532. data/third_party/re2/re2/filtered_re2.h +109 -0
  533. data/third_party/re2/re2/mimics_pcre.cc +197 -0
  534. data/third_party/re2/re2/nfa.cc +713 -0
  535. data/third_party/re2/re2/onepass.cc +623 -0
  536. data/third_party/re2/re2/parse.cc +2464 -0
  537. data/third_party/re2/re2/perl_groups.cc +119 -0
  538. data/third_party/re2/re2/pod_array.h +55 -0
  539. data/third_party/re2/re2/prefilter.cc +710 -0
  540. data/third_party/re2/re2/prefilter.h +108 -0
  541. data/third_party/re2/re2/prefilter_tree.cc +407 -0
  542. data/third_party/re2/re2/prefilter_tree.h +139 -0
  543. data/third_party/re2/re2/prog.cc +988 -0
  544. data/third_party/re2/re2/prog.h +436 -0
  545. data/third_party/re2/re2/re2.cc +1362 -0
  546. data/third_party/re2/re2/re2.h +1002 -0
  547. data/third_party/re2/re2/regexp.cc +980 -0
  548. data/third_party/re2/re2/regexp.h +659 -0
  549. data/third_party/re2/re2/set.cc +154 -0
  550. data/third_party/re2/re2/set.h +80 -0
  551. data/third_party/re2/re2/simplify.cc +657 -0
  552. data/third_party/re2/re2/sparse_array.h +392 -0
  553. data/third_party/re2/re2/sparse_set.h +264 -0
  554. data/third_party/re2/re2/stringpiece.cc +65 -0
  555. data/third_party/re2/re2/stringpiece.h +210 -0
  556. data/third_party/re2/re2/tostring.cc +351 -0
  557. data/third_party/re2/re2/unicode_casefold.cc +582 -0
  558. data/third_party/re2/re2/unicode_casefold.h +78 -0
  559. data/third_party/re2/re2/unicode_groups.cc +6269 -0
  560. data/third_party/re2/re2/unicode_groups.h +67 -0
  561. data/third_party/re2/re2/walker-inl.h +246 -0
  562. data/third_party/re2/util/benchmark.h +156 -0
  563. data/third_party/re2/util/flags.h +26 -0
  564. data/third_party/re2/util/logging.h +109 -0
  565. data/third_party/re2/util/malloc_counter.h +19 -0
  566. data/third_party/re2/util/mix.h +41 -0
  567. data/third_party/re2/util/mutex.h +148 -0
  568. data/third_party/re2/util/pcre.cc +1025 -0
  569. data/third_party/re2/util/pcre.h +681 -0
  570. data/third_party/re2/util/rune.cc +260 -0
  571. data/third_party/re2/util/strutil.cc +149 -0
  572. data/third_party/re2/util/strutil.h +21 -0
  573. data/third_party/re2/util/test.h +50 -0
  574. data/third_party/re2/util/utf.h +44 -0
  575. data/third_party/re2/util/util.h +42 -0
  576. data/third_party/upb/upb/decode.c +517 -505
  577. data/third_party/upb/upb/encode.c +165 -123
  578. data/third_party/upb/upb/msg.c +130 -64
  579. data/third_party/upb/upb/msg.h +418 -14
  580. data/third_party/upb/upb/port_def.inc +35 -6
  581. data/third_party/upb/upb/port_undef.inc +8 -1
  582. data/third_party/upb/upb/table.c +53 -86
  583. data/third_party/upb/upb/table.int.h +11 -52
  584. data/third_party/upb/upb/upb.c +151 -125
  585. data/third_party/upb/upb/upb.h +91 -147
  586. data/third_party/upb/upb/upb.hpp +88 -0
  587. metadata +310 -148
  588. data/src/core/ext/filters/client_channel/xds/xds_api.cc +0 -1906
  589. data/src/core/ext/upb-generated/envoy/api/v2/auth/cert.upb.c +0 -21
  590. data/src/core/ext/upb-generated/envoy/api/v2/auth/cert.upb.h +0 -35
  591. data/src/core/ext/upb-generated/envoy/api/v2/auth/common.upb.c +0 -114
  592. data/src/core/ext/upb-generated/envoy/api/v2/auth/common.upb.h +0 -418
  593. data/src/core/ext/upb-generated/envoy/api/v2/auth/secret.upb.c +0 -72
  594. data/src/core/ext/upb-generated/envoy/api/v2/auth/secret.upb.h +0 -197
  595. data/src/core/ext/upb-generated/envoy/api/v2/auth/tls.upb.c +0 -105
  596. data/src/core/ext/upb-generated/envoy/api/v2/auth/tls.upb.h +0 -378
  597. data/src/core/ext/upb-generated/envoy/api/v2/cds.upb.h +0 -53
  598. data/src/core/ext/upb-generated/envoy/api/v2/cluster.upb.c +0 -403
  599. data/src/core/ext/upb-generated/envoy/api/v2/cluster.upb.h +0 -1447
  600. data/src/core/ext/upb-generated/envoy/api/v2/cluster/circuit_breaker.upb.c +0 -74
  601. data/src/core/ext/upb-generated/envoy/api/v2/cluster/circuit_breaker.upb.h +0 -218
  602. data/src/core/ext/upb-generated/envoy/api/v2/cluster/filter.upb.h +0 -69
  603. data/src/core/ext/upb-generated/envoy/api/v2/cluster/outlier_detection.upb.h +0 -305
  604. data/src/core/ext/upb-generated/envoy/api/v2/core/address.upb.c +0 -112
  605. data/src/core/ext/upb-generated/envoy/api/v2/core/address.upb.h +0 -328
  606. data/src/core/ext/upb-generated/envoy/api/v2/core/backoff.upb.h +0 -78
  607. data/src/core/ext/upb-generated/envoy/api/v2/core/base.upb.c +0 -313
  608. data/src/core/ext/upb-generated/envoy/api/v2/core/base.upb.h +0 -897
  609. data/src/core/ext/upb-generated/envoy/api/v2/core/config_source.upb.c +0 -96
  610. data/src/core/ext/upb-generated/envoy/api/v2/core/config_source.upb.h +0 -322
  611. data/src/core/ext/upb-generated/envoy/api/v2/core/event_service_config.upb.c +0 -34
  612. data/src/core/ext/upb-generated/envoy/api/v2/core/event_service_config.upb.h +0 -72
  613. data/src/core/ext/upb-generated/envoy/api/v2/core/grpc_service.upb.c +0 -197
  614. data/src/core/ext/upb-generated/envoy/api/v2/core/grpc_service.upb.h +0 -642
  615. data/src/core/ext/upb-generated/envoy/api/v2/core/health_check.upb.c +0 -172
  616. data/src/core/ext/upb-generated/envoy/api/v2/core/health_check.upb.h +0 -673
  617. data/src/core/ext/upb-generated/envoy/api/v2/core/http_uri.upb.h +0 -80
  618. data/src/core/ext/upb-generated/envoy/api/v2/core/protocol.upb.c +0 -152
  619. data/src/core/ext/upb-generated/envoy/api/v2/core/protocol.upb.h +0 -518
  620. data/src/core/ext/upb-generated/envoy/api/v2/core/socket_option.upb.h +0 -89
  621. data/src/core/ext/upb-generated/envoy/api/v2/discovery.upb.c +0 -129
  622. data/src/core/ext/upb-generated/envoy/api/v2/discovery.upb.h +0 -392
  623. data/src/core/ext/upb-generated/envoy/api/v2/eds.upb.h +0 -53
  624. data/src/core/ext/upb-generated/envoy/api/v2/endpoint.upb.c +0 -92
  625. data/src/core/ext/upb-generated/envoy/api/v2/endpoint.upb.h +0 -240
  626. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint.upb.c +0 -18
  627. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint.upb.h +0 -33
  628. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint_components.upb.c +0 -91
  629. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/endpoint_components.upb.h +0 -266
  630. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/load_report.upb.c +0 -112
  631. data/src/core/ext/upb-generated/envoy/api/v2/endpoint/load_report.upb.h +0 -324
  632. data/src/core/ext/upb-generated/envoy/api/v2/lds.upb.h +0 -53
  633. data/src/core/ext/upb-generated/envoy/api/v2/listener.upb.c +0 -109
  634. data/src/core/ext/upb-generated/envoy/api/v2/listener.upb.h +0 -399
  635. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener.upb.c +0 -18
  636. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener.upb.h +0 -33
  637. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener_components.upb.c +0 -145
  638. data/src/core/ext/upb-generated/envoy/api/v2/listener/listener_components.upb.h +0 -527
  639. data/src/core/ext/upb-generated/envoy/api/v2/listener/udp_listener_config.upb.c +0 -43
  640. data/src/core/ext/upb-generated/envoy/api/v2/listener/udp_listener_config.upb.h +0 -112
  641. data/src/core/ext/upb-generated/envoy/api/v2/rds.upb.h +0 -53
  642. data/src/core/ext/upb-generated/envoy/api/v2/route.upb.c +0 -63
  643. data/src/core/ext/upb-generated/envoy/api/v2/route.upb.h +0 -199
  644. data/src/core/ext/upb-generated/envoy/api/v2/route/route.upb.c +0 -18
  645. data/src/core/ext/upb-generated/envoy/api/v2/route/route.upb.h +0 -33
  646. data/src/core/ext/upb-generated/envoy/api/v2/route/route_components.upb.c +0 -815
  647. data/src/core/ext/upb-generated/envoy/api/v2/route/route_components.upb.h +0 -3032
  648. data/src/core/ext/upb-generated/envoy/api/v2/scoped_route.upb.c +0 -59
  649. data/src/core/ext/upb-generated/envoy/api/v2/scoped_route.upb.h +0 -134
  650. data/src/core/ext/upb-generated/envoy/api/v2/srds.upb.h +0 -53
  651. data/src/core/ext/upb-generated/envoy/config/filter/accesslog/v2/accesslog.upb.c +0 -228
  652. data/src/core/ext/upb-generated/envoy/config/filter/accesslog/v2/accesslog.upb.h +0 -725
  653. data/src/core/ext/upb-generated/envoy/config/filter/network/http_connection_manager/v2/http_connection_manager.upb.c +0 -316
  654. data/src/core/ext/upb-generated/envoy/config/filter/network/http_connection_manager/v2/http_connection_manager.upb.h +0 -1132
  655. data/src/core/ext/upb-generated/envoy/config/listener/v2/api_listener.upb.h +0 -65
  656. data/src/core/ext/upb-generated/envoy/config/trace/v2/http_tracer.upb.c +0 -51
  657. data/src/core/ext/upb-generated/envoy/config/trace/v2/http_tracer.upb.h +0 -125
  658. data/src/core/ext/upb-generated/envoy/service/discovery/v2/ads.upb.h +0 -50
  659. data/src/core/ext/upb-generated/envoy/service/load_stats/v2/lrs.upb.c +0 -54
  660. data/src/core/ext/upb-generated/envoy/service/load_stats/v2/lrs.upb.h +0 -134
  661. data/src/core/ext/upb-generated/envoy/type/matcher/regex.upb.c +0 -63
  662. data/src/core/ext/upb-generated/envoy/type/matcher/regex.upb.h +0 -144
  663. data/src/core/ext/upb-generated/envoy/type/matcher/string.upb.c +0 -53
  664. data/src/core/ext/upb-generated/envoy/type/matcher/string.upb.h +0 -133
  665. data/src/core/ext/upb-generated/envoy/type/metadata/v2/metadata.upb.c +0 -88
  666. data/src/core/ext/upb-generated/envoy/type/metadata/v2/metadata.upb.h +0 -258
  667. data/src/core/ext/upb-generated/envoy/type/percent.upb.h +0 -87
  668. data/src/core/ext/upb-generated/envoy/type/range.upb.h +0 -112
  669. data/src/core/ext/upb-generated/envoy/type/semantic_version.upb.h +0 -62
  670. data/src/core/ext/upb-generated/envoy/type/tracing/v2/custom_tag.upb.c +0 -89
  671. data/src/core/ext/upb-generated/envoy/type/tracing/v2/custom_tag.upb.h +0 -249
  672. data/src/core/lib/security/transport/target_authority_table.cc +0 -75
  673. data/src/core/lib/security/transport/target_authority_table.h +0 -40
  674. data/src/core/lib/slice/slice_hash_table.h +0 -199
  675. data/src/core/lib/slice/slice_weak_hash_table.h +0 -102
  676. data/third_party/upb/upb/generated_util.h +0 -105
@@ -0,0 +1,121 @@
1
+ // Copyright 2009 The RE2 Authors. All Rights Reserved.
2
+ // Use of this source code is governed by a BSD-style
3
+ // license that can be found in the LICENSE file.
4
+
5
+ #include "re2/filtered_re2.h"
6
+
7
+ #include <stddef.h>
8
+ #include <string>
9
+
10
+ #include "util/util.h"
11
+ #include "util/logging.h"
12
+ #include "re2/prefilter.h"
13
+ #include "re2/prefilter_tree.h"
14
+
15
+ namespace re2 {
16
+
17
+ FilteredRE2::FilteredRE2()
18
+ : compiled_(false),
19
+ prefilter_tree_(new PrefilterTree()) {
20
+ }
21
+
22
+ FilteredRE2::FilteredRE2(int min_atom_len)
23
+ : compiled_(false),
24
+ prefilter_tree_(new PrefilterTree(min_atom_len)) {
25
+ }
26
+
27
+ FilteredRE2::~FilteredRE2() {
28
+ for (size_t i = 0; i < re2_vec_.size(); i++)
29
+ delete re2_vec_[i];
30
+ delete prefilter_tree_;
31
+ }
32
+
33
+ RE2::ErrorCode FilteredRE2::Add(const StringPiece& pattern,
34
+ const RE2::Options& options, int* id) {
35
+ RE2* re = new RE2(pattern, options);
36
+ RE2::ErrorCode code = re->error_code();
37
+
38
+ if (!re->ok()) {
39
+ if (options.log_errors()) {
40
+ LOG(ERROR) << "Couldn't compile regular expression, skipping: "
41
+ << re << " due to error " << re->error();
42
+ }
43
+ delete re;
44
+ } else {
45
+ *id = static_cast<int>(re2_vec_.size());
46
+ re2_vec_.push_back(re);
47
+ }
48
+
49
+ return code;
50
+ }
51
+
52
+ void FilteredRE2::Compile(std::vector<std::string>* atoms) {
53
+ if (compiled_) {
54
+ LOG(ERROR) << "Compile called already.";
55
+ return;
56
+ }
57
+
58
+ if (re2_vec_.empty()) {
59
+ LOG(ERROR) << "Compile called before Add.";
60
+ return;
61
+ }
62
+
63
+ for (size_t i = 0; i < re2_vec_.size(); i++) {
64
+ Prefilter* prefilter = Prefilter::FromRE2(re2_vec_[i]);
65
+ prefilter_tree_->Add(prefilter);
66
+ }
67
+ atoms->clear();
68
+ prefilter_tree_->Compile(atoms);
69
+ compiled_ = true;
70
+ }
71
+
72
+ int FilteredRE2::SlowFirstMatch(const StringPiece& text) const {
73
+ for (size_t i = 0; i < re2_vec_.size(); i++)
74
+ if (RE2::PartialMatch(text, *re2_vec_[i]))
75
+ return static_cast<int>(i);
76
+ return -1;
77
+ }
78
+
79
+ int FilteredRE2::FirstMatch(const StringPiece& text,
80
+ const std::vector<int>& atoms) const {
81
+ if (!compiled_) {
82
+ LOG(DFATAL) << "FirstMatch called before Compile.";
83
+ return -1;
84
+ }
85
+ std::vector<int> regexps;
86
+ prefilter_tree_->RegexpsGivenStrings(atoms, &regexps);
87
+ for (size_t i = 0; i < regexps.size(); i++)
88
+ if (RE2::PartialMatch(text, *re2_vec_[regexps[i]]))
89
+ return regexps[i];
90
+ return -1;
91
+ }
92
+
93
+ bool FilteredRE2::AllMatches(
94
+ const StringPiece& text,
95
+ const std::vector<int>& atoms,
96
+ std::vector<int>* matching_regexps) const {
97
+ matching_regexps->clear();
98
+ std::vector<int> regexps;
99
+ prefilter_tree_->RegexpsGivenStrings(atoms, &regexps);
100
+ for (size_t i = 0; i < regexps.size(); i++)
101
+ if (RE2::PartialMatch(text, *re2_vec_[regexps[i]]))
102
+ matching_regexps->push_back(regexps[i]);
103
+ return !matching_regexps->empty();
104
+ }
105
+
106
+ void FilteredRE2::AllPotentials(
107
+ const std::vector<int>& atoms,
108
+ std::vector<int>* potential_regexps) const {
109
+ prefilter_tree_->RegexpsGivenStrings(atoms, potential_regexps);
110
+ }
111
+
112
+ void FilteredRE2::RegexpsGivenStrings(const std::vector<int>& matched_atoms,
113
+ std::vector<int>* passed_regexps) {
114
+ prefilter_tree_->RegexpsGivenStrings(matched_atoms, passed_regexps);
115
+ }
116
+
117
+ void FilteredRE2::PrintPrefilter(int regexpid) {
118
+ prefilter_tree_->PrintPrefilter(regexpid);
119
+ }
120
+
121
+ } // namespace re2
@@ -0,0 +1,109 @@
1
+ // Copyright 2009 The RE2 Authors. All Rights Reserved.
2
+ // Use of this source code is governed by a BSD-style
3
+ // license that can be found in the LICENSE file.
4
+
5
+ #ifndef RE2_FILTERED_RE2_H_
6
+ #define RE2_FILTERED_RE2_H_
7
+
8
+ // The class FilteredRE2 is used as a wrapper to multiple RE2 regexps.
9
+ // It provides a prefilter mechanism that helps in cutting down the
10
+ // number of regexps that need to be actually searched.
11
+ //
12
+ // By design, it does not include a string matching engine. This is to
13
+ // allow the user of the class to use their favorite string matching
14
+ // engine. The overall flow is: Add all the regexps using Add, then
15
+ // Compile the FilteredRE2. Compile returns strings that need to be
16
+ // matched. Note that the returned strings are lowercased and distinct.
17
+ // For applying regexps to a search text, the caller does the string
18
+ // matching using the returned strings. When doing the string match,
19
+ // note that the caller has to do that in a case-insensitive way or
20
+ // on a lowercased version of the search text. Then call FirstMatch
21
+ // or AllMatches with a vector of indices of strings that were found
22
+ // in the text to get the actual regexp matches.
23
+
24
+ #include <string>
25
+ #include <vector>
26
+
27
+ #include "re2/re2.h"
28
+
29
+ namespace re2 {
30
+
31
+ class PrefilterTree;
32
+
33
+ class FilteredRE2 {
34
+ public:
35
+ FilteredRE2();
36
+ explicit FilteredRE2(int min_atom_len);
37
+ ~FilteredRE2();
38
+
39
+ // Uses RE2 constructor to create a RE2 object (re). Returns
40
+ // re->error_code(). If error_code is other than NoError, then re is
41
+ // deleted and not added to re2_vec_.
42
+ RE2::ErrorCode Add(const StringPiece& pattern,
43
+ const RE2::Options& options,
44
+ int *id);
45
+
46
+ // Prepares the regexps added by Add for filtering. Returns a set
47
+ // of strings that the caller should check for in candidate texts.
48
+ // The returned strings are lowercased and distinct. When doing
49
+ // string matching, it should be performed in a case-insensitive
50
+ // way or the search text should be lowercased first. Call after
51
+ // all Add calls are done.
52
+ void Compile(std::vector<std::string>* strings_to_match);
53
+
54
+ // Returns the index of the first matching regexp.
55
+ // Returns -1 on no match. Can be called prior to Compile.
56
+ // Does not do any filtering: simply tries to Match the
57
+ // regexps in a loop.
58
+ int SlowFirstMatch(const StringPiece& text) const;
59
+
60
+ // Returns the index of the first matching regexp.
61
+ // Returns -1 on no match. Compile has to be called before
62
+ // calling this.
63
+ int FirstMatch(const StringPiece& text,
64
+ const std::vector<int>& atoms) const;
65
+
66
+ // Returns the indices of all matching regexps, after first clearing
67
+ // matched_regexps.
68
+ bool AllMatches(const StringPiece& text,
69
+ const std::vector<int>& atoms,
70
+ std::vector<int>* matching_regexps) const;
71
+
72
+ // Returns the indices of all potentially matching regexps after first
73
+ // clearing potential_regexps.
74
+ // A regexp is potentially matching if it passes the filter.
75
+ // If a regexp passes the filter it may still not match.
76
+ // A regexp that does not pass the filter is guaranteed to not match.
77
+ void AllPotentials(const std::vector<int>& atoms,
78
+ std::vector<int>* potential_regexps) const;
79
+
80
+ // The number of regexps added.
81
+ int NumRegexps() const { return static_cast<int>(re2_vec_.size()); }
82
+
83
+ // Get the individual RE2 objects.
84
+ const RE2& GetRE2(int regexpid) const { return *re2_vec_[regexpid]; }
85
+
86
+ private:
87
+ // Print prefilter.
88
+ void PrintPrefilter(int regexpid);
89
+
90
+ // Useful for testing and debugging.
91
+ void RegexpsGivenStrings(const std::vector<int>& matched_atoms,
92
+ std::vector<int>* passed_regexps);
93
+
94
+ // All the regexps in the FilteredRE2.
95
+ std::vector<RE2*> re2_vec_;
96
+
97
+ // Has the FilteredRE2 been compiled using Compile()
98
+ bool compiled_;
99
+
100
+ // An AND-OR tree of string atoms used for filtering regexps.
101
+ PrefilterTree* prefilter_tree_;
102
+
103
+ FilteredRE2(const FilteredRE2&) = delete;
104
+ FilteredRE2& operator=(const FilteredRE2&) = delete;
105
+ };
106
+
107
+ } // namespace re2
108
+
109
+ #endif // RE2_FILTERED_RE2_H_
@@ -0,0 +1,197 @@
1
+ // Copyright 2008 The RE2 Authors. All Rights Reserved.
2
+ // Use of this source code is governed by a BSD-style
3
+ // license that can be found in the LICENSE file.
4
+
5
+ // Determine whether this library should match PCRE exactly
6
+ // for a particular Regexp. (If so, the testing framework can
7
+ // check that it does.)
8
+ //
9
+ // This library matches PCRE except in these cases:
10
+ // * the regexp contains a repetition of an empty string,
11
+ // like (a*)* or (a*)+. In this case, PCRE will treat
12
+ // the repetition sequence as ending with an empty string,
13
+ // while this library does not.
14
+ // * Perl and PCRE differ on whether \v matches \n.
15
+ // For historical reasons, this library implements the Perl behavior.
16
+ // * Perl and PCRE allow $ in one-line mode to match either the very
17
+ // end of the text or just before a \n at the end of the text.
18
+ // This library requires it to match only the end of the text.
19
+ // * Similarly, Perl and PCRE do not allow ^ in multi-line mode to
20
+ // match the end of the text if the last character is a \n.
21
+ // This library does allow it.
22
+ //
23
+ // Regexp::MimicsPCRE checks for any of these conditions.
24
+
25
+ #include "util/util.h"
26
+ #include "util/logging.h"
27
+ #include "re2/regexp.h"
28
+ #include "re2/walker-inl.h"
29
+
30
+ namespace re2 {
31
+
32
+ // Returns whether re might match an empty string.
33
+ static bool CanBeEmptyString(Regexp *re);
34
+
35
+ // Walker class to compute whether library handles a regexp
36
+ // exactly as PCRE would. See comment at top for conditions.
37
+
38
+ class PCREWalker : public Regexp::Walker<bool> {
39
+ public:
40
+ PCREWalker() {}
41
+
42
+ virtual bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
43
+ bool* child_args, int nchild_args);
44
+
45
+ virtual bool ShortVisit(Regexp* re, bool a) {
46
+ // Should never be called: we use Walk(), not WalkExponential().
47
+ #ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
48
+ LOG(DFATAL) << "PCREWalker::ShortVisit called";
49
+ #endif
50
+ return a;
51
+ }
52
+
53
+ private:
54
+ PCREWalker(const PCREWalker&) = delete;
55
+ PCREWalker& operator=(const PCREWalker&) = delete;
56
+ };
57
+
58
+ // Called after visiting each of re's children and accumulating
59
+ // the return values in child_args. So child_args contains whether
60
+ // this library mimics PCRE for those subexpressions.
61
+ bool PCREWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
62
+ bool* child_args, int nchild_args) {
63
+ // If children failed, so do we.
64
+ for (int i = 0; i < nchild_args; i++)
65
+ if (!child_args[i])
66
+ return false;
67
+
68
+ // Otherwise look for other reasons to fail.
69
+ switch (re->op()) {
70
+ // Look for repeated empty string.
71
+ case kRegexpStar:
72
+ case kRegexpPlus:
73
+ case kRegexpQuest:
74
+ if (CanBeEmptyString(re->sub()[0]))
75
+ return false;
76
+ break;
77
+ case kRegexpRepeat:
78
+ if (re->max() == -1 && CanBeEmptyString(re->sub()[0]))
79
+ return false;
80
+ break;
81
+
82
+ // Look for \v
83
+ case kRegexpLiteral:
84
+ if (re->rune() == '\v')
85
+ return false;
86
+ break;
87
+
88
+ // Look for $ in single-line mode.
89
+ case kRegexpEndText:
90
+ case kRegexpEmptyMatch:
91
+ if (re->parse_flags() & Regexp::WasDollar)
92
+ return false;
93
+ break;
94
+
95
+ // Look for ^ in multi-line mode.
96
+ case kRegexpBeginLine:
97
+ // No condition: in single-line mode ^ becomes kRegexpBeginText.
98
+ return false;
99
+
100
+ default:
101
+ break;
102
+ }
103
+
104
+ // Not proven guilty.
105
+ return true;
106
+ }
107
+
108
+ // Returns whether this regexp's behavior will mimic PCRE's exactly.
109
+ bool Regexp::MimicsPCRE() {
110
+ PCREWalker w;
111
+ return w.Walk(this, true);
112
+ }
113
+
114
+
115
+ // Walker class to compute whether a Regexp can match an empty string.
116
+ // It is okay to overestimate. For example, \b\B cannot match an empty
117
+ // string, because \b and \B are mutually exclusive, but this isn't
118
+ // that smart and will say it can. Spurious empty strings
119
+ // will reduce the number of regexps we sanity check against PCRE,
120
+ // but they won't break anything.
121
+
122
+ class EmptyStringWalker : public Regexp::Walker<bool> {
123
+ public:
124
+ EmptyStringWalker() {}
125
+
126
+ virtual bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
127
+ bool* child_args, int nchild_args);
128
+
129
+ virtual bool ShortVisit(Regexp* re, bool a) {
130
+ // Should never be called: we use Walk(), not WalkExponential().
131
+ #ifndef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
132
+ LOG(DFATAL) << "EmptyStringWalker::ShortVisit called";
133
+ #endif
134
+ return a;
135
+ }
136
+
137
+ private:
138
+ EmptyStringWalker(const EmptyStringWalker&) = delete;
139
+ EmptyStringWalker& operator=(const EmptyStringWalker&) = delete;
140
+ };
141
+
142
+ // Called after visiting re's children. child_args contains the return
143
+ // value from each of the children's PostVisits (i.e., whether each child
144
+ // can match an empty string). Returns whether this clause can match an
145
+ // empty string.
146
+ bool EmptyStringWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
147
+ bool* child_args, int nchild_args) {
148
+ switch (re->op()) {
149
+ case kRegexpNoMatch: // never empty
150
+ case kRegexpLiteral:
151
+ case kRegexpAnyChar:
152
+ case kRegexpAnyByte:
153
+ case kRegexpCharClass:
154
+ case kRegexpLiteralString:
155
+ return false;
156
+
157
+ case kRegexpEmptyMatch: // always empty
158
+ case kRegexpBeginLine: // always empty, when they match
159
+ case kRegexpEndLine:
160
+ case kRegexpNoWordBoundary:
161
+ case kRegexpWordBoundary:
162
+ case kRegexpBeginText:
163
+ case kRegexpEndText:
164
+ case kRegexpStar: // can always be empty
165
+ case kRegexpQuest:
166
+ case kRegexpHaveMatch:
167
+ return true;
168
+
169
+ case kRegexpConcat: // can be empty if all children can
170
+ for (int i = 0; i < nchild_args; i++)
171
+ if (!child_args[i])
172
+ return false;
173
+ return true;
174
+
175
+ case kRegexpAlternate: // can be empty if any child can
176
+ for (int i = 0; i < nchild_args; i++)
177
+ if (child_args[i])
178
+ return true;
179
+ return false;
180
+
181
+ case kRegexpPlus: // can be empty if the child can
182
+ case kRegexpCapture:
183
+ return child_args[0];
184
+
185
+ case kRegexpRepeat: // can be empty if child can or is x{0}
186
+ return child_args[0] || re->min() == 0;
187
+ }
188
+ return false;
189
+ }
190
+
191
+ // Returns whether re can match an empty string.
192
+ static bool CanBeEmptyString(Regexp* re) {
193
+ EmptyStringWalker w;
194
+ return w.Walk(re, true);
195
+ }
196
+
197
+ } // namespace re2
@@ -0,0 +1,713 @@
1
+ // Copyright 2006-2007 The RE2 Authors. All Rights Reserved.
2
+ // Use of this source code is governed by a BSD-style
3
+ // license that can be found in the LICENSE file.
4
+
5
+ // Tested by search_test.cc.
6
+ //
7
+ // Prog::SearchNFA, an NFA search.
8
+ // This is an actual NFA like the theorists talk about,
9
+ // not the pseudo-NFA found in backtracking regexp implementations.
10
+ //
11
+ // IMPLEMENTATION
12
+ //
13
+ // This algorithm is a variant of one that appeared in Rob Pike's sam editor,
14
+ // which is a variant of the one described in Thompson's 1968 CACM paper.
15
+ // See http://swtch.com/~rsc/regexp/ for various history. The main feature
16
+ // over the DFA implementation is that it tracks submatch boundaries.
17
+ //
18
+ // When the choice of submatch boundaries is ambiguous, this particular
19
+ // implementation makes the same choices that traditional backtracking
20
+ // implementations (in particular, Perl and PCRE) do.
21
+ // Note that unlike in Perl and PCRE, this algorithm *cannot* take exponential
22
+ // time in the length of the input.
23
+ //
24
+ // Like Thompson's original machine and like the DFA implementation, this
25
+ // implementation notices a match only once it is one byte past it.
26
+
27
+ #include <stdio.h>
28
+ #include <string.h>
29
+ #include <algorithm>
30
+ #include <deque>
31
+ #include <string>
32
+ #include <utility>
33
+ #include <vector>
34
+
35
+ #include "util/logging.h"
36
+ #include "util/strutil.h"
37
+ #include "re2/pod_array.h"
38
+ #include "re2/prog.h"
39
+ #include "re2/regexp.h"
40
+ #include "re2/sparse_array.h"
41
+ #include "re2/sparse_set.h"
42
+
43
+ namespace re2 {
44
+
45
+ static const bool ExtraDebug = false;
46
+
47
+ class NFA {
48
+ public:
49
+ NFA(Prog* prog);
50
+ ~NFA();
51
+
52
+ // Searches for a matching string.
53
+ // * If anchored is true, only considers matches starting at offset.
54
+ // Otherwise finds lefmost match at or after offset.
55
+ // * If longest is true, returns the longest match starting
56
+ // at the chosen start point. Otherwise returns the so-called
57
+ // left-biased match, the one traditional backtracking engines
58
+ // (like Perl and PCRE) find.
59
+ // Records submatch boundaries in submatch[1..nsubmatch-1].
60
+ // Submatch[0] is the entire match. When there is a choice in
61
+ // which text matches each subexpression, the submatch boundaries
62
+ // are chosen to match what a backtracking implementation would choose.
63
+ bool Search(const StringPiece& text, const StringPiece& context,
64
+ bool anchored, bool longest,
65
+ StringPiece* submatch, int nsubmatch);
66
+
67
+ private:
68
+ struct Thread {
69
+ union {
70
+ int ref;
71
+ Thread* next; // when on free list
72
+ };
73
+ const char** capture;
74
+ };
75
+
76
+ // State for explicit stack in AddToThreadq.
77
+ struct AddState {
78
+ int id; // Inst to process
79
+ Thread* t; // if not null, set t0 = t before processing id
80
+ };
81
+
82
+ // Threadq is a list of threads. The list is sorted by the order
83
+ // in which Perl would explore that particular state -- the earlier
84
+ // choices appear earlier in the list.
85
+ typedef SparseArray<Thread*> Threadq;
86
+
87
+ inline Thread* AllocThread();
88
+ inline Thread* Incref(Thread* t);
89
+ inline void Decref(Thread* t);
90
+
91
+ // Follows all empty arrows from id0 and enqueues all the states reached.
92
+ // Enqueues only the ByteRange instructions that match byte c.
93
+ // context is used (with p) for evaluating empty-width specials.
94
+ // p is the current input position, and t0 is the current thread.
95
+ void AddToThreadq(Threadq* q, int id0, int c, const StringPiece& context,
96
+ const char* p, Thread* t0);
97
+
98
+ // Run runq on byte c, appending new states to nextq.
99
+ // Updates matched_ and match_ as new, better matches are found.
100
+ // context is used (with p) for evaluating empty-width specials.
101
+ // p is the position of byte c in the input string for AddToThreadq;
102
+ // p-1 will be used when processing Match instructions.
103
+ // Frees all the threads on runq.
104
+ // If there is a shortcut to the end, returns that shortcut.
105
+ int Step(Threadq* runq, Threadq* nextq, int c, const StringPiece& context,
106
+ const char* p);
107
+
108
+ // Returns text version of capture information, for debugging.
109
+ std::string FormatCapture(const char** capture);
110
+
111
+ void CopyCapture(const char** dst, const char** src) {
112
+ memmove(dst, src, ncapture_*sizeof src[0]);
113
+ }
114
+
115
+ Prog* prog_; // underlying program
116
+ int start_; // start instruction in program
117
+ int ncapture_; // number of submatches to track
118
+ bool longest_; // whether searching for longest match
119
+ bool endmatch_; // whether match must end at text.end()
120
+ const char* btext_; // beginning of text (for FormatSubmatch)
121
+ const char* etext_; // end of text (for endmatch_)
122
+ Threadq q0_, q1_; // pre-allocated for Search.
123
+ PODArray<AddState> stack_; // pre-allocated for AddToThreadq
124
+ std::deque<Thread> arena_; // thread arena
125
+ Thread* freelist_; // thread freelist
126
+ const char** match_; // best match so far
127
+ bool matched_; // any match so far?
128
+
129
+ NFA(const NFA&) = delete;
130
+ NFA& operator=(const NFA&) = delete;
131
+ };
132
+
133
+ NFA::NFA(Prog* prog) {
134
+ prog_ = prog;
135
+ start_ = prog_->start();
136
+ ncapture_ = 0;
137
+ longest_ = false;
138
+ endmatch_ = false;
139
+ btext_ = NULL;
140
+ etext_ = NULL;
141
+ q0_.resize(prog_->size());
142
+ q1_.resize(prog_->size());
143
+ // See NFA::AddToThreadq() for why this is so.
144
+ int nstack = 2*prog_->inst_count(kInstCapture) +
145
+ prog_->inst_count(kInstEmptyWidth) +
146
+ prog_->inst_count(kInstNop) + 1; // + 1 for start inst
147
+ stack_ = PODArray<AddState>(nstack);
148
+ freelist_ = NULL;
149
+ match_ = NULL;
150
+ matched_ = false;
151
+ }
152
+
153
+ NFA::~NFA() {
154
+ delete[] match_;
155
+ for (const Thread& t : arena_)
156
+ delete[] t.capture;
157
+ }
158
+
159
+ NFA::Thread* NFA::AllocThread() {
160
+ Thread* t = freelist_;
161
+ if (t != NULL) {
162
+ freelist_ = t->next;
163
+ t->ref = 1;
164
+ // We don't need to touch t->capture because
165
+ // the caller will immediately overwrite it.
166
+ return t;
167
+ }
168
+ arena_.emplace_back();
169
+ t = &arena_.back();
170
+ t->ref = 1;
171
+ t->capture = new const char*[ncapture_];
172
+ return t;
173
+ }
174
+
175
+ NFA::Thread* NFA::Incref(Thread* t) {
176
+ DCHECK(t != NULL);
177
+ t->ref++;
178
+ return t;
179
+ }
180
+
181
+ void NFA::Decref(Thread* t) {
182
+ DCHECK(t != NULL);
183
+ t->ref--;
184
+ if (t->ref > 0)
185
+ return;
186
+ DCHECK_EQ(t->ref, 0);
187
+ t->next = freelist_;
188
+ freelist_ = t;
189
+ }
190
+
191
+ // Follows all empty arrows from id0 and enqueues all the states reached.
192
+ // Enqueues only the ByteRange instructions that match byte c.
193
+ // context is used (with p) for evaluating empty-width specials.
194
+ // p is the current input position, and t0 is the current thread.
195
+ void NFA::AddToThreadq(Threadq* q, int id0, int c, const StringPiece& context,
196
+ const char* p, Thread* t0) {
197
+ if (id0 == 0)
198
+ return;
199
+
200
+ // Use stack_ to hold our stack of instructions yet to process.
201
+ // It was preallocated as follows:
202
+ // two entries per Capture;
203
+ // one entry per EmptyWidth; and
204
+ // one entry per Nop.
205
+ // This reflects the maximum number of stack pushes that each can
206
+ // perform. (Each instruction can be processed at most once.)
207
+ AddState* stk = stack_.data();
208
+ int nstk = 0;
209
+
210
+ stk[nstk++] = {id0, NULL};
211
+ while (nstk > 0) {
212
+ DCHECK_LE(nstk, stack_.size());
213
+ AddState a = stk[--nstk];
214
+
215
+ Loop:
216
+ if (a.t != NULL) {
217
+ // t0 was a thread that we allocated and copied in order to
218
+ // record the capture, so we must now decref it.
219
+ Decref(t0);
220
+ t0 = a.t;
221
+ }
222
+
223
+ int id = a.id;
224
+ if (id == 0)
225
+ continue;
226
+ if (q->has_index(id)) {
227
+ if (ExtraDebug)
228
+ fprintf(stderr, " [%d%s]\n", id, FormatCapture(t0->capture).c_str());
229
+ continue;
230
+ }
231
+
232
+ // Create entry in q no matter what. We might fill it in below,
233
+ // or we might not. Even if not, it is necessary to have it,
234
+ // so that we don't revisit id0 during the recursion.
235
+ q->set_new(id, NULL);
236
+ Thread** tp = &q->get_existing(id);
237
+ int j;
238
+ Thread* t;
239
+ Prog::Inst* ip = prog_->inst(id);
240
+ switch (ip->opcode()) {
241
+ default:
242
+ LOG(DFATAL) << "unhandled " << ip->opcode() << " in AddToThreadq";
243
+ break;
244
+
245
+ case kInstFail:
246
+ break;
247
+
248
+ case kInstAltMatch:
249
+ // Save state; will pick up at next byte.
250
+ t = Incref(t0);
251
+ *tp = t;
252
+
253
+ DCHECK(!ip->last());
254
+ a = {id+1, NULL};
255
+ goto Loop;
256
+
257
+ case kInstNop:
258
+ if (!ip->last())
259
+ stk[nstk++] = {id+1, NULL};
260
+
261
+ // Continue on.
262
+ a = {ip->out(), NULL};
263
+ goto Loop;
264
+
265
+ case kInstCapture:
266
+ if (!ip->last())
267
+ stk[nstk++] = {id+1, NULL};
268
+
269
+ if ((j=ip->cap()) < ncapture_) {
270
+ // Push a dummy whose only job is to restore t0
271
+ // once we finish exploring this possibility.
272
+ stk[nstk++] = {0, t0};
273
+
274
+ // Record capture.
275
+ t = AllocThread();
276
+ CopyCapture(t->capture, t0->capture);
277
+ t->capture[j] = p;
278
+ t0 = t;
279
+ }
280
+ a = {ip->out(), NULL};
281
+ goto Loop;
282
+
283
+ case kInstByteRange:
284
+ if (!ip->Matches(c))
285
+ goto Next;
286
+
287
+ // Save state; will pick up at next byte.
288
+ t = Incref(t0);
289
+ *tp = t;
290
+ if (ExtraDebug)
291
+ fprintf(stderr, " + %d%s\n", id, FormatCapture(t0->capture).c_str());
292
+
293
+ if (ip->hint() == 0)
294
+ break;
295
+ a = {id+ip->hint(), NULL};
296
+ goto Loop;
297
+
298
+ case kInstMatch:
299
+ // Save state; will pick up at next byte.
300
+ t = Incref(t0);
301
+ *tp = t;
302
+ if (ExtraDebug)
303
+ fprintf(stderr, " ! %d%s\n", id, FormatCapture(t0->capture).c_str());
304
+
305
+ Next:
306
+ if (ip->last())
307
+ break;
308
+ a = {id+1, NULL};
309
+ goto Loop;
310
+
311
+ case kInstEmptyWidth:
312
+ if (!ip->last())
313
+ stk[nstk++] = {id+1, NULL};
314
+
315
+ // Continue on if we have all the right flag bits.
316
+ if (ip->empty() & ~Prog::EmptyFlags(context, p))
317
+ break;
318
+ a = {ip->out(), NULL};
319
+ goto Loop;
320
+ }
321
+ }
322
+ }
323
+
324
+ // Run runq on byte c, appending new states to nextq.
325
+ // Updates matched_ and match_ as new, better matches are found.
326
+ // context is used (with p) for evaluating empty-width specials.
327
+ // p is the position of byte c in the input string for AddToThreadq;
328
+ // p-1 will be used when processing Match instructions.
329
+ // Frees all the threads on runq.
330
+ // If there is a shortcut to the end, returns that shortcut.
331
+ int NFA::Step(Threadq* runq, Threadq* nextq, int c, const StringPiece& context,
332
+ const char* p) {
333
+ nextq->clear();
334
+
335
+ for (Threadq::iterator i = runq->begin(); i != runq->end(); ++i) {
336
+ Thread* t = i->value();
337
+ if (t == NULL)
338
+ continue;
339
+
340
+ if (longest_) {
341
+ // Can skip any threads started after our current best match.
342
+ if (matched_ && match_[0] < t->capture[0]) {
343
+ Decref(t);
344
+ continue;
345
+ }
346
+ }
347
+
348
+ int id = i->index();
349
+ Prog::Inst* ip = prog_->inst(id);
350
+
351
+ switch (ip->opcode()) {
352
+ default:
353
+ // Should only see the values handled below.
354
+ LOG(DFATAL) << "Unhandled " << ip->opcode() << " in step";
355
+ break;
356
+
357
+ case kInstByteRange:
358
+ AddToThreadq(nextq, ip->out(), c, context, p, t);
359
+ break;
360
+
361
+ case kInstAltMatch:
362
+ if (i != runq->begin())
363
+ break;
364
+ // The match is ours if we want it.
365
+ if (ip->greedy(prog_) || longest_) {
366
+ CopyCapture(match_, t->capture);
367
+ matched_ = true;
368
+
369
+ Decref(t);
370
+ for (++i; i != runq->end(); ++i) {
371
+ if (i->value() != NULL)
372
+ Decref(i->value());
373
+ }
374
+ runq->clear();
375
+ if (ip->greedy(prog_))
376
+ return ip->out1();
377
+ return ip->out();
378
+ }
379
+ break;
380
+
381
+ case kInstMatch: {
382
+ // Avoid invoking undefined behavior (arithmetic on a null pointer)
383
+ // by storing p instead of p-1. (What would the latter even mean?!)
384
+ // This complements the special case in NFA::Search().
385
+ if (p == NULL) {
386
+ CopyCapture(match_, t->capture);
387
+ match_[1] = p;
388
+ matched_ = true;
389
+ break;
390
+ }
391
+
392
+ if (endmatch_ && p-1 != etext_)
393
+ break;
394
+
395
+ if (longest_) {
396
+ // Leftmost-longest mode: save this match only if
397
+ // it is either farther to the left or at the same
398
+ // point but longer than an existing match.
399
+ if (!matched_ || t->capture[0] < match_[0] ||
400
+ (t->capture[0] == match_[0] && p-1 > match_[1])) {
401
+ CopyCapture(match_, t->capture);
402
+ match_[1] = p-1;
403
+ matched_ = true;
404
+ }
405
+ } else {
406
+ // Leftmost-biased mode: this match is by definition
407
+ // better than what we've already found (see next line).
408
+ CopyCapture(match_, t->capture);
409
+ match_[1] = p-1;
410
+ matched_ = true;
411
+
412
+ // Cut off the threads that can only find matches
413
+ // worse than the one we just found: don't run the
414
+ // rest of the current Threadq.
415
+ Decref(t);
416
+ for (++i; i != runq->end(); ++i) {
417
+ if (i->value() != NULL)
418
+ Decref(i->value());
419
+ }
420
+ runq->clear();
421
+ return 0;
422
+ }
423
+ break;
424
+ }
425
+ }
426
+ Decref(t);
427
+ }
428
+ runq->clear();
429
+ return 0;
430
+ }
431
+
432
+ std::string NFA::FormatCapture(const char** capture) {
433
+ std::string s;
434
+ for (int i = 0; i < ncapture_; i+=2) {
435
+ if (capture[i] == NULL)
436
+ s += "(?,?)";
437
+ else if (capture[i+1] == NULL)
438
+ s += StringPrintf("(%td,?)",
439
+ capture[i] - btext_);
440
+ else
441
+ s += StringPrintf("(%td,%td)",
442
+ capture[i] - btext_,
443
+ capture[i+1] - btext_);
444
+ }
445
+ return s;
446
+ }
447
+
448
+ bool NFA::Search(const StringPiece& text, const StringPiece& const_context,
449
+ bool anchored, bool longest,
450
+ StringPiece* submatch, int nsubmatch) {
451
+ if (start_ == 0)
452
+ return false;
453
+
454
+ StringPiece context = const_context;
455
+ if (context.data() == NULL)
456
+ context = text;
457
+
458
+ // Sanity check: make sure that text lies within context.
459
+ if (text.begin() < context.begin() || text.end() > context.end()) {
460
+ LOG(DFATAL) << "context does not contain text";
461
+ return false;
462
+ }
463
+
464
+ if (prog_->anchor_start() && context.begin() != text.begin())
465
+ return false;
466
+ if (prog_->anchor_end() && context.end() != text.end())
467
+ return false;
468
+ anchored |= prog_->anchor_start();
469
+ if (prog_->anchor_end()) {
470
+ longest = true;
471
+ endmatch_ = true;
472
+ }
473
+
474
+ if (nsubmatch < 0) {
475
+ LOG(DFATAL) << "Bad args: nsubmatch=" << nsubmatch;
476
+ return false;
477
+ }
478
+
479
+ // Save search parameters.
480
+ ncapture_ = 2*nsubmatch;
481
+ longest_ = longest;
482
+
483
+ if (nsubmatch == 0) {
484
+ // We need to maintain match[0], both to distinguish the
485
+ // longest match (if longest is true) and also to tell
486
+ // whether we've seen any matches at all.
487
+ ncapture_ = 2;
488
+ }
489
+
490
+ match_ = new const char*[ncapture_];
491
+ memset(match_, 0, ncapture_*sizeof match_[0]);
492
+ matched_ = false;
493
+
494
+ // For debugging prints.
495
+ btext_ = context.data();
496
+ // For convenience.
497
+ etext_ = text.data() + text.size();
498
+
499
+ if (ExtraDebug)
500
+ fprintf(stderr, "NFA::Search %s (context: %s) anchored=%d longest=%d\n",
501
+ std::string(text).c_str(), std::string(context).c_str(), anchored, longest);
502
+
503
+ // Set up search.
504
+ Threadq* runq = &q0_;
505
+ Threadq* nextq = &q1_;
506
+ runq->clear();
507
+ nextq->clear();
508
+
509
+ // Loop over the text, stepping the machine.
510
+ for (const char* p = text.data();; p++) {
511
+ if (ExtraDebug) {
512
+ int c = 0;
513
+ if (p == btext_)
514
+ c = '^';
515
+ else if (p > etext_)
516
+ c = '$';
517
+ else if (p < etext_)
518
+ c = p[0] & 0xFF;
519
+
520
+ fprintf(stderr, "%c:", c);
521
+ for (Threadq::iterator i = runq->begin(); i != runq->end(); ++i) {
522
+ Thread* t = i->value();
523
+ if (t == NULL)
524
+ continue;
525
+ fprintf(stderr, " %d%s", i->index(), FormatCapture(t->capture).c_str());
526
+ }
527
+ fprintf(stderr, "\n");
528
+ }
529
+
530
+ // This is a no-op the first time around the loop because runq is empty.
531
+ int id = Step(runq, nextq, p < etext_ ? p[0] & 0xFF : -1, context, p);
532
+ DCHECK_EQ(runq->size(), 0);
533
+ using std::swap;
534
+ swap(nextq, runq);
535
+ nextq->clear();
536
+ if (id != 0) {
537
+ // We're done: full match ahead.
538
+ p = etext_;
539
+ for (;;) {
540
+ Prog::Inst* ip = prog_->inst(id);
541
+ switch (ip->opcode()) {
542
+ default:
543
+ LOG(DFATAL) << "Unexpected opcode in short circuit: " << ip->opcode();
544
+ break;
545
+
546
+ case kInstCapture:
547
+ if (ip->cap() < ncapture_)
548
+ match_[ip->cap()] = p;
549
+ id = ip->out();
550
+ continue;
551
+
552
+ case kInstNop:
553
+ id = ip->out();
554
+ continue;
555
+
556
+ case kInstMatch:
557
+ match_[1] = p;
558
+ matched_ = true;
559
+ break;
560
+ }
561
+ break;
562
+ }
563
+ break;
564
+ }
565
+
566
+ if (p > etext_)
567
+ break;
568
+
569
+ // Start a new thread if there have not been any matches.
570
+ // (No point in starting a new thread if there have been
571
+ // matches, since it would be to the right of the match
572
+ // we already found.)
573
+ if (!matched_ && (!anchored || p == text.data())) {
574
+ // Try to use prefix accel (e.g. memchr) to skip ahead.
575
+ // The search must be unanchored and there must be zero
576
+ // possible matches already.
577
+ if (!anchored && runq->size() == 0 &&
578
+ p < etext_ && prog_->can_prefix_accel()) {
579
+ p = reinterpret_cast<const char*>(prog_->PrefixAccel(p, etext_ - p));
580
+ if (p == NULL)
581
+ p = etext_;
582
+ }
583
+
584
+ Thread* t = AllocThread();
585
+ CopyCapture(t->capture, match_);
586
+ t->capture[0] = p;
587
+ AddToThreadq(runq, start_, p < etext_ ? p[0] & 0xFF : -1, context, p,
588
+ t);
589
+ Decref(t);
590
+ }
591
+
592
+ // If all the threads have died, stop early.
593
+ if (runq->size() == 0) {
594
+ if (ExtraDebug)
595
+ fprintf(stderr, "dead\n");
596
+ break;
597
+ }
598
+
599
+ // Avoid invoking undefined behavior (arithmetic on a null pointer)
600
+ // by simply not continuing the loop.
601
+ // This complements the special case in NFA::Step().
602
+ if (p == NULL) {
603
+ (void)Step(runq, nextq, p < etext_ ? p[0] & 0xFF : -1, context, p);
604
+ DCHECK_EQ(runq->size(), 0);
605
+ using std::swap;
606
+ swap(nextq, runq);
607
+ nextq->clear();
608
+ break;
609
+ }
610
+ }
611
+
612
+ for (Threadq::iterator i = runq->begin(); i != runq->end(); ++i) {
613
+ if (i->value() != NULL)
614
+ Decref(i->value());
615
+ }
616
+
617
+ if (matched_) {
618
+ for (int i = 0; i < nsubmatch; i++)
619
+ submatch[i] =
620
+ StringPiece(match_[2 * i],
621
+ static_cast<size_t>(match_[2 * i + 1] - match_[2 * i]));
622
+ if (ExtraDebug)
623
+ fprintf(stderr, "match (%td,%td)\n",
624
+ match_[0] - btext_,
625
+ match_[1] - btext_);
626
+ return true;
627
+ }
628
+ return false;
629
+ }
630
+
631
+ bool
632
+ Prog::SearchNFA(const StringPiece& text, const StringPiece& context,
633
+ Anchor anchor, MatchKind kind,
634
+ StringPiece* match, int nmatch) {
635
+ if (ExtraDebug)
636
+ Dump();
637
+
638
+ NFA nfa(this);
639
+ StringPiece sp;
640
+ if (kind == kFullMatch) {
641
+ anchor = kAnchored;
642
+ if (nmatch == 0) {
643
+ match = &sp;
644
+ nmatch = 1;
645
+ }
646
+ }
647
+ if (!nfa.Search(text, context, anchor == kAnchored, kind != kFirstMatch, match, nmatch))
648
+ return false;
649
+ if (kind == kFullMatch && match[0].end() != text.end())
650
+ return false;
651
+ return true;
652
+ }
653
+
654
+ // For each instruction i in the program reachable from the start, compute the
655
+ // number of instructions reachable from i by following only empty transitions
656
+ // and record that count as fanout[i].
657
+ //
658
+ // fanout holds the results and is also the work queue for the outer iteration.
659
+ // reachable holds the reached nodes for the inner iteration.
660
+ void Prog::Fanout(SparseArray<int>* fanout) {
661
+ DCHECK_EQ(fanout->max_size(), size());
662
+ SparseSet reachable(size());
663
+ fanout->clear();
664
+ fanout->set_new(start(), 0);
665
+ for (SparseArray<int>::iterator i = fanout->begin(); i != fanout->end(); ++i) {
666
+ int* count = &i->value();
667
+ reachable.clear();
668
+ reachable.insert(i->index());
669
+ for (SparseSet::iterator j = reachable.begin(); j != reachable.end(); ++j) {
670
+ int id = *j;
671
+ Prog::Inst* ip = inst(id);
672
+ switch (ip->opcode()) {
673
+ default:
674
+ LOG(DFATAL) << "unhandled " << ip->opcode() << " in Prog::Fanout()";
675
+ break;
676
+
677
+ case kInstByteRange:
678
+ if (!ip->last())
679
+ reachable.insert(id+1);
680
+
681
+ (*count)++;
682
+ if (!fanout->has_index(ip->out())) {
683
+ fanout->set_new(ip->out(), 0);
684
+ }
685
+ break;
686
+
687
+ case kInstAltMatch:
688
+ DCHECK(!ip->last());
689
+ reachable.insert(id+1);
690
+ break;
691
+
692
+ case kInstCapture:
693
+ case kInstEmptyWidth:
694
+ case kInstNop:
695
+ if (!ip->last())
696
+ reachable.insert(id+1);
697
+
698
+ reachable.insert(ip->out());
699
+ break;
700
+
701
+ case kInstMatch:
702
+ if (!ip->last())
703
+ reachable.insert(id+1);
704
+ break;
705
+
706
+ case kInstFail:
707
+ break;
708
+ }
709
+ }
710
+ }
711
+ }
712
+
713
+ } // namespace re2