static void CC nxt_avail_pos_cb( DLNode * n, void * data )
{
pi_ref_nxt_avail_pos_ctx * ctx = ( pi_ref_nxt_avail_pos_ctx * ) data;
if ( ctx->rc == 0 )
{
pi_entry * pie = ( pi_entry * )n;
rc_t rc = PlacementIteratorNextAvailPos ( pie->pi, &(pie->nxt_avail.first), &(pie->nxt_avail.len) );
if ( rc == 0 )
{
/* OUTMSG(( "nxt_avail.first=%u w.last=%u\n", pie->nxt_avail.first, pie->w.last )); */
( ctx->count )++;
if ( ctx->min_pos_initialized )
{
if ( pie->nxt_avail.first < ctx->min_pos )
{
ctx->min_pos = pie->nxt_avail.first;
ctx->min_len = pie->nxt_avail.len;
}
}
else
{
ctx->min_pos = pie->nxt_avail.first;
ctx->min_len = pie->nxt_avail.len;
ctx->min_pos_initialized = true;
}
}
else
{
if ( GetRCState( rc ) != rcDone )
ctx->rc = rc;
}
}
}
static rc_t add_to_pi_window( pi_window * pw, PlacementIterator *pi )
{
rc_t rc = 0;
pi_entry * pie = calloc( 1, sizeof *pie );
if ( pie == NULL )
rc = RC( rcAlign, rcIterator, rcConstructing, rcMemory, rcExhausted );
else
{
rc = PlacementIteratorNextAvailPos ( pi, &(pie->nxt_avail.first), &(pie->nxt_avail.len) );
if ( rc == 0 )
{
pie->pi = pi; /* store the placement-iterator in it's entry-struct */
DLListPushTail ( &pw->pi_entries, ( DLNode * )pie );
pw->count += 1;
}
else
{
free( pie );
ALIGN_DBG( "PlacementIter has no placements...", 0 );
}
}
return rc;
}
