Home
last modified time | relevance | path

Searched refs:node (Results 1251 - 1275 of 2502) sorted by relevance

1...<<51525354555657585960>>...101

/third_party/node/src/
H A Dcares_wrap.h12 #include "node.h"
28 namespace node { namespace
85 dest->h_name = node::Malloc<char>(name_size); in cares_wrap_hostent_cpy()
95 dest->h_aliases = node::Malloc<char*>(alias_count + 1); in cares_wrap_hostent_cpy()
98 dest->h_aliases[i] = node::Malloc(cur_alias_size); in cares_wrap_hostent_cpy()
110 dest->h_addr_list = node::Malloc<char*>(list_count + 1); in cares_wrap_hostent_cpy()
112 dest->h_addr_list[i] = node::Malloc(src->h_length); in cares_wrap_hostent_cpy()
315 buf_copy = node::Malloc<unsigned char>(answer_len); in Callback()
338 host_copy = node::Malloc<hostent>(1); in Callback()
520 } // namespace node
[all...]
H A Dudp_wrap.cc31 namespace node { namespace
273 node::Utf8Value address(args.GetIsolate(), args[0]); in DoBind()
302 node::Utf8Value address(args.GetIsolate(), args[0]); in DoConnect()
426 node::Utf8Value address(args.GetIsolate(), args[0]); in SetMembership()
427 node::Utf8Value iface(args.GetIsolate(), args[1]); in SetMembership()
460 node::Utf8Value source_address(args.GetIsolate(), args[0]); in SetSourceMembership()
461 node::Utf8Value group_address(args.GetIsolate(), args[1]); in SetSourceMembership()
462 node::Utf8Value iface(args.GetIsolate(), args[2]); in SetSourceMembership()
536 node::Utf8Value address(env->isolate(), args[4]); in DoSend()
807 } // namespace node
[all...]
H A Dcleanup_queue.h13 namespace node { namespace
27 inline void MemoryInfo(node::MemoryTracker* tracker) const override;
81 } // namespace node
H A Dnode_main.cc22 #include "node.h"
87 return node::Start(argc, argv); in wmain()
93 return node::Start(argc, argv); in main()
H A Dnode_util.h10 namespace node { namespace
31 struct InternalFieldInfo : public node::InternalFieldInfoBase {
48 } // namespace node
H A Dtimer_wrap.h12 namespace node { namespace
70 void MemoryInfo(node::MemoryTracker* tracker) const override;
81 } // namespace node
/third_party/nghttp2/doc/_exts/rubydomain/
H A Drubydomain.py410 node = nodes.paragraph()
411 node += nodes.emphasis('', _('Platforms: '))
412 node += nodes.Text(platform, platform)
413 ret.append(node)
670 typ, target, node, contnode):
684 modname = node.get('rb:module')
685 clsname = node.get('rb:class')
686 searchorder = node.hasattr('refspecific') and 1 or 0
/third_party/node/deps/v8/src/ast/
H A Dast-traversal-visitor.h21 // It invokes VisitNode on each AST node, before proceeding with its subtrees.
22 // It invokes VisitExpression (after VisitNode) on each AST node that is an
41 bool VisitNode(AstNode* node) { return true; } in VisitNode() argument
42 bool VisitExpression(Expression* node) { return true; } in VisitExpression() argument
49 #define DECLARE_VISIT(type) void Visit##type(type* node);
66 #define PROCESS_NODE(node) do { \
67 if (!(this->impl()->VisitNode(node))) return; \
70 #define PROCESS_EXPRESSION(node) do { \
71 PROCESS_NODE(node); \
72 if (!(this->impl()->VisitExpression(node))) retur
[all...]
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-code-generator.cc101 void Process(NodeT* node, const ProcessingState& state) { in Process() argument
104 ss << "-- " << graph_labeller()->NodeId(node) << ": " in Process()
105 << PrintNode(graph_labeller(), node); in Process() local
109 // Emit Phi moves before visiting the control node. in Process()
111 EmitBlockEndGapMoves(node->template Cast<UnconditionalControlNode>(), in Process()
115 node->GenerateCode(code_gen_state_, state); in Process()
118 ValueNode* value_node = node->template Cast<ValueNode>(); in Process()
225 void EmitBlockEndGapMoves(UnconditionalControlNode* node, in EmitBlockEndGapMoves() argument
227 BasicBlock* target = node->target(); in EmitBlockEndGapMoves()
/third_party/skia/third_party/externals/swiftshader/src/OpenGL/compiler/
H A Dintermediate.h20 // TIntermNode. Each is a node in a tree. There is no preset branching factor;
21 // each node can have it's own type of list of children.
35 EOpNull, // if in a node, should only mean a node is still being built
457 // Intermediate class for node types that hold operators.
556 for(TIntermNode *node : sequence)
558 if(!node->getAsTyped() || node->getAsTyped()->getQualifier() != EvqConstExpr)
584 for(TIntermNode *node : sequence) in isConstantFoldable()
586 if(!node in isConstantFoldable()
751 TIntermAggregate *node; global() member
[all...]
/third_party/selinux/libsepol/src/
H A Dkernel_to_common.c365 struct ebitmap_node *node; in ebitmap_to_strs() local
369 ebitmap_for_each_positive_bit(map, node, i) { in ebitmap_to_strs()
506 rc = memcmp(&(*aa)->u.node.mask, &(*bb)->u.node.mask, sizeof((*aa)->u.node.mask)); in node_data_cmp()
513 return memcmp(&(*aa)->u.node.addr, &(*bb)->u.node.addr, sizeof((*aa)->u.node.addr)); in node_data_cmp()
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_shader.cpp479 foreach_list_typed(nir_cf_node, node, node, &func->impl->body) { in process()
480 if (!process_cf_node(node)) in process()
622 bool Shader::process_cf_node(nir_cf_node *node) in process_cf_node() argument
626 switch (node->type) { in process_cf_node()
628 return process_block(nir_cf_node_as_block(node)); in process_cf_node()
630 return process_if(nir_cf_node_as_if(node)); in process_cf_node()
632 return process_loop(nir_cf_node_as_loop(node)); in process_cf_node()
647 foreach_list_typed(nir_cf_node, n, node, &list) { in child_block_empty()
666 foreach_list_typed(nir_cf_node, n, node, in process_if()
725 process_loop(nir_loop *node) process_loop() argument
[all...]
/third_party/mesa3d/src/panfrost/midgard/
H A Dmidgard_ra.c108 set_class(unsigned *classes, unsigned node, unsigned class) in set_class() argument
110 if (node < SSA_FIXED_MINIMUM && class != classes[node]) { in set_class()
111 assert(classes[node] == REG_CLASS_WORK); in set_class()
112 classes[node] = class; in set_class()
120 check_read_class(unsigned *classes, unsigned tag, unsigned node) in check_read_class() argument
123 if (node >= SSA_FIXED_MINIMUM) in check_read_class()
126 switch (classes[node]) { in check_read_class()
141 check_write_class(unsigned *classes, unsigned tag, unsigned node) in check_write_class() argument
144 if (node > in check_write_class()
165 mark_node_class(unsigned *bitfield, unsigned node) mark_node_class() argument
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dwasm-compiler.h300 bool ThrowsException(Node* node, Node** if_success, Node** if_exception);
323 void TrapIfEq32(wasm::TrapReason reason, Node* node, int32_t val,
325 void ZeroCheck32(wasm::TrapReason reason, Node* node,
327 void TrapIfEq64(wasm::TrapReason reason, Node* node, int64_t val,
329 void ZeroCheck64(wasm::TrapReason reason, Node* node,
349 // real arguments for this call. This signature gets stored in the Call node
377 Node* Invert(Node* node);
413 static void PrintDebugName(Node* node);
417 Node* SetEffect(Node* node);
418 Node* SetControl(Node* node);
[all...]
H A Dsimplified-operator-reducer.h42 Reduction Reduce(Node* node) final;
45 Reduction Change(Node* node, const Operator* op, Node* a);
/third_party/toybox/toys/pending/
H A Ddiff.c469 static int skip(struct dirtree *node) in skip() argument
472 char *tmp = NULL, *ptr, *f_path = dirtree_path(node, NULL); in skip()
487 static void add_to_list(struct dirtree *node) in add_to_list() argument
494 full_path = dirtree_path(node, NULL); in add_to_list()
498 static int list_dir (struct dirtree *node) in list_dir() argument
502 if (!dirtree_notdotdot(node)) return 0; in list_dir()
504 if (S_ISDIR(node->st.st_mode) && !node->parent) { //add root dirs. in list_dir()
505 add_to_list(node); in list_dir()
509 if (S_ISDIR(node in list_dir()
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil.c383 CIL_KEY_NODE = cil_strpool_add("<node>"); in cil_init_keys()
1111 const char * cil_node_to_string(struct cil_tree_node *node) in cil_node_to_string() argument
1113 switch (node->flavor) { in cil_node_to_string()
1155 switch (((struct cil_condblock*)node->data)->flavor) { in cil_node_to_string()
1265 switch (((struct cil_avrule *)node->data)->rule_kind) { in cil_node_to_string()
1279 switch (((struct cil_avrule *)node->data)->rule_kind) { in cil_node_to_string()
1297 switch (((struct cil_type_rule *)node->data)->rule_kind) { in cil_node_to_string()
1482 struct cil_tree_node *node; in cil_cats_to_ebitmap() local
1490 node = NODE(i->data); in cil_cats_to_ebitmap()
1491 if (node in cil_cats_to_ebitmap()
1959 struct cil_tree_node *node = ast_node; cil_get_symtab() local
[all...]
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3.h492 struct list_head node; member
555 struct list_head node; member
591 struct list_head node; member
663 return list_first_entry(&ir->block_list, struct ir3_block, node); in ir3_start_block()
764 list_delinit(&instr->node); in ir3_instr_move_before()
765 list_addtail(&instr->node, &after->node); in ir3_instr_move_before()
775 list_delinit(&instr->node); in ir3_instr_move_after()
776 list_add(&instr->node, &before->node); in ir3_instr_move_after()
[all...]
H A Dir3_sched.c159 /* This node represents a shader output. A semi-common pattern in
217 /* The sched node is only valid within the same block, we cannot in is_outstanding_sy()
233 /* The sched node is only valid within the same block, we cannot in is_outstanding_ss()
268 list_delinit(&instr->node); in schedule()
289 list_addtail(&instr->node, &instr->block->instr_list); in schedule()
1143 sched_dag_max_delay_cb(struct dag_node *node, void *state) in sched_dag_max_delay_cb() argument
1145 struct ir3_sched_node *n = (struct ir3_sched_node *)node; in sched_dag_max_delay_cb()
1272 list_delinit(&new_instr->node); in sched_block()
1273 list_addtail(&new_instr->node, &ctx->unscheduled_list); in sched_block()
1365 struct list_head *prev = instr->node in add_barrier_deps()
[all...]
/third_party/skia/src/utils/
H A DSkPolyUtils.cpp297 static void remove_node(const OffsetEdge* node, OffsetEdge** head) { in remove_node() argument
299 node->fPrev->fNext = node->fNext; in remove_node()
300 node->fNext->fPrev = node->fPrev; in remove_node()
301 if (node == *head) { in remove_node()
302 *head = (node->fNext == node) ? nullptr : node->fNext; in remove_node()
726 // insert new node a in insert()
985 IsRed(const ActiveEdge* node) IsRed() argument
989 SingleRotation(ActiveEdge* node, int dir) SingleRotation() argument
1001 DoubleRotation(ActiveEdge* node, int dir) DoubleRotation() argument
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_divergence_analysis.c1050 foreach_list_typed(nir_cf_node, node, node, list) { in visit_cf_list()
1051 switch (node->type) { in visit_cf_list()
1053 has_changed |= visit_block(nir_cf_node_as_block(node), state); in visit_cf_list()
1056 has_changed |= visit_if(nir_cf_node_as_if(node), state); in visit_cf_list()
1059 has_changed |= visit_loop(nir_cf_node_as_loop(node), state); in visit_cf_list()
1113 foreach_list_typed(nir_cf_node, node, node, &func->body) { in nir_has_divergent_loop()
1114 if (node->type == nir_cf_node_loop && nir_cf_node_as_loop(node) in nir_has_divergent_loop()
[all...]
/third_party/node/test/parallel/
H A Dtest-domain-nested-throw.js34 const node = process.execPath;
37 const child = spawn(node, [__filename, 'child'], opt);
/third_party/node/src/permission/
H A Dpermission.h17 namespace node { namespace
26 node::permission::Permission::ThrowAccessDenied( \
68 } // namespace node
/third_party/node/test/addons/buffer-free-callback/
H A Dbinding.cc1 #include <node.h>
24 args.GetReturnValue().Set(node::Buffer::New( in Alloc()
/third_party/node/tools/msvs/
H A Dnodevars.bat10 set print_version=.\node.exe -p -e "process.versions.node + ' (' + process.arch + ')'"

Completed in 25 milliseconds

1...<<51525354555657585960>>...101