greenplumn memquota_test 源码

2022-08-18
浏览 (169)

greenplumn memquota_test 代码

文件路径：/src/backend/utils/resource_manager/test/memquota_test.c

#include <stdarg.h>
#include <stddef.h>
#include <setjmp.h>
#include "cmockery.h"

#include "postgres.h"
#include "utils/memutils.h"

#include "../memquota.c"

/* ==================== ComputeMemLimitForChildGroups ==================== */

/*
 * Tests that EagerFree computes the memory limits for child groups accurately
 * No rounding error is allowed due to scaleFactor. The sum of the child group
 * memory amounts must equal the sum of the parent group (MPP-23130)
 */
static void
test__ComputeMemLimitForChildGroups_rounding(void **state)
{
	OperatorGroupNode *parentGroup = (OperatorGroupNode *) palloc0(sizeof(OperatorGroupNode));
	OperatorGroupNode *childGroup1 = (OperatorGroupNode *) palloc0(sizeof(OperatorGroupNode));
	OperatorGroupNode *childGroup2 = (OperatorGroupNode *) palloc0(sizeof(OperatorGroupNode));

	parentGroup->childGroups = NIL;
	parentGroup->childGroups = lappend(parentGroup->childGroups, childGroup1);
	parentGroup->childGroups = lappend(parentGroup->childGroups, childGroup2);

	*gp_resmanager_memory_policy_auto_fixed_mem = 100;

	/* Case where rounding does not cause error */
	parentGroup->groupMemKB = 3000;
	childGroup1->numMemIntenseOps = 2;
	childGroup2->numMemIntenseOps = 3;

	childGroup1->numNonMemIntenseOps = 2;
	childGroup2->numNonMemIntenseOps = 3;

	/*
	 * For these values, we have the following:
	 *   parentGroupMemKB = 3000
	 *
	 *   childGroupMemKB_1 = 1200 ; SF_1 = 0.4
	 *   ===> Calculation with rounding: (1200 / 0.4) * 0.4 = 1200
	 *
	 *   childGroupMemKB_2 = 1800 ; SF_2 = 0.6
	 *   ===> Calculation with rounding: (1800 / 0.6) * 0.6 = 1800
	 *
	 *   Assert: 1200 + 1800 = 3000, PASS
	 */

	ComputeMemLimitForChildGroups(parentGroup);

	assert_int_equal(childGroup1->groupMemKB + childGroup2->groupMemKB, parentGroup->groupMemKB);


	/* Case where rounding would cause error */
	MemSet(childGroup1, 0, sizeof(OperatorGroupNode));
	MemSet(childGroup2, 0, sizeof(OperatorGroupNode));

	parentGroup->groupMemKB = 3000;
	childGroup1->numMemIntenseOps = 2;
	childGroup2->numMemIntenseOps = 3;

	childGroup1->numNonMemIntenseOps = 2;
	childGroup2->numNonMemIntenseOps = 4;

	/*
	 * For these values, we have the following:
	 *   parentGroupMemKB = 3000
	 *
	 *   childGroupMemKB_1 = 1160 ; SF_1 = 0.386667
	 *   ===> Calculation with rounding: (1160 /  0.386667) *  0.386667 = 1160
	 *
	 *   childGroupMemKB_2 = 1840 ; SF_2 = 0.613333
	 *   ===> Calculation with rounding: (1840 / 0.613333) * 0.613333 = 1839 (!)
	 *
	 *   Assert: 1160 + 1839 = 2999, FAIL!!
	 */

	ComputeMemLimitForChildGroups(parentGroup);

	assert_int_equal(childGroup1->groupMemKB + childGroup2->groupMemKB, parentGroup->groupMemKB);

}

/* ==================== main ==================== */
int
main(int argc, char* argv[])
{
	cmockery_parse_arguments(argc, argv);

	const UnitTest tests[] = {
		unit_test(test__ComputeMemLimitForChildGroups_rounding)
	};

	MemoryContextInit();

	return run_tests(tests);
}

相关信息

greenplumn 源码目录

相关文章

greenplumn adminpack 源码

greenplumn verify_nbtree 源码

greenplumn auth_delay 源码

greenplumn auto_explain 源码

greenplumn blcost 源码

greenplumn blinsert 源码

greenplumn bloom 源码

greenplumn blscan 源码

greenplumn blutils 源码

greenplumn blvacuum 源码

0 赞

所属分类： 大数据
本文标签： greenplum
版权声明： 原创文章如转载，请注明本文链接: https://www.seaxiang.com/blog/e6e6992891a544a09de0444a2bd6791e

热门推荐

1、直接访问google.com
2、 - 优质文章
3、 gate.io
4、 harmony 鸿蒙hdc使用指导
5、 harmony 鸿蒙初识ArkTS语言
6、 flink kafka connector scan.startup.mode 的几个选项
7、 openharmony
8、 golang
9、 harmony 鸿蒙ArkUI组件（ArkTS）开发常见问题
10、 Vue中input框自动聚焦

Loading...