int port_delete(port_state_t* port_state) {
tree_node_t* tree_node;
queue_node_t* queue_node;
/* At this point the IOCP port should have been closed. */
assert(port_state->iocp == NULL);
while ((tree_node = tree_root(&port_state->sock_tree)) != NULL) {
sock_state_t* sock_state = sock_state_from_tree_node(tree_node);
sock_force_delete(port_state, sock_state);
}
while ((queue_node = queue_first(&port_state->sock_deleted_queue)) != NULL) {
sock_state_t* sock_state = sock_state_from_queue_node(queue_node);
sock_force_delete(port_state, sock_state);
}
while ((queue_node = queue_first(&port_state->poll_group_queue)) != NULL) {
poll_group_t* poll_group = poll_group_from_queue_node(queue_node);
poll_group_delete(poll_group);
}
assert(queue_empty(&port_state->sock_update_queue));
DeleteCriticalSection(&port_state->lock);
port__free(port_state);
return 0;
}
static void
ptree_type_pattern(int flags, enum nodetype t, const char *pat)
{
struct printer_info info;
struct node *np;
info.flags = flags;
info.pat = pat;
info.t = t;
switch (t) {
case T_FAULT:
lut_walk(Faults, (lut_cb)byname_printer, (void *)&info);
return;
case T_UPSET:
lut_walk(Upsets, (lut_cb)byname_printer, (void *)&info);
return;
case T_DEFECT:
lut_walk(Defects, (lut_cb)byname_printer, (void *)&info);
return;
case T_ERROR:
lut_walk(Errors, (lut_cb)byname_printer, (void *)&info);
return;
case T_EREPORT:
lut_walk(Ereports, (lut_cb)byname_printer, (void *)&info);
return;
case T_SERD:
lut_walk(SERDs, (lut_cb)byname_printer, (void *)&info);
return;
case T_STAT:
lut_walk(STATs, (lut_cb)byname_printer, (void *)&info);
return;
case T_ASRU:
lut_walk(ASRUs, (lut_cb)byname_printer, (void *)&info);
return;
case T_FRU:
lut_walk(FRUs, (lut_cb)byname_printer, (void *)&info);
return;
case T_CONFIG:
lut_walk(Configs, (lut_cb)byname_printer, (void *)&info);
return;
case T_PROP:
for (np = Props; np; np = np->u.stmt.next)
if (name_pattern_match_in_subtree(np->u.stmt.np, pat))
ptree(flags, np, 0, 0);
return;
case T_MASK:
for (np = Masks; np; np = np->u.stmt.next)
if (name_pattern_match_in_subtree(np->u.stmt.np, pat))
ptree(flags, np, 0, 0);
return;
default:
ptree(flags, tree_root(NULL), 0, 0);
}
}
int treeNodeCalcPos(Ihandle* h, int *x, int *y, int *text_x)
{
int err;
TtreePtr tree=(TtreePtr)tree_data(h);
Node node = (Node)tree_root(tree);
float posy = IupGetFloat(h, IUP_POSY);
float dy = IupGetFloat(h, IUP_DY);
float posx = IupGetFloat(h, IUP_POSX);
float dx = IupGetFloat(h, IUP_DX);
CdActivate(tree,err);
*y = (int)((1.0 + posy/dy)*(YmaxCanvas(tree)-TREE_TOP_MARGIN));
while(node != tree_selected(tree))
{
if( node_visible(node) == YES ) *y -= NODE_Y;
node = node_next(node);
if (node == NULL)
return 0;
}
*y -= NODE_Y;
*x = (int)(TREE_LEFT_MARGIN - (XmaxCanvas(tree)-NODE_X)*posx/dx) + NODE_X * node_depth(node);
/* if node has a text associated to it... */
*text_x = 0;
if(node_name(node))
{
/* Calculates its dimensions */
iupdrvStringSize(tree->self, node_name(node), text_x, NULL);
}
return 1;
}
