blob: 21842ffdb294478a953ae6424790b278f9107cc4 [file] [log] [blame]
murgatroid99749666e2015-01-12 18:25:58 -08001/*
2 *
3 * Copyright 2014, 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
murgatroid99e5061512015-01-12 18:14:35 -080034#include <node.h>
35#include <nan.h>
36
37#include "grpc/grpc.h"
38#include "grpc/support/time.h"
39#include "completion_queue_async_worker.h"
40#include "event.h"
41#include "tag.h"
42
43namespace grpc {
44namespace node {
45
46using v8::Function;
47using v8::Handle;
48using v8::Object;
49using v8::Persistent;
50using v8::Value;
51
52grpc_completion_queue *CompletionQueueAsyncWorker::queue;
53
54CompletionQueueAsyncWorker::CompletionQueueAsyncWorker() :
55 NanAsyncWorker(NULL) {
56}
57
58CompletionQueueAsyncWorker::~CompletionQueueAsyncWorker() {
59}
60
61void CompletionQueueAsyncWorker::Execute() {
62 result = grpc_completion_queue_next(queue, gpr_inf_future);
63}
64
65grpc_completion_queue *CompletionQueueAsyncWorker::GetQueue() {
66 return queue;
67}
68
69void CompletionQueueAsyncWorker::Next() {
70 NanScope();
71 CompletionQueueAsyncWorker *worker = new CompletionQueueAsyncWorker();
72 NanAsyncQueueWorker(worker);
73}
74
75void CompletionQueueAsyncWorker::Init(Handle<Object> exports) {
76 NanScope();
77 queue = grpc_completion_queue_create();
78}
79
80void CompletionQueueAsyncWorker::HandleOKCallback() {
81 NanScope();
82 NanCallback event_callback(GetTagHandle(result->tag).As<Function>());
83 Handle<Value> argv[] = {
84 CreateEventObject(result)
85 };
86
87 DestroyTag(result->tag);
88 grpc_event_finish(result);
89 result = NULL;
90
91 event_callback.Call(1, argv);
92}
93
94} // namespace node
95} // namespace grpc