FreeBSD/contrib/gcc/cp/tree.c
/* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
   for a node we are thinking about adding).  */
Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
for a node we are thinking about adding).
Compare ENTRY ( an entry in the hash table ) with DATA ( a list_proxy for a node we are thinking about adding ) .
static int
list_hash_eq (const void* entry, const void* data)
{
  tree t = (tree) entry;
  struct list_proxy *proxy = (struct list_proxy *) data;
  return (TREE_VALUE (t) == proxy->value
	  && TREE_PURPOSE (t) == proxy->purpose
	  && TREE_CHAIN (t) == proxy->chain);
}
static int list_hash_eq ( const void * entry , const void * data ) { tree t = ( tree ) entry ; struct list_proxy * proxy = ( struct list_proxy * ) data ; return ( TREE_VALUE ( t ) == proxy -> value && TREE_PURPOSE ( t ) == proxy -> purpose && TREE_CHAIN ( t ) == proxy -> chain ) ; }
Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
for a node we are thinking about adding).
Compare ENTRY ( an entry in the hash table ) with DATA ( a list_proxy for a node we are thinking about adding ) .