New Evaluation Libraries

The Linux and Windows evaluation libraries have been updated, and are set to expire on December 31st, 2017.

These libraries include the new COBOL support changes, updated support for legacy custom ISAM formats, and all stable updates.

Please contact us if you need an evaluation library for other targets.

The following features did not make the cut, and another update will be posted when they are ready.

  • integrated JSON syntax encoder and parser
  • integrated support for legacy (flat record structure) ISAM files
  • expanded support for Swift, Python and JScript

Documentation Published

After far too many delays, the DISAM manual is ready.

This includes a complete reworking and update of the original read folder references, adding cross references and a proper index, and a translation into structured text, from which we are able to publish the manual in virtually any form.

You can download DISAM manual in zip format, or DISAM manual in gzip tar format in html, man and stx2any formats, or see the link above for the inline reader.

Please understand that this is a work in progress, and will have typographical or other errors, and we appreciate your patience, and especially your comments, should you happen to find any.

Building D-ISAM in Xcode from the command line

Makefile for D-ISAM dynamic library in Xcode shows the details needed to build D-ISAM as an Xcode dynamic library, suitable for direct inclusion in any Xcode project.

To build a single arch library for your current development target only

make clean new lib

You can also build D-ISAM for devices other than the default by setting the compiler and sdk-path explicitly

BIN=$(xcrun --sdk iphonesimulator --find clang)
SDK=$(xcrun --sdk iphonesimulator --show-sdk-path)

To build a multi arch library for the selected device

make CC="$BIN -isysroot $SDK -miphoneos-version-min=6.0 -arch i386 -arch x86_64" clean new lib

Static D-ISAM libararies (.a) and regular shared libraries (.so) – as generated by the makefiles distributed with D-ISAM – are also compatible with Xcode, as needed or preferred.

Building a D-ISAM framework for Xcode shows how to build a framework from the command line.

Building D-ISAM in the Xcode IDE covers D-ISAM installation from the Integrated Development Environment.

Building D-ISAM in the Xcode IDE

Before starting please see Update for Constant Chars.

D-ISAM is probably best deployed as a framework, which may be created as follows.

  1. Start a new Framework project in the IDE.
  2. Add your D-ISAM headers, and make sure they are set Public under Target Membership in the File Inspector.
  3. Add your D-ISAM source, at least the contents of the base folder, and any other modules you need.
  4. In the Framework header (created automatically) #include "isbase.h", or the D-ISAM headers of your choice.

You can use an existing D-ISAM library, including an evaluation library, in place of step 3.

Once built and installed, your D-ISAM framework may be imported into any project by adding the installation directory to Framework Search Paths under Search Paths in Build Options, and optionally, if your installation employs rpath, to Runpath Search Paths under Linking.

Installation is not required if all of your application projects share the same build directory as your D-ISAM framework.

See Creating a Framework and Installing your Framework for the full details.

D-ISAM can also be linked directly into an application by means of the Bridging Header.

This file should include the disam header(s) of your choice.

You may simply add the disam headers directly to your project, or add the disam header directory to the list of User Header Search Paths, in your project Build Settings under Search Paths, in which case you should also set Always Search User Paths to Yes.

You can now copy or link your disam source files directly into your project, or copy or link an existing disam library – including an evaluation library.

You may also wish to see Building D-ISAM in Xcode from the command line.

Apple Swift and D-ISAM
frasi per far innamorare una ragazza yahoo
alla dejtingsidor på samma ställe webbkryss
dejta 2 killar samtidigt engelska
frasi divertenti per far innamorare una ragazza
dejtingsida kultur ordbok
rencontre plage corse
hjälp med dejting profil centerpartiet
site de rencontre gratuit non payant gard
dejting i norrköping yr
rencontres investisseurs
site de rencontres facebook
federation espaces rencontres
rencontres à elizabethtown videobb
dejta vän harvey
cerco uomo milano
lieux de rencontres drome
chatroom america online
första dejten restaurang göteborg
rencontre la plaine sur mer
donna cerca uomo avellino
dejtingsajt för unga under 18 malmö
site de rencontre uniquement francais
rencontre homme geneve
incontri donne a foggia
prostituee saint gaudens
partnervermittlung yahoo es
dejta i mobilen gratis
dejtat 2 månader engelska
site rencontre gratuit royan
chat gratis libera
nätdejting ligga orensad
rencontre sur badoo ouahigouya
rencontres montigny l es metz
dejtingsajter gifta män
kostenlos chat erstellen
site de rencontre bio
dejt vad göra
partnersuche aus dem osten
bernard heidsieck respirations et brèves rencontres
blog rencontre ado
sito gratuito di incontri
användarnamn på dejtingsida exempel
incontri donna brescia
single 50 plus treff zschopau
dejtingsajter happy pancake erfarenheter
site de rencontre hommes grecs
super rencontre site gratuit
singel dejting se flashback query
svt play dejtingprogram
scene de rencontre roman
rencontre femmes les lilas
comment contacter le site de rencontre tiilt
free doctor chat room online
site de rencontre gratuit non payant belgique
toutou rencontre
dejta vän unibet
club rencontre reims
dejtingsidor för unga
dejta 2 st samtidigt chords
partnersuche tschechische republik geschwindigkeitsbegrenzung
dejtingsajt albaner toni
nätdejting eller inte alls
sexe elancourt
gratis dejtingsidor för unga ut
rencontre sportive pau
meet singles over 40 toronto
dejtingsajter i norge
incontri single brescia
incontri per adulti a bari
gratis dejting sida word
incontro a palermo
dejtingapp utan facebook
studenten singlebörse heidelberg
nätdejting inget för mig nu
dejta chilenare skämt
nätdejting svd nyheter
funkar internet dejting råd
done per fare amore
dejtingsajter forum danmark
sito on line gratis
chat online free anonymous
rencontre sportive toulouse
quelle est la vitesse maximale dans une zone de rencontre
gay dating site in london
rencontre homme saoudien
rencontres racines audincourt 2012
partnersuche kiel umgebung
dejting annonser gratis
dejta 4 månader mat
un automobiliste rencontre sur son trajet
are there any legitimate casual dating sites

Makefile for D-ISAM dynamic library in Xcode

This makefile differs from a static build in the following ways:

The library filename extension is .dylib

-fPIC is added to compiler flags.

-dynamiclib is added to linker flags.

INSTALL_NAME is set to the full destination path and name of the library, as finally installed.

Without setting install_name it would be necessary to link the library directly into the install folder, or to use the install_name_tool to set this value later. The Xcode linker refers to this value when setting the library load path in your applications.

Please see Building D-ISAM in Xcode from the command line for more details.

# ------------------------------------------------------------------------
# DISAM                                                           MAKEFILE 
# ------------------------------------------------------------------------
# this version is designed to operate from your disam root folder,
# and does NOT require moving everything into a common folder
# ------------------------------------------------------------------------

INSTALL_NAME = /Library/Disam72/libdisam72.dylib

ISLIBNAME = disam72
ISLIBWHAT = shared

# ------------------------------------------------------------------------

ISINCLUDE = -Ihead -Ibase -Idecs -Iutil -Itest -Iexport


WHERE= target/$(NAME)_$(WHAT)

