2016-09-28 01:01:46 +00:00
|
|
|
<?php
|
|
|
|
/**
|
|
|
|
* Pterodactyl - Panel
|
2017-01-24 22:57:08 +00:00
|
|
|
* Copyright (c) 2015 - 2017 Dane Everitt <dane@daneeveritt.com>.
|
2016-09-28 01:01:46 +00:00
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in all
|
|
|
|
* copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
* SOFTWARE.
|
|
|
|
*/
|
2016-12-07 22:46:38 +00:00
|
|
|
|
2016-09-28 01:01:46 +00:00
|
|
|
namespace Pterodactyl\Services;
|
|
|
|
|
|
|
|
use DB;
|
|
|
|
use Pterodactyl\Models;
|
|
|
|
use Pterodactyl\Exceptions\DisplayException;
|
|
|
|
|
|
|
|
class DeploymentService
|
|
|
|
{
|
|
|
|
/**
|
|
|
|
* Return a random location model. DO NOT USE.
|
|
|
|
*
|
2017-03-19 23:36:50 +00:00
|
|
|
* @return \Pterodactyl\Models\Node
|
|
|
|
* @todo Actually make this smarter. If we're selecting a random location
|
2016-09-28 01:01:46 +00:00
|
|
|
* but then it has no nodes we should probably continue attempting all locations
|
|
|
|
* until we hit one.
|
|
|
|
*/
|
|
|
|
public static function randomLocation()
|
|
|
|
{
|
|
|
|
return Models\Location::inRandomOrder()->first();
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return a model instance of a random node.
|
2017-03-19 23:36:50 +00:00
|
|
|
* @param int $location
|
|
|
|
* @param array $not
|
2016-09-28 01:01:46 +00:00
|
|
|
* @return \Pterodactyl\Models\Node
|
|
|
|
*
|
|
|
|
* @throws \Pterodactyl\Exceptions\DisplayException
|
|
|
|
*/
|
|
|
|
public static function randomNode($location, array $not = [])
|
|
|
|
{
|
2016-10-07 18:26:37 +00:00
|
|
|
$useLocation = Models\Location::where('id', $location)->first();
|
2016-12-07 22:46:38 +00:00
|
|
|
if (! $useLocation) {
|
|
|
|
throw new DisplayException('The location passed was not valid and could not be found.');
|
2016-10-07 18:26:37 +00:00
|
|
|
}
|
2016-09-28 01:01:46 +00:00
|
|
|
|
2017-02-16 18:56:28 +00:00
|
|
|
$node = Models\Node::where('location_id', $useLocation->id)->where('public', 1)->whereNotIn('id', $not)->inRandomOrder()->first();
|
2016-12-07 22:46:38 +00:00
|
|
|
if (! $node) {
|
2016-09-28 01:01:46 +00:00
|
|
|
throw new DisplayException("Unable to find a node in location {$useLocation->short} (id: {$useLocation->id}) that is available and has space.");
|
|
|
|
}
|
|
|
|
|
|
|
|
return $node;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Selects a random node ensuring it does not put the node
|
|
|
|
* over allocation limits.
|
2017-03-19 23:36:50 +00:00
|
|
|
* @param int $memory
|
|
|
|
* @param int $disk
|
|
|
|
* @param null|int $location
|
2017-03-11 20:02:04 +00:00
|
|
|
* @return \Pterodactyl\Models\Node
|
2016-09-28 01:01:46 +00:00
|
|
|
*
|
|
|
|
* @throws \Pterodactyl\Exceptions\DisplayException
|
|
|
|
*/
|
2016-12-07 22:46:38 +00:00
|
|
|
public static function smartRandomNode($memory, $disk, $location = null)
|
|
|
|
{
|
2016-09-28 01:01:46 +00:00
|
|
|
$node = self::randomNode($location);
|
|
|
|
$notIn = [];
|
|
|
|
do {
|
|
|
|
$return = self::checkNodeAllocation($node, $memory, $disk);
|
2016-12-07 22:46:38 +00:00
|
|
|
if (! $return) {
|
2016-09-28 01:01:46 +00:00
|
|
|
$notIn = array_merge($notIn, [
|
2016-12-07 22:46:38 +00:00
|
|
|
$node->id,
|
2016-09-28 01:01:46 +00:00
|
|
|
]);
|
|
|
|
$node = self::randomNode($location, $notIn);
|
|
|
|
}
|
2016-12-07 22:46:38 +00:00
|
|
|
} while (! $return);
|
2016-09-28 01:01:46 +00:00
|
|
|
|
|
|
|
return $node;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns a random allocation for a node.
|
2017-03-19 23:36:50 +00:00
|
|
|
* @param int $node
|
2017-03-11 20:02:04 +00:00
|
|
|
* @return \Models\Pterodactyl\Allocation
|
2016-09-28 01:01:46 +00:00
|
|
|
*/
|
|
|
|
public static function randomAllocation($node)
|
|
|
|
{
|
2017-02-16 18:56:28 +00:00
|
|
|
$allocation = Models\Allocation::where('node_id', $node)->whereNull('server_id')->inRandomOrder()->first();
|
2016-12-07 22:46:38 +00:00
|
|
|
if (! $allocation) {
|
2016-09-28 21:32:08 +00:00
|
|
|
throw new DisplayException('No available allocation could be found for the assigned node.');
|
|
|
|
}
|
|
|
|
|
|
|
|
return $allocation;
|
2016-09-28 01:01:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Checks that a node's allocation limits will not be passed with the given information.
|
|
|
|
* @param \Pterodactyl\Models\Node $node
|
2017-03-19 23:36:50 +00:00
|
|
|
* @param int $memory
|
|
|
|
* @param int $disk
|
2016-09-28 01:01:46 +00:00
|
|
|
* @return bool Returns true if this information would not put the node over it's limit.
|
|
|
|
*/
|
|
|
|
protected static function checkNodeAllocation(Models\Node $node, $memory, $disk)
|
|
|
|
{
|
|
|
|
if (is_numeric($node->memory_overallocate) || is_numeric($node->disk_overallocate)) {
|
2017-02-16 18:56:28 +00:00
|
|
|
$totals = Models\Server::select(DB::raw('SUM(memory) as memory, SUM(disk) as disk'))->where('node_id', $node->id)->first();
|
2016-09-28 01:01:46 +00:00
|
|
|
|
|
|
|
// Check memory limits
|
|
|
|
if (is_numeric($node->memory_overallocate)) {
|
|
|
|
$limit = ($node->memory * (1 + ($node->memory_overallocate / 100)));
|
|
|
|
$memoryLimitReached = (($totals->memory + $memory) > $limit);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check Disk Limits
|
|
|
|
if (is_numeric($node->disk_overallocate)) {
|
|
|
|
$limit = ($node->disk * (1 + ($node->disk_overallocate / 100)));
|
|
|
|
$diskLimitReached = (($totals->disk + $disk) > $limit);
|
|
|
|
}
|
|
|
|
|
2016-12-07 22:46:38 +00:00
|
|
|
return ! $diskLimitReached && ! $memoryLimitReached;
|
2016-09-28 01:01:46 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|