Home
last modified time | relevance | path

Searched refs:TREE_STRING_LENGTH (Results 1 – 25 of 30) sorted by relevance

12

/freebsd-9-stable/contrib/gcc/
Dc-pragma.c497 pragma_extern_prefix = (TREE_STRING_LENGTH (prefix) > 1 ? prefix : NULL); in handle_pragma_extern_prefix()
576 size_t plen = TREE_STRING_LENGTH (pragma_extern_prefix) - 1; in maybe_apply_renaming_pragma()
Dvarasm.c394 name = alloca (TREE_STRING_LENGTH (dsn) + 1); in initialize_cold_section_name()
395 memcpy (name, TREE_STRING_POINTER (dsn), TREE_STRING_LENGTH (dsn) + 1); in initialize_cold_section_name()
664 && TREE_STRING_LENGTH (decl) >= len) in mergeable_string_section()
2458 len = TREE_STRING_LENGTH (exp); in const_hash_1()
2577 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) in compare_constant()
2579 TREE_STRING_LENGTH (t1))); in compare_constant()
2784 size = MAX (TREE_STRING_LENGTH (exp), size); in get_constant_size()
4102 thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp), in output_constant()
4167 return TREE_STRING_LENGTH (val); in array_size_for_constructor()
Dc-lex.c796 if (TREE_STRING_LENGTH (value) != (int) istr.len in lex_string()
Dtree.c421 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1; in tree_size()
1145 TREE_STRING_LENGTH (s) = len; in build_string()
4659 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) in simple_cst_equal()
4661 TREE_STRING_LENGTH (t1))); in simple_cst_equal()
4868 TREE_STRING_LENGTH (t), val); in iterative_hash_expr()
Dprint-tree.c750 int i = TREE_STRING_LENGTH (node); in print_node()
Dtree-dump.c545 dump_int (di, "lngt", TREE_STRING_LENGTH (t)); in dequeue_and_dump()
Dtree-mudflap.c1220 object_size = build_int_cst (NULL_TREE, TREE_STRING_LENGTH (obj)); in mudflap_enqueue_constant()
Dexpr.c4456 && INTVAL (size) < TREE_STRING_LENGTH (exp)) in store_expr()
4466 size_int (TREE_STRING_LENGTH (exp))); in store_expr()
4594 nz_elts += mult * TREE_STRING_LENGTH (value); in categorize_ctor_elements_1()
4595 elt_count += mult * TREE_STRING_LENGTH (value); in categorize_ctor_elements_1()
7353 TREE_STRING_LENGTH (init))) in expand_expr_real_1()
8988 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0 in string_constant()
Dc-pretty-print.c794 int n = TREE_STRING_LENGTH (s) - 1; in pp_c_string_literal()
Dtree-ssa-ccp.c1049 && compare_tree_int (idx, TREE_STRING_LENGTH (ctor)) < 0) in fold_const_aggregate_ref()
Dfold-const.c2726 return (TREE_STRING_LENGTH (arg0) == TREE_STRING_LENGTH (arg1) in operand_equal_p()
2729 TREE_STRING_LENGTH (arg0))); in operand_equal_p()
11949 TREE_STRING_LENGTH (expr), ctx); in fold_checksum_tree()
12966 && compare_tree_int (index, TREE_STRING_LENGTH (string)) < 0 in fold_read_from_constant_string()
Dc-common.c858 int length = TREE_STRING_LENGTH (value); in fix_string_type()
6332 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1); in complete_array_type()
Dc-format.c1401 format_length = TREE_STRING_LENGTH (format_tree); in check_format_arg()
Dc-typeck.c4619 TREE_STRING_LENGTH (inside_init) in digest_init()
5983 end = p + TREE_STRING_LENGTH (str); in set_nonincremental_init_from_string()
Dtree.h1307 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) macro
Dtree.def283 /* Contents are TREE_STRING_LENGTH and the actual contents of the string. */
Dbuiltins.c381 max = TREE_STRING_LENGTH (src) - 1; in c_strlen()
446 || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0) in c_getstr()
Ddwarf2out.c10089 TREE_STRING_LENGTH (init) - 1) == 0 in rtl_for_decl_init()
10090 && ((size_t) TREE_STRING_LENGTH (init) in rtl_for_decl_init()
DChangeLog-200115410 string constant either its TREE_STRING_LENGTH or its int_size_in_bytes
21354 * doc/c-tree.texi: Fix documentation of TREE_STRING_LENGTH for
/freebsd-9-stable/contrib/gcc/cp/
Dtree.c1462 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) in cp_tree_equal()
1464 TREE_STRING_LENGTH (t1)); in cp_tree_equal()
Dtypeck2.c705 if (size < TREE_STRING_LENGTH (init)) in digest_init()
Dparser.c2766 str.len = TREE_STRING_LENGTH (tok->u.value); in cp_parser_string_literal()
2783 str.len = TREE_STRING_LENGTH (tok->u.value); in cp_parser_string_literal()
7926 != (size_t) (TREE_STRING_LENGTH (linkage) - 1)) in cp_parser_linkage_specification()
/freebsd-9-stable/contrib/gcc/config/
Ddarwin.c1129 && ((size_t) TREE_STRING_LENGTH (exp) in machopic_select_section()
/freebsd-9-stable/contrib/gcc/doc/
Dc-tree.texi1836 @findex TREE_STRING_LENGTH
2030 These nodes represent string-constants. The @code{TREE_STRING_LENGTH}
2035 @code{TREE_STRING_LENGTH} includes the trailing @code{NUL} if it is
2038 For wide string constants, the @code{TREE_STRING_LENGTH} is the number
/freebsd-9-stable/contrib/gcc/config/i386/
Di386.c14309 && TREE_STRING_LENGTH (exp) >= 31 && align < BITS_PER_WORD) in ix86_constant_alignment()

12