gcclibs/libcpp/directives.c

397       if (dname->val.node->is_directive)
398 	dir = &dtable[dname->val.node->directive_index];
525       cpp_hashnode *node = token->val.node;
527       if (node == pfile->spec_nodes.n_defined)
530       else if (! (node->flags & NODE_POISONED))
531 	return node;
536 	       NODE_NAME (token->val.node));
550   cpp_hashnode *node = lex_macro_node (pfile);
552   if (node)
559       if (_cpp_create_definition (pfile, node))
561 	  pfile->cb.define (pfile, pfile->directive_line, node);
569   cpp_hashnode *node = lex_macro_node (pfile);
571   if (node)
574 	pfile->cb.undef (pfile, pfile->directive_line, node);
578       if (node->type == NT_MACRO)
580 	  if (node->flags & NODE_WARN)
582 		       "undefining \"%s\"", NODE_NAME (node));
585 	    _cpp_warn_if_unused_macro (pfile, node, NULL);
587 	  _cpp_free_definition (node);
1068   const cpp_hashnode *node;
1072       node = cpp_lookup (pfile, U space, strlen (space));
1073       entry = lookup_pragma_entry (*chain, node);
1077 	  entry->pragma = node;
1101   node = cpp_lookup (pfile, U name, strlen (name));
1102   entry = lookup_pragma_entry (*chain, node);
1106       entry->pragma = node;
1114 	       NODE_NAME (node));
1299       p = lookup_pragma_entry (pfile->pragmas, token->val.node);
1307 	    p = lookup_pragma_entry (p->u.space, token->val.node);
1399       hp = tok->val.node;
1632       const cpp_hashnode *node = lex_macro_node (pfile);
1634       if (node)
1636 	  skip = node->type != NT_MACRO;
1637 	  _cpp_mark_macro_used (node);
1650   const cpp_hashnode *node = 0;
1654       node = lex_macro_node (pfile);
1656       if (node)
1658 	  skip = node->type == NT_MACRO;
1659 	  _cpp_mark_macro_used (node);
1664   push_conditional (pfile, skip, T_IFNDEF, node);
1886    the hash node of the predicate, or 0 on error.  If an answer was
1905       unsigned int len = NODE_LEN (predicate->val.node);
1910       memcpy (sym + 1, NODE_NAME (predicate->val.node), len);
1921 find_answer (cpp_hashnode *node, const struct answer *candidate)
1926   for (result = &node->value.answers; *result; result = &(*result)->next)
1951   cpp_hashnode *node;
1953   node = parse_assertion (pfile, &answer, T_IF);
1959   if (node)
1960     *value = (node->type == NT_ASSERTION &&
1961 	      (answer == 0 || *find_answer (node, answer) != 0));
1966   return node == 0;
1974   cpp_hashnode *node;
1976   node = parse_assertion (pfile, &new_answer, T_ASSERT);
1977   if (node)
1984       if (node->type == NT_ASSERTION)
1986 	  if (*find_answer (node, new_answer))
1989 			 NODE_NAME (node) + 1);
1992 	  new_answer->next = node->value.answers;
2008       node->type = NT_ASSERTION;
2009       node->value.answers = new_answer;
2018   cpp_hashnode *node;
2021   node = parse_assertion (pfile, &answer, T_UNASSERT);
2023   if (node && node->type == NT_ASSERTION)
2027 	  struct answer **p = find_answer (node, answer), *temp;
2035 	  if (node->value.answers == 0)
2036 	    node->type = NT_VOID;
2041 	_cpp_free_definition (node);
2239   cpp_hashnode *node;
2243       node = cpp_lookup (pfile, dtable[i].name, dtable[i].length);
2244       node->is_directive = 1;
2245       node->directive_index = i;