Home
last modified time | relevance | path

Searched refs:node (Results 1476 - 1500 of 2512) sorted by relevance

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

/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-snapshot.cc48 // An embedder node may only be merged with a single wrapper node, as in SetWrapperNode()
49 // consumers of the graph may merge a node and its wrapper node. in SetWrapperNode()
54 // `AddEdge`. We accept overriding the wrapper node in such cases, in SetWrapperNode()
55 // leading to a random merged node and separated nodes for all other in SetWrapperNode()
106 EmbedderNode* node, bool visited) in StateBase()
110 node_(node), in StateBase()
129 void set_node(EmbedderNode* node) { in set_node() argument
132 node_ = node; in set_node()
105 StateBase(const void* key, size_t state_count, Visibility visibility, EmbedderNode* node, bool visited) StateBase() argument
298 RootState(EmbedderRootNode* node, size_t state_count) RootState() argument
[all...]
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_spill.c52 struct rb_node node; member
428 rb_node_data(const struct ra_spill_interval, _a, node); in ra_spill_interval_cmp()
430 rb_node_data(const struct ra_spill_interval, _b, node); in ra_spill_interval_cmp()
464 rb_tree_insert(&ctx->full_live_intervals, &interval->node, in interval_add()
490 rb_tree_remove(&ctx->full_live_intervals, &interval->node); in interval_delete()
653 /* If this node is inserted in one of the trees, then it needs to be resorted in update_src_next_use()
663 rb_tree_remove(&ctx->full_live_intervals, &interval->node); in update_src_next_use()
664 rb_tree_insert(&ctx->full_live_intervals, &interval->node, in update_src_next_use()
806 &ctx->full_live_intervals, node) { in limit()
958 &interval->interval.children, interval.node) { in rewrite_src_interval()
[all...]
H A Dir3_array_to_ssa.c27 * the array defined in instr->dsts[0]->def (possibly a phi node), perform the
108 list_del(&phi->node); in read_value_beginning()
109 list_add(&phi->node, &block->instr_list); in read_value_beginning()
149 * dominate the phi node, even if they are all equal. So we need to in remove_trivial_phi()
278 list_del(&instr->node); in ir3_array_to_ssa()
/third_party/libcoap/src/
H A Dcoap_session.c607 /* Need to delete node we set up for NON */ in coap_session_mfree()
782 coap_queue_t *node) { in coap_session_delay_pdu()
783 if (node) { in coap_session_delay_pdu()
785 coap_remove_from_queue(&session->context->sendqueue, session, node->id, &removed); in coap_session_delay_pdu()
786 assert(removed == node); in coap_session_delay_pdu()
787 coap_session_release(node->session); in coap_session_delay_pdu()
788 node->session = NULL; in coap_session_delay_pdu()
789 node->t = 0; in coap_session_delay_pdu()
802 node = coap_new_node(); in coap_session_delay_pdu()
803 if (node in coap_session_delay_pdu()
781 coap_session_delay_pdu(coap_session_t *session, coap_pdu_t *pdu, coap_queue_t *node) coap_session_delay_pdu() argument
[all...]
/third_party/libdrm/
H A Dxf86drm.c776 * special file node with the major and minor numbers specified by \p dev and
797 drmMsg("drmOpenDevice: node name is %s\n", buf); in drmOpenDevice()
814 /* Check if the device node exists and create it if necessary. */ in drmOpenDevice()
859 /* Check if the device node is not what we expect it to be, and recreate it in drmOpenDevice()
1019 * \param type device node type.
1082 * \param type the device node type.
1194 * \param type the device node type to open, PRIMARY, CONTROL or RENDER
3275 * FreeBSD on amd64/i386/powerpc external kernel modules create node in in drmNodeIsDRM()
3412 * FreeBSD on amd64/i386/powerpc external kernel modules create node in in drmGetMinorNameForFD()
3416 /* Get the node typ in drmGetMinorNameForFD()
3998 drmDeviceAlloc(unsigned int type, const char *node, size_t bus_size, size_t device_size, char **ptrp) drmDeviceAlloc() argument
4035 drmProcessPciDevice(drmDevicePtr *device, const char *node, int node_type, int maj, int min, bool fetch_deviceinfo, uint32_t flags) drmProcessPciDevice() argument
4193 drmProcessUsbDevice(drmDevicePtr *device, const char *node, int node_type, int maj, int min, bool fetch_deviceinfo, uint32_t flags) drmProcessUsbDevice() argument
4327 drmProcessPlatformDevice(drmDevicePtr *device, const char *node, int node_type, int maj, int min, bool fetch_deviceinfo, uint32_t flags) drmProcessPlatformDevice() argument
4367 drmProcessHost1xDevice(drmDevicePtr *device, const char *node, int node_type, int maj, int min, bool fetch_deviceinfo, uint32_t flags) drmProcessHost1xDevice() argument
4413 char node[PATH_MAX + 1]; process_device() local
4524 char node[PATH_MAX + 1]; drmGetDeviceFromDevId() local
[all...]
/third_party/node/deps/v8/src/debug/
H A Ddebug.cc842 for (DebugInfoListNode* node = debug_info_list_; node != nullptr; in ClearBreakPoint()
843 node = node->next()) { in ClearBreakPoint()
844 if (!node->debug_info()->HasBreakInfo()) continue; in ClearBreakPoint()
846 isolate_, node->debug_info(), break_point); in ClearBreakPoint()
848 Handle<DebugInfo> debug_info = node->debug_info(); in ClearBreakPoint()
1393 for (DebugInfoListNode* node = debug_info_list_; node != nullptr; in ClearOneShot()
1394 node in ClearOneShot()
1975 DebugInfoListNode* node = new DebugInfoListNode(isolate_, *debug_info); GetOrCreateDebugInfo() local
2045 DebugInfoListNode* node; RemoveBreakInfoAndMaybeFree() local
2051 FreeDebugInfoListNode(DebugInfoListNode* prev, DebugInfoListNode* node) FreeDebugInfoListNode() argument
[all...]
/third_party/node/src/
H A Dnode_snapshot_stub.cc7 namespace node { namespace
13 } // namespace node
H A Dnode_errors.h14 namespace node { namespace
29 // `node::ERR_INVALID_ARG_TYPE(isolate, "message")` returning
226 return node::THROW_ERR_INVALID_ARG_TYPE(env, \
233 return node::THROW_ERR_INVALID_ARG_TYPE(env, \
284 } // namespace node
H A Dnode_report_module.cc18 namespace node { namespace
218 } // namespace node
220 NODE_BINDING_CONTEXT_AWARE_INTERNAL(report, node::report::Initialize)
222 node::report::RegisterExternalReferences)
H A Dnode_task_queue.cc3 #include "node.h"
13 namespace node { namespace
227 } // namespace node
229 NODE_BINDING_CONTEXT_AWARE_INTERNAL(task_queue, node::task_queue::Initialize)
231 node::task_queue::RegisterExternalReferences)
/third_party/alsa-lib/src/ucm/
H A Ducm_cond.c32 snd_config_t *node; in get_string() local
35 err = snd_config_search(compound, key, &node); in get_string()
38 return snd_config_get_string(node, str); in get_string()
H A Ducm_include.c31 snd_config_t *node; in get_string() local
34 err = snd_config_search(compound, key, &node); in get_string()
37 return snd_config_get_string(node, str); in get_string()
173 uc_error("destination configuration node is not a compound"); in compound_merge()
177 uc_error("source configuration node is not an array"); in compound_merge()
/third_party/curl/lib/
H A Dheaders.c249 Curl_llist_remove(&data->state.httphdrs, &hs->node, NULL); in unfold_value()
265 /* insert this node into the list of headers */ in unfold_value()
267 newhs, &newhs->node); in unfold_value()
329 /* insert this node into the list of headers */ in Curl_headers_push()
331 hs, &hs->node); in Curl_headers_push()
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_if_conversion.cpp183 node *n = *I; in check_and_convert()
267 node *p = *I; in run_on()
276 alu_node* if_conversion::convert_phi(value* select, node* phi) { in convert_phi()
/third_party/node/test/cctest/
H A Dtest_sockaddr.cc4 using node::SocketAddress;
5 using node::SocketAddressBlockList;
6 using node::SocketAddressLRU;
/third_party/ninja/src/
H A Dclean.cc160 // call DoCleanTarget recursively if this node has not been visited in DoCleanTarget()
186 Node* node = state_->LookupNode(target); in CleanTarget() local
187 if (node) { in CleanTarget()
188 CleanTarget(node); in CleanTarget()
/third_party/mesa3d/src/mapi/glapi/gen/
H A DglX_server_table.py65 # Minimum number of opcodes in a leaf node.
90 the node, the list of the children's tuple, and the number
91 of entries in the final array used by this node and its
92 children, and the depth of the subtree rooted at the node."""
125 # If all the remaining bits are used by this node, as is the
126 # case when M is 0 or remaining_bits, the node is a leaf.
148 # them up and make this node a leaf.
165 def dump_tree(self, node, base_opcode, remaining_bits, base_entry, depth):
166 M = node[0]
167 children = node[
[all...]
/third_party/lwip/src/include/lwip/apps/
H A Dsnmp_core.h156 SNMP MIB node types
157 tree node is the only node the stack can process in order to walk the tree,
159 This cannot be an enum because users may want to define their own node types.
162 /* predefined leaf node types */
168 /** node "base class" layout, the mandatory fields for a node */
171 /** one out of SNMP_NODE_TREE or any leaf node type (like SNMP_NODE_SCALAR) */
173 /** the number assigned to this node which used as part of the full OID */
177 /** SNMP node instanc
200 const struct snmp_node* node; global() member
229 struct snmp_node node; global() member
246 struct snmp_node node; global() member
[all...]
/third_party/ltp/tools/sparse/sparse-src/Documentation/sphinx/
H A Dcdoc.py299 node = docutils.nodes.section()
302 self.state.nested_parse(lst, 0, node, match_titles=1)
305 return node.children
/third_party/node/deps/v8/src/compiler/
H A Dgraph-visualizer.h113 void PrintNode(Node* node, bool is_live);
114 void PrintEdges(Node* node);
116 virtual base::Optional<Type> GetType(Node* node);
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbifrost_isa.py119 for node in enc.findall('copy'):
120 name = node.get('name')
123 ex[0][1] = node.get('start')
/third_party/mesa3d/src/panfrost/util/
H A Dpan_ir.h438 void pan_liveness_gen(uint16_t *live, unsigned node, unsigned max, uint16_t mask);
439 void pan_liveness_kill(uint16_t *live, unsigned node, unsigned max, uint16_t mask);
440 bool pan_liveness_get(uint16_t *live, unsigned node, uint16_t max);
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/finitestatematcher/compiler/
H A DMatcherCompiler.java69 /** The unique initial node of the DFA. */
82 * traversal while maintaining a simple-as-possible node/edge structure. It's okay to reuse the
120 * Returns the output targets of the given node sorted according to the lowest "accepting" digit
131 /** Returns the single output target of the given node (or throws an exception). */
137 * Builds the output map from a given node in the DFA in the correct order. Note that because
176 // to be well defined and ValueGraph does not make good enough promises about node ordering. in buildSequencesFrom()
208 private Operation getOp(DfaNode node) { in getOp() argument
209 return Operation.from(node.canTerminate(), getOutMap(node)); in getOp()
249 * sequence contains only a single terminating node
[all...]
/third_party/skia/third_party/externals/angle2/src/tests/compiler_tests/
H A DIntermNode_test.cpp7 // Unit tests for the AST node classes.
52 TIntermSymbol *node = new TIntermSymbol(variable); in createTestSymbol() local
53 node->setLine(createUniqueSourceLoc()); in createTestSymbol()
54 return node; in createTestSymbol()
138 // Check that the deep copy of a symbol node is an actual copy with the same attributes as the
156 // Check that the deep copy of a constant union node is an actual copy with the same attributes as
174 // Check that the deep copy of a binary node is an actual copy with the same attributes as the
193 // Check that the deep copy of a unary node is an actual copy with the same attributes as the
194 // original. The child node also needs to be a copy with the same attributes as the original child.
211 // Check that the deep copy of an aggregate node i
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/XCore/
H A DXCoreISelDAGToDAG.cpp150 SDNode *node = CurDAG->getMachineNode(XCore::LDWCP_lru6, dl, MVT::i32, in Select() local
156 CurDAG->setNodeMemRefs(cast<MachineSDNode>(node), {MemOp}); in Select()
157 ReplaceNode(N, node); in Select()

Completed in 24 milliseconds

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