mirror of https://github.com/grpc/grpc-node.git
96 lines
3.4 KiB
C++
96 lines
3.4 KiB
C++
/*
|
|
*
|
|
* Copyright 2014, Google Inc.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above
|
|
* copyright notice, this list of conditions and the following disclaimer
|
|
* in the documentation and/or other materials provided with the
|
|
* distribution.
|
|
* * Neither the name of Google Inc. nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
*/
|
|
|
|
#include <string.h>
|
|
#include <malloc.h>
|
|
|
|
#include <node.h>
|
|
#include <nan.h>
|
|
#include "grpc/grpc.h"
|
|
#include "grpc/support/slice.h"
|
|
|
|
#include "byte_buffer.h"
|
|
|
|
namespace grpc {
|
|
namespace node {
|
|
|
|
using ::node::Buffer;
|
|
using v8::Context;
|
|
using v8::Function;
|
|
using v8::Handle;
|
|
using v8::Object;
|
|
using v8::Number;
|
|
using v8::Value;
|
|
|
|
grpc_byte_buffer *BufferToByteBuffer(Handle<Value> buffer) {
|
|
NanScope();
|
|
int length = Buffer::Length(buffer);
|
|
char *data = Buffer::Data(buffer);
|
|
gpr_slice slice = gpr_slice_malloc(length);
|
|
memcpy(GPR_SLICE_START_PTR(slice), data, length);
|
|
grpc_byte_buffer *byte_buffer(grpc_byte_buffer_create(&slice, 1));
|
|
gpr_slice_unref(slice);
|
|
return byte_buffer;
|
|
}
|
|
|
|
Handle<Value> ByteBufferToBuffer(grpc_byte_buffer *buffer) {
|
|
NanEscapableScope();
|
|
if (buffer == NULL) {
|
|
NanReturnNull();
|
|
}
|
|
size_t length = grpc_byte_buffer_length(buffer);
|
|
char *result = reinterpret_cast<char *>(calloc(length, sizeof(char)));
|
|
size_t offset = 0;
|
|
grpc_byte_buffer_reader *reader = grpc_byte_buffer_reader_create(buffer);
|
|
gpr_slice next;
|
|
while (grpc_byte_buffer_reader_next(reader, &next) != 0) {
|
|
memcpy(result + offset, GPR_SLICE_START_PTR(next), GPR_SLICE_LENGTH(next));
|
|
offset += GPR_SLICE_LENGTH(next);
|
|
}
|
|
return NanEscapeScope(MakeFastBuffer(NanNewBufferHandle(result, length)));
|
|
}
|
|
|
|
Handle<Value> MakeFastBuffer(Handle<Value> slowBuffer) {
|
|
NanEscapableScope();
|
|
Handle<Object> globalObj = Context::GetCurrent()->Global();
|
|
Handle<Function> bufferConstructor = Handle<Function>::Cast(
|
|
globalObj->Get(NanNew("Buffer")));
|
|
Handle<Value> consArgs[3] = { slowBuffer,
|
|
NanNew<Number>(Buffer::Length(slowBuffer)),
|
|
NanNew<Number>(0) };
|
|
Handle<Object> fastBuffer = bufferConstructor->NewInstance(3, consArgs);
|
|
return NanEscapeScope(fastBuffer);
|
|
}
|
|
} // namespace node
|
|
} // namespace grpc
|