android扫描内存,基于frida的android游戏内存扫描器_初稿

[JavaScript] 纯文本查看 复制代码function next_scan_equal(value)

{

var m_count = 0;

for(key in g_data)

{

if(readValue(key, init_value, init_byte_length) != value)

{

delete g_data[key]

}else{

g_data[key] = value

}

}

m_count = Object.keys(g_data).length

if(m_count < 100)

{

for(var key in g_data)

{

console.log("\033[1;32;40maddress: \033[0m" + '\033[1;33;40m' + key + '\033[0m' + "\033[1;32;40m value: \033[0m"+ '\033[1;33;40m' + g_data[key] + '\033[0m');

}

}

return m_count;

}

function next_scan_unchange()

{

var m_count = 0;

for(key in g_data)

{

if(readValue(key, init_value, init_byte_length) != g_data[key])

{

delete g_data[key]

}

}

m_count = Object.keys(g_data).length

if(m_count < 100)

{

for(var key in g_data)

{

console.log("\033[1;32;40maddress: \033[0m" + '\033[1;33;40m' + key + '\033[0m' + "\033[1;32;40m value: \033[0m"+ '\033[1;33;40m' + g_data[key] + '\033[0m');

}

}

return m_count;

}

function next_scan_change()

{

var m_count = 0;

for(key in g_data)

{

var new_value = readValue(key, init_value, init_byte_length)

if(new_value == g_data[key])

{

delete g_data[key]

}else{

g_data[key] = new_value

}

}

m_count = Object.keys(g_data).length

if(m_count < 100)

{

for(var key in g_data)

{

console.log("\033[1;32;40maddress: \033[0m" + '\033[1;33;40m' + key + '\033[0m' + "\033[1;32;40m value: \033[0m"+ '\033[1;33;40m' + g_data[key] + '\033[0m');

}

}

return m_count;

}

function next_scan_littler(value)

{

var m_count = 0;

for(key in g_data)

{

var new_value = readValue(key, init_value, init_byte_length)

if(new_value >= value)

{

delete g_data[key]

}else{

g_data[key] = new_value

}

}

m_count = Object.keys(g_data).length

if(m_count < 100)

{

for(var key in g_data)

{

console.log("\033[1;32;40maddress: \033[0m" + '\033[1;33;40m' + key + '\033[0m' + "\033[1;32;40m value: \033[0m"+ '\033[1;33;40m' + g_data[key] + '\033[0m');

}

}

return m_count;

}

function next_scan_larger(value)

{

var m_count = 0;

for(key in g_data)

{

var new_value = readValue(key, init_value, init_byte_length)

if(new_value <= value)

{

delete g_data[key]

}else{

g_data[key] = new_value

}

}

m_count = Object.keys(g_data).length

if(m_count < 100)

{

for(var key in g_data)

{

console.log("\033[1;32;40maddress: \033[0m" + '\033[1;33;40m' + key + '\033[0m' + "\033[1;32;40m value: \033[0m"+ '\033[1;33;40m' + g_data[key] + '\033[0m');

}

}

return m_count;

}

function next_scan_between(value1, value2)

{

var m_count = 0;

for(key in g_data)

{

var new_value = readValue(key, init_value, init_byte_length)

if(new_value >= value1 && new_value <= value2)

{

g_data[key] = new_value

}else{

delete g_data[key]

}

}

m_count = Object.keys(g_data).length

if(m_count < 100)

{

for(var key in g_data)

{

console.log("\033[1;32;40maddress: \033[0m" + '\033[1;33;40m' + key + '\033[0m' + "\033[1;32;40m value: \033[0m"+ '\033[1;33;40m' + g_data[key] + '\033[0m');

}

}

return m_count;

}

function next_scan_increase()

{

var m_count = 0;

for(key in g_data)

{

var new_value = readValue(key, init_value, init_byte_length)

if(new_value <= g_data[key])

{

delete g_data[key]

}else{

g_data[key] = new_value

}

}

m_count = Object.keys(g_data).length

if(m_count < 100)

{

for(var key in g_data)

{

console.log("\033[1;32;40maddress: \033[0m" + '\033[1;33;40m' + key + '\033[0m' + "\033[1;32;40m value: \033[0m"+ '\033[1;33;40m' + g_data[key] + '\033[0m');

}

}

return m_count;

}

function next_scan_decrease()

{

var m_count = 0;

for(key in g_data)

{

var new_value = readValue(key, init_value, init_byte_length)

if(new_value >= g_data[key])

{

delete g_data[key]

}else{

g_data[key] = new_value

}

}

m_count = Object.keys(g_data).length

if(m_count < 100)

{

for(var key in g_data)

{

console.log("\033[1;32;40maddress: \033[0m" + '\033[1;33;40m' + key + '\033[0m' + "\033[1;32;40m value: \033[0m"+ '\033[1;33;40m' + g_data[key] + '\033[0m');

}

}

return m_count;

}

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值