rofi/source/run-dialog.c

/**
 * rofi
 *
 * MIT/X11 License
 * Copyright 2013-2014 Qball  Cow <qball@gmpclient.org>
 *
 * 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.
 *
 */

#define _GNU_SOURCE
#include <stdlib.h>
#include <stdio.h>
#include <X11/X.h>

#include <unistd.h>
#include <limits.h>
#include <signal.h>
#include <sys/types.h>
#include <dirent.h>
#include <strings.h>
#include <string.h>
#include <errno.h>

#include "rofi.h"
#include "run-dialog.h"
#ifdef TIMING
#include <time.h>
#endif

#define RUN_CACHE_FILE "rofi-2.runcache"

static inline int execsh( const char *cmd ,int run_in_term )
{
// use sh for args parsing
    if ( run_in_term )
        return execlp( config.terminal_emulator, config.terminal_emulator, "-e", "sh", "-c", cmd, NULL );

    return execlp( "/bin/sh", "sh", "-c", cmd, NULL );
}

typedef struct _element{
    long int index;
    char name[1024];
}element;
static int element_sort_func(const void *ea,const void *eb) 
{
    element *a = *(element **)ea;
    element *b = *(element **)eb;
    return b->index - a->index;
}
// execute sub-process
static pid_t exec_cmd( const char *cmd, int run_in_term )
{
    if ( !cmd || !cmd[0] ) return -1;

    signal( SIGCHLD, catch_exit );
    pid_t pid = fork();

    if ( !pid ) {
        setsid();
        execsh( cmd, run_in_term );
        exit( EXIT_FAILURE );
    }

    int curr = -1;
    unsigned int index = 0;
    element **retv = NULL;

    /**
     * This happens in non-critical time (After launching app)
     * It is allowed to be a bit slower.
     */
    size_t path_length = strlen( cache_dir ) + strlen( RUN_CACHE_FILE )+3;
    char *path = allocate( path_length );
    snprintf( path, path_length, "%s/%s", cache_dir, RUN_CACHE_FILE );
    FILE *fd = fopen ( path, "r" );

    if ( fd != NULL ) {
        char buffer[1024];
        while ( fgets( buffer,1024,fd ) != NULL ) {
            if(strlen(buffer) == 0) continue;
            retv = reallocate( retv, ( index+2 )*sizeof( element* ) );
            retv[index] = allocate(sizeof(element));
            buffer[strlen( buffer )-1] = '\0';
            char * start = NULL;
            retv[index]->index = strtol(buffer, &start, 10);
            snprintf(retv[index]->name, 1024, "%s", start+1);
            retv[index+1] = NULL;

            if ( strcasecmp( retv[index]->name, cmd ) == 0 ) {
                curr = index;
            }
            index++;
        }

        fclose( fd );
    }

    if(curr < 0) {
            retv = reallocate( retv, ( index+2 )*sizeof( element* ) );
            retv[index] = allocate(sizeof(element));
            retv[index]->index = 1;
            snprintf(retv[index]->name, 1024, "%s", cmd);
            index++;
    }else {
            retv[curr]->index++;
    }
    // Sort the list.
    qsort(retv, index, sizeof(element*), element_sort_func);

    /**
     * Write out the last 25 results again.
     */
    fd = fopen ( path, "w" );

    if ( fd ) {

        for ( int i = 0; i < ( int )index && i < 20; i++ ) {
            if(retv[i]->name && retv[i]->name[0] != '\0') {
                fprintf(fd, "%ld %s\n",
                        retv[i]->index,
                        retv[i]->name
                       );
            }
        }

        fclose( fd );
    }

    for ( int i=0; retv != NULL &&  retv[i] != NULL; i++ ) {
        free( retv[i] );
    }

    free( retv );

    free( path );

    return pid;
}
// execute sub-process
static void delete_entry( const char *cmd )
{
    int curr = -1;
    unsigned int index = 0;
    element **retv = NULL;


    /**
     * This happens in non-critical time (After launching app)
     * It is allowed to be a bit slower.
     */
    char *path = allocate( strlen( cache_dir ) + strlen( RUN_CACHE_FILE )+3 );
    sprintf( path, "%s/%s", cache_dir, RUN_CACHE_FILE );
    FILE *fd = fopen ( path, "r" );

    if ( fd != NULL ) {
        char buffer[1024];
        while ( fgets( buffer,1024,fd ) != NULL ) {
            if(strlen(buffer) == 0) continue;
            retv = reallocate( retv, ( index+2 )*sizeof( element* ) );
            retv[index] = allocate(sizeof(element));
            buffer[strlen( buffer )-1] = '\0';
            char * start = NULL;
            retv[index]->index = strtol(buffer, &start, 10);
            snprintf(retv[index]->name, 1024, "%s", start+1);
            retv[index+1] = NULL;

            if ( strcasecmp( retv[index]->name, cmd ) == 0 ) {
                curr = index;
            }
            index++;
        }

        fclose( fd );
    }

    /**
     * Write out the last 25 results again.
     */
    fd = fopen ( path, "w" );

    if ( fd ) {
        for ( int i = 0; i < ( int )index && i < 20; i++ ) {
            if ( i != curr ) {
                if(retv[i]->name && retv[i]->name[0] != '\0') {
                    fprintf(fd, "%ld %s\n",
                            retv[i]->index,
                            retv[i]->name
                           );
                }
            }
        }

        fclose( fd );
    }

    for ( int i=0; retv != NULL &&  retv[i] != NULL; i++ ) {
        free( retv[i] );
    }

    free( retv );

    free( path );

}
static int sort_func ( const void *a, const void *b )
{
    const char *astr = *( const char * const * )a;
    const char *bstr = *( const char * const * )b;
    return strcasecmp( astr,bstr );
}
static char ** get_apps ( )
{
    unsigned int num_favorites = 0;
    unsigned int index = 0;
    char *path;
    char **retv = NULL;
#ifdef TIMING
    struct timespec start, stop;
    clock_gettime( CLOCK_REALTIME, &start );
#endif

    if ( getenv( "PATH" ) == NULL ) return NULL;


    path = allocate( strlen( cache_dir ) + strlen( RUN_CACHE_FILE )+3 );
    sprintf( path, "%s/%s", cache_dir, RUN_CACHE_FILE );
    FILE *fd = fopen ( path, "r" );

    if ( fd != NULL ) {
        char buffer[1024];
        while ( fgets( buffer,1024,fd ) != NULL ) {
            if(strlen(buffer) == 0) continue;
            buffer[strlen( buffer )-1] = '\0';
            char *start = NULL;
            // Don't use result.
            strtol(buffer, &start, 10);
            if(start == NULL) continue;
            retv = reallocate( retv, ( index+2 )*sizeof( char* ) );
            retv[index] = strdup( start+1 );
            retv[index+1] = NULL;
            index++;
            num_favorites++;
        }

        fclose( fd );
    }

    free( path );


    path = strdup( getenv( "PATH" ) );

    for ( const char *dirname = strtok( path, ":" ); dirname != NULL; dirname = strtok( NULL, ":" ) ) {
        DIR *dir = opendir( dirname );

        if ( dir != NULL ) {
            struct dirent *dent;

            while ( ( dent=readdir( dir ) )!=NULL ) {
                if ( dent->d_type != DT_REG &&
                     dent->d_type != DT_LNK &&
                     dent->d_type != DT_UNKNOWN ) {
                    continue;
                }

                int found = 0;

                // This is a nice little penalty, but doable? time will tell.
                // given num_favorites is max 25.
                for ( unsigned int j = 0; found == 0 && j < num_favorites; j++ ) {
                    if ( strcasecmp( dent->d_name, retv[j] ) == 0 ) found = 1;
                }

                if ( found == 1 ) continue;

                retv = reallocate( retv, ( index+2 )*sizeof( char* ) );
                retv[index] = strdup( dent->d_name );
                retv[index+1] = NULL;
                index++;
            }

            closedir( dir );
        }
    }

    // TODO: check this is still fast enough. (takes 1ms on laptop.)
    if(index > num_favorites) {
        qsort( &retv[num_favorites],index-num_favorites, sizeof( char* ), sort_func );
    }
    free( path );
#ifdef TIMING
    clock_gettime( CLOCK_REALTIME, &stop );

    if ( stop.tv_sec != start.tv_sec ) {
        stop.tv_nsec += ( stop.tv_sec-start.tv_sec )*1e9;
    }

    long diff = stop.tv_nsec-start.tv_nsec;
    printf( "Time elapsed: %ld us\n", diff/1000 );
#endif
    return retv;
}

