Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2010 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2010 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/base/upload_data_stream.h" | 5 #include "net/base/upload_data_stream.h" |
| 6 | 6 |
| 7 #include "base/file_util.h" | 7 #include "base/file_util.h" |
| 8 #include "base/logging.h" | 8 #include "base/logging.h" |
| 9 #include "net/base/file_stream.h" | 9 #include "net/base/file_stream.h" |
| 10 #include "net/base/io_buffer.h" | 10 #include "net/base/io_buffer.h" |
| 11 #include "net/base/net_errors.h" | 11 #include "net/base/net_errors.h" |
| 12 | 12 |
| 13 namespace net { | 13 namespace net { |
| 14 | 14 |
| 15 UploadDataStream* UploadDataStream::Create(UploadData* data, int* error_code) { | 15 UploadDataStream* UploadDataStream::Create(UploadData* data, int* error_code) { |
| 16 scoped_ptr<UploadDataStream> stream(new UploadDataStream(data)); | 16 scoped_ptr<UploadDataStream> stream(new UploadDataStream(data)); |
| 17 int rv = stream->FillBuf(); | 17 int rv = stream->FillBuf(); |
| 18 if (error_code) | 18 if (error_code) |
| 19 *error_code = rv; | 19 *error_code = rv; |
| 20 if (rv != OK) | 20 if (rv != OK) |
| 21 return NULL; | 21 return NULL; |
| 22 | 22 |
| 23 return stream.release(); | 23 return stream.release(); |
| 24 } | 24 } |
| 25 | 25 |
| 26 UploadDataStream::UploadDataStream(UploadData* data) | 26 UploadDataStream::UploadDataStream(UploadData* data) |
| 27 : data_(data), | 27 : data_(data), |
| 28 buf_(new IOBuffer(kBufSize)), | 28 buf_(new IOBuffer(kBufSize)), |
| 29 buf_len_(0), | 29 buf_len_(0), |
| 30 next_element_(data->elements()->begin()), | 30 next_element_(0), |
| 31 next_element_offset_(0), | 31 next_element_offset_(0), |
| 32 next_element_remaining_(0), | 32 next_element_remaining_(0), |
| 33 total_size_(data->GetContentLength()), | 33 total_size_(data->GetContentLength()), |
| 34 current_position_(0), | 34 current_position_(0), |
| 35 waiting_for_data_(false), | |
|
wtc
2011/01/14 03:09:31
IMPORTANT: after studying the code, I think
waitin
Satish
2011/01/14 18:09:29
Good call, yes this flag is unnecessary now. It wa
| |
| 35 eof_(false) { | 36 eof_(false) { |
| 37 if (data_->is_chunked()) { | |
| 38 waiting_for_data_ = true; | |
| 39 data_->set_chunk_callback(this); | |
| 40 } | |
| 36 } | 41 } |
| 37 | 42 |
| 38 UploadDataStream::~UploadDataStream() { | 43 UploadDataStream::~UploadDataStream() { |
| 39 } | 44 } |
| 40 | 45 |
| 41 void UploadDataStream::DidConsume(size_t num_bytes) { | 46 void UploadDataStream::DidConsume(size_t num_bytes) { |
| 42 DCHECK_LE(num_bytes, buf_len_); | 47 DCHECK_LE(num_bytes, buf_len_); |
| 43 DCHECK(!eof_); | 48 DCHECK(!eof_); |
| 44 | 49 |
| 45 buf_len_ -= num_bytes; | 50 buf_len_ -= num_bytes; |
| 46 if (buf_len_) | 51 if (buf_len_) |
| 47 memmove(buf_->data(), buf_->data() + num_bytes, buf_len_); | 52 memmove(buf_->data(), buf_->data() + num_bytes, buf_len_); |
| 48 | 53 |
| 49 FillBuf(); | 54 FillBuf(); |
| 50 | 55 |
| 51 current_position_ += num_bytes; | 56 current_position_ += num_bytes; |
| 52 } | 57 } |
| 53 | 58 |
| 59 void UploadDataStream::set_chunk_callback(ChunkCallback* callback) { | |
| 60 chunk_callback_ = callback; | |
| 61 } | |
| 62 | |
| 63 void UploadDataStream::OnChunkAvailable() { | |
| 64 if (!waiting_for_data_) | |
| 65 return; | |
| 66 | |
| 67 waiting_for_data_ = false; | |
| 68 FillBuf(); | |
| 69 | |
| 70 if (chunk_callback_) | |
| 71 chunk_callback_->OnChunkAvailable(); | |
| 72 } | |
| 73 | |
| 54 int UploadDataStream::FillBuf() { | 74 int UploadDataStream::FillBuf() { |
| 55 std::vector<UploadData::Element>::iterator end = | 75 std::vector<UploadData::Element>& elements = *data_->elements(); |
| 56 data_->elements()->end(); | 76 if (elements.size() == 0 && data_->is_chunked()) { |
| 77 // We are waiting for data from UploadData, so nothing to do. | |
| 78 return OK; | |
| 79 } | |
| 57 | 80 |
| 58 while (buf_len_ < kBufSize && next_element_ != end) { | 81 while (buf_len_ < kBufSize && next_element_ < elements.size()) { |
| 59 bool advance_to_next_element = false; | 82 bool advance_to_next_element = false; |
| 60 | 83 |
| 61 UploadData::Element& element = *next_element_; | 84 UploadData::Element& element = elements[next_element_]; |
| 62 | 85 |
| 63 size_t size_remaining = kBufSize - buf_len_; | 86 size_t size_remaining = kBufSize - buf_len_; |
| 64 if (element.type() == UploadData::TYPE_BYTES) { | 87 if (element.type() == UploadData::TYPE_BYTES || |
| 88 element.type() == UploadData::TYPE_CHUNK) { | |
| 65 const std::vector<char>& d = element.bytes(); | 89 const std::vector<char>& d = element.bytes(); |
| 66 size_t count = d.size() - next_element_offset_; | 90 size_t count = d.size() - next_element_offset_; |
| 67 | 91 |
| 68 size_t bytes_copied = std::min(count, size_remaining); | 92 size_t bytes_copied = std::min(count, size_remaining); |
| 69 | 93 |
| 70 memcpy(buf_->data() + buf_len_, &d[next_element_offset_], bytes_copied); | 94 if (bytes_copied > 0) |
| 95 memcpy(buf_->data() + buf_len_, &d[next_element_offset_], bytes_copied); | |
| 71 buf_len_ += bytes_copied; | 96 buf_len_ += bytes_copied; |
| 72 | 97 |
| 73 if (bytes_copied == count) { | 98 if (bytes_copied == count) { |
| 74 advance_to_next_element = true; | 99 advance_to_next_element = true; |
| 75 } else { | 100 } else { |
| 76 next_element_offset_ += bytes_copied; | 101 next_element_offset_ += bytes_copied; |
| 77 } | 102 } |
| 78 } else { | 103 } else { |
| 79 DCHECK(element.type() == UploadData::TYPE_FILE); | 104 DCHECK(element.type() == UploadData::TYPE_FILE); |
| 80 | 105 |
| (...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 119 } | 144 } |
| 120 | 145 |
| 121 if (advance_to_next_element) { | 146 if (advance_to_next_element) { |
| 122 ++next_element_; | 147 ++next_element_; |
| 123 next_element_offset_ = 0; | 148 next_element_offset_ = 0; |
| 124 next_element_remaining_ = 0; | 149 next_element_remaining_ = 0; |
| 125 next_element_stream_.reset(); | 150 next_element_stream_.reset(); |
| 126 } | 151 } |
| 127 } | 152 } |
| 128 | 153 |
| 129 if (next_element_ == end && !buf_len_) | 154 if (next_element_ == elements.size() && !buf_len_) { |
|
vandebo (ex-Chrome)
2011/01/14 05:53:44
Could this conditional be true and the next false
Satish
2011/01/14 18:09:29
There is an if statement at the very beginning of
| |
| 130 eof_ = true; | 155 // If the last element in the list is a CHUNK buffer of non-zero length, we |
| 156 // have to wait for more data to come in. | |
| 157 if (next_element_ > 0 && | |
| 158 elements[next_element_ - 1].type() == UploadData::TYPE_CHUNK && | |
| 159 elements[next_element_ - 1].bytes().size() > 0) { | |
|
vandebo (ex-Chrome)
2011/01/14 05:53:44
The last chunk won't have zero size at this point
Satish
2011/01/14 18:09:29
In http the last chunk is not zero bytes in size.
| |
| 160 waiting_for_data_ = true; | |
| 161 } else { | |
| 162 eof_ = true; | |
| 163 } | |
| 164 } | |
| 131 | 165 |
| 132 return OK; | 166 return OK; |
| 133 } | 167 } |
| 134 | 168 |
| 135 } // namespace net | 169 } // namespace net |
| OLD | NEW |