| /dports/games/ecwolf/ecwolf-1.3.3-src/src/textures/ |
| H A D | texturemanager.cpp | 74 memset (HashFirst, -1, sizeof(HashFirst)); in FTextureManager()
104 memset (HashFirst, -1, sizeof(HashFirst)); in DeleteAll()
168 i = HashFirst[MakeKey (name) % HASH_SIZE]; in CheckForTexture()
271 i = HashFirst[MakeKey (name) % HASH_SIZE]; in ListTextures()
393 hash = HashFirst[bucket]; in AddTexture()
404 if (bucket >= 0) HashFirst[bucket] = trans; in AddTexture()
934 while (HashFirst[i] >= start && HashFirst[i] != HASH_END) in SortTexturesByType()
936 HashFirst[i] = Textures[HashFirst[i]].HashNext; in SortTexturesByType()
|
| /dports/games/zdoom/zdoom-2.8.1/src/textures/ |
| H A D | texturemanager.cpp | 73 memset (HashFirst, -1, sizeof(HashFirst)); in FTextureManager()
103 memset (HashFirst, -1, sizeof(HashFirst)); in DeleteAll()
166 i = HashFirst[MakeKey (name) % HASH_SIZE]; in CheckForTexture()
281 i = HashFirst[MakeKey (name) % HASH_SIZE]; in ListTextures()
379 hash = HashFirst[bucket]; in AddTexture()
390 if (bucket >= 0) HashFirst[bucket] = trans; in AddTexture()
917 while (HashFirst[i] >= start && HashFirst[i] != HASH_END) in SortTexturesByType()
919 HashFirst[i] = Textures[HashFirst[i]].HashNext; in SortTexturesByType()
|
| /dports/math/clingo/clingo-5.5.1/libgringo/gringo/output/ |
| H A D | aggregates.hh | 36 using BodyAggregateElements = UniqueVec<std::pair<TupleId, Formula>, HashFirst<TupleId>, EqualToFir…
38 using HeadAggregateElements = UniqueVec<std::pair<TupleId, HeadFormula>, HashFirst<TupleId>, EqualT…
|
| /dports/databases/sqlcipher/sqlcipher-3.4.2/ext/fts1/ |
| H A D | ft_hash.h | 100 #define HashFirst(H) ((H)->first) macro
|
| H A D | fulltext.c | 1401 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1407 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1451 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
1455 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
|
| /dports/databases/sqlite3/sqlite-src-3350500/ext/fts1/ |
| H A D | ft_hash.h | 100 #define HashFirst(H) ((H)->first) macro
|
| H A D | fulltext.c | 1401 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1407 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1451 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
1455 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/ext/fts1/ |
| H A D | ft_hash.h | 100 #define HashFirst(H) ((H)->first) macro
|
| H A D | fulltext.c | 1401 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1407 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1451 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
1455 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/ext/fts1/ |
| H A D | ft_hash.h | 100 #define HashFirst(H) ((H)->first) macro
|
| H A D | fulltext.c | 1401 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1407 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1451 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
1455 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
|
| /dports/databases/db5/db-5.3.28/lang/sql/sqlite/ext/fts1/ |
| H A D | ft_hash.h | 100 #define HashFirst(H) ((H)->first) macro
|
| H A D | fulltext.c | 1389 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1395 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_insert()
1439 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
1443 for(e=HashFirst(&terms); e; e=HashNext(e)){ in index_delete()
|
| /dports/cad/qflow/qflow-1.4.98/src/ |
| H A D | blifFanout.c | 443 gl = (struct Gatelist *)HashFirst(&Gatehash); in main()
474 gl = (struct Gatelist *)HashFirst(&Gatehash); in main()
653 nl = (struct Nodelist *)HashFirst(&Nodehash); in main()
702 nl = (struct Nodelist *)HashFirst(&Nodehash); in main()
748 dl = (struct Drivelist *)HashFirst(&Drivehash); in main()
978 gl = (struct Gatelist *)HashFirst(&Gatehash); in showgatelist()
1078 nl = (struct Nodelist *)HashFirst(&Nodehash); in shownodes()
1158 nl = (struct Nodelist *)HashFirst(&Nodehash); in write_output()
|
| H A D | vlogFanout.c | 319 nl = (struct Nodelist *)HashFirst(&Nodehash); in insert_buffers()
436 nl = (struct Nodelist *)HashFirst(&Nodehash); in insert_buffers()
724 gl = (struct Gatelist *)HashFirst(&Gatehash); in showgatelist()
851 nl = (struct Nodelist *)HashFirst(&Nodehash); in shownodes()
1454 gl = (struct Gatelist *)HashFirst(&Gatehash); in main()
1485 gl = (struct Gatelist *)HashFirst(&Gatehash); in main()
1660 nl = (struct Nodelist *)HashFirst(&Nodehash); in main()
1714 dl = (struct Drivelist *)HashFirst(&Drivehash); in main()
|
| H A D | hash.h | 46 extern void *HashFirst(struct hashtable *table);
|
| H A D | spice2delay.c | 655 currnode = HashFirst(&Nodehash); in main()
725 currnode = HashFirst(&Nodehash); in main()
|
| H A D | hash.c | 400 void *HashFirst(struct hashtable *table) in HashFirst() function
|
| /dports/games/vavoom/vavoom-1.33/source/ |
| H A D | p_gameobject.h | 195 int HashFirst; member
350 int HashFirst; member
|
| H A D | p_setup.cpp | 2500 Sectors[i].HashFirst = -1; in HashSectors()
2507 Sectors[i].HashNext = Sectors[HashIndex].HashFirst; in HashSectors()
2508 Sectors[HashIndex].HashFirst = i; in HashSectors()
2525 Lines[i].HashFirst = -1; in HashLines()
2532 Lines[i].HashNext = Lines[HashIndex].HashFirst; in HashLines()
2533 Lines[HashIndex].HashFirst = i; in HashLines()
|
| H A D | level.cpp | 844 (vuint32)NumSectors].HashFirst : Sectors[start].HashNext; in FindSectorFromTag()
866 (vuint32)NumLines].HashFirst : Lines[*searchPosition].HashNext; in FindLine()
|
| /dports/cad/netgen-lvs/netgen-1.5.211/base/ |
| H A D | hash.h | 47 extern void *HashFirst(struct hashdict *dict);
|
| H A D | hash.c | 455 void *HashFirst(struct hashdict *dict) in HashFirst() function
|
| /dports/net/freeswitch/freeswitch-1.10.3.-release/src/mod/endpoints/mod_rtmp/libamf/src/ |
| H A D | hash.h | 74 #define HashFirst(H) ((H)->first) macro
|
| /dports/math/clingo/clingo-5.5.1/libgringo/gringo/ |
| H A D | hash_set.hh | 291 using HashFirst = HashKey<T,First<T>,Hash>; typedef
604 … using BigMap = UniqueVec<std::pair<SizeType, Data>, HashFirst<SizeType>, EqualToFirst<SizeType>>;
|