Searched refs:nodes (Results 1 - 25 of 94) sorted by relevance

1234

/xsrc/external/mit/glu/dist/src/libnurbs/internals/
H A Ddisplaylist.cc49 lastNode = &nodes;
55 for( Dlnode *nextNode; nodes; nodes = nextNode ) {
56 nextNode = nodes->next;
57 if( nodes->cleanup != 0 ) (nt->*nodes->cleanup)( nodes->arg );
58 //nodes->deleteMe(dlnodePool);
65 for( Dlnode *node = nodes; node; node = node->next )
H A Ddisplaylist.h73 Dlnode *nodes; member in class:DisplayList
/xsrc/external/mit/MesaLib.old/dist/src/util/
H A Dregister_allocate.c34 * 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[n
[all...]
/xsrc/external/mit/glu/dist/src/libtess/
H A Dpriorityq-heap.c65 pq->nodes = (PQnode *)memAlloc( (INIT_SIZE + 1) * sizeof(pq->nodes[0]) );
66 if (pq->nodes == NULL) {
73 memFree(pq->nodes);
82 pq->nodes[1].handle = 1; /* so that Minimum() returns NULL */
91 memFree( pq->nodes );
98 PQnode *n = pq->nodes;
128 PQnode *n = pq->nodes;
170 PQnode *saveNodes= pq->nodes;
175 pq->nodes
[all...]
H A Dpriorityq-heap.h69 * 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/util/
H A Dregister_allocate.c34 * 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
123 * it allocates the nodes.
479 BITSET_SET(g->nodes[n1].adjacency, n2);
483 int n1_class = g->nodes[n1].class;
484 int n2_class = g->nodes[n2].class;
485 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class];
487 util_dynarray_append(&g->nodes[n1].adjacency_list, unsigned int, n2);
493 BITSET_CLEAR(g->nodes[n
[all...]
H A Dregister_allocate_internal.h92 * 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. */
H A Drb_tree_test.c210 struct rb_test_node nodes[ARRAY_SIZE(test_numbers)]; local in function:main
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);
/xsrc/external/mit/brotli/dist/c/enc/
H A Dbackward_references_hq.c246 /* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */
248 static BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos, argument
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[po
302 ComputeMinimumCopyLength(const float start_cost,const ZopfliNode * nodes,const size_t num_bytes,const size_t pos) argument
329 ComputeDistanceShortcut(const size_t block_start,const size_t pos,const size_t max_backward_limit,const size_t gap,const ZopfliNode * nodes) argument
360 ComputeDistanceCache(const size_t pos,const int * starting_dist_cache,const ZopfliNode * nodes,int * dist_cache) argument
381 EvaluateNode(const size_t block_start,const size_t pos,const size_t max_backward_limit,const size_t gap,const int * starting_dist_cache,const ZopfliCostModel * model,StartPosQueue * queue,ZopfliNode * nodes) argument
402 UpdateNodes(const size_t num_bytes,const size_t block_start,const size_t pos,const uint8_t * ringbuffer,const size_t ringbuffer_mask,const BrotliEncoderParams * params,const size_t max_backward_limit,const int * starting_dist_cache,const size_t num_matches,const BackwardMatch * matches,const ZopfliCostModel * model,StartPosQueue * queue,ZopfliNode * nodes) argument
554 ComputeShortestPathFromNodes(size_t num_bytes,ZopfliNode * nodes) argument
571 BrotliZopfliCreateCommands(const size_t num_bytes,const size_t block_start,const ZopfliNode * nodes,int * dist_cache,size_t * last_insert_len,const BrotliEncoderParams * params,Command * commands,size_t * num_literals) argument
616 ZopfliIterate(size_t num_bytes,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,const BrotliEncoderParams * params,const size_t gap,const int * dist_cache,const ZopfliCostModel * model,const uint32_t * num_matches,const BackwardMatch * matches,ZopfliNode * nodes) argument
657 BrotliZopfliComputeShortestPath(MemoryManager * m,size_t num_bytes,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,ContextLut literal_context_lut,const BrotliEncoderParams * params,const int * dist_cache,Hasher * hasher,ZopfliNode * nodes) argument
727 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, num_bytes + 1); local in function:BrotliCreateZopfliBackwardReferences
757 ZopfliNode* nodes; local in function:BrotliCreateHqZopfliBackwardReferences
[all...]
H A Dbackward_references_hq.h74 On return, the nodes[0..num_bytes] array will have the following
76 For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
77 (1) nodes[i].copy_length() >= 2
78 (2) nodes[i].command_length() <= i and
79 (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
84 const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);
87 const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes,
/xsrc/external/mit/freetype/dist/src/cache/
H A Dftcmru.c176 list->nodes = NULL;
186 while ( list->nodes )
187 FTC_MruList_Remove( list, list->nodes );
209 first = list->nodes;
220 FTC_MruNode_Up( &list->nodes, node );
246 node = list->nodes->prev;
252 FTC_MruNode_Up( &list->nodes, node );
259 FTC_MruNode_Remove( &list->nodes, node );
272 FTC_MruNode_Prepend( &list->nodes, node );
310 FTC_MruNode_Remove( &list->nodes, nod
[all...]
H A Dftcmru.h36 * 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/docs/_exts/
H A Dformatting.py6 import docutils.nodes
15 signode += docutils.nodes.Text(' ')
17 signode += docutils.nodes.Text(', ')
H A Dnir.py23 import docutils.nodes
29 from sphinx.util.nodes import make_refnode
92 params += docutils.nodes.Text(nir_alu_type_name(t, s) + ' ')
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp203 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[grap
324 Graph::Node **nodes; member in class:nv50_ir::CFGIterator
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp203 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[grap
323 Graph::Node **nodes; member in class:nv50_ir::CFGIterator
[all...]
/xsrc/external/mit/libdrm/dist/tests/
H A Ddrmdevice.c40 printf("+-> nodes\n");
43 printf("| +-> nodes[%d] %s\n", j, device->nodes[j]);
144 printf("--- Opening device node %s ---\n", devices[i]->nodes[j]);
145 fd = open(devices[i]->nodes[j], O_RDONLY | O_CLOEXEC);
151 printf("--- Retrieving device info, for node %s ---\n", devices[i]->nodes[j]);
/xsrc/external/mit/MesaLib.old/dist/src/gallium/docs/source/exts/
H A Dformatting.py6 import docutils.nodes
/xsrc/external/mit/libdrm/dist/tests/util/
H A Dkms.c124 // Select only primary nodes
128 printf("trying to open device '%s'... ", device->nodes[DRM_NODE_PRIMARY]);
129 fd = open(device->nodes[DRM_NODE_PRIMARY], O_RDWR | O_CLOEXEC);
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/
H A Dnotes.markdown94 nodes contain a list of subnodes.
96 #### Control flow nodes
103 All loops and if's in the program are enclosed in region nodes.
104 Region nodes have two containers for phi nodes -
128 The target region of depart and repeat nodes is always the region where
154 <region #0 phi nodes >
166 <region #0 loop_phi nodes>
177 <region #0 phi nodes>
181 depart and repeat nodes fo
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sb/
H A Dnotes.markdown94 nodes contain a list of subnodes.
96 #### Control flow nodes
103 All loops and if's in the program are enclosed in region nodes.
104 Region nodes have two containers for phi nodes -
128 The target region of depart and repeat nodes is always the region where
154 <region #0 phi nodes >
166 <region #0 loop_phi nodes>
177 <region #0 phi nodes>
181 depart and repeat nodes fo
[all...]
/xsrc/external/mit/MesaLib/dist/src/util/tests/
H A Ddag_test.cpp69 init_nodes(struct dag *dag, struct node *nodes, unsigned num_nodes) argument
72 dag_init_node(dag, static_cast<struct dag_node *>(&nodes[i]));
73 nodes[i].val = i;
/xsrc/external/mit/MesaLib/dist/src/tool/pps/
H A Dpps_device.cc78 int fd = open(device->nodes[DRM_NODE_RENDER], O_RDWR);
104 int fd = open(device->nodes[DRM_NODE_RENDER], O_RDONLY);
/xsrc/external/mit/freetype/dist/src/base/
H A Dftdbgmem.c115 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/dist/src/compiler/glsl/
H A Dloop_unroll.cpp60 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;

Completed in 57 milliseconds

1234