| OLD | NEW |
| 1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "net/quic/core/quic_headers_stream.h" | 5 #include "net/quic/core/quic_headers_stream.h" |
| 6 | 6 |
| 7 #include <string> | 7 #include <string> |
| 8 #include <tuple> | 8 #include <tuple> |
| 9 #include <utility> | 9 #include <utility> |
| 10 | 10 |
| (...skipping 237 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 248 const iovec* iov = data.iov; | 248 const iovec* iov = data.iov; |
| 249 int count = data.iov_count; | 249 int count = data.iov_count; |
| 250 int consumed = 0; | 250 int consumed = 0; |
| 251 for (int i = 0; i < count; ++i) { | 251 for (int i = 0; i < count; ++i) { |
| 252 saved_data_.append(static_cast<char*>(iov[i].iov_base), iov[i].iov_len); | 252 saved_data_.append(static_cast<char*>(iov[i].iov_base), iov[i].iov_len); |
| 253 consumed += iov[i].iov_len; | 253 consumed += iov[i].iov_len; |
| 254 } | 254 } |
| 255 return QuicConsumedData(consumed, false); | 255 return QuicConsumedData(consumed, false); |
| 256 } | 256 } |
| 257 | 257 |
| 258 QuicConsumedData SaveIovShort(const QuicIOVector& data) { |
| 259 const iovec* iov = data.iov; |
| 260 int consumed = 1; |
| 261 saved_data_.append(static_cast<char*>(iov[0].iov_base), consumed); |
| 262 return QuicConsumedData(consumed, false); |
| 263 } |
| 264 |
| 258 QuicConsumedData SaveIovAndNotifyAckListener( | 265 QuicConsumedData SaveIovAndNotifyAckListener( |
| 259 const QuicIOVector& data, | 266 const QuicIOVector& data, |
| 260 QuicAckListenerInterface* ack_listener) { | 267 QuicAckListenerInterface* ack_listener) { |
| 261 QuicConsumedData result = SaveIov(data); | 268 QuicConsumedData result = SaveIov(data); |
| 262 if (ack_listener) { | 269 if (ack_listener) { |
| 263 ack_listener->OnPacketAcked(result.bytes_consumed, | 270 ack_listener->OnPacketAcked(result.bytes_consumed, |
| 264 QuicTime::Delta::Zero()); | 271 QuicTime::Delta::Zero()); |
| 265 } | 272 } |
| 266 return result; | 273 return result; |
| 267 } | 274 } |
| (...skipping 662 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 930 } | 937 } |
| 931 } | 938 } |
| 932 } | 939 } |
| 933 } | 940 } |
| 934 } | 941 } |
| 935 | 942 |
| 936 TEST_P(QuicHeadersStreamTest, WritevStreamData) { | 943 TEST_P(QuicHeadersStreamTest, WritevStreamData) { |
| 937 QuicStreamId id = kClientDataStreamId1; | 944 QuicStreamId id = kClientDataStreamId1; |
| 938 QuicStreamOffset offset = 0; | 945 QuicStreamOffset offset = 0; |
| 939 struct iovec iov; | 946 struct iovec iov; |
| 940 string data; | |
| 941 | 947 |
| 942 // This test will issue a write that will require fragmenting into | 948 // This test will issue a write that will require fragmenting into |
| 943 // multiple HTTP/2 DATA frames. | 949 // multiple HTTP/2 DATA frames. |
| 944 const int kMinDataFrames = 4; | 950 const int kMinDataFrames = 4; |
| 945 const size_t data_len = | 951 const size_t data_len = |
| 946 kSpdyInitialFrameSizeLimit * kMinDataFrames + 1024; | 952 kSpdyInitialFrameSizeLimit * kMinDataFrames + 1024; |
| 947 // Set headers stream send window large enough for data written below. | 953 // Set headers stream send window large enough for data written below. |
| 948 headers_stream_->flow_controller()->UpdateSendWindowOffset(data_len * 2 * 4); | 954 headers_stream_->flow_controller()->UpdateSendWindowOffset(data_len * 2 * 4); |
| 949 test::GenerateBody(&data, data_len); | 955 string data(data_len, 'a'); |
| 950 | 956 |
| 951 for (bool fin : {true, false}) { | 957 for (bool fin : {true, false}) { |
| 952 for (bool use_ack_listener : {true, false}) { | 958 for (bool use_ack_listener : {true, false}) { |
| 953 scoped_refptr<ForceHolAckListener> ack_listener; | 959 scoped_refptr<ForceHolAckListener> ack_listener; |
| 954 if (use_ack_listener) { | 960 if (use_ack_listener) { |
| 955 ack_listener = new ForceHolAckListener(); | 961 ack_listener = new ForceHolAckListener(); |
| 956 } | 962 } |
| 957 EXPECT_CALL(session_, | 963 EXPECT_CALL(session_, |
| 958 WritevData(headers_stream_, kHeadersStreamId, _, _, false, _)) | 964 WritevData(headers_stream_, kHeadersStreamId, _, _, false, _)) |
| 959 .WillRepeatedly(WithArgs<2, 5>(Invoke( | 965 .WillRepeatedly(WithArgs<2, 5>(Invoke( |
| (...skipping 21 matching lines...) Expand all Loading... |
| 981 // Notice, acked bytes doesn't include extra bytes used by | 987 // Notice, acked bytes doesn't include extra bytes used by |
| 982 // HTTP/2 DATA frame headers. | 988 // HTTP/2 DATA frame headers. |
| 983 EXPECT_EQ(ack_listener->total_acked_bytes(), data_len); | 989 EXPECT_EQ(ack_listener->total_acked_bytes(), data_len); |
| 984 } | 990 } |
| 985 saved_data_.clear(); | 991 saved_data_.clear(); |
| 986 saved_payloads_.clear(); | 992 saved_payloads_.clear(); |
| 987 } | 993 } |
| 988 } | 994 } |
| 989 } | 995 } |
| 990 | 996 |
| 997 TEST_P(QuicHeadersStreamTest, WritevStreamDataFinOnly) { |
| 998 FLAGS_quic_bugfix_fhol_writev_fin_only_v2 = true; |
| 999 struct iovec iov; |
| 1000 string data; |
| 1001 |
| 1002 EXPECT_CALL(session_, |
| 1003 WritevData(headers_stream_, kHeadersStreamId, _, _, false, _)) |
| 1004 .WillOnce(WithArgs<2, 5>( |
| 1005 Invoke(this, &QuicHeadersStreamTest::SaveIovAndNotifyAckListener))); |
| 1006 |
| 1007 QuicConsumedData consumed_data = headers_stream_->WritevStreamData( |
| 1008 kClientDataStreamId1, MakeIOVector(data, &iov), 0, true, nullptr); |
| 1009 |
| 1010 EXPECT_EQ(consumed_data.bytes_consumed, 0u); |
| 1011 EXPECT_EQ(consumed_data.fin_consumed, true); |
| 1012 } |
| 1013 |
| 1014 TEST_P(QuicHeadersStreamTest, WritevStreamDataSendBlocked) { |
| 1015 FLAGS_quic_bugfix_fhol_writev_fin_only_v2 = true; |
| 1016 QuicStreamId id = kClientDataStreamId1; |
| 1017 QuicStreamOffset offset = 0; |
| 1018 struct iovec iov; |
| 1019 |
| 1020 // This test will issue a write that will require fragmenting into |
| 1021 // multiple HTTP/2 DATA frames. It will ensure that only 1 frame |
| 1022 // will go out in the case that the underlying session becomes write |
| 1023 // blocked. Buffering is required to preserve framing, but the |
| 1024 // amount of buffering is limited to one HTTP/2 data frame. |
| 1025 const int kMinDataFrames = 4; |
| 1026 const size_t data_len = kSpdyInitialFrameSizeLimit * kMinDataFrames + 1024; |
| 1027 // Set headers stream send window large enough for data written below. |
| 1028 headers_stream_->flow_controller()->UpdateSendWindowOffset(data_len * 2 * 4); |
| 1029 string data(data_len, 'a'); |
| 1030 |
| 1031 bool fin = true; |
| 1032 // So force the underlying |WritevData| to consume only 1 byte. |
| 1033 // In that case, |WritevStreamData| should consume just one |
| 1034 // HTTP/2 data frame's worth of data. |
| 1035 EXPECT_CALL(session_, |
| 1036 WritevData(headers_stream_, kHeadersStreamId, _, _, false, _)) |
| 1037 .WillOnce( |
| 1038 WithArgs<2>(Invoke(this, &QuicHeadersStreamTest::SaveIovShort))); |
| 1039 |
| 1040 QuicConsumedData consumed_data = headers_stream_->WritevStreamData( |
| 1041 id, MakeIOVector(data, &iov), offset, fin, nullptr); |
| 1042 |
| 1043 // bytes_consumed is max HTTP/2 data frame size minus the HTTP/2 |
| 1044 // data header size. |
| 1045 EXPECT_EQ(consumed_data.bytes_consumed, |
| 1046 kSpdyInitialFrameSizeLimit - SpdyConstants::kDataFrameMinimumSize); |
| 1047 EXPECT_EQ(consumed_data.fin_consumed, false); |
| 1048 |
| 1049 // If session already blocked, then bytes_consumed should be zero. |
| 1050 consumed_data = headers_stream_->WritevStreamData( |
| 1051 id, MakeIOVector(data, &iov), offset, fin, nullptr); |
| 1052 |
| 1053 EXPECT_EQ(consumed_data.bytes_consumed, 0u); |
| 1054 EXPECT_EQ(consumed_data.fin_consumed, false); |
| 1055 } |
| 1056 |
| 991 } // namespace | 1057 } // namespace |
| 992 } // namespace test | 1058 } // namespace test |
| 993 } // namespace net | 1059 } // namespace net |
| OLD | NEW |