Home
last modified time | relevance | path

Searched refs:doms (Results 1 – 25 of 534) sorted by relevance

12345678910>>...22

/dports/devel/libvirt/libvirt-7.10.0/src/conf/
H A Dvirdomainobjlist.c70 virDomainObjList *doms; in virDomainObjListNew() local
80 return doms; in virDomainObjListNew()
88 virHashFree(doms->objs); in virDomainObjListDispose()
116 virObjectRWLockRead(doms); in virDomainObjListFindByID()
119 virObjectRWUnlock(doms); in virDomainObjListFindByID()
161 virObjectRWLockRead(doms); in virDomainObjListFindByUUID()
163 virObjectRWUnlock(doms); in virDomainObjListFindByUUID()
203 virObjectRWUnlock(doms); in virDomainObjListFindByName()
356 virObjectRWUnlock(doms); in virDomainObjListAdd()
404 virObjectRWUnlock(doms); in virDomainObjListRemove()
[all …]
H A Dvirdomainobjlist.h42 virDomainObj *virDomainObjListAdd(virDomainObjList *doms,
52 int virDomainObjListRename(virDomainObjList *doms,
59 void virDomainObjListRemove(virDomainObjList *doms,
61 void virDomainObjListRemoveLocked(virDomainObjList *doms,
64 int virDomainObjListLoadAllConfigs(virDomainObjList *doms,
72 int virDomainObjListNumOfDomains(virDomainObjList *doms,
77 int virDomainObjListGetActiveIDs(virDomainObjList *doms,
91 int virDomainObjListForEach(virDomainObjList *doms,
135 int virDomainObjListCollect(virDomainObjList *doms,
141 int virDomainObjListExport(virDomainObjList *doms,
[all …]
/dports/math/blis/blis-0.8.1/frame/3/gemm/
H A Dbli_gemm_md.c50 mddm_t doms; in bli_gemm_md() local
159 mddm_t doms; in bli_gemm_md_ccr() local
244 return doms; in bli_gemm_md_ccr()
260 mddm_t doms; in bli_gemm_md_crc() local
345 return doms; in bli_gemm_md_crc()
361 mddm_t doms; in bli_gemm_md_rcc() local
434 return doms; in bli_gemm_md_rcc()
450 mddm_t doms; in bli_gemm_md_crr() local
491 return doms; in bli_gemm_md_crr()
507 mddm_t doms; in bli_gemm_md_rcr() local
[all …]
/dports/lang/gauche/Gauche-0.9.10/lib/util/
H A Ddominator.scm83 (define (update doms nid changed?)
90 (intersect doms m new-idom)
93 (if (eqv? (vector-ref doms nid) new-idom)
95 (begin (vector-set! doms nid new-idom) #t)))))
97 (define (iterate! doms max-nid)
98 (when (fold (^[nid changed?] (update doms nid changed?))
100 (iterate! doms max-nid)))
102 (define (intersect doms b1 b2)
110 [doms (make-vector nnodes #f)])
111 (vector-set! doms (- nnodes 1) (- nnodes 1))
[all …]
/dports/lang/racket/racket-8.3/share/pkgs/compatibility-lib/mzlib/private/
H A Dcontract-arrow.rkt31 (define (build--> name doms doms-rest rngs kwds quoted-kwds rng-any? func)
32 (let ([doms/c (map (λ (dom) (coerce-contract name dom)) doms)]
35 [doms-rest/c (and doms-rest (coerce-contract name doms-rest))])
112 [doms-rest
116 doms-rest
155 (define-for-syntax (split-doms stx name raw-doms)
156 (let loop ([raw-doms raw-doms]
166 doms
182 (loop #'rest (cons #'x doms) kwd-doms)])))
187 (with-syntax ([((doms ...) ((dom-kwd dom-kwd-ctc) ...)) (split-doms stx '-> #'(raw-doms ...))])
[all …]
/dports/net/mpich/mpich-3.4.3/modules/libfabric/prov/gni/test/
H A Ddom.c155 struct fid_domain *doms[num_doms]; in Test() local
163 ret = fi_domain(fabric, fi, &doms[i], NULL); in Test()
175 ret = fi_close(&doms[i]->fid); in Test()
185 struct fid_domain *doms[num_doms]; in Test() local
196 ret = fi_domain(fabric, fi, &doms[i], NULL); in Test()
246 ret = fi_close(&doms[i]->fid); in Test()
255 struct fid_domain *doms[num_doms]; in Test() local
268 ret = fi_domain(fabric, fi, &doms[i], NULL); in Test()
274 ret = fi_mr_reg(doms[i], in Test()
291 ret = gni_domain_ops->flush_cache(&doms[i]->fid); in Test()
[all …]
/dports/sysutils/webmin/webmin-1.981/sendmail/
H A Dlist_domains.cgi28 @doms = &list_domains($dfile);
31 if (@doms) {
34 @doms = sort { $a->{'from'} cmp $b->{'from'} } @doms;
43 $mid = int((@doms+1)/2);
45 &doms_table(@doms[0..$mid-1]);
47 if ($mid < @doms) { &doms_table(@doms[$mid..$#doms]); }
51 &doms_table(@doms);
/dports/lang/racket/racket-8.3/share/pkgs/typed-racket-lib/typed-racket/static-contracts/combinators/
H A Dexist.rkt22 (match-define (exist-combinator (list names doms rngs)) v)
23 (exist-combinator (list names (f doms 'invariant) (f rngs 'invariant))))
25 (match-define (exist-combinator (list _ doms rngs)) v)
26 (f doms 'invariant)
31 [(exist-combinator (list names doms rngs))
33 (let ([a (with-syntax ([doms-stx (f doms)]
36 #'(->i ([n doms-stx])
44 (define (exist/sc names doms rngs)
45 (exist-combinator (list names doms rngs)))
49 [(_ names doms rngs rngs-deps)
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/cuelang.org/go/tools/trim/
H A Dtrim.go204 doms = &adt.Vertex{}
206 doms.Conjuncts = append(doms.Conjuncts, d.Conjuncts...)
214 doms.AddConjunct(c)
221 doms.AddConjunct(c)
229 doms.Finalize(t.ctx)
231 switch x := doms.Value().(type) {
241 if doms = doms.Default(); doms.IsErr() {
246 return doms, hasSubs, ambiguous, strict || ambiguous
259 doms, hasSubs, ambiguous, pickedDefault := t.addDominators(doms, v, hasDisjunction)
272 d := doms.Lookup(a.Label)
[all …]
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/tests/unit/
H A Dunit_Domain.cpp80 std::vector<const GeomDomain*> doms(2); in unit_Domain() local
81 doms[0]=&Gamma;doms[1]=&Sigma; in unit_Domain()
82 const GeomDomain* du1=geomUnionOf(doms, &Omega); in unit_Domain()
85 doms[0]=&Gamma;doms[1]=&Omega; in unit_Domain()
86 const GeomDomain* du2=geomUnionOf(doms, &Omega); in unit_Domain()
89 doms[0]=&OmgUGam;doms[1]=&OmgUSig; in unit_Domain()
90 const GeomDomain* du3=geomUnionOf(doms, &Omega); in unit_Domain()
94 doms[0]=&Gamma;doms[1]=&Sigma; in unit_Domain()
95 const GeomDomain& md1=merge(doms, "Tau"); in unit_Domain()
100 const GeomDomain& md2=merge(doms, "Tau"); in unit_Domain()
/dports/net/google-cloud-sdk-app-engine-go/platform/google_appengine/goroot-1.9/src/cmd/compile/internal/ssa/
H A Ddom_test.go189 for n, d := range doms {
232 doms := map[string]string{}
255 doms := map[string]string{
284 doms := map[string]string{
308 doms := map[string]string{
337 doms := map[string]string{
366 doms := map[string]string{
398 doms := map[string]string{
451 doms := make(map[string]string)
457 return doms
[all …]
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/cmd/compile/internal/ssa/
H A Ddom_test.go189 for n, d := range doms {
232 doms := map[string]string{}
255 doms := map[string]string{
284 doms := map[string]string{
308 doms := map[string]string{
337 doms := map[string]string{
366 doms := map[string]string{
398 doms := map[string]string{
451 doms := make(map[string]string)
457 return doms
[all …]
/dports/lang/v8/v8-9.6.180.12/tools/clang/scripts/
H A Danalyze_includes.py280 doms = compute_doms(root, includes)
282 self.assertEqual(doms[1], set([5, 1]))
283 self.assertEqual(doms[2], set([5, 2]))
284 self.assertEqual(doms[3], set([5, 3]))
285 self.assertEqual(doms[4], set([5, 4]))
286 self.assertEqual(doms[5], set([5]))
306 doms = compute_doms(root, includes)
321 self.assertEqual(doms['r'], set(['r']))
381 doms = compute_doms(r, augmented_includes)
382 for node in doms:
[all …]
/dports/www/firefox-esr/firefox-91.8.0/js/public/
H A DUbiNodeDominatorTree.h207 auto length = doms.length(); in Create()
240 indices[doms[i]]++; in Create()
253 auto idxOfDom = doms[i]; in Create()
292 JS::ubi::Vector<uint32_t> doms; variable
307 doms(std::move(doms)), in DominatorTree()
315 finger1 = doms[finger1]; in intersect()
317 finger2 = doms[finger2]; in intersect()
419 doms[length - 1] = length - 1; in initializeDominators()
421 doms[i] = UNDEFINED; in initializeDominators()
482 doms(std::move(rhs.doms)), in DominatorTree()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/js/public/
H A DUbiNodeDominatorTree.h207 auto length = doms.length(); in Create()
240 indices[doms[i]]++; in Create()
253 auto idxOfDom = doms[i]; in Create()
292 JS::ubi::Vector<uint32_t> doms; variable
307 doms(std::move(doms)), in DominatorTree()
315 finger1 = doms[finger1]; in intersect()
317 finger2 = doms[finger2]; in intersect()
419 doms[length - 1] = length - 1; in initializeDominators()
421 doms[i] = UNDEFINED; in initializeDominators()
482 doms(std::move(rhs.doms)), in DominatorTree()
[all …]
/dports/www/firefox/firefox-99.0/js/public/
H A DUbiNodeDominatorTree.h207 auto length = doms.length(); in Create()
240 indices[doms[i]]++; in Create()
253 auto idxOfDom = doms[i]; in Create()
292 JS::ubi::Vector<uint32_t> doms; variable
307 doms(std::move(doms)), in DominatorTree()
315 finger1 = doms[finger1]; in intersect()
317 finger2 = doms[finger2]; in intersect()
419 doms[length - 1] = length - 1; in initializeDominators()
421 doms[i] = UNDEFINED; in initializeDominators()
482 doms(std::move(rhs.doms)), in DominatorTree()
[all …]
/dports/www/firefox-legacy/firefox-52.8.0esr/js/public/
H A DUbiNodeDominatorTree.h214 auto length = doms.length(); in JS_PUBLIC_API()
246 indices[doms[i]]++; in JS_PUBLIC_API()
258 auto idxOfDom = doms[i]; in JS_PUBLIC_API()
295 JS::ubi::Vector<uint32_t> doms; in JS_PUBLIC_API() local
309 , doms(mozilla::Move(doms)) in JS_PUBLIC_API()
415 MOZ_ASSERT(doms.length() == 0); in JS_PUBLIC_API()
418 doms[length - 1] = length - 1; in JS_PUBLIC_API()
420 doms[i] = UNDEFINED; in JS_PUBLIC_API()
479 , doms(mozilla::Move(rhs.doms)) in JS_PUBLIC_API()
541 JS::ubi::Vector<uint32_t> doms; in JS_PUBLIC_API() local
[all …]
/dports/lang/spidermonkey60/firefox-60.9.0/js/public/
H A DUbiNodeDominatorTree.h206 auto length = doms.length(); in Create()
249 auto idxOfDom = doms[i]; in Create()
288 JS::ubi::Vector<uint32_t> doms; variable
303 doms(mozilla::Move(doms)), in DominatorTree()
311 finger1 = doms[finger1]; in intersect()
313 finger2 = doms[finger2]; in intersect()
402 MOZ_ASSERT(doms.length() == 0); in initializeDominators()
404 doms[length - 1] = length - 1; in initializeDominators()
465 doms(mozilla::Move(rhs.doms)), in DominatorTree()
529 JS::ubi::Vector<uint32_t> doms; in Create() local
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/js/public/
H A DUbiNodeDominatorTree.h207 auto length = doms.length(); in Create()
240 indices[doms[i]]++; in Create()
253 auto idxOfDom = doms[i]; in Create()
292 JS::ubi::Vector<uint32_t> doms; variable
307 doms(std::move(doms)), in DominatorTree()
315 finger1 = doms[finger1]; in intersect()
317 finger2 = doms[finger2]; in intersect()
419 doms[length - 1] = length - 1; in initializeDominators()
421 doms[i] = UNDEFINED; in initializeDominators()
482 doms(std::move(rhs.doms)), in DominatorTree()
[all …]
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/mozjs-45/extract/js/public/
H A DUbiNodeDominatorTree.h215 auto length = doms.length(); in JS_PUBLIC_API()
247 indices[doms[i]]++; in JS_PUBLIC_API()
259 auto idxOfDom = doms[i]; in JS_PUBLIC_API()
296 mozilla::Vector<uint32_t> doms; in JS_PUBLIC_API() local
310 , doms(mozilla::Move(doms)) in JS_PUBLIC_API()
413 MOZ_ASSERT(doms.length() == 0); in JS_PUBLIC_API()
416 doms[length - 1] = length - 1; in JS_PUBLIC_API()
418 doms[i] = UNDEFINED; in JS_PUBLIC_API()
477 , doms(mozilla::Move(rhs.doms)) in JS_PUBLIC_API()
539 mozilla::Vector<uint32_t> doms; in JS_PUBLIC_API() local
[all …]
/dports/sysutils/webmin/webmin-1.981/webmin/
H A Dletsencrypt.cgi22 my @doms = split(/\s+/, $in{'dom'});
23 foreach my $dom (@doms) {
52 if ($in{'webroot_mode'} == 0 && $sn eq $doms[0]) {
68 $webroot || &error(&text('letsencrypt_evhost', $doms[0]));
73 &save_renewal_only(\@doms, $webroot, $mode);
82 "<tt>".&html_escape(join(", ", @doms))."</tt>",
84 …my ($ok, $cert, $key, $chain) = &request_letsencrypt_cert(\@doms, $webroot, undef, $size, $mode, $…
123 &save_renewal_only(\@doms, $webroot, $mode);
148 my ($doms, $webroot, $mode) = @_;
149 $config{'letsencrypt_doms'} = join(" ", @$doms);
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/geometry/
H A DGeomDomain.cpp61 doms[1] = &dom2; in GeomDomain()
372 if(doms.size()==0) in geomUnionOf()
377 if(doms.size()==1) return doms[0]; in geomUnionOf()
382 for(itd=doms.begin(); itd!=doms.end(); itd++) in geomUnionOf()
527 doms[0]=&d1; doms[1]=&d2; in merge()
538 doms[0]=&d1; doms[1]=&d2; doms[2]=&d3; in merge()
550 doms[0]=&d1; doms[1]=&d2; doms[2]=&d3; doms[3]=&d4; in merge()
564 doms[0]=&d1; doms[1]=&d2; doms[2]=&d3; doms[3]=&d4; doms[4]=&d5; in merge()
578 doms[0]=&d1; doms[1]=&d2; doms[2]=&d3; doms[3]=&d4; doms[4]=&d5; doms[5]=&d6; in merge()
814 if(doms.size() == 1) {trace_p->pop(); return doms[0];} in largestDomain()
[all …]
/dports/science/ascent/ascent-0.7.1-66-gbcf2742a/src/ascent/runtimes/
H A Dascent_transmogrifier.cpp31 bool Transmogrifier::is_high_order(const conduit::Node &doms) in is_high_order() argument
34 const int num_domains = doms.number_of_children(); in is_high_order()
37 const conduit::Node &dom = doms.child(i); in is_high_order()
74 bool Transmogrifier::is_poly(const conduit::Node &doms) in is_poly() argument
76 const int num_domains = doms.number_of_children(); in is_poly()
80 const conduit::Node &dom = doms.child(i); in is_poly()
103 void Transmogrifier::to_poly(conduit::Node &doms, conduit::Node &to_vtkh) in to_poly() argument
105 const int num_domains = doms.number_of_children(); in to_poly()
109 const conduit::Node &dom = doms.child(i); in to_poly()
/dports/lang/racket/racket-8.3/collects/racket/contract/private/
H A Darr-util.rkt4 (provide split-doms
61 (define (split-doms stx name raw-doms)
62 (let loop ([raw-doms raw-doms]
63 [doms '()]
64 [kwd-doms '()])
65 (syntax-case raw-doms ()
66 [() (list (reverse doms)
67 (sort-keywords stx kwd-doms))]
72 doms
73 (cons #'(kwd arg) kwd-doms))]
[all …]
/dports/lang/racket-minimal/racket-8.3/collects/racket/contract/private/
H A Darr-util.rkt4 (provide split-doms
61 (define (split-doms stx name raw-doms)
62 (let loop ([raw-doms raw-doms]
63 [doms '()]
64 [kwd-doms '()])
65 (syntax-case raw-doms ()
66 [() (list (reverse doms)
67 (sort-keywords stx kwd-doms))]
72 doms
73 (cons #'(kwd arg) kwd-doms))]
[all …]

12345678910>>...22