g2mblmlopt08d.c File Reference

#include <limits.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include "pkvaria.h"
#include "pknum.h"
#include "pkgeom.h"
#include "multibs.h"
#include "bsmesh.h"
#include "egholed.h"
#include "g2blendingd.h"
#include "g2mblendingd.h"
#include "g2blprivated.h"
#include "g2mblprivated.h"
#include "g2mblmlprivated.h"
#include "msgpool.h"

Include dependency graph for g2mblmlopt08d.c:

Data Structures
struct	tree_el
Defines
#define	AVE_VERTN   64
#define	TREE_INSERT(v1, v2)
Functions
boolean	_g2mbl_MLFindVCPNeighboursd (mesh_ml_optdata *d, nzHbl_rowdesc **vn, int **vni)
boolean	_g2mbl_MLSetupBlockCGHessiand (mesh_ml_optdata *d, int bn)

---

Define Documentation

#define AVE_VERTN   64

#define TREE_INSERT	(		v1,
			v2
	)

Value:

{ \
  int *vp; \
  vp = &vroot[v1];          /* select the tree */ \
  while ( *vp >= 0 ) {      /* search in the tree */ \
    if ( tree[*vp].k == v2 ) \
      goto out;             /* already present - no copies */ \
    else if ( tree[*vp].k > v2 ) \
      vp = &tree[*vp].left; \
    else \
      vp = &tree[*vp].right; \
  } \
  if ( ltreeel >= ntreeel ) /* not enough storage space allocated */ \
    goto failure; \
  *vp = ltreeel++;          /* allocate tree element and insert */ \
  tree[*vp].k = v2; \
  tree[*vp].left = tree[*vp].right = -1; \
out: ; \
}

---

Function Documentation

boolean _g2mbl_MLFindVCPNeighboursd	(	mesh_ml_optdata *	d,
		nzHbl_rowdesc **	vn,
		int **	vni
	)

boolean _g2mbl_MLSetupBlockCGHessiand	(	mesh_ml_optdata *	d,
		int	bn
	)