HttpUtils.cc

// -*- mode: c++; c-basic-offset:4 -*-
// This file is part of the BES http package, part of the Hyrax data server.
 
// Copyright (c) 2020 OPeNDAP, Inc.
// Author: Nathan Potter <ndp@opendap.org>
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
//
// You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.
 
// Authors:
//      ndp       Nathan Potter <ndp@opendap.org>
 
#include "config.h"
 
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
 
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <sstream>
#include <time.h>
 
#include <curl/curl.h>
 
#include "BESUtil.h"
#include "BESCatalogUtils.h"
#include "BESCatalogList.h"
#include "BESCatalog.h"
#include "BESRegex.h"
#include "TheBESKeys.h"
#include "BESInternalError.h"
#include "BESNotFoundError.h"
#include "BESSyntaxUserError.h"
#include "BESDebug.h"
#include "BESUtil.h"
 
#include "HttpNames.h"
#include "HttpUtils.h"
#include "ProxyConfig.h"
 
#define MODULE "http"
 
using namespace std;
using namespace http;
 
// These are static class members
 
#define prolog string("HttpUtils::").append(__func__).append("() - ")
 
namespace http {
void load_mime_list_from_keys(map<string, string> &mime_list)
{
    // MimeTypes - translate from a mime type to a module name
    bool found = false;
    vector<string> vals;
    TheBESKeys::TheKeys()->get_values(HTTP_MIMELIST_KEY, vals, found);
    if (found && vals.size()) {
        vector<string>::iterator i = vals.begin();
        vector<string>::iterator e = vals.end();
        for (; i != e; i++) {
            size_t colon = (*i).find(":");
            if (colon == string::npos) {
                string err = (string) "Malformed " + HTTP_MIMELIST_KEY + " " + (*i) +
                             " specified in the gateway configuration";
                throw BESSyntaxUserError(err, __FILE__, __LINE__);
            }
            string mod = (*i).substr(0, colon);
            string mime = (*i).substr(colon + 1);
            mime_list[mod] = mime;
        }
    }
}
 
 
 
void get_type_from_disposition(const string &disp, string &type)
{
    // If this function extracts a filename from disp and it matches a handler's
    // regex using the Catalog Utils, this will be set to a non-empty value.
    type = "";
 
    size_t fnpos = disp.find("filename");
    if (fnpos != string::npos) {
        // Got the filename attribute, now get the
        // filename, which is after the pound sign (#)
        size_t pos = disp.find("#", fnpos);
        if (pos == string::npos) pos = disp.find("=", fnpos);
        if (pos != string::npos) {
            // Got the filename to the end of the
            // string, now get it to either the end of
            // the string or the start of the next
            // attribute
            string filename;
            size_t sp = disp.find(" ", pos);
            if (pos != string::npos) {
                // space before the next attribute
                filename = disp.substr(pos + 1, sp - pos - 1);
            } else {
                // to the end of the string
                filename = disp.substr(pos + 1);
            }
 
            BESUtil::trim_if_surrounding_quotes(filename);
 
            // we have the filename now, run it through
            // the type match to get the file type.
 
            const BESCatalogUtils *utils = BESCatalogList::TheCatalogList()->default_catalog()->get_catalog_utils();
            type = utils->get_handler_name(filename);
        }
    }
}
 
void get_type_from_content_type(const string &ctype, string &type)
{
    BESDEBUG(MODULE, prolog << "BEGIN content-type: " << ctype << endl);
    map<string,string> mime_list;
    load_mime_list_from_keys(mime_list);
    map<string, string>::iterator i = mime_list.begin();
    map<string, string>::iterator e = mime_list.end();
    bool done = false;
    for (; i != e && !done; i++) {
        BESDEBUG(MODULE, prolog << "Comparing content type '" << ctype << "' against mime list element '" << (*i).second << "'" << endl);
        BESDEBUG(MODULE, prolog << "first: " << (*i).first << "  second: " << (*i).second << endl);
        if ((*i).second == ctype) {
            BESDEBUG(MODULE, prolog << "MATCH" << endl);
            type = (*i).first;
            done = true;
        }
    }
    BESDEBUG(MODULE, prolog << "END" << endl);
}
 
void get_type_from_url(const string &url, string &type) {
    const BESCatalogUtils *utils = BESCatalogList::TheCatalogList()->find_catalog("catalog")->get_catalog_utils();
 
    type = utils->get_handler_name(url);
}
 
size_t load_max_redirects_from_keys(){
    size_t max_redirects=0;
    bool found = false;
    string value;
    TheBESKeys::TheKeys()->get_value(HTTP_MAX_REDIRECTS_KEY, value, found);
    if (found && !value.empty()) {
        std::istringstream(value) >> max_redirects; // Returns 0 if the parse fails.
    }
    if(!max_redirects){
        max_redirects = HTTP_MAX_REDIRECTS_DEFAULT;
    }
    return max_redirects;
}
 
#if 0
    void HttpUtils::decompose_url(const string target_url, map<string,string> &url_info)
    {
        string url_base;
        string query_string;
 
        size_t query_index = target_url.find_first_of("?");
        BESDEBUG(MODULE, prolog << "query_index: " << query_index << endl);
        if(query_index != string::npos){
            query_string = target_url.substr(query_index+1);
            url_base = target_url.substr(0,query_index);
        }
        else {
            url_base = target_url;
        }
        url_info.insert( std::pair<string,string>(HTTP_TARGET_URL_KEY,target_url));
        BESDEBUG(MODULE, prolog << HTTP_TARGET_URL_KEY << ": " << target_url << endl);
        url_info.insert( std::pair<string,string>(HTTP_URL_BASE_KEY,url_base));
        BESDEBUG(MODULE, prolog << HTTP_URL_BASE_KEY <<": " << url_base << endl);
        url_info.insert( std::pair<string,string>(HTTP_QUERY_STRING_KEY,query_string));
        BESDEBUG(MODULE, prolog << HTTP_QUERY_STRING_KEY << ": " << query_string << endl);
        if(!query_string.empty()){
            vector<string> records;
            string delimiters = "&";
            BESUtil::tokenize(query_string,records, delimiters);
            vector<string>::iterator i = records.begin();
            for(; i!=records.end(); i++){
                size_t index = i->find('=');
                if(index != string::npos) {
                    string key = i->substr(0, index);
                    string value = i->substr(index+1);
                    BESDEBUG(MODULE, prolog << "key: " << key << " value: " << value << endl);
                    url_info.insert( std::pair<string,string>(key,value));
                }
            }
        }
        time_t now;
        time(&now);  /* get current time; same as: timer = time(NULL)  */
        stringstream unix_time;
        unix_time << now;
        url_info.insert( std::pair<string,string>(HTTP_INGEST_TIME_KEY,unix_time.str()));
    }
 
#endif
 
}