Searched refs:map (Results 276 - 286 of 286) sorted by path

<<1112

/haiku/src/system/libnetwork/netresolv/nameser/
H A Dns_name.c802 ns_name_map(ns_nname_ct nname, size_t namelen, ns_namemap_t map, int mapsize) { argument
832 l = ns_name_map(nname + n, namelen - n, map, mapsize);
842 /* We're on our way back up-stack, store current map data. */
843 map[l].base = nname;
844 map[l].len = n;
/haiku/src/system/libnetwork/netresolv/net/
H A Dgethnamaddr.c1245 const char *map; local
1266 map = "hosts.byaddr";
1269 map = "ipnodes.byaddr";
1273 r = yp_match(__ypdomain, map, name,
1296 const char *map; local
1311 map = "hosts.byname";
1314 map = "ipnodes.byname";
1318 r = yp_match(__ypdomain, map, name,
/haiku/src/tests/add-ons/kernel/partitioning_systems/
H A DPartitioningSystemsTest.cpp15 #include <map>
33 typedef std::map<partition_id, partition_entry*> PartitionMap;
34 typedef std::map<partition_id, disk_device_data*> DiskDeviceMap;
/haiku/src/tests/kits/net/service/
H A DHttpTest.cpp15 #include <map>
35 typedef std::map<std::string, std::string> HttpHeaderMap;
545 std::map<BString, BString> cookies;
/haiku/src/tests/kits/shared/
H A DKeymapTest.cpp13 #include <map>
73 typedef std::map<uint32, int32(*)[128]> table_map_t;
H A DLRUCacheTest.cpp30 /*! This tests the insertion of various letters into the map and the subsequent
37 LRUCache<HashString, BString> map(5);
46 map.Put(HashString(tmpKey), tmpValue);
50 CPPUNIT_ASSERT_EQUAL(5, map.Size());
52 CPPUNIT_ASSERT_EQUAL(BString(""), map.Get(HashString("a")));
53 CPPUNIT_ASSERT_EQUAL(BString(""), map.Get(HashString("u")));
55 CPPUNIT_ASSERT_EQUAL(BString("zz"), map.Get(HashString("z")));
56 CPPUNIT_ASSERT_EQUAL(BString("yy"), map.Get(HashString("y")));
57 CPPUNIT_ASSERT_EQUAL(BString("xx"), map.Get(HashString("x")));
58 CPPUNIT_ASSERT_EQUAL(BString("ww"), map
[all...]
/haiku/src/tests/kits/storage/
H A DEntryTest.cpp10 #include <map>
11 using std::map;
2616 map<TestEntry*, int> superDirs;
H A DMimeTypeTest.cpp5 #include <map>
1651 // We're only interested in directories, as they map to
1652 // supertypes (and since they map thusly, they must also
1731 // We're only interested in directories, as they map to
1732 // supertypes (and since they map thusly, they must also
2560 std::map< std::string, std::set<std::string> > typeAppMap; // Stores mapping of types to apps that support them
2561 std::map< std::string, std::set<std::string> > fakeTypeAppMap; // Used to keep timing info for R5 and Haiku tests orthogonal
2581 // and add the app to the type->app map for each such type
2613 // app in our type->apps map
2656 // add them to the type->app map, bu
[all...]
/haiku/src/tests/system/kernel/cache/
H A Dpages_io_test.cpp61 file_map map; member in struct:file_cache_ref
115 // TODO: once we can invalidate only parts of the file map,
329 for (uint32 index = 0; index < ref->map.count; index++) {
330 file_extent *extent = ref->map[index];
351 if (ref->map.count == 0) {
352 // we don't yet have the map of this file, so let's grab it
357 // the file map could have been requested in the mean time
358 if (ref->map.count == 0) {
369 status_t addStatus = ref->map.Add(vecs, vecCount, mapOffset);
378 // when we are here, the map ha
[all...]
/haiku/src/tests/system/kernel/util/
H A DBOpenHashTableTest.cpp176 uint64_t map = 0; local
180 CPPUNIT_ASSERT_EQUAL(0, map & (1 << entry->Value()));
181 map |= (1 << entry->Value());
184 CPPUNIT_ASSERT_EQUAL(map, (1 << kEntryCount) - 1);
209 uint64_t map = 0; local
213 CPPUNIT_ASSERT_EQUAL(0, map & (1 << entry->Value()));
214 map |= (1 << entry->Value());
217 CPPUNIT_ASSERT_EQUAL(map, (1 << kEntryCount) - 1);
/haiku/src/tools/get_package_dependencies/
H A Dget_package_dependencies.cpp15 #include <map>
98 std::map<BSolverRepository*, BRepositoryInfo> repositoryInfos;

Completed in 115 milliseconds

<<1112