int _TreeRemoveNodesTags(void *dbid, int nid)
{
PINO_DATABASE *dblist = (PINO_DATABASE *)dbid;
NODE *node;
NID *nid_ptr = (NID *)&nid;
int tagidx, next_tag;
int status;
if (!(IS_OPEN_FOR_EDIT(dblist)))
return TreeNOEDIT;
/**********************************
For every tag found for this node
Remove it from tree
***********************************/
status = TreeTNF;
nid_to_node(dblist, nid_ptr, node);
for (tagidx=swapint((char *)&node->tag_link); tagidx !=0; tagidx = next_tag) {
next_tag = swapint((char *)&dblist->tree_info->tag_info[tagidx-1].tag_link);
_RemoveTagIdx(dblist, tagidx);
}
return status;
}
STATIC_ROUTINE void check_nid(PINO_DATABASE *dblist, NID *nid, int *count)
{
int bitnum = nid->node;
if (!getbit(bitnum))
{
NODE *node;
NODE *descendent;
nid_to_node(dblist, nid, node);
if (count)
(*count)++;
setbit(bitnum);
for (descendent = member_of(node); descendent; descendent = brother_of(descendent))
{
NID nid;
node_to_nid(dblist, descendent, (&nid));
check_nid(dblist, &nid, count);
}
for (descendent = child_of(node); descendent; descendent = brother_of(descendent))
{
NID nid;
node_to_nid(dblist, descendent, (&nid));
check_nid(dblist, &nid, count);
}
if (swapshort((char *)&node->conglomerate_elt))
{
NID elt_nid;
NODE *elt_node;
unsigned short elt_num = 1;
elt_nid.node = nid->node - swapshort((char *)&node->conglomerate_elt) + 1;
elt_nid.tree = nid->tree;
nid_to_node(dblist, (&elt_nid), elt_node);
for (; swapshort((char *)&elt_node->conglomerate_elt) == elt_num; elt_nid.node++, elt_num++, elt_node++)
check_nid(dblist, &elt_nid, count);
}
}
}
int _TreeTurnOn(void *dbid, int nid_in)
{
PINO_DATABASE *dblist = (PINO_DATABASE *)dbid;
NID *nid = (NID *)&nid_in;
int status;
int node_num;
TREE_INFO *info;
NCI nci;
NODE *node;
if (!(IS_OPEN(dblist)))
return TreeNOT_OPEN;
if (dblist->remote)
return TreeTurnOnRemote(dbid,nid_in);
nid_to_tree_nidx(dblist, nid, info, node_num);
if (!info)
return TreeNNF;
status = TreeGetNciLw(info, node_num, &nci);
if (~status & 1)
return status;
if (nci.flags & NciM_STATE)
{
bitassign(0,nci.flags,NciM_STATE);
status = TreePutNci(info, node_num, &nci, 0);
if (~status & 1)
return status;
if (!(nci.flags & NciM_PARENT_STATE))
{
nid_to_node(dblist, nid, node);
if (node->INFO.TREE_INFO.child)
status = SetParentState(dblist, child_of(node), 0);
if (node->INFO.TREE_INFO.member)
status = SetParentState(dblist, member_of(node), 0);
}
else
status = TreePARENT_OFF;
}
else
{
status = TreeUnLockNci(info, 0, node_num);
if (status & 1)
status = TreeALREADY_ON;
}
return status;
}
int _TreeSetDefaultNid(void *dbid, int nid_in)
{
PINO_DATABASE *dblist = (PINO_DATABASE *)dbid;
NID *nid = (NID *)&nid_in;
if (IS_OPEN(dblist))
{
NODE *node_ptr;
if (dblist->remote)
return SetDefaultNidRemote(dblist,nid_in);
nid_to_node(dblist, nid, node_ptr);
if (node_ptr)
{
dblist->default_node = node_ptr;
return TreeNORMAL;
}
else
return TreeNNF;
}
else
return TreeNOT_OPEN;
}
extern void _TreeDeleteNodeExecute(void *dbid)
{
PINO_DATABASE *dblist = (PINO_DATABASE *)dbid;
static NID nid;
NODE *node;
NODE *prevnode = 0;
NODE *parent;
static NCI empty_nci;
NODE *firstempty = (dblist->tree_info->header->free == -1) ? (NODE *) 0 :
(NODE *) ((char *) dblist->tree_info->node + dblist->tree_info->header->free);
TREE_EDIT *edit = dblist->tree_info->edit;
static int zero = 0;
/*------------------------------------------------------------------------------
Executable: */
nid.tree = 0;
nid.node = 0;
while (_TreeDeleteNodeGetNid(dbid, (int*)&nid) & 1)
{
int found = 0;
_TreeRemoveNodesTags(dbid, *(int *)&nid);
_TreeSetNoSubtree(dbid, *(int *)&nid);
nid_to_node(dblist, (&nid), node);
parent = parent_of(node);
if (child_of(parent) == node)
{
found = 1;
if (node->INFO.TREE_INFO.brother)
{
link_it(parent->INFO.TREE_INFO.child,brother_of(node),parent);
}
else
parent->INFO.TREE_INFO.child = 0;
}
else if (parent->INFO.TREE_INFO.child)
{
NODE *bro;
for (bro = child_of(parent); bro->INFO.TREE_INFO.brother && (brother_of(bro) != node); bro = brother_of(bro));
if (brother_of(bro) == node)
{
found = 1;
if (node->INFO.TREE_INFO.brother)
{
link_it(bro->INFO.TREE_INFO.brother,brother_of(node),bro);
}
else
bro->INFO.TREE_INFO.brother = 0;
}
}
if (!found)
{
if (member_of(parent) == node)
{
if (node->INFO.TREE_INFO.brother)
{
link_it(parent->INFO.TREE_INFO.member,brother_of(node), parent);
}
else
parent->INFO.TREE_INFO.member = 0;
}
else if (parent->INFO.TREE_INFO.member)
{
NODE *bro;
for (bro = member_of(parent); bro->INFO.TREE_INFO.brother && (brother_of(bro) != node); bro = brother_of(bro));
if (brother_of(bro) == node)
{
found = 1;
if (node->INFO.TREE_INFO.brother)
{
link_it(bro->INFO.TREE_INFO.brother,brother_of(node), bro);
}
else
bro->INFO.TREE_INFO.brother = 0;
}
}
}
if ((int)nid.node < edit->first_in_mem)
{
NCI old_nci;
int nidx = nid.node;
TreeGetNciLw(dblist->tree_info, nidx, &old_nci);
TreePutNci(dblist->tree_info, nidx, &empty_nci, 1);
}
else
memcpy(edit->nci + nid.node - edit->first_in_mem, &empty_nci, sizeof(struct nci));
memcpy(node->name,"deleted node",sizeof(node->name));
LoadShort(zero,&node->conglomerate_elt);
node->INFO.TREE_INFO.member = 0;
node->INFO.TREE_INFO.brother = 0;
node->usage = 0;
if (prevnode)
{
int tmp;
link_it(prevnode->parent, node, prevnode);
tmp = -swapint((char *)&prevnode->parent);
node->INFO.TREE_INFO.child = swapint((char *)&tmp);
}
else
{
int tmp;
link_it(tmp,node, dblist->tree_info->node);
dblist->tree_info->header->free = swapint((char *)&tmp);
node->INFO.TREE_INFO.child = 0;
}
if (firstempty)
{
int tmp;
link_it(node->parent, firstempty, node);
tmp = -swapint((char *)&node->parent);
firstempty->INFO.TREE_INFO.child = swapint((char *)&tmp);
}
else
node->parent = 0;
prevnode = node;
}
dblist->modified = 1;
_TreeDeleteNodeInitialize(dbid, 0, 0, 1);
}
int _TreeSetNci(void *dbid, int nid_in, NCI_ITM *nci_itm_ptr)
{
PINO_DATABASE *dblist = (PINO_DATABASE *)dbid;
NID *nid_ptr = (NID *)&nid_in;
int status;
int node_number;
TREE_INFO *tree_info;
NCI_ITM *itm_ptr;
NCI nci;
/*------------------------------------------------------------------------------
Executable:
*/
if (!(IS_OPEN(dblist)))
return TreeNOTOPEN;
if (dblist->open_readonly)
return TreeREADONLY;
if (dblist->remote)
return SetNciRemote(dbid,nid_in,nci_itm_ptr);
nid_to_tree_nidx(dblist, nid_ptr, tree_info, node_number);
if (!tree_info)
return TreeNNF;
status = TreeCallHook(PutNci, tree_info, nid_in);
if (status && !(status & 1))
return status;
status = TreeGetNciLw(tree_info, node_number, &nci);
if (status & 1)
{
for (itm_ptr = nci_itm_ptr; itm_ptr->code != NciEND_OF_LIST && status & 1; itm_ptr++)
{
switch (itm_ptr->code)
{
case NciSET_FLAGS:
nci.flags |= *(unsigned int *) itm_ptr->pointer;
break;
case NciCLEAR_FLAGS:
nci.flags &= ~(*(unsigned int *) itm_ptr->pointer);
break;
case NciSTATUS:
nci.status = *(unsigned int *) itm_ptr->pointer;
break;
case NciUSAGE:
{
NODE *node_ptr;
/**************************************************
First we must check to make sure we are editting
a valid tree.
**************************************************/
if (!(IS_OPEN_FOR_EDIT(dblist)))
return TreeNOEDIT;
nid_to_node(dblist, nid_ptr, node_ptr);
if (node_ptr->usage != *(unsigned char *)itm_ptr->pointer) {
node_ptr->usage = *(unsigned char *)itm_ptr->pointer;
dblist->modified = 1;
}
return TreeNORMAL;
}
default:
status = TreeILLEGAL_ITEM;
break;
}
}
if (status & 1)
status = TreePutNci(tree_info, node_number, &nci, 1);
}
return status;
}
