Ifpack_MultiListSort.c File Reference

#include "Ifpack_config.h"
#include <string.h>

Include dependency graph for Ifpack_MultiListSort.c:

Go to the source code of this file.

Classes
struct	stack_node

Macros
#define	SWAP(a, b)
#define	MAX_THRESH   4
#define	STACK_SIZE   (8 * sizeof(unsigned long int))
#define	PUSH(low, high)
#define	POP(low, high)
#define	STACK_NOT_EMPTY   (stack < top)
#define	min(x, y)

Functions
void	ifpack_multilist_sort (int *const pbase, double *const daux, size_t total_elems)

Macro Definition Documentation

SWAP

#define SWAP	(		a,
			b )

Value:

do {                            \
 itemp = *a;                    \
 *a = *b;                       \
 *b = itemp;                    \
 dtemp = daux[a-pbase];         \
 daux[a-pbase] = daux[b-pbase]; \
 daux[b-pbase] = dtemp;         \
} while (0)

Definition at line 103 of file Ifpack_MultiListSort.c.

MAX_THRESH

#define MAX_THRESH   4

Definition at line 115 of file Ifpack_MultiListSort.c.

STACK_SIZE

#define STACK_SIZE   (8 * sizeof(unsigned long int))

Definition at line 125 of file Ifpack_MultiListSort.c.

PUSH

#define PUSH	(		low,
			high )

Value:

((void) ((top->lo = (low)), (top->hi = (high)), ++top))

Definition at line 126 of file Ifpack_MultiListSort.c.

POP

#define POP	(		low,
			high )

Value:

((void) (--top, (low = top->lo), (high = top->hi)))

Definition at line 127 of file Ifpack_MultiListSort.c.

STACK_NOT_EMPTY

#define STACK_NOT_EMPTY   (stack < top)

Definition at line 128 of file Ifpack_MultiListSort.c.

min

#define min	(		x,
			y )

Value:

((x) < (y) ? (x) : (y))

Function Documentation

ifpack_multilist_sort()

void ifpack_multilist_sort	(	int *const	pbase,
		double *const	daux,
		size_t	total_elems )

Definition at line 154 of file Ifpack_MultiListSort.c.