HomeSort by: relevance | last modified time | path
    Searched defs:trees (Results 1 - 8 of 8) sorted by relevancy

  /src/external/gpl2/dtc/dist/tests/
dumptrees.c 22 } trees[] = { variable in typeref:struct:__anon9138
31 #define NUM_TREES (sizeof(trees) / sizeof(trees[0]))
38 void *blob = trees[i].blob;
39 const char *filename = trees[i].filename;
  /src/external/gpl3/gcc/dist/gcc/lto/
lto-common.cc 592 /* Remember trees that contains references to declarations. */
1019 /* Number of trees in the SCC. */
1387 /* Only non-NULL trees outside of the SCC may compare equal. */ \
1622 on the scc as all trees will be freed. */
1811 trees it reffers to). */
1909 /* Because we stream in SCC order we know that all unshared trees
2645 vec<tree, va_gc> *trees = state->streams[si]; local
2646 for (i = 0; i < vec_safe_length (trees); i++)
2648 tree t = (*trees)[i];
2653 (*trees)[i] = lto_symtab_prevailing_decl (t)
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
lto-streamer-out.cc 306 index = encoder->trees.length ();
313 encoder->trees.safe_push (t);
532 trees handled in dwarf2out_die_ref_for_decl. */
653 to all trees referring to T and they are not streamed with additional
658 not make other trees local as well. */
783 /* Remember that trees are local so info gets propagated to other
793 make other trees local (all global decls reffer to it via
855 of trees referring to them. */
877 /* Non-trivial SCCs must be packed to trees blocks so forward
1176 CACHE holds hash values of trees outside current SCC. MAP, if non-NULL
2617 vec<tree, va_gc> *trees = in_state->streams[i]; local
    [all...]
lto-streamer.h 158 /* Sequence of trees. */
164 /* Tags of trees are encoded as
265 /* The location cache holds expanded locations for streamed in trees.
273 trees. */
321 /* Accepted entries are ones used by trees that are known to be not unified
481 /* The lto_tree_ref_encoder struct is used to encode trees into indices. */
486 vec<tree> trees; /* Maps indices to pointers. */ member in struct:lto_tree_ref_encoder
735 /* All trees identified as local to the unit streamed. */
1055 encoder->trees.create (0);
1067 encoder->trees.release ()
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/lto/
lto-common.cc 592 /* Remember trees that contains references to declarations. */
1019 /* Number of trees in the SCC. */
1382 /* Only non-NULL trees outside of the SCC may compare equal. */ \
1617 on the scc as all trees will be freed. */
1806 trees it reffers to). */
1904 /* Because we stream in SCC order we know that all unshared trees
2629 vec<tree, va_gc> *trees = state->streams[si]; local
2630 for (i = 0; i < vec_safe_length (trees); i++)
2632 tree t = (*trees)[i];
2637 (*trees)[i] = lto_symtab_prevailing_decl (t)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
lto-streamer-out.cc 299 index = encoder->trees.length ();
306 encoder->trees.safe_push (t);
525 trees handled in dwarf2out_die_ref_for_decl. */
646 to all trees referring to T and they are not streamed with additional
651 not make other trees local as well. */
776 /* Remember that trees are local so info gets propagated to other
786 make other trees local (all global decls reffer to it via
848 of trees referring to them. */
870 /* Non-trivial SCCs must be packed to trees blocks so forward
1170 CACHE holds hash values of trees outside current SCC. MAP, if non-NULL
2594 vec<tree, va_gc> *trees = in_state->streams[i]; local
    [all...]
lto-streamer.h 158 /* Sequence of trees. */
164 /* Tags of trees are encoded as
265 /* The location cache holds expanded locations for streamed in trees.
273 trees. */
320 /* Accepted entries are ones used by trees that are known to be not unified
479 /* The lto_tree_ref_encoder struct is used to encode trees into indices. */
484 vec<tree> trees; /* Maps indices to pointers. */ member in struct:lto_tree_ref_encoder
730 /* All trees identified as local to the unit streamed. */
1050 encoder->trees.create (0);
1062 encoder->trees.release ()
    [all...]
  /src/sys/net/
zlib.c 463 /* used by trees.c: */
476 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
480 * The same heap array is used to build all trees.
484 /* Depth of each subtree used as tie breaker for trees of equal frequency
500 * - creating new Huffman trees less frequently may not provide fast
505 * trees more frequently.
517 ulg opt_len; /* bit length of current block with optimal trees */
518 ulg static_len; /* bit length of current block with static trees */
554 /* in trees.c */
1969 /* +++ trees.c *
3905 } trees; \/* if DTREE, decoding info for trees *\/ member in union:inflate_blocks_state::__anon7107
    [all...]

Completed in 33 milliseconds