2001-08-17 05:46:24 +00:00
|
|
|
/*****************************************************************************
|
|
|
|
*
|
2002-01-07 19:16:03 +00:00
|
|
|
* $Id$
|
2001-08-17 05:46:24 +00:00
|
|
|
* Purpose ...............: Load noderecord
|
|
|
|
*
|
|
|
|
*****************************************************************************
|
2002-01-07 19:16:03 +00:00
|
|
|
* Copyright (C) 1997-2002
|
2001-08-17 05:46:24 +00:00
|
|
|
*
|
|
|
|
* Michiel Broek FIDO: 2:280/2802
|
|
|
|
* Beekmansbos 10
|
|
|
|
* 1971 BV IJmuiden
|
|
|
|
* the Netherlands
|
|
|
|
*
|
|
|
|
* This file is part of MBSE BBS.
|
|
|
|
*
|
|
|
|
* This BBS is free software; you can redistribute it and/or modify it
|
|
|
|
* under the terms of the GNU General Public License as published by the
|
|
|
|
* Free Software Foundation; either version 2, or (at your option) any
|
|
|
|
* later version.
|
|
|
|
*
|
|
|
|
* MBSE BBS is distributed in the hope that it will be useful, but
|
|
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with MBSE BBS; see the file COPYING. If not, write to the Free
|
|
|
|
* Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*****************************************************************************/
|
|
|
|
|
2002-06-30 12:48:44 +00:00
|
|
|
#include "../config.h"
|
2001-08-17 05:46:24 +00:00
|
|
|
#include "libs.h"
|
2002-06-30 12:48:44 +00:00
|
|
|
#include "memwatch.h"
|
2001-08-17 05:46:24 +00:00
|
|
|
#include "structs.h"
|
2002-02-14 21:24:27 +00:00
|
|
|
#include "common.h"
|
2002-01-07 19:16:03 +00:00
|
|
|
#include "users.h"
|
2001-08-17 05:46:24 +00:00
|
|
|
#include "records.h"
|
|
|
|
#include "dbnode.h"
|
|
|
|
#include "common.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int noderecord(faddr *addr)
|
|
|
|
{
|
|
|
|
fidoaddr fa;
|
|
|
|
|
|
|
|
memset(&fa, 0, sizeof(fa));
|
|
|
|
fa.zone = addr->zone;
|
|
|
|
fa.net = addr->net;
|
|
|
|
fa.node = addr->node;
|
|
|
|
fa.point = addr->point;
|
|
|
|
|
|
|
|
if (!(TestNode(fa)))
|
|
|
|
if (!SearchNode(fa)) {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|