ISAM = $(WHERE)/lib/lib$(NAME)



BASE =	base/isaccess.o \
	base/isapface.o \
	base/isremote.o \
	base/isadmin.o \
	base/isaudit.o \
	base/isbuild.o \
	base/ischeck.o \
	base/isclustr.o \
	base/iscomp.o \
	base/iscustom.o \
	base/isdatio.o \
	base/isdelete.o \
	base/isentry.o \
	base/iserase.o \
	base/isfree.o \
	base/isglobal.o \
	base/isgrow.o \
	base/ishead.o \
	base/isidxdel.o \
	base/isidxio.o \
	base/isindex.o \
	base/isinfo.o \
	base/iskey.o \
	base/islast.o \
	base/islocate.o \
	base/islock.o \
	base/ismemory.o \
	base/ismif.o \
	base/isnode.o \
	base/isopen.o \
	base/ispath.o \
	base/isprune.o \
	base/isread.o \
	base/isrepair.o \
	base/issquash.o \
       	base/isbytes.o \
	base/isdebug.o \
	base/issystem.o \
	base/isnetsys.o \
	base/isschema.o \
	base/istrans.o \
	base/istree.o \
	base/isunique.o \
	base/isupdate.o \
	base/isvarlen.o \

WRAP =	wrap/stdbuild.o \
	wrap/stdcheck.o \
	wrap/stdextra.o \
	wrap/stdinfo.o \
	wrap/stdlast.o \
	wrap/stdlock.o \
	wrap/stdmif.o \
	wrap/stdread.o \
	wrap/stdtrans.o \
	wrap/stdwrap.o \

DECS = 	decs/dec_roun.o \
	decs/decadd.o \
	decs/deccmp.o \
	decs/decconv.o \
	decs/deccvasc.o \
	decs/decdiv.o \
	decs/dececvt.o \
	decs/decefcvt.o \
	decs/decextra.o \
	decs/decfcvt.o \
	decs/decmul.o \
	decs/decsub.o \

CL = $(CC) $(LFLG) -L$(WHERE)/lib
AR = ar 
# RANLIB = $(AR) ts
RANLIB = ranlib

	$(CO) -c $*.c -o $*.o

$(ISAM).a:	$(BASE) $(WRAP) $(DECS)
	$(AR) r $(ISAM).$(TYPE) $(BASE) $(WRAP) $(DECS)

$(ISAM).dylib:	$(BASE) $(WRAP) $(DECS)
	$(CO) -dynamiclib $(BASE) $(WRAP) $(DECS) -o $(ISAM).$(TYPE) -install_name $(INSTALL_NAME)

lib:	$(ISAM).$(TYPE)

test_A:	test/bench.o test/auto.o test/mult.o test/user.o test/lock.o test/dups.o
	$(CL) test/auto.o test/bench.o $(LIBS) -o $(WHERE)/bin/auto_test
	$(CL) test/mult.o test/bench.o $(LIBS) -o $(WHERE)/bin/mult_test
	$(CL) test/user.o test/bench.o $(LIBS) -o $(WHERE)/bin/user_test
	$(CL) test/lock.o test/bench.o $(LIBS) -o $(WHERE)/bin/lock_test
	$(CL) test/dups.o test/bench.o $(LIBS) -o $(WHERE)/bin/dups_test

test_B:	test/mifs.o test/bash.o test/life.o
	$(CL) test/mifs.o              $(LIBS) -o $(WHERE)/bin/mifs_test
	$(CL) test/bash.o              $(LIBS) -o $(WHERE)/bin/bash_test
	$(CL) test/life.o              $(LIBS) -o $(WHERE)/bin/life_test

test:	test_A test_B

util_base: util/utility.o util/dcheck.o util/dstats.o util/dpack.o util/dbugscan.o
	$(CL) util/dcheck.o	util/utility.o	$(LIBS) -o $(WHERE)/bin/dcheck
	$(CL) util/dstats.o	util/utility.o	$(LIBS) -o $(WHERE)/bin/dstats
	$(CL) util/dpack.o	util/utility.o	$(LIBS) -o $(WHERE)/bin/dpack
	$(CL) util/dbugscan.o	                $(LIBS) -o $(WHERE)/bin/dbugscan

util_core: util/dsplit.o util/dlist.o util/dschema.o
	$(CL) util/dsplit.o	util/utility.o	$(LIBS) -o $(WHERE)/bin/dsplit
	$(CL) util/dlist.o	util/utility.o	$(LIBS) -o $(WHERE)/bin/dlist
	$(CL) util/dschema.o	util/utility.o	$(LIBS) -o $(WHERE)/bin/dschema

remote: util/disamnet.o util/dswabnet.o
	$(CL) util/disamnet.o	$(LIBS) -o $(WHERE)/bin/disamnet
	$(CL) util/dswabnet.o	$(LIBS) -o $(WHERE)/bin/dswabnet

util:	util_base util_core

export:	export/isreport.o export/isfield.o export/isload.o export/dreport.o
	$(CL) export/isreport.o export/isfield.o export/isload.o \
	      export/dreport.o $(LIBS) -o $(WHERE)/bin/dreport

check:  test
	$(WHERE)/bin/dcheck bashfile
	$(WHERE)/bin/dcheck autofile
	rm -f autofile.dat autofile.idx
	rm -f bashfile.idx bashfile.dat

parts: lib util test check export

	rm -rf target/*

	rm -rf base/*.o wrap/*.o decs/*.o test/*.o util/*.o export/*.o server/*.o

	rm -rf $(WHERE)
	mkdir -p $(WHERE)/lib $(WHERE)/bin
	cp head/isconfig.h $(WHERE)

all: squeaky clean new lib util test remote

Update for Constant Chars

This replaces D-ISAM head/isbase.h and includes an option to declare char * arguments as const, where this is appropriate.

In Xcode Swift this allows String types to be passed directly to D-ISAM, as a pointer to an immutable character array.

Without this change Swift will require that all C strings are copied to a writeable first, which is wasteful in cases like file pathnames and such, where D-ISAM only needs to read the string in.

To activate this option you must define ISCONSTCHAR when including this file, for example:

#include "isbase.h"

Download the update here.

isam base library header file

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * *
 * Worldwide Copyright (c) Byte Designs Ltd (2015) *
 * Version 7.2 (build 2015/03/10) (xcode) *
 * *
 * Byte Designs Ltd. *
 * 20568 - 32 Avenue *
 * V2Z 2C8 CANADA *
 * *
 * Sales: *
 * Support: *
 * Phone: (604) 534 0722 Fax: (604) 534 2601 *
 * *
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

#include "isconfig.h" /* library configuration */
#include "isintstd.h" /* see read/stdint.ref */

#include <setjmp.h> /* error handling */
#include <stdarg.h> /* standard arguments */

/* note ----------------------------------------------------------- *
 the following is pulled from a common source in the disam master,
 and is *identical* from here through #endif ISAUTOLOCK below, in
 both isbase.h and iswrap.h
 ---------------------------------------------------------------- */

#ifndef ISAUTOLOCK /* avoid multiple inclusions */

/* structures ----------------------------------------------------- */

struct keypart /* key component description */
 short kp_start; /* offset within data record */
 short kp_leng; /* physical length */
 short kp_type; /* isam key type */

