completion_queue_async_worker.cc 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  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. #include <node.h>
  34. #include <nan.h>
  35. #include "grpc/grpc.h"
  36. #include "grpc/support/log.h"
  37. #include "grpc/support/time.h"
  38. #include "completion_queue_async_worker.h"
  39. #include "call.h"
  40. namespace grpc {
  41. namespace node {
  42. using v8::Function;
  43. using v8::Handle;
  44. using v8::Object;
  45. using v8::Persistent;
  46. using v8::Value;
  47. grpc_completion_queue *CompletionQueueAsyncWorker::queue;
  48. CompletionQueueAsyncWorker::CompletionQueueAsyncWorker()
  49. : NanAsyncWorker(NULL) {}
  50. CompletionQueueAsyncWorker::~CompletionQueueAsyncWorker() {}
  51. void CompletionQueueAsyncWorker::Execute() {
  52. result = grpc_completion_queue_next(queue, gpr_inf_future);
  53. if (result->data.op_complete != GRPC_OP_OK) {
  54. SetErrorMessage("The batch encountered an error");
  55. }
  56. }
  57. grpc_completion_queue *CompletionQueueAsyncWorker::GetQueue() { return queue; }
  58. void CompletionQueueAsyncWorker::Next() {
  59. NanScope();
  60. CompletionQueueAsyncWorker *worker = new CompletionQueueAsyncWorker();
  61. NanAsyncQueueWorker(worker);
  62. }
  63. void CompletionQueueAsyncWorker::Init(Handle<Object> exports) {
  64. NanScope();
  65. queue = grpc_completion_queue_create();
  66. }
  67. void CompletionQueueAsyncWorker::HandleOKCallback() {
  68. NanScope();
  69. NanCallback *callback = GetTagCallback(result->tag);
  70. Handle<Value> argv[] = {NanNull(), GetTagNodeValue(result->tag)};
  71. callback->Call(2, argv);
  72. DestroyTag(result->tag);
  73. grpc_event_finish(result);
  74. result = NULL;
  75. }
  76. void CompletionQueueAsyncWorker::HandleErrorCallback() {
  77. NanScope();
  78. NanCallback *callback = GetTagCallback(result->tag);
  79. Handle<Value> argv[] = {NanError(ErrorMessage())};
  80. callback->Call(1, argv);
  81. DestroyTag(result->tag);
  82. grpc_event_finish(result);
  83. result = NULL;
  84. }
  85. } // namespace node
  86. } // namespace grpc