/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | insert_store_hash_fn_imps.hpp | 76 std::make_pair(pos, pos_hash_pair.second) : 77 std::make_pair(ins_pos, pos_hash_pair.second)); 90 return std::make_pair(pos, pos_hash_pair.second); 101 return std::make_pair(ins_pos, pos_hash_pair.second); 105 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool> 118 return std::make_pair(&p_e->m_value, false); 122 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
|
/freebsd-10-stable/contrib/libstdc++/libsupc++/ |
H A D | eh_alloc.cc | 45 using std::free; 46 using std::malloc; 47 using std::memset; 51 extern "C" void *malloc (std::size_t); 53 extern "C" void *memset (void *, int, std::size_t); 82 /* 256 bytes is more than large enough for an std::bad_alloc object */ 107 __cxxabiv1::__cxa_allocate_exception(std::size_t thrown_size) throw() 136 std::terminate ();
|
/freebsd-10-stable/contrib/llvm/lib/Target/R600/ |
H A D | R600MachineScheduler.h | 54 std::vector<SUnit *> Available[IDLast], Pending[IDLast]; 55 std::vector<SUnit *> AvailableAlus[AluLast]; 56 std::vector<SUnit *> PhysicalRegCopy; 84 std::vector<MachineInstr *> InstructionsGroupCandidate; 94 SUnit *PopInst(std::vector<SUnit*> &Q, bool AnyALU); 99 void MoveUnits(std::vector<SUnit *> &QSrc, std::vector<SUnit *> &QDst);
|
H A D | R600OptimizeVectorRegisters.cpp | 64 std::vector<unsigned> UndefReg; 90 const std::vector<std::pair<unsigned, unsigned> > &) const; 92 std::vector<std::pair<unsigned, unsigned> > &Remap) const; 94 std::vector<std::pair<unsigned, unsigned> > &RemapChan); 96 std::vector<std::pair<unsigned, unsigned> > &RemapChan); 99 const std 143 tryMergeVector(const RegSeqInfo *Untouched, RegSeqInfo *ToMerge, std::vector< std::pair<unsigned, unsigned> > &Remap) const argument 166 getReassignedChan( const std::vector<std::pair<unsigned, unsigned> > &RemapChan, unsigned Chan) argument 176 RebuildVector( RegSeqInfo *RSI, const RegSeqInfo *BaseRSI, const std::vector<std::pair<unsigned, unsigned> > &RemapChan) const argument 245 SwizzleInput(MachineInstr &MI, const std::vector<std::pair<unsigned, unsigned> > &RemapChan) const argument [all...] |
H A D | R600InstrInfo.h | 38 std::vector<std::pair<int, unsigned> > 105 SmallVector<std::pair<MachineOperand *, int64_t>, 3> 109 const std::vector<std::vector<std::pair<int, unsigned> > > &IGSrcs, 110 const std::vector<R600InstrInfo::BankSwizzle> &Swz, 111 const std::vector<std::pair<int, unsigned> > &TransSrcs, 115 const std [all...] |
/freebsd-10-stable/contrib/llvm/tools/lldb/source/Utility/ |
H A D | StringExtractor.h | 70 std::string & 76 const std::string & 102 GetNameColonValue (std::string &name, std::string &value); 129 GetHexByteString (std::string &str); 132 GetHexByteStringTerminatedBy (std::string &str, 147 std::string m_packet; // The string in which to extract data.
|
/freebsd-10-stable/contrib/libstdc++/include/tr1/ |
H A D | hashtable_policy.h | 41 namespace std namespace 49 inline typename std::iterator_traits<_Iterator>::difference_type 51 std::input_iterator_tag) 55 inline typename std::iterator_traits<_Iterator>::difference_type 57 std::forward_iterator_tag) 58 { return std::distance(__first, __last); } 61 inline typename std::iterator_traits<_Iterator>::difference_type 64 typedef typename std::iterator_traits<_Iterator>::iterator_category _Tag; 184 std::size_t _M_hash_code; 235 typedef std [all...] |
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineModuleInfo.h | 71 std::vector<int> TypeIds; // List of type ids (filters negative) 87 typedef std::vector<std::pair<MCSymbol*, StubValueTy> > SymbolListTy; 111 std::vector<MCCFIInstruction> FrameInstructions; 119 std::vector<LandingPadInfo> LandingPads; 134 std::vector<const GlobalVariable *> TypeInfos; 137 std::vector<unsigned> FilterIds; 141 std::vector<unsigned> FilterEnds; 145 std::vector<const Function *> Personalities; 171 typedef std [all...] |
H A D | LatencyPriorityQueue.h | 25 struct latency_sort : public std::binary_function<SUnit*, SUnit*, bool> { 34 std::vector<SUnit> *SUnits; 40 std::vector<unsigned> NumNodesSolelyBlocking; 43 std::vector<SUnit*> Queue; 52 void initNodes(std::vector<SUnit> &sunits) {
|
H A D | MachineJumpTableInfo.h | 36 std::vector<MachineBasicBlock*> MBBs; 38 explicit MachineJumpTableEntry(const std::vector<MachineBasicBlock*> &M) 80 std::vector<MachineJumpTableEntry> JumpTables; 93 unsigned createJumpTableIndex(const std::vector<MachineBasicBlock*> &DestBBs); 99 const std::vector<MachineJumpTableEntry> &getJumpTables() const {
|
/freebsd-10-stable/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 46 static std::string getEdgeDestLabel(const void *Node, unsigned i) { 51 static std::string getEdgeSourceLabel(const void *Node, EdgeIter I) { 70 std::advance(NI, I.getNode()->getOperand(I.getOperand()).getResNo()); 74 static std::string getGraphName(const SelectionDAG *G) { 90 static std::string getEdgeAttributes(const void *Node, EdgeIter EI, 102 static std::string getSimpleNodeLabel(const SDNode *Node, 104 std::string Result = Node->getOperationName(G); 111 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph); 112 static std::string getNodeAttributes(const SDNode *N, 115 const std [all...] |
/freebsd-10-stable/contrib/llvm/tools/clang/utils/TableGen/ |
H A D | ClangASTNodesEmitter.cpp | 28 typedef std::multimap<Record*, Record*> ChildMap; 33 const std::string &BaseSuffix; 36 static std::string macroName(std::string S) { 38 S[i] = std::toupper(S[i]); 46 std::string baseName(Record &R) { 53 std::pair<Record *, Record *> EmitNode (const ChildMap &Tree, raw_ostream& OS, 56 explicit ClangASTNodesEmitter(RecordKeeper &R, const std::string &N, 57 const std::string &S) 72 std [all...] |
/freebsd-10-stable/contrib/llvm/include/llvm/Support/ |
H A D | MathExtras.h | 47 typename enable_if_c<std::numeric_limits<T>::is_integer && 48 !std::numeric_limits<T>::is_signed, std::size_t>::type 53 return std::numeric_limits<T>::digits; 58 std::size_t ZeroBits = 0; 59 T Shift = std::numeric_limits<T>::digits >> 1; 60 T Mask = std::numeric_limits<T>::max() >> Shift; 74 typename enable_if_c<std::numeric_limits<T>::is_integer && 75 std::numeric_limits<T>::is_signed, std [all...] |
/freebsd-10-stable/contrib/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.h | 38 std::string Name; 39 std::string Namespace; 54 const std::string &getName() const { return Name; } 55 const std::string &getNamespace() const { return Namespace; } 56 std::string getQualifiedName() const; 68 typedef std::map<CodeGenSubRegIndex*, CodeGenSubRegIndex*, Less> CompMap; 82 std::pair<CompMap::iterator, bool> Ins = 83 Composed.insert(std::make_pair(A, B)); 117 typedef std::map<CodeGenSubRegIndex*, CodeGenRegister*, 122 const std [all...] |
/freebsd-10-stable/contrib/llvm/lib/Support/ |
H A D | TargetRegistry.cpp | 26 const Target *TargetRegistry::lookupTarget(const std::string &ArchName, 28 std::string &Error) { 54 std::string TempError; 67 const Target *TargetRegistry::lookupTarget(const std::string &TT, 68 std::string &Error) { 96 Error = std::string("Cannot choose between targets \"") + 127 const Target *TargetRegistry::getClosestTargetForJIT(std::string &Error) { 138 static int TargetArraySortFn(const std::pair<StringRef, const Target *> *LHS, argument 139 const std::pair<StringRef, const Target *> *RHS) { 144 std [all...] |
H A D | Statistic.cpp | 53 std::vector<const Statistic*> Stats; 91 int Cmp = std::strcmp(LHS->getName(), RHS->getName()); 95 return std::strcmp(LHS->getDesc(), RHS->getDesc()) < 0; 120 MaxValLen = std::max(MaxValLen, 122 MaxNameLen = std::max(MaxNameLen, 123 (unsigned)std::strlen(Stats.Stats[i]->getName())); 127 std::stable_sort(Stats.Stats.begin(), Stats.Stats.end(), NameCompare()); 130 OS << "===" << std::string(73, '-') << "===\n" 132 << "===" << std::string(73, '-') << "===\n\n";
|
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Tooling/ |
H A D | Refactoring.h | 115 std::string toString() const; 123 std::string FilePath; 125 std::string ReplacementText; 136 typedef std::set<Replacement> Replacements; 152 bool applyAllReplacements(const std::vector<Replacement> &Replaces, 159 std::string applyAllReplacements(StringRef Code, const Replacements &Replaces); 169 unsigned shiftedCodePosition(const std::vector<Replacement> &Replaces, 179 void deduplicate(std::vector<Replacement> &Replaces, 180 std::vector<Range> &Conflicts); 185 std [all...] |
H A D | RefactoringCallbacks.h | 58 std::string FromId; 59 std::string ToText; 70 std::string FromId; 71 std::string ToId; 83 std::string Id;
|
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/resize_policy/ |
H A D | cc_hash_max_collision_check_resize_trigger_imp.hpp | 152 std::cerr << "chmccrt::notify_resized " 153 << static_cast<unsigned long>(new_size) << std::endl; 171 std::cerr << "chmccrt::calc_max_num_coll " 173 << static_cast<unsigned long>(m_max_col) << std::endl; 188 std::swap(m_load, other.m_load); 189 std::swap(m_size, other.m_size); 190 std::swap(m_num_col, other.m_num_col); 191 std::swap(m_max_col, other.m_max_col); 192 std::swap(m_resize_needed, other.m_resize_needed);
|
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/trie_policy/ |
H A D | prefix_search_node_update_imp.hpp | 48 std::pair< 62 std::pair< 74 std::pair< 80 const std::pair<iterator, iterator> non_const_ret = 83 return (std::make_pair( 89 std::pair< 101 const size_type given_range_length = std::distance(b, e); 106 return (std::make_pair(end(), end())); 117 return (std::make_pair(ret_b, ++ret_e));
|
/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/ |
H A D | CFGPrinter.h | 31 static std::string getGraphName(const Function *F) { 35 static std::string getSimpleNodeLabel(const BasicBlock *Node, 40 std::string Str; 47 static std::string getCompleteNodeLabel(const BasicBlock *Node, 50 std::string Str; 59 std::string OutStr = OS.str(); 92 std::string getNodeLabel(const BasicBlock *Node, 100 static std::string getEdgeSourceLabel(const BasicBlock *Node, 113 std::string Str;
|
/freebsd-10-stable/contrib/llvm/lib/IR/ |
H A D | PrintModulePass.cpp | 25 std::string Banner; 32 PrintModulePass(const std::string &B, raw_ostream *o, bool DS) 50 std::string Banner; // String to print before each function 57 PrintFunctionPass(const std::string &B, raw_ostream *o, bool DS) 78 std::string Banner; 85 PrintBasicBlockPass(const std::string &B, raw_ostream *o, bool DS) 117 const std::string &Banner) { 123 FunctionPass *llvm::createPrintFunctionPass(const std::string &Banner, 133 const std::string &Banner) {
|
/freebsd-10-stable/contrib/atf/atf-c++/detail/ |
H A D | test_helpers.cpp | 55 std::vector< std::string > optargs; 75 std::ofstream srcfile("test.cpp"); 80 const std::string failmsg = std::string("Header check failed; ") +
|
/freebsd-10-stable/contrib/libstdc++/include/ext/pb_ds/detail/ |
H A D | standard_policies.hpp | 72 typedef std::equal_to< Key> type; 143 std::basic_string< 146 std::allocator< 151 std::basic_string< 154 std::allocator<
|
/freebsd-10-stable/contrib/llvm/lib/CodeGen/ |
H A D | ScheduleDAGPrinter.cpp | 36 static std::string getGraphName(const ScheduleDAG *G) { 55 static std::string getEdgeAttributes(const SUnit *Node, 66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph); 67 static std::string getNodeAttributes(const SUnit *N, 79 std::string DOTGraphTraits<ScheduleDAG*>::getNodeLabel(const SUnit *SU,
|