sparse_int.h File Reference

#include "sparse.h"
#include "util_hack.h"

Include dependency graph for sparse_int.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	ABC__misc__espresso__sparse_int_h
#define	dll_unlink(p, first, last, next, prev, count)
#define	sm_element_alloc(newobj)
#define	sm_element_free(e)

Functions
	if (last==0)
else	if (last->value< newval)
else	if (first->value > newval)
	for (p=first;p->value< newval;p=p->next)
	if (p->value > newval)
void	sm_row_remove_element ()
void	sm_col_remove_element ()

Variables
	else

Macro Definition Documentation

ABC__misc__espresso__sparse_int_h

#define ABC__misc__espresso__sparse_int_h

Definition at line 33 of file sparse_int.h.

dll_unlink

#define dll_unlink	(		p,
			first,
			last,
			next,
			prev,
			count )

Value:

    { \
    if (p->prev == 0) { \
    first = p->next; \
    } else { \
    p->prev->next = p->next; \
    } \
    if (p->next == 0) { \
    last = p->prev; \
    } else { \
    p->next->prev = p->prev; \
    } \
    count--; \
}

Definition at line 76 of file sparse_int.h.

#define dll_unlink(p, first, last, next, prev, count) { \
    if (p->prev == 0) { \
    first = p->next; \
    } else { \
    p->prev->next = p->next; \
    } \
    if (p->next == 0) { \
    last = p->prev; \
    } else { \
    p->next->prev = p->prev; \
    } \
    count--; \
}

sm_element_alloc

#define sm_element_alloc

(

newobj

)

Value:

    newobj = ALLOC(sm_element, 1);    \
    newobj->user_word = NIL(char);

Definition at line 110 of file sparse_int.h.

#define sm_element_alloc(newobj)    \
    newobj = ALLOC(sm_element, 1);    \
    newobj->user_word = NIL(char);

sm_element_free

#define sm_element_free

(

e

)

Value:

    FREE(e)

Definition at line 113 of file sparse_int.h.

#define sm_element_free(e)        \
    FREE(e)

Function Documentation

for()

for

(

p

= first;p->value< newval;p=p->next

)

if() [1/4]

else if	(	first->	value,
		newval	)

Definition at line 48 of file sparse_int.h.

                                      { \
    e->value = newval; \
    first->prev = e; \
    e->next = first; \
    first = e; \
    e->prev = 0; \
    count++; \
    } else { \

if() [2/4]

else if

(

)

Definition at line 41 of file sparse_int.h.

                                     { \
    e->value = newval; \
    last->next = e; \
    e->prev = last; \
    last = e; \
    e->next = 0; \
    count++; \
    } else if (first->value > newval) { \

if() [3/4]

if

(

last

= = 0

)

Definition at line 34 of file sparse_int.h.

                   { \
    e->value = newval; \
    first = e; \
    last = e; \
    e->next = 0; \
    e->prev = 0; \
    count++; \
    } else if (last->value < newval) { \

Here is the caller graph for this function:

if() [4/4]

if	(	p->	value,
		newval	)

Definition at line 59 of file sparse_int.h.

                           { \
        e->value = newval; \
        p = p->prev; \
        p->next->prev = e; \
        e->next = p->next; \
        p->next = e; \
        e->prev = p; \
        count++; \
    } else { \

sm_col_remove_element()

void sm_col_remove_element ( )

extern

Here is the caller graph for this function:

sm_row_remove_element()

void sm_row_remove_element ( )

extern

Here is the caller graph for this function:

Variable Documentation

else

else

Initial value:

{ 
    type *p

Definition at line 55 of file sparse_int.h.