mirror of
https://github.com/boostorg/build.git
synced 2026-02-15 13:02:11 +00:00
eed0cf6cc3
* bjam; bump to version 3.1.12 * bjam; make it possible to build in MinGW/MSYS shell * bjam; move profile code to debug.h/c to make it available for use everywhere * bjam; cache all filesystem query operations, Unix and Windows only, include PWD and scanning * bjam; add memory profile info, and sprinkle throught code * bbv2; rewrite some while() loops into for() loops to reduce time and memory * bbv2; keep a single instance counter instead of one per type to reduce memory use * bjam+bbv2; change NORMALIZE_PATH builtin to join path parts to reduce memory use [SVN r31177]
26 lines
677 B
C
26 lines
677 B
C
/*
|
|
* Copyright 1993, 1995 Christopher Seiwald.
|
|
*
|
|
* This file is part of Jam - see jam.c for Copyright information.
|
|
*/
|
|
|
|
/*
|
|
* hash.h - simple in-memory hashing routines
|
|
*/
|
|
|
|
#ifndef BOOST_JAM_HASH_H
|
|
#define BOOST_JAM_HASH_H
|
|
|
|
typedef struct hashdata HASHDATA;
|
|
|
|
struct hash * hashinit( int datalen, char *name );
|
|
int hashitem( struct hash *hp, HASHDATA **data, int enter );
|
|
void hashdone( struct hash *hp );
|
|
void hashenumerate( struct hash *hp, void (*f)(void*,void*), void* data );
|
|
int hash_free( struct hash *hp, HASHDATA *data);
|
|
|
|
# define hashenter( hp, data ) (!hashitem( hp, data, !0 ))
|
|
# define hashcheck( hp, data ) hashitem( hp, data, 0 )
|
|
|
|
#endif
|