Home
last modified time | relevance | path

Searched refs:n_list (Results 1 – 25 of 212) sorted by relevance

123456789

/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/blast/unit_tests/seqdb_reader/
H A Dseqdb_lmdb_unit_test.cpp202 n_list->ReserveSis(sis.size()); in BOOST_AUTO_TEST_CASE()
204 n_list->AddSi(*iter); in BOOST_AUTO_TEST_CASE()
223 n_list->ReserveSis(sis.size()); in BOOST_AUTO_TEST_CASE()
225 n_list->AddSi(*iter); in BOOST_AUTO_TEST_CASE()
247 n_list->ReserveSis(sis.size()); in BOOST_AUTO_TEST_CASE()
249 n_list->AddSi(*iter); in BOOST_AUTO_TEST_CASE()
265 n_list->SetListInfo(list_info); in BOOST_AUTO_TEST_CASE()
268 n_list->AddSi(sis[i]); in BOOST_AUTO_TEST_CASE()
287 n_list->ReserveSis(sis.size()); in BOOST_AUTO_TEST_CASE()
289 n_list->AddSi(*iter); in BOOST_AUTO_TEST_CASE()
[all …]
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/src/algo/blast/unit_tests/seqdb_reader/
H A Dseqdb_lmdb_unit_test.cpp202 n_list->ReserveSis(sis.size()); in BOOST_AUTO_TEST_CASE()
204 n_list->AddSi(*iter); in BOOST_AUTO_TEST_CASE()
223 n_list->ReserveSis(sis.size()); in BOOST_AUTO_TEST_CASE()
225 n_list->AddSi(*iter); in BOOST_AUTO_TEST_CASE()
247 n_list->ReserveSis(sis.size()); in BOOST_AUTO_TEST_CASE()
249 n_list->AddSi(*iter); in BOOST_AUTO_TEST_CASE()
265 n_list->SetListInfo(list_info); in BOOST_AUTO_TEST_CASE()
268 n_list->AddSi(sis[i]); in BOOST_AUTO_TEST_CASE()
287 n_list->ReserveSis(sis.size()); in BOOST_AUTO_TEST_CASE()
289 n_list->AddSi(*iter); in BOOST_AUTO_TEST_CASE()
[all …]
/dports/devel/plan9port/plan9port-1f098efb7370a0b28306d10681e21883fb1c1507/src/cmd/
H A Dnews.c33 File* n_list; variable
102 n_list = malloc(NINC*sizeof(File)); in read_dir()
109 n_list[n_count].name = strdup(""); in read_dir()
110 n_list[n_count].time =d->mtime-1; in read_dir()
111 n_list[n_count].length = 0; in read_dir()
135 n_list = realloc(n_list, na*sizeof(File)); in read_dir()
137 n_list[n_count].name = strdup(d[i].name); in read_dir()
138 n_list[n_count].time = d[i].mtime; in read_dir()
139 n_list[n_count].length = d[i].length; in read_dir()
146 qsort(n_list, n_count, sizeof(File), fcmp); in read_dir()
[all …]
/dports/shells/ksh93-devel/ast-cc1bca27/src/lib/librecsort/
H A Drslist.c109 reg int n_list; local
125 n_list = uninsert(ulist,n_list,uarray+p);
129 while(n_list > 0)
140 n_list = uninsert(ulist,n_list,un);
158 if(n_list == 0)
179 { n_list = 2;
184 else n_list += 1;
226 rs->n_list += 1;
229 if(rs->n_list > 0)
230 { list = rs->n_list > 1 ? unionize(rs->list,rs->n_list) : rs->list[0];
[all …]
/dports/shells/ksh93/ast-93u/src/lib/librecsort/
H A Drslist.c109 reg int n_list; local
125 n_list = uninsert(ulist,n_list,uarray+p);
129 while(n_list > 0)
140 n_list = uninsert(ulist,n_list,un);
158 if(n_list == 0)
179 { n_list = 2;
184 else n_list += 1;
226 rs->n_list += 1;
229 if(rs->n_list > 0)
230 { list = rs->n_list > 1 ? unionize(rs->list,rs->n_list) : rs->list[0];
[all …]
/dports/shells/ast-ksh/ast-ksh93v/src/lib/librecsort/
H A Drslist.c109 reg int n_list; local
125 n_list = uninsert(ulist,n_list,uarray+p);
129 while(n_list > 0)
140 n_list = uninsert(ulist,n_list,un);
158 if(n_list == 0)
179 { n_list = 2;
184 else n_list += 1;
226 rs->n_list += 1;
229 if(rs->n_list > 0)
230 { list = rs->n_list > 1 ? unionize(rs->list,rs->n_list) : rs->list[0];
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/net/netfilter/ipvs/
H A Dip_vs_wrr.c75 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
96 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
117 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
144 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
179 n_list) { in ip_vs_wrr_schedule()
196 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
202 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
243 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
H A Dip_vs_rr.c42 if (p == &dest->n_list) in ip_vs_rr_del_dest()
64 last = dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
69 n_list) { in ip_vs_rr_schedule()
89 svc->sched_data = &dest->n_list; in ip_vs_rr_schedule()
105 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
H A Dip_vs_sched.c87 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
187 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
199 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
211 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
231 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
241 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
H A Dip_vs_pe.c29 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
78 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
88 list_add_rcu(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
102 list_del_rcu(&pe->n_list); in unregister_ip_vs_pe()
H A Dip_vs_wlc.c50 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
65 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
93 .n_list = LIST_HEAD_INIT(ip_vs_wlc_scheduler.n_list),
H A Dip_vs_sed.c78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
93 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
121 .n_list = LIST_HEAD_INIT(ip_vs_sed_scheduler.n_list),
/dports/multimedia/libv4l/linux-5.13-rc2/net/netfilter/ipvs/
H A Dip_vs_wrr.c75 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
96 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
117 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
144 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
179 n_list) { in ip_vs_wrr_schedule()
196 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
202 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
243 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
H A Dip_vs_rr.c42 if (p == &dest->n_list) in ip_vs_rr_del_dest()
64 last = dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
69 n_list) { in ip_vs_rr_schedule()
89 svc->sched_data = &dest->n_list; in ip_vs_rr_schedule()
105 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
H A Dip_vs_sched.c87 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
187 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
199 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
211 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
231 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
241 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
H A Dip_vs_pe.c29 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
78 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
88 list_add_rcu(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
102 list_del_rcu(&pe->n_list); in unregister_ip_vs_pe()
H A Dip_vs_wlc.c50 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
65 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
93 .n_list = LIST_HEAD_INIT(ip_vs_wlc_scheduler.n_list),
/dports/multimedia/v4l-utils/linux-5.13-rc2/net/netfilter/ipvs/
H A Dip_vs_wrr.c75 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
96 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
117 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
144 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
179 n_list) { in ip_vs_wrr_schedule()
196 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
202 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
243 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
H A Dip_vs_rr.c42 if (p == &dest->n_list) in ip_vs_rr_del_dest()
64 last = dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
69 n_list) { in ip_vs_rr_schedule()
89 svc->sched_data = &dest->n_list; in ip_vs_rr_schedule()
105 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
H A Dip_vs_sched.c87 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
187 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
199 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
211 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
231 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
241 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
H A Dip_vs_pe.c29 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
78 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
88 list_add_rcu(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
102 list_del_rcu(&pe->n_list); in unregister_ip_vs_pe()
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/
H A Dqs_harmonics_atom.F491 list, n_list, max_iso_not0) argument
497 INTEGER, DIMENSION(:), INTENT(OUT), OPTIONAL :: n_list local
508 IF (PRESENT(n_list) .AND. PRESENT(list)) THEN
512 IF (PRESENT(n_list) .AND. PRESENT(list)) n_list = 0
524 IF (PRESENT(n_list) .AND. PRESENT(list)) THEN
534 IF (PRESENT(n_list) .AND. PRESENT(list)) n_list(iso) = nlist
552 list, n_list, max_iso_not0) argument
558 INTEGER, DIMENSION(:), INTENT(OUT), OPTIONAL :: n_list local
569 IF (PRESENT(n_list) .AND. PRESENT(list)) THEN
573 IF (PRESENT(n_list) .AND. PRESENT(list)) n_list = 0
[all …]
/dports/games/edge/Edge-1.35-source/src/
H A Dr_md2.cc401 short *n_list = new short[count+1]; in CreateNormalList() local
407 n_list[count++] = i; in CreateNormalList()
409 n_list[count] = -1; in CreateNormalList()
411 return n_list; in CreateNormalList()
699 short *n_list = data->used_normals; in InitNormalColors() local
701 for (; *n_list >= 0; n_list++) in InitNormalColors()
703 data->nm_colors[*n_list].Clear(); in InitNormalColors()
712 for (; *n_list >= 0; n_list++) in ShadeNormals()
714 short n = *n_list; in ShadeNormals()
755 for (; *n_list >= 0; n_list++) in MD2_MulticolMaxRGB()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/tools/i-pi/drivers/
H A Ddriver.f9062 INTEGER, DIMENSION(:), ALLOCATABLE :: n_list, index_list variable
252 IF ((allocated(n_list) .neqv. .true.)) THEN
254 ALLOCATE(n_list(nat*(nat-1)/2))
257 CALL nearest_neighbours(rn, nat, atoms, cell_h, cell_ih, index_list, n_list)
270 CALL nearest_neighbours(rn, nat, atoms, cell_h, cell_ih, index_list, n_list)
278 …CALL LJ_getall(rc, sigma, eps, nat, atoms, cell_h, cell_ih, index_list, n_list, pot, forces, viria…
280 … CALL SG_getall(rc, nat, atoms, cell_h, cell_ih, index_list, n_list, pot, forces, virial)
/dports/science/cp2k-data/cp2k-7.1.0/src/
H A Dqs_harmonics_atom.F490 list, n_list, max_iso_not0) argument
496 INTEGER, DIMENSION(:), INTENT(OUT), OPTIONAL :: n_list local
507 IF (PRESENT(n_list) .AND. PRESENT(list)) THEN
511 IF (PRESENT(n_list) .AND. PRESENT(list)) n_list = 0
523 IF (PRESENT(n_list) .AND. PRESENT(list)) THEN
533 IF (PRESENT(n_list) .AND. PRESENT(list)) n_list(iso) = nlist
551 list, n_list, max_iso_not0) argument
557 INTEGER, DIMENSION(:), INTENT(OUT), OPTIONAL :: n_list local
568 IF (PRESENT(n_list) .AND. PRESENT(list)) THEN
572 IF (PRESENT(n_list) .AND. PRESENT(list)) n_list = 0
[all …]

123456789