| /xsrc/external/mit/glu/dist/src/libnurbs/internals/ |
| displaylist.h | 73 Dlnode *nodes; member in class:DisplayList
|
| /xsrc/external/mit/glu/dist/src/libtess/ |
| priorityq-heap.h | 69 * complicated than an ordinary heap. "nodes" is the heap itself;
70 * active nodes are stored in the range 1..pq->size. When the
72 * The children of node i are nodes 2i and 2i+1.
76 * represents that key (ie. nodes[handles[i].node].handle == i).
87 PQnode *nodes; member in struct:PriorityQ
104 #define __gl_pqHeapMinimum(pq) ((pq)->handles[(pq)->nodes[1].handle].key)
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/glsl/ |
| loop_unroll.cpp | 60 int nodes; member in class:loop_unroll_count
70 nodes = 0;
80 nodes++;
86 nodes++;
480 count.nested_loop || count.nodes * iterations > max_iterations * 5;
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| rb_tree_test.c | 210 struct rb_test_node nodes[ARRAY_SIZE(test_numbers)]; local
216 nodes[i].key = test_numbers[i];
217 rb_tree_insert(&tree, &nodes[i].node, rb_test_node_cmp);
224 rb_tree_remove(&tree, &nodes[i].node);
|
| register_allocate_internal.h | 92 * List of which nodes this node interferes with. This should be
110 * interfering nodes not in the stack.
134 struct ra_node *nodes; member in struct:ra_graph
135 unsigned int count; /**< count of nodes. */
137 unsigned int alloc; /**< count of nodes allocated. */
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/ |
| loop_unroll.cpp | 60 int nodes; member in class:loop_unroll_count
70 nodes = 0;
80 nodes++;
86 nodes++;
487 count.nested_loop || count.nodes * iterations > max_iterations * 5;
|
| /xsrc/external/mit/freetype/dist/src/cache/ |
| ftcmru.h | 36 * Note that it is possible to pre-allocate the element list nodes.
124 FTC_MruNode nodes; member in struct:FTC_MruListRec_
166 FTC_MruNode* _pfirst = &(list)->nodes; \
220 FTC_MruNode _first = (list)->nodes; \
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 203 nodes = new Graph::Node * [graph->getSize() + 1];
206 nodes[graph->getSize()] = 0;
216 if (nodes)
217 delete[] nodes;
223 nodes[count++] = node;
230 nodes[count++] = node;
235 virtual void *get() const { return nodes[pos]; }
239 Graph::Node **nodes; member in class:nv50_ir::DFSIterator
259 nodes = new Graph::Node * [graph->getSize() + 1];
262 nodes[graph->getSize()] = 0
323 Graph::Node **nodes; member in class:nv50_ir::CFGIterator
[all...] |
| nv50_ir_ra.cpp | 423 // BB invalidates all the PHI nodes since their sources are implicitly ordered
426 // TODO: Make it so that that is not the case, and PHI nodes store pointers to
450 // nodes after the graph has been modified.
813 inline RIG_Node *getNode(const LValue *v) const { return &nodes[v->id]; }
843 RIG_Node *nodes; member in class:nv50_ir::GCRA
888 if (!nodes[i].colors)
892 nodes[i].f,nodes[i].reg,nodes[i].colors,
893 nodes[i].weight
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 203 nodes = new Graph::Node * [graph->getSize() + 1];
206 nodes[graph->getSize()] = 0;
216 if (nodes)
217 delete[] nodes;
223 nodes[count++] = node;
230 nodes[count++] = node;
235 virtual void *get() const { return nodes[pos]; }
239 Graph::Node **nodes; member in class:nv50_ir::DFSIterator
259 nodes = new Graph::Node * [graph->getSize() + 1];
262 nodes[graph->getSize()] = 0
324 Graph::Node **nodes; member in class:nv50_ir::CFGIterator
[all...] |
| nv50_ir_ra.cpp | 378 // BB invalidates all the PHI nodes since their sources are implicitly ordered
381 // TODO: Make it so that that is not the case, and PHI nodes store pointers to
405 // nodes after the graph has been modified.
770 inline RIG_Node *getNode(const LValue *v) const { return &nodes[v->id]; }
800 RIG_Node *nodes; member in class:nv50_ir::GCRA
843 if (!nodes[i].colors)
847 nodes[i].f,nodes[i].reg,nodes[i].colors,
848 nodes[i].weight
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| nir_from_ssa.c | 78 * nodes in a given set interfere. Merging two sets or checking for
80 * two lists of nodes.
91 struct exec_list nodes; member in struct:merge_set
103 foreach_list_typed(merge_node, node, node, &set->nodes) {
129 exec_list_make_empty(&set->nodes);
136 exec_list_push_head(&set->nodes, &node->node);
153 struct exec_node *an = exec_list_get_head(&a->nodes);
154 struct exec_node *bn = exec_list_get_head(&b->nodes);
189 struct exec_node *an = exec_list_get_head(&a->nodes);
190 struct exec_node *bn = exec_list_get_head(&b->nodes);
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_from_ssa.c | 112 * nodes in a given set interfere. Merging two sets or checking for
114 * two lists of nodes.
125 struct exec_list nodes; member in struct:merge_set
138 foreach_list_typed(merge_node, node, node, &set->nodes) {
161 exec_list_make_empty(&set->nodes);
169 exec_list_push_head(&set->nodes, &node->node);
197 struct exec_node *an = exec_list_get_head(&a->nodes);
198 struct exec_node *bn = exec_list_get_head(&b->nodes);
231 /* List of all the nodes which dominate the current node, in dominance
237 struct exec_node *an = exec_list_get_head(&a->nodes);
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| register_allocate.c | 34 * edges in the graph between nodes that interfere (can't be allocated
41 * That likely causes other nodes to become trivially colorable as well.
43 * Then during the "select" process, nodes are popped off of that
126 * List of which nodes this node interferes with. This should be
150 * interfering nodes not in the stack.
165 struct ra_node *nodes; member in struct:ra_graph
166 unsigned int count; /**< count of nodes. */
226 * it allocates the nodes.
396 BITSET_SET(g->nodes[n1].adjacency, n2);
400 int n1_class = g->nodes[n1].class
[all...] |
| /xsrc/external/mit/freetype/dist/src/base/ |
| ftdbgmem.c | 115 FT_Long nodes; member in struct:FT_MemTableRec_
260 new_size = ft_mem_closest_prime( table->nodes );
318 table->nodes = 0;
394 table->nodes = 0;
591 table->nodes++;
598 if ( table->nodes * 3 < table->size ||
599 table->size * 3 < table->nodes )
656 table->nodes--;
665 if ( table->nodes * 3 < table->size ||
666 table->size * 3 < table->nodes )
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/rasterizer/core/core/ |
| threads.cpp | 283 // Prune empty cores and numa nodes
299 // Erase empty numa nodes (second)
1002 CPUNumaNodes nodes; local
1004 CalculateProcessorTopology(nodes, numThreadsPerProcGroup);
1009 uint32_t numHWNodes = (uint32_t)nodes.size();
1010 uint32_t numHWCoresPerNode = (uint32_t)nodes[0].cores.size();
1011 uint32_t numHWHyperThreads = (uint32_t)nodes[0].cores[0].threadIds.size();
1027 for (auto const& node : nodes)
1061 for (auto& node : nodes)
1091 // Calc used NUMA nodes
[all...] |
| /xsrc/external/mit/brotli/dist/c/enc/ |
| backward_references_hq.c | 246 /* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */
248 static BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos,
251 ZopfliNode* next = &nodes[pos + len];
303 const ZopfliNode* nodes,
311 while (pos + len <= num_bytes && nodes[pos + len].u.cost <= min_cost) {
327 /* REQUIRES: nodes[pos].cost < kInfinity
328 REQUIRES: nodes[0..pos] satisfies that "ZopfliNode array invariant". */
333 const ZopfliNode* nodes) {
334 const size_t clen = ZopfliNodeCopyLength(&nodes[pos]);
335 const size_t ilen = nodes[pos].dcode_insert_length & 0x7FFFFFF
727 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, num_bytes + 1); local
757 ZopfliNode* nodes; local
[all...] |
| encode.c | 1278 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, block_size + 1); local
1281 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) goto oom;
1282 BrotliInitZopfliNodes(nodes, block_size + 1);
1287 nodes);
1309 BrotliZopfliCreateCommands(block_size, block_start, &nodes[0], dist_cache,
1314 BROTLI_FREE(m, nodes);
|
| /xsrc/external/mit/fontconfig/dist/src/ |
| fcmatch.c | 1217 FcSortNode *nodes; local
1264 nodes = malloc (nnodes * sizeof (FcSortNode) +
1267 if (!nodes)
1269 nodeps = (FcSortNode **) (nodes + nnodes);
1274 new = nodes;
1308 nnodes = new - nodes;
1372 free (nodes);
1387 free (nodes);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/ |
| gpir.h | 160 /* for nodes relationship */
288 * worry about nodes that can't use the complex slot for (2), since there
301 * nodes for the next instruction) but when there is a complex1 node in
419 gpir_node *nodes[4]; member in struct:gpir_compiler::__anon1274
|
| /xsrc/external/mit/libdrm/dist/ |
| xf86drm.h | 909 char **nodes; /* DRM_NODE_MAX sized array */ member in struct:_drmDevice
|
| /xsrc/external/mit/MesaLib/dist/src/imgui/ |
| imstb_truetype.h | 689 void *nodes; member in struct:stbtt_pack_context
3757 static void stbrp_init_target(stbrp_context *con, int pw, int ph, stbrp_node *nodes, int num_nodes)
3764 STBTT__NOTUSED(nodes);
3801 stbrp_node *nodes = (stbrp_node *) STBTT_malloc(sizeof(*nodes ) * num_nodes,alloc_context);
3803 if (context == NULL || nodes == NULL) {
3805 if (nodes != NULL) STBTT_free(nodes , alloc_context);
3814 spc->nodes = nodes;
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/panfrost/midgard/ |
| midgard_compile.c | 2221 int nodes = ctx->temp_count; local
2222 struct ra_graph *g = ra_alloc_interference_graph(regs, nodes);
2253 int *live_start = malloc(nodes * sizeof(int));
2254 int *live_end = malloc(nodes * sizeof(int));
2258 for (int i = 0; i < nodes; ++i) {
2309 for (int i = 0; i < nodes; ++i) {
2316 /* Setup interference between nodes that are live at the same time */
2318 for (int i = 0; i < nodes; ++i) {
2319 for (int j = i + 1; j < nodes; ++j) {
|
| /xsrc/external/mit/MesaLib.old/dist/src/imgui/ |
| imstb_truetype.h | 689 void *nodes; member in struct:stbtt_pack_context
3757 static void stbrp_init_target(stbrp_context *con, int pw, int ph, stbrp_node *nodes, int num_nodes)
3764 STBTT__NOTUSED(nodes);
3801 stbrp_node *nodes = (stbrp_node *) STBTT_malloc(sizeof(*nodes ) * num_nodes,alloc_context);
3803 if (context == NULL || nodes == NULL) {
3805 if (nodes != NULL) STBTT_free(nodes , alloc_context);
3814 spc->nodes = nodes;
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/microsoft/compiler/ |
| nir_to_dxil.c | 1262 const struct dxil_mdnode *nodes[] = { local
1269 return dxil_get_metadata_node(&ctx->mod, nodes,
1270 ARRAY_SIZE(nodes));
4413 /* PHI nodes are difficult to get right when tracking the types:
|
