Home
last modified time | relevance | path

Searched refs:nbranches (Results 1 – 25 of 107) sorted by relevance

12345

/dports/math/blacs/BLACS_shared/SRC/MPI/INTERNAL/
H A DBI_TreeComb.c20 int N, VVFUNPTR Xvvop, int dest, int nbranches) in BI_TreeComb() argument
97 if (nbranches == FULLCON) nbranches = Np; in BI_TreeComb()
98 rightedge = Np - 1 - (Np-1)%nbranches; in BI_TreeComb()
100 for (i=1; (i < Np); i *= nbranches) in BI_TreeComb()
102 if (mydist%nbranches) /* nodes that send to other nodes */ in BI_TreeComb()
104 BI_Ssend(ctxt, (dest + (mydist-mydist%nbranches)*i)%Np, msgid, bp); in BI_TreeComb()
109 if (mydist != rightedge) nrcvs = nbranches - 1; in BI_TreeComb()
111 mydist /= nbranches; in BI_TreeComb()
112 rightedge /= nbranches; in BI_TreeComb()
113 rightedge -= (rightedge % nbranches); in BI_TreeComb()
H A DBI_TreeBR.c3 void BI_TreeBR(BLACSCONTEXT *ctxt, BLACBUFF *bp, SDRVPTR send, int src, int nbranches) in BI_TreeBR() argument
19 for (i=nbranches; i < Np; i *= nbranches); in BI_TreeBR()
20 for (i /= nbranches; (mydist%i); i /= nbranches); in BI_TreeBR()
28 i /= nbranches; in BI_TreeBR()
36 while(++j < nbranches); in BI_TreeBR()
H A DBI_TreeBS.c37 void BI_TreeBS(BLACSCONTEXT *ctxt, BLACBUFF *bp, SDRVPTR send, int nbranches) in BI_TreeBS() argument
47 for (i=nbranches; i < Np; i*=nbranches); in BI_TreeBS()
48 for (i /= nbranches; i > 0; i /= nbranches) in BI_TreeBS()
57 while(++j < nbranches); in BI_TreeBS()
/dports/math/blacs/BLACS/SRC/MPI/INTERNAL/
H A DBI_TreeComb.c20 int N, VVFUNPTR Xvvop, int dest, int nbranches) in BI_TreeComb() argument
97 if (nbranches == FULLCON) nbranches = Np; in BI_TreeComb()
98 rightedge = Np - 1 - (Np-1)%nbranches; in BI_TreeComb()
100 for (i=1; (i < Np); i *= nbranches) in BI_TreeComb()
102 if (mydist%nbranches) /* nodes that send to other nodes */ in BI_TreeComb()
104 BI_Ssend(ctxt, (dest + (mydist-mydist%nbranches)*i)%Np, msgid, bp); in BI_TreeComb()
109 if (mydist != rightedge) nrcvs = nbranches - 1; in BI_TreeComb()
111 mydist /= nbranches; in BI_TreeComb()
112 rightedge /= nbranches; in BI_TreeComb()
113 rightedge -= (rightedge % nbranches); in BI_TreeComb()
H A DBI_TreeBR.c3 void BI_TreeBR(BLACSCONTEXT *ctxt, BLACBUFF *bp, SDRVPTR send, int src, int nbranches) in BI_TreeBR() argument
19 for (i=nbranches; i < Np; i *= nbranches); in BI_TreeBR()
20 for (i /= nbranches; (mydist%i); i /= nbranches); in BI_TreeBR()
28 i /= nbranches; in BI_TreeBR()
36 while(++j < nbranches); in BI_TreeBR()
H A DBI_TreeBS.c37 void BI_TreeBS(BLACSCONTEXT *ctxt, BLACBUFF *bp, SDRVPTR send, int nbranches) in BI_TreeBS() argument
47 for (i=nbranches; i < Np; i*=nbranches); in BI_TreeBS()
48 for (i /= nbranches; i > 0; i /= nbranches) in BI_TreeBS()
57 while(++j < nbranches); in BI_TreeBS()
/dports/math/scalapack/scalapack-2.1.0/BLACS/SRC/
H A DBI_TreeComb.c20 int N, VVFUNPTR Xvvop, int dest, int nbranches) in BI_TreeComb() argument
97 if (nbranches == FULLCON) nbranches = Np; in BI_TreeComb()
98 rightedge = Np - 1 - (Np-1)%nbranches; in BI_TreeComb()
100 for (i=1; (i < Np); i *= nbranches) in BI_TreeComb()
102 if (mydist%nbranches) /* nodes that send to other nodes */ in BI_TreeComb()
104 BI_Ssend(ctxt, (dest + (mydist-mydist%nbranches)*i)%Np, msgid, bp); in BI_TreeComb()
109 if (mydist != rightedge) nrcvs = nbranches - 1; in BI_TreeComb()
111 mydist /= nbranches; in BI_TreeComb()
112 rightedge /= nbranches; in BI_TreeComb()
113 rightedge -= (rightedge % nbranches); in BI_TreeComb()
H A DBI_TreeBR.c3 void BI_TreeBR(BLACSCONTEXT *ctxt, BLACBUFF *bp, SDRVPTR send, int src, int nbranches) in BI_TreeBR() argument
19 for (i=nbranches; i < Np; i *= nbranches); in BI_TreeBR()
20 for (i /= nbranches; (mydist%i); i /= nbranches); in BI_TreeBR()
28 i /= nbranches; in BI_TreeBR()
36 while(++j < nbranches); in BI_TreeBR()
H A DBI_TreeBS.c37 void BI_TreeBS(BLACSCONTEXT *ctxt, BLACBUFF *bp, SDRVPTR send, int nbranches) in BI_TreeBS() argument
47 for (i=nbranches; i < Np; i*=nbranches); in BI_TreeBS()
48 for (i /= nbranches; i > 0; i /= nbranches) in BI_TreeBS()
57 while(++j < nbranches); in BI_TreeBS()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/src/lib_funcs/
H A Dpiecewisepoly.c373 p->nbranches = 0; in piecewise_poly_alloc()
413 dst->nbranches = src->nbranches; in piecewise_poly_copy_inside()
1011 pnew->nbranches = p->nbranches; in piecewise_poly_deriv()
1048 pnew->nbranches = p->nbranches; in piecewise_poly_dderiv()
1626 c->nbranches = x->nbranches; in piecewise_poly_matched_daxpby()
1643 c->nbranches = y->nbranches; in piecewise_poly_matched_daxpby()
1660 if (x->nbranches != y->nbranches){ in piecewise_poly_matched_daxpby()
1664 assert (x->nbranches == y->nbranches); in piecewise_poly_matched_daxpby()
1666 c->nbranches = y->nbranches; in piecewise_poly_matched_daxpby()
1703 assert ( a->nbranches == b->nbranches ); in piecewise_poly_matched_prod()
[all …]
/dports/sysutils/fusefs-unionfs/unionfs-fuse-2.2/src/
H A Dopts.c174 uopt.branches = realloc(uopt.branches, (uopt.nbranches+1) * sizeof(branch_entry_t)); in add_branch()
188 uopt.branches[uopt.nbranches].path = strdup(res); in add_branch()
189 uopt.branches[uopt.nbranches].rw = 0; in add_branch()
194 uopt.branches[uopt.nbranches].rw = 1; in add_branch()
203 uopt.nbranches++; in add_branch()
212 if (uopt.nbranches) return 0; in parse_branches()
227 return uopt.nbranches; in parse_branches()
319 for (i = 0; i < uopt.nbranches; i++) { in unionfs_post_opts()
H A Dfindbranch.c61 for (i = 0; i < uopt.nbranches; i++) { in debug_init()
155 branch_rw = find_lowest_rw_branch(uopt.nbranches);
/dports/biology/abyss/abyss-2.3.1/PopBubbles/
H A DPopBubbles.cpp199 unsigned nbranches = g.out_degree(v); in popBubble() local
200 assert(nbranches > 1); in popBubble()
201 assert(nbranches == g.in_degree(tail)); in popBubble()
263 vector<int> inDists(nbranches); in getAlignmentIdentity()
266 vector<int> outDists(nbranches); in getAlignmentIdentity()
269 vector<int> insertLens(nbranches); in getAlignmentIdentity()
290 vector<string> seqs(nbranches); in getAlignmentIdentity()
313 unsigned nbranches = g.out_degree(v); in popSimpleBubble() local
314 assert(nbranches >= 2); in popSimpleBubble()
354 if (nbranches > opt::maxBranches) { in popSimpleBubble()
[all …]
/dports/databases/slony1v2/slony1-2.2.10/src/ducttape/
H A Dtest_8_pgbench-1.sql1 \set nbranches :scale
5 \setrandom bid 1 :nbranches
/dports/devel/sentry-cli/sentry-cli-1.71.0/cargo-crates/goblin-0.4.3/src/mach/
H A Dexports.rs198 nbranches: usize, in walk_branches()
202 let mut branches = Vec::with_capacity(nbranches); in walk_branches()
204 for _i in 0..nbranches { in walk_branches()
235 let nbranches = Uleb128::read(&self.data, &mut offset)? as usize; in walk_trie() localVariable
237 let branches = self.walk_branches(nbranches, current_symbol, offset)?; in walk_trie()
/dports/www/geckodriver/mozilla-central-e9783a644016aa9b317887076618425586730d73/testing/geckodriver/cargo-crates/goblin-0.0.24/src/mach/
H A Dexports.rs180 …fn walk_branches(&self, nbranches: usize, current_symbol: String, mut offset: usize) -> error::Res… in walk_branches()
181 let mut branches = Vec::with_capacity(nbranches); in walk_branches()
183 for _i in 0..nbranches { in walk_branches()
208 let nbranches = Uleb128::read(&self.data, &mut offset)? as usize; in walk_trie() localVariable
210 let branches = self.walk_branches(nbranches, current_symbol, offset)?; in walk_trie()
/dports/www/firefox/firefox-99.0/third_party/rust/goblin/src/mach/
H A Dexports.rs180 …fn walk_branches(&self, nbranches: usize, current_symbol: String, mut offset: usize) -> error::Res… in walk_branches()
181 let mut branches = Vec::with_capacity(nbranches); in walk_branches()
183 for _i in 0..nbranches { in walk_branches()
208 let nbranches = Uleb128::read(&self.data, &mut offset)? as usize; in walk_trie() localVariable
210 let branches = self.walk_branches(nbranches, current_symbol, offset)?; in walk_trie()
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/goblin/src/mach/
H A Dexports.rs180 …fn walk_branches(&self, nbranches: usize, current_symbol: String, mut offset: usize) -> error::Res… in walk_branches()
181 let mut branches = Vec::with_capacity(nbranches); in walk_branches()
183 for _i in 0..nbranches { in walk_branches()
208 let nbranches = Uleb128::read(&self.data, &mut offset)? as usize; in walk_trie() localVariable
210 let branches = self.walk_branches(nbranches, current_symbol, offset)?; in walk_trie()
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/goblin/src/mach/
H A Dexports.rs180 …fn walk_branches(&self, nbranches: usize, current_symbol: String, mut offset: usize) -> error::Res… in walk_branches()
181 let mut branches = Vec::with_capacity(nbranches); in walk_branches()
183 for _i in 0..nbranches { in walk_branches()
208 let nbranches = Uleb128::read(&self.data, &mut offset)? as usize; in walk_trie() localVariable
210 let branches = self.walk_branches(nbranches, current_symbol, offset)?; in walk_trie()
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/goblin/src/mach/
H A Dexports.rs180 …fn walk_branches(&self, nbranches: usize, current_symbol: String, mut offset: usize) -> error::Res… in walk_branches()
181 let mut branches = Vec::with_capacity(nbranches); in walk_branches()
183 for _i in 0..nbranches { in walk_branches()
208 let nbranches = Uleb128::read(&self.data, &mut offset)? as usize; in walk_trie() localVariable
210 let branches = self.walk_branches(nbranches, current_symbol, offset)?; in walk_trie()
/dports/devel/bingrep/bingrep-0.8.5/cargo-crates/goblin-0.3.1/src/mach/
H A Dexports.rs198 nbranches: usize, in walk_branches()
202 let mut branches = Vec::with_capacity(nbranches); in walk_branches()
204 for _i in 0..nbranches { in walk_branches()
235 let nbranches = Uleb128::read(&self.data, &mut offset)? as usize; in walk_trie() localVariable
237 let branches = self.walk_branches(nbranches, current_symbol, offset)?; in walk_trie()
/dports/devel/py-maturin/maturin-0.11.3/cargo-crates/goblin-0.4.2/src/mach/
H A Dexports.rs198 nbranches: usize, in walk_branches()
202 let mut branches = Vec::with_capacity(nbranches); in walk_branches()
204 for _i in 0..nbranches { in walk_branches()
235 let nbranches = Uleb128::read(&self.data, &mut offset)? as usize; in walk_trie() localVariable
237 let branches = self.walk_branches(nbranches, current_symbol, offset)?; in walk_trie()
/dports/devel/cvsgraph/cvsgraph-1.7.0/
H A Dcvsgraph.c541 currev->nbranches++; in build_branch()
628 rcs->nbranches = nbl; in reorganise_branches()
964 (*r)->branches[(*r)->nbranches] = rcs->branches[rcs->nbranches]; in assign_tags()
965 (*r)->nbranches++; in assign_tags()
966 rcs->nbranches++; in assign_tags()
2436 for(j = 0; j < r->nbranches; j++) in initial_reposition_branch()
2454 for(j = 0; j < r->nbranches; j++) in initial_reposition_branch_lr()
2992 for(i = 0; i < r->nbranches; i++) in fold_branch()
3013 rcs->nbranches--; in fold_branch()
3020 r->nbranches--; in fold_branch()
[all …]
H A Drcs.h171 int nbranches; member
206 int nbranches; member
/dports/databases/sqliteodbc/sqliteodbc-0.9998/tccex/
H A Dsbench.c23 static int nbranches = 1; /* number of branches in 1 tps db */ variable
88 min += nbranches; in getRandomID()
93 num = nbranches; in getRandomID()
235 for (i = 0; i < nbranches * tps; i++) { in createDatabase()

12345