struct keydesc /* full key description */
 short k_flags; /* key characteristics */
 short k_nparts; /* number of parts in key */
 struct keypart k_part[ISMAXPARTS]; /* description of each part */
 short k_len; /* complete key length */
 uint32_t k_rootnode; /* root node record number */
struct dictinfo /* information about file */
 short di_nkeys; /* number of indexes */
 short di_curidx; /* current index number */
 short di_recsize; /* data record (max) length */
 short di_idxsize; /* index record block size */
 uint32_t di_nrecords; /* current record count */

struct audhead /* audit record header format */
 char au_type[2]; /* record type (aa/dd/rr/ww) */
 char au_time[4]; /* date and time */
#if( ISLONGID == 1 )
 char au_procid[4]; /* process id */
 char au_userid[4]; /* user id */
 char au_procid[2]; /* process id */
 char au_userid[2]; /* user id */
 char au_recnum[4]; /* record number */
 char au_reclen[2]; /* record length if variable */

#define AUDHEADSIZE 14

/* defines ------------------------------------------------------- */

/* file handling modes */

#define ISINPUT 0x00 /* input only */
#define ISOUTPUT 0x01 /* output only */
#define ISINOUT 0x02 /* input and output */
#define ISTRANS 0x04 /* transaction processing */
#define ISNOLOG 0x08 /* turn off logging */
#define ISFIXLEN 0x00 /* dummy */
#define ISVARLEN 0x10 /* variable length data */
#define ISVARCMP 0x30 /* compressed varlen */
#define ISSYNCWR 0x40 /* synchronous writes */
#define ISMASKED 0x80 /* masking active */
#define ISNOCARE 0x8000 /* set mode to match file */

/* locking methods */

#define ISRDONLY 0x100 /* read only - no locking */
#define ISAUTOLOCK 0x200 /* automatic lock on read */
#define ISMANULOCK 0x400 /* manual locking */
#define ISEXCLLOCK 0x800 /* exclusive access to file */
#if( SEMILOCK == 1 )
#define ISSEMILOCK 0x1000 /* C-ISAM compatible semi-lock */

/* key types */
#define CHARTYPE 0 /* array of bytes/characters */
#define DECIMALTYPE 0 /* handled as per char type */
#define INTTYPE 1 /* two byte (short) integer */
#define LONGTYPE 2 /* four byte (long) integer */
#define DOUBLETYPE 3 /* ieee double floating point */
#define FLOATTYPE 4 /* ieee single floating point */
#define MINTTYPE 5 /* machine (native) short */
#define MLONGTYPE 6 /* machine (native) long */
#define STRINGTYPE 7 /* null terminated byte string */

#define ISDESC 0x80 /* add for descending order */

/* key atomic sizes */

#define CHARSIZE 1
#define INTSIZE 2
#define LONGSIZE 4
#define DOUBLESIZE 8
#define FLOATSIZE 4
#define MINTSIZE 2
#define MLONGSIZE 4
#define STRINGSIZE 1

/* shortcuts for single part keys */

#define k_start k_part[0].kp_start
#define k_leng k_part[0].kp_leng
#define k_type k_part[0].kp_type


/* index management flags */

#define ISNODUPS 0x00 /* no duplicates permitted */
#define ISDUPS 0x01 /* duplicates permitted */
#define DCOMPRESS 0x02 /* compress duplicates */
#define LCOMPRESS 0x04 /* leading compression */
#define TCOMPRESS 0x08 /* trailing compression */
#define COMPRESS 0x0E /* full compression */
#define TNULL 0x10 /* compress trailing nulls */
#define NULLKEY 0x20 /* null key masking */

#define ISMASK(I) ( 1L << ((I)-1) ) /* index masking bit flags */

/* access control */

#define ISFIRST 0 /* first record */
#define ISLAST 1 /* last record */
#define ISNEXT 2 /* next record */
#define ISPREV 3 /* previous record */
#define ISCURR 4 /* current record */
#define ISEQUAL 5 /* find match */
#define ISGREAT 6 /* greater than current */
#define ISGTEQ 7 /* greater than or equal */

/* record locking */

#define ISLOCK 0x100 /* lock record or fail */
#if( ISCISAM != 0 )
# define ISSKIPLOCK 0x200 /* skip record if locked */
#define ISWAIT 0x400 /* wait until free */
#define ISLCKW 0x500 /* wait and lock */
#define ISKEEPLOCK 0x800 /* isstart keep lock */

/* audit trace control */

#define AUDSETNAME 0 /* set audit file name */
#define AUDGETNAME 1 /* get audit file name */
#define AUDSTART 2 /* begin audit logging */
#define AUDSTOP 3 /* stop audit logging */
#define AUDINFO 4 /* logging status */

#define USERINFOSIZE 10 /* userinfo pad size */

/* isam specific error codes (iserrno) */

#define EDUPL ( ISERRBASE + 0 ) /* illegal duplicate */
#define ENOTOPEN ( ISERRBASE + 1 ) /* file not open */
#define EBADARG ( ISERRBASE + 2 ) /* illegal argument */
#define EBADKEY ( ISERRBASE + 3 ) /* illegal key description */
#define ETOOMANY ( ISERRBASE + 4 ) /* out of isam file handles */
#define EBADFILE ( ISERRBASE + 5 ) /* isam file is corrupt */
#define ENOTEXCL ( ISERRBASE + 6 ) /* can't get exclusive access */
#define ELOCKED ( ISERRBASE + 7 ) /* record is locked */
#define EKEXISTS ( ISERRBASE + 8 ) /* index already defined */
#define EPRIMKEY ( ISERRBASE + 9 ) /* illegal primary key operation */
#define EENDFILE ( ISERRBASE + 10 ) /* start or end file reached */
#define ENOREC ( ISERRBASE + 11 ) /* record not found */
#define ENOCURR ( ISERRBASE + 12 ) /* no current record */
#define EFLOCKED ( ISERRBASE + 13 ) /* file is locked */
#define EFNAME ( ISERRBASE + 14 ) /* file name is too long */
#define ENOLOK ( ISERRBASE + 15 ) /* not used */
#define EBADMEM ( ISERRBASE + 16 ) /* can't allocate memory */
#define EBADCOLL ( ISERRBASE + 17 ) /* not used, see next */
#define EBADIO ( ISERRBASE + 17 ) /* trouble in IO */
#define ELOGREAD ( ISERRBASE + 18 ) /* error reading log file */
#define EBADLOG ( ISERRBASE + 19 ) /* log file is corrupt */
#define ELOGOPEN ( ISERRBASE + 20 ) /* unable to open log */
#define ELOGWRIT ( ISERRBASE + 21 ) /* unable to write log */
#define ENOTRANS ( ISERRBASE + 22 ) /* transaction not found */
#define ENOSHMEM ( ISERRBASE + 23 ) /* out of shared memory */
#define ENOBEGIN ( ISERRBASE + 24 ) /* no current transaction */
#define ENONFS ( ISERRBASE + 25 ) /* not used */
#define EBADROWID ( ISERRBASE + 26 ) /* not used */
#define ENOPRIM ( ISERRBASE + 27 ) /* no primary key */
#define ENOLOG ( ISERRBASE + 28 ) /* logging not allowed */
#define EUSER ( ISERRBASE + 29 ) /* too many users */
#define ENODBS ( ISERRBASE + 30 ) /* not used */
#define ENOFREE ( ISERRBASE + 31 ) /* not used */
#define EROWSIZE ( ISERRBASE + 32 ) /* varlen record too big */
#define EAUDIT ( ISERRBASE + 33 ) /* existing audit trail */
#define ENOLOCKS ( ISERRBASE + 34 ) /* out of room in lock table */
#define EEXPIRED ( ISERRBASE + 35 ) /* evaluation library has expired */
#define ENOCONNECT ( ISERRBASE + 36 ) /* no connect with remote server */
#define ENETORDER ( ISERRBASE + 37 ) /* server has wrong endian order */
#define EREPAIR ( ISERRBASE + 38 ) /* auto repair in progress */
#define EBADADDR ( ISERRBASE + 39 ) /* bad network address */
#define ENOSCHEMA ( ISERRBASE + 40 ) /* no schema defined */
#define EEXSCHEMA ( ISERRBASE + 41 ) /* schema already defined */
#define ENOTAVAIL ( ISERRBASE + 42 ) /* remote function not available */

