/freebsd-11-stable/usr.bin/dtc/ |
H A D | checking.hh | 167 return p->begin() == p->end(); 182 return (p->begin() + 1 == p->end()) && p->begin()->is_string(); 197 for (property::value_iterator i=p->begin(),e=p->end() ; i!=e ; 205 return p->begin() != p->end(); 220 return (p->begin() + 1 == p->end()) && 221 (tree->referenced_node(*p->begin()) != 0);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | SparseSet.h | 174 const_iterator begin() const { return Dense.begin(); } function in class:llvm::SparseSet 176 iterator begin() { return Dense.begin(); } function in class:llvm::SparseSet 211 return begin() + i; 277 /// for (SparseSet::iterator I = Set.begin(); I != Set.end();) 286 assert(unsigned(I - begin()) < size() && "Invalid iterator"); 291 Sparse[BackIdx] = I - begin();
|
H A D | simple_ilist.h | 45 /// \li \c L.erase(L.begin()); 117 iterator begin() { return ++iterator(Sentinel); } function in class:llvm::simple_ilist 118 const_iterator begin() const { return ++const_iterator(Sentinel); } function in class:llvm::simple_ilist 135 return std::distance(begin(), end()); 138 reference front() { return *begin(); } 139 const_reference front() const { return *begin(); } 144 void push_front(reference Node) { insert(begin(), Node); } 150 void pop_front() { erase(begin()); } 234 eraseAndDispose(begin(), end(), dispose); 239 splice(I, L2, L2.begin(), L [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/Syntax/ |
H A D | ComputeReplacements.cpp | 70 assert(Buffer.expandedTokens().begin() <= Expanded.begin()); 76 SM, SM.getExpansionLoc(Expanded.begin()->location()), /*Length=*/0); 101 const syntax::Token *NextOriginal = Buffer.expandedTokens().begin(); 109 assert(NextOriginal <= Tokens.begin()); 111 if (NextOriginal != Tokens.begin()) { 113 emitReplacement(llvm::makeArrayRef(NextOriginal, Tokens.begin()));
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | ASTVector.h | 97 iterator begin() { return Begin; } function in class:clang::ASTVector 98 const_iterator begin() const { return Begin; } function in class:clang::ASTVector 105 reverse_iterator rend() { return reverse_iterator(begin()); } 106 const_reverse_iterator rend() const { return const_reverse_iterator(begin());} 121 return begin()[0]; 124 return begin()[0]; 234 size_t EltNo = I-this->begin(); 236 I = this->begin()+EltNo; 243 size_t InsertElt = I - this->begin(); 247 return this->begin() [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 95 ExplodedNode * const *begin() const; 239 pred_iterator pred_begin() { return Preds.begin(); } 241 pred_range preds() { return {Preds.begin(), Preds.end()}; } 249 const_pred_range preds() const { return {Preds.begin(), Preds.end()}; } 251 succ_iterator succ_begin() { return Succs.begin(); } 253 succ_range succs() { return {Succs.begin(), Succs.end()}; } 261 const_succ_range succs() const { return {Succs.begin(), Succs.end()}; } 400 node_iterator nodes_begin() { return Nodes.begin(); } 404 const_node_iterator nodes_begin() const { return Nodes.begin(); } 408 roots_iterator roots_begin() { return Roots.begin(); } 496 iterator begin() { return Impl.begin(); } function in class:clang::ento::ExplodedNodeSet 499 const_iterator begin() const { return Impl.begin(); } function in class:clang::ento::ExplodedNodeSet [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
H A D | GIMatchDag.h | 94 return raw_pointer_iterator<EdgesVec::iterator>(Edges.begin()); 100 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.begin()); 112 return make_range(MatchRoots.begin(), MatchRoots.end()); 115 return make_range(MatchRoots.begin(), MatchRoots.end()); 119 return raw_pointer_iterator<InstrNodesVec::iterator>(InstrNodes.begin()); 126 InstrNodes.begin()); 140 PredicateDependencies.begin()); 148 PredicateDependencies.begin()); 162 PredicateNodes.begin()); 170 PredicateNodes.begin()); [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Target/ |
H A D | PathMappingList.cpp | 75 for (pos = rhs.m_pairs.begin(); pos != end; ++pos) 90 insert_iter = m_pairs.begin() + index; 114 iterator iter = m_pairs.begin() + index; 273 const_iterator begin = m_pairs.begin(); local 276 for (pos = begin; pos != end; ++pos) { 286 iterator begin = m_pairs.begin(); local 289 for (pos = begin; pos != end; ++pos) { 309 const_iterator begin local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Option/ |
H A D | Arg.cpp | 78 it = ASL.begin(), ie = ASL.end(); it != ie; ++it) { 79 if (it != ASL.begin()) 93 Output.append(Values.begin(), Values.end()); 99 Output.append(Values.begin(), Values.end()); 117 Output.append(Values.begin() + 1, Values.end()); 122 Output.append(Values.begin(), Values.end());
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | GCMetadata.h | 133 /// begin/end - Iterators for safe points. 134 iterator begin() { return SafePoints.begin(); } function in class:llvm::GCFunctionInfo 139 roots_iterator roots_begin() { return Roots.begin(); } 168 FuncInfoVec::iterator funcinfo_begin() { return Functions.begin(); } 192 /// begin/end - Iterators for used strategies. 194 iterator begin() const { return GCStrategyList.begin(); } function in class:llvm::GCModuleInfo
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/ |
H A D | TypeList.cpp | 52 // for (pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) 70 for (pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) { 80 for (auto pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) { 88 for (auto pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) { 95 for (iterator pos = m_types.begin(), end = m_types.end(); pos != end; ++pos) { 125 for (pos = m_types.begin(); pos != end; ++pos) { 199 for (pos = m_types.begin(); pos != end; ++pos) {
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Serialization/ |
H A D | ContinuousRangeMap.h | 88 iterator begin() { return Rep.begin(); } function in class:clang::ContinuousRangeMap 90 const_iterator begin() const { return Rep.begin(); } function in class:clang::ContinuousRangeMap 97 if (I == Rep.begin()) 123 Self.Rep.begin(), Self.Rep.end(),
|
/freebsd-11-stable/sys/compat/cloudabi/ |
H A D | cloudabi_vdso.c | 44 cloudabi_vdso_init(struct sysentvec *sv, char *begin, char *end) argument 52 vdso_length = end - begin; 67 memcpy((void *)addr, begin + i * PAGE_SIZE,
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Breakpoint/ |
H A D | WatchpointList.cpp | 48 for (pos = m_watchpoints.begin(); pos != end; ++pos) 58 for (pos = m_watchpoints.begin(); pos != end; ++pos) { 76 for (pos = m_watchpoints.begin(); pos != end; ++pos) 100 return std::find_if(m_watchpoints.begin(), 107 return std::find_if(m_watchpoints.begin(), 142 wp_collection::const_iterator pos = m_watchpoints.begin(); 153 wp_collection::const_iterator pos = m_watchpoints.begin(); 163 for (pos = m_watchpoints.begin(); pos != end; ++pos) 191 for (pos = m_watchpoints.begin(); pos != end; ++pos) 215 for (pos = m_watchpoints.begin(); po [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 97 for (CFG::const_iterator I = cfg->begin(), 206 ChildrenTy Ret{Children.begin(), Children.end()}; 207 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end()); 296 ResultTy Ret(RChildren.begin(), RChildren.end()); 297 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end()); 311 ResultTy Ret(IChildren.begin(), IChildren.end()); 312 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end()); 326 ResultTy Ret(RChildren.begin(), RChildren.end()); 327 Ret.erase(std::remove(Ret.begin(), Ret.end(), nullptr), Ret.end()); 341 ResultTy Ret(IChildren.begin(), IChildre [all...] |
H A D | PostOrderCFGView.h | 87 iterator begin() { return Blocks.rbegin(); } function in class:clang::PostOrderCFGView 90 const_iterator begin() const { return Blocks.rbegin(); } function in class:clang::PostOrderCFGView 93 bool empty() const { return begin() == end(); }
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | CallGraphSCCPass.h | 96 Nodes.assign(NewNodes.begin(), NewNodes.end()); 108 iterator begin() const { return Nodes.begin(); } function in class:llvm::CallGraphSCC
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/lsan/ |
H A D | lsan_common_linux.cpp | 89 uptr begin = info->dlpi_addr + phdr->p_vaddr; local 90 uptr end = begin + phdr->p_memsz; 91 ScanGlobalRange(begin, end, frontier);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyOptimizeLiveIntervals.cpp | 96 for (auto MII = MF.begin()->begin(), MIE = MF.begin()->end(); MII != MIE;) {
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | cmp_fn_imps.hpp | 64 for (typename Other_Map_Type::const_iterator it = other.begin();
|
/freebsd-11-stable/lib/libiconv_modules/mapper_std/ |
H A D | citrus_mapper_std_file.h | 45 uint32_t begin; member in struct:_citrus_mapper_std_rowcol_info_x::__anon6821
|
H A D | citrus_mapper_std_local.h | 36 _citrus_index_t begin; member in struct:_citrus_mapper_std_linear_zone
|
/freebsd-11-stable/contrib/netbsd-tests/fs/ffs/ |
H A D | t_snapshot_log.c | 40 begin(void) function
|
H A D | t_snapshot_v2.c | 37 begin(void) function
|
H A D | t_snapshot.c | 37 begin(void) function
|