Lines Matching defs:node
3731 The children of each node form a circular list linked by
3732 die_sib. die_child points to the node *before* the "first" child node. */
3796 TYPE_DECL node for each complete tagged type, each array type, and
3797 each function type node created) the g++ front end generates a
3798 _named_ TYPE_DECL node for each tagged type node created.
4376 /* Test if rtl node points to a pseudo register. */
4406 /* Return nonzero if the given type node represents a tagged type. */
4807 to find out what sort of node actually served as the original seed for the
4832 to find out what sort of node actually served as the original seed for the
5029 struct indirect_string_node *node;
5040 node = (struct indirect_string_node *) *slot;
5041 node->str = ggc_strdup (str);
5042 node->refcount++;
5046 attr.dw_attr_val.v.val_str = node;
5063 struct indirect_string_node *node;
5069 node = a->dw_attr_val.v.val_str;
5070 if (node->form)
5071 return node->form;
5073 len = strlen (node->str) + 1;
5077 if (len <= DWARF_OFFSET_SIZE || node->refcount == 0)
5078 return node->form = DW_FORM_string;
5084 && (len - DWARF_OFFSET_SIZE) * node->refcount <= len)
5085 return node->form = DW_FORM_string;
5089 node->label = xstrdup (label);
5091 return node->form = DW_FORM_strp;
5592 /* Return a pointer to a newly created DIE node. */
5695 /* Add a variable location node to the linked list for DECL. */
6430 limbo_die_node *node, **pnode;
6465 for (node = limbo_die_list, pnode = &limbo_die_list;
6466 node;
6467 node = node->next)
6471 compute_section_prefix (node->die);
6472 is_dupl = check_duplicate_cu (node->die, cu_hash_table,
6474 assign_symbol_names (node->die);
6476 *pnode = node->next;
6479 pnode = &node->next;
6480 record_comdat_symbol_number (node->die, cu_hash_table,
6965 this location list node, which is done for the head of the list only. */
6996 /* Add a new location list node to the list. */
8228 /* Given a pointer to a tree node for some base type, return a pointer to
8298 /* Given a pointer to an arbitrary ..._TYPE tree node, return a pointer to
8329 /* Given a pointer to an arbitrary ..._TYPE tree node, return nonzero if the
8368 /* Given a pointer to a tree node, assumed to be some kind of a ..._TYPE
8369 node, return the size in bits for the type if it is a constant, or else
8372 ERROR_MARK node. */
8421 therefore be sufficient to check the TYPE_SIZE node pointers
8442 /* Given a pointer to a tree node for a subrange type, return a pointer
8473 /* Given a pointer to an arbitrary ..._TYPE tree node, return a debugging
8568 `lookup_type_die' routine) because the ..._TYPE node we have
8569 might simply be a *copy* of some original type node (where the
8572 ..._TYPE node. */
8614 /* Given a pointer to an arbitrary ..._TYPE tree node, return true if it is
8623 /* Return the DBX register number described by a given RTL node. */
9523 /* ??? Need a node to point the skip at. Use a nop. */
9592 /* Given a pointer to what is assumed to be a FIELD_DECL node, return a
9594 `integer_type_node' if the given node turns out to be an
9595 ERROR_MARK node. */
9612 /* Given a pointer to a tree node, return the alignment in bits for
9613 it, or else return BITS_PER_WORD if the node actually turns out to
9614 be an ERROR_MARK node. */
9631 because the argument turns out to be a pointer to an ERROR_MARK node, or
9764 struct and union types. In the special case of a FIELD_DECL node which
10077 struct cgraph_varpool_node *node = cgraph_varpool_node (*tp);
10078 if (!node->needed)
10084 struct cgraph_node *node = cgraph_node (*tp);
10085 if (!node->output)
10428 struct var_loc_node *node;
10438 /* If it truly has multiple locations, the first and last node will
10454 This means we have to special case the last node, and generate
10457 node = loc_list->first;
10458 varloc = NOTE_VAR_LOCATION (node->var_loc_note);
10462 node->label, node->next->label, secname, 1);
10463 node = node->next;
10465 for (; node->next; node = node->next)
10466 if (NOTE_VAR_LOCATION_LOC (node->var_loc_note) != NULL_RTX)
10470 varloc = NOTE_VAR_LOCATION (node->var_loc_note);
10472 node->label, node->next->label, secname);
10477 if (NOTE_VAR_LOCATION_LOC (node->var_loc_note) != NULL_RTX)
10481 varloc = NOTE_VAR_LOCATION (node->var_loc_note);
10491 node->label, endname, secname);
10514 node = loc_list->first;
10515 descr = loc_descriptor (NOTE_VAR_LOCATION (node->var_loc_note));
10696 /* Given a tree node describing an array bound (either lower or upper) output
10884 /* For a FIELD_DECL node which represents a bit-field, output an attribute
10944 /* For a FIELD_DECL node which represents a bit field, output an attribute
11249 /* Given a tree pointer to a struct, class, union, or enum type node, return
11267 a TYPE_DECL node, regardless of whether or not a `typedef' was
11527 ..._DECL node (i.e. either a PARM_DECL or perhaps a VAR_DECL which
11529 node. If it's the former then this function is being called to output a
11536 gen_formal_parameter_die (tree node, dw_die_ref context_die)
11539 = new_die (DW_TAG_formal_parameter, context_die, node);
11542 switch (TREE_CODE_CLASS (TREE_CODE (node)))
11545 origin = decl_ultimate_origin (node);
11550 add_name_and_src_coords_attributes (parm_die, node);
11551 add_type_attribute (parm_die, TREE_TYPE (node),
11552 TREE_READONLY (node),
11553 TREE_THIS_VOLATILE (node),
11555 if (DECL_ARTIFICIAL (node))
11559 equate_decl_number_to_die (node, parm_die);
11560 if (! DECL_ABSTRACT (node))
11561 add_location_or_const_value_attribute (parm_die, node, DW_AT_location);
11566 /* We were called with some kind of a ..._TYPE node. */
11567 add_type_attribute (parm_die, node, 0, 0, context_die);
11995 associated with the FUNCTION_DECL. This will be a node of type
11997 FUNCTION_TYPE node ends with a void_type_node then there should *not* be
12047 /* OUTER_SCOPE is a pointer to the outermost BLOCK node created to represent
12058 a BLOCK node representing the function's outermost pair of curly braces,
12511 the TREE node representing the appropriate (containing) type. */
12947 sort of node actually served as the original seed for the creation of
13344 /* In the special case of a TYPE_DECL node representing the declaration
13346 instantiated from some other (original) TYPE_DECL node (e.g. one which
14118 struct indirect_string_node *node = (struct indirect_string_node *) *h;
14120 if (node->form == DW_FORM_strp)
14123 ASM_OUTPUT_LABEL (asm_out_file, node->label);
14124 assemble_string (node->str, strlen (node->str) + 1);
14191 /* We haven't done this node yet. Mark it as used. */
14202 /* If this node is a specification,
14231 /* Don't do anything if this node is already marked. */
14258 /* It's a type node --- don't mark it. */
14348 limbo_die_node *node;
14354 for (node = limbo_die_list; node; node = node->next)
14355 verify_marks_clear (node->die);
14360 for (node = limbo_die_list; node; node = node->next)
14361 prune_unused_types_walk (node->die);
14374 for (node = limbo_die_list; node; node = node->next)
14375 prune_unused_types_prune (node->die);
14379 for (node = limbo_die_list; node; node = node->next)
14380 prune_unmark_dies (node->die);
14404 limbo_die_node *node, *next_node;
14425 for (node = limbo_die_list; node; node = next_node)
14427 next_node = node->next;
14428 die = node->die;
14455 gcc_assert (node->created_for);
14457 if (DECL_P (node->created_for))
14458 context = DECL_CONTEXT (node->created_for);
14459 else if (TYPE_P (node->created_for))
14460 context = TYPE_CONTEXT (node->created_for);
14492 for (node = limbo_die_list; node; node = node->next)
14493 add_sibling_attributes (node->die);
14537 for (node = limbo_die_list; node; node = node->next)
14538 output_comp_unit (node->die, 0);