The Machine Perception Toolbox

[Introduction]- [News]- [Download]- [Screenshots]- [Manual (pdf)]- [Forums]- [API Reference]- [Repository ]

 

glob.c File Reference

#include "jam.h"

Include dependency graph for glob.c:

Go to the source code of this file.

Defines
#define	BITLISTSIZE   16
#define	CHECK_BIT(tab, bit)   ( tab[ (bit)/8 ] & (1<<( (bit)%8 )) )
Functions
int	glob (register char *c, register char *s)
void	globchars (char *s, char *e, char *b)

---

Define Documentation

#define BITLISTSIZE   16

Definition at line 30 of file glob.c. Referenced by globchars().

#define CHECK_BIT (  tab, bit   )     ( tab[ (bit)/8 ] & (1<<( (bit)%8 )) )

Definition at line 29 of file glob.c. Referenced by glob().

---

Function Documentation

int glob (  register char *  c, register char *  s )

Definition at line 39 of file glob.c. References c, CHECK_BIT, globchars(), r, and s. Referenced by builtin_glob_back(), and compile_switch(). { char bitlist[ BITLISTSIZE ]; char *here; for( ;; ) switch( *c++ ) { case '\0': return *s ? -1 : 0; case '?': if( !*s++ ) return 1; break; case '[': /* scan for matching ] */ here = c; do if( !*c++ ) return 1; while( here == c || *c != ']' ); c++; /* build character class bitlist */ globchars( here, c, bitlist ); if( !CHECK_BIT( bitlist, *(unsigned char *)s ) ) return 1; s++; break; case '*': here = s; while( *s ) s++; /* Try to match the rest of the pattern in a recursive */ /* call. If the match fails we'll back up chars, retrying. */ while( s != here ) { int r; /* A fast path for the last token in a pattern */ r = *c ? glob( c, s ) : *s ? -1 : 0; if( !r ) return 0; else if( r < 0 ) return 1; --s; } break; case '\\': /* Force literal match of next char. */ if( !*c || *s++ != *c++ ) return 1; break; default: if( *s++ != c[-1] ) return 1; break; } }

Here is the call graph for this function:

void globchars (  char *  s, char *  e, char *  b )  [static]

Definition at line 120 of file glob.c. References BITLISTSIZE, c, i, and s. Referenced by glob(). { int neg = 0; memset( b, '\0', BITLISTSIZE ); if( *s == '^') neg++, s++; while( s < e ) { int c; if( s+2 < e && s[1] == '-' ) { for( c = s[0]; c <= s[2]; c++ ) b[ c/8 ] |= (1<<(c%8)); s += 3; } else { c = *s++; b[ c/8 ] |= (1<<(c%8)); } } if( neg ) { int i; for( i = 0; i < BITLISTSIZE; i++ ) b[ i ] ^= 0377; } /* Don't include \0 in either $[chars] or $[^chars] */ b[0] &= 0376; }

---