| /xsrc/external/mit/libXaw/dist/src/ |
| Tree.c | 43 * This widget is based on the Tree widget described on pages 397-419 of
60 #define IsHorizontal(tw) ((tw)->tree.gravity == WestGravity || \
61 (tw)->tree.gravity == EastGravity)
100 * resources of the tree itself
104 XtOffsetOf(TreeRec, tree.auto_reconfigure), XtRImmediate,
107 XtOffsetOf(TreeRec, tree.hpad), XtRImmediate, (XtPointer) 0 },
109 XtOffsetOf(TreeRec, tree.vpad), XtRImmediate, (XtPointer) 0 },
111 XtOffsetOf(TreeRec, tree.foreground), XtRString,
114 XtOffsetOf(TreeRec, tree.line_width), XtRImmediate, (XtPointer) 0 },
116 XtOffsetOf(TreeRec, tree.gravity), XtRImmediate
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/broadcom/drm-shim/ |
| README.md | 3 This implements some of v3d using the closed source v3dv3 tree's
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| rb_tree_test.c | 72 validate_tree_order(struct rb_tree *tree, unsigned expected_count)
77 rb_tree_foreach(struct rb_test_node, n, tree, node) {
98 rb_tree_foreach_safe(struct rb_test_node, n, tree, node) {
119 rb_tree_foreach_rev(struct rb_test_node, n, tree, node) {
140 rb_tree_foreach_rev_safe(struct rb_test_node, n, tree, node) {
160 validate_search(struct rb_tree *tree, int first_number,
168 n = rb_tree_search(tree, &test_numbers[i], rb_test_node_cmp_void);
172 n = rb_tree_search_sloppy(tree, &test_numbers[i],
179 n = rb_tree_search(tree, &missing_key, rb_test_node_cmp_void);
182 n = rb_tree_search_sloppy(tree, &missing_key, rb_test_node_cmp_void)
211 struct rb_tree tree; local
[all...] |
| /xsrc/external/mit/xedit/dist/lisp/ |
| bytecode.c | 146 CodeTree *tree; member in union:_CodeTree::__anon45
217 CodeTree *tree, *tail; member in struct:_CodeBlock
493 /* Generate code tree */
1326 CompileFreeTree(CodeTree *tree)
1328 if (tree->type == CodeTreeBlock)
1329 CompileFreeBlock(tree->data.block);
1330 LispFree(tree);
1336 CodeTree *tree = block->tree, *next; local
1338 while (tree) {
1367 CodeTree *tree = LispMalloc(sizeof(CodeTree)); local
1384 CodeTree *tree = NEW_TREE(CodeTreeBlock); local
1411 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1420 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1429 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1438 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1447 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1457 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1471 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1513 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1546 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1582 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1598 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1608 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local
1653 CodeTree *tree; local
1812 CodeTree *tree, *prev, *next; local
2119 CodeTree *tree = block->tree; local
2139 CodeTree *ptr, *tree = block->tree; local
2434 CodeTree *tree; local
[all...] |
| compile.c | 91 CodeTree *tree = NULL, *group; local
98 tree = NEW_TREE(CodeTreeJumpIf);
99 tree->code = XBC_JUMPNIL;
100 group->group = tree;
101 group = tree;
107 group->group = tree;
175 CodeTree *group, *tree; local
187 tree = NEW_TREE(CodeTreeCond);
189 group->group = tree;
190 tree->code = XBC_JUMPNIL
252 CodeTree *group, *tree; local
435 CodeTree *tree; local
466 CodeTree *group, *tree; local
679 CodeTree *tree, *group; local
772 CodeTree *tree = NULL, *group; local
902 CodeTree *group, *tree; local
927 CodeTree *tree, *group, *ltree, *lgroup; local
962 CodeTree *group, *tree; local
987 CodeTree *tree, *group, *ltree, *lgroup; local
1055 CodeTree *tree; local
1277 CodeTree *tree; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/compiler/spirv/ |
| vtn_generator_ids_h.py | 59 tree = ET.parse(pargs.xml) variable
60 root = tree.getroot()
|
| /xsrc/external/mit/brotli/dist/c/enc/ |
| entropy_encode.c | 56 /* This function will create a Huffman tree.
58 The catch here is that the tree cannot be arbitrarily deep.
63 and this minimum value is raised until the tree matches the
74 HuffmanTree* tree,
92 InitHuffmanTree(&tree[n++], count, -1, (int16_t)i);
97 depth[tree[0].index_right_or_value_] = 1; /* Only one element. */
101 SortHuffmanTreeItems(tree, n, SortHuffmanTree);
110 tree[n] = sentinel;
111 tree[n + 1] = sentinel;
117 if (tree[i].total_count_ <= tree[j].total_count_)
[all...] |
| block_encoder_inc.h | 16 const size_t alphabet_size, HuffmanTree* tree,
28 alphabet_size, tree, &self->depths_[ix], &self->bits_[ix],
|
| brotli_bit_stream.c | 276 /* tree-select */
284 HuffmanTree* tree,
286 /* Write the Huffman tree into the brotli-representation.
304 /* Calculate the statistics of the Huffman tree in brotli-representation. */
321 /* Calculate another Huffman tree to use for compressing both the
322 earlier Huffman tree with. */
324 5, tree, code_length_bitdepth);
337 /* Store the real Huffman tree now. */
346 /* Builds a Huffman tree from histogram[0:length] into depth[0:length] and
347 bits[0:length] and stores the encoded tree to the bit stream. *
436 HuffmanTree* tree = BROTLI_ALLOC(m, HuffmanTree, max_tree_size); local
946 HuffmanTree* tree; local
1148 HuffmanTree* tree; local
[all...] |
| entropy_encode.h | 19 /* A node of a Huffman tree. */
37 /* This function will create a Huffman tree.
42 The depth contains the tree, i.e., how many bits are used for
45 The actual Huffman tree is constructed in the tree[] array, which has to
52 HuffmanTree* tree,
56 Huffman tree compression, especially its RLE-part will be more
65 /* Write a Huffman tree from bit depths into the bit-stream representation
66 of a Huffman tree. The generated Huffman tree is to be compressed onc
[all...] |
| /xsrc/external/mit/libX11/dist/modules/im/ximcp/ |
| imThaiIc.c | 72 Xfree (b->tree);
73 b->tree = NULL;
115 b->mb[b->tree[ic->private.local.composed].mb] = '\0';
116 b->wc[b->tree[ic->private.local.composed].wc] = '\0';
117 b->utf8[b->tree[ic->private.local.composed].utf8] = '\0';
160 DefTree *tree; local
170 if (! (ic->private.local.base.tree = tree = Xmalloc(sizeof(DefTree)*3)) )
179 tree[1].mb = 1;
180 tree[1].wc = 1
[all...] |
| /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/ |
| searchTree.h | 53 treeNode* TreeNodeFind(treeNode* tree, void* key,
58 treeNode* TreeNodeDeleteSingleNode(treeNode* tree, treeNode* node);
|
| searchTree.cc | 92 treeNode* TreeNodeFind(treeNode* tree, void* key,
95 if(tree == NULL)
97 if(key == tree->key)
98 return tree;
99 else if(compkey(key, tree->key) < 0)
100 return TreeNodeFind(tree->left, key, compkey);
102 return TreeNodeFind(tree->right, key, compkey);
111 /*going down the tree from the root.
142 treeNode* TreeNodeDeleteSingleNode(treeNode* tree, treeNode* node)
147 if(node==NULL) return tree;
[all...] |
| /xsrc/external/mit/libXaw/dist/include/X11/Xaw/ |
| Tree.h | 44 * This widget is based on the Tree widget described on pages 397-419 of
58 * Tree Widget (subclass of ConstraintClass)
130 Widget tree
|
| TreeP.h | 43 * This widget is based on the Tree widget described on pages 397-419 of
53 #include <X11/Xaw/Tree.h>
93 TreePart tree; member in struct:_TreeRec
108 Dimension bbsubwidth, bbsubheight; /* bounding box of sub tree */
119 TreeConstraintsPart tree; member in struct:_TreeConstraintsRec
|
| /xsrc/external/mit/xwininfo/dist/ |
| clientwin.c | 81 * Find a window that has WM_STATE set in the window tree below win.
90 xcb_query_tree_reply_t *tree; local
96 tree = xcb_query_tree_reply (dpy, qt_cookie, NULL);
97 if (!tree)
99 n_children = xcb_query_tree_children_length (tree);
101 free (tree);
104 children = xcb_query_tree_children (tree);
132 free (tree); /* includes children */
|
| /xsrc/external/mit/freetype/dist/src/gzip/ |
| infcodes.c | 39 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon5425::__anon5426
41 } code; /* if LEN or DIST, where in tree */
52 inflate_huft *ltree; /* literal/length/eob tree */
53 inflate_huft *dtree; /* distance tree */
118 c->sub.code.tree = c->ltree;
124 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
146 c->sub.code.tree = t + t->base;
165 c->sub.code.tree = c->dtree;
172 t = c->sub.code.tree + ((uInt)b & inflate_mask[j])
[all...] |
| /xsrc/external/mit/fontconfig/dist/src/ |
| fcdbg.c | 386 FcExprPrint (expr->u.tree.left);
388 FcExprPrint (expr->u.tree.right->u.tree.left);
390 FcExprPrint (expr->u.tree.right->u.tree.right);
414 FcExprPrint (expr->u.tree.left);
442 FcExprPrint (expr->u.tree.right);
446 FcExprPrint (expr->u.tree.left);
450 FcExprPrint (expr->u.tree.left);
454 FcExprPrint (expr->u.tree.left)
[all...] |
| /xsrc/external/mit/libpciaccess/dist/src/ |
| common_device_name.c | 103 * Each structure forms an internal node of an n-way tree. Each node selects
105 * root of the tree, a slice of the low-order bits of the vendor ID are
119 * (i.e., to pull-up levels of the n-way tree when all the children's children
141 * Root of the PCI vendor ID search tree.
143 _pci_hidden struct pci_id_node * tree = NULL; variable in typeref:struct:pci_id_node
148 * If the vendor ID does not exist in the tree, it is added.
156 if ( tree == NULL ) {
157 tree = calloc( 1, sizeof( struct pci_id_node ) );
159 if ( tree == NULL )
162 tree->bits = 4
[all...] |
| /xsrc/external/mit/xkeyboard-config/dist/tests/ |
| test_rules_xml.py | 31 tree = ET.parse(rules_xml)
32 root = tree.getroot()
43 tree = ET.parse(rules_xml)
44 root = tree.getroot()
180 tree = ET.parse(rules_xml)
181 root = tree.getroot()
197 tree = ET.parse(rules_xml)
198 root = tree.getroot()
|
| /xsrc/external/mit/xorg-server/dist/glx/ |
| indirect_util.c | 199 const int_fast16_t *const tree = dispatch_info->dispatch_tree; local
214 * If remaining_bits = 8 and tree[index] = 3, the mask of just the
220 next_remain = remaining_bits - tree[index];
228 index = tree[index + 1 + child_index];
243 /* The value stored in the tree for a leaf node is the base of
|
| /xsrc/external/mit/xorg-server.old/dist/glx/ |
| indirect_util.c | 213 const int_fast16_t * const tree = dispatch_info->dispatch_tree; local
230 * If remaining_bits = 8 and tree[index] = 3, the mask of just the
236 next_remain = remaining_bits - tree[index];
246 index = tree[index + 1 + child_index];
263 /* The value stored in the tree for a leaf node is the base of
|
| /xsrc/external/mit/xf86-video-intel/dist/ |
| .gitignore | 43 symlink-tree
|
| /xsrc/external/mit/xf86-video-xgi/dist/ |
| .gitignore | 43 symlink-tree
|
| /xsrc/external/mit/libX11/dist/src/xlibi18n/ |
| XimintL.h | 61 DefTree *tree; member in struct:_DefTreeBase
|