/* on system error - iserrio = IO_call + IO_file */

#define IO_OPEN 0x10 /* open */
#define IO_CREA 0x20 /* create */
#define IO_SEEK 0x30 /* seek */
#define IO_READ 0x40 /* read */
#define IO_WRIT 0x50 /* write */
#define IO_LOCK 0x60 /* lock */
#define IO_OTHER 0x70 /* other */

#define IO_IDX 0x01 /* index file */
#define IO_DAT 0x02 /* data file */
#define IO_AUD 0x03 /* audit trace */
#define IO_RAW 0x04 /* any other file */
#define IO_REP 0x05 /* auto repair file */
#define IO_LOG 0x06 /* transaction log */
#define IO_LCK 0x07 /* offline lock file */

#define IO_LOK 0x04 /* cisam, not used */
#define IO_SEM 0x05 /* cisam, not used */

/* cobol isstat4 values --------------------------------------------*/

#define STATNULL ' ' /* empty isstat4 value */
#define STAT1 '1'
#define STAT2 '2'
#define STAT3 '3'
#define STAT4 '4'
#define STAT5 '5'
#define STAT6 '6'
#define STAT7 '7'
#define STAT8 '8'
#define STAT9 '9'
#define STAT0 '0'

/* self check facility ------------------------------------------- */

#define IC_DATREAD 0 /* data file read error */
#define IC_BADDATA 1 /* data record corrupt */
#define IC_DATFREE 2 /* data free list is corrupt */

#define IC_IDXREAD 3 /* index file read error */
#define IC_ORDER 4 /* key out of order */
#define IC_COUNT 5 /* index count mismatch */
#define IC_BADMAGIC 6 /* bad index node magic number */
#define IC_MATCH 7 /* index/data mismatch */
#define IC_SANITY 8 /* compiler sanity check */
#define IC_DUPSEQ 9 /* bad duplicate sequence */


#define IC_VLHASHZERO 11 /* hash table zero loaded */
#define IC_VLMISFILE 12 /* node misfiled in hash table */
#define IC_VLHASHLINK 13 /* mangled link in hash list */
#define IC_VLMISSING 14 /* nodes missing or unaccounted */
#define IC_VLBADDATA 15 /* data length mismatch */
struct IsVarStat /* variable length statistics */
 uint32_t hashcount;
 uint32_t hashspace;
 uint32_t fullcount;
 uint32_t fullspace;
 uint32_t filecount;
 uint32_t filespace;

#endif /*ISAUTOLOCK*/

/* ---------------------------------------------------------------- *
 above is pulled from common source, see #ifdef ISAUTOLOCK above.
 ---------------------------------------------------------------- */

/* useful defines ----------------------------------------------- */

#define ISTRUE 1
#define ISFALSE 0

/* convenient shortcuts ----------------------------------------- */

typedef struct IsamFile IsFile;
typedef struct keydesc IsKdsc;
typedef struct keypart IsKprt;

#if( defined ISINTERNAL || defined ISDANGEROUS )

/* base library internal definitions ----------------------------- */

#define TRUE 1
#define FALSE 0

#define SETBIT( F, O ) ( F | ( 1 << ( O ) ) )
#define UNSBIT( F, O ) ( F & ~( 1 << ( O ) ) )
#define BITSET( F, O ) ( F & ( 1 << ( O ) ) )

#define ISREALLOC(S,P,O,N) ( struct S * )is_realloc( ( char * )P, O, N )
#define ISALLOC(S) ( struct S * )is_malloc( sizeof( struct S ) )
#define ISFREE(S,P) ( struct S * )is_free( ( char * )P )

#define ISNODEMAX ( isam->idxlen - 4 )

#define ISFAIL(I,M) ( ! isEntry( I, M ) || setjmp( I->trap ) )
#define ISFATAL is_fatal( "fatal isam error %s(%d)", __FILE__, __LINE__ )

/* path handling ------------------------------------------------- */

#define ISAMPRIME(I) ( (I)->maxidx ? (I)->path[0]->kdsc : NULL )
#define ISAMINDEX(I) ( ( (I)->curidx < (I)->maxidx ) ? (I)->path[(I)->curidx]->kdsc : NULL )

/* to be deprecated */
#define ISPATH ( isam->path[isam->curidx] )
#define ISKDSC ( isam->path[isam->curidx]->kdsc )

#define ISTAIL ( ISPATH->tail )
#define TAIL path->tail

#define ISEMPTY(P) ( P->tail->used == 2 )

/* specialised machine independant integers ---------------------- */

#define LDRECD(P) ( ldMint( P, 4 ) & 0x7FFFFFFFL )
#define LDDUP(P,L) ( ldMint( P, L ) )
#define STDUP(P,L,D) ( stMint( P, L, D ) )

/* structure specific flags and state values --------------------- */

#define ISREALFILE 0 /* stored on file system */
#define ISIPSOCKET 1 /* mounted on network socket */
#define ISNAMEPIPE 2 /* mounted on named pipe */
#define ISEXECPIPE 3 /* mounted on process pipe */

/* IsamFile - bit flags */
#define ISNOPRIM 0 /* primary is natural order */
#define ISNOTNEXT 1 /* read/start next dislocate */
#define ISNOTPREV 2 /* read/start prev dislocate */
#define ISWRLOCK 3 /* lock records on write */
#define ISPRECIOUS 4 /* do not reuse data slots */
#define ISLOCKCHECK 5 /* check locked on update/delete */
#define ISNOCURRENT 6 /* current is not viable */
#define ISLOGDEFER 7 /* open/close deferred logging */

/* IsamNode - state values */
#define ISNDREF 0 /* image must be refreshed */
#define ISNDOK 1 /* image is current */
#define ISNDUPD 2 /* image has been updated */

/* index file records -------------------------------------------- */

struct IsamNode /* index file record */
 struct IsamNode *prev; /* parent node */
 struct IsamNode *split; /* sibling */

 uint32_t idxrec; /* idx file record number */
 char *image; /* disk image */
 char state; /* current status */
 int used; /* number of bytes used */
 int level; /* zero is leaf node */
 int keyoff; /* current key offset */
 int keyend; /* end of compressed key */
 uint32_t recnum; /* current record number */
 uint32_t dupnum; /* current duplicate number */
 char *keyval; /* key contents */

