node-aix-ppc64 22.11.0 → 22.12.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1023,44 +1023,38 @@ NODE_DEPRECATED("Use v8::Date::ValueOf() directly",
1023
1023
  })
1024
1024
  #define NODE_V8_UNIXTIME node::NODE_V8_UNIXTIME
1025
1025
 
1026
- #define NODE_DEFINE_CONSTANT(target, constant) \
1027
- do { \
1028
- v8::Isolate* isolate = target->GetIsolate(); \
1029
- v8::Local<v8::Context> context = isolate->GetCurrentContext(); \
1030
- v8::Local<v8::String> constant_name = \
1031
- v8::String::NewFromUtf8(isolate, #constant, \
1032
- v8::NewStringType::kInternalized).ToLocalChecked(); \
1033
- v8::Local<v8::Number> constant_value = \
1034
- v8::Number::New(isolate, static_cast<double>(constant)); \
1035
- v8::PropertyAttribute constant_attributes = \
1036
- static_cast<v8::PropertyAttribute>(v8::ReadOnly | v8::DontDelete); \
1037
- (target)->DefineOwnProperty(context, \
1038
- constant_name, \
1039
- constant_value, \
1040
- constant_attributes).Check(); \
1041
- } \
1042
- while (0)
1043
-
1044
- #define NODE_DEFINE_HIDDEN_CONSTANT(target, constant) \
1045
- do { \
1046
- v8::Isolate* isolate = target->GetIsolate(); \
1047
- v8::Local<v8::Context> context = isolate->GetCurrentContext(); \
1048
- v8::Local<v8::String> constant_name = \
1049
- v8::String::NewFromUtf8(isolate, #constant, \
1050
- v8::NewStringType::kInternalized) \
1051
- .ToLocalChecked(); \
1052
- v8::Local<v8::Number> constant_value = \
1053
- v8::Number::New(isolate, static_cast<double>(constant)); \
1054
- v8::PropertyAttribute constant_attributes = \
1055
- static_cast<v8::PropertyAttribute>(v8::ReadOnly | \
1056
- v8::DontDelete | \
1057
- v8::DontEnum); \
1058
- (target)->DefineOwnProperty(context, \
1059
- constant_name, \
1060
- constant_value, \
1061
- constant_attributes).Check(); \
1062
- } \
1063
- while (0)
1026
+ #define NODE_DEFINE_CONSTANT(target, constant) \
1027
+ do { \
1028
+ v8::Isolate* isolate = target->GetIsolate(); \
1029
+ v8::Local<v8::Context> context = isolate->GetCurrentContext(); \
1030
+ v8::Local<v8::String> constant_name = v8::String::NewFromUtf8Literal( \
1031
+ isolate, #constant, v8::NewStringType::kInternalized); \
1032
+ v8::Local<v8::Number> constant_value = \
1033
+ v8::Number::New(isolate, static_cast<double>(constant)); \
1034
+ v8::PropertyAttribute constant_attributes = \
1035
+ static_cast<v8::PropertyAttribute>(v8::ReadOnly | v8::DontDelete); \
1036
+ (target) \
1037
+ ->DefineOwnProperty( \
1038
+ context, constant_name, constant_value, constant_attributes) \
1039
+ .Check(); \
1040
+ } while (0)
1041
+
1042
+ #define NODE_DEFINE_HIDDEN_CONSTANT(target, constant) \
1043
+ do { \
1044
+ v8::Isolate* isolate = target->GetIsolate(); \
1045
+ v8::Local<v8::Context> context = isolate->GetCurrentContext(); \
1046
+ v8::Local<v8::String> constant_name = v8::String::NewFromUtf8Literal( \
1047
+ isolate, #constant, v8::NewStringType::kInternalized); \
1048
+ v8::Local<v8::Number> constant_value = \
1049
+ v8::Number::New(isolate, static_cast<double>(constant)); \
1050
+ v8::PropertyAttribute constant_attributes = \
1051
+ static_cast<v8::PropertyAttribute>(v8::ReadOnly | v8::DontDelete | \
1052
+ v8::DontEnum); \
1053
+ (target) \
1054
+ ->DefineOwnProperty( \
1055
+ context, constant_name, constant_value, constant_attributes) \
1056
+ .Check(); \
1057
+ } while (0)
1064
1058
 
1065
1059
  // Used to be a macro, hence the uppercase name.
1066
1060
  inline void NODE_SET_METHOD(v8::Local<v8::Template> recv,
@@ -135,6 +135,18 @@ napi_create_external_buffer(napi_env env,
135
135
  void* finalize_hint,
136
136
  napi_value* result);
137
137
  #endif // NODE_API_NO_EXTERNAL_BUFFERS_ALLOWED
138
+
139
+ #ifdef NAPI_EXPERIMENTAL
140
+ #define NODE_API_EXPERIMENTAL_HAS_CREATE_BUFFER_FROM_ARRAYBUFFER
141
+
142
+ NAPI_EXTERN napi_status NAPI_CDECL
143
+ node_api_create_buffer_from_arraybuffer(napi_env env,
144
+ napi_value arraybuffer,
145
+ size_t byte_offset,
146
+ size_t byte_length,
147
+ napi_value* result);
148
+ #endif // NAPI_EXPERIMENTAL
149
+
138
150
  NAPI_EXTERN napi_status NAPI_CDECL napi_create_buffer_copy(napi_env env,
139
151
  size_t length,
140
152
  const void* data,
@@ -23,7 +23,7 @@
23
23
  #define SRC_NODE_VERSION_H_
24
24
 
25
25
  #define NODE_MAJOR_VERSION 22
26
- #define NODE_MINOR_VERSION 11
26
+ #define NODE_MINOR_VERSION 12
27
27
  #define NODE_PATCH_VERSION 0
28
28
 
29
29
  #define NODE_VERSION_IS_LTS 1
@@ -35,21 +35,7 @@
35
35
  #endif
36
36
 
37
37
  /*
38
- * This file defines data structures for different types of trees:
39
- * splay trees and red-black trees.
40
- *
41
- * A splay tree is a self-organizing data structure. Every operation
42
- * on the tree causes a splay to happen. The splay moves the requested
43
- * node to the root of the tree and partly rebalances it.
44
- *
45
- * This has the benefit that request locality causes faster lookups as
46
- * the requested nodes move to the top of the tree. On the other hand,
47
- * every lookup causes memory writes.
48
- *
49
- * The Balance Theorem bounds the total access time for m operations
50
- * and n inserts on an initially empty tree as O((m + n)lg n). The
51
- * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
52
- *
38
+ * This file defines data structures for red-black trees.
53
39
  * A red-black tree is a binary search tree with the node color as an
54
40
  * extra attribute. It fulfills a set of conditions:
55
41
  * - every search path from the root to a leaf consists of the
@@ -61,239 +47,6 @@
61
47
  * The maximum height of a red-black tree is 2lg (n+1).
62
48
  */
63
49
 
64
- #define SPLAY_HEAD(name, type) \
65
- struct name { \
66
- struct type *sph_root; /* root of the tree */ \
67
- }
68
-
69
- #define SPLAY_INITIALIZER(root) \
70
- { NULL }
71
-
72
- #define SPLAY_INIT(root) do { \
73
- (root)->sph_root = NULL; \
74
- } while (/*CONSTCOND*/ 0)
75
-
76
- #define SPLAY_ENTRY(type) \
77
- struct { \
78
- struct type *spe_left; /* left element */ \
79
- struct type *spe_right; /* right element */ \
80
- }
81
-
82
- #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
83
- #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
84
- #define SPLAY_ROOT(head) (head)->sph_root
85
- #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
86
-
87
- /* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */
88
- #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
89
- SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
90
- SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
91
- (head)->sph_root = tmp; \
92
- } while (/*CONSTCOND*/ 0)
93
-
94
- #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
95
- SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
96
- SPLAY_LEFT(tmp, field) = (head)->sph_root; \
97
- (head)->sph_root = tmp; \
98
- } while (/*CONSTCOND*/ 0)
99
-
100
- #define SPLAY_LINKLEFT(head, tmp, field) do { \
101
- SPLAY_LEFT(tmp, field) = (head)->sph_root; \
102
- tmp = (head)->sph_root; \
103
- (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
104
- } while (/*CONSTCOND*/ 0)
105
-
106
- #define SPLAY_LINKRIGHT(head, tmp, field) do { \
107
- SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
108
- tmp = (head)->sph_root; \
109
- (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
110
- } while (/*CONSTCOND*/ 0)
111
-
112
- #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
113
- SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
114
- SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field); \
115
- SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
116
- SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
117
- } while (/*CONSTCOND*/ 0)
118
-
119
- /* Generates prototypes and inline functions */
120
-
121
- #define SPLAY_PROTOTYPE(name, type, field, cmp) \
122
- void name##_SPLAY(struct name *, struct type *); \
123
- void name##_SPLAY_MINMAX(struct name *, int); \
124
- struct type *name##_SPLAY_INSERT(struct name *, struct type *); \
125
- struct type *name##_SPLAY_REMOVE(struct name *, struct type *); \
126
- \
127
- /* Finds the node with the same key as elm */ \
128
- static __inline struct type * \
129
- name##_SPLAY_FIND(struct name *head, struct type *elm) \
130
- { \
131
- if (SPLAY_EMPTY(head)) \
132
- return(NULL); \
133
- name##_SPLAY(head, elm); \
134
- if ((cmp)(elm, (head)->sph_root) == 0) \
135
- return (head->sph_root); \
136
- return (NULL); \
137
- } \
138
- \
139
- static __inline struct type * \
140
- name##_SPLAY_NEXT(struct name *head, struct type *elm) \
141
- { \
142
- name##_SPLAY(head, elm); \
143
- if (SPLAY_RIGHT(elm, field) != NULL) { \
144
- elm = SPLAY_RIGHT(elm, field); \
145
- while (SPLAY_LEFT(elm, field) != NULL) { \
146
- elm = SPLAY_LEFT(elm, field); \
147
- } \
148
- } else \
149
- elm = NULL; \
150
- return (elm); \
151
- } \
152
- \
153
- static __inline struct type * \
154
- name##_SPLAY_MIN_MAX(struct name *head, int val) \
155
- { \
156
- name##_SPLAY_MINMAX(head, val); \
157
- return (SPLAY_ROOT(head)); \
158
- }
159
-
160
- /* Main splay operation.
161
- * Moves node close to the key of elm to top
162
- */
163
- #define SPLAY_GENERATE(name, type, field, cmp) \
164
- struct type * \
165
- name##_SPLAY_INSERT(struct name *head, struct type *elm) \
166
- { \
167
- if (SPLAY_EMPTY(head)) { \
168
- SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
169
- } else { \
170
- int __comp; \
171
- name##_SPLAY(head, elm); \
172
- __comp = (cmp)(elm, (head)->sph_root); \
173
- if(__comp < 0) { \
174
- SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field); \
175
- SPLAY_RIGHT(elm, field) = (head)->sph_root; \
176
- SPLAY_LEFT((head)->sph_root, field) = NULL; \
177
- } else if (__comp > 0) { \
178
- SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field); \
179
- SPLAY_LEFT(elm, field) = (head)->sph_root; \
180
- SPLAY_RIGHT((head)->sph_root, field) = NULL; \
181
- } else \
182
- return ((head)->sph_root); \
183
- } \
184
- (head)->sph_root = (elm); \
185
- return (NULL); \
186
- } \
187
- \
188
- struct type * \
189
- name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
190
- { \
191
- struct type *__tmp; \
192
- if (SPLAY_EMPTY(head)) \
193
- return (NULL); \
194
- name##_SPLAY(head, elm); \
195
- if ((cmp)(elm, (head)->sph_root) == 0) { \
196
- if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
197
- (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
198
- } else { \
199
- __tmp = SPLAY_RIGHT((head)->sph_root, field); \
200
- (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
201
- name##_SPLAY(head, elm); \
202
- SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
203
- } \
204
- return (elm); \
205
- } \
206
- return (NULL); \
207
- } \
208
- \
209
- void \
210
- name##_SPLAY(struct name *head, struct type *elm) \
211
- { \
212
- struct type __node, *__left, *__right, *__tmp; \
213
- int __comp; \
214
- \
215
- SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL; \
216
- __left = __right = &__node; \
217
- \
218
- while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
219
- if (__comp < 0) { \
220
- __tmp = SPLAY_LEFT((head)->sph_root, field); \
221
- if (__tmp == NULL) \
222
- break; \
223
- if ((cmp)(elm, __tmp) < 0){ \
224
- SPLAY_ROTATE_RIGHT(head, __tmp, field); \
225
- if (SPLAY_LEFT((head)->sph_root, field) == NULL) \
226
- break; \
227
- } \
228
- SPLAY_LINKLEFT(head, __right, field); \
229
- } else if (__comp > 0) { \
230
- __tmp = SPLAY_RIGHT((head)->sph_root, field); \
231
- if (__tmp == NULL) \
232
- break; \
233
- if ((cmp)(elm, __tmp) > 0){ \
234
- SPLAY_ROTATE_LEFT(head, __tmp, field); \
235
- if (SPLAY_RIGHT((head)->sph_root, field) == NULL) \
236
- break; \
237
- } \
238
- SPLAY_LINKRIGHT(head, __left, field); \
239
- } \
240
- } \
241
- SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
242
- } \
243
- \
244
- /* Splay with either the minimum or the maximum element \
245
- * Used to find minimum or maximum element in tree. \
246
- */ \
247
- void name##_SPLAY_MINMAX(struct name *head, int __comp) \
248
- { \
249
- struct type __node, *__left, *__right, *__tmp; \
250
- \
251
- SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL; \
252
- __left = __right = &__node; \
253
- \
254
- for (;;) { \
255
- if (__comp < 0) { \
256
- __tmp = SPLAY_LEFT((head)->sph_root, field); \
257
- if (__tmp == NULL) \
258
- break; \
259
- if (__comp < 0){ \
260
- SPLAY_ROTATE_RIGHT(head, __tmp, field); \
261
- if (SPLAY_LEFT((head)->sph_root, field) == NULL) \
262
- break; \
263
- } \
264
- SPLAY_LINKLEFT(head, __right, field); \
265
- } else if (__comp > 0) { \
266
- __tmp = SPLAY_RIGHT((head)->sph_root, field); \
267
- if (__tmp == NULL) \
268
- break; \
269
- if (__comp > 0) { \
270
- SPLAY_ROTATE_LEFT(head, __tmp, field); \
271
- if (SPLAY_RIGHT((head)->sph_root, field) == NULL) \
272
- break; \
273
- } \
274
- SPLAY_LINKRIGHT(head, __left, field); \
275
- } \
276
- } \
277
- SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
278
- }
279
-
280
- #define SPLAY_NEGINF -1
281
- #define SPLAY_INF 1
282
-
283
- #define SPLAY_INSERT(name, x, y) name##_SPLAY_INSERT(x, y)
284
- #define SPLAY_REMOVE(name, x, y) name##_SPLAY_REMOVE(x, y)
285
- #define SPLAY_FIND(name, x, y) name##_SPLAY_FIND(x, y)
286
- #define SPLAY_NEXT(name, x, y) name##_SPLAY_NEXT(x, y)
287
- #define SPLAY_MIN(name, x) (SPLAY_EMPTY(x) ? NULL \
288
- : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF))
289
- #define SPLAY_MAX(name, x) (SPLAY_EMPTY(x) ? NULL \
290
- : name##_SPLAY_MIN_MAX(x, SPLAY_INF))
291
-
292
- #define SPLAY_FOREACH(x, name, head) \
293
- for ((x) = SPLAY_MIN(name, head); \
294
- (x) != NULL; \
295
- (x) = SPLAY_NEXT(name, head, x))
296
-
297
50
  /* Macros that define a red-black tree */
