Searched refs:tree (Results 1 - 25 of 380) sorted by relevance

1234567891011>>

/xsrc/external/mit/libXaw/dist/src/
H A DTree.c60 #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,
120 XtOffsetOf(TreeRec, tree
725 compute_bounding_box_subtree(TreeWidget tree,Widget w,int depth) argument
834 arrange_subtree(TreeWidget tree,Widget w,int depth,int x,int y) argument
1011 XawTreeForceLayout(Widget tree) argument
[all...]
/xsrc/external/mit/xorg-server.old/dist/hw/dmx/doc/html/
H A Dnavtree.css1 #nav-tree .children_ul {
6 #nav-tree ul {
12 #nav-tree li {
18 #nav-tree .plus {
22 #nav-tree .selected {
29 #nav-tree img {
36 #nav-tree a {
43 #nav-tree .label {
48 #nav-tree .label a {
52 #nav-tree
[all...]
/xsrc/external/mit/MesaLib/dist/src/compiler/spirv/
H A Dvtn_generator_ids_h.py59 tree = ET.parse(pargs.xml) variable
60 root = tree.getroot()
/xsrc/external/mit/MesaLib/dist/src/util/
H A Drb_tree_test.c72 validate_tree_order(struct rb_tree *tree, unsigned expected_count) argument
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, argument
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,
211 struct rb_tree tree; local in function:main
[all...]
/xsrc/external/mit/xedit/dist/lisp/
H A Dbytecode.c146 CodeTree *tree; member in union:_CodeTree::__anoncf77c6ed020a
217 CodeTree *tree, *tail; member in struct:_CodeBlock
493 /* Generate code tree */
1326 CompileFreeTree(CodeTree *tree) argument
1328 if (tree->type == CodeTreeBlock)
1329 CompileFreeBlock(tree->data.block);
1330 LispFree(tree);
1336 CodeTree *tree = block->tree, *next; local in function:CompileFreeBlock
1338 while (tree) {
1367 CodeTree *tree = LispMalloc(sizeof(CodeTree)); local in function:CompileNewTree
1384 CodeTree *tree = NEW_TREE(CodeTreeBlock); local in function:CompileIniBlock
1411 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_BytecodeChar
1420 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_BytecodeShort
1429 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_BytecodeAtom
1438 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_BytecodeObject
1447 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_BytecodeCons
1457 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_Bytecode
1471 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_LoadLet
1513 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_LoadSymLet
1546 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_LoadConLet
1582 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_Struct
1598 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_Call
1608 CodeTree *tree = NEW_TREE(CodeTreeBytecode); local in function:com_Bytecall
1653 CodeTree *tree; local in function:LinkWarnUnused
1671 LinkBuildOffsets(LispCom * com,CodeTree * tree,long offset) argument
1812 CodeTree *tree, *prev, *next; local in function:LinkDoOptimize_0
2119 CodeTree *tree = block->tree; local in function:LinkResolveLabels
2139 CodeTree *ptr, *tree = block->tree; local in function:LinkResolveJumps
2234 LinkFixupOffsets(LispCom * com,CodeTree * tree,long adjust) argument
2279 LinkSkipPadding(LispCom * com,CodeTree * tree) argument
2338 LinkCalculateJump(LispCom * com,CodeTree * tree,LispByteOpcode code) argument
2356 LinkFixupJumps(LispCom * com,CodeTree * tree) argument
2434 CodeTree *tree; local in function:LinkBuildTables
2500 LinkEmmitBytecode(LispCom * com,CodeTree * tree,unsigned char * bytecode,long offset) argument
[all...]
H A Dcompile.c91 CodeTree *tree = NULL, *group; local in function:Com_And
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 in function:Com_Cond
187 tree = NEW_TREE(CodeTreeCond);
189 group->group = tree;
190 tree
252 CodeTree *group, *tree; local in function:Com_Dolist
435 CodeTree *tree; local in function:Com_Go
466 CodeTree *group, *tree; local in function:Com_If
679 CodeTree *tree, *group; local in function:Com_Loop
772 CodeTree *tree = NULL, *group; local in function:Com_Or
902 CodeTree *group, *tree; local in function:Com_Unless
927 CodeTree *tree, *group, *ltree, *lgroup; local in function:Com_Until
962 CodeTree *group, *tree; local in function:Com_When
987 CodeTree *tree, *group, *ltree, *lgroup; local in function:Com_While
1055 CodeTree *tree; local in function:ComReturnFrom
1277 CodeTree *tree; local in function:ComLabel
[all...]
/xsrc/external/mit/brotli/dist/c/enc/
H A Dentropy_encode.c56 /* 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[
71 BrotliCreateHuffmanTree(const uint32_t * data,const size_t length,const int tree_limit,HuffmanTree * tree,uint8_t * depth) argument
163 BrotliWriteHuffmanTreeRepetitions(const uint8_t previous_value,const uint8_t value,size_t repetitions,size_t * tree_size,uint8_t * tree,uint8_t * extra_bits_data) argument
208 BrotliWriteHuffmanTreeRepetitionsZeros(size_t repetitions,size_t * tree_size,uint8_t * tree,uint8_t * extra_bits_data) argument
405 BrotliWriteHuffmanTree(const uint8_t * depth,size_t length,size_t * tree_size,uint8_t * tree,uint8_t * extra_bits_data) argument
[all...]
H A Dblock_encoder_inc.h16 const size_t alphabet_size, HuffmanTree* tree,
28 alphabet_size, tree, &self->depths_[ix], &self->bits_[ix],
H A Dbrotli_bit_stream.c276 /* 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 t
283 BrotliStoreHuffmanTree(const uint8_t * depths,size_t num,HuffmanTree * tree,size_t * storage_ix,uint8_t * storage) argument
348 BuildAndStoreHuffmanTree(const uint32_t * histogram,const size_t histogram_length,const size_t alphabet_size,HuffmanTree * tree,uint8_t * depth,uint16_t * bits,size_t * storage_ix,uint8_t * storage) argument
436 HuffmanTree* tree = BROTLI_ALLOC(m, HuffmanTree, max_tree_size); local in function:BrotliBuildAndStoreHuffmanTreeFast
680 EncodeContextMap(MemoryManager * m,const uint32_t * context_map,size_t context_map_size,size_t num_clusters,HuffmanTree * tree,size_t * storage_ix,uint8_t * storage) argument
756 BuildAndStoreBlockSplitCode(const uint8_t * types,const uint32_t * lengths,const size_t num_blocks,const size_t num_types,HuffmanTree * tree,BlockSplitCode * code,size_t * storage_ix,uint8_t * storage) argument
790 StoreTrivialContextMap(size_t num_types,size_t context_bits,HuffmanTree * tree,size_t * storage_ix,uint8_t * storage) argument
865 BuildAndStoreBlockSwitchEntropyCodes(BlockEncoder * self,HuffmanTree * tree,size_t * storage_ix,uint8_t * storage) argument
946 HuffmanTree* tree; local in function:BrotliStoreMetaBlock
1148 HuffmanTree* tree; local in function:BrotliStoreMetaBlockTrivial
[all...]
H A Dentropy_encode.h19 /* 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 i
[all...]
/xsrc/external/mit/libX11/dist/modules/im/ximcp/
H A DimThaiIc.c72 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 in function:_XimThaiCreateIC
170 if (! (ic->private.local.base.tree = tree = Xmalloc(sizeof(DefTree)*3)) )
179 tree[1].mb = 1;
180 tree[
[all...]
/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DsearchTree.h53 treeNode* TreeNodeFind(treeNode* tree, void* key,
58 treeNode* TreeNodeDeleteSingleNode(treeNode* tree, treeNode* node);
H A DsearchTree.cc92 treeNode* TreeNodeFind(treeNode* tree, void* key, argument
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) argument
147 if(node==NULL) return tree;
[all...]
/xsrc/external/mit/libXaw/dist/include/X11/Xaw/
H A DTree.h130 Widget tree
H A DTreeP.h93 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/
H A Dclientwin.c80 * Find a window that has WM_STATE set in the window tree below win.
89 xcb_query_tree_reply_t *tree; local in function:Find_Client_In_Children
95 tree = xcb_query_tree_reply (dpy, qt_cookie, NULL);
96 if (!tree)
98 n_children = xcb_query_tree_children_length (tree);
100 free (tree);
103 children = xcb_query_tree_children (tree);
131 free (tree); /* includes children */
/xsrc/external/mit/xkeyboard-config/dist/tests/
H A Dtest_rules_xml.py31 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/freetype/dist/src/gzip/
H A Dinfcodes.c39 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon1a223bc8020a::__anon1a223bc80308
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
[all...]
/xsrc/external/mit/fontconfig/dist/src/
H A Dfcdbg.c386 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
[all...]
/xsrc/external/mit/lndir/dist/
H A DREADME.md1 lndir - create a shadow directory of symbolic links to another directory tree
/xsrc/external/mit/libpciaccess/dist/src/
H A Dcommon_device_name.c103 * 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
[all...]
/xsrc/external/mit/xorg-server.old/dist/glx/
H A Dindirect_util.c213 const int_fast16_t * const tree = dispatch_info->dispatch_tree; local in function:get_decode_index
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/xorg-server/dist/glx/
H A Dindirect_util.c199 const int_fast16_t *const tree = dispatch_info->dispatch_tree; local in function:get_decode_index
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/MesaLib.old/dist/src/mapi/glapi/gen/
H A DglX_server_table.py240 # The first structure is an N-way tree where the opcode for
246 # The tree is stored as a flat array. The first value is the
263 # As the tree is traversed, an accumulator is kept. This
271 # Creation of the tree is the most complicated part. At
279 tree = self.divide_group(0, 0)
282 print '/* tree depth = %u */' % (tree[3])
283 print 'static const int_fast16_t %s_dispatch_tree[%u] = {' % (self.name_base, tree[2])
284 self.dump_tree(tree, 0, self.max_bits, 0, 1)
287 # After dumping the tree, dum
[all...]
/xsrc/external/mit/MesaLib/dist/src/mapi/glapi/gen/
H A DglX_server_table.py240 # The first structure is an N-way tree where the opcode for
246 # The tree is stored as a flat array. The first value is the
263 # As the tree is traversed, an accumulator is kept. This
271 # Creation of the tree is the most complicated part. At
279 tree = self.divide_group(0, 0)
282 print '/* tree depth = %u */' % (tree[3])
283 print 'static const int_fast16_t %s_dispatch_tree[%u] = {' % (self.name_base, tree[2])
284 self.dump_tree(tree, 0, self.max_bits, 0, 1)
287 # After dumping the tree, dum
[all...]

Completed in 22 milliseconds

1234567891011>>