Gecko [ www.foryou-vip.com ]

Name	Size	Permission	Date
.libs	[ DIR ]	drwxr-xr-x	2024-03-12 14:36
tests	[ DIR ]	drwxrwxr-x	2022-10-31 11:36
.gdbinit	250 B	-rw-rw-r--	2022-10-31 11:36
.phpdbginit	2.53 KB	-rw-rw-r--	2022-10-31 11:36
CREDITS	45 B	-rw-rw-r--	2022-10-31 11:36
Makefile.frag	1.52 KB	-rw-rw-r--	2022-10-31 11:36
README.md	2.27 KB	-rw-rw-r--	2022-10-31 11:36
config.m4	3.26 KB	-rw-rw-r--	2022-10-31 11:36
config.w32	1.32 KB	-rw-rw-r--	2022-10-31 11:36
create-test.php	4.41 KB	-rwxrwxr-x	2022-10-31 11:36
phpdbg	44.03 MB	-rwxr-xr-x	2024-03-12 14:36
phpdbg.1	2.75 KB	-rw-r--r--	2024-03-12 14:19
phpdbg.1.in	2.8 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg.c	61.2 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg.h	13.01 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg.init.d	2.78 KB	-rwxrwxr-x	2022-10-31 11:36
phpdbg.lo	321 B	-rw-r--r--	2024-03-12 14:36
phpdbg.o	334.69 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_bp.c	57.47 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_bp.h	6.12 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_bp.lo	330 B	-rw-r--r--	2024-03-12 14:36
phpdbg_bp.o	272.08 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_break.c	2.14 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_break.h	1.57 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_break.lo	339 B	-rw-r--r--	2024-03-12 14:36
phpdbg_break.o	87.73 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_btree.c	7.38 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_btree.h	2.97 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_btree.lo	339 B	-rw-r--r--	2024-03-12 14:36
phpdbg_btree.o	90.02 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_cmd.c	20.43 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_cmd.h	6.13 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_cmd.lo	333 B	-rw-r--r--	2024-03-12 14:36
phpdbg_cmd.o	152.28 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_eol.c	4.25 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_eol.h	1.55 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_eol.lo	333 B	-rw-r--r--	2024-03-12 14:36
phpdbg_eol.o	97.85 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_frame.c	10.13 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_frame.h	1.57 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_frame.lo	339 B	-rw-r--r--	2024-03-12 14:36
phpdbg_frame.o	150.81 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_help.c	39.09 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_help.h	2 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_help.lo	336 B	-rw-r--r--	2024-03-12 14:36
phpdbg_help.o	133.85 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_info.c	16.92 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_info.h	1.68 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_info.lo	336 B	-rw-r--r--	2024-03-12 14:36
phpdbg_info.o	152.36 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_io.c	7.9 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_io.h	1.92 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_io.lo	330 B	-rw-r--r--	2024-03-12 14:36
phpdbg_io.o	109.7 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_lexer.c	44.53 KB	-rw-r--r--	2022-10-31 11:36
phpdbg_lexer.h	1.71 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_lexer.l	3.81 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_lexer.lo	339 B	-rw-r--r--	2024-03-12 14:36
phpdbg_lexer.o	130.77 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_list.c	11.73 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_list.h	2.02 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_list.lo	336 B	-rw-r--r--	2024-03-12 14:36
phpdbg_list.o	124.72 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_opcode.c	6.47 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_opcode.h	1.98 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_opcode.lo	342 B	-rw-r--r--	2024-03-12 14:36
phpdbg_opcode.o	122.3 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_out.c	29.95 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_out.h	4.88 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_out.lo	333 B	-rw-r--r--	2024-03-12 14:36
phpdbg_out.o	190.24 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_parser.c	49.46 KB	-rw-r--r--	2022-10-31 11:36
phpdbg_parser.h	2.56 KB	-rw-r--r--	2022-10-31 11:36
phpdbg_parser.lo	342 B	-rw-r--r--	2024-03-12 14:36
phpdbg_parser.o	116.58 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_parser.output	14.23 KB	-rw-r--r--	2022-10-31 11:36
phpdbg_parser.y	4.35 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_print.c	14.06 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_print.h	1.69 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_print.lo	339 B	-rw-r--r--	2024-03-12 14:36
phpdbg_print.o	157.36 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_prompt.c	55.94 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_prompt.h	2.59 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_prompt.lo	342 B	-rw-r--r--	2024-03-12 14:36
phpdbg_prompt.o	299.74 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_rinit_hook.c	3.54 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_rinit_hook.h	1.82 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_set.c	9.59 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_set.h	1.71 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_set.lo	333 B	-rw-r--r--	2024-03-12 14:36
phpdbg_set.o	113.42 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_sigio_win32.c	2.9 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_sigio_win32.h	1.41 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_sigsafe.c	1.56 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_sigsafe.h	457 B	-rw-rw-r--	2022-10-31 11:36
phpdbg_sigsafe.lo	345 B	-rw-r--r--	2024-03-12 14:36
phpdbg_sigsafe.o	90.7 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_utils.c	23.21 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_utils.h	5.19 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_utils.lo	339 B	-rw-r--r--	2024-03-12 14:36
phpdbg_utils.o	173.69 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_wait.c	13.37 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_wait.h	1.3 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_wait.lo	336 B	-rw-r--r--	2024-03-12 14:36
phpdbg_wait.o	131.2 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_watch.c	54.1 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_watch.h	4.74 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_watch.lo	339 B	-rw-r--r--	2024-03-12 14:36
phpdbg_watch.o	226.91 KB	-rw-r--r--	2024-03-12 14:36
phpdbg_webdata_transfer.c	5.21 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_webdata_transfer.h	1.33 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_win.c	1.85 KB	-rw-rw-r--	2022-10-31 11:36
phpdbg_win.h	1.58 KB	-rw-rw-r--	2022-10-31 11:36
test.php	1.18 KB	-rw-rw-r--	2022-10-31 11:36
web-bootstrap.php	2.06 KB	-rw-rw-r--	2022-10-31 11:36
xml.md	20.03 KB	-rw-rw-r--	2022-10-31 11:36

