OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * |
| 3 * Copyright 2015, Google Inc. |
| 4 * All rights reserved. |
| 5 * |
| 6 * Redistribution and use in source and binary forms, with or without |
| 7 * modification, are permitted provided that the following conditions are |
| 8 * met: |
| 9 * |
| 10 * * Redistributions of source code must retain the above copyright |
| 11 * notice, this list of conditions and the following disclaimer. |
| 12 * * Redistributions in binary form must reproduce the above |
| 13 * copyright notice, this list of conditions and the following disclaimer |
| 14 * in the documentation and/or other materials provided with the |
| 15 * distribution. |
| 16 * * Neither the name of Google Inc. nor the names of its |
| 17 * contributors may be used to endorse or promote products derived from |
| 18 * this software without specific prior written permission. |
| 19 * |
| 20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 24 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 25 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 26 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 30 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 31 * |
| 32 */ |
| 33 |
| 34 #include <grpc++/impl/call.h> |
| 35 |
| 36 #include <grpc/support/alloc.h> |
| 37 #include <grpc++/channel.h> |
| 38 #include <grpc++/client_context.h> |
| 39 #include <grpc++/support/byte_buffer.h> |
| 40 #include "src/core/profiling/timers.h" |
| 41 |
| 42 namespace grpc { |
| 43 |
| 44 void FillMetadataMap( |
| 45 grpc_metadata_array* arr, |
| 46 std::multimap<grpc::string_ref, grpc::string_ref>* metadata) { |
| 47 for (size_t i = 0; i < arr->count; i++) { |
| 48 // TODO(yangg) handle duplicates? |
| 49 metadata->insert(std::pair<grpc::string_ref, grpc::string_ref>( |
| 50 arr->metadata[i].key, grpc::string_ref(arr->metadata[i].value, |
| 51 arr->metadata[i].value_length))); |
| 52 } |
| 53 grpc_metadata_array_destroy(arr); |
| 54 grpc_metadata_array_init(arr); |
| 55 } |
| 56 |
| 57 // TODO(yangg) if the map is changed before we send, the pointers will be a |
| 58 // mess. Make sure it does not happen. |
| 59 grpc_metadata* FillMetadataArray( |
| 60 const std::multimap<grpc::string, grpc::string>& metadata) { |
| 61 if (metadata.empty()) { |
| 62 return nullptr; |
| 63 } |
| 64 grpc_metadata* metadata_array = |
| 65 (grpc_metadata*)gpr_malloc(metadata.size() * sizeof(grpc_metadata)); |
| 66 size_t i = 0; |
| 67 for (auto iter = metadata.cbegin(); iter != metadata.cend(); ++iter, ++i) { |
| 68 metadata_array[i].key = iter->first.c_str(); |
| 69 metadata_array[i].value = iter->second.c_str(); |
| 70 metadata_array[i].value_length = iter->second.size(); |
| 71 } |
| 72 return metadata_array; |
| 73 } |
| 74 |
| 75 Call::Call(grpc_call* call, CallHook* call_hook, CompletionQueue* cq) |
| 76 : call_hook_(call_hook), cq_(cq), call_(call), max_message_size_(-1) {} |
| 77 |
| 78 Call::Call(grpc_call* call, CallHook* call_hook, CompletionQueue* cq, |
| 79 int max_message_size) |
| 80 : call_hook_(call_hook), |
| 81 cq_(cq), |
| 82 call_(call), |
| 83 max_message_size_(max_message_size) {} |
| 84 |
| 85 void Call::PerformOps(CallOpSetInterface* ops) { |
| 86 if (max_message_size_ > 0) { |
| 87 ops->set_max_message_size(max_message_size_); |
| 88 } |
| 89 call_hook_->PerformOpsOnCall(ops, this); |
| 90 } |
| 91 |
| 92 } // namespace grpc |
OLD | NEW |