mirror of
https://github.com/Gnucash/gnucash.git
synced 2024-11-29 12:14:31 -06:00
bcbebe62b1
It being the only declaration in ScrubP.h
405 lines
12 KiB
C
405 lines
12 KiB
C
/********************************************************************\
|
|
* Scrub2.c -- Convert Stock Accounts to use Lots *
|
|
* *
|
|
* This program 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 of *
|
|
* the License, or (at your option) any later version. *
|
|
* *
|
|
* This program 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 this program; if not, contact: *
|
|
* *
|
|
* Free Software Foundation Voice: +1-617-542-5942 *
|
|
* 51 Franklin Street, Fifth Floor Fax: +1-617-542-2652 *
|
|
* Boston, MA 02110-1301, USA gnu@gnu.org *
|
|
\********************************************************************/
|
|
|
|
/** @file Scrub2.c
|
|
* @brief Utilities to Convert Stock Accounts to use Lots
|
|
* @author Created by Linas Vepstas March 2003
|
|
* @author Copyright (c) 2003 Linas Vepstas <linas@linas.org>
|
|
*
|
|
* Provides a set of functions and utilities for checking and
|
|
* repairing ('scrubbing clean') the usage of Lots and lot balances
|
|
* in stock and commodity accounts. Broken lots are repaired using
|
|
* the accounts specific accounting policy (probably FIFO).
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include <glib.h>
|
|
|
|
#include "qof.h"
|
|
#include "Account.h"
|
|
#include "AccountP.h"
|
|
#include "Transaction.h"
|
|
#include "TransactionP.h"
|
|
#include "Scrub2.h"
|
|
#include "cap-gains.h"
|
|
#include "gnc-engine.h"
|
|
#include "gncInvoice.h"
|
|
#include "gnc-lot.h"
|
|
#include "policy-p.h"
|
|
|
|
static QofLogModule log_module = GNC_MOD_LOT;
|
|
|
|
/* ============================================================== */
|
|
/** Loop over all splits, and make sure that every split
|
|
* belongs to some lot. If a split does not belong to
|
|
* any lots, poke it into one.
|
|
*/
|
|
|
|
void
|
|
xaccAccountAssignLots (Account *acc)
|
|
{
|
|
SplitList *splits, *node;
|
|
|
|
if (!acc) return;
|
|
|
|
ENTER ("acc=%s", xaccAccountGetName(acc));
|
|
xaccAccountBeginEdit (acc);
|
|
|
|
restart_loop:
|
|
splits = xaccAccountGetSplitList(acc);
|
|
for (node = splits; node; node = node->next)
|
|
{
|
|
Split * split = node->data;
|
|
|
|
/* If already in lot, then no-op */
|
|
if (split->lot) continue;
|
|
|
|
/* Skip voided transactions */
|
|
if (gnc_numeric_zero_p (split->amount) &&
|
|
xaccTransGetVoidStatus(split->parent)) continue;
|
|
|
|
if (xaccSplitAssign (split)) goto restart_loop;
|
|
}
|
|
xaccAccountCommitEdit (acc);
|
|
LEAVE ("acc=%s", xaccAccountGetName(acc));
|
|
}
|
|
|
|
/* ============================================================== */
|
|
|
|
/** The xaccLotFill() routine attempts to assign splits to the
|
|
* indicated lot until the lot balance goes to zero, or until
|
|
* there are no suitable (i.e. unassigned) splits left in the
|
|
* account. It uses the default accounting policy to choose
|
|
* the splits to fill out the lot.
|
|
*/
|
|
|
|
void
|
|
xaccLotFill (GNCLot *lot)
|
|
{
|
|
Account *acc;
|
|
Split *split;
|
|
GNCPolicy *pcy;
|
|
|
|
if (!lot) return;
|
|
acc = gnc_lot_get_account(lot);
|
|
pcy = gnc_account_get_policy(acc);
|
|
|
|
ENTER ("(lot=%s, acc=%s)", gnc_lot_get_title(lot), xaccAccountGetName(acc));
|
|
|
|
/* If balance already zero, we have nothing to do. */
|
|
if (gnc_lot_is_closed (lot))
|
|
{
|
|
LEAVE ("Lot Closed (lot=%s, acc=%s)", gnc_lot_get_title(lot),
|
|
xaccAccountGetName(acc));
|
|
return;
|
|
}
|
|
split = pcy->PolicyGetSplit (pcy, lot);
|
|
if (!split)
|
|
{
|
|
LEAVE ("No Split (lot=%s, acc=%s)", gnc_lot_get_title(lot),
|
|
xaccAccountGetName(acc));
|
|
return; /* Handle the common case */
|
|
}
|
|
|
|
/* Reject voided transactions */
|
|
if (gnc_numeric_zero_p(split->amount) &&
|
|
xaccTransGetVoidStatus(split->parent))
|
|
{
|
|
LEAVE ("Voided transaction (lot=%s, acc=%s)",
|
|
gnc_lot_get_title(lot), xaccAccountGetName(acc));
|
|
return;
|
|
}
|
|
|
|
xaccAccountBeginEdit (acc);
|
|
|
|
/* Loop until we've filled up the lot, (i.e. till the
|
|
* balance goes to zero) or there are no splits left. */
|
|
while (1)
|
|
{
|
|
Split *subsplit;
|
|
|
|
subsplit = xaccSplitAssignToLot (split, lot);
|
|
if (subsplit == split)
|
|
{
|
|
PERR ("Accounting Policy gave us a split that "
|
|
"doesn't fit into this lot\n"
|
|
"lot baln=%s, isclosed=%d, aplit amt=%s",
|
|
gnc_num_dbg_to_string (gnc_lot_get_balance(lot)),
|
|
gnc_lot_is_closed (lot),
|
|
gnc_num_dbg_to_string (split->amount));
|
|
break;
|
|
}
|
|
|
|
if (gnc_lot_is_closed (lot)) break;
|
|
|
|
split = pcy->PolicyGetSplit (pcy, lot);
|
|
if (!split) break;
|
|
}
|
|
xaccAccountCommitEdit (acc);
|
|
LEAVE ("(lot=%s, acc=%s)", gnc_lot_get_title(lot), xaccAccountGetName(acc));
|
|
}
|
|
|
|
/* ============================================================== */
|
|
|
|
void
|
|
xaccLotScrubDoubleBalance (GNCLot *lot)
|
|
{
|
|
gnc_commodity *currency = NULL;
|
|
SplitList *snode;
|
|
GList *node;
|
|
gnc_numeric zero = gnc_numeric_zero();
|
|
gnc_numeric value = zero;
|
|
|
|
if (!lot) return;
|
|
|
|
ENTER ("lot=%s", gnc_lot_get_title(lot));
|
|
|
|
for (snode = gnc_lot_get_split_list(lot); snode; snode = snode->next)
|
|
{
|
|
Split *s = snode->data;
|
|
xaccSplitComputeCapGains (s, NULL);
|
|
}
|
|
|
|
/* We double-check only closed lots */
|
|
if (FALSE == gnc_lot_is_closed (lot))
|
|
{
|
|
LEAVE ("lot=%s is closed", gnc_lot_get_title(lot));
|
|
return;
|
|
}
|
|
|
|
for (snode = gnc_lot_get_split_list(lot); snode; snode = snode->next)
|
|
{
|
|
Split *s = snode->data;
|
|
Transaction *trans = s->parent;
|
|
|
|
/* Check to make sure all splits in the lot have a common currency */
|
|
if (NULL == currency)
|
|
{
|
|
currency = trans->common_currency;
|
|
}
|
|
if (FALSE == gnc_commodity_equiv (currency, trans->common_currency))
|
|
{
|
|
/* This lot has mixed currencies. Can't double-balance.
|
|
* Silently punt */
|
|
PWARN ("Lot with multiple currencies:\n"
|
|
"\ttrans=%s curr=%s", xaccTransGetDescription(trans),
|
|
gnc_commodity_get_fullname(trans->common_currency));
|
|
break;
|
|
}
|
|
|
|
/* Now, total up the values */
|
|
value = gnc_numeric_add (value, xaccSplitGetValue (s),
|
|
GNC_DENOM_AUTO, GNC_HOW_DENOM_EXACT);
|
|
PINFO ("Split=%p value=%s Accum Lot value=%s", s,
|
|
gnc_num_dbg_to_string (s->value),
|
|
gnc_num_dbg_to_string (value));
|
|
|
|
}
|
|
|
|
if (FALSE == gnc_numeric_equal (value, zero))
|
|
{
|
|
/* Unhandled error condition. Not sure what to do here,
|
|
* Since the ComputeCapGains should have gotten it right.
|
|
* I suppose there might be small rounding errors, a penny or two,
|
|
* the ideal thing would to figure out why there's a rounding
|
|
* error, and fix that.
|
|
*/
|
|
PERR ("Closed lot fails to double-balance !! lot value=%s",
|
|
gnc_num_dbg_to_string (value));
|
|
for (node = gnc_lot_get_split_list(lot); node; node = node->next)
|
|
{
|
|
Split *s = node->data;
|
|
PERR ("s=%p amt=%s val=%s", s,
|
|
gnc_num_dbg_to_string(s->amount),
|
|
gnc_num_dbg_to_string(s->value));
|
|
}
|
|
}
|
|
|
|
LEAVE ("lot=%s", gnc_lot_get_title(lot));
|
|
}
|
|
|
|
/* ================================================================= */
|
|
|
|
static inline gboolean
|
|
is_subsplit (Split *split)
|
|
{
|
|
|
|
/* generic stop-progress conditions */
|
|
if (!split) return FALSE;
|
|
g_return_val_if_fail (split->parent, FALSE);
|
|
|
|
/* If there are no sub-splits, then there's nothing to do. */
|
|
return xaccSplitHasPeers (split);
|
|
}
|
|
|
|
/* ================================================================= */
|
|
|
|
|
|
/* ================================================================= */
|
|
|
|
/* Remove the guid of b from a. Note that a may not contain the guid
|
|
* of b, (and v.v.) in which case, it will contain other guids which
|
|
* establish the links. So merge them back in. */
|
|
|
|
static void
|
|
remove_guids (Split *sa, Split *sb)
|
|
{
|
|
xaccSplitRemovePeerSplit (sa, sb);
|
|
xaccSplitRemovePeerSplit (sb, sa);
|
|
xaccSplitMergePeerSplits (sa, sb);
|
|
}
|
|
|
|
/* The merge_splits() routine causes the amount & value of sb
|
|
* to be merged into sa; it then destroys sb. It also performs
|
|
* some other misc cleanup */
|
|
|
|
static void
|
|
merge_splits (Split *sa, Split *sb)
|
|
{
|
|
Account *act;
|
|
Transaction *txn;
|
|
gnc_numeric amt, val;
|
|
|
|
act = xaccSplitGetAccount (sb);
|
|
xaccAccountBeginEdit (act);
|
|
|
|
txn = sa->parent;
|
|
xaccTransBeginEdit (txn);
|
|
|
|
/* Remove the guid of sb from the 'gemini' of sa */
|
|
remove_guids (sa, sb);
|
|
|
|
/* Add amount of sb into sa, ditto for value. */
|
|
amt = xaccSplitGetAmount (sa);
|
|
amt = gnc_numeric_add_fixed (amt, xaccSplitGetAmount (sb));
|
|
xaccSplitSetAmount (sa, amt);
|
|
|
|
val = xaccSplitGetValue (sa);
|
|
val = gnc_numeric_add_fixed (val, xaccSplitGetValue (sb));
|
|
xaccSplitSetValue (sa, val);
|
|
|
|
/* Set reconcile to no; after this much violence,
|
|
* no way its reconciled. */
|
|
xaccSplitSetReconcile (sa, NREC);
|
|
|
|
/* If sb has associated gains splits, trash them. */
|
|
if ((sb->gains_split) &&
|
|
(sb->gains_split->gains & GAINS_STATUS_GAINS))
|
|
{
|
|
Transaction *t = sb->gains_split->parent;
|
|
xaccTransBeginEdit (t);
|
|
xaccTransDestroy (t);
|
|
xaccTransCommitEdit (t);
|
|
}
|
|
|
|
/* Finally, delete sb */
|
|
xaccSplitDestroy(sb);
|
|
|
|
xaccTransCommitEdit (txn);
|
|
xaccAccountCommitEdit (act);
|
|
}
|
|
|
|
gboolean
|
|
xaccScrubMergeSubSplits (Split *split, gboolean strict)
|
|
{
|
|
gboolean rc = FALSE;
|
|
Transaction *txn;
|
|
SplitList *node;
|
|
GNCLot *lot;
|
|
|
|
if (strict && (FALSE == is_subsplit (split))) return FALSE;
|
|
|
|
txn = split->parent;
|
|
|
|
// Don't mess with splits from an invoice transaction
|
|
// Those are the responsibility of the business code
|
|
if (gncInvoiceGetInvoiceFromTxn (txn)) return FALSE;
|
|
|
|
lot = xaccSplitGetLot (split);
|
|
|
|
ENTER ("(Lot=%s)", gnc_lot_get_title(lot));
|
|
restart:
|
|
for (node = txn->splits; node; node = node->next)
|
|
{
|
|
Split *s = node->data;
|
|
if (xaccSplitGetLot (s) != lot) continue;
|
|
if (s == split) continue;
|
|
if (qof_instance_get_destroying(s)) continue;
|
|
|
|
// Don't mess with splits from an invoice transaction
|
|
// Those are the responsibility of the business code
|
|
if (gncInvoiceGetInvoiceFromTxn (s->parent)) return FALSE;
|
|
|
|
if (strict)
|
|
{
|
|
/* OK, this split is in the same lot (and thus same account)
|
|
* as the indicated split. Make sure it is really a subsplit
|
|
* of the split we started with. It's possible to have two
|
|
* splits in the same lot and transaction that are not subsplits
|
|
* of each other, the test-period test suite does this, for
|
|
* example. Only worry about adjacent sub-splits. By
|
|
* repeatedly merging adjacent subsplits, we'll get the non-
|
|
* adjacent ones too. */
|
|
if (!xaccSplitIsPeerSplit (split, s))
|
|
continue;
|
|
}
|
|
|
|
merge_splits (split, s);
|
|
rc = TRUE;
|
|
goto restart;
|
|
}
|
|
if (rc && gnc_numeric_zero_p (split->amount))
|
|
{
|
|
time64 pdate = xaccTransGetDate (txn);
|
|
gchar *pdatestr = gnc_ctime (&pdate);
|
|
PWARN ("Result of merge has zero amt!");
|
|
PWARN ("Transaction details - posted date %s - description %s", pdatestr, xaccTransGetDescription(txn));
|
|
g_free (pdatestr);
|
|
}
|
|
LEAVE (" splits merged=%d", rc);
|
|
return rc;
|
|
}
|
|
|
|
gboolean
|
|
xaccScrubMergeLotSubSplits (GNCLot *lot, gboolean strict)
|
|
{
|
|
gboolean rc = FALSE;
|
|
SplitList *node;
|
|
|
|
if (!lot) return FALSE;
|
|
|
|
ENTER (" ");
|
|
restart:
|
|
for (node = gnc_lot_get_split_list(lot); node; node = node->next)
|
|
{
|
|
Split *s = node->data;
|
|
if (!xaccScrubMergeSubSplits(s, strict)) continue;
|
|
|
|
rc = TRUE;
|
|
goto restart;
|
|
}
|
|
LEAVE (" splits merged=%d", rc);
|
|
return rc;
|
|
}
|
|
|
|
/* =========================== END OF FILE ======================= */
|