Chromium Code Reviews| Index: net/websockets/websocket_frame_parser.cc |
| diff --git a/net/websockets/websocket_frame_parser.cc b/net/websockets/websocket_frame_parser.cc |
| index 1acc64ce42af9825499e9c42a9e0147d8855b34c..fb22fa538a322464eeaa0f28237f3846c1e19ed0 100644 |
| --- a/net/websockets/websocket_frame_parser.cc |
| +++ b/net/websockets/websocket_frame_parser.cc |
| @@ -5,6 +5,7 @@ |
| #include "net/websockets/websocket_frame_parser.h" |
| #include <algorithm> |
| +#include <limits> |
| #include "base/basictypes.h" |
| #include "base/logging.h" |
| @@ -12,6 +13,7 @@ |
| #include "base/memory/scoped_ptr.h" |
| #include "base/memory/scoped_vector.h" |
| #include "net/base/big_endian.h" |
| +#include "net/base/io_buffer.h" |
| #include "net/websockets/websocket_frame.h" |
| namespace { |
| @@ -178,26 +180,31 @@ scoped_ptr<WebSocketFrameChunk> WebSocketFrameParser::DecodeFramePayload( |
| uint64 next_size = std::min<uint64>( |
| end - current, |
| current_frame_header_->payload_length - frame_offset_); |
| + DCHECK_LE(next_size, static_cast<uint64>(std::numeric_limits<int>::max())); |
|
Ryan Sleevi
2012/07/30 07:21:13
nit: Is this more appropriate as a CHECK, rather t
Takashi Toyoshima
2012/07/30 08:01:21
Agreed.
RFC defines status code 1009 meaning "Mes
mmenke
2012/07/30 13:26:57
Just thought I'd point out that these don't corres
|
| scoped_ptr<WebSocketFrameChunk> frame_chunk(new WebSocketFrameChunk); |
| if (first_chunk) { |
| frame_chunk->header.reset(new WebSocketFrameHeader(*current_frame_header_)); |
| } |
| frame_chunk->final_chunk = false; |
| - frame_chunk->data.assign(current, current + next_size); |
| - if (current_frame_header_->masked) { |
| - // Unmask the payload. |
| - // TODO(yutak): This could be faster by doing unmasking for each |
| - // machine word (instead of each byte). |
| - size_t key_offset = frame_offset_ % kMaskingKeyLength; |
| - for (uint64 i = 0; i < next_size; ++i) { |
| - frame_chunk->data[i] ^= masking_key_[key_offset]; |
| - key_offset = (key_offset + 1) % kMaskingKeyLength; |
| + if (next_size) { |
| + frame_chunk->data = new IOBufferWithSize(static_cast<int>(next_size)); |
| + char* io_data = frame_chunk->data->data(); |
| + memcpy(io_data, current, next_size); |
| + if (current_frame_header_->masked) { |
| + // Unmask the payload. |
| + // TODO(yutak): This could be faster by doing unmasking for each |
| + // machine word (instead of each byte). |
|
Ryan Sleevi
2012/07/30 07:21:13
FWIW, when you do go and begin to (micro?)-optimiz
Takashi Toyoshima
2012/07/30 08:01:21
Wow, he made many interesting optimizations.
Thank
|
| + size_t key_offset = frame_offset_ % kMaskingKeyLength; |
| + for (uint64 i = 0; i < next_size; ++i) { |
| + io_data[i] ^= masking_key_[key_offset]; |
| + key_offset = (key_offset + 1) % kMaskingKeyLength; |
| + } |
| } |
| - } |
| - current_read_pos_ += next_size; |
| - frame_offset_ += next_size; |
| + current_read_pos_ += next_size; |
| + frame_offset_ += next_size; |
| + } |
| DCHECK_LE(frame_offset_, current_frame_header_->payload_length); |
| if (frame_offset_ == current_frame_header_->payload_length) { |