/* schema/record layout ------------------------------------------ */

struct IsamRec
 char *image; /* current node image */
 uint32_t root; /* root recnum */
 uint32_t last; /* last recnum */

/* index handling ------------------------------------------------ */

struct IsamPath /* index details */
 struct keydesc *kdsc; /* key description */
 struct IsamNode *tail; /* current path tail */
 struct IsamNode *buf[ISMAXBUF]; /* buffering system */
 int slotlen; /* key slot length */
 int duplen; /* valid if dups */
 int partial; /* active partial length */
 char current[ISMAXKEY]; /* current key value */
 uint32_t recnum; /* current record number */
 uint32_t dupnum; /* current dupnum i/a */
 int cmplen; /* current compare */
 char flags; /* bit flags */

/* free list control structure ----------------------------------- */

struct IsamFree
 char *image; /* index node image */
 char *split; /* hold for update */
 char state; /* update status */
 uint32_t root; /* list root record */
 uint32_t last; /* last used recnum */
 int used; /* bytes used in node */

/* typedefs */

typedef struct IsamPath IsPath;
typedef struct IsamNode IsNode;
typedef struct IsamFree IsFree;


/* isam file descriptor ------------------------------------------ */

struct IsamFile /* isam file description */
 /* IO block HEAD - this structure matches on all sources */

 char *name; /* isam path and name */
 char where; /* source switch case */

#if( ISADMIN )
 int admid; /* admin table offset */

 /* IO block DATA - openmode through maxlen, should not change */

 int openmode; /* open mode bit flags */

 int idxlen; /* index node size */
 int duplen; /* duplicate sequence width */
 int maxidx; /* number of indexes */
 int curidx; /* current index number */
 uint32_t mask; /* index masking bit array */

 uint32_t isrecnum; /* current record number */
 int isreclen; /* current record length */
 int iserrno; /* failure code */
 int iserrio; /* what and where */

 int datlen; /* data record length */
 int datblk; /* data file record block */
 int maxlen; /* variable length max */

#if( ISMFCOBOL > 0 )
 char isstat1; /* cobol status variables */
 char isstat2;
 char isstat3;
 char isstat4;

 int32_t ispid; /* pid of blocking lock */
 /* IO block END, remainder is local and specific to source */

#if( defined ISINTERNAL || defined ISDANGEROUS )

 int flags; /* all internal bit flags */

 int datfd; /* data file handle */
 int idxfd; /* index file handle */

 int ( *rdfilter )( int, char *, int );/* read filtering callback */

 uint32_t natcurr; /* natural order current */

 uint32_t kdsc; /* key desc list root node */
 uint32_t delta; /* concurrency control */
 uint32_t unique; /* unique id value */

 struct IsamPath *path[ISMAXIDX]; /* active path array */

 struct IsamFree idxfree; /* index free list */
 struct IsamFree datfree; /* data free list */
 struct IsamRec schema; /* schema pointers */

 uint32_t *lklist; /* list of record locks */
 uint32_t lkllen; /* current list length */
 char lkstate; /* locking state flags */
 char *image; /* header record image */
 char *data; /* current data image */
 int workmode; /* reading or writing */
 jmp_buf trap; /* longjump trap point */

#if( ISAUDIT )
 uint32_t audit; /* audit control node */
 char audinfo[69]; /* allocated info block */
 int audfd; /* trace file handle */
 int txnpid; /* transaction process id */
 int txnfile; /* transaction file id */
 uint32_t *hashtab; /* hash table array */
 char *varnode; /* varlen node image */
 char hashload; /* refresh flag */
 char *vcbuf; /* vl compression temp buffer */
 int vclen; /* vl compression temp length */

#if( ISVARIABLE > 1 ) 
 uint32_t hashrecd; /* hash table record */
 char *hashnode; /* hash table image */

#if( ISLOCKING == 3 )
 int lokfd; /* lock file handle */
 int32_t lokid; /* unique locking id */
#if( ISLKINFO == 1 )
 char *lockinfo; /* lock information block */
 int gotmtseek;
 int gotmtread;
 int gotmtlock;
 int gotmtwrite;
 int gotmtmast;


/* custom details ------------------------------------------------ */

#if( ISCUSTOM == 1 )
# include <iscustom.h>

/* entry function prototypes ------------------------------------- */

# define ISD3(s) s
# define ISD3(s) ()

# define ISDD void
# define ISDD char

# define ISCC const char
# define ISCC char

#if( ISDYNAMIC == 0 || ISDYNAMIC == 3 || ISDYNAMIC == 4 )
# if( defined ISINTERNAL )
# define ISD1 
# else
# define ISD1 extern
# endif
# define ISD2

#if( ISDYNAMIC == 1 )
# if( defined ISINTERNAL )
# define ISD1
# define ISD2 __far __pascal __export
# else
# define ISD1 extern
# define ISD2 __far __pascal
# endif

#if( ISDYNAMIC == 2 )
# if( defined ISINTERNAL )
# define ISD1 __declspec( dllexport )
# else
# define ISD1 __declspec( dllimport )
# endif
# define ISD2

