Cache Class Reference

Public Member Functions
	Cache (int l, long int size)
	~Cache ()
int	get_data (const int index, Qfloat **data, int len)
void	swap_index (int i, int j)

Detailed Description

Definition at line 73 of file svm.cpp.

Constructor & Destructor Documentation

Cache()

Cache::Cache	(	int	l,
		long int	size
	)

Definition at line 100 of file svm.cpp.

                                 :l(l_),size(size_)
{
    head = (head_t *)calloc(l,sizeof(head_t));  // initialized to 0
    size /= sizeof(Qfloat);
    size -= l * sizeof(head_t) / sizeof(Qfloat);
    size = max(size, 2 * (long int) l); // cache must be large enough for two columns
    lru_head.next = lru_head.prev = &lru_head;
}

~Cache()

Cache::~Cache

(

)

Definition at line 109 of file svm.cpp.

{
    for(head_t *h = lru_head.next; h != &lru_head; h=h->next)
        free(h->data);
    free(head);
}

Member Function Documentation

get_data()

int Cache::get_data	(	const int	index,
		Qfloat **	data,
		int	len
	)

Definition at line 132 of file svm.cpp.

{
    head_t *h = &head[index];
    if(h->len) lru_delete(h);
    int more = len - h->len;

    if(more > 0)
    {
        // free old space
        while(size < more)
        {
            head_t *old = lru_head.next;
            lru_delete(old);
            free(old->data);
            size += old->len;
            old->data = 0;
            old->len = 0;
        }

        // allocate new space
        h->data = (Qfloat *)realloc(h->data,sizeof(Qfloat)*len);
        size -= more;
        swap(h->len,len);
    }

    lru_insert(h);
    *data = h->data;
    return len;
}

swap_index()

void Cache::swap_index	(	int	i,
		int	j
	)

Definition at line 162 of file svm.cpp.

{
    if(i==j) return;

    if(head[i].len) lru_delete(&head[i]);
    if(head[j].len) lru_delete(&head[j]);
    swap(head[i].data,head[j].data);
    swap(head[i].len,head[j].len);
    if(head[i].len) lru_insert(&head[i]);
    if(head[j].len) lru_insert(&head[j]);

    if(i>j) swap(i,j);
    for(head_t *h = lru_head.next; h!=&lru_head; h=h->next)
    {
        if(h->len > i)
        {
            if(h->len > j)
                swap(h->data[i],h->data[j]);
            else
            {
                // give up
                lru_delete(h);
                free(h->data);
                size += h->len;
                h->data = 0;
                h->len = 0;
            }
        }
    }
}

---

The documentation for this class was generated from the following file:

• libsvm/svm.cpp