| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_leb128.h | 17 template <typename T, typename It>
18 It EncodeSLEB128(T value, It begin, It end) {
35 template <typename T, typename It>
36 It DecodeSLEB128(It begin, It end, T* v) {
56 template <typename T, typename It>
57 It EncodeULEB128(T value, It begin, It end)
[all...] |
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| gdb_binary_search.h | 7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
12 This program is distributed in the hope that it will be useful,
29 This differs from std::binary_search in that it returns an iterator for
35 It should return -1, 0 or 1 if a is less than, equal to, or greater than
41 template<typename It, typename T, typename Comp>
42 It binary_search (It first, It last, T el, Comp comp)
44 auto lt = [&] (const typename std::iterator_traits<It>::value_type &a
[all...] |
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| gdb_binary_search.h | 7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
12 This program is distributed in the hope that it will be useful,
29 This differs from std::binary_search in that it returns an iterator for
35 It should return -1, 0 or 1 if a is less than, equal to, or greater than
41 template<typename It, typename T, typename Comp>
42 It binary_search (It first, It last, T el, Comp comp)
44 auto lt = [&] (const typename std::iterator_traits<It>::value_type &a
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| DeclLookups.h | 29 StoredDeclsMap::iterator It, End;
39 all_lookups_iterator(StoredDeclsMap::iterator It,
41 : It(It), End(End) {}
43 DeclarationName getLookupName() const { return It->first; }
45 reference operator*() const { return It->second.getLookupResult(); }
46 pointer operator->() const { return It->second.getLookupResult(); }
51 // should not expect to get them (or worse, rely on it).
53 ++It;
54 } while (It != End &
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| Record.cpp | 31 auto It = FieldMap.find(FD);
32 assert(It != FieldMap.end() && "Missing field");
33 return It->second;
37 auto It = BaseMap.find(FD);
38 assert(It != BaseMap.end() && "Missing base");
39 return It->second;
43 auto It = VirtualBaseMap.find(FD);
44 assert(It != VirtualBaseMap.end() && "Missing virtual base");
45 return It->second;
|
| Function.cpp | 29 auto It = Params.find(Offset);
30 assert(It != Params.end() && "Invalid parameter offset");
31 return It->second;
37 auto It = std::lower_bound(SrcMap.begin(), SrcMap.end(), Elem{Offset, {}},
39 if (It == SrcMap.end() || It->first != Offset)
41 return It->second;
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/ |
| Range.cpp | 24 auto It = llvm::upper_bound(Ranges, Range);
25 auto It2 = It;
28 if (It != It2) {
30 It = Ranges.erase(It, It2);
32 if (It != Ranges.begin() && Range.Start < It[-1].End)
33 It[-1].End = std::max(It[-1].End, Range.End);
35 Ranges.insert(It, Range)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| CoalescingBitVector.h | 86 for (auto It = Intervals.begin(), End = Intervals.end(); It != End; ++It)
87 Bits += 1 + It.stop() - It.start();
107 for (auto It = Other.Intervals.begin(), End = Other.Intervals.end();
108 It != End; ++It)
109 insert(It.start(), It.stop())
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerDataFlowTrace.h | 44 auto It = Traces.find(InputSha1);
45 if (It != Traces.end())
46 return &It->second;
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| xray-registry.cpp | 33 auto It = Commands->find(SC);
34 assert(It != Commands->end() &&
36 return It->second;
|
| func-id-helper.cpp | 26 auto It = FunctionAddresses.find(FuncId);
27 if (It == FunctionAddresses.end()) {
33 ModuleAddress.Address = It->second;
40 F << "@(" << std::hex << It->second << ")";
45 F << "@(" << std::hex << It->second << ")";
54 auto It = FunctionAddresses.find(FuncId);
55 if (It == FunctionAddresses.end())
60 ModuleAddress.Address = It->second;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
| constructors_destructor_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
44 template<typename It>
47 copy_from_range(It first_it, It last_it)
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/ |
| constructors_destructor_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
44 template<typename It>
47 copy_from_range(It first_it, It last_it)
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
| constructors_destructor_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
44 template<typename It>
47 copy_from_range(It first_it, It last_it)
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/ |
| constructors_destructor_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
44 template<typename It>
47 copy_from_range(It first_it, It last_it)
|
| /src/external/bsd/unbound/dist/doc/ |
| README.ipset.md | 7 I did some research for this. Unfortunately, Unbound, My favorite dns service doesn't support ipset yet. So, I decided to implement it by my self and contribute the patch. It's good for me and the community.
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
| constructor_destructor_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
60 template<typename It>
63 copy_from_range(It first_it, It last_it)
75 template<typename It>
77 PB_DS_LU_NAME(It first_it, It last_it) : m_p_l(0
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
| constructor_destructor_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
60 template<typename It>
63 copy_from_range(It first_it, It last_it)
75 template<typename It>
77 PB_DS_LU_NAME(It first_it, It last_it) : m_p_l(0
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/ |
| CodeRegion.cpp | 43 auto It = ActiveRegions.find(Description);
44 if (It != ActiveRegions.end()) {
45 const CodeRegion &R = *Regions[It->second];
75 auto It = ActiveRegions.begin();
76 Regions[It->second]->setEndLocation(Loc);
77 ActiveRegions.erase(It);
89 auto It = ActiveRegions.find(Description);
90 if (It != ActiveRegions.end()) {
91 Regions[It->second]->setEndLocation(Loc);
92 ActiveRegions.erase(It);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| R600OptimizeVectorRegisters.cpp | 153 for (DenseMap<Register, unsigned>::iterator It = ToMerge->RegToChan.begin(),
154 E = ToMerge->RegToChan.end(); It != E; ++It) {
156 Untouched->RegToChan.find((*It).first);
159 ((*It).second, (*PosInUntouched).second));
165 ((*It).second, Untouched->UndefReg[CurrentUndexIdx++]));
193 for (DenseMap<Register, unsigned>::iterator It = RSI->RegToChan.begin(),
194 E = RSI->RegToChan.end(); It != E; ++It) {
196 unsigned SubReg = (*It).first
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| MacroExpansionContext.cpp | 60 MacroExpansionContext::ExpansionRangeMap::iterator It;
62 std::tie(It, Inserted) =
66 It->getFirst().print(llvm::dbgs(), SM); llvm::dbgs() << " to ";
67 It->getSecond().print(llvm::dbgs(), SM);
70 if (SM.isBeforeInTranslationUnit(It->getSecond(), ExpansionEnd)) {
71 It->getSecond() = ExpansionEnd;
73 llvm::dbgs() << "remaps "; It->getFirst().print(llvm::dbgs(), SM);
74 llvm::dbgs() << " to "; It->getSecond().print(llvm::dbgs(), SM);
109 const auto It = ExpandedTokens.find_as(MacroExpansionLoc);
110 if (It == ExpandedTokens.end()
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/DirectoryWatcher/ |
| DirectoryScanner.cpp | 30 for (auto It = fs::directory_iterator(Path, EC),
32 !EC && It != End; It.increment(EC)) {
33 auto status = getFileStatus(It->path());
36 Result.emplace_back(sys::path::filename(It->path()));
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/ |
| assoc_container.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
252 template<typename It>
253 cc_hash_table(It first, It last)
259 template<typename It>
260 cc_hash_table(It first, It last, const hash_fn& h
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/ |
| constructors_destructor_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
44 template<typename It>
47 copy_from_range(It first_it, It last_it)
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/ |
| constructors_destructor_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
44 template<typename It>
47 copy_from_range(It first_it, It last_it)
|
