+
+ function geocodeReverse($fLat, $fLon, $iZoom=18)
+ {
+ $oDB =& getDB();
+
+ $sPointSQL = "ST_SetSRID(ST_Point($fLon,$fLat),4326)";
+
+ // Zoom to rank, this could probably be calculated but a lookup gives fine control
+ $aZoomRank = array(
+ 0 => 2, // Continent / Sea
+ 1 => 2,
+ 2 => 2,
+ 3 => 4, // Country
+ 4 => 4,
+ 5 => 8, // State
+ 6 => 10, // Region
+ 7 => 10,
+ 8 => 12, // County
+ 9 => 12,
+ 10 => 17, // City
+ 11 => 17,
+ 12 => 18, // Town / Village
+ 13 => 18,
+ 14 => 22, // Suburb
+ 15 => 22,
+ 16 => 26, // Street, TODO: major street?
+ 17 => 26,
+ 18 => 30, // or >, Building
+ 19 => 30, // or >, Building
+ );
+ $iMaxRank = isset($aZoomRank[$iZoom])?$aZoomRank[$iZoom]:28;
+
+ // Find the nearest point
+ $fSearchDiam = 0.0001;
+ $iPlaceID = null;
+ $aArea = false;
+ $fMaxAreaDistance = 1;
+ while(!$iPlaceID && $fSearchDiam < $fMaxAreaDistance)
+ {
+ $fSearchDiam = $fSearchDiam * 2;
+
+ // If we have to expand the search area by a large amount then we need a larger feature
+ // then there is a limit to how small the feature should be
+ if ($fSearchDiam > 2 && $iMaxRank > 4) $iMaxRank = 4;
+ if ($fSearchDiam > 1 && $iMaxRank > 9) $iMaxRank = 8;
+ if ($fSearchDiam > 0.8 && $iMaxRank > 10) $iMaxRank = 10;
+ if ($fSearchDiam > 0.6 && $iMaxRank > 12) $iMaxRank = 12;
+ if ($fSearchDiam > 0.2 && $iMaxRank > 17) $iMaxRank = 17;
+ if ($fSearchDiam > 0.1 && $iMaxRank > 18) $iMaxRank = 18;
+ if ($fSearchDiam > 0.008 && $iMaxRank > 22) $iMaxRank = 22;
+ if ($fSearchDiam > 0.001 && $iMaxRank > 26) $iMaxRank = 26;
+
+ $sSQL = 'select place_id,parent_place_id from placex';
+ $sSQL .= ' WHERE ST_DWithin('.$sPointSQL.', geometry, '.$fSearchDiam.')';
+ $sSQL .= ' and rank_search != 28 and rank_search >= '.$iMaxRank;
+ $sSQL .= ' and (name is not null or housenumber is not null)';
+ $sSQL .= ' and class not in (\'waterway\')';
+ $sSQL .= ' and (ST_GeometryType(geometry) not in (\'ST_Polygon\',\'ST_MultiPolygon\') ';
+ $sSQL .= ' OR ST_DWithin('.$sPointSQL.', ST_Centroid(geometry), '.$fSearchDiam.'))';
+ $sSQL .= ' ORDER BY ST_distance('.$sPointSQL.', geometry) ASC limit 1';
+//var_dump($sSQL);
+ $aPlace = $oDB->getRow($sSQL);
+ $iPlaceID = $aPlace['place_id'];
+ if (PEAR::IsError($iPlaceID))
+ {
+ var_Dump($sSQL, $iPlaceID);
+ exit;
+ }
+ }
+
+ // The point we found might be too small - use the address to find what it is a child of
+ if ($iPlaceID)
+ {
+ $sSQL = "select address_place_id from place_addressline where cached_rank_address <= $iMaxRank and place_id = $iPlaceID order by cached_rank_address desc,isaddress desc,distance desc limit 1";
+ $iPlaceID = $oDB->getOne($sSQL);
+ if (PEAR::IsError($iPlaceID))
+ {
+ var_Dump($sSQL, $iPlaceID);
+ exit;
+ }
+
+ if ($iPlaceID && $aPlace['place_id'] && $iMaxRank < 28)
+ {
+ $sSQL = "select address_place_id from place_addressline where cached_rank_address <= $iMaxRank and place_id = ".$aPlace['place_id']." order by cached_rank_address desc,isaddress desc,distance desc";
+ $iPlaceID = $oDB->getOne($sSQL);
+ if (PEAR::IsError($iPlaceID))
+ {
+ var_Dump($sSQL, $iPlaceID);
+ exit;
+ }
+ }
+ if (!$iPlaceID)
+ {
+ $iPlaceID = $aPlace['place_id'];
+ }
+ }
+
+ return $iPlaceID;
+ }
+
+ function loadStructuredAddressElement(&$aStructuredQuery, &$iMinAddressRank, &$iMaxAddressRank, $aParams, $sKey, $iNewMinAddressRank, $iNewMaxAddressRank)
+ {
+ if (!isset($_GET[$sKey])) return false;
+ $sValue = trim($_GET[$sKey]);
+ if (!$sValue) return false;
+ $aStructuredQuery[$sKey] = $sValue;
+ if ($iMinAddressRank == 0 && $iMaxAddressRank == 30) {
+ $iMinAddressRank = $iNewMinAddressRank;
+ $iMaxAddressRank = $iNewMaxAddressRank;
+ }
+ return true;
+ }
+
+ function getBucketMemcache()
+ {
+ static $m;
+
+ if (!CONST_ConnectionBucket_MemcacheServerAddress) return null;
+ if (!isset($m))
+ {
+ $m = new Memcached();
+ $m->addServer(CONST_ConnectionBucket_MemcacheServerAddress, CONST_ConnectionBucket_MemcacheServerPort);
+ }
+ return $m;
+ }
+
+ function doBucket($asKey, $iRequestCost, $iLeakPerSecond, $iThreshold)
+ {
+ $m = getBucketMemcache();
+ if (!$m) return 0;
+
+ $iMaxVal = 0;
+ $t = time();
+
+ foreach($asKey as $sKey)
+ {
+ $aCurrentBlock = $m->get($sKey);
+ if (!$aCurrentBlock)
+ {
+ $aCurrentBlock = array($iRequestCost, $t);
+ }
+ else
+ {
+ // add RequestCost
+ // remove leak * the time since the last request
+ $aCurrentBlock[0] += $iRequestCost - ($t - $aCurrentBlock[1])*$iLeakPerSecond;
+ $aCurrentBlock[1] = $t;
+ }
+
+ if ($aCurrentBlock[0] <= 0)
+ {
+ $m->delete($sKey);
+ }
+ else
+ {
+ // If we have hit the threshold stop and record this to the block list
+ if ($aCurrentBlock[0] >= $iThreshold)
+ {
+ $aCurrentBlock[0] = $iThreshold;
+
+ // Make up to 10 attempts to record this to memcache (with locking to prevent conflicts)
+ $i = 10;
+ for($i = 0; $i < 10; $i++)
+ {
+ $aBlockedList = $m->get('blockedList', null, $hCasToken);
+ if (!$aBlockedList)
+ {
+ $aBlockedList = array();
+ $m->add('blockedList', $aBlockedList);
+ $aBlockedList = $m->get('blockedList', null, $hCasToken);
+ }
+ if (!isset($aBlockedList[$sKey]))
+ {
+ $aBlockedList[$sKey] = array(1, $t);
+ }
+ else
+ {
+ $aBlockedList[$sKey][0]++;
+ $aBlockedList[$sKey][1] = $t;
+ }
+ $x = $m->cas($hCasToken, 'blockedList', $aBlockedList);
+ if ($x) break;
+ }
+ }
+ // Only keep in memcache until the time it would have expired (to avoid clutering memcache)
+ $m->set($sKey, $aCurrentBlock, $t + 1 + $aCurrentBlock[0]/$iLeakPerSecond);
+ }
+
+ // Bucket result in the largest bucket we find
+ $iMaxVal = max($iMaxVal, $aCurrentBlock[0]);
+ }
+
+ return $iMaxVal;
+ }
+
+ function byLastBlockTime($a, $b)
+ {
+ if ($a['lastBlockTimestamp'] == $b['lastBlockTimestamp'])
+ {
+ return 0;
+ }
+ return ($a['lastBlockTimestamp'] > $b['lastBlockTimestamp']) ? -1 : 1;
+ }
+
+ function getBucketBlocks()
+ {
+ $m = getBucketMemcache();
+ if (!$m) return null;
+ $t = time();
+ $aBlockedList = $m->get('blockedList', null, $hCasToken);
+ if (!$aBlockedList) $aBlockedList = array();
+ foreach($aBlockedList as $sKey => $aDetails)
+ {
+ $aCurrentBlock = $m->get($sKey);
+ if (!$aCurrentBlock) $aCurrentBlock = array(0, $t);
+ $iCurrentBucketSize = max(0, $aCurrentBlock[0] - ($t - $aCurrentBlock[1])*CONST_ConnectionBucket_LeakRate);
+ $aBlockedList[$sKey] = array(
+ 'totalBlocks' => $aDetails[0],
+ 'lastBlockTimestamp' => $aDetails[1],
+ 'currentBucketSize' => $iCurrentBucketSize,
+ 'lastRequestBlocked' => $aCurrentBlock[0] >= CONST_ConnectionBucket_BlockLimit,
+ 'currentlyBlocked' => $iCurrentBucketSize + (CONST_ConnectionBucket_Cost_Reverse) >= CONST_ConnectionBucket_BlockLimit,
+ );
+ }
+ uasort($aBlockedList, 'byLastBlockTime');
+ return $aBlockedList;
+ }
+
+ function clearBucketBlocks()
+ {
+ $m = getBucketMemcache();
+ if (!$m) return false;
+ $m->delete('blockedList');
+ return true;
+ }
projects / nominatim.git / blobdiff