@@ -120,6 +120,9 @@ discard block |
||
| 120 | 120 | return $this->resolveDataPointer($pointer); |
| 121 | 121 | } |
| 122 | 122 | |
| 123 | + /** |
|
| 124 | + * @param string $ipAddress |
|
| 125 | + */ |
|
| 123 | 126 | private function findAddressInTree($ipAddress) |
| 124 | 127 | { |
| 125 | 128 | // XXX - could simplify. Done as a byte array to ease porting |
@@ -150,6 +153,9 @@ discard block |
||
| 150 | 153 | throw new InvalidDatabaseException('Something bad happened'); |
| 151 | 154 | } |
| 152 | 155 | |
| 156 | + /** |
|
| 157 | + * @param integer $length |
|
| 158 | + */ |
|
| 153 | 159 | private function startNode($length) |
| 154 | 160 | { |
| 155 | 161 | // Check if we are looking up an IPv4 address in an IPv6 tree. If this |
@@ -183,6 +189,9 @@ discard block |
||
| 183 | 189 | return $node; |
| 184 | 190 | } |
| 185 | 191 | |
| 192 | + /** |
|
| 193 | + * @param integer $index |
|
| 194 | + */ |
|
| 186 | 195 | private function readNode($nodeNumber, $index) |
| 187 | 196 | { |
| 188 | 197 | $baseOffset = $nodeNumber * $this->metadata->nodeByteSize; |
@@ -239,6 +248,10 @@ discard block |
||
| 239 | 248 | * are much faster algorithms (e.g., Boyer-Moore) for this if speed is ever |
| 240 | 249 | * an issue, but I suspect it won't be. |
| 241 | 250 | */ |
| 251 | + |
|
| 252 | + /** |
|
| 253 | + * @param string $filename |
|
| 254 | + */ |
|
| 242 | 255 | private function findMetadataStart($filename) |
| 243 | 256 | { |
| 244 | 257 | $handle = $this->fileHandle; |