Home
last modified time | relevance | path

Searched refs:node (Results 1451 - 1475 of 2502) sorted by relevance

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

/third_party/mesa3d/src/compiler/glsl/
H A Dast_type.cpp573 ast_node* &node) in merge_into_out_qualifier()
584 node = new(state->linalloc) ast_tcs_output_layout(*loc); in merge_into_out_qualifier()
692 ast_node* &node) in merge_into_in_qualifier()
697 /* We create the gs_input_layout node before merging so, in the future, no in merge_into_in_qualifier()
702 node = new(lin_ctx) ast_gs_input_layout(*loc, this->prim_type); in merge_into_in_qualifier()
772 * all existing nodes is checked later, when the AST node is transformed in merge_into_in_qualifier()
776 node = new(lin_ctx) ast_cs_input_layout(*loc, in merge_into_in_qualifier()
936 for (exec_node *node = layout_const_expressions.get_head_raw(); in process_qualifier_constant()
937 !node->is_tail_sentinel(); node in process_qualifier_constant()
571 merge_into_out_qualifier(YYLTYPE *loc, _mesa_glsl_parse_state *state, ast_node* &node) merge_into_out_qualifier() argument
690 merge_into_in_qualifier(YYLTYPE *loc, _mesa_glsl_parse_state *state, ast_node* &node) merge_into_in_qualifier() argument
[all...]
H A Dir_reader.cpp211 exec_node *node = ((s_list *) expr)->subexpressions.get_head_raw()->next->next; in read_function() local
212 for (/* nothing */; !node->is_tail_sentinel(); node = node->next) { in read_function()
213 s_expression *s_sig = (s_expression *) node; in read_function()
254 exec_node *node = paramlist->subexpressions.get_head_raw()->next; in read_function_sig() local
255 for (/* nothing */; !node->is_tail_sentinel(); node = node->next) { in read_function_sig()
256 ir_variable *var = read_declaration((s_expression *) node); in read_function_sig()
[all...]
/third_party/libinput/test/
H A Dtest-utils.c1406 struct list node; in START_TEST() member
1420 list_insert(&head, &t->node); in START_TEST()
1424 list_for_each(t, &head, node) { in START_TEST()
1437 struct list node; in START_TEST() member
1451 list_append(&head, &t->node); in START_TEST()
1455 list_for_each(t, &head, node) { in START_TEST()
1467 struct list node; in START_TEST() member
1480 list_append(&head, &t->node); in START_TEST()
1485 list_for_each(t, &head, node) { in START_TEST()
1490 list_for_each_safe(t, &head, node) { in START_TEST()
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/
H A DRewriteCubeMapSamplersAs2DArray.cpp228 bool visitDeclaration(Visit visit, TIntermDeclaration *node) override
230 const TIntermSequence &sequence = *(node->getSequence());
242 declareSampler2DArray(&samplerVariable->variable(), node);
249 bool visitAggregate(Visit visit, TIntermAggregate *node) override
251 if (BuiltInGroup::IsBuiltIn(node->getOp()))
253 bool converted = convertBuiltinFunction(node);
273 void declareSampler2DArray(const TVariable *samplerCubeVar, TIntermDeclaration *node) in declareSampler2DArray() argument
756 bool convertBuiltinFunction(TIntermAggregate *node) in convertBuiltinFunction() argument
758 const TFunction *function = node->getFunction(); in convertBuiltinFunction()
843 TIntermSequence *arguments = node in convertBuiltinFunction()
[all...]
/third_party/skia/src/ports/skia_ohos/
H A DFontConfig_ohos.cpp523 * \param root the root node of 'fontdir'
554 * \param root the root node of an item in 'generic' list
625 * \param root the root node of an item in an 'alias' list
662 * \param root the root node of an item in an 'adjust' list
689 * \param root the root node of an item in 'fallback' list
724 * \param root the root node of a fallback item
797 * \param root the root node of an item in 'variations' list
854 * \param root the root node of 'index' attribute
855 * \param familyName the name of the family which the root node belongs to
1081 struct dirent* node in scanFonts() local
1322 struct dirent* node = nullptr; judgeFileExist() local
[all...]
/third_party/skia/third_party/externals/tint/src/transform/
H A Ddecompose_memory_access.cc421 /// TakeAccess() removes the `node` item from #accesses (if it exists),
423 /// `node`, an invalid BufferAccess is returned.
424 /// @param node the expression that performed an access
426 BufferAccess TakeAccess(const ast::Expression* node) { in TakeAccess()
427 auto lhs_it = accesses.find(node); in TakeAccess()
432 accesses.erase(node); in TakeAccess()
806 for (auto* node : ctx.src->ASTNodes().Objects()) {
807 if (auto* ident = node->As<ast::IdentifierExpression>()) {
823 if (auto* accessor = node->As<ast::MemberAccessorExpression>()) {
854 if (auto* accessor = node
[all...]
/third_party/ffmpeg/libavcodec/
H A Dqdm2.c93 * A node in the subpacket list
97 struct QDM2SubPNode *next; ///< pointer to next packet in the list, NULL if leaf node
294 * Return node pointer to first packet of requested type in list.
298 * @return node pointer for subpacket if found, else NULL
978 * @param node pointer to node with packet
980 static int process_subpacket_9(QDM2Context *q, QDM2SubPNode *node) in process_subpacket_9() argument
985 init_get_bits(&gb, node->packet->data, node->packet->size * 8); in process_subpacket_9()
1020 * @param node pointe
1022 process_subpacket_10(QDM2Context *q, QDM2SubPNode *node) process_subpacket_10() argument
1041 process_subpacket_11(QDM2Context *q, QDM2SubPNode *node) process_subpacket_11() argument
1070 process_subpacket_12(QDM2Context *q, QDM2SubPNode *node) process_subpacket_12() argument
[all...]
/third_party/glslang/glslang/MachineIndependent/
H A DConstant.cpp60 // Returns the node to keep using, which may or may not be the node passed in.
70 // Returns a new node representing the result.
363 // Do single unary node folding
365 // Returns a new node representing the result.
950 // Do constant folding for an aggregate node that has all its children
1296 // the parent node in areAllChildConst()
1330 TIntermTyped* TIntermediate::foldDereference(TIntermTyped* node, int index, const TSourceLoc& loc) in foldDereference() argument
1332 TType dereferencedType(node->getType(), index); in foldDereference()
1340 if (node in foldDereference()
1366 foldSwizzle(TIntermTyped* node, TSwizzleSelectors<TVectorSelector>& selectors, const TSourceLoc& loc) foldSwizzle() argument
[all...]
/third_party/googletest/googlemock/scripts/generator/cpp/
H A Dast.py108 """Base AST node."""
115 """Returns bool if this node is a declaration."""
119 """Returns bool if this node is a definition."""
123 """Returns bool if this node exportable from a header file."""
126 def Requires(self, node):
127 """Does this AST node require the definition of the node passed in?"""
180 def Requires(self, node):
218 def Requires(self, node):
220 return self.type.name == node
[all...]
/third_party/icu/icu4c/source/common/
H A Drbbitblb.cpp117 // Appears as a cat-node, left child being the original tree, in buildForwardTable()
211 // These are non-empty leaf node types. in calcNullable()
217 // Lookahead marker node. It's a leaf, so no recursion on children. in calcNullable()
224 // The node is not a leaf. in calcNullable()
260 // These are non-empty leaf node types. in calcFirstPos()
262 // this function should only be called on a node whose set is in calcFirstPos()
268 // The node is not a leaf. in calcFirstPos()
306 // These are non-empty leaf node types. in calcLastPos()
308 // this function should only be called on a node whose set is in calcLastPos()
314 // The node i in calcLastPos()
389 addRuleRootNodes(UVector *dest, RBBINode *node) addRuleRootNodes() argument
432 RBBINode *node = static_cast<RBBINode *>(ruleRootNodes.elementAt(j)); calcChainedFollowPos() local
731 RBBINode *node = static_cast<RBBINode *>(sd->fPositions->elementAt(ipos)); mapLookAheadRules() local
762 RBBINode *node = static_cast<RBBINode *>(sd->fPositions->elementAt(ipos)); mapLookAheadRules() local
[all...]
/third_party/node/test/fixtures/wpt/resources/
H A Dtestharness.js1246 // instanceof doesn't work if the node is from another window (like an
1255 // We're probably cross-origin, which means we aren't a node
1324 * // "Document node with 2 children"
1391 return "Element node " + truncate(ret, 60);
1393 return 'Text node "' + truncate(val.data, 60) + '"';
1395 return "ProcessingInstruction node with target " + format_value(truncate(val.target, 60)) + " and data " + format_value(truncate(val.data, 60));
1397 return "Comment node <!--" + truncate(val.data, 60) + "-->";
1399 return "Document node with " + val.childNodes.length + (val.childNodes.length == 1 ? " child" : " children");
1401 return "DocumentType node";
1403 return "DocumentFragment node wit
[all...]
/third_party/node/deps/icu-small/source/common/
H A Drbbitblb.cpp117 // Appears as a cat-node, left child being the original tree, in buildForwardTable()
211 // These are non-empty leaf node types. in calcNullable()
217 // Lookahead marker node. It's a leaf, so no recursion on children. in calcNullable()
224 // The node is not a leaf. in calcNullable()
260 // These are non-empty leaf node types. in calcFirstPos()
262 // this function should only be called on a node whose set is in calcFirstPos()
268 // The node is not a leaf. in calcFirstPos()
306 // These are non-empty leaf node types. in calcLastPos()
308 // this function should only be called on a node whose set is in calcLastPos()
314 // The node i in calcLastPos()
389 addRuleRootNodes(UVector *dest, RBBINode *node) addRuleRootNodes() argument
432 RBBINode *node = static_cast<RBBINode *>(ruleRootNodes.elementAt(j)); calcChainedFollowPos() local
716 RBBINode *node = static_cast<RBBINode *>(sd->fPositions->elementAt(ipos)); mapLookAheadRules() local
747 RBBINode *node = static_cast<RBBINode *>(sd->fPositions->elementAt(ipos)); mapLookAheadRules() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Drbbitblb.cpp117 // Appears as a cat-node, left child being the original tree, in buildForwardTable()
211 // These are non-empty leaf node types. in calcNullable()
217 // Lookahead marker node. It's a leaf, so no recursion on children. in calcNullable()
224 // The node is not a leaf. in calcNullable()
260 // These are non-empty leaf node types. in calcFirstPos()
262 // this function should only be called on a node whose set is in calcFirstPos()
268 // The node is not a leaf. in calcFirstPos()
306 // These are non-empty leaf node types. in calcLastPos()
308 // this function should only be called on a node whose set is in calcLastPos()
314 // The node i in calcLastPos()
389 addRuleRootNodes(UVector *dest, RBBINode *node) addRuleRootNodes() argument
431 RBBINode *node = static_cast<RBBINode *>(ruleRootNodes.elementAt(j)); calcChainedFollowPos() local
730 RBBINode *node = static_cast<RBBINode *>(sd->fPositions->elementAt(ipos)); mapLookAheadRules() local
761 RBBINode *node = static_cast<RBBINode *>(sd->fPositions->elementAt(ipos)); mapLookAheadRules() local
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Draw_hash_set_test.cc1893 auto node = t.extract(k0); in TEST() local
1895 EXPECT_TRUE(node); in TEST()
1896 EXPECT_FALSE(node.empty()); in TEST()
1899 StringTable::insert_return_type res = t2.insert(std::move(node)); in TEST()
1902 EXPECT_FALSE(res.node); in TEST()
1907 node = t.extract("Not there!"); in TEST()
1909 EXPECT_FALSE(node); in TEST()
1912 res = t2.insert(std::move(node)); in TEST()
1915 EXPECT_FALSE(res.node); in TEST()
1919 node in TEST()
1931 auto node = t.extract(1); TEST() local
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Devaluate.c229 static struct symbol *base_type(struct symbol *node, unsigned long *modp, struct ident **asp) in base_type() argument
234 while (node) { in base_type()
235 mod |= node->ctype.modifiers; in base_type()
236 combine_address_space(node->pos, &as, node->ctype.as); in base_type()
237 if (node->type == SYM_NODE) { in base_type()
238 node = node->ctype.base_type; in base_type()
245 return node; in base_type()
1662 struct symbol *node in create_pointer() local
1806 struct symbol *ctype = op->ctype, *node, *target; evaluate_dereference() local
[all...]
/third_party/exfatprogs/lib/
H A Dlibexfat.c715 int exfat_get_inode_next_clus(struct exfat *exfat, struct exfat_inode *node, in exfat_get_inode_next_clus() argument
720 if (node->is_contiguous) { in exfat_get_inode_next_clus()
784 struct exfat_inode *node = exfat->root; in exfat_root_clus_count() local
788 if (!exfat_heap_clus(exfat, node->first_clus)) in exfat_root_clus_count()
791 clus = node->first_clus; in exfat_root_clus_count()
798 if (exfat_get_inode_next_clus(exfat, node, clus, &next)) { in exfat_root_clus_count()
810 node->size = clus_count * exfat->clus_size; in exfat_root_clus_count()
/third_party/node/src/
H A Dinspector_socket.cc18 namespace node { namespace
37 return node::ContainerOf(&TcpHolder::tcp_, in From()
117 return node::ContainerOf(&WriteRequest::req, req); in from_write_req()
153 node::base64_encode(hash, sizeof(hash), *buffer, sizeof(*buffer)); in generate_accept_string()
602 return node::ContainerOf(&HttpHandler::parser_, parser); in From()
624 if (node::StringEqualNoCaseN(header_value.first.data(), header.data(), in HeaderValue()
638 || node::StringEqualNoCase(host.data(), "localhost"); in IsAllowedHost()
819 } // namespace node
H A Dnode_snapshot_stub.cc7 namespace node { namespace
13 } // namespace node
/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...]
/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/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()

Completed in 42 milliseconds

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