1
0
mirror of https://github.com/samba-team/samba.git synced 2024-12-28 07:21:54 +03:00

r6984: added tree representation documentation and utility code, to be used for subclasses of object classes

This commit is contained in:
Derrell Lipman 2005-05-26 02:16:45 +00:00 committed by Gerald (Jerry) Carter
parent 519608bbf9
commit 7aca32dca6
5 changed files with 1928 additions and 3 deletions

View File

@ -0,0 +1,4 @@
trees.ps contains an explanation of the Genealogical Representation of Trees
in Databases which is being used in ldb_sqlite3. Note that we use fgID
representation with 4 bytes per level, so we can represent 6.5E+08 subclasses
of any object class. This should be adequate for our purposes. :-)

View File

@ -0,0 +1,154 @@
/*
base160 code used by ldb_sqlite3
Copyright (C) 2004 Derrell Lipman
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
* ldb_sqlite3_base160()
*
* Convert an integer value to a string containing the base 160 representation
* of the integer. We always convert to a string representation that is 4
* bytes in length, and we always null terminate.
*
* Parameters:
* val --
* The value to be converted
*
* result --
* Buffer in which the result is to be placed
*
* Returns:
* nothing
*/
static unsigned char base160tab[161] =
{
48 , 49 , 50 , 51 , 52 , 53 , 54 , 55 , 56 , 57 , /* 0-9 */
58 , 59 , 65 , 66 , 67 , 68 , 69 , 70 , 71 , 72 , /* : ; A-H */
73 , 74 , 75 , 76 , 77 , 78 , 79 , 80 , 81 , 82 , /* I-R */
83 , 84 , 85 , 86 , 87 , 88 , 89 , 90 , 97 , 98 , /* S-Z , a-b */
99 , 100, 101, 102, 103, 104, 105, 106, 107, 108, /* c-l */
109, 110, 111, 112, 113, 114, 115, 116, 117, 118, /* m-v */
119, 120, 121, 122, 160, 161, 162, 163, 164, 165, /* w-z, latin1 */
166, 167, 168, 169, 170, 171, 172, 173, 174, 175, /* latin1 */
176, 177, 178, 179, 180, 181, 182, 183, 184, 185, /* latin1 */
186, 187, 188, 189, 190, 191, 192, 193, 194, 195, /* latin1 */
196, 197, 198, 199, 200, 201, 202, 203, 204, 205, /* latin1 */
206, 207, 208, 209, 210, 211, 212, 213, 214, 215, /* latin1 */
216, 217, 218, 219, 220, 221, 222, 223, 224, 225, /* latin1 */
226, 227, 228, 229, 230, 231, 232, 233, 234, 235, /* latin1 */
236, 237, 238, 239, 240, 241, 242, 243, 244, 245, /* latin1 */
246, 247, 248, 249, 250, 251, 252, 253, 254, 255, /* latin1 */
'\0'
};
/*
* lsqlite3_base160()
*
* Convert an unsigned long integer into a base160 representation of the
* number.
*
* Parameters:
* val --
* value to be converted
*
* result --
* character array, 5 bytes long, into which the base160 representation
* will be placed. The result will be a four-digit representation of the
* number (with leading zeros prepended as necessary), and null
* terminated.
*
* Returns:
* Nothing
*/
void
lsqlite3_base160(unsigned long val,
unsigned char result[5])
{
int i;
for (i = 3; i >= 0; i--) {
result[i] = base160tab[val % 160];
val /= 160;
}
result[4] = '\0';
}
/*
* lsqlite3_base160Next()
*
* Retrieve the next-greater number in the base160 sequence for the terminal
* tree node (the last four digits). Only one tree level (four digits) are
* operated on.
*
* Parameters:
* base160 -- a character array containing either an empty string (in which
* case no operation is performed), or a string of base160 digits
* with a length of a multiple of four digits.
*
* Upon return, the trailing four digits (one tree level) will
* have been incremented by 1.
*
* Returns:
* base160 -- the modified array
*/
char *
lsqlite3_base160Next(char base160[])
{
int i;
unsigned char * pTab;
char * pBase160 = base160;
/*
* We need a minimum of four digits, and we will always get a multiple of
* four digits.
*/
if (*pBase160 != '\0')
{
pBase160 += strlen(pBase160) - 1;
/* We only carry through four digits: one level in the tree */
for (i = 0; i < 4; i++) {
/* What base160 value does this digit have? */
pTab = strchr(base160tab, *pBase160);
/* Is there a carry? */
if (pTab < base160tab + sizeof(base160tab) - 1) {
/* Nope. Just increment this value and we're done. */
*pBase160 = *++pTab;
break;
} else {
/*
* There's a carry. This value gets base160tab[0], we
* decrement the buffer pointer to get the next higher-order
* digit, and continue in the loop.
*/
*pBase160-- = base160tab[0];
}
}
}
return base160;
}

View File

@ -457,7 +457,7 @@ static int lsqlite3_lock(struct ldb_module *module, const char *lockname)
/* Write-lock (but not read-lock) the database */
lsqlite3->last_rc = sqlite3_step(lsqlite3->begin);
/* Ready the compiled statememt for its next use */
/* Ready the compiled statement for its next use */
(void ) sqlite_reset(lsqlite3->begin);
return lsqlite3->last_rc == 0 ? 0 : -1;
@ -484,7 +484,7 @@ static int lsqlite3_unlock(struct ldb_module *module, const char *lockname)
/* Final unlock. Unlock the database */
lsqlite3->last_rc = sqlite3_step(lsqlite3->commit);
/* Ready the compiled statememt for its next use */
/* Ready the compiled statement for its next use */
(void ) sqlite_reset(lsqlite3->commit);
}
@ -904,7 +904,7 @@ struct ldb_context *lsqlite3_connect(const char *url,
lsqlite3->lock_count = 0;
lsqlite3->last_rc = lsqlite3_initialize(&lsqlite3->sqlite3, url);
if (lsqlite3->last_rc != LDAP_SUCCESS) {
if (lsqlite3->last_rc != SQLITE_SUCCESS) {
goto failed;
}

View File

@ -23,3 +23,10 @@ struct lsqlite3_private {
sqlite3_stmt *insertSubclass;
} queries;
};
void
lsqlite3_base160(unsigned long val,
unsigned char result[5]);
char *
lsqlite3_base160Next(char base160[]);

File diff suppressed because it is too large Load Diff