mirror of
https://github.com/php/php-src.git
synced 2026-04-23 16:08:35 +02:00
no longer needed
This commit is contained in:
Hartmut Holzgraefe
@@ -1,203 +0,0 @@
|
||||
/*
|
||||
+----------------------------------------------------------------------+
|
||||
| PHP version 4.0 |
|
||||
+----------------------------------------------------------------------+
|
||||
| Copyright (c) 1997, 1998, 1999, 2000 The PHP Group |
|
||||
+----------------------------------------------------------------------+
|
||||
| This source file is subject to version 2.02 of the PHP license, |
|
||||
| that is bundled with this package in the file LICENSE, and is |
|
||||
| available at through the world-wide-web at |
|
||||
| http://www.php.net/license/2_02.txt. |
|
||||
| If you did not receive a copy of the PHP license and are unable to |
|
||||
| obtain it through the world-wide-web, please send a note to |
|
||||
| license@php.net so we can mail you a copy immediately. |
|
||||
+----------------------------------------------------------------------+
|
||||
| Author: Sascha Schumann <sascha@schumann.cx> |
|
||||
+----------------------------------------------------------------------+
|
||||
*/
|
||||
|
||||
/* $Id$ */
|
||||
|
||||
#include "php.h"
|
||||
#include "snprintf.h"
|
||||
|
||||
#ifdef TRANS_SID
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#undef MIN
|
||||
#define MIN(a,b) (a)<(b)?(a):(b)
|
||||
|
||||
#define YYCTYPE char
|
||||
#define YYCURSOR state->crs
|
||||
#define YYLIMIT state->end
|
||||
#define YYMARKER state->ptr
|
||||
#define YYFILL(n)
|
||||
|
||||
typedef enum {
|
||||
INITIAL,
|
||||
REF
|
||||
} state;
|
||||
|
||||
typedef struct {
|
||||
state state;
|
||||
const char *crs;
|
||||
const char *end;
|
||||
const char *ptr;
|
||||
const char *start;
|
||||
char *target;
|
||||
size_t targetsize;
|
||||
const char *data;
|
||||
} lexdata;
|
||||
|
||||
#define FINISH { catchup(state); goto finish; }
|
||||
|
||||
#define BEGIN(x) \
|
||||
switch(state->state) { \
|
||||
case INITIAL: \
|
||||
catchup(state); \
|
||||
break; \
|
||||
case REF: \
|
||||
screw_url(state); \
|
||||
break; \
|
||||
} \
|
||||
state->state = x; \
|
||||
state->start = state->crs; \
|
||||
goto nextiter
|
||||
|
||||
#define ATTACH(s, n) \
|
||||
{ \
|
||||
size_t _newlen = state->targetsize + n; \
|
||||
state->target = realloc(state->target, _newlen + 1); \
|
||||
memcpy(state->target + state->targetsize, s, n); \
|
||||
state->targetsize = _newlen; \
|
||||
state->target[_newlen] = '\0'; \
|
||||
}
|
||||
|
||||
#define URLLEN 512
|
||||
|
||||
static void screw_url(lexdata *state)
|
||||
{
|
||||
int len;
|
||||
char buf[URLLEN];
|
||||
char url[URLLEN];
|
||||
const char *p, *q;
|
||||
char c;
|
||||
|
||||
/* search outer limits for URI */
|
||||
for(p = state->start; p < state->crs && (c = *p); p++)
|
||||
if(!isspace(c)) break;
|
||||
if(c=='"') p++;
|
||||
|
||||
/*
|
||||
* we look at q-1, because q points to the character behind the last
|
||||
* character we are going to copy and the decision is based on that last
|
||||
* character
|
||||
*/
|
||||
|
||||
for(q = state->crs; q > state->start && (c = *(q-1)); q--)
|
||||
if(!isspace(c)) break;
|
||||
if(c=='"') q--;
|
||||
|
||||
if(q<p) { p=state->start; q=state->crs; }
|
||||
|
||||
/* attach beginning */
|
||||
|
||||
ATTACH(state->start, p-state->start);
|
||||
|
||||
/* copy old URI */
|
||||
len = MIN(q - p, sizeof(buf) - 1);
|
||||
memcpy(url, p, len);
|
||||
url[len] = '\0';
|
||||
|
||||
/* construct new URI */
|
||||
len = snprintf(buf, sizeof(buf), "%s%c%s", url,
|
||||
memchr(state->start, '?', len) ? '&' : '?',
|
||||
state->data);
|
||||
|
||||
/* attach new URI */
|
||||
ATTACH(buf, len);
|
||||
|
||||
/* attach rest */
|
||||
ATTACH(q, state->crs - q);
|
||||
}
|
||||
|
||||
static void catchup(lexdata *state)
|
||||
{
|
||||
ATTACH(state->start, (state->crs - state->start));
|
||||
}
|
||||
|
||||
/*!re2c
|
||||
all = [\001-\377];
|
||||
eof = [\000];
|
||||
ws = [ \t\v\f];
|
||||
A = [aA];
|
||||
C = [cC];
|
||||
E = [eE];
|
||||
F = [fF];
|
||||
H = [hH];
|
||||
I = [iI];
|
||||
M = [mM];
|
||||
N = [nN];
|
||||
O = [oO];
|
||||
R = [rR];
|
||||
S = [sS];
|
||||
T = [tT];
|
||||
*/
|
||||
|
||||
static void url_scanner(lexdata *state)
|
||||
{
|
||||
while(state->crs < state->end) {
|
||||
|
||||
switch(state->state) {
|
||||
case INITIAL:
|
||||
/*!re2c
|
||||
"<" F R A M E ws+ S R C ws* "=" ws* { BEGIN(REF); }
|
||||
"<" A ws+ H R E F ws* "=" ws* { BEGIN(REF); }
|
||||
"<" F O R M ws+ A C T I O N ws* "=" ws* { BEGIN(REF); }
|
||||
"<" A R E A ws+ H R E F ws* "=" ws* { BEGIN(REF); }
|
||||
(all\[<])+ { BEGIN(INITIAL); }
|
||||
eof { FINISH; }
|
||||
*/
|
||||
break;
|
||||
case REF:
|
||||
/*!re2c
|
||||
["]? ws* (all\[> \t\v\f":#])* ws* ["]? { BEGIN(INITIAL); }
|
||||
["]? ws* (all\[> \t\v\f":#])* /[#] { BEGIN(INITIAL); }
|
||||
["]? ws* (all\[> \t\v\f"#])* ws* ["]? {
|
||||
/* don't modify absolute links */
|
||||
state->state = INITIAL; BEGIN(INITIAL);
|
||||
}
|
||||
*/
|
||||
break;
|
||||
}
|
||||
nextiter:
|
||||
;
|
||||
}
|
||||
finish:
|
||||
;
|
||||
}
|
||||
|
||||
char *url_adapt(const char *src, size_t srclen, const char *data, size_t *newlen)
|
||||
{
|
||||
lexdata state;
|
||||
|
||||
state.state = INITIAL;
|
||||
state.start = state.crs = src;
|
||||
state.end = src + srclen;
|
||||
state.ptr = NULL;
|
||||
state.target = NULL;
|
||||
state.targetsize = 0;
|
||||
state.data = data;
|
||||
|
||||
url_scanner(&state);
|
||||
|
||||
if(newlen) *newlen = state.targetsize;
|
||||
|
||||
return state.target;
|
||||
}
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user