* [WIP] Torrent Generation on not found error As asked in #1517, it allows on-the-fly torrent generation. Since it uses magnet links, it needs some time to connect to peers. So it can't be instant generation, we need the user to wait and try after a minute at least. * Replace Fatal by simple error * attempt at fixing travis * del * Add Anacrolyx dependency * Add back difflib * Remove .torrent suffix in the url example * Add some explanations when file missing page shown * Ignore downloads directory * Either use cache (third-party site) or own download directory * Wrong import * If there is an error then it means we aren't generating a torrent file May it be "torrent not found" or "We do not store torrent files" which are the two only existing errors for this page * hash is never empty * TorrentLink may be empty at times So we add a /download/:hash link if it is * Update README.md * Made a mistake here, need to check if false * Update en-us.all.json * Update CHANGELOG.md * Torrent file generation can be triggered by click on button if JS enabled * Update download.go * Update download.go * Use c.JSON instead of text/template * Return to default behavior if we don't generate the file * Don't do the query if returned to default behavior * Add "Could not generate torrent file" error * Fix JS condition & lower delay until button updates * Start download automatically once torrent file is generated * Fix torrentFileExists() constantly returning false if external torrent download URL * torrent-view-data is two tables instead of one This allows the removal of useless things without any problem (e.g Website link), but also a better responsibe design since the previous one separated stats after a certain res looking very wonky * CSS changes to go along * Remove useless <b></b> * Update main.css * In torrentFileExists, check if filestorage path exists instead of looking at the domain in torrent link When checking if the file is stored on another server i used to simply check if the domain name was inside the torrent link, but we can straight up check for filestorage length * Fix JS of on-demand stat fetching * ScrapeAge variable accessible through view.jet.html Contains last scraped time in hours, is at -1 is torrent has never been scraped Stats will get updated if it's either at -1 or above 1460 (2 months old) * Refresh stats if older than two months OR unknown and older than 24h Show last scraped date even if stats are unknown * Add StatsObsolete variable to torrent Indicating if: - They can be shown - They need to be updated * Update scraped data even if Unknown, prevent users from trying to fetch stats every seconds * Torrent file stored locally by default * no need to do all of that if no filestorage * fix filestorage path * Fix torrent download button stuck on "Generating torrent file" at rare times * fix some css rules that didn't work on IE * Fix panic error Seems like this error is a known bug from anacrolyx torrent https://github.com/anacrolix/torrent/issues/83 To prevent it, I'm creating a single client and modifying the socket.go to make it not raise a panic but a simple error log.
125 lignes
3,7 Kio
Go
125 lignes
3,7 Kio
Go
// Copyright 2011 Evan Shaw. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package mmap
|
|
|
|
import (
|
|
"errors"
|
|
"os"
|
|
"sync"
|
|
"syscall"
|
|
)
|
|
|
|
// mmap on Windows is a two-step process.
|
|
// First, we call CreateFileMapping to get a handle.
|
|
// Then, we call MapviewToFile to get an actual pointer into memory.
|
|
// Because we want to emulate a POSIX-style mmap, we don't want to expose
|
|
// the handle -- only the pointer. We also want to return only a byte slice,
|
|
// not a struct, so it's convenient to manipulate.
|
|
|
|
// We keep this map so that we can get back the original handle from the memory address.
|
|
var handleLock sync.Mutex
|
|
var handleMap = map[uintptr]syscall.Handle{}
|
|
|
|
func mmap(len int, prot, flags, hfile uintptr, off int64) ([]byte, error) {
|
|
flProtect := uint32(syscall.PAGE_READONLY)
|
|
dwDesiredAccess := uint32(syscall.FILE_MAP_READ)
|
|
switch {
|
|
case prot© != 0:
|
|
flProtect = syscall.PAGE_WRITECOPY
|
|
dwDesiredAccess = syscall.FILE_MAP_COPY
|
|
case prot&RDWR != 0:
|
|
flProtect = syscall.PAGE_READWRITE
|
|
dwDesiredAccess = syscall.FILE_MAP_WRITE
|
|
}
|
|
if prot&EXEC != 0 {
|
|
flProtect <<= 4
|
|
dwDesiredAccess |= syscall.FILE_MAP_EXECUTE
|
|
}
|
|
|
|
// The maximum size is the area of the file, starting from 0,
|
|
// that we wish to allow to be mappable. It is the sum of
|
|
// the length the user requested, plus the offset where that length
|
|
// is starting from. This does not map the data into memory.
|
|
maxSizeHigh := uint32((off + int64(len)) >> 32)
|
|
maxSizeLow := uint32((off + int64(len)) & 0xFFFFFFFF)
|
|
// TODO: Do we need to set some security attributes? It might help portability.
|
|
h, errno := syscall.CreateFileMapping(syscall.Handle(hfile), nil, flProtect, maxSizeHigh, maxSizeLow, nil)
|
|
if h == 0 {
|
|
return nil, os.NewSyscallError("CreateFileMapping", errno)
|
|
}
|
|
|
|
// Actually map a view of the data into memory. The view's size
|
|
// is the length the user requested.
|
|
fileOffsetHigh := uint32(off >> 32)
|
|
fileOffsetLow := uint32(off & 0xFFFFFFFF)
|
|
addr, errno := syscall.MapViewOfFile(h, dwDesiredAccess, fileOffsetHigh, fileOffsetLow, uintptr(len))
|
|
if addr == 0 {
|
|
return nil, os.NewSyscallError("MapViewOfFile", errno)
|
|
}
|
|
handleLock.Lock()
|
|
handleMap[addr] = h
|
|
handleLock.Unlock()
|
|
|
|
m := MMap{}
|
|
dh := m.header()
|
|
dh.Data = addr
|
|
dh.Len = len
|
|
dh.Cap = dh.Len
|
|
|
|
return m, nil
|
|
}
|
|
|
|
func flush(addr, len uintptr) error {
|
|
errno := syscall.FlushViewOfFile(addr, len)
|
|
if errno != nil {
|
|
return os.NewSyscallError("FlushViewOfFile", errno)
|
|
}
|
|
|
|
handleLock.Lock()
|
|
defer handleLock.Unlock()
|
|
handle, ok := handleMap[addr]
|
|
if !ok {
|
|
// should be impossible; we would've errored above
|
|
return errors.New("unknown base address")
|
|
}
|
|
|
|
errno = syscall.FlushFileBuffers(handle)
|
|
return os.NewSyscallError("FlushFileBuffers", errno)
|
|
}
|
|
|
|
func lock(addr, len uintptr) error {
|
|
errno := syscall.VirtualLock(addr, len)
|
|
return os.NewSyscallError("VirtualLock", errno)
|
|
}
|
|
|
|
func unlock(addr, len uintptr) error {
|
|
errno := syscall.VirtualUnlock(addr, len)
|
|
return os.NewSyscallError("VirtualUnlock", errno)
|
|
}
|
|
|
|
func unmap(addr, len uintptr) error {
|
|
flush(addr, len)
|
|
// Lock the UnmapViewOfFile along with the handleMap deletion.
|
|
// As soon as we unmap the view, the OS is free to give the
|
|
// same addr to another new map. We don't want another goroutine
|
|
// to insert and remove the same addr into handleMap while
|
|
// we're trying to remove our old addr/handle pair.
|
|
handleLock.Lock()
|
|
defer handleLock.Unlock()
|
|
err := syscall.UnmapViewOfFile(addr)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
handle, ok := handleMap[addr]
|
|
if !ok {
|
|
// should be impossible; we would've errored above
|
|
return errors.New("unknown base address")
|
|
}
|
|
delete(handleMap, addr)
|
|
|
|
e := syscall.CloseHandle(syscall.Handle(handle))
|
|
return os.NewSyscallError("CloseHandle", e)
|
|
}
|