Rename

/*
   +----------------------------------------------------------------------+
   | PHP Version 7                                                        |
   +----------------------------------------------------------------------+
   | Copyright (c) The PHP Group                                          |
   +----------------------------------------------------------------------+
   | This source file is subject to version 3.01 of the PHP license,	  |
   | that is bundled with this package in the file LICENSE, and is        |
   | available through the world-wide-web at the following url:           |
   | http://www.php.net/license/3_01.txt                                  |
   | If you did not receive a copy of the PHP license and are unable to   |
   | obtain it through the world-wide-web, please send a note to          |
   | license@php.net so we can mail you a copy immediately.               |
   +----------------------------------------------------------------------+
   | Authors: Felipe Pena <felipe@php.net>                                |
   | Authors: Joe Watkins <joe.watkins@live.co.uk>                        |
   | Authors: Bob Weinand <bwoebi@php.net>                                |
   +----------------------------------------------------------------------+
*/

#include "phpdbg_btree.h"
#include "phpdbg.h"

#define CHOOSE_BRANCH(n) \
	branch = branch->branches[!!(n)];

#ifdef _Win32
# undef pemalloc
# undef pefree
# define pemalloc(size, persistent) malloc(size)
# define pefree(ptr, persistent) free(ptr)
#endif

/* depth in bits */
void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) {
	tree->depth = depth;
	tree->branch = NULL;
	tree->persistent = 0;
	tree->count = 0;
}

phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) {
	phpdbg_btree_branch *branch = tree->branch;
	int i = tree->depth - 1;

if (branch == NULL) {
		return NULL;
	}

do {
		if ((idx >> i) % 2 == 1) {
		 	if (branch->branches[1]) {
				CHOOSE_BRANCH(1);
			} else {
				return NULL;
			}
		} else {
			if (branch->branches[0]) {
				CHOOSE_BRANCH(0);
			} else {
				return NULL;
			}
		}
	} while (i--);

return &branch->result;
}

phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) {
	phpdbg_btree_branch *branch = tree->branch;
	int i = tree->depth - 1, last_superior_i = -1;

if (branch == NULL) {
		return NULL;
	}

/* find nearest watchpoint */
	do {
		if ((idx >> i) % 2 == 0) {
			if (branch->branches[0]) {
				CHOOSE_BRANCH(0);
			/* an impossible branch was found if: */
			} else {
				/* there's no lower branch than idx */
				if (last_superior_i == -1) {
					/* failure */
					return NULL;
				}
				/* reset state */
				branch = tree->branch;
				i = tree->depth - 1;
				/* follow branch according to bits in idx until the last lower branch before the impossible branch */
				do {
					CHOOSE_BRANCH((idx >> i) % 2 == 1 && branch->branches[1]);
				} while (--i > last_superior_i);
				/* use now the lower branch of which we can be sure that it contains only branches lower than idx */
				CHOOSE_BRANCH(0);
				/* and choose the highest possible branch in the branch containing only branches lower than idx */
				while (i--) {
					CHOOSE_BRANCH(branch->branches[1]);
				}
				break;
			}
		/* follow branch according to bits in idx until having found an impossible branch */
		} else {
			if (branch->branches[1]) {
				if (branch->branches[0]) {
					last_superior_i = i;
				}
				CHOOSE_BRANCH(1);
			} else {
				CHOOSE_BRANCH(0);
				while (i--) {
					CHOOSE_BRANCH(branch->branches[1]);
				}
				break;
			}
		}
	} while (i--);

return &branch->result;
}

phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulong higher_idx) {
	phpdbg_btree_position pos;

pos.tree = tree;
	pos.end = lower_idx;
	pos.cur = higher_idx;

return pos;
}

phpdbg_btree_result *phpdbg_btree_next(phpdbg_btree_position *pos) {
	phpdbg_btree_result *result = phpdbg_btree_find_closest(pos->tree, pos->cur);

if (result == NULL || result->idx < pos->end) {
		return NULL;
	}

pos->cur = result->idx - 1;

return result;
}

int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) {
	int i = tree->depth - 1;
	phpdbg_btree_branch **branch = &tree->branch;

do {
		if (*branch == NULL) {
			break;
		}
		branch = &(*branch)->branches[(idx >> i) % 2];
	} while (i--);

if (*branch == NULL) {
		if (!(flags & PHPDBG_BTREE_INSERT)) {
			return FAILURE;
		}

{
			phpdbg_btree_branch *memory = *branch = pemalloc((i + 2) * sizeof(phpdbg_btree_branch), tree->persistent);
			do {
				(*branch)->branches[!((idx >> i) % 2)] = NULL;
				branch = &(*branch)->branches[(idx >> i) % 2];
				*branch = ++memory;
			} while (i--);
			tree->count++;
		}
	} else if (!(flags & PHPDBG_BTREE_UPDATE)) {
		return FAILURE;
	}

(*branch)->result.idx = idx;
	(*branch)->result.ptr = ptr;

return SUCCESS;
}

int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) {
	int i = tree->depth;
	phpdbg_btree_branch *branch = tree->branch;
	int i_last_dual_branch = -1, last_dual_branch_branch;
	phpdbg_btree_branch *last_dual_branch = NULL;

goto check_branch_existence;
	do {
		if (branch->branches[0] && branch->branches[1]) {
			last_dual_branch = branch;
			i_last_dual_branch = i;
			last_dual_branch_branch = (idx >> i) % 2;
		}
		branch = branch->branches[(idx >> i) % 2];

check_branch_existence:
		if (branch == NULL) {
			return FAILURE;
		}
	} while (i--);

tree->count--;

if (i_last_dual_branch == -1) {
		pefree(tree->branch, tree->persistent);
		tree->branch = NULL;
	} else {
		if (last_dual_branch->branches[last_dual_branch_branch] == last_dual_branch + 1) {
			phpdbg_btree_branch *original_branch = last_dual_branch->branches[!last_dual_branch_branch];

memcpy(last_dual_branch + 1, last_dual_branch->branches[!last_dual_branch_branch], (i_last_dual_branch + 1) * sizeof(phpdbg_btree_branch));
			pefree(last_dual_branch->branches[!last_dual_branch_branch], tree->persistent);
			last_dual_branch->branches[!last_dual_branch_branch] = last_dual_branch + 1;

branch = last_dual_branch->branches[!last_dual_branch_branch];
			for (i = i_last_dual_branch; i--;) {
				branch = (branch->branches[branch->branches[1] == ++original_branch] = last_dual_branch + i_last_dual_branch - i + 1);
			}
		} else {
			pefree(last_dual_branch->branches[last_dual_branch_branch], tree->persistent);
		}

last_dual_branch->branches[last_dual_branch_branch] = NULL;
	}

return SUCCESS;
}

void phpdbg_btree_clean_recursive(phpdbg_btree_branch *branch, zend_ulong depth, zend_bool persistent) {
	phpdbg_btree_branch *start = branch;
	while (depth--) {
		zend_bool use_branch = branch + 1 == branch->branches[0];
		if (branch->branches[use_branch]) {
			phpdbg_btree_clean_recursive(branch->branches[use_branch], depth, persistent);
		}
	}

pefree(start, persistent);
}

void phpdbg_btree_clean(phpdbg_btree *tree) {
	if (tree->branch) {
		phpdbg_btree_clean_recursive(tree->branch, tree->depth, tree->persistent);
		tree->branch = NULL;
		tree->count = 0;
	}
}

void phpdbg_btree_branch_dump(phpdbg_btree_branch *branch, zend_ulong depth) {
	if (branch) {
		if (depth--) {
			phpdbg_btree_branch_dump(branch->branches[0], depth);
			phpdbg_btree_branch_dump(branch->branches[1], depth);
		} else {
			fprintf(stderr, "%p: %p\n", (void *) branch->result.idx, branch->result.ptr);
		}
	}
}

void phpdbg_btree_dump(phpdbg_btree *tree) {
	phpdbg_btree_branch_dump(tree->branch, tree->depth);
}