#ifdef __cplusplus
extern "C" {

#if( ! defined ISINTERNAL )
# if( ISDYNAMIC < 3 )
# ifdef ISEXPIRE
ISD1 ISCC * ISD2 isevaluation;
# endif
ISD1 ISCC * ISD2 isversnumber;
ISD1 ISCC * ISD2 isverstring;
ISD1 ISCC * ISD2 iscopyright;
ISD1 int ISD2 is_nerr;
ISD1 ISCC * ISD2 is_errlist[43];
ISD1 ISCC * ISD2 isCheckMsg[16];
# endif

ISD1 int ISD2 isLock ISD3((IsFile *isam));
ISD1 int ISD2 isUnLock ISD3((IsFile *isam));
ISD1 int ISD2 isRelease ISD3((IsFile *isam));
ISD1 int ISD2 isRelRec ISD3((IsFile *isam, uint32_t recnum));
ISD1 int ISD2 isRelCurr ISD3((IsFile *isam));

ISD1 int ISD2 isThreaded ISD3((void));
ISD1 int ISD2 isThreadedDone ISD3((void));
ISD1 int ISD2 isAdmDtoI ISD3((IsFile *isam));
ISD1 IsFile * ISD2 isAdmItoD ISD3((int id));
ISD1 int ISD2 isCleanUp ISD3((void));
ISD1 int ISD2 isRemoteFree ISD3((void));
ISD1 IsFile * ISD2 isAdmTxnLast ISD3((void));

ISD1 IsFile * ISD2 isBuild ISD3((ISCC *name, int dlen, int mlen, IsKdsc *kdsc, int mode));
ISD1 int ISD2 isPrecious ISD3((IsFile *isam, int flag));
ISD1 int ISD2 isAddIndex ISD3((IsFile *isam, IsKdsc *kdsc));
ISD1 int ISD2 isUserInfo ISD3((IsFile *isam, int mode, char *pad));

ISD1 int ISD2 isDelete ISD3((IsFile *isam, ISDD *pad));
ISD1 int ISD2 isDelCurr ISD3((IsFile *isam));
ISD1 int ISD2 isDelRec ISD3((IsFile *isam, uint32_t recnum));

ISD1 int ISD2 isErase ISD3((ISCC *name));
ISD1 int ISD2 isRename ISD3((ISCC *oname, ISCC *nname));

ISD1 int ISD2 isDelIndex ISD3((IsFile *isam, IsKdsc *kdsc));

ISD1 int ISD2 isIndexInfo ISD3((IsFile *isam, IsKdsc *kdsc, int idx));
ISD1 int ISD2 isIsamInfo ISD3((IsFile *isam, struct dictinfo *dict));

ISD1 int ISD2 isErrno ISD3((IsFile *isam));
ISD1 int ISD2 isErrio ISD3((IsFile *isam));
ISD1 int ISD2 isCount ISD3((IsFile *isam));
ISD1 int ISD2 isRecnum ISD3((IsFile *isam));
ISD1 int ISD2 isReclen ISD3((IsFile *isam));
ISD1 int ISD2 isSetrec ISD3((IsFile *isam, uint32_t recnum));
ISD1 int ISD2 isSetlen ISD3((IsFile *isam, short reclen));

ISD1 IsFile * ISD2 isOpen ISD3((ISCC *name, int mode));
ISD1 int ISD2 isClose ISD3((IsFile *isam));
ISD1 int ISD2 isLockCheck ISD3((IsFile *isam, int flag));
ISD1 int ISD2 isSetMode ISD3((IsFile *isam, int mode));

ISD1 IsFile * ISD2 isCluster ISD3((IsFile *isam, IsKdsc *kdsc));
ISD1 IsFile * ISD2 isClone ISD3((IsFile *isam, ISCC *name ));
ISD1 int ISD2 isCopy ISD3((IsFile *dest, IsFile *source, IsKdsc *kdsc));

ISD1 int ISD2 isRead ISD3((IsFile *isam, ISDD *pad, int mode));
ISD1 int ISD2 isStart ISD3((IsFile *isam, IsKdsc *key, int len, ISDD *pad, int mode));
ISD1 int ISD2 isIndex ISD3((IsFile *isam, int idx));
ISD1 int ISD2 isGoto ISD3((IsFile *isam, uint32_t recnum));
ISD1 int ISD2 isPush ISD3((IsFile *isam, int *idx, uint32_t *rec));
ISD1 int ISD2 isPop ISD3((IsFile *isam, int idx, uint32_t rec));
ISD1 int ISD2 isData ISD3((IsFile *isam, ISDD *pad, uint32_t recnum));

ISD1 int ISD2 isLdSchema ISD3((IsFile *isam, ISCC *path));
ISD1 int ISD2 isDpSchema ISD3((IsFile *isam));
ISD1 int ISD2 isStSchema ISD3((IsFile *isam, ISCC *loadfile));
ISD1 int ISD2 isRmSchema ISD3((IsFile *isam));

ISD1 int ISD2 isSetUnique ISD3((IsFile *isam, uint32_t value));
ISD1 int ISD2 isUniqueId ISD3((IsFile *isam, uint32_t *dest));

ISD1 int ISD2 isGetLastRec ISD3((IsFile *isam, uint32_t *last));
ISD1 int ISD2 isSetLastRec ISD3((IsFile *isam, uint32_t last));
ISD1 int ISD2 isLastRec ISD3((IsFile *isam, uint32_t *last));

ISD1 int ISD2 isRewrite ISD3((IsFile *isam, ISDD *newpad));
ISD1 int ISD2 isRewCurr ISD3((IsFile *isam, ISDD *newpad));
ISD1 int ISD2 isRewRec ISD3((IsFile *isam, uint32_t recnum, ISDD *newpad));
ISD1 int ISD2 isRewNxt ISD3((IsFile *isam, ISDD *newpad));

ISD1 int ISD2 isWrite ISD3((IsFile *isam, ISDD *pad));
ISD1 int ISD2 isWrLock ISD3((IsFile *isam, ISDD *pad));
ISD1 int ISD2 isWrCurr ISD3((IsFile *isam, ISDD *pad));

ISD1 int ISD2 isAudit ISD3((IsFile *isam, char *pad, int mode));

ISD1 int ISD2 isTxnInit ISD3((short ( *call )(void) ));
ISD1 int ISD2 isLogOpen ISD3((ISCC *name));
ISD1 int ISD2 isLogClose ISD3((void));
ISD1 int ISD2 isBegin ISD3((void));
ISD1 int ISD2 isCommit ISD3((void));
ISD1 int ISD2 isRollBack ISD3((void));
ISD1 int ISD2 isRecover ISD3((void));
ISD1 int ISD2 isSuspLog ISD3((void));
ISD1 int ISD2 isResumLog ISD3((void));
ISD1 int ISD2 isTxnId ISD3((int value));

ISD1 uint32_t ISD2 isFreeCount ISD3((IsFile *isam, int which, int (*call )(char *node )));

ISD1 int ISD2 isAmSane ISD3((void));
ISD1 int ISD2 isCheckData ISD3((IsFile *isam));
ISD1 int ISD2 isCheckIndex ISD3((IsFile *isam, int idx));
ISD1 int ISD2 isRebuildFree ISD3((IsFile *isam, int which));
ISD1 int ISD2 isRebuildIdx ISD3((IsFile *isam, int idx));
ISD1 int ISD2 isCheckVarlen ISD3((IsFile *isam, struct IsVarStat *stats));

ISD1 void ISD2 isFatal ISD3((void(*call)(char *)));

ISD1 int ISD2 isStartUp ISD3((void));

ISD1 ISCC * ISD2 isSeeKey ISD3((int isfd));

ISD1 int64_t ISD2 ldHint ISD3((char *pad, int len));
ISD1 int ISD2 stHint ISD3((char *pad, int len, int64_t val));
ISD1 int32_t ISD2 ldMint ISD3((char *pad, int len));
ISD1 int ISD2 stMint ISD3((char *pad, int len, int32_t val));

ISD1 int ISD2 ldInt ISD3((char *pad));
ISD1 int ISD2 stInt ISD3((int value, char *pad));
ISD1 int32_t ISD2 ldLong ISD3((char *pad));
ISD1 int ISD2 stLong ISD3((int32_t value, char *pad));
ISD1 int ISD2 stChar ISD3((char *str, char *pad, int len));
ISD1 int ISD2 ldChar ISD3((char *pad, int len, char *str));
ISD1 float ISD2 ldFloat ISD3((char *pad)); 
ISD1 int ISD2 stFloat ISD3((float value, char *pad));
ISD1 double ISD2 ldDbl ISD3((char *pad)); 
ISD1 int ISD2 stDbl ISD3((double value, char *pad));
ISD1 int ISD2 stFltNull ISD3((float value, char *pad, short null));
ISD1 float ISD2 ldFltNull ISD3((char *pad, short *null));
ISD1 int ISD2 stDblNull ISD3((double value, char *pad, short null));
ISD1 double ISD2 ldDblNull ISD3((char *pad, short *null));

#if 0 /* deprecated, please contact Byte Designs if needed */
ISD1 int ISD2 stDate ISD3((Date *dest, char *src));
ISD1 char * ISD2 ldDate ISD3((char *dest, Date *src));
ISD1 int ISD2 stTime ISD3((Time *dest, char *src));
ISD1 char * ISD2 ldTime ISD3((char *dest, Time *src));

/* base/isdebug.c */
ISD1 const char * ISD2 isWhere ISD3(( int work ));
ISD1 const char * ISD2 isWhat ISD3(( int which ));
ISD1 void ISD2 isDebug ISD3(( IsFile *isam, int level, ISCC *fmt, ... ));
ISD1 void ISD2 isvDebug ISD3(( IsFile *isam, int level, ISCC *fmt, va_list ap ));
ISD1 void ISD2 isDebugAsc ISD3(( IsFile *isam, int level, ISCC *tag, ISCC *dat, int len ));
ISD1 void ISD2 isDebugHex ISD3(( IsFile *isam, int level, ISCC *tag, ISCC *dat, int len ));

#ifdef __cplusplus

#if( defined ISINTERNAL )
# undef ISD1
# undef ISD2
# undef ISD3
# undef ISDD

/* end header ---------------------------------------------------- */

Building a D-ISAM framework for Xcode

Note that this post covers the manual process of creating a framework – please refer to Building D-ISAM in the Xcode IDE for the integrated approach.

Before starting please see Update for Constant Chars.

To make a D-ISAM framework you must first create a public directory called (for example) Disam72.framework, and create a symbolic link in this directory named Disam72, which points to your D-ISAM dylib, as installed.

Note that the name of the framework and the name of the dylib pointer are the same. This defines the import name of your framework.

mkdir /Library/Disam72.dylib
cp target/disam72_shared/lib/libdisam72.dylib /Library/Disam72
ln -s /Library/Disam72/libdisam72.dylib /Library/Disam72/Disam72.framework/Disam72

You then need to create a Header directory inside Disam72.framework, containing your disam header files, together with an “umbrella” header to organise them – in this example it is named disam_xcode.h

/* disam umbrella header */
#define ISCONSTCHAR 1"
#import "isbase.h"

And finally, create a file called in Disam72.framework

framework module $DISAM [system] {
  umbrella header "disam_xcode.h"
  export *

The above presents a bare minimum of steps needed to create a framework that will import easily into Xcode and Swift.  However it leaves out quite a few details that are probably important, and which are generally included automatically when Building D-ISAM in the Xcode IDE.

The whole process is documented in Guidelines for Creating Frameworks.

Python and D-ISAM

date hate app
gratis natdejting norge quiz
new site de rencontre gratuit
free sites like chatroulette
rencontres amoureuses 06
dejtingapp utan facebook
top 100 single charts germany 2015
latest free european dating sites
joyeux anniversaire de rencontre mon amour
lieu de rencontre bruxelles
dejting for unga under 18 oktober
gratis dejtingsidor 2015 vecka
women's christian chat
dejtingsida utan medlemskap pris
dejtingsida for unga under 18
cerco uomo da sposare
storsta dejtingsajt badoo
kinderhotel osterreich single mit kind
bra dejtingsajt badoo
new music singles march 2015
site de rencontre serieuse gratuit
msn dejting se telefonnummer
annunci donne cerca uomo roma
watch movies online free blind dating
rencontre sexe bethune
vilken dejtingsajt ar bast film
rencontre sobre
rencontres if insa lyon
conjuguer se rencontrer
facebook smiley chat codes 2013
site rencontre ado toulouse
donne incontri sassari
jetzt spielen kostenlos ohne anmeldung
incontri senza iscrizioni
incontri a torino
incontro tifosi napoli borussia
dejting handikapp cykel
natdejting undersokning fragor
free online dating sites ireland
dejta 16 aring ha
annunci donna bari
partnersuche deutschlandsberg
roma incontri donne
free dating service in orlando fl
catholic singles las vegas nv
natdejting exempel cv
natdejting bra eller daligt batteri
rencontre en ligne film complet
neue email adresse kostenlos hotmail
best things to do in san diego for adults
nigerian christian singles dating site
pour tes beaux yeux site de rencontre
best dating sites christian
online dating rituals of the american male imdb
catania donna adulti
donna orientale cerca uomo torino
online dating writing email
free dating site in zambia
ragazze in chat gratis senza registrazione
donna cerca uomo roma
dejt 6
dejtingsidor vanner youtube
rencontres ecolo
most popular online dating uk
dejta asiatiska kvinnor i sverige
dejtingsidor kk forhallande
siti per incontrare ragazze di 15 anni
site de rencontre palestine
free international voice chat rooms
top dejtingsidor
natdejting motesplatsen mobile
dejtingsidor for under 18
dating sites for australian singles
roliga aktiviteter date
siti x singles
jeu 3d rencontres
prostitute rape survivors stories/articles
donne cerca donne
dejt i helsingborg
rencontre entre solitaire
match date for prom
dejtingsida for ensamstaende
cerco donna per coppia
site rencontre seniors
donne single chat gratis
natdejting bocker immobilien
rencontre dans un hotel
trovare anima gemella gratis
annonces algerie rencontres
feuerflamme de partnersuche
sito dating gratuito
date book definition
juegos gratis de encontrar objetos ocultos para adultos
free dating in peterborough
peut on stationner dans une zone de rencontre
m6 replay zita dans la peau d’une prostituee
how do i turn off facebook chat on my mobile
comparis kostenlos inserieren
rencontres pour l’emploi perpignan
online dating italia
test singleborsen kostenlos xp
incontri per adulti gallarate
donne sfigate amore
rencontrer tiken jah fakoly
partnersuche friendscout24 testen
rencontre lac de saint cassien
beatrice doyenne des prostituees de nancy
rencontres femmes dans la drome
russian dating websites free
natdejting 20 ar oskuld
chat dating schweiz
online partnervermittlung kostenlos fur frauen
maison jeunes cafe rencontre
chat gratis piu usate
dejting passagen berlin
rencontre sidi bouzid
rencontres internationales mort imminente
dejta via telefon tips
single charts top 100 januar 2013
chattare senza registrazione gratis
les rencontres d’arles affiche
rencontre ski
lycee agricole la lande de la rencontre
dejt i stockholm quality
chat room christian singles
gay dating site new zealand
site de rencontre chou
rencontre entre beaux parents
skriva profil pa dejtingsida
waplog chat dating meet friend
dejta en kandis dod
je hate de vous rencontrer
facebook single kassel
dejtingsida usa chords
skapa egen dejtingsida exempel
date ios 7 release
meet singles in dar es salaam
dejta killar i usa
rencontre deja en couple
dejtingsidor for gifta personer
siti per incontri gratuiti
dejting tv program svt
dejta en nyskild man
dejtingsajter for unga gratis ziehen
gratis dejtingsajter sverige se
chat gratis buenos aires mayores de 40
dejta en kille med barn
natdejting 20 ar brollop
rencontre femme arras
dejting gavle jobb
singles aus der umgebung kennenlernen
femme belfort
dejtingsida asiater vitser
prostituees calais
donne brescia bakeca
dejtingsidor stockholm
donne ravenna incontri
meet agen
luoghi di incontro per single ladies
chats apps iphone
bakeca annunci alessandria
incontri donna foggia
faire des rencontres sur chatroulette
fare l amore in gravidanza al nono mese
site de rencontre en belgique sans abonnement
russia free dating site
come si fa l amore da dietro
windows a rencontre un probleme de disque dur
dejtingsajt anvandarnamn
siti gratuiti di incontri
dejtingsidor ligga ordsprak
dejt 60 lander
singleborsen online
donne cerca uomo monza
siti di incontro online gratis senza registrazione online
fare un sito web
katzen kostenlos registrieren
incontri con cougar
prostituees ouaga rencontres
what is online speed dating
rencontre internationale de lurs
free online best chat room in india
top 5 sites rencontre
rencontres dans le tarn
natdejting 2013 creteil
basta dejtingsidan flashback konto
dimenticare un amore finito frasi
rencontre thoissey
rencontre femme aulnoye aymeries
dejta justin bieber spel online
svenska dejting appar xperia
welche partnerborse ist am besten ausgebaut
chat on line gratis
rencontre ligne 4
giorgio nardone gli errori delle donne in amore libro
best places to live in los angeles for singles
what's the best free dating site besides pof
dejt tips hora av sig
sites de rencontres gratuits en corse
femme saint lo
grille de rencontre
comment rencontrer sarko et zelko
online avatar chat games
free dating site in glasgow
dejtingsidor for bonder praster
dejting appar gratis yrkesutbildningar
meilleur site de rencontre smartphone
kann man zwei frauen gleich lieben
rencontre francophone toronto
siti di incontro gratis senza registrazione kindle
senioren singleborsen
la rencontre jean francois maurice & maryse tlumaczenie
cerco ragazza italiana
innamorarsi di un uomo divorziato con figli
dejtat i 3 manader
natdejting samtalsamnen middag
internationale singleborsen vergleich
incontrare donne straniere in italia
si puo fare l amore al primo mese di gravidanza
rencontre tarifee quimper
dejting pa internet otrohet
victor reny rencontres
la belle rencontre male
dejtingsidor happypancake norge
kann man zwei frauen gleichzeitig lieben
quando si e incinta si ha voglia di fare l amore
dejtingsajt for funktionshindrade stockholm
dejtingsajt anvandarnamn router
annuaire site de rencontre gratuit
miglior sito per conoscere ragazze
rencontre musicale savoie
dejtingsida for raggare lyrics
sito di chat
dejta natet billigt
free online dating sites sydney
rencontre comorienne france
site de rencontre totalement gratuit 2013
komplett kostenlos frauen kennenlernen
annunci per adulti massa carrara orari
prostituees sur autoroute
free web based chat programs
amore di
online girl dating sim games
gand belgique prostituee
gunstige reisen fur single mit kind
dejta 4 manader utveckling
annunci personali a novara
la rencontre imprevue libretto
rencontre serieuse maurice
incontri annunci milano
meilleur site rencontre payant
online christian dating sites in kenya
dejta lange jobba
natdejting beroende
partnersuche de app beenden
chat amore senza registrazione marchio
free live phone chat singles
bakeca annunci adulti
helt gratis date
quali sono le migliori chatroulette per adulti
dejtingsajt etnisk kjole
dejtingsajt kriminella politiker
dejtingsajt 50 plus beurs
tuttoannunci donna cerca uomo
best online dating websites usa
rencontres hommes nice
rysk dejtingsida
siti per incontrare ragazzi gratis
seriosa dejtingsidor gratis ziehen
rekommenderade dejtingsajter flashback
dating app iphone kostenlos
dejta bisexuell outing
meet indian singles nyc
judiska dejtingsajter finland
match date range vba
site de rencontre par geolocalisation
date app hong kong
bakeca annunci ravenna
dejting 18 ar dikt
nanna johansson natdejting flashback
lieu de rencontre toulouse
bravo online dating marcus
uomo cerca donna udine
prostituee a aix
gratis dejting telefon
site de rencontres dans les ardennes
dejting appar till iphone
citation nouvelle rencontre amitie
come incontrare donne russe
best free online dating sites 2014
nya dejting appar
donne roma incontri
hotel des rencontres severes pdf
siti di incontro online gratis senza registrazione
blois rencontres
site de rencontre love de toi
uomo cerca donne
greek singles dating melbourne
over 50 singles holidays
chat incontriamoci senza registrazione kindle
best dating sites singles over 50
dejtingsida test
prov di vicenza
ich suche ne frau
incontrissimi chat gratis senza registrazione lombardia
sito chat gratis italiano
free international dating sites usa
rhein zeitung koblenz partnersuche
online dating free asian
site de rencontre belge non payant
tier kleinanzeigen kostenlos aufgeben
hancock rencontre ace
american dating a german
rencontre en malaisie
cannapower top 100 single charts deutschland
association rencontre et loisirs lille
thai holiday date
poemes notre rencontre
etudiantes prostituee le havre
corsi fotografia monza
natdejta som ung
impots des prostituees
online dating website username
chat zaragoza gratis sin java
syriansk dejtingsida gratis
kristen dejting gratis online
mont dore rencontre musicales
application rencontre iphone montreal
dejting happy pancake english
endroit calme pour rencontre
annonce rencontre dna
incontro donne torino
quando un uomo con la pistola incontra un uomo con la biro
vetenskapens varld natdejting exempel
dejtingsajter sport fotboll
prostituee de luxe sur paris
dejtingsajter helt gratis antivirus
rencontre st georges beauce
donna cerca uomo padova
maxi rencontres
gameboy advance dating sim
date match barrage coupe du monde 2014
chat amore senza registrazione kik
rencontre preval et obama
7 himlen dejting regler
bloccare siti per adulti ipad
dejtingsidor goteborg
rencontre gratuite (service de rencontres gratuit et
question pour une nouvelle rencontre
siti di incontro per giovani werther
ragazze single chat
free online dating no hidden charges
chat senza registrazione per ragazzi
dejtingsidor under 18 oktober
veranstaltungen fur singles in dusseldorf
lily rose prostituee
annunci incontri a bologna
filipina singles dating and chat
partnersuche kostenlos in sachsen
rencontre avec marina abramovic
annonce gratuite rencontre femme homme
date outfit blog
gratis dejtingsidor i sverige se
dejta oskuld tjej
dejtingsidor ligga med
rencontre aire de phalempin
basta natdejting nackdelar
rencontres barcelone espagne
donne single cagliari
singleborse in facebook
online dating sites free london
dating sites for kenyan singles
wife dating sites uk
dejting appar till iphone halsa
100 free chat room phone numbers for fort worth
annunci cerco amici
partnersuche halle saale stadt
cougar dating website 100 free
what is the best free dating site for seniors
incontri in toscana
online dating profile photo tips
poeme premier jour notre rencontre
hate te rencontrer
best free english dating sites
gratis dejting for unga jobb
online chat for singles
best android app games for adults
dating site in vancouver bc
uk free dating sites review
groupe de rencontres friends
100 percent free dating site in france
siti gratis per incontrare single
dejta via sms biljetter
dejta ensamstaende mamma dejta
bakeca adulti milano
rencontre femme sur gmail
donne lucane in cerca di amore
rencontre dans le ter