/*======================================
* llrpt_writeindi -- Write person to database
* usage: writeindi(INDI) -> BOOLEAN
*====================================*/
PVALUE
llrpt_writeindi (PNODE node, SYMTAB stab, BOOLEAN *eflg)
{
NODE indi1;
PNODE arg = iargs(node);
NODE indi2 = eval_indi(arg, stab, eflg, NULL);
STRING rawrec=0, msg;
INT len, cnt;
BOOLEAN rtn=FALSE;
if (*eflg || !indi2) {
prog_var_error(node, stab, arg, 0, nonind1, "writeindi");
return NULL;
}
/* make a copy, so we can delete it */
indi2 = copy_node_subtree(indi2);
/* get existing record */
rawrec = retrieve_raw_record(rmvat(nxref(indi2)), &len);
if (!rawrec) {
/*
TODO: What do we do here ? Are they adding a new indi ?
or did they get the xref wrong ?
*/
goto end_writeindi;
}
ASSERT(indi1 = string_to_node(rawrec));
cnt = resolve_refn_links(indi2);
/* validate for showstopper errors */
if (!valid_indi_tree(indi2, &msg, indi1)) {
/* TODO: What to do with msg ? */
goto end_writeindi;
}
if (cnt > 0) {
/* unresolvable refn links */
/* TODO: optional argument to make this fatal ? */
}
if (equal_tree(indi1, indi2)) {
/* optimization :) */
rtn = TRUE;
goto end_writeindi;
}
if (readonly) {
/* TODO: database is read only error message */
goto end_writeindi;
}
replace_indi(indi1, indi2);
strfree(&rawrec);
rtn = TRUE;
end_writeindi:
return create_pvalue_from_bool(rtn);
}
/*=====================================
* llrpt_writefam -- Write family to database
* usage: writefam(FAM) -> BOOLEAN
*===================================*/
PVALUE
llrpt_writefam (PNODE node, SYMTAB stab, BOOLEAN *eflg)
{
NODE fam1;
NODE fam2 = eval_fam(iargs(node), stab, eflg, NULL);
STRING rawrec=0, msg;
INT len, cnt;
BOOLEAN rtn=FALSE;
if (*eflg) return NULL;
/* make a copy, so we can delete it */
fam2 = copy_node_subtree(fam2);
/* get existing record */
rawrec = retrieve_raw_record(rmvat(nxref(fam2)), &len);
if (!rawrec) {
/*
TODO: What do we do here ? Are they adding a new fam ?
or did they get the xref wrong ?
*/
goto end_writefam;
}
ASSERT(fam1 = string_to_node(rawrec));
cnt = resolve_refn_links(fam2);
/* validate for showstopper errors */
if (!valid_fam_tree(fam2, &msg, fam1)) {
/* TODO: What to do with msg ? */
goto end_writefam;
}
if (cnt > 0) {
/* unresolvable refn links */
/* TODO: optional argument to make this fatal ? */
}
if (equal_tree(fam1, fam2)) {
/* optimization :) */
rtn = TRUE;
goto end_writefam;
}
if (readonly) {
/* TODO: database is read only error message */
goto end_writefam;
}
replace_fam(fam1, fam2);
strfree(&rawrec);
rtn = TRUE;
end_writefam:
return create_pvalue_from_bool(rtn);
}
/*===================================================
* who_is_he_she -- Find who person is from key value
*=================================================*/
void
who_is_he_she (void)
{
STRING str, rawrec;
NODE indi;
INT len;
char nkey[100];
char key[20];
if (!ask_for_string(_("Please enter person's internal key value."),
_("enter key:"), key, sizeof(key))
|| !key[0])
return;
nkey[0] = 'I';
if (*key == 'I')
strcpy(nkey, key);
else
strcpy(&nkey[1], key);
if (!(rawrec = retrieve_raw_record(nkey, &len))) {
msg_error(_("No one in database has key value %s."), key);
return;
}
if (!(indi = string_to_node(rawrec))) {
msg_error(_("No one in database has key value %s."), key);
stdfree(rawrec);
return;
}
if (!(str = indi_to_name(indi, 60)) || *str == 0) {
msg_error(_("No one in database has key value %s."), key);
stdfree(rawrec);
return;
}
msg_info("%s - %s", key, str);
/* LEAK -- where is stdfree(rawrec) -- Perry 2001/11/18 */
}
