8
0
mirror of https://github.com/FirebirdSQL/firebird.git synced 2025-01-22 17:23:03 +01:00
This commit is contained in:
asfernandes 2009-10-15 02:15:31 +00:00
parent 7808e9d546
commit 9c1918d39b
4 changed files with 10 additions and 10 deletions

View File

@ -78,7 +78,7 @@ Author: Blas Rodriguez Somoza <a href="">blas@puertareal.com</a><br>
<h4>2.1.-Visual Studio</h4>
<ol>
<li>Install VisualStudio 8/9</li>
<li>You can try to compile it with <a href=http://www.microsoft.com/express/vc/>Visual Studio Express</a> but it will no be able to build the <a href=http://www.nabble.com/building-head-with-visual-studio-2008-%28vc9%29-td25620414.html>control panel applet</a> but the server building is ok <br>
<li>You can try to compile it with <a href=http://www.microsoft.com/express/vc/>Visual Studio Express</a> but it will not be able to build the <a href=http://www.nabble.com/building-head-with-visual-studio-2008-%28vc9%29-td25620414.html>control panel applet</a> but the server building is ok <br>
</li>
</ol>

View File

@ -1554,7 +1554,7 @@ void CCH_get_related(thread_db* tdbb, PageNumber page, PagesArray &lowPages)
* Functional description
* Collect all pages, dependent on given page (i.e. all pages which must be
* written after given page). To do it, walk low part of precedence graph
* starting from given page and put its numbers into array.
* starting from given page and put its numbers into array.
*
**************************************/
@ -1566,7 +1566,7 @@ void CCH_get_related(thread_db* tdbb, PageNumber page, PagesArray &lowPages)
for (que_inst = mod_que->que_forward; que_inst != mod_que; que_inst = que_inst->que_forward)
{
BufferDesc* bdb = BLOCK(que_inst, BufferDesc*, bdb_que);
if (bdb->bdb_page == page)
if (bdb->bdb_page == page)
{
const ULONG mark = get_prec_walk_mark(bcb);
get_related(bdb, lowPages, PRE_SEARCH_LIMIT, mark);
@ -5148,18 +5148,19 @@ static int get_related(BufferDesc* bdb, PagesArray &lowPages, int limit, const U
**************************************
*
* Functional description
* Recursively walk low part of precedence graph of given buffer and put
* low pages numbers into array.
* Recursively walk low part of precedence graph of given buffer and put
* low pages numbers into array.
*
**************************************/
const struct que* base = &bdb->bdb_lower;
for (const struct que* que_inst = base->que_forward; que_inst != base; que_inst = que_inst->que_forward)
for (const struct que* que_inst = base->que_forward; que_inst != base;
que_inst = que_inst->que_forward)
{
const Precedence* precedence = BLOCK(que_inst, Precedence*, pre_lower);
if (precedence->pre_flags & PRE_cleared)
continue;
BufferDesc *low = precedence->pre_low;
BufferDesc* low = precedence->pre_low;
if (low->bdb_prec_walk_mark == mark)
continue;
@ -6669,5 +6670,3 @@ static void clear_dirty_flag(thread_db* tdbb, BufferDesc* bdb)
tdbb->getDatabase()->dbb_backup_manager->unlockDirtyPage(tdbb);
}
}

View File

@ -3030,6 +3030,7 @@ static rhd* locate_space(thread_db* tdbb,
PagesArray lowPages;
SLONG dp_primary = 0;
if (type == DPM_secondary)
{
USHORT pp_sequence;

View File

@ -135,7 +135,7 @@ void IbUtil::initialize()
string message[4]; // To suppress logs when correct library is found
#ifdef WIN_NT
// using bin folder
// using bin folder
if (tryLibrary(fb_utils::getPrefix(fb_utils::FB_DIR_BIN, LIBNAME), message[1]))
return;