/dports/devel/upnp/pupnp-release-1.14.12/ixml/src/ |
H A D | node.c | 63 if (nodeptr != NULL) { in ixmlCDATASection_free() 74 IXML_Node *nodeptr) in ixmlNode_freeSingleNode() argument 102 free(nodeptr); in ixmlNode_freeSingleNode() 139 if (nodeptr) { in ixmlNode_free() 217 IXML_Node *nodeptr, in ixmlNode_setNamespaceURI() argument 246 IXML_Node *nodeptr, in ixmlNode_setPrefix() argument 277 IXML_Node *nodeptr, in ixmlNode_setLocalName() argument 393 prev = nodeptr; in ixmlNode_getLastChild() 471 IXML_Node *nodeptr, in ixmlNode_isParent() argument 494 IXML_Node *nodeptr, in ixmlNode_allowChildren() argument [all …]
|
H A D | ixml.c | 94 IXML_Node *nodeptr, in ixmlPrintDomTreeRecursive() argument 103 if (nodeptr != NULL) { in ixmlPrintDomTreeRecursive() 136 if (nodeptr->nextSibling != NULL) { in ixmlPrintDomTreeRecursive() 145 if (nodeptr->firstAttr != NULL) { in ixmlPrintDomTreeRecursive() 193 IXML_Node *nodeptr, in ixmlPrintDomTree() argument 201 if (nodeptr == NULL || buf == NULL) { in ixmlPrintDomTree() 225 if (nodeptr->firstAttr != NULL) { in ixmlPrintDomTree() 250 (int)ixmlNode_getNodeType(nodeptr)); in ixmlPrintDomTree() 264 IXML_Node *nodeptr, in ixmlDomTreetoString() argument 272 if (nodeptr == NULL || buf == NULL) { in ixmlDomTreetoString() [all …]
|
/dports/devel/dev86/dev86-0.16.20/bcc/ |
H A D | exptree.c | 59 lscalar = nodeptr->left.nodeptr->nodetype->scalar; 64 nodeptr->left.nodeptr = castnode(dtype, nodeptr->left.nodeptr); 96 nodeptr->left.nodeptr = castnode(nodeptr->nodetype, 97 nodeptr->left.nodeptr); 109 nodeptr->left.nodeptr = castnode(nodeptr->nodetype, 110 nodeptr->left.nodeptr); 155 nodeptr->flags = nodeptr->weight = 0; 786 nodeptr->left.nodeptr = p1; 810 nodeptr->nodetype = nodetype(nodeptr); 850 nodeptr->left.nodeptr = unconvert(left); [all …]
|
H A D | express.c | 228 nodeptr = node(POSTDECOP, nodeptr, NULLNODE); 232 nodeptr = node(POSTINCOP, nodeptr, NULLNODE); 236 nodeptr = node(INDIRECTOP, node(ADDOP, nodeptr, expression()), 242 nodeptr = node(FUNCOP, nodeptr, listargs()); 250 np = nodeptr->left.nodeptr; 271 np = nodeptr->left.nodeptr; 290 nodeptr = node(INDIRECTOP, nodeptr, NULLNODE); 309 nodeptr = node(STRUCELTOP, nodeptr, leafnode(symptr)); 312 return nodeptr; 358 return nodeptr; in primary_exp() [all …]
|
/dports/net/clusterit/clusterit-2.5/pcp/ |
H A D | pcp.c | 105 nodeptr = NULL; in main() 229 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) { in do_copy() 337 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) { 423 nodeptr = nodeptr->next; 492 nodeptr = nodeptr->next; 511 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) { 525 for (nodeptr=nodelink; nodeptr != NULL; nodeptr = nodeptr->next) { 528 nodeptr)) 558 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) { 579 for (nodeptr=nodelink; nodeptr != NULL; nodeptr = nodeptr->next) { [all …]
|
/dports/net/clusterit/clusterit-2.5/dsh/ |
H A D | run.c | 82 node_t *nodeptr; in main() local 98 nodeptr = NULL; in main() 204 node_t *nodeptr; in check_rand() local 206 for (i = 0, nodeptr = nodelink; nodeptr != NULL; nodeptr = nodeptr->next) in check_rand() 211 for (i = 0, nodeptr = nodelink; ((nodeptr != NULL) && (i != g)); in check_rand() 212 nodeptr = nodeptr->next) in check_rand() 215 return(nodeptr); in check_rand() 230 node_t *nodeptr; local 239 for (nodeptr = nodelink; nodeptr != NULL; nodeptr = nodeptr->next) 291 nodeptr)) { [all …]
|
H A D | rseq.c | 242 node_t *nodeptr; in check_seq() local 248 for (nodeptr = nodelink; (nodeptr && i < seqnumber); in check_seq() 249 nodeptr = nodeptr->next) in check_seq() 251 if (nodeptr == NULL || nodeptr->next == NULL) in check_seq() 271 node_t *nodeptr; local 292 for (nodeptr = nodelink; nodeptr != NULL; nodeptr = nodeptr->next) 315 nodeptr = check_seq(); 331 nodeptr)) { 333 nodeptr->name); 342 pipe(nodeptr->out.fds); [all …]
|
H A D | dsh.c | 87 node_t *nodeptr; in main() local 98 nodeptr = NULL; in main() 256 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) { 312 nodeptr = nodelink; 317 nodehold = nodeptr; 386 nodeptr)) 429 nodeptr = nodeptr->next; 431 nodeptr = nodehold; 473 nodeptr->name, cd); 504 nodeptr = nodeptr->next; [all …]
|
/dports/net/clusterit/clusterit-2.5/dvt/ |
H A D | dvt.c | 407 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) { in do_command() 517 nodeptr = nodeptr->next; in do_command() 545 nodeptr = nodeptr->next; in do_command() 569 for (nodeptr = nodehold; nodeptr != NULL; in do_command() 570 nodeptr = nodeptr->next) { in do_command() 590 nodeptr = nodeptr->next) { in do_command() 601 nodeptr = nodeptr->next) { in do_command() 612 nodeptr = nodeptr->next) { in do_command() 624 nodeptr = nodeptr->next) { in do_command() 649 nodeptr = nodeptr->next) { in do_command() [all …]
|
/dports/net/clusterit/clusterit-2.5/jsd/ |
H A D | jsd.c | 314 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) { in main_loop() 317 if (nodeptr->index > topspeed && nodeptr->free) in main_loop() 318 fastnode = nodeptr; in main_loop() 344 node_t *nodeptr; in free_node() local 359 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) in free_node() 396 for (nodeptr = nodelink; nodeptr; nodeptr = nodeptr->next) { in do_bench_command() 426 nodehold = nodeptr; in do_bench_command() 484 nodeptr = nodeptr->next; in do_bench_command() 486 nodeptr = nodehold; in do_bench_command() 502 nodeptr->index, nodeptr->name); in do_bench_command() [all …]
|
/dports/biology/iqtree/IQ-TREE-2.0.6/pll/ |
H A D | pllInternal.h | 36 extern void getxnode ( nodeptr p ); 37 extern void hookup ( nodeptr p, nodeptr q, double *z, int numBranches); 38 extern void hookupFull ( nodeptr p, nodeptr q, double *z); 39 extern void hookupDefault ( nodeptr p, nodeptr q); 69 extern nodeptr removeNodeBIG ( pllInstance *tr, partitionList *pr, nodeptr p, int numBranches); 70 extern nodeptr removeNodeRestoreBIG ( pllInstance *tr, partitionList *pr, nodeptr p ); 71 extern pllBoolean insertBIG ( pllInstance *tr, partitionList *pr, nodeptr p, nodeptr q); 72 extern pllBoolean insertRestoreBIG ( pllInstance *tr, partitionList *pr, nodeptr p, nodeptr q ); 73 extern pllBoolean testInsertBIG ( pllInstance *tr, partitionList *pr, nodeptr p, nodeptr q ); 77 extern void traversalOrder ( nodeptr p, int *count, nodeptr *nodeArray ); [all …]
|
H A D | randomTree.c | 39 static void insertTaxon (nodeptr p, nodeptr q) in insertTaxon() 41 nodeptr r; in insertTaxon() 49 static nodeptr buildNewTip (pllInstance *tr, nodeptr p) in buildNewTip() 51 nodeptr q; in buildNewTip() 55 q->next->back = (nodeptr)NULL; in buildNewTip() 56 q->next->next->back = (nodeptr)NULL; in buildNewTip() 63 nodeptr in buildSimpleTreeRandom() 115 static int markBranches(nodeptr *branches, nodeptr p, int *counter, int numsp) in markBranches() 135 nodeptr in pllMakeRandomTree() 139 *branches = (nodeptr *)rax_malloc(sizeof(nodeptr) * (2 * tr->mxtips)); in pllMakeRandomTree()
|
/dports/cad/electric/electric-7.00/src/sim/ |
H A D | simalsuser.c | 221 sum_node = thisside->nodeptr; in simals_calculate_bidir_outputs() 306 if (sidea->nodeptr->visit) in simals_bidir_path_search() 309 end_node = sideb->nodeptr; in simals_bidir_path_search() 315 if (sideb->nodeptr->visit) in simals_bidir_path_search() 318 end_node = sidea->nodeptr; in simals_bidir_path_search() 479 j = argptr->nodeptr->sum_state; in simals_JK_FF() 481 k = argptr->nodeptr->sum_state; in simals_JK_FF() 659 nodehead = argptr->nodeptr; 702 argptr->nodeptr->num, argptr->nodeptr->sum_state, simals_time_abs); 858 if ((output_ptr->nodeptr->sum_state == 0) && (size_ptr->nodeptr->sum_state)) [all …]
|
/dports/cad/scotch/scotch-6.0.4/src/libscotch/ |
H A D | fibo.c | 243 FiboNode * const nodeptr) in fiboTreeAdd() argument 267 FiboNode * const nodeptr) in fiboTreeDel() argument 272 nodeptr->pareptr = in fiboTreeDel() 273 nodeptr->chldptr = in fiboTreeDel() 274 nodeptr->linkdat.prevptr = in fiboTreeDel() 275 nodeptr->linkdat.nextptr = NULL; in fiboTreeDel() 301 chldptr = nodeptr->chldptr; in fiboTreeCheck2() 334 FiboNode * nodeptr; in fiboTreeCheck() local 337 nodeptr != &treeptr->rootdat; nodeptr = nodeptr->linkdat.nextptr) { in fiboTreeCheck() 338 if (nodeptr->linkdat.nextptr->linkdat.prevptr != nodeptr) { in fiboTreeCheck() [all …]
|
/dports/graphics/megapov/megapov-1.2.1/source/base/ |
H A D | povmscpp.cpp | 989 for(nodeptr = receivers; nodeptr != NULL; nodeptr = nodeptr->next) in Remove() 1015 for(nodeptr = self->receivers; nodeptr != NULL; nodeptr = nodeptr->next) in ReceiveHandler() 1017 …if((nodeptr->hclass == hclass) && ((nodeptr->hid == hid) || (nodeptr->hid == kPOVMSType_WildCard))) in ReceiveHandler() 1061 nodeptr->hid = hid; in AddNodeFront() 1072 nodeptr->next->last = nodeptr; in AddNodeFront() 1085 nodeptr->hid = hid; in AddNodeBack() 1098 nodeptr->next->last = nodeptr; in AddNodeBack() 1116 (void)POVMS_RemoveReceiver(context, nodeptr->hclass, nodeptr->hid); in RemoveNode() 1119 nodeptr->last->next = nodeptr->next; in RemoveNode() 1121 nodeptr->next->last = nodeptr->last; in RemoveNode() [all …]
|
/dports/graphics/povray36/povray-3.6.1/source/base/ |
H A D | povmscpp.cpp | 984 for(nodeptr = receivers; nodeptr != NULL; nodeptr = nodeptr->next) in Remove() 1010 for(nodeptr = self->receivers; nodeptr != NULL; nodeptr = nodeptr->next) in ReceiveHandler() 1012 …if((nodeptr->hclass == hclass) && ((nodeptr->hid == hid) || (nodeptr->hid == kPOVMSType_WildCard))) in ReceiveHandler() 1056 nodeptr->hid = hid; in AddNodeFront() 1067 nodeptr->next->last = nodeptr; in AddNodeFront() 1080 nodeptr->hid = hid; in AddNodeBack() 1093 nodeptr->next->last = nodeptr; in AddNodeBack() 1111 (void)POVMS_RemoveReceiver(context, nodeptr->hclass, nodeptr->hid); in RemoveNode() 1114 nodeptr->last->next = nodeptr->next; in RemoveNode() 1116 nodeptr->next->last = nodeptr->last; in RemoveNode() [all …]
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/topo/treematch/treematch/ |
H A D | fibo.c | 260 FiboNode * const nodeptr) in fiboTreeAdd() argument 284 FiboNode * const nodeptr) in fiboTreeDel() argument 289 nodeptr->pareptr = in fiboTreeDel() 290 nodeptr->chldptr = in fiboTreeDel() 291 nodeptr->linkdat.prevptr = in fiboTreeDel() 292 nodeptr->linkdat.nextptr = NULL; in fiboTreeDel() 318 chldptr = nodeptr->chldptr; in fiboTreeCheck2() 351 FiboNode * nodeptr; in fiboTreeCheck() local 354 nodeptr != &treeptr->rootdat; nodeptr = nodeptr->linkdat.nextptr) { in fiboTreeCheck() 355 if (nodeptr->linkdat.nextptr->linkdat.prevptr != nodeptr) { in fiboTreeCheck() [all …]
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/topo/treematch/treematch/ |
H A D | fibo.c | 260 FiboNode * const nodeptr) in fiboTreeAdd() argument 284 FiboNode * const nodeptr) in fiboTreeDel() argument 289 nodeptr->pareptr = in fiboTreeDel() 290 nodeptr->chldptr = in fiboTreeDel() 291 nodeptr->linkdat.prevptr = in fiboTreeDel() 292 nodeptr->linkdat.nextptr = NULL; in fiboTreeDel() 318 chldptr = nodeptr->chldptr; in fiboTreeCheck2() 351 FiboNode * nodeptr; in fiboTreeCheck() local 354 nodeptr != &treeptr->rootdat; nodeptr = nodeptr->linkdat.nextptr) { in fiboTreeCheck() 355 if (nodeptr->linkdat.nextptr->linkdat.prevptr != nodeptr) { in fiboTreeCheck() [all …]
|
/dports/cad/magic/magic-8.3.245/resis/ |
H A D | ResPrint.c | 338 resWriteNodeName(fp, nodeptr) in resWriteNodeName() argument 340 resNode *nodeptr; 366 resNode *nodeptr; local 377 for (nodeptr = nodelist; nodeptr; nodeptr = nodeptr->rn_more) 379 if (nodeptr->rn_name == NULL) 381 nodeptr->rn_id = (*nidx); 478 for (nodeptr = nodelist; nodeptr; nodeptr = nodeptr->rn_more) 480 if (nodeptr->rn_name != NULL) 712 resNode *nodeptr; local 736 nodeptr->rn_id = (*nidx); [all …]
|
/dports/math/chuffed/chuffed-e04bedd/chuffed/mdd/ |
H A D | mdd_to_lgraph.cpp | 31 MDDNode nodeptr = nodes[nID]; in mdd_to_layergraph() local 32 for( unsigned int j = 0; j < nodeptr->sz; j++ ) in mdd_to_layergraph() 34 if( status[nodeptr->edges[j].dest] == 0 ) in mdd_to_layergraph() 36 node_queue.push(nodeptr->edges[j].dest); in mdd_to_layergraph() 37 status[nodeptr->edges[j].dest] = 1; in mdd_to_layergraph() 52 MDDNode nodeptr = nodes[nID]; in mdd_to_layergraph() local 53 int vv = nodeptr->var; in mdd_to_layergraph() 56 for(unsigned int j = 0; j < nodeptr->sz; j++) in mdd_to_layergraph() 58 if(nodeptr->edges[j].val > costs.size()) in mdd_to_layergraph() 61 if(nodeptr->edges[j].dest != MDDFALSE) in mdd_to_layergraph() [all …]
|
/dports/devel/upnp/pupnp-release-1.14.12/ixml/inc/ |
H A D | ixml.h | 247 IXML_Node *nodeptr); 259 IXML_Node *nodeptr); 275 IXML_Node *nodeptr, 287 IXML_Node *nodeptr); 297 IXML_Node *nodeptr); 310 IXML_Node *nodeptr); 320 IXML_Node *nodeptr); 446 IXML_Node *nodeptr, 478 IXML_Node *nodeptr, 505 IXML_Node *nodeptr, [all …]
|
/dports/biology/iqtree/IQ-TREE-2.0.6/utils/ |
H A D | pllnni.h | 40 nodeptr p; 94 void _update(pllInstance *tr, partitionList *pr, nodeptr p); 110 set<int> getAffectedNodes(pllInstance* tr, nodeptr p); 112 string getBranString(nodeptr p); 114 bool containsAffectedNodes(nodeptr p, SearchInfo &searchinfo); 136 int evalNNIForBran(pllInstance* tr, partitionList *pr, nodeptr p, SearchInfo &searchinfo); 165 void pllSaveQuartetForSubTree(pllInstance* tr, nodeptr p, SearchInfo &searchinfo); 177 void pllGetAllInBran(pllInstance *tr, vector<nodeptr> &branlist); 179 void pllGetAllInBranForSubtree(pllInstance *tr, nodeptr p, vector<nodeptr> &branlist); 182 string convertQuartet2String(nodeptr p); [all …]
|
/dports/shells/dash/dash-0.5.11.5/src/ |
H A D | nodetypes | 43 # nodeptr - a pointer to a node 56 args nodeptr # the arguments 67 n nodeptr # the command 78 ch1 nodeptr # the first child 79 ch2 nodeptr # the second child 83 test nodeptr # if test 84 ifpart nodeptr # then ifpart 93 args nodeptr # for var in args 94 body nodeptr # do body; done 114 body nodeptr [all …]
|
/dports/net/clusterit/clusterit-2.5/common/ |
H A D | common.c | 124 node_t *nodeptr; in do_showcluster() local 132 for (nodeptr = nodelink; nodeptr->next != NULL; in do_showcluster() 133 nodeptr = nodeptr->next) in do_showcluster() 152 nodeptr = nodelink; in do_showcluster() 170 nodeptr->name); in do_showcluster() 171 nodeptr = nodeptr->next; in do_showcluster() 191 node_t *nodeptr; in parse_cluster() local 353 nodeptr->group = g; in parse_cluster() 362 nodeptr->group = g; in parse_cluster() 398 for (nodeptr = nodelink; nodeptr->next != NULL; in nodealloc() [all …]
|
/dports/devel/kBuild/kBuild-0.1.9998/src/kash/ |
H A D | nodetypes | 42 # nodeptr - a pointer to a node 53 ch1 nodeptr # the first child 54 ch2 nodeptr # the second child 59 args nodeptr # the arguments 69 n nodeptr # the command 80 test nodeptr # if test 81 ifpart nodeptr # then ifpart 82 elsepart nodeptr # else elsepart 89 args nodeptr # for var in args 90 body nodeptr # do body; done [all …]
|