automaton.c File Reference

#include "automaton.h"
#include "internal.h"

Include dependency graph for automaton.c:

Go to the source code of this file.

Data Structures
struct	esctrie

Typedefs
typedef struct esctrie	esctrie

Functions
uint32_t	esctrie_id (const esctrie *e)
void	input_free_esctrie (automaton *a)
int	inputctx_add_cflow (automaton *a, const char *seq, triefunc fxn)
int	inputctx_add_input_escape (automaton *a, const char *esc, uint32_t special, unsigned modifiers)
int	walk_automaton (automaton *a, struct inputctx *ictx, unsigned candidate, ncinput *ni)

Typedef Documentation

esctrie

typedef struct esctrie esctrie

Function Documentation

esctrie_id()

uint32_t esctrie_id

(

const esctrie *

e

)

Definition at line 50 of file automaton.c.

                                     {
  return e->ni.id;
}

input_free_esctrie()

void input_free_esctrie

(

automaton *

a

)

Definition at line 81 of file automaton.c.

                                     {
  a->escapes = 0;
  a->poolsize = 0;
  for(unsigned i = 0 ; i < a->poolused ; ++i){
    free(a->nodepool[i].trie);
  }
  free(a->nodepool);
  a->poolused = 0;
  a->nodepool = NULL;
}

Here is the call graph for this function:

inputctx_add_cflow()

int inputctx_add_cflow	(	automaton *	a,
		const char *	seq,
		triefunc	fxn
	)

Definition at line 502 of file automaton.c.

                                                                   {
  esctrie* eptr = insert_path(a, seq);
  if(eptr == NULL){
    return -1;
  }
  free(eptr->trie);
  eptr->trie = NULL;
  return esctrie_make_function(eptr, fxn);
}

Here is the call graph for this function:

inputctx_add_input_escape()

int inputctx_add_input_escape	(	automaton *	a,
		const char *	esc,
		uint32_t	special,
		unsigned	modifiers
	)

Definition at line 513 of file automaton.c.

                                                 {
  if(esc[0] != NCKEY_ESC || strlen(esc) < 2){ // assume ESC prefix + content
    logerror("not an escape (0x%x)", special);
    return -1;
  }
  esctrie* eptr = insert_path(a, esc + 1);
  if(eptr == NULL){
    return -1;
  }
  // it appears that multiple keys can be mapped to the same escape string. as
  // an example, see "kend" and "kc1" in st ("simple term" from suckless) :/.
  if(eptr->ni.id){ // already had one here!
    if(eptr->ni.id != special){
      logwarn("already added escape (got 0x%x, wanted 0x%x)", eptr->ni.id, special);
    }
  }else{
    eptr->ni.id = special;
    eptr->ni.shift = modifiers & NCKEY_MOD_SHIFT;
    eptr->ni.ctrl = modifiers & NCKEY_MOD_CTRL;
    eptr->ni.alt = modifiers & NCKEY_MOD_ALT;
    eptr->ni.y = 0;
    eptr->ni.x = 0;
    eptr->ni.modifiers = modifiers;
    logdebug("added 0x%08x to %u", special, esctrie_idx(a, eptr));
  }
  return 0;
}

walk_automaton()

int walk_automaton	(	automaton *	a,
		struct inputctx *	ictx,
		unsigned	candidate,
		ncinput *	ni
	)

Definition at line 546 of file automaton.c.

                               {
  if(candidate >= 0x80){
    logerror("eight-bit char %u in control sequence", candidate);
    return -1;
  }
  esctrie* e = esctrie_from_idx(a, a->state);
  // we ought not have been called for an escape with any state!
  if(candidate == 0x1b && !a->instring){
    assert(NULL == e);
    a->state = a->escapes;
    return 0;
  }
  if(e->ntype == NODE_STRING){
    if(candidate == 0x1b || candidate == 0x07){
      a->state = e->trie[candidate];
      a->instring = 0;
    }
    e = esctrie_from_idx(a, a->state);
    if(e->ntype == NODE_FUNCTION){ // for the 0x07s of the world
      if(e->fxn == NULL){
        return 2;
      }
      return e->fxn(ictx);
    }
    return 0;
  }
  if((a->state = e->trie[candidate]) == 0){
    if(esctrie_idx(a, e) == a->escapes){
      memset(ni, 0, sizeof(*ni));
      ni->id = candidate;
      ni->alt = true;
      return 1;
    }
    loginfo("unexpected transition on %u[%u]",
            esctrie_idx(a, e), candidate);
    return -1;
  }
  e = esctrie_from_idx(a, a->state);
  // initialize any node we've just stepped into
  switch(e->ntype){
    case NODE_NUMERIC:
      break;
    case NODE_STRING:
      a->instring = 1;
      break;
    case NODE_SPECIAL:
      if(e->ni.id){
        memcpy(ni, &e->ni, sizeof(*ni));
        return 1;
      }
      break;
    case NODE_FUNCTION:
      if(e->fxn == NULL){
        return 2;
      }
      return e->fxn(ictx);
      break;
  }
  return 0;
}

Here is the call graph for this function: