Node: Iterator

Defines
#define	tm_node_LOOP_INIT(C)   tm_node_iterator_init(&tm.node_color_iter[C])
	Initialize the iterator of all nodes of a given color.
#define	tm_node_LOOP(C)
	Begin a loop over all nodes of a given color.
#define	tm_node_LOOP_BREAK(C)   break
	Break out of a loop over all nodes of a given color.
#define	tm_node_LOOP_END(C)
	End a loop over all nodes of a given color.
Functions
static __inline void	tm_node_iterator_init (tm_node_iterator *ni)
	Initializes a colored node iterator.
static __inline tm_node *	tm_node_iterator_next (tm_node_iterator *ni)
	Returns the next node from the iterator.

---

Define Documentation

#define tm_node_LOOP

(

C

)

Value:

{                                               \
  tm_node *n;                                                           \
  tm_type *t = 0;                                                       \
  while ( (n = tm_node_iterator_next(&tm.node_color_iter[C])) ) {       \
    t = tm.node_color_iter[C].type;                                     \
    {

Begin a loop over all nodes of a given color.

Definition at line 395 of file internal.h.

Referenced by _tm_node_sweep_some(), and _tm_node_unmark_some().

#define tm_node_LOOP_BREAK

(

C

)

break

Break out of a loop over all nodes of a given color.

Definition at line 403 of file internal.h.

Referenced by _tm_node_sweep_some(), and _tm_node_unmark_some().

#define tm_node_LOOP_END

(

C

)

Value:

}                                               \
  }                                             \
}

End a loop over all nodes of a given color.

Definition at line 406 of file internal.h.

Referenced by _tm_node_sweep_some(), and _tm_node_unmark_some().

#define tm_node_LOOP_INIT

(

C

)

tm_node_iterator_init(&tm.node_color_iter[C])

Initialize the iterator of all nodes of a given color.

Definition at line 391 of file internal.h.

Referenced by _tm_node_scan_all(), _tm_node_sweep_all(), _tm_node_unmark_all(), and _tm_phase_init().

---

Function Documentation

static __inline void tm_node_iterator_init

(

tm_node_iterator *

ni

)

[static]

Initializes a colored node iterator.

Definition at line 315 of file internal.h.

References tm_node_iterator::color, tm_type::color_list, tm_node_iterator::node, tm_node_iterator::node_next, tm_node_iterator::scan_end, tm_node_iterator::scan_node, tm_node_iterator::scan_ptr, tm_node_iterator::scan_size, tm, tm_node_iterator::type, and tm_data::types.

{
  ni->type = (void *) &tm.types;
  ni->node_next = (void *) &ni->type->color_list[ni->color];
  ni->node = 0;
  ni->scan_node = 0;
  ni->scan_ptr = 0;
  ni->scan_end = 0;
  ni->scan_size = 0;
}

static __inline tm_node* tm_node_iterator_next

(

tm_node_iterator *

ni

)

[static]

Returns the next node from the iterator.

Definition at line 328 of file internal.h.

References tm_node_iterator::color, tm_type::color_list, tm_type::id, tm_data::n, tm_node_iterator::node, tm_node_iterator::node_next, tm, tm_abort(), tm_assert, tm_color_name, tm_list_color, tm_list_next, tm_node_color, tm_node_iterator::type, and tm_data::types.

Referenced by _tm_node_scan_some().

{
  size_t i = 0;

  while ( i ++ < tm.n[ni->color] ) {
    // fprintf(stderr, "  t%p n%p i%ul\n", ni->type, ni->node_next, i);
  
    /* Wrap around on types? */
    if ( (void *) ni->type == (void *) &tm.types ) {
      ni->type = (void*) tm_list_next(ni->type);

      /*
       * There are no tm_type objects at all.
       * This should never happen!
       */
      if ( (void *) ni->type == (void *) &tm.types ) {
        tm_abort();
        return 0;
      }
      
    next_type:
      /* Start on type node color_list. */
      ni->node_next = (void *) &ni->type->color_list[ni->color];

      tm_assert(tm_list_color(ni->node_next) == ni->color);

      /* Move iterator to first node. */
      ni->node_next = (void *) tm_list_next(ni->node_next);
    }

    /* At end of type color list? */
    if ( ! ni->node_next || (void *) ni->node_next == (void *) &ni->type->color_list[ni->color] ) {
      ni->type = (void*) tm_list_next(ni->type);
      goto next_type;
    }

    if ( tm_node_color(ni->node_next) != ni->color ) {
      fprintf(stderr, "  tm_node_iterator %p: node_color_iter[%s] derailed at node_next %p color %s, t#%d\n",
              ni, 
              tm_color_name[ni->color], 
              ni->node_next, 
              tm_color_name[tm_node_color(ni->node_next)],
              ni->type->id
              );
      // tm_abort();
      ni->type = (void*) tm_list_next(ni->type);
      goto next_type;
    }
    else {
      /* Return current node. */
      ni->node = ni->node_next;
      
      /* Move iterator to next node. */
      ni->node_next = (void*) tm_list_next(ni->node_next);
      
      return ni->node;
    }
  }

  return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function: