HomeSort by: relevance | last modified time | path
    Searched defs:tree (Results 1 - 25 of 27) sorted by relevancy

1 2

  /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/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...]
imLcIm.c 75 DTStructIndex tree; member in struct:_XimCacheStruct
125 if (b->tree == NULL) return;
127 if (b->tree == _XimCachedDefaultTreeBase.tree) {
133 Xfree (b->tree);
134 b->tree = NULL;
304 _XimCachedDefaultTreeBase.tree = (DefTree *) (((char *) m) + m->tree);
314 /* fprintf (stderr, "read cached tree at %p: %s\n", (void *) m, name); */
450 if (! b->tree && ! (b->tree = Xcalloc (1, sizeof(DefTree)))
    [all...]
  /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/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 */
dsimple.c 301 xcb_query_tree_reply_t *tree; local
373 tree = xcb_query_tree_reply (dpy, cookies->query_tree, &err);
374 if (!tree) {
380 nchildren = xcb_query_tree_children_length (tree);
381 children = xcb_query_tree_children (tree);
416 free (tree); /* includes storage for children[] */
xwininfo.c 297 " -tree print children identifiers recursively\n"
307 " -all -tree, -stats, -bits, -events, -wm, -size, -shape\n"
443 int tree = 0, stats = 0, bits = 0, events = 0, wm = 0, size = 0, shape = 0; local
496 if (!strcmp (argv[i], "-tree")) {
497 tree = 1;
537 tree = stats = bits = events = wm = size = shape = 1;
586 if (!(children || tree || bits || events || wm || size))
610 if (children || tree)
670 if (children || tree)
671 Display_Tree_Info (w, tree);
1056 xcb_query_tree_reply_t *tree; local
1285 xcb_query_tree_reply_t *tree; local
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/valhall/
valhall.py 31 tree = ET.parse(os.path.join(os.path.dirname(__file__), 'ISA.xml')) variable
32 root = tree.getroot()
  /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/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/libX11/dist/src/xlibi18n/
XimintL.h 61 DefTree *tree; member in struct:_DefTreeBase
  /xsrc/external/mit/libXaw/dist/include/X11/Xaw/
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/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/xorg-server/dist/hw/xwin/glx/
gen_gl_wrappers.py 100 tree = etree.parse(regFilename) variable
101 reg.loadElementTree(tree)
  /xsrc/external/mit/brotli/dist/c/enc/
compress_fragment_two_pass.c 73 /* Tree size for building a tree over 64 symbols is 2 * 64 + 1. */
74 HuffmanTree tree[129]; local
77 BrotliCreateHuffmanTree(histogram, 64, 15, tree, depth);
78 BrotliCreateHuffmanTree(&histogram[64], 64, 14, tree, &depth[64]);
113 cmd_depth, BROTLI_NUM_COMMAND_SYMBOLS, tree, storage_ix, storage);
115 BrotliStoreHuffmanTree(&depth[64], 64, tree, storage_ix, storage);
compress_fragment.c 130 /* Tree size for building a tree over 64 symbols is 2 * 64 + 1. */
131 HuffmanTree tree[129]; local
135 BrotliCreateHuffmanTree(histogram, 64, 15, tree, depth);
136 BrotliCreateHuffmanTree(&histogram[64], 64, 14, tree, &depth[64]);
171 cmd_depth, BROTLI_NUM_COMMAND_SYMBOLS, tree, storage_ix, storage);
173 BrotliStoreHuffmanTree(&depth[64], 64, tree, storage_ix, storage);
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...]
  /xsrc/external/mit/MesaLib.old/dist/src/vulkan/wsi/
wsi_common_x11.c 337 xcb_query_tree_reply_t *tree; local
343 tree = xcb_query_tree_reply(conn, tree_cookie, NULL);
345 if (attrib == NULL || tree == NULL) {
347 free(tree);
351 xcb_window_t root = tree->root;
354 free(tree);
  /xsrc/external/mit/xedit/dist/lisp/
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...]
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...]
  /xsrc/external/mit/MesaLib/dist/src/vulkan/wsi/
wsi_common_x11.c 436 xcb_query_tree_reply_t *tree; local
442 tree = xcb_query_tree_reply(conn, tree_cookie, NULL);
444 if (attrib == NULL || tree == NULL) {
446 free(tree);
450 xcb_window_t root = tree->root;
453 free(tree);
  /xsrc/external/mit/xorg-server/dist/mi/
mioverlay.c 42 miOverlayTreePtr tree; member in struct:__anon10271
95 (MIOVERLAY_GET_WINDOW_PRIVATE(pWin)->tree)
187 pWinPriv->tree = NULL;
204 pWinPriv->tree = pTree;
1532 know about the second tree which is static to this file. */
  /xsrc/external/mit/xorg-server.old/dist/mi/
mioverlay.c 43 miOverlayTreePtr tree; member in struct:__anon10862
94 (MIOVERLAY_GET_WINDOW_PRIVATE(pWin)->tree)
188 pWinPriv->tree = NULL;
205 pWinPriv->tree = pTree;
1604 know about the second tree which is static to this file. */
  /xsrc/external/mit/fontconfig/dist/src/
fcint.h 297 } tree; member in union:_FcExpr::__anon5396

Completed in 31 milliseconds

1 2