Home
last modified time | relevance | path

Searched refs:seq (Results 1 – 25 of 358) sorted by relevance

12345678910>>...15

/llvm-project/mlir/utils/tree-sitter-mlir/
H A Dgrammar.js20 toplevel : $ => seq($._toplevel, repeat($._toplevel)),
37 _decimal_literal : $ => token(seq(optional(/[-+]/), repeat1(/[0-9]/))),
38 _hexadecimal_literal : $ => token(seq('0x', repeat1(/[0-9a-fA-F]/))),
40 token(seq(optional(/[-+]/), repeat1(/[0-9]/), '.', repeat(/[0-9]/),
41 optional(seq(/[eE]/, optional(/[-+]/), repeat1(/[0-9]/))))),
42 string_literal : $ => token(seq('"', repeat(/[^\\"\n\f\v\r]+/), '"')),
46 seq('(', choice($.integer_literal, $.float_literal), ',',
49 seq(token(choice('dense', 'sparse')), '<',
51 seq($.nested_idx_list, repeat(seq(',',
[all...]
/llvm-project/clang/test/SemaOpenACC/
H A Dloop-construct-auto_seq_independent-clauses.c6 #pragma acc loop seq in uses()
11 // expected-error@+2{{OpenACC clause 'seq' on 'loop' construct conflicts with previous data dependence clause}} in uses()
13 #pragma acc loop auto seq in uses()
21 #pragma acc loop seq auto in uses()
25 #pragma acc loop seq independent in uses()
31 // expected-error@+2{{OpenACC clause 'seq' on 'loop' construct conflicts with previous data dependence clause}} in uses()
33 #pragma acc loop independent seq in uses()
577 // 'seq' cannot be combined with 'gang', 'worker' or 'vector' in uses()
578 // expected-error@+2{{OpenACC clause 'gang' may not appear on the same construct as a 'seq' clause on a 'loop' construct}} in uses()
580 #pragma acc loop seq gan in uses()
[all...]
/llvm-project/mlir/utils/tree-sitter-mlir/dialect/
H A Daffine.js5 seq('affine.apply',
7 seq($.attribute, $._dim_and_symbol_use_list)),
14 seq('affine.delinearlize_index',
25 seq(choice('affine.dma_start', 'affine.dma_wait'),
27 seq($.value_use, $._multi_dim_affine_expr_sq,
28 repeat(seq(',', $.value_use,
36 seq('affine.for', field('iv', $.value_use), '=',
38 seq(optional(token('max')), $._bound)),
41 seq(optional(token('min')), $._bound)),
43 optional(seq(token('step'), $.integer_literal))),
[all …]
H A Dscf.js7 seq('scf.condition',
12 seq('scf.execute_region',
17 seq('scf.if', field('condition', $.value_use),
21 optional(seq(token('else'), $.region)))),
28 seq('scf.index_switch', field('flag', $._value_use_and_type),
32 repeat(seq($.scf_case_label, $.region))),
37 seq('scf.for', field('iv', $.value_use), '=',
40 field('step', seq(token('step'), $.value_use)),
42 optional(seq(token('iter_args'),
48 seq('scf.forall', field('iv', $._value_use_list_parens),
[all …]
H A Dmemref.js7 seq('memref.assume_alignment',
19 seq(choice('memref.alloc', 'memref.alloca'),
27 seq('memref.cast', field('in', $.value_use),
34 seq('memref.copy', field('source', $.value_use), ',',
45 seq(choice('memref.collapse_shape', 'memref.expand_shape'),
53 seq('memref.dealloc', field('memref', $.value_use),
59 seq('memref.dim',
67 seq('memref.load',
68 field('memref', seq($.value_use, $._dense_idx_list)),
72 seq('memref.prefetch', field('source', $.value_use),
[all …]
H A Dvector.js12 seq(choice('vector.bitcast', 'vector.broadcast',
20 seq('vector.constant_mask',
27 seq('vector.create_mask',
39 seq(choice('vector.extract', 'vector.load',
48 seq('vector.fma', field('lhs', $.value_use), ',',
56 seq('vector.flat_transpose', field('matrix', $.value_use),
70 seq(choice('vector.insert', 'vector.scalable.insert',
81 seq('vector.insert_strided_slice',
91 seq('vector.matrix_multiply', field('lhs', $.value_use),
98 seq(choice('vector.print', 'vector.splat'),
[all …]
H A Dtensor.js7 seq('tensor.empty',
14 seq('tensor.cast', field('in', $.value_use),
20 seq('tensor.dim',
29 seq(choice('tensor.collapse_shape', 'tensor.expand_shape'),
37 seq('tensor.extract', field('tensor', $.value_use),
45 seq('tensor.insert', field('scalar', $.value_use),
59 seq('tensor.extract_slice', field('tensor', $.value_use),
84 seq(choice('tensor.insert_slice',
96 seq('tensor.from_elements',
106 seq('tensor.gather', field('source', $.value_use),
[all …]
H A Dlinalg.js5 seq(choice(
53 seq('linalg.generic', repeat1($._ins_outs_attributes),
59 seq('linalg.index', field('dimension', $.integer_literal),
63 seq(choice('linalg.map', 'linalg.reduce'),
69 seq('linalg.yield',
75 _ins : $ => seq(token('ins'), '(', $._value_use_type_list, ')'),
76 _outs : $ => seq(token('outs'), '(', $._value_use_type_list, ')'),
77 _attribute_entry_list : $ => seq($.bare_attribute_entry,
78 repeat(seq(',', $.bare_attribute_entry))),
79 bare_attribute_entry : $ => seq($.bare_id, '=', $.attribute_value)
H A Darith.js6 seq('arith.constant',
39 seq(choice('arith.addi', 'arith.subi', 'arith.divsi',
56 seq('arith.addui_extended', field('lhs', $.value_use), ',',
59 field('return', seq(':', $.type, ',', $.type))),
82 seq(choice('arith.addf', 'arith.divf', 'arith.maximumf',
94 seq(choice('arith.negf'), field('operand', $.value_use),
102 seq(choice('arith.cmpi', 'arith.cmpf'),
129 seq(choice('arith.extf', 'arith.extsi', 'arith.extui',
138 seq('arith.select', field('cond', $.value_use), ',',
H A Dcf.js6 seq('cf.assert', field('argument', $.value_use), ',',
12 seq('cf.br', field('successor', $.successor),
20 seq('cf.cond_br', field('condition', $.value_use), ',',
35 seq('cf.switch', field('flag', $._value_use_and_type), ',',
37 repeat(seq(',', $.cf_case_label, $.successor)), ']',
41 cf_case_label : $ => seq(choice($.integer_literal, token('default')), ':')
H A Dbufferization.js5 seq('bufferization.alloc_tensor',
7 field('copy', optional(seq(token('copy'), '(',
10 optional(seq(token('size_hint'), '=',
17 seq('bufferization.to_memref',
26 seq('bufferization.to_tensor',
H A Dmath.js71 seq(choice('math.absf', 'math.atan', 'math.cbrt',
88 seq(choice('math.absi', 'math.ctlz', 'math.cttz',
106 seq(choice('math.atan2', 'math.copysign', 'math.fpowi',
116 seq('math.ipowi', field('lhs', $.value_use), ',',
124 seq('math.fma', field('a', $.value_use), ',',
H A Dfunc.js11 seq(choice('func.call', 'call', 'func.call_indirect',
20 seq(choice('func.constant', 'constant'),
25 seq('func.func', $._op_func),
27 seq(choice('func.return', 'return'),
/llvm-project/llvm/test/MC/Mips/
H A Dmacro-seq.s4 seq $2, $11, $0
6 seq $2, $0, $11
8 seq $2, $0, $0
10 seq $2, $11, $12
13 seq $2, $11, 45
15 seq $2, $12, 0x76666
20 seq $2, $3
23 seq $2, 0x8888
26 seq $2, $3, -1546
30 seq
5 seq $2, $11, $0 global() label
7 seq $2, $0, $11 global() label
9 seq $2, $0, $0 global() label
11 seq $2, $11, $12 global() label
14 seq $2, $11, 45 global() label
16 seq $2, $12, 0x76666 global() label
21 seq $2, $3 global() label
24 seq $2, 0x8888 global() label
27 seq $2, $3, -1546 global() label
31 seq $2, -7546 global() label
35 seq $4, $5, -66666 global() label
40 seq $4, $5, -2147483648 global() label
44 seq $4, -2147483648 global() label
48 seq $4, $5, 0 global() label
50 seq $4, $zero, 1 global() label
[all...]
/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.min.max/
H A Dminmax_element.pass.cpp72 TestUtils::Sequence<T> seq; member
79 sequence_wrapper(std::size_t n) : seq(n), min_value(-(1 << bits)), max_value(1 << bits) {} in sequence_wrapper()
84 seq.fill([](std::size_t i) -> T { return T(TestUtils::HashBits(i, bits)); }); in pattern_fill()
91 if (seq.size() == 0) in set_desired_value()
93 seq[at] = value; in set_desired_value()
96 for (std::size_t i = at + 1; i < seq.size(); i += 1 + TestUtils::HashBits(i, 5)) in set_desired_value()
97 seq[i] = value; in set_desired_value()
122 TestUtils::invoke_on_all_policies(check_minelement(), wseq.seq.cbegin(), wseq.seq.cend()); in test_by_type()
123 TestUtils::invoke_on_all_policies(check_minelement(), wseq.seq.begin(), wseq.seq.end()); in test_by_type()
126 TestUtils::invoke_on_all_policies(check_maxelement(), wseq.seq.cbegin(), wseq.seq.cend()); in test_by_type()
[all …]
/llvm-project/llvm/unittests/Support/
H A DYAMLIOTest.cpp130 FooBarSequence seq; in TEST() local
132 yin >> seq; in TEST()
135 EXPECT_EQ(seq.size(), 2UL); in TEST()
136 FooBar& map1 = seq[0]; in TEST()
137 FooBar& map2 = seq[1]; in TEST()
234 FooBarSequence seq; in TEST() local
235 seq.push_back(entry1); in TEST()
236 seq.push_back(entry2); in TEST()
240 yout << seq; in TEST()
1501 SecondsSequence seq; in TEST()
1502 SecondsSequence seq; TEST() local
1519 SecondsSequence seq; TEST() local
1624 KindAndFlagsSequence seq; TEST() local
1642 KindAndFlagsSequence seq; TEST() local
1895 FlowFooBarSequence seq; global() member
2006 std::vector<uint8_t> seq; TEST() local
2024 std::vector<uint16_t> seq; TEST() local
2042 std::vector<uint32_t> seq; TEST() local
2060 std::vector<uint64_t> seq; TEST() local
2078 std::vector<int8_t> seq; TEST() local
2096 std::vector<int8_t> seq; TEST() local
2115 std::vector<int16_t> seq; TEST() local
2134 std::vector<int16_t> seq; TEST() local
2153 std::vector<int32_t> seq; TEST() local
2171 std::vector<int32_t> seq; TEST() local
2190 std::vector<int64_t> seq; TEST() local
2208 std::vector<int64_t> seq; TEST() local
2226 std::vector<float> seq; TEST() local
2244 std::vector<double> seq; TEST() local
2262 std::vector<Hex8> seq; TEST() local
2292 std::vector<Hex16> seq; TEST() local
2321 std::vector<Hex32> seq; TEST() local
2351 std::vector<Hex64> seq; TEST() local
2475 std::vector<uint8_t> seq; TEST() local
2780 FooBarSequence seq; TEST() local
3161 auto seq = std::make_unique<Seq>(); TEST() local
3176 auto seq = llvm::dyn_cast<Seq>(node.get()); TEST() local
[all...]
/llvm-project/libcxx/test/std/numerics/rand/rand.util/rand.util.seedseq/
H A Dgenerate.mandates.verify.cpp31 std::seed_seq seq; in f()
36 seq.generate(p, p); // expected-error-re@*:* {{static assertion failed{{.+}}: [rand.util.seedseq]/7 requires{{.+}}}} in f()
43 seq.generate(p, p); // expected-error-re@*:* {{static assertion failed{{.+}}: [rand.util.seedseq]/7 requires{{.+}}}} in f()
50 seq.generate(p, p); // expected-error-re@*:* {{static assertion failed{{.+}}: [rand.util.seedseq]/7 requires{{.+}}}} in f()
57 seq.generate(p, p); // no diagnostic in f()
30 std::seed_seq seq; f() local
/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_deadlock_detector2.cpp33 u32 seq; member
35 explicit Id(u32 id = 0, u32 seq = 0) in Id()
37 , seq(seq) { in Id()
43 u32 seq; member
48 explicit Link(u32 id = 0, u32 seq = 0, u32 tid = 0, u32 s0 = 0, u32 s1 = 0) in Link()
50 , seq(seq) in Link()
78 u32 seq; member
231 if (link->seq != mtx->seq) { in MutexBeforeLock()
232 link->seq = mtx->seq; in MutexBeforeLock()
247 link->seq = mtx->seq; in MutexBeforeLock()
[all …]
H A Dsanitizer_mutex.cpp142 u64 seq; member
159 if (locked[i].seq == 0) in Lock()
161 CHECK_NE(locked[i].seq, max_seq); in Lock()
162 if (max_seq < locked[i].seq) { in Lock()
163 max_seq = locked[i].seq; in Lock()
169 CHECK_EQ(locked[type].seq, max_seq); in Lock()
180 locked[type].seq = ++sequence; in Lock()
189 CHECK(locked[type].seq); in Unlock()
193 locked[type].seq = 0; in Unlock()
/llvm-project/flang/test/Semantics/
H A Dseparate-mp06.f9012 type :: seq
16 type(seq), intent(in) :: x
47 type :: seq type
51 type(seq), intent(in) :: x
78 type :: seq type
94 call s2(seq(1)) ! ok
/llvm-project/clang-tools-extra/pseudo/lib/cxx/
H A Dcxx.bnf
/llvm-project/clang/test/ParserOpenACC/
H A Dparse-clauses.c34 #pragma acc loop seq independent auto in func()
41 #pragma acc loop seq, independent auto in func()
48 #pragma acc loop seq independent, auto in func()
54 #pragma acc kernels loop seq independent auto in func()
60 #pragma acc serial loop seq, independent auto in func()
66 #pragma acc parallel loop seq independent, auto in func()
71 #pragma acc loop , seq in func()
75 #pragma acc loop seq, in func()
262 #pragma acc serial loop self, seq in IfClause()
271 // expected-error@+3{{use of undeclared identifier 'seq'}} in IfClause()
[all...]
/llvm-project/compiler-rt/lib/tsan/rtl/
H A Dtsan_mutexset.cpp29 descs_[i].seq = seq_++; in AddAddr()
37 if (descs_[i].seq < descs_[min].seq) in AddAddr()
47 descs_[size_].seq = seq_++; in AddAddr()
/llvm-project/clang-tools-extra/pseudo/lib/grammar/
H A DGrammar.cpp
/llvm-project/lldb/source/Symbol/
H A DLineTable.cpp30 LineSequenceImpl *seq = static_cast<LineSequenceImpl *>(sequence.get()); in LineTable() local
31 m_entries.insert(m_entries.end(), seq->m_entries.begin(), in LineTable()
32 seq->m_entries.end()); in LineTable()
75 LineSequenceImpl *seq = reinterpret_cast<LineSequenceImpl *>(sequence); in AppendLineEntryToSequence() local
79 entry_collection &entries = seq->m_entries; in AppendLineEntryToSequence()
107 LineSequenceImpl *seq = reinterpret_cast<LineSequenceImpl *>(sequence); in InsertSequence() local
108 if (seq->m_entries.empty()) in InsertSequence()
110 Entry &entry = seq->m_entries.front(); in InsertSequence()
116 m_entries.insert(m_entries.end(), seq->m_entries.begin(), in InsertSequence()
117 seq in InsertSequence()
[all...]

12345678910>>...15