Searched refs:end (Results 276 - 300 of 3150) sorted by relevance

<<11121314151617181920>>

/freebsd-10-stable/crypto/openssl/apps/
H A Docsp.c179 goto end;
235 goto end;
375 goto end;
385 goto end;
389 goto end;
391 goto end;
400 goto end;
402 goto end;
570 goto end;
580 goto end;
[all...]
H A Dts.c444 goto end;
451 goto end;
457 goto end;
461 goto end;
465 goto end;
469 goto end;
474 end:
665 goto end;
685 goto end;
689 goto end;
[all...]
/freebsd-10-stable/contrib/gdb/gdb/
H A Dcp-support.c81 - Parentheses don't just have to happen at the end of a name: they
86 demangled name might not end with ')': it could be a const or
114 beginning of the last argument list, not the end of the first
123 /* P now points at the `)' at the end of the argument list. Walk
154 const char *end; local
161 end = find_last_component (demangled_name);
162 if (end != NULL)
164 ret = xmalloc (end - demangled_name + 1);
165 memcpy (ret, demangled_name, end - demangled_name);
166 ret[end
179 const char *end; local
[all...]
H A Dfbsd-proc.c52 read_mapping (FILE *mapfile, unsigned long *start, unsigned long *end, argument
66 ret = sscanf (buf, "%lx %lx %d %d %lx %s", start, end,
80 unsigned long start, end, size; local
93 /* Now iterate until end-of-file. */
94 while (read_mapping (mapfile, &start, &end, &protection[0]))
96 size = end - start;
/freebsd-10-stable/sys/sparc64/isa/
H A Disa.c80 #define INRANGE(x, start, end) ((x) >= (start) && (x) <= (end))
145 u_int64_t end, start; local
197 end = start + regs[i].size - 1;
199 &start, &end, NULL);
204 end - start + 1);
221 end = start + regs[regidx[i]].size - 1;
223 isab_nrange, &start, &end, NULL);
229 start, end - start + 1);
276 u_long start, u_long end, u_lon
275 isa_alloc_resource(device_t bus, device_t child, int type, int *rid, u_long start, u_long end, u_long count, u_int flags) argument
[all...]
/freebsd-10-stable/contrib/llvm/tools/lldb/source/Plugins/Process/Utility/
H A DDynamicRegisterInfo.cpp275 success = m_value_regs_map.find(i) != m_value_regs_map.end();
473 for (reg_to_regs_map::iterator pos = m_value_regs_map.begin(), end = m_value_regs_map.end();
474 pos != end;
479 std::sort (pos->second.begin(), pos->second.end());
480 reg_num_collection::iterator unique_end = std::unique (pos->second.begin(), pos->second.end());
481 if (unique_end != pos->second.end())
482 pos->second.erase(unique_end, pos->second.end());
493 if (m_value_regs_map.find(i) != m_value_regs_map.end())
500 for (reg_to_regs_map::iterator pos = m_invalidate_regs_map.begin(), end
[all...]
/freebsd-10-stable/contrib/groff/src/preproc/refer/
H A Dref.h124 void capitalize(const char *ptr, const char *end, string &result);
125 void reverse_name(const char *ptr, const char *end, string &result);
126 void uppercase(const char *ptr, const char *end, string &result);
127 void lowercase(const char *ptr, const char *end, string &result);
128 void abbreviate_name(const char *ptr, const char *end, string &result);
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
H A Derase_fn_imps.hpp136 if (it == end())
137 return end();
148 iterator source_end_it = end();
150 iterator ret_it = end();
194 if (it == end())
/freebsd-10-stable/contrib/llvm/include/llvm/ADT/
H A DSmallSet.h51 return vfind(V) != Vector.end();
64 if (I != Vector.end()) // Don't reinsert if it already exists.
89 for (mutable_iterator I = Vector.begin(), E = Vector.end(); I != E; ++I)
105 for (VIterator I = Vector.begin(), E = Vector.end(); I != E; ++I)
108 return Vector.end();
117 } // end namespace llvm
H A DArrayRef.h65 ArrayRef(const T *begin, const T *end) argument
66 : Data(begin), Length(end - begin) {}
89 : Data(Vec.begin() == Vec.end() ? (T*)0 : Vec.begin()),
98 iterator end() const { return Data + Length; } function in class:llvm::ArrayRef
100 reverse_iterator rbegin() const { return reverse_iterator(end()); }
204 MutableArrayRef(T *begin, T *end) : ArrayRef<T>(begin, end) {}
222 iterator end() const { return data() + this->size(); }
224 reverse_iterator rbegin() const { return reverse_iterator(end()); }
278 ArrayRef<T> makeArrayRef(const T *begin, const T *end) { argument
[all...]
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/
H A DGCMetadata.h142 /// begin/end - Iterators for safe points.
145 iterator end() { return SafePoints.end(); } function in class:llvm::GCFunctionInfo
151 roots_iterator roots_end () { return Roots.end(); }
188 /// begin/end - Iterators for used strategies.
191 iterator end() const { return StrategyList.end(); } function in class:llvm::GCModuleInfo
/freebsd-10-stable/contrib/llvm/include/llvm/Support/
H A DGetElementPtrTypeIterator.h39 static generic_gep_type_iterator end(ItTy It) { function in class:llvm::generic_gep_type_iterator
90 return gep_type_iterator::end(GEP->op_end());
97 return gep_type_iterator::end(GEP.op_end());
109 return generic_gep_type_iterator<const T *>::end(A.end());
111 } // end namespace llvm
/freebsd-10-stable/contrib/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h72 std::stable_sort(EdgeVector.begin(), EdgeVector.end(), EdgeWeightCompare());
79 EWe = EdgeVector.end(); EWi != EWe; ++EWi) {
88 EWe = EdgeVector.end(); EWi != EWe; ++EWi) {
104 typename MaxSpanTree::iterator end() { function in class:llvm::MaximumSpanningTree
105 return MST.end();
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/AST/
H A DASTUnresolvedSet.h48 iterator end() { return iterator(Decls.end()); } function in class:clang::ASTUnresolvedSet
51 const_iterator end() const { return const_iterator(Decls.end()); } function in class:clang::ASTUnresolvedSet
61 for (DeclsTy::iterator I = Decls.begin(), E = Decls.end(); I != E; ++I) {
/freebsd-10-stable/contrib/llvm/tools/clang/lib/CodeGen/
H A DCGCall.h84 insert(end(), other.begin(), other.end());
85 Writebacks.insert(Writebacks.end(),
86 other.Writebacks.begin(), other.Writebacks.end());
102 writeback_iterator writeback_end() const { return Writebacks.end(); }
147 } // end namespace CodeGen
148 } // end namespace clang
/freebsd-10-stable/contrib/llvm/tools/lldb/include/lldb/Core/
H A DThreadSafeSTLMap.h83 if (pos != m_collection.end())
101 const_iterator pos, end = m_collection.end(); local
102 for (pos = m_collection.begin(); pos != end; ++pos)
130 if (pos != m_collection.end())
/freebsd-10-stable/contrib/llvm/tools/lldb/include/lldb/DataFormatters/
H A DFormattersContainer.h44 // class DataVisualization is the high-level front-end of this feature
146 if (iter == m_map.end())
169 if (iter == m_map.end())
181 MapIterator pos, end = m_map.end(); local
182 for (pos = m_map.begin(); pos != end; pos++)
202 MapIterator end = m_map.end(); local
207 if (end == iter)
218 MapIterator end local
379 MapIterator pos, end = m_format_map.map().end(); local
435 MapIterator pos, end = m_format_map.map().end(); local
453 MapIterator pos, end = m_format_map.map().end(); local
[all...]
/freebsd-10-stable/contrib/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h75 if (I != Seqs.end() && isSuffix(Seq, I->first))
91 for (typename SeqMap::iterator I = Seqs.begin(), E = Seqs.end(); I != E;
103 assert(I != Seqs.end() && isSuffix(Seq, I->first) &&
114 for (typename SeqMap::const_iterator I = Seqs.begin(), E = Seqs.end();
118 SE = I->first.end(); SI != SE; ++SI) {
140 } // end namespace llvm
/freebsd-10-stable/contrib/sendmail/libmilter/
H A Dmonitor.c37 ** entries are appended at the end. However, due to the concurrent
83 time_t now, end; local
101 end = Mon_cur_ctx->ctx_start + Mon_exec_time; \
102 if (now > end) \
105 "WARNING: monitor timeout triggered, now=%ld, end=%ld, tid=%ld, state=0x%x",\
106 (long) now, (long) end, \
120 abstime.tv_sec = end;
199 ** MI_MONITOR_WORK_END -- record end of thread execution
/freebsd-10-stable/contrib/wpa/src/utils/
H A Dbase64.c33 const unsigned char *end, *in; local
46 end = src + len;
50 while (end - in >= 3) {
63 if (end - in) {
65 if (end - in == 1) {
/freebsd-10-stable/sys/ofed/drivers/net/mlx4/
H A Dreset.c50 unsigned long end; local
102 end = jiffies + MLX4_SEM_TIMEOUT_JIFFIES;
109 } while (time_before(jiffies, end));
125 end = jiffies + MLX4_RESET_TIMEOUT_JIFFIES;
132 } while (time_before(jiffies, end));
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/
H A Dmap_debug_base.hpp157 if (find(r_key) != m_key_set.end())
183 if (it == m_key_set.end())
208 if (find(r_key) == m_key_set.end())
222 if (find(r_key) != m_key_set.end())
262 for (iterator_type it = m_key_set.begin(); it != m_key_set.end(); ++it)
265 return m_key_set.end();
275 while (it != m_key_set.end())
292 while (prime_it != m_key_set.end())
296 while (sec_it != m_key_set.end())
318 while (it != m_key_set.end())
[all...]
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp58 return end();
68 return end();
83 return end();
93 return end();
107 synth_e_access_traits::end(r_key);
139 synth_e_access_traits::end(r_key);
184 _GLIBCXX_DEBUG_ASSERT(l_bound_it == end() ||
188 if (l_bound_it == end() ||
202 _GLIBCXX_DEBUG_ASSERT(l_bound_it == end() ||
206 if (l_bound_it == end() ||
[all...]
/freebsd-10-stable/contrib/llvm/lib/CodeGen/
H A DSlotIndexes.cpp72 for (MachineFunction::iterator mbbItr = mf->begin(), mbbEnd = mf->end();
79 for (MachineBasicBlock::iterator miItr = mbb->begin(), miEnd = mbb->end();
103 std::sort(idx2MBBMap.begin(), idx2MBBMap.end(), Idx2MBBCompare());
118 for (IndexList::iterator I = indexList.begin(), E = indexList.end();
138 } while (curItr != indexList.end() && curItr->getIndex() <= index);
151 // Find anchor points, which are at the beginning/end of blocks or at
155 while (End != MBB->end() && !hasIndex(End))
166 if (End == MBB->end())
185 MachineInstr *MI = (MBBI != MBB->end() && !pastStart) ? MBBI : 0;
194 } else if (MI && mi2iMap.find(MI) == mi2iMap.end()) {
[all...]
/freebsd-10-stable/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDebugArangeSet.cpp73 // Compute the max end address between the two and use that to make the new
108 DescriptorIter end = m_arange_descriptors.end(); local
109 DescriptorIter pos = lower_bound(m_arange_descriptors.begin(), end, range, DescriptorLessThan);
111 if (pos != end)
123 // The top end of 'range' is the lower end of the entry
132 // We can combine these two and make sure the largest end
133 // address is used to make end address.
145 // NOTE: 'pos' points to entry past the end whic
244 DescriptorConstIter end = m_arange_descriptors.end(); local
267 DescriptorConstIter end = m_arange_descriptors.end(); local
[all...]

Completed in 254 milliseconds

<<11121314151617181920>>