HomeSort by: relevance | last modified time | path
    Searched defs:Map (Results 1 - 25 of 86) sorted by relevancy

1 2 3 4

  /src/external/gpl3/binutils/dist/gprofng/src/
Map.h 27 class Map
40 virtual ~Map () { };
  /src/external/gpl3/binutils.old/dist/gprofng/src/
Map.h 27 class Map
40 virtual ~Map () { };
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerShmemWindows.cpp 33 bool SharedMemoryRegion::Map(int fd) {
FuzzerShmemPosix.cpp 43 bool SharedMemoryRegion::Map(int fd) {
55 if (!Map(fd))
74 if (!Map(fd))
  /src/usr.sbin/ypserv/yptest/
yptest.c 52 const char *Map = "passwd.byname";
71 Status = yp_match(Domain, Map, Key, KeyLen, &Value, &ValLen);
78 Status = yp_first(Domain, Map, &Key2, &KeyLen, &Value, &ValLen);
87 Status = yp_next(Domain, Map, Key2, KeyLen, &Key2,
97 Status = yp_master(Domain, Map, &Key2);
104 Status = yp_order(Domain, Map, &Order);
127 Status = yp_all(Domain, Map, &Callback);
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
UniqueVector.h 14 #include <map>
31 // Map - Used to handle the correspondence of entry to ID.
32 std::map<T, unsigned> Map;
41 // Check if the entry is already in the map.
42 unsigned &Val = Map[Entry];
58 // Search for entry in the map.
59 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
62 if (MI != Map.end()) return MI->second
    [all...]
MapVector.h 1 //===- llvm/ADT/MapVector.h - Map w/ deterministic value order --*- C++ -*-===//
9 // This file implements a map that provides insertion order iteration. The
31 /// This class implements a map that also provides access to all stored values
38 MapType Map;
43 "The mapped_type of the specified Map must be an integral type");
56 Map.clear();
65 Map.reserve(NumEntries);
89 Map.clear();
94 std::swap(Map, RHS.Map);
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
AnalysisOrderChecker.cpp 165 CFGStmtMap *Map = C.getCurrentAnalysisDeclContext()->getCFGStmtMap();
166 CFGElement LastElement = Map->getBlock(S)->back();
ObjCContainersChecker.cpp 65 // ProgramState trait - a map from array symbol to its state.
165 // about its size any more -- so remove it from the map.
176 ArraySizeMapTy Map = State->get<ArraySizeMap>();
177 if (Map.isEmpty())
181 for (auto I : Map) {
  /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/
tsan_dense_alloc.h 15 // allocates/free indices of objects and provide a functionality to map
75 T *Map(IndexT idx) {
85 *(IndexT*)Map(idx) = freelist_;
126 freelist_ = *(IndexT*)Map(idx);
134 *(IndexT*)Map(idx) = freelist_;
tsan_interceptors_mac.cc 311 // stable address (the array backing the hash map can change). The memory is
315 typedef AddrHashMap<uptr, 5> Map;
316 static Map Addresses;
317 Map::Handle h(&Addresses, addr);
  /src/external/apache2/llvm/dist/clang/include/clang/Lex/
DirectoryLookup.h 43 /// Map - This is the HeaderMap if this is a headermap lookup.
45 const HeaderMap *Map;
48 DLU(const HeaderMap *Map) : Map(Map) {}
59 /// Whether this is a header map used when building a framework.
74 /// This ctor *does not take ownership* of 'Map'.
75 DirectoryLookup(const HeaderMap *Map, SrcMgr::CharacteristicKind DT,
77 : u(Map), DirCharacteristic(DT), LookupType(LT_HeaderMap),
107 return isHeaderMap() ? u.Map : nullptr
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
Pointer.cpp 142 InitMap *Map = getInitMap();
143 if (!Map)
145 if (Map == (InitMap *)-1)
147 return Map->isInitialized(getIndex());
160 InitMap *&Map = getInitMap();
161 if (Map == (InitMap *)-1)
163 if (Map == nullptr)
164 Map = InitMap::allocate(Desc->getNumElems());
165 if (Map->initialize(getIndex())) {
166 free(Map);
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
BasicValueFactory.cpp 354 PersistentSValsTy& Map = *((PersistentSValsTy*) PersistentSVals);
358 FoldNodeTy* P = Map.FindNodeOrInsertPos(ID, InsertPos);
363 Map.InsertNode(P, InsertPos);
379 PersistentSValPairsTy& Map = *((PersistentSValPairsTy*) PersistentSValPairs);
383 FoldNodeTy* P = Map.FindNodeOrInsertPos(ID, InsertPos);
388 Map.InsertNode(P, InsertPos);
DynamicType.cpp 25 /// The GDM component containing the dynamic type info. This is a map from a
33 /// A map from symbols to cast informations.
37 // A map from Class object symbols to the most likely pointed-to type.
166 const auto &Map = State->get<MapTy>();
168 for (const auto &Elem : Map)
267 const auto &Map = State->get<MapTy>();
268 if (Map.isEmpty() && !PrintEvenIfEmpty)
272 printJsonContainer(Map, Out, NL, Space, IsDot) << "," << NL;
  /src/external/apache2/llvm/dist/llvm/include/llvm/BinaryFormat/
MsgPackReader.h 45 /// being divided into a signed Int and unsigned UInt variant in order to map
48 /// The types map onto corresponding union members of the \c Object struct.
58 Map,
75 /// completely represented by the \c Kind itself) map to a exactly one union
90 /// Value for \c Type::Array and \c Type::Map.
115 /// For the collection objects (Array and Map), only the length is read, and
117 /// \c N*2 calls (in the case of Map) to \c Read to retrieve the collection
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
LiveRangeCalc.h 57 /// LiveOutMap - Map basic blocks to the value leaving the block.
66 /// Map LiveRange to sets of blocks (represented by bit vectors) that
80 /// Map each basic block where a live range is live out to the live-out value
95 /// The map can be shared by multiple live ranges as long as no two are
97 LiveOutMap Map;
173 /// Reset Map and Seen fields.
232 Map[MBB] = LiveOutPair(VNI, nullptr);
RDFLiveness.h 19 #include <map>
61 // This is really a std::map, except that it provides a non-trivial
67 return Map.emplace(B, Empty).first->second;
72 std::map<MachineBasicBlock*,RegisterAggr> Map;
143 // map: NodeId -> (map: RegisterId -> NodeRefSet)
144 // phi id -> (map: register -> set of reached non-phi uses)
148 std::map<MachineBasicBlock*,std::set<MachineBasicBlock*>> IIDF;
151 std::map<MachineBasicBlock*,RefMap> PhiLON
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/BinaryFormat/
MsgPackDocument.cpp 26 // Convert this DocNode into an empty map.
43 DocNode &N = (*Map)[Key];
113 // Points to map entry when we have just processed a map key.
139 // On to next element (or key if doing a map key next).
170 case Type::Map:
189 auto &Map = Stack.back().Node.getMap();
191 // Reading a map key.
193 Stack.back().MapEntry = &Map[Node];
196 // Reading the value for the map key read in the last iteration
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/MCTargetDesc/
SystemZMCTargetDesc.cpp 128 static unsigned Map[SystemZ::NUM_TARGET_REGS];
132 Map[GR32Regs[I]] = I;
133 Map[GRH32Regs[I]] = I;
134 Map[GR64Regs[I]] = I;
135 Map[GR128Regs[I]] = I;
136 Map[FP128Regs[I]] = I;
137 Map[AR32Regs[I]] = I;
140 Map[VR32Regs[I]] = I;
141 Map[VR64Regs[I]] = I;
142 Map[VR128Regs[I]] = I
    [all...]
  /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/
tsan_dense_alloc.h 14 // allocates/free indices of objects and provide a functionality to map
81 T *Map(IndexT idx) {
93 *(IndexT*)Map(idx) = freelist_;
140 freelist_ = *(IndexT*)Map(idx);
148 *(IndexT*)Map(idx) = freelist_;
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
DependentDiagnostic.h 178 const DependentStoredDeclsMap *Map
181 if (!Map)
185 return ddiag_range(ddiag_iterator(Map->FirstDiagnostic), ddiag_iterator());
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonBlockRanges.h 15 #include <map>
136 friend raw_ostream &operator<< (raw_ostream &OS, const InstrIndexMap &Map);
142 std::map<IndexType,MachineInstr*> Map;
145 using RegToRangeMap = std::map<RegisterRef, RangeList>;
154 : Map(M), TRI(I) {}
159 const RegToRangeMap &Map;
  /src/external/apache2/llvm/dist/llvm/lib/XRay/
InstrumentationMap.cpp 1 //===- InstrumentationMap.cpp - XRay Instrumentation Map ------------------===//
58 InstrumentationMap Map;
86 "Failed to find XRay instrumentation map.",
146 // Copy the instrumentation map data into the Sleds data structure.
153 Twine("Instrumentation map entries not evenly divisible by size of "
261 InstrumentationMap Map;
285 if (auto E = loadYAML(*FdOrErr, FileSize, Filename, Map.Sleds,
286 Map.FunctionAddresses, Map.FunctionIds))
288 } else if (auto E = loadObj(Filename, *ObjectFileOrError, Map.Sleds
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/
xray-graph.cpp 43 cl::desc("binary with the instrumrntation map, or "
44 "a separate instrumentation map"),
442 InstrumentationMap Map;
448 Twine("Cannot open instrumentation map '") + GraphInstrMap + "'",
451 Map = std::move(*InstrumentationMapOrError);
454 const auto &FunctionAddresses = Map.getFunctionAddresses();

Completed in 48 milliseconds

1 2 3 4