Home
last modified time | relevance | path

Searched refs:node_block (Results 1 – 25 of 33) sorted by relevance

12

/dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/
H A Dgenerate_dot.R435 node_block <- c(node_block, line)
439 node_block <-
440 c(node_block,
441 tapply(node_block,
458 clusters <- split(node_block, cluster_vals)
476 node_block <- clustered_node_block
483 node_block <- paste(node_block, collapse = "\n")
639 node_block, edge_block,
645 node_block,
651 combined_block <- paste(node_block, edge_block,
[all …]
/dports/devel/sgb/sgb-20090810_1/ANSI/
H A Dgb_econ.ch4 for (p=node_index[ADJ_SEC]-1;p>=node_block;p--) /* bottom up */
7 for (p=node_index[ADJ_SEC];p>node_block; ) /* bottom up */
12 for (p=node_index[ADJ_SEC];p>=node_block;p--) { /* bottom up */
15 for (p=node_index[ADJ_SEC]+1;p>node_block; ) { /* bottom up */
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/external/maxflow-v2.21.src/adjacency_list/
H A Dgraph.cpp9 node_block = new Block<node>(NODE_BLOCK_SIZE, error_function); in Graph()
16 delete node_block; in ~Graph()
22 node *i = node_block -> New(); in add_node()
H A Dgraph.h132 Block<node> *node_block; variable
H A Dmaxflow.cpp81 for (i=node_block->ScanFirst(); i; i=node_block->ScanNext()) in maxflow_init()
/dports/cad/gtkwave/gtkwave-3.3.107/src/
H A Dlx2.c43 struct Node *node_block = NULL; in lx2_main() local
65 node_block=(struct Node *)calloc_2(GLOBALS->numfacs,sizeof(struct Node)); in lx2_main()
70 node_block[i].msi=lxt2_rd_get_fac_msb(GLOBALS->lx2_lx2_c_1, i); in lx2_main()
71 node_block[i].lsi=lxt2_rd_get_fac_lsb(GLOBALS->lx2_lx2_c_1, i); in lx2_main()
137 …int len = sprintf(buf, "%s[%d:%d]", f_name[(i)&F_NAME_MODULUS],node_block[i].msi, node_block[i].ls… in lx2_main()
153 …_INTEGER|LXT2_RD_SYM_F_DOUBLE|LXT2_RD_SYM_F_STRING))) && (node_block[i].msi!=-1) && (node_block[i]… in lx2_main()
158 int len = sprintf(buf, "%s[%d]", f_name[(i)&F_NAME_MODULUS],node_block[i].msi); in lx2_main()
199 node_block[i].msi=31; in lx2_main()
200 node_block[i].lsi=0; in lx2_main()
206 n=&node_block[i]; in lx2_main()
H A Dvzt.c43 struct Node *node_block = NULL; in vzt_main() local
66 node_block=(struct Node *)calloc_2(GLOBALS->numfacs,sizeof(struct Node)); in vzt_main()
71 node_block[i].msi=vzt_rd_get_fac_msb(GLOBALS->vzt_vzt_c_1, i); in vzt_main()
72 node_block[i].lsi=vzt_rd_get_fac_lsb(GLOBALS->vzt_vzt_c_1, i); in vzt_main()
138 …int len=sprintf(buf, "%s[%d:%d]", f_name[(i)&F_NAME_MODULUS],node_block[i].msi, node_block[i].lsi); in vzt_main()
155 …_F_INTEGER|VZT_RD_SYM_F_DOUBLE|VZT_RD_SYM_F_STRING))) && (node_block[i].msi!=-1) && (node_block[i]… in vzt_main()
160 int len = sprintf(buf, "%s[%d]", f_name[(i)&F_NAME_MODULUS],node_block[i].msi); in vzt_main()
201 node_block[i].msi=31; in vzt_main()
202 node_block[i].lsi=0; in vzt_main()
208 n=&node_block[i]; in vzt_main()
H A Dfst.c556 struct Node *node_block = NULL; in fst_main() local
753 node_block[i].lsi = 0; in fst_main()
765 node_block[i].msi = msb; in fst_main()
766 node_block[i].lsi = lsb; in fst_main()
891 int len=sprintf_2_sdd(buf, f_name[(i)&F_NAME_MODULUS],node_block[i].msi, node_block[i].lsi); in fst_main()
896 node_block[i].lsi = 0; in fst_main()
928 len = sprintf_2_sdd(buf, nnam,node_block[i].msi, node_block[i].lsi); in fst_main()
1018 node_block[i].lsi = 0; in fst_main()
1023 node_block[i].msi = 31; in fst_main()
1024 node_block[i].lsi = 0; in fst_main()
[all …]
H A Dlxt.c494 node_block[i].msi=get_32(offs+4); in build_facs()
495 node_block[i].lsi=get_32(offs+8); in build_facs()
497 …vlfacs_lxt_c_2[i].len=(node_block[i].lsi>node_block[i].msi)?(node_block[i].lsi-node_block[i].msi+1… in build_facs()
500 DEBUG(printf(LXTHDR"%s[%d:%d]\n", f_name[i], node_block[i].msi, node_block[i].lsi)); in build_facs()
1368 struct Node *node_block = NULL; in lxt_main() local
1542 build_facs(fname, f_name, node_block); in lxt_main()
1577 int len = sprintf(buf, "%s[%d:%d]", f_name[i],node_block[i].msi, node_block[i].lsi); in lxt_main()
1593 …&(LT_SYM_F_INTEGER|LT_SYM_F_DOUBLE|LT_SYM_F_STRING))) && (node_block[i].msi!=-1) && (node_block[i]… in lxt_main()
1639 node_block[i].msi=31; in lxt_main()
1640 node_block[i].lsi=0; in lxt_main()
[all …]
/dports/devel/libfirm/libfirm-1.21.0/ir/be/
H A Dbeflags.c90 ir_node *node_block = get_nodes_block(node); in can_move() local
91 assert(node_block == get_nodes_block(after)); in can_move()
103 if (get_nodes_block(out2) != node_block) in can_move()
124 if (get_nodes_block(out) != node_block) in can_move()
H A Dbepeephole.c299 const ir_node *node_block = get_nodes_block(node); in be_can_move_up() local
302 if (node_block != after_block) { in be_can_move_up()
304 assert(get_Block_cfgpred_block(node_block, 0) == after_block); in be_can_move_up()
305 ir_node *first = sched_first(node_block); in be_can_move_up()
323 if (succ == node_block) in be_can_move_up()
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/external/maxflow-v2.21.src/forward_star/
H A Dgraph.cpp20 node_block *next = node_block_first -> next; in ~Graph()
46 node_block *next = node_block_first; in add_node()
47 node_block_first = (node_block *) new node_block; in add_node()
139 node_block *nb; in prepare_graph()
H A Dgraph.h170 } node_block; typedef
204 node_block *node_block_first;
/dports/devel/sgb/sgb-20090810_1/
H A Dgb_econ.w267 static node *node_block; /* array of nodes, specifies the tree in preorder */
275 node_block=gb_typed_alloc(2*MAX_N-3,node,working_storage);
302 for (p=node_block; p<node_block+NORM_N+NORM_N-1; p++) {@+register long c;
353 Once all the data appears in |node_block|, we want to extract from it
385 /* the \.{Users} node at the end of |node_block| */
386 for (p=node_index[ADJ_SEC]-1;p>=node_block;p--) /* bottom up */
389 special->link=node_block;@+node_block->link=special; /* start at the root */
445 node_block->tag=l;
448 for (p=node_block;p<node_index[ADJ_SEC];p++) /* top down, from root */
495 if (p==node_block) {
[all …]
H A Dgb_miles.w180 static node *node_block; /* array of nodes holding city info */
218 node_block=gb_typed_alloc(MAX_N,node,new_graph->aux_data);
238 p=node_block+k;
282 gb_linksort(node_block+MAX_N-1);
348 for (p=node_block; p<node_block+MAX_N; p++)
363 for (q=node_block; q<node_block+MAX_N; q++)
H A Dgb_books.w262 static node node_block[MAX_CHARS]; /* array of nodes for working storage */
281 p=node_block; /* current node entering the system */
285 if (p>=&node_block[MAX_CHARS])
287 p->link=(p==node_block?NULL:p-1);
295 characters=p-node_block;
404 for (p=node_block;p<node_block+characters;p++) p->chap=0;
517 for (p=node_block; p<node_block+characters; p++)
519 gb_linksort(node_block+characters-1);
H A Dgb_games.w282 static node *node_block; /* array of nodes holding team info */
289 node_block=gb_typed_alloc(MAX_N+2,node,working_storage);
306 p=node_block+k;
373 gb_linksort(node_block+MAX_N-1);
/dports/multimedia/v4l-utils/linux-5.13-rc2/arch/sparc/kernel/
H A Dmdesc.c613 static struct mdesc_elem *node_block(struct mdesc_hdr *mdesc) in node_block() function
620 return ((void *) node_block(mdesc)) + mdesc->node_sz; in name_block()
631 struct mdesc_elem *ep = node_block(&hp->mdesc); in mdesc_node_by_name()
668 ep = node_block(&hp->mdesc) + node; in mdesc_get_property()
705 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_next_arc()
731 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_arc_target()
741 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_node_name()
/dports/multimedia/v4l_compat/linux-5.13-rc2/arch/sparc/kernel/
H A Dmdesc.c613 static struct mdesc_elem *node_block(struct mdesc_hdr *mdesc) in node_block() function
620 return ((void *) node_block(mdesc)) + mdesc->node_sz; in name_block()
631 struct mdesc_elem *ep = node_block(&hp->mdesc); in mdesc_node_by_name()
668 ep = node_block(&hp->mdesc) + node; in mdesc_get_property()
705 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_next_arc()
731 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_arc_target()
741 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_node_name()
/dports/multimedia/libv4l/linux-5.13-rc2/arch/sparc/kernel/
H A Dmdesc.c613 static struct mdesc_elem *node_block(struct mdesc_hdr *mdesc) in node_block() function
620 return ((void *) node_block(mdesc)) + mdesc->node_sz; in name_block()
631 struct mdesc_elem *ep = node_block(&hp->mdesc); in mdesc_node_by_name()
668 ep = node_block(&hp->mdesc) + node; in mdesc_get_property()
705 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_next_arc()
731 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_arc_target()
741 struct mdesc_elem *ep, *base = node_block(&hp->mdesc); in mdesc_node_name()
/dports/math/cgal/CGAL-5.3/include/CGAL/internal/auxiliary/
H A Dgraph.h626 } node_block;
656 node_block *node_block_first;
707 node_block *next = node_block_first -> next;
731 node_block *next = node_block_first;
732 node_block_first = (node_block *) new node_block;
836 node_block *nb;
1093 node_block *nb;
/dports/www/node10/node-v10.24.1/deps/v8/src/
H A Dglobal-handles.cc463 NodeBlock* node_block = FindBlock(); in IncreaseBlockUses() local
464 node_block->IncreaseUses(); in IncreaseBlockUses()
465 GlobalHandles* global_handles = node_block->global_handles(); in IncreaseBlockUses()
472 NodeBlock* node_block = FindBlock(); in DecreaseBlockUses() local
473 GlobalHandles* global_handles = node_block->global_handles(); in DecreaseBlockUses()
476 node_block->DecreaseUses(); in DecreaseBlockUses()
/dports/games/minetest/minetest-5.4.1/src/
H A Dvoxelalgorithms.cpp441 MapBlock *node_block = map->getBlockNoCreateNoEx(getNodeBlockPos(pos)); in is_sunlight_above() local
442 if (node_block == NULL) { in is_sunlight_above()
445 sunlight = !node_block->getIsUnderground(); in is_sunlight_above()
844 MapBlock *node_block = map->getBlockNoCreateNoEx(pos); in is_sunlight_above_block() local
845 if (node_block == NULL) in is_sunlight_above_block()
849 sunlight = !node_block->getIsUnderground(); in is_sunlight_above_block()
/dports/print/limereport/LimeReport-1.5.35/3rdparty/easyprofiler/profiler_gui/
H A Dtree_widget_loader.cpp200 const auto node_block = easyBlocksTree(threadTree.second.children.front()).node; in setTreeInternal1() local
201 const auto startTime = node_block->begin(); in setTreeInternal1()
202 const auto endTime = node_block->end(); in setTreeInternal1()
/dports/math/vtk9/VTK-9.1.0/ThirdParty/ioss/vtkioss/
H A DIoss_Region.C1078 bool Region::add(NodeBlock *node_block) in add() argument
1080 check_for_duplicate_names(this, node_block); in add()
1081 update_database(this, node_block); in add()
1086 nodeBlocks.push_back(node_block); in add()
1088 add_alias__(node_block); in add()

12