int main(){
int t;
while(scanf("%d", &t) > 0){
int i, x, y;
char op[10];
for(i = 0; i < 30001; i++)
top[i] = down[i] = Fdown[i] = Ftop[i] = i, ct[i] = 0;
while(t--){
scanf("%s", op);
if(op[0] == 'M'){
scanf("%d%d", &x, &y);
int ftop = find_top(y), fdown = find_down(x);
if(find_top(x) != ftop){
down[fdown] = ftop;
top[ftop] = fdown;
Fdown[fdown] = ftop;
Ftop[ftop] = fdown;
}
}
else{
scanf("%d", &x);
printf("%d\n", ct[x]);
}
}
}
return 0;
}
int window_line (void)
{
Line *cline;
Line *top;
int n;
if (CBuf != JWindow->buffer) return 0;
top = find_top ();
#if JED_HAS_LINE_ATTRIBUTES
cline = jed_find_non_hidden_line (CLine);
#else
cline = CLine;
#endif
n = 1;
while ((top != NULL) && (top != cline))
{
top = top->next;
#if JED_HAS_LINE_ATTRIBUTES
while ((top != NULL) && (top->flags & JED_LINE_HIDDEN))
top = top->next;
#endif
n++;
}
return n;
}
/* <hint> may be:
* - A simple product name
* e.g., "sooner"
TODO: debug? sooner-debug, sooner:debug?
* - A relative path from the CWD to the ANDROID_PRODUCT_OUT dir
* e.g., "out/target/product/sooner"
* - An absolute path to the PRODUCT_OUT dir
* e.g., "/src/device/out/target/product/sooner"
*
* Given <hint>, try to construct an absolute path to the
* ANDROID_PRODUCT_OUT dir.
*/
static const char *find_product_out_path(const char *hint)
{
static char path_buf[PATH_MAX];
if (hint == NULL || hint[0] == '\0') {
return NULL;
}
/* If it's already absolute, don't bother doing any work.
*/
if (adb_is_absolute_host_path(hint)) {
strcpy(path_buf, hint);
return path_buf;
}
/* If there are any slashes in it, assume it's a relative path;
* make it absolute.
*/
if (adb_dirstart(hint) != NULL) {
if (getcwd(path_buf, sizeof(path_buf)) == NULL) {
fprintf(stderr, "adb: Couldn't get CWD: %s\n", strerror(errno));
return NULL;
}
if (strlen(path_buf) + 1 + strlen(hint) >= sizeof(path_buf)) {
fprintf(stderr, "adb: Couldn't assemble path\n");
return NULL;
}
strcat(path_buf, OS_PATH_SEPARATOR_STR);
strcat(path_buf, hint);
return path_buf;
}
/* It's a string without any slashes. Try to do something with it.
*
* Try to find the root of the build tree, and build a PRODUCT_OUT
* path from there.
*/
char top_buf[PATH_MAX];
const char *top = find_top(top_buf);
if (top == NULL) {
fprintf(stderr, "adb: Couldn't find top of build tree\n");
return NULL;
}
//TODO: if we have a way to indicate debug, look in out/debug/target/...
snprintf(path_buf, sizeof(path_buf),
"%s" OS_PATH_SEPARATOR_STR
"out" OS_PATH_SEPARATOR_STR
"target" OS_PATH_SEPARATOR_STR
"product" OS_PATH_SEPARATOR_STR
"%s", top_buf, hint);
if (access(path_buf, F_OK) < 0) {
fprintf(stderr, "adb: Couldn't find a product dir "
"based on \"-p %s\"; \"%s\" doesn't exist\n", hint, path_buf);
return NULL;
}
return path_buf;
}
/* Fall through . . */
case 107:
if (tolower (ch) == 'h') {
state = 1;
start = n;
} else
state = ST_INITIAL;
break;
case ST_START_FOUND:
if (isspace ((int) ((unsigned char) ch)) ||
(ch == '"') ||
(ch == '>')) {
end = n;
state = ST_END_FOUND;
}
break;
}
# undef CHK
# undef CCHK
} else {
if (state == ST_START_FOUND) {
end = n;
state = ST_END_FOUND;
} else
state = ST_INITIAL;
}
n += clen;
} else {
if (state == ST_START_FOUND) {
end = n;
state = ST_END_FOUND;
}
++n;
}
if (state == ST_END_FOUND) {
int ulen, m, o;
ulen = end - start;
for (m = 0; m < blockmail -> url_count; ++m)
if ((blockmail -> url[m] -> usage & mask) &&
(blockmail -> url[m] -> dlen == ulen) &&
(! xmlStrncmp (blockmail -> url[m] -> dptr, cont + start, ulen)))
break;
if (m < blockmail -> url_count) {
if (lstore < start)
xmlBufferAdd (block -> out, cont + lstore, start - lstore);
for (o = 0; o < rec -> url_count; ++o)
if (rec -> url[o] -> uid == blockmail -> url[m] -> uid)
break;
if (o < rec -> url_count)
xmlBufferAdd (block -> out, rec -> url[o] -> dptr, rec -> url[o] -> dlen);
lstore = end;
changed = true;
}
state = ST_INITIAL;
}
}
if (changed) {
if (lstore < len)
xmlBufferAdd (block -> out, cont + lstore, len - lstore);
SWAP (block);
}
return true;
}/*}}}*/
static bool_t
collect_links (blockmail_t *blockmail, block_t *block, links_t *links) /*{{{*/
{
bool_t rc;
int n, clen;
int len;
const xmlChar *cont;
int start;
rc = true;
len = xmlBufferLength (block -> in);
cont = xmlBufferContent (block -> in);
for (n = 0; rc && (n < len); ) {
clen = xmlCharLength (cont[n]);
if ((clen == 1) && (cont[n] == 'h')) {
start = n;
++n;
if ((n + 3 < len) && (cont[n] == 't') && (cont[n + 1] == 't') && (cont[n + 2] == 'p')) {
n += 3;
if ((n + 1 < len) && (cont[n] == 's'))
++n;
if ((n + 3 < len) && (cont[n] == ':') && (cont[n + 1] == '/') && (cont[n + 2] == '/')) {
n += 3;
while ((n < len) && (xmlCharLength (cont[n]) == 1) &&
(cont[n] != '"') && (cont[n] != '<') && (cont[n] != '>') &&
(! isspace (cont[n])))
++n;
rc = links_nadd (links, (const char *) (cont + start), n - start);
}
}
} else
n += clen;
}
return rc;
}/*}}}*/
static int
find_top (const xmlChar *cont, int len) /*{{{*/
{
int pos;
int state;
int n;
int clen;
unsigned char ch;
for (pos = -1, state = 0, n = 0; (n < len) && (pos == -1); ) {
clen = xmlCharLength (cont[n]);
if (clen > 1)
state = 0;
else {
ch = cont[n];
switch (state) {
case 0:
if (ch == '<')
state = 1;
break;
case 1:
if ((ch == 'b') || (ch == 'B'))
state = 2;
else if (ch == '>')
state = 0;
else if (! isspace (ch))
state = 100;
break;
case 2:
if ((ch == 'o') || (ch == 'O'))
state = 3;
else if (ch == '>')
state = 0;
else
state = 100;
break;
case 3:
if ((ch == 'd') || (ch == 'D'))
state = 4;
else if (ch == '>')
state = 0;
else
state = 100;
break;
case 4:
if ((ch == 'y') || (ch == 'Y'))
state = 5;
else if (ch == '>')
state = 0;
else
state = 100;
break;
case 5:
if (ch == '>') {
pos = n + clen;
state = 0;
} else if (isspace (ch))
state = 6;
else
state = 100;
break;
case 6:
if (ch == '>') {
pos = n + clen;
state = 0;
}
# ifdef STRICT
else if (ch == '"')
state = 7;
break;
case 7:
if (ch == '"')
state = 6;
# endif /* STRICT */
break;
case 100:
if (ch == '>')
state = 0;
break;
}
}
n += clen;
}
return pos;
}/*}}}*/
static int
find_bottom (const xmlChar *cont, int len) /*{{{*/
{
int pos;
int last;
int m;
int bclen;
for (pos = -1, last = len, m = len - 1; (m >= 0) && (pos == -1); ) {
bclen = xmlCharLength (cont[m]);
if ((bclen == 1) && (cont[m] == '<')) {
int n;
int state;
int clen;
unsigned char ch;
for (n = m + bclen, state = 1; (n < last) && (state > 0) && (state != 99); ) {
clen = xmlCharLength (cont[n]);
if (clen != 1)
state = 0;
else {
ch = cont[n];
switch (state) {
case 1:
if (ch == '/')
state = 2;
else if (! isspace (ch))
state = 0;
break;
case 2:
if ((ch == 'b') || (ch == 'B'))
state = 3;
else if (! isspace (ch))
state = 0;
break;
case 3:
if ((ch == 'o') || (ch == 'O'))
state = 4;
else
state = 0;
break;
case 4:
if ((ch == 'd') || (ch == 'D'))
state = 5;
else
state = 0;
break;
case 5:
if ((ch == 'y') || (ch == 'Y'))
state = 6;
else
state = 0;
break;
case 6:
if ((ch == '>') || isspace (ch))
state = 99;
else
state = 0;
break;
}
}
n += clen;
}
if (state == 99)
pos = m;
} else if ((bclen == 1) && (cont[m] == '>'))
last = m + bclen;
m -= bclen;
}
return pos;
}/*}}}*/
static bool_t
add_onepixellog_image (blockmail_t *blockmail, receiver_t *rec, block_t *block, opl_t opl) /*{{{*/
{
bool_t rc;
const xmlChar tname[] = "[agnONEPIXEL]";
int tlen = sizeof (tname) - 1;
tag_t *opltag;
rc = true;
for (opltag = rec -> tag; opltag; opltag = opltag -> next)
if (tag_match (opltag, tname, tlen))
break;
if (opltag && opltag -> value) {
int pos;
int len;
const xmlChar *cont;
pos = -1;
len = xmlBufferLength (block -> in);
cont = xmlBufferContent (block -> in);
switch (opl) {
case OPL_None:
break;
case OPL_Top:
pos = find_top (cont, len);
if (pos == -1)
pos = 0;
break;
case OPL_Bottom:
pos = find_bottom (cont, len);
if (pos == -1)
pos = len;
break;
}
if (pos != -1) {
const xmlChar lprefix[] = "<img src=\"";
const xmlChar lpostfix[] = "\" alt=\"\" border=\"0\" height=\"1\" width=\"1\">";
xmlBufferEmpty (block -> out);
if (pos > 0)
xmlBufferAdd (block -> out, cont, pos);
xmlBufferAdd (block -> out, lprefix, sizeof (lprefix) - 1);
xmlBufferAdd (block -> out, xmlBufferContent (opltag -> value), xmlBufferLength (opltag -> value));
xmlBufferAdd (block -> out, lpostfix, sizeof (lpostfix) - 1);
if (pos < len)
xmlBufferAdd (block -> out, cont + pos, len - pos);
SWAP (block);
}
}
return rc;
}/*}}}*/
void main()
{
int i;
char a[100] = "zumvuhbeclakeipbkp";
printf("enter expression\n");
for (i = 0; a[i] != '\0';i++)
{
if (a[i] == '(')
{
push(a[i]);
}
else if (a[i] == ')')
{
pop();
}
}
find_top();
}
unsigned int find_offset(unsigned int dataaddr, unsigned int base, unsigned int size, unsigned char** what) {
unsigned char* data = (unsigned char *)dataaddr;
int i = 0;
unsigned char* top = what[2];
unsigned char* name = what[0];
unsigned char* signature = what[1];
unsigned int dbase = dataaddr;
// First find the string
unsigned int address = find_string(dataaddr, base, size, signature);
if(address == 0) return NULL;
// Next find where that string is referenced
unsigned int reference = find_reference(dataaddr, base, size, address);
if(reference == 0) return NULL;
reference -= base;
// Finally find the top of that function
unsigned int function = find_top(dataaddr, base, size, reference);
return function;
}
/* if force then do update otherwise return 1 if update or 0 if not */
static int update_1(Line *top, int force)
{
int i;
Window_Type *start_win;
int did_eob, time_has_expired = 0;
if (Batch ||
(!force
&& (Executing_Keyboard_Macro || (Repeat_Factor != NULL)
|| screen_input_pending (0)
|| (Read_This_Character != NULL)))
|| (CBuf != JWindow->buffer))
{
return(0);
}
if (Suspend_Screen_Update != 0)
{
Suspend_Screen_Update = 0;
touch_screen ();
}
JWindow->mark.line = CLine;
JWindow->mark.point = Point;
JWindow->mark.n = LineNum + CBuf->nup;
CBuf->linenum = LineNum;
CBuf->max_linenum = Max_LineNum;
if (Wants_Attributes && CBuf->vis_marks)
{
JWindow->trashed = 1;
}
/* Do not bother setting this unless it is really needed */
if (Display_Time)
{
Status_This_Time = sys_time();
time_has_expired = (Status_This_Time > Status_Last_Time + 45);
}
/* if cursor moves just left right, do not update status line */
if (!force && !JWindow->trashed &&
((JWindow == JWindow->next) || (User_Prefers_Line_Numbers && Cursor_Motion))
/* if % wanted, assume user is like me and gets annoyed with
* screen updates
*/
&& (User_Prefers_Line_Numbers
|| time_has_expired))
{
update_status_line(0);
return(1);
}
if (!JWindow->trashed && Cursor_Motion)
{
#if JED_HAS_LINE_ATTRIBUTES
if (CLine->flags & JED_LINE_IS_READONLY)
update_status_line (0);
#endif
return 1;
}
start_win = JWindow;
do
{
int imax;
unsigned int start_column;
#if JED_HAS_LINE_ATTRIBUTES
if (CBuf->min_unparsed_line_num)
jed_syntax_parse_buffer (0);
#endif
if (Wants_Syntax_Highlight) init_syntax_highlight ();
#if JED_HAS_LINE_ATTRIBUTES
if (top != NULL) top = jed_find_non_hidden_line (top);
#endif
/* (void) SLsmg_utf8_enable (CBuf->local_vars.is_utf8); */
if (top == NULL)
{
top = find_top();
if (top == NULL) top = CLine;
}
JWindow->beg.line = top;
#if JED_HAS_LINE_ATTRIBUTES
if (top->flags & JED_LINE_HIDDEN)
top = NULL;
else
#endif
mark_window_attributes ((start_win == JWindow) || (start_win->buffer != CBuf));
did_eob = 0;
i = JWindow->sy;
imax = i + JWindow->rows;
compute_line_display_size ();
start_column = JWindow->sx;
while (i < imax)
{
#if JED_HAS_LINE_ATTRIBUTES
if ((top != NULL) && (top->flags & JED_LINE_HIDDEN))
{
top = top->next;
continue;
}
#endif
/* the next line is really optional */
#if 0
if (!force && (Exit_From_MiniBuffer ||
screen_input_pending (0))) break;
#endif
if ((JScreen[i].line != top)
|| JScreen[i].is_modified
|| (Want_Eob
&& !did_eob
&& (i != Jed_Num_Screen_Rows - 1)
&& (top == NULL)))
{
if (((top == NULL) || (top->len == 0))
&& (Want_Eob && !did_eob && !(CBuf->flags & READ_ONLY)))
{
display_line(&Eob_Line, i, start_column);
/* JScreen[i].line = top; */
did_eob = 1;
}
else display_line(top, i, start_column);
}
if (top != NULL)
top = top->next;
i++;
}
HScroll_Line = NULL;
Mode_Has_Syntax_Highlight = 0;
if (!force && screen_input_pending (0))
{
while (JWindow != start_win) other_window();
JWindow->trashed = 1; /* since cursor not pointed */
/* (void) SLsmg_utf8_enable (1); */ /* default state */
return(0);
}
else update_status_line (start_win != JWindow);
#if JED_HAS_DISPLAY_LINE_NUMBERS
if (CBuf->line_num_display_size)
display_line_numbers ();
#endif
JWindow->trashed = 0;
other_window();
top = NULL;
/* if (!JWindow->trashed) top = JWindow->beg.line; else top = NULL; */
}
while (JWindow != start_win);
/* SLsmg_utf8_enable (1); */ /* default state */
return 1;
}
/* Make first/last for oreg.
*/
static int
make_firstlast( MergeInfo *inf, Overlapping *ovlap, Rect *oreg )
{
REGION *rir = inf->rir;
REGION *sir = inf->sir;
Rect rr, sr;
int x;
int missing;
/* We're going to build first/last ... lock it from other generate
* threads. In fact it's harmless if we do get two writers, but we may
* avoid duplicating work.
*/
g_mutex_lock( ovlap->fl_lock );
/* Do we already have first/last for this area? Bail out if we do.
*/
missing = 0;
for( x = oreg->left; x < IM_RECT_RIGHT( oreg ); x++ ) {
const int j = x - ovlap->overlap.left;
const int first = ovlap->first[j];
if( first < 0 ) {
missing = 1;
break;
}
}
if( !missing ) {
/* No work to do!
*/
g_mutex_unlock( ovlap->fl_lock );
return( 0 );
}
/* Entire height of overlap in ref for oreg ... we know oreg is inside
* overlap.
*/
rr.left = oreg->left;
rr.top = ovlap->overlap.top;
rr.width = oreg->width;
rr.height = ovlap->overlap.height;
rr.left -= ovlap->rarea.left;
rr.top -= ovlap->rarea.top;
/* Same in sec.
*/
sr.left = oreg->left;
sr.top = ovlap->overlap.top;
sr.width = oreg->width;
sr.height = ovlap->overlap.height;
sr.left -= ovlap->sarea.left;
sr.top -= ovlap->sarea.top;
/* Make pixels.
*/
if( im_prepare( rir, &rr ) || im_prepare( sir, &sr ) ) {
g_mutex_unlock( ovlap->fl_lock );
return( -1 );
}
/* Make first/last cache.
*/
for( x = 0; x < oreg->width; x++ ) {
const int j = (x + oreg->left) - ovlap->overlap.left;
int *first = &ovlap->first[j];
int *last = &ovlap->last[j];
/* Done this line already?
*/
if( *first < 0 ) {
/* Search for top/bottom of overlap on this scan-line.
*/
if( find_top( sir, first,
x + sr.left, sr.top, sr.height ) ||
find_bot( rir, last,
x + rr.left, rr.top, rr.height ) ) {
g_mutex_unlock( ovlap->fl_lock );
return( -1 );
}
/* Translate to output space.
*/
*first += ovlap->sarea.top;
*last += ovlap->rarea.top;
/* Clip to maximum blend width, if necessary.
*/
if( ovlap->mwidth >= 0 &&
*last - *first > ovlap->mwidth ) {
int shrinkby = (*last - *first) - ovlap->mwidth;
*first += shrinkby / 2;
*last -= shrinkby / 2;
}
}
}
g_mutex_unlock( ovlap->fl_lock );
return( 0 );
}
int find_top(int x){
return x == Ftop[x] ? x : (Ftop[x] = find_top(Ftop[x]));
}