298
51
  #define RB_HEAD(name, type) \
299
52
  struct name { \
@@ -730,8 +483,8 @@ name##_RB_MINMAX(struct name *head, int val) \
730
483
  #define RB_REMOVE(name, x, y) name##_RB_REMOVE(x, y)
731
484
  #define RB_FIND(name, x, y) name##_RB_FIND(x, y)
732
485
  #define RB_NFIND(name, x, y) name##_RB_NFIND(x, y)
733
- #define RB_NEXT(name, x, y) name##_RB_NEXT(y)
734
- #define RB_PREV(name, x, y) name##_RB_PREV(y)
486
+ #define RB_NEXT(name, x) name##_RB_NEXT(x)
487
+ #define RB_PREV(name, x) name##_RB_PREV(x)
735
488
  #define RB_MIN(name, x) name##_RB_MINMAX(x, RB_NEGINF)
736
489
  #define RB_MAX(name, x) name##_RB_MINMAX(x, RB_INF)
737
490
 
@@ -31,8 +31,8 @@
31
31
  */
32
32
 
33
33
  #define UV_VERSION_MAJOR 1
34
- #define UV_VERSION_MINOR 48
35
- #define UV_VERSION_PATCH 0
34
+ #define UV_VERSION_MINOR 49
35
+ #define UV_VERSION_PATCH 1
36
36
  #define UV_VERSION_IS_RELEASE 1
37
37
  #define UV_VERSION_SUFFIX ""
38
38
 
@@ -290,8 +290,8 @@ typedef struct {
290
290
  #define UV_ONCE_INIT { 0, NULL }
291
291
 
292
292
  typedef struct uv_once_s {
293
- unsigned char ran;
294
- HANDLE event;
293
+ unsigned char unused;
294
+ INIT_ONCE init_once;
295
295
  } uv_once_t;
296
296
 
297
297
  /* Platform-specific definitions for uv_spawn support. */
package/include/node/uv.h CHANGED
@@ -260,7 +260,9 @@ typedef struct uv_metrics_s uv_metrics_t;
260
260
 
261
261
  typedef enum {
262
262
  UV_LOOP_BLOCK_SIGNAL = 0,
263
- UV_METRICS_IDLE_TIME
263
+ UV_METRICS_IDLE_TIME,
264
+ UV_LOOP_USE_IO_URING_SQPOLL
265
+ #define UV_LOOP_USE_IO_URING_SQPOLL UV_LOOP_USE_IO_URING_SQPOLL
264
266
  } uv_loop_option;
265
267
 
266
268
  typedef enum {
@@ -604,7 +606,18 @@ UV_EXTERN int uv_tcp_simultaneous_accepts(uv_tcp_t* handle, int enable);
604
606
 
605
607
  enum uv_tcp_flags {
606
608
  /* Used with uv_tcp_bind, when an IPv6 address is used. */
607
- UV_TCP_IPV6ONLY = 1
609
+ UV_TCP_IPV6ONLY = 1,
610
+
611
+ /* Enable SO_REUSEPORT socket option when binding the handle.
612
+ * This allows completely duplicate bindings by multiple processes
613
+ * or threads if they all set SO_REUSEPORT before binding the port.
614
+ * Incoming connections are distributed across the participating
615
+ * listener sockets.
616
+ *
617
+ * This flag is available only on Linux 3.9+, DragonFlyBSD 3.6+,
618
+ * FreeBSD 12.0+, Solaris 11.4, and AIX 7.2.5+ for now.
619
+ */
620
+ UV_TCP_REUSEPORT = 2,
608
621
  };
609
622
 
610
623
  UV_EXTERN int uv_tcp_bind(uv_tcp_t* handle,
@@ -645,10 +658,13 @@ enum uv_udp_flags {
645
658
  UV_UDP_PARTIAL = 2,
646
659
  /*
647
660
  * Indicates if SO_REUSEADDR will be set when binding the handle.
648
- * This sets the SO_REUSEPORT socket flag on the BSDs and OS X. On other
649
- * Unix platforms, it sets the SO_REUSEADDR flag. What that means is that
650
- * multiple threads or processes can bind to the same address without error
651
- * (provided they all set the flag) but only the last one to bind will receive
661
+ * This sets the SO_REUSEPORT socket flag on the BSDs (except for
662
+ * DragonFlyBSD), OS X, and other platforms where SO_REUSEPORTs don't
663
+ * have the capability of load balancing, as the opposite of what
664
+ * UV_UDP_REUSEPORT would do. On other Unix platforms, it sets the
665
+ * SO_REUSEADDR flag. What that means is that multiple threads or
666
+ * processes can bind to the same address without error (provided
667
+ * they all set the flag) but only the last one to bind will receive
652
668
  * any traffic, in effect "stealing" the port from the previous listener.
653
669
  */
654
670
  UV_UDP_REUSEADDR = 4,
@@ -671,6 +687,18 @@ enum uv_udp_flags {
671
687
  * This flag is no-op on platforms other than Linux.
672
688
  */
673
689
  UV_UDP_LINUX_RECVERR = 32,
690
+ /*
691
+ * Indicates if SO_REUSEPORT will be set when binding the handle.
692
+ * This sets the SO_REUSEPORT socket option on supported platforms.
693
+ * Unlike UV_UDP_REUSEADDR, this flag will make multiple threads or
694
+ * processes that are binding to the same address and port "share"
695
+ * the port, which means incoming datagrams are distributed across
696
+ * the receiving sockets among threads or processes.
697
+ *
698
+ * This flag is available only on Linux 3.9+, DragonFlyBSD 3.6+,
699
+ * FreeBSD 12.0+, Solaris 11.4, and AIX 7.2.5+ for now.
700
+ */
701
+ UV_UDP_REUSEPORT = 64,
674
702
  /*
675
703
  * Indicates that recvmmsg should be used, if available.
676
704
  */
@@ -1903,17 +1931,17 @@ struct uv_loop_s {
1903
1931
  UV_EXTERN void* uv_loop_get_data(const uv_loop_t*);
1904
1932
  UV_EXTERN void uv_loop_set_data(uv_loop_t*, void* data);
1905
1933
 
1906
- /* String utilities needed internally for dealing with Windows. */
1907
- size_t uv_utf16_length_as_wtf8(const uint16_t* utf16,
1908
- ssize_t utf16_len);
1909
- int uv_utf16_to_wtf8(const uint16_t* utf16,
1910
- ssize_t utf16_len,
1911
- char** wtf8_ptr,
1912
- size_t* wtf8_len_ptr);
1913
- ssize_t uv_wtf8_length_as_utf16(const char* wtf8);
1914
- void uv_wtf8_to_utf16(const char* wtf8,
1915
- uint16_t* utf16,
1916
- size_t utf16_len);
1934
+ /* Unicode utilities needed for dealing with Windows. */
1935
+ UV_EXTERN size_t uv_utf16_length_as_wtf8(const uint16_t* utf16,
1936
+ ssize_t utf16_len);
1937
+ UV_EXTERN int uv_utf16_to_wtf8(const uint16_t* utf16,
1938
+ ssize_t utf16_len,
1939
+ char** wtf8_ptr,
1940
+ size_t* wtf8_len_ptr);
1941
+ UV_EXTERN ssize_t uv_wtf8_length_as_utf16(const char* wtf8);
1942
+ UV_EXTERN void uv_wtf8_to_utf16(const char* wtf8,
1943
+ uint16_t* utf16,
1944
+ size_t utf16_len);
1917
1945
 
1918
1946
  /* Don't export the private CPP symbols. */
1919
1947
  #undef UV_HANDLE_TYPE_PRIVATE
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "node-aix-ppc64",
3
- "version": "v22.11.0",
3
+ "version": "v22.12.0",
4
4
  "description": "node",
5
5
  "bin": {
6
6
  "node": "bin/node"