Home
last modified time | relevance | path

Searched refs:node (Results 176 - 200 of 2502) sorted by relevance

12345678910>>...101

/third_party/eudev/src/udev/
H A Dudevadm-hwdb.c55 /* prefix, common part for all children of this node */
86 static int node_add_child(struct trie *trie, struct trie_node *node, struct trie_node *node_child, uint8_t c) { in node_add_child() argument
90 child = realloc(node->children, (node->children_count + 1) * sizeof(struct trie_child_entry)); in node_add_child()
94 node->children = child; in node_add_child()
96 node->children[node->children_count].c = c; in node_add_child()
97 node->children[node->children_count].child = node_child; in node_add_child()
98 node in node_add_child()
105 node_lookup(const struct trie_node *node, uint8_t c) node_lookup() argument
116 trie_node_cleanup(struct trie_node *node) trie_node_cleanup() argument
141 trie_node_add_value(struct trie *trie, struct trie_node *node, const char *key, const char *value) trie_node_add_value() argument
181 trie_insert(struct trie *trie, struct trie_node *node, const char *search, const char *key, const char *value) trie_insert() argument
279 trie_store_nodes_size(struct trie_f *trie, struct trie_node *node) trie_store_nodes_size() argument
292 trie_store_nodes(struct trie_f *trie, struct trie_node *node) trie_store_nodes() argument
[all...]
/third_party/glslang/glslang/MachineIndependent/
H A DpropagateNoContraction.cpp78 // A helper function to tell whether a node is 'noContraction'. Returns true if
79 // the node has 'noContraction' qualifier, otherwise false.
80 bool isPreciseObjectNode(glslang::TIntermTyped* node) in isPreciseObjectNode() argument
82 return node->getType().getQualifier().isNoContraction(); in isPreciseObjectNode()
130 // A helper function to get the unsigned int from a given constant union node.
131 // Note the node should only hold a uint scalar.
132 unsigned getStructIndexFromConstantUnion(glslang::TIntermTyped* node) in getStructIndexFromConstantUnion() argument
134 assert(node->getAsConstantUnion() && node->getAsConstantUnion()->isScalar()); in getStructIndexFromConstantUnion()
135 unsigned struct_dereference_index = node in getStructIndexFromConstantUnion()
140 generateSymbolLabel(glslang::TIntermSymbol* node) generateSymbolLabel() argument
284 visitSymbol(glslang::TIntermSymbol* node) visitSymbol() argument
291 visitAggregate(glslang::TVisit, glslang::TIntermAggregate* node) visitAggregate() argument
313 visitBranch(glslang::TVisit, glslang::TIntermBranch* node) visitBranch() argument
329 visitUnary(glslang::TVisit , glslang::TIntermUnary* node) visitUnary() argument
359 visitBinary(glslang::TVisit , glslang::TIntermBinary* node) visitBinary() argument
485 getPrecisenessAndRemainedAccessChain(glslang::TIntermOperator* node, const ObjectAccessChain& precise_object) getPrecisenessAndRemainedAccessChain() argument
571 visitBinary(glslang::TVisit, glslang::TIntermBinary* node) visitBinary() argument
597 visitSymbol(glslang::TIntermSymbol* node) visitSymbol() argument
[all...]
/third_party/backends/backend/escl/
H A Descl_capabilities.c173 * \fn static int find_nodes_c(xmlNode *node)
174 * \brief Function that browses the xml file and parses it, to find the xml children node.
177 * \return 0 if a xml child node is found, 1 otherwise
180 find_nodes_c(xmlNode *node) in find_nodes_c() argument
182 xmlNode *child = node->children; in find_nodes_c()
193 * \fn static int find_valor_of_array_variables(xmlNode *node, capabilities_t *scanner)
200 find_valor_of_array_variables(xmlNode *node, capabilities_t *scanner, int type) in find_valor_of_array_variables() argument
202 const char *name = (const char *)node->name; in find_valor_of_array_variables()
204 const char *color = (SANE_String_Const)xmlNodeGetContent(node); in find_valor_of_array_variables()
206 scanner->caps[type].ColorModes = char_to_array(scanner->caps[type].ColorModes, &scanner->caps[type].ColorModesSize, (SANE_String_Const)xmlNodeGetContent(node), in find_valor_of_array_variables()
276 find_value_of_int_variables(xmlNode *node, capabilities_t *scanner, int type) find_value_of_int_variables() argument
313 print_support(xmlNode *node) print_support() argument
351 find_struct_variables(xmlNode *node, capabilities_t *scanner) find_struct_variables() argument
386 find_true_variables(xmlNode *node, capabilities_t *scanner, int type) find_true_variables() argument
426 print_xml_c(xmlNode *node, ESCL_Device *device, capabilities_t *scanner, int type) print_xml_c() argument
539 xmlNode *node = NULL; escl_capabilities() local
[all...]
H A Descl_status.c66 * \fn static int find_nodes_s(xmlNode *node)
67 * \brief Function that browses the xml file and parses it, to find the xml children node.
70 * \return 0 if a xml child node is found, 1 otherwise
73 find_nodes_s(xmlNode *node) in find_nodes_s() argument
75 xmlNode *child = node->children; in find_nodes_s()
86 print_xml_job_status(xmlNode *node, in print_xml_job_status() argument
90 while (node) { in print_xml_job_status()
91 if (node->type == XML_ELEMENT_NODE) { in print_xml_job_status()
92 if (find_nodes_s(node)) { in print_xml_job_status()
93 if (strcmp((const char *)node in print_xml_job_status()
116 print_xml_platen_and_adf_status(xmlNode *node, SANE_Status *platen, SANE_Status *adf, const char* jobId, SANE_Status *job, int *image) print_xml_platen_and_adf_status() argument
202 xmlNode *node = NULL; escl_status() local
[all...]
/third_party/mesa3d/src/mesa/vbo/
H A Dvbo_save_draw.c99 const struct vbo_save_vertex_list *node) in playback_copy_to_current()
101 if (!node->cold->current_data) in playback_copy_to_current()
104 fi_type *data = node->cold->current_data; in playback_copy_to_current()
108 copy_vao(ctx, node->cold->VAO[VP_MODE_SHADER], ~VERT_BIT_POS & VERT_BIT_ALL, in playback_copy_to_current()
111 copy_vao(ctx, node->cold->VAO[VP_MODE_FF], VERT_BIT_MAT_ALL, in playback_copy_to_current()
121 if (node->cold->prim_count) { in playback_copy_to_current()
122 const struct _mesa_prim *prim = &node->cold->prims[node->cold->prim_count - 1]; in playback_copy_to_current()
137 const struct vbo_save_vertex_list *node) in bind_vertex_list()
140 _mesa_set_draw_vao(ctx, node in bind_vertex_list()
98 playback_copy_to_current(struct gl_context *ctx, const struct vbo_save_vertex_list *node) playback_copy_to_current() argument
136 bind_vertex_list(struct gl_context *ctx, const struct vbo_save_vertex_list *node) bind_vertex_list() argument
163 const struct vbo_save_vertex_list *node = vbo_save_playback_vertex_list_loopback() local
188 vbo_save_playback_vertex_list_gallium(struct gl_context *ctx, const struct vbo_save_vertex_list *node, bool copy_to_current) vbo_save_playback_vertex_list_gallium() argument
301 const struct vbo_save_vertex_list *node = vbo_save_playback_vertex_list() local
[all...]
/third_party/python/Lib/
H A Dgraphlib.py10 __slots__ = "node", "npredecessors", "successors"
12 def __init__(self, node):
13 # The node this class is augmenting.
14 self.node = node
18 # node is marked done by a call to done(), set to _NODE_DONE.
33 of nodes, such that each node is, in the graph, an immediate predecessor of the
34 next node in the list. In the reported list, the first and the last node will be
51 for node, predecessor
[all...]
/third_party/node/deps/v8/src/compiler/
H A Descape-analysis-reducer.cc8 #include "src/compiler/node-matchers.h"
78 Node* node = jsgraph()->graph()->NewNode(jsgraph()->common()->ObjectId(id)); in ObjectIdNode() local
79 NodeProperties::SetType(node, Type::Object()); in ObjectIdNode()
80 object_id_cache_[id] = node; in ObjectIdNode()
85 Reduction EscapeAnalysisReducer::Reduce(Node* node) { in Reduce() argument
86 if (Node* replacement = analysis_result().GetReplacementOf(node)) { in Reduce()
87 DCHECK(node->opcode() != IrOpcode::kAllocate && in Reduce()
88 node->opcode() != IrOpcode::kFinishRegion); in Reduce()
89 DCHECK_NE(replacement, node); in Reduce()
90 return ReplaceNode(node, replacemen in Reduce()
144 ReduceFrameStateInputs(Node* node) ReduceFrameStateInputs() argument
157 ReduceDeoptState(Node* node, Node* effect, Deduplicator* deduplicator) ReduceDeoptState() argument
363 Query(Node* node) Query() argument
399 Node* node; Get() local
[all...]
H A Dcontrol-equivalence.h11 #include "src/compiler/node.h"
43 // Run the main algorithm starting from the {exit} control node. This causes
52 size_t ClassOf(Node* node) { in ClassOf() argument
53 DCHECK_NE(kInvalidClass, GetClass(node)); in ClassOf()
54 return GetClass(node); in ClassOf()
69 // The set of brackets for each node during the DFS walk.
76 Node* parent_node; // Parent node of entry during DFS walk.
77 Node* node; // Node that this stack entry belongs to. member
90 size_t class_number; // Equivalence class number assigned to node.
91 BracketList blist; // List of brackets per node
131 GetData(Node* node) GetData() argument
136 AllocateData(Node* node) AllocateData() argument
145 Participates(Node* node) Participates() argument
148 GetClass(Node* node) GetClass() argument
149 SetClass(Node* node, size_t number) SetClass() argument
155 GetBracketList(Node* node) GetBracketList() argument
159 SetBracketList(Node* node, BracketList& list) SetBracketList() argument
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/utils/
H A Dxml_libxml2.c53 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node, in xml_validate() argument
70 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); in xml_validate()
115 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node, in xml_validate_dtd() argument
131 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); in xml_validate_dtd()
167 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node) in xml_node_free() argument
169 xmlFreeNode((xmlNodePtr) node); in xml_node_free()
173 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node) in xml_node_get_parent() argument
175 return (xml_node_t *) ((xmlNodePtr) node)->parent; in xml_node_get_parent()
182 xmlNodePtr node; in xml_node_from_buf() local
187 node in xml_node_from_buf()
195 xml_node_get_localname(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_get_localname() argument
202 xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_to_str() argument
245 xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_detach() argument
262 xmlNodePtr node; xml_node_create_root() local
284 xmlNodePtr node; xml_node_create() local
295 xmlNodePtr node; xml_node_create_text() local
306 xmlNodePtr node; xml_node_create_text_ns() local
317 xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node, const char *value) xml_node_set_text() argument
325 xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node, xml_namespace_t *ns, const char *name, const char *value) xml_node_add_attr() argument
343 xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, char *name) xml_node_get_attr_value() argument
351 xml_node_get_attr_value_ns(struct xml_node_ctx *ctx, xml_node_t *node, const char *ns_uri, char *name) xml_node_get_attr_value_ns() argument
373 xml_node_next_sibling(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_next_sibling() argument
380 xml_node_is_element(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_is_element() argument
386 xml_node_get_text(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_get_text() argument
401 xml_node_get_base64_text(struct xml_node_ctx *ctx, xml_node_t *node, int *ret_len) xml_node_get_base64_text() argument
429 xml_node_copy(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_copy() argument
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/utils/
H A Dxml_libxml2.c53 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node, in xml_validate() argument
70 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); in xml_validate()
115 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node, in xml_validate_dtd() argument
131 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); in xml_validate_dtd()
167 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node) in xml_node_free() argument
169 xmlFreeNode((xmlNodePtr) node); in xml_node_free()
173 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node) in xml_node_get_parent() argument
175 return (xml_node_t *) ((xmlNodePtr) node)->parent; in xml_node_get_parent()
182 xmlNodePtr node; in xml_node_from_buf() local
187 node in xml_node_from_buf()
195 xml_node_get_localname(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_get_localname() argument
202 xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_to_str() argument
245 xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_detach() argument
262 xmlNodePtr node; xml_node_create_root() local
284 xmlNodePtr node; xml_node_create() local
295 xmlNodePtr node; xml_node_create_text() local
306 xmlNodePtr node; xml_node_create_text_ns() local
317 xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node, const char *value) xml_node_set_text() argument
325 xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node, xml_namespace_t *ns, const char *name, const char *value) xml_node_add_attr() argument
343 xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, char *name) xml_node_get_attr_value() argument
351 xml_node_get_attr_value_ns(struct xml_node_ctx *ctx, xml_node_t *node, const char *ns_uri, char *name) xml_node_get_attr_value_ns() argument
373 xml_node_next_sibling(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_next_sibling() argument
380 xml_node_is_element(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_is_element() argument
386 xml_node_get_text(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_get_text() argument
401 xml_node_get_base64_text(struct xml_node_ctx *ctx, xml_node_t *node, int *ret_len) xml_node_get_base64_text() argument
429 xml_node_copy(struct xml_node_ctx *ctx, xml_node_t *node) xml_node_copy() argument
[all...]
/third_party/node/deps/v8/third_party/jinja2/
H A Dparser.py219 node = result = nodes.If(lineno=self.stream.expect("name:if").lineno)
221 node.test = self.parse_tuple(with_condexpr=False)
222 node.body = self.parse_statements(("name:elif", "name:else", "name:endif"))
223 node.elif_ = []
224 node.else_ = []
227 node = nodes.If(lineno=self.stream.current.lineno)
228 result.elif_.append(node)
236 node = nodes.With(lineno=next(self.stream).lineno)
247 node.targets = targets
248 node
[all...]
/third_party/node/tools/inspector_protocol/jinja2/
H A Dparser.py209 node = result = nodes.If(lineno=self.stream.expect('name:if').lineno)
211 node.test = self.parse_tuple(with_condexpr=False)
212 node.body = self.parse_statements(('name:elif', 'name:else',
214 node.elif_ = []
215 node.else_ = []
218 node = nodes.If(lineno=self.stream.current.lineno)
219 result.elif_.append(node)
228 node = nodes.With(lineno=next(self.stream).lineno)
240 node.targets = targets
241 node
[all...]
/third_party/skia/third_party/externals/jinja2/
H A Dparser.py219 node = result = nodes.If(lineno=self.stream.expect("name:if").lineno)
221 node.test = self.parse_tuple(with_condexpr=False)
222 node.body = self.parse_statements(("name:elif", "name:else", "name:endif"))
223 node.elif_ = []
224 node.else_ = []
227 node = nodes.If(lineno=self.stream.current.lineno)
228 result.elif_.append(node)
236 node = nodes.With(lineno=next(self.stream).lineno)
247 node.targets = targets
248 node
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dcodegen.c88 gpir_node *node = instr->slots[GPIR_INSTR_SLOT_MUL0]; in gpir_codegen_mul0_slot() local
90 if (!node) { in gpir_codegen_mul0_slot()
96 gpir_alu_node *alu = gpir_node_to_alu(node); in gpir_codegen_mul0_slot()
98 switch (node->op) { in gpir_codegen_mul0_slot()
100 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]); in gpir_codegen_mul0_slot()
101 code->mul0_src1 = gpir_get_alu_input(node, alu->children[1]); in gpir_codegen_mul0_slot()
119 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]); in gpir_codegen_mul0_slot()
124 code->mul0_src0 = gpir_get_alu_input(node, alu->children[0]); in gpir_codegen_mul0_slot()
125 code->mul0_src1 = gpir_get_alu_input(node, alu->children[1]); in gpir_codegen_mul0_slot()
130 code->mul0_src0 = gpir_get_alu_input(node, al in gpir_codegen_mul0_slot()
148 gpir_node *node = instr->slots[GPIR_INSTR_SLOT_MUL1]; gpir_codegen_mul1_slot() local
200 gpir_node *node = instr->slots[GPIR_INSTR_SLOT_ADD0]; gpir_codegen_add0_slot() local
285 gpir_node *node = instr->slots[GPIR_INSTR_SLOT_ADD1]; gpir_codegen_add1_slot() local
370 gpir_node *node = instr->slots[GPIR_INSTR_SLOT_COMPLEX]; gpir_codegen_complex_slot() local
415 gpir_node *node = instr->slots[GPIR_INSTR_SLOT_PASS]; gpir_codegen_pass_slot() local
486 gpir_get_store_input(gpir_node *node) gpir_get_store_input() argument
505 gpir_node *node = instr->slots[GPIR_INSTR_SLOT_STORE0]; gpir_codegen_store_slot() local
[all...]
H A Doptimize.c73 gpir_node *node = list_first_entry(&block->node_list, gpir_node, list); in optimize_branches() local
74 if (node->op != gpir_op_branch_uncond) in optimize_branches()
77 gpir_block *target = gpir_node_to_branch(node)->dest; in optimize_branches()
104 gpir_node_add_dep(&cond->node, cond->children[0], GPIR_DEP_INPUT); in optimize_branches()
105 list_addtail(&cond->node.list, &prev_block_last->list); in optimize_branches()
106 gpir_node_insert_child(prev_block_last, prev_branch->cond, &cond->node); in optimize_branches()
111 list_del(&node->list); in optimize_branches()
120 list_for_each_entry_rev(gpir_node, node, &block->node_list, list) { in optimize_not()
121 if (node->op != gpir_op_not) in optimize_not()
124 gpir_alu_node *alu = gpir_node_to_alu(node); in optimize_not()
[all...]
H A Dregalloc.c60 static void propagate_liveness_node(gpir_node *node, BITSET_WORD *live, in propagate_liveness_node() argument
64 if (node->type == gpir_node_type_store) { in propagate_liveness_node()
65 if (node->op == gpir_op_store_reg) { in propagate_liveness_node()
66 gpir_store_node *store = gpir_node_to_store(node); in propagate_liveness_node()
72 if (node->type == gpir_node_type_load) { in propagate_liveness_node()
73 if (node->op == gpir_op_load_reg) { in propagate_liveness_node()
74 gpir_load_node *load = gpir_node_to_load(node); in propagate_liveness_node()
91 list_for_each_entry_rev(gpir_node, node, &block->node_list, list) { in propagate_liveness_block()
92 propagate_liveness_node(node, ctx->live, block->comp); in propagate_liveness_block()
105 list_for_each_entry(gpir_node, node, in calc_def_block()
415 add_fake_dep(gpir_node *node, gpir_node *src, struct value_regalloc_ctx *ctx) add_fake_dep() argument
442 handle_value_read(gpir_node *node, gpir_node *src, struct value_regalloc_ctx *ctx) handle_value_read() argument
507 handle_value_write(gpir_node *node, struct value_regalloc_ctx *ctx) handle_value_write() argument
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_parser.c76 static void create_node(struct cil_tree_node **node, struct cil_tree_node *current, uint32_t line, uint32_t hll_offset, void *value) in create_node() argument
78 cil_tree_node_init(node); in create_node()
79 (*node)->parent = current; in create_node()
80 (*node)->flavor = CIL_NODE; in create_node()
81 (*node)->line = line; in create_node()
82 (*node)->hll_offset = hll_offset; in create_node()
83 (*node)->data = value; in create_node()
86 static void insert_node(struct cil_tree_node *node, struct cil_tree_node *current) in insert_node() argument
89 current->cl_head = node; in insert_node()
91 current->cl_tail->next = node; in insert_node()
99 struct cil_tree_node *node; add_hll_linemark() local
195 struct cil_tree_node *node; add_cil_path() local
220 struct cil_tree_node *node = NULL; cil_parser() local
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DOutputGLSLBase.cpp23 bool isSingleStatement(TIntermNode *node) in isSingleStatement() argument
25 if (node->getAsFunctionDefinition()) in isSingleStatement()
29 else if (node->getAsBlock()) in isSingleStatement()
33 else if (node->getAsIfElseNode()) in isSingleStatement()
37 else if (node->getAsLoopNode()) in isSingleStatement()
41 else if (node->getAsSwitchNode()) in isSingleStatement()
45 else if (node->getAsCaseNode()) in isSingleStatement()
49 else if (node->getAsPreprocessorDirective()) in isSingleStatement()
542 void TOutputGLSLBase::visitSymbol(TIntermSymbol *node) in visitSymbol() argument
545 out << hashName(&node in visitSymbol()
551 visitConstantUnion(TIntermConstantUnion *node) visitConstantUnion() argument
556 visitSwizzle(Visit visit, TIntermSwizzle *node) visitSwizzle() argument
567 visitBinary(Visit visit, TIntermBinary *node) visitBinary() argument
732 visitUnary(Visit visit, TIntermUnary *node) visitUnary() argument
782 visitTernary(Visit visit, TIntermTernary *node) visitTernary() argument
799 visitIfElse(Visit visit, TIntermIfElse *node) visitIfElse() argument
817 visitSwitch(Visit visit, TIntermSwitch *node) visitSwitch() argument
825 visitCase(Visit visit, TIntermCase *node) visitCase() argument
840 visitBlock(Visit visit, TIntermBlock *node) visitBlock() argument
871 visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) visitFunctionDefinition() argument
881 visitGlobalQualifierDeclaration(Visit visit, TIntermGlobalQualifierDeclaration *node) visitGlobalQualifierDeclaration() argument
891 visitFunctionPrototype(TIntermFunctionPrototype *node) visitFunctionPrototype() argument
907 visitAggregate(Visit visit, TIntermAggregate *node) visitAggregate() argument
938 visitDeclaration(Visit visit, TIntermDeclaration *node) visitDeclaration() argument
980 visitLoop(Visit visit, TIntermLoop *node) visitLoop() argument
1030 visitBranch(Visit visit, TIntermBranch *node) visitBranch() argument
1053 visitCodeBlock(TIntermBlock *node) visitCodeBlock() argument
1071 visitPreprocessorDirective(TIntermPreprocessorDirective *node) visitPreprocessorDirective() argument
[all...]
/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
H A Drbtree.h78 #define RB_EMPTY_NODE(node) (rb_parent(node) == node)
79 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node))
81 #define rb_insert_color(node, root) \
82 linux_root_RB_INSERT_COLOR((struct linux_root *)(root), (node))
83 #define rb_erase(node, root) \
84 (void)linux_root_RB_REMOVE((struct linux_root *)(root), (node))
92 rb_link_node(struct rb_node *node, struct rb_node *parent, struct rb_node **rb_link) rb_link_node() argument
123 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) rb_insert_color_cached() argument
132 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) rb_erase_cached() argument
[all...]
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/
H A Ddifferential_fuzz_mutator.js58 if (path.node.value.startsWith(SECTION_PREFIX)) {
59 const postfix = path.node.value.substring(SECTION_PREFIX.length);
60 path.node.value = CLEANED_PREFIX + postfix;
61 thisMutator.annotate(path.node, 'Replaced magic string');
66 if (path.node.operator == '**') {
67 path.node.operator = '+';
68 thisMutator.annotate(path.node, 'Replaced **');
73 if (path.node.property.name == "arguments") {
96 * Looks for the dummy node that marks the beginning of an input file
100 return !!common.getOriginalPath(path.node);
[all...]
/third_party/musl/src/thread/
H A Dpthread_cond_timedwait.c15 * protected by the "barrier" locks in each node, which are unlocked
64 struct waiter node = { 0 }; in __pthread_cond_timedwait() local
84 seq = node.barrier = 2; in __pthread_cond_timedwait()
85 fut = &node.barrier; in __pthread_cond_timedwait()
86 node.state = WAITING; in __pthread_cond_timedwait()
87 node.next = c->_c_head; in __pthread_cond_timedwait()
88 c->_c_head = &node; in __pthread_cond_timedwait()
89 if (!c->_c_tail) c->_c_tail = &node; in __pthread_cond_timedwait()
90 else node.next->prev = &node; in __pthread_cond_timedwait()
[all...]
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/
H A Ddb.js238 path.node.__skipped = true;
286 path.node.__needsSuper = true;
297 if (globalIdentifiers.has(path.node.name) &&
298 path.node.name != 'eval') {
303 if (propertyNames.has(path.node.name) &&
310 let binding = path.scope.getBinding(path.node.name);
318 if (path.node.name.startsWith('VAR_')) {
319 newName = path.node.name;
320 } else if (babelTypes.isFunctionDeclaration(binding.path.node) ||
321 babelTypes.isFunctionExpression(binding.path.node) ||
[all...]
/third_party/node/test/cctest/
H A Dtest_environment.cc12 using node::AtExit;
13 using node::RunAtExit;
14 using node::USE;
46 node::Environment* envi = *env; in TEST_F()
49 SetProcessExitHandler(*env, [&](node::Environment* env_, int exit_code) { in TEST_F()
52 node::Stop(*env); in TEST_F()
55 node::LoadEnvironment( in TEST_F()
105 Env env {handle_scope, argv, node::EnvironmentFlags::kNoRegisterESMLoader}; in TEST_F()
107 node::Environment* envi = *env; in TEST_F()
110 SetProcessExitHandler(*env, [&](node in TEST_F()
[all...]
/third_party/node/deps/npm/node_modules/postcss-selector-parser/dist/selectors/
H A Dguards.js17 function isNode(node) {
18 return typeof node === "object" && IS_TYPE[node.type];
20 function isNodeType(type, node) {
21 return isNode(node) && node.type === type;
47 function isPseudoElement(node) {
48 return isPseudo(node) && node.value && (node
[all...]
/third_party/python/Lib/lib2to3/fixes/
H A Dfix_operator.py43 def transform(self, node, results):
44 method = self._check_method(node, results)
46 return method(node, results)
49 def _sequenceIncludes(self, node, results):
50 return self._handle_rename(node, results, "contains")
53 def _isCallable(self, node, results):
55 return Call(Name("callable"), [obj.clone()], prefix=node.prefix)
58 def _repeat(self, node, results):
59 return self._handle_rename(node, results, "mul")
62 def _irepeat(self, node, result
[all...]

Completed in 13 milliseconds

12345678910>>...101