jitavl.c

/*******************************************************************************
 * Copyright IBM Corp. and others 1991
 *
 * This program and the accompanying materials are made available under
 * the terms of the Eclipse Public License 2.0 which accompanies this
 * distribution and is available at https://www.eclipse.org/legal/epl-2.0/
 * or the Apache License, Version 2.0 which accompanies this distribution and
 * is available at https://www.apache.org/licenses/LICENSE-2.0.
 *
 * This Source Code may also be made available under the following
 * Secondary Licenses when the conditions for such availability set
 * forth in the Eclipse Public License, v. 2.0 are satisfied: GNU
 * General Public License, version 2 with the GNU Classpath
 * Exception [1] and GNU General Public License, version 2 with the
 * OpenJDK Assembly Exception [2].
 *
 * [1] https://www.gnu.org/software/classpath/license.html
 * [2] https://openjdk.org/legal/assembly-exception.html
 *
 * SPDX-License-Identifier: EPL-2.0 OR Apache-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0 OR GPL-2.0-only WITH OpenJDK-assembly-exception-1.0
 *******************************************************************************/

#include "j9.h"

#include "jitavl.h"
#include "jithash.h"


void avl_jit_artifact_free_all(J9JavaVM *javaVM, J9AVLTree *tree) {
	PORT_ACCESS_FROM_PORT(javaVM->portLibrary);

	avl_jit_artifact_free_node(PORTLIB, (J9JITHashTable *)tree->rootNode);
	j9mem_free_memory(tree);
}


void avl_jit_artifact_free_node(J9PortLibrary *portLib, J9JITHashTable *nodeToDelete) {
	PORT_ACCESS_FROM_PORT(portLib);

	if (!nodeToDelete) {
		return;
	}

	avl_jit_artifact_free_node(portLib, (J9JITHashTable *)J9JITHASHTABLE_LEFTCHILD(nodeToDelete));
	avl_jit_artifact_free_node(portLib, (J9JITHashTable *)J9JITHASHTABLE_RIGHTCHILD(nodeToDelete));

	if ( !(nodeToDelete->flags & JIT_HASH_IN_DATA_CACHE)) {
		hash_jit_free(portLib, nodeToDelete);
	}
}



IDATA avl_jit_artifact_insertionCompare(J9AVLTree *tree, J9JITHashTable *insertNode, J9JITHashTable *walkNode) {
	if (walkNode->start > insertNode->start) {
		return 1;
	} else if (walkNode->start < insertNode->start) {
		return -1;
	}
	return 0;
}




IDATA avl_jit_artifact_searchCompare(J9AVLTree *tree, UDATA searchValue, J9JITHashTable *walkNode) {
	if (searchValue >= walkNode->end)
		return -1;

	if (searchValue < walkNode->start)
		return 1;
	
	return 0;
}