| /xsrc/external/mit/libdrm/dist/etnaviv/ |
| H A D | etnaviv_perfmon.c | 30 static int etna_perfmon_query_signals(struct etna_perfmon *pm, struct etna_perfmon_domain *dom) argument 35 .domain = dom->id 54 sig->domain = dom; 57 list_addtail(&sig->head, &dom->signals); 71 struct etna_perfmon_domain *dom; local in function:etna_perfmon_query_domains 78 dom = calloc(1, sizeof(*dom)); 79 if (!dom) 82 list_inithead(&dom->signals); 83 dom 103 etna_perfmon_free_signals(struct etna_perfmon_domain * dom) argument 115 struct etna_perfmon_domain *dom, *next; local in function:etna_perfmon_free_domains 161 struct etna_perfmon_domain *dom; local in function:etna_perfmon_get_dom_by_name 173 etna_perfmon_get_sig_by_name(struct etna_perfmon_domain * dom,const char * name) argument [all...] |
| H A D | etnaviv_drmif.h | 200 struct etna_perfmon_signal *etna_perfmon_get_sig_by_name(struct etna_perfmon_domain *dom, const char *name);
|
| /xsrc/external/mit/MesaLib/dist/src/etnaviv/drm/ |
| H A D | etnaviv_perfmon.c | 30 static int etna_perfmon_query_signals(struct etna_perfmon *pm, struct etna_perfmon_domain *dom) argument 35 .domain = dom->id 54 sig->domain = dom; 57 list_addtail(&sig->head, &dom->signals); 71 struct etna_perfmon_domain *dom; local in function:etna_perfmon_query_domains 78 dom = calloc(1, sizeof(*dom)); 79 if (!dom) 82 list_inithead(&dom->signals); 83 dom 103 etna_perfmon_free_signals(struct etna_perfmon_domain * dom) argument 115 struct etna_perfmon_domain *dom, *next; local in function:etna_perfmon_free_domains 161 struct etna_perfmon_domain *dom; local in function:etna_perfmon_get_dom_by_name 173 etna_perfmon_get_sig_by_name(struct etna_perfmon_domain * dom,const char * name) argument [all...] |
| H A D | etnaviv_drmif.h | 210 struct etna_perfmon_signal *etna_perfmon_get_sig_by_name(struct etna_perfmon_domain *dom, const char *name);
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/afuc/ |
| H A D | util.c | 39 struct rnndomain *dom[2]; variable in typeref:struct:rnndomain * [2] 43 find_reg(struct rnndomain *dom, const char *name) argument 45 for (int i = 0; i < dom->subelemsnum; i++) 46 if (!strcmp(name, dom->subelems[i]->name)) 47 return dom->subelems[i]->offset; 53 reg(struct rnndomain *dom, const char *type, const char *name) argument 55 int val = find_reg(dom, name); 68 reg_name(struct rnndomain *dom, unsigned id) argument 70 if (rnndec_checkaddr(ctx, dom, id, 0)) { 71 struct rnndecaddrinfo *info = rnndec_decodeaddr(ctx, dom, i [all...] |
| /xsrc/external/mit/MesaLib/dist/src/freedreno/decode/ |
| H A D | rnnutil.c | 41 if (rnndec_checkaddr(rnn->vc, rnn->dom[0], regbase, 0)) 42 return rnn->dom[0]; 43 return rnn->dom[1]; 81 rnn->dom[0] = rnn_finddomain(rnn->db, domain); 83 rnn->dom[1] = rnn_finddomain(rnn->db, "AXXX"); 85 rnn->dom[1] = rnn->dom[0]; 87 if (!rnn->dom[0] && rnn->dom[1]) { 124 uint32_t regbase = rnndec_decodereg(rnn->vc_nocolor, rnn->dom[ [all...] |
| H A D | script.h | 56 struct rnndomain *dom);
|
| H A D | rnnutil.h | 42 struct rnndomain *dom[2]; member in struct:rnn
|
| H A D | script.c | 721 struct rnndomain *dom) 726 lua_getglobal(L, dom->name); 737 rnndec->base.dom[0] = dom; 738 rnndec->base.dom[1] = NULL; 720 script_packet(uint32_t * dwords,uint32_t sizedwords,struct rnn * rnn,struct rnndomain * dom) argument
|
| H A D | cffdec.c | 918 struct rnndomain *dom; local in function:dump_domain 921 dom = rnn_finddomain(rnn->db, name); 923 if (!dom) 927 script_packet(dwords, sizedwords, rnn, dom); 933 struct rnndecaddrinfo *info = rnndec_decodeaddr(rnn->vc, dom, i, 0);
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| H A D | nir_phi_builder.c | 188 nir_block *dom = block; local in function:nir_phi_builder_value_get_block_def 191 while (dom != NULL) { 192 he = _mesa_hash_table_search(&val->ht, INDEX_TO_KEY(dom->index)); 196 dom = dom->imm_dom; 199 /* Exactly one of (he != NULL) and (dom == NULL) must be true. */ 200 assert((he != NULL) != (dom == NULL)); 203 if (dom == NULL) { 237 phi->instr.block = dom; 256 for (dom [all...] |
| H A D | nir_from_ssa.c | 135 nir_ssa_def *dom[set->size]; 139 while (dom_idx >= 0 && !ssa_def_dominates(dom[dom_idx], node->def)) 147 dom[++dom_idx] = node->def; 234 NIR_VLA(merge_node *, dom, a->size + b->size); 271 !ssa_def_dominates(dom[dom_idx]->def, current->def)) 284 * minimal dominator dom[dom_idx]. Since N is live at current it must 286 * the minimal dominator dom[dom_idx] and, by invariants 2 and 3 above, 289 * minimal dominator dom[dom_idx]. 294 if (dom_idx >= 0 && merge_nodes_interfere(current, dom[dom_idx])) 297 dom[ [all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| H A D | nir_phi_builder.c | 189 nir_block *dom = block; local in function:nir_phi_builder_value_get_block_def 192 while (dom != NULL) { 193 he = _mesa_hash_table_search(&val->ht, INDEX_TO_KEY(dom->index)); 197 dom = dom->imm_dom; 200 /* Exactly one of (he != NULL) and (dom == NULL) must be true. */ 201 assert((he != NULL) != (dom == NULL)); 204 if (dom == NULL) { 238 phi->instr.block = dom; 257 for (dom [all...] |
| H A D | nir_from_ssa.c | 100 nir_ssa_def *dom[set->size]; 104 while (dom_idx >= 0 && !ssa_def_dominates(dom[dom_idx], node->def)) 115 dom[++dom_idx] = node->def; 186 NIR_VLA(merge_node *, dom, a->size + b->size); 215 !ssa_def_dominates(dom[dom_idx]->def, current->def)) 218 if (dom_idx >= 0 && merge_nodes_interfere(current, dom[dom_idx])) 221 dom[++dom_idx] = current;
|
| /xsrc/external/mit/xorg-server.old/dist/config/ |
| H A D | fdi2iclass.py | 29 import sys, xml.dom.minidom 110 if n.nodeType != xml.dom.minidom.Node.ELEMENT_NODE: 119 assert content_node.nodeType == xml.dom.Node.TEXT_NODE 138 return node.nodeType == xml.dom.minidom.Node.ELEMENT_NODE and \ 158 if n.nodeType == xml.dom.minidom.Node.ELEMENT_NODE]) 188 if n.nodeType == xml.dom.minidom.Node.ELEMENT_NODE]) 202 parse_fdi(xml.dom.minidom.parse(f))
|
| /xsrc/external/mit/xorg-server/dist/config/ |
| H A D | fdi2iclass.py | 29 import sys, xml.dom.minidom 110 if n.nodeType != xml.dom.minidom.Node.ELEMENT_NODE: 119 assert content_node.nodeType == xml.dom.Node.TEXT_NODE 138 return node.nodeType == xml.dom.minidom.Node.ELEMENT_NODE and \ 158 if n.nodeType == xml.dom.minidom.Node.ELEMENT_NODE]) 188 if n.nodeType == xml.dom.minidom.Node.ELEMENT_NODE]) 202 parse_fdi(xml.dom.minidom.parse(f))
|
| /xsrc/external/mit/MesaLib/dist/src/amd/compiler/ |
| H A D | aco_lower_to_cssa.cpp | 288 std::vector<Temp> dom; /* stack of the traversal */ local in function:aco::__anondeebb31e0110::try_merge_merge_set 305 while (!dom.empty() && !dominates(ctx, dom.back(), current)) 306 dom.pop_back(); /* not the desired parent, remove */ 308 if (!dom.empty() && interference(ctx, current, dom.back())) 311 dom.emplace_back(current); /* otherwise, keep checking */
|
| H A D | aco_spill.cpp | 246 uint32_t dom = pair.second.first; local in function:aco::__anond37687ce0110::next_uses_per_block 257 dom = get_dominator(dom, entry_distance.first, ctx.program, temp.is_linear()); 260 if (entry_distance != std::pair<uint32_t, uint32_t>{dom, distance}) { 262 entry_distance = {dom, distance};
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/ |
| H A D | nv50_ir_ssa.cpp | 168 insert(&BasicBlock::get(cfg->getRoot())->dom); 172 nw = &BasicBlock::get(vert[DOM(v)])->dom; 173 nv = &BasicBlock::get(vert[v])->dom; 206 for (chldIt = bb->dom.outgoing(); !chldIt.end(); chldIt.next()) { 525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next())
|
| H A D | nv50_ir_bb.cpp | 74 BasicBlock::BasicBlock(Function *fn) : cfg(this), dom(this), func(fn) 117 Graph::Node *dn = dom.parent(); 358 Graph::Node *bn = &that->dom; 359 Graph::Node *dn = &this->dom;
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/ |
| H A D | nv50_ir_ssa.cpp | 168 insert(&BasicBlock::get(cfg->getRoot())->dom); 172 nw = &BasicBlock::get(vert[DOM(v)])->dom; 173 nv = &BasicBlock::get(vert[v])->dom; 206 for (chldIt = bb->dom.outgoing(); !chldIt.end(); chldIt.next()) { 525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next())
|
| H A D | nv50_ir_bb.cpp | 74 BasicBlock::BasicBlock(Function *fn) : cfg(this), dom(this), func(fn) 117 Graph::Node *dn = dom.parent(); 358 Graph::Node *bn = &that->dom; 359 Graph::Node *dn = &this->dom;
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ |
| H A D | ir3_merge_regs.c | 255 struct merge_def dom[a->regs_count + b->regs_count]; local in function:merge_sets_interfere 286 !def_dominates(dom[dom_index].reg, current.reg)) { 290 /* TODO: in the original paper, just dom[dom_index] needs to be 297 * higher in the stack then dom[dom_index]. In the paper there's a 305 if (can_skip_interference(¤t, &dom[i])) 309 * that dom[i] dominates current, this boils down to checking 310 * whether dom[i] is live after current. 312 if (ir3_def_live_after(live, dom[i].reg, current.reg->instr)) 316 dom[++dom_index] = current;
|
| /xsrc/external/mit/libpciaccess/dist/src/ |
| H A D | linux_sysfs.c | 206 unsigned dom, bus, dev, func; local in function:populate_entries 212 & dom, & bus, & dev, & func); 214 device->base.domain = dom; 220 if (dom > 0xffff) 223 device->base.domain_16 = dom;
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/rnn/ |
| H A D | rnn.c | 1283 static void prepdomain(struct rnndb *db, struct rnndomain *dom) { argument 1284 prepvarinfo (db, dom->name, &dom->varinfo, 0); 1286 for (i = 0; i < dom->subelemsnum; i++) 1287 prepdelem(db, dom->subelems[i], dom->bare?0:dom->name, &dom->varinfo, dom->width); 1288 dom [all...] |