Searched refs:_First (Results 1 – 8 of 8) sorted by relevance
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| D | ASTTreeParser.stg | 48 _First[0] := nil;
54 _First, _Save_Last: array [0..63] of I<ASTLabelType>;
65 RetVal.Tree := _First[0] as I<ASTLabelType>;
80 _First[<treeLevel>] := nil;
88 if (_First[<enclosingTreeLevel>] = nil) then _First[<enclosingTreeLevel>] := <root.el.label>.Tree;
90 if (_First[<enclosingTreeLevel>] = nil) then _First[<enclosingTreeLevel>] := <root.el.label>;
143 if (_First[<treeLevel>] = nil) then _First[<treeLevel>] := <label>;
235 if (_First[<treeLevel>] = nil) then _First[<treeLevel>] := <label>.Tree;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopStrengthReduce/ |
| D | pr25541.ll | 10 %_First.addr.0.i = phi i32* [ null, %entry ], [ %incdec.ptr.i, %for.inc.i ]
19 %cmp.i = icmp eq i32* %_First.addr.0.i, null
30 %incdec.ptr.i = getelementptr inbounds i32, i32* %_First.addr.0.i, i64 1
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| D | pr25541.ll | 10 %_First.addr.0.i = phi i32* [ null, %entry ], [ %incdec.ptr.i, %for.inc.i ]
19 %cmp.i = icmp eq i32* %_First.addr.0.i, null
30 %incdec.ptr.i = getelementptr inbounds i32, i32* %_First.addr.0.i, i64 1
|
| /external/deqp-deps/glslang/glslang/Include/ |
| D | Common.h | 142 const char* _First = s.c_str();
145 _Val ^= (unsigned)_First[_Next];
|
| /external/clang/include/clang/Lex/ |
| D | PPCallbacks.h | 329 PPChainedCallbacks(std::unique_ptr<PPCallbacks> _First, in PPChainedCallbacks() argument
331 : First(std::move(_First)), Second(std::move(_Second)) {} in PPChainedCallbacks()
|
| /external/libcxx/include/ |
| D | __hash_table | 1084 template <class _First, class _Second>
1087 __can_extract_map_key<_First, key_type, __container_value_type>::value,
1089 >::type __emplace_unique(_First&& __f, _Second&& __s) {
1090 return __emplace_unique_key_args(__f, _VSTD::forward<_First>(__f),
1359 template <class _First, class ..._Rest>
1360 __node_holder __construct_node_hash(size_t __hash, _First&& __f, _Rest&&... __rest);
2534 template <class _First, class ..._Rest>
2537 size_t __hash, _First&& __f, _Rest&& ...__rest)
2539 static_assert(!__is_hash_value_type<_First, _Rest...>::value,
2544 _VSTD::forward<_First>(__f),
|
| D | __tree | 1167 template <class _First, class _Second>
1170 __can_extract_map_key<_First, key_type, __container_value_type>::value,
1172 >::type __emplace_unique(_First&& __f, _Second&& __s) {
1173 return __emplace_unique_key_args(__f, _VSTD::forward<_First>(__f),
1211 template <class _First, class _Second>
1214 __can_extract_map_key<_First, key_type, __container_value_type>::value,
1216 >::type __emplace_hint_unique(const_iterator __p, _First&& __f, _Second&& __s) {
1218 _VSTD::forward<_First>(__f),
|
| D | type_traits | 4794 template <class _Pair, class _Key, class _First, class _Second>
4795 struct __can_extract_key<_Pair, _Key, pair<_First, _Second>>
4796 : conditional<is_same<typename remove_const<_First>::type, _Key>::value,
|