SwitcherMode run_switcher_dialog ( char **input )
{
    int shift=0;
    int selected_line = 0;
    SwitcherMode retv = MODE_EXIT;
    // act as a launcher
    char **cmd_list = get_apps( );

    if ( cmd_list == NULL ) {
        cmd_list = allocate( 2*sizeof( char * ) );
        cmd_list[0] = strdup( "No applications found" );
        cmd_list[1] = NULL;
    }

    int mretv = menu( cmd_list, input, "$", NULL, &shift,token_match, NULL, &selected_line );

    if ( mretv == MENU_NEXT ) {
        retv = NEXT_DIALOG;
    } else if ( mretv == MENU_OK && cmd_list[selected_line] != NULL ) {
        exec_cmd( cmd_list[selected_line], shift );
    } else if ( mretv == MENU_CUSTOM_INPUT && *input != NULL && *input[0] != '\0' ) {
        exec_cmd( *input, shift );
    } else if ( mretv == MENU_ENTRY_DELETE && cmd_list[selected_line] ) {
        delete_entry ( cmd_list[selected_line] );
        retv = RUN_DIALOG;
    }

    for ( int i=0; cmd_list != NULL && cmd_list[i] != NULL; i++ ) {
        free( cmd_list[i] );
    }

    if ( cmd_list != NULL ) free( cmd_list );

    return retv;
}