Golden Sun Hacking Community
June 23, 2017, 12:01:26 AM *
Welcome, Guest. Please login or register.
Did you miss your activation email?

Login with username, password and session length
News:
 
  Home Forum DC Wiki Help Search Calendar Downloads Login Register  
  Show Posts
Pages: [1] 2 3 ... 220
1  The Community / Open Discussion / Re: You are beautiful on: Yesterday at 07:08:39 PM
Oh, I am totally totally prepared beautiful! Plus, all it takes is to invoke either the supreme god of the universe Yoshi or His Sexiness Lord Squirtle and most people around here should instantly know who I am. ;)
Nice!  :)  I think more people will recognize Yoshi more than Lord Squirtle, though....
2  The Editor / Golden Sun: The Lost Age Editor / Re: Questions about Space Manager on: June 21, 2017, 06:48:47 PM
@1: Okay.
@2: Oh.

If no free space table:
 Generate one by going through a number of addresses in MFT. (The ones at the beginning.)
 Using these addresses, work your way backwards.
 For each byte is free space as long as it is a 00. (Once there is a non-zero, go to next MFT address or end of file.... and keep scanning backwards.)
If there is already a table, we can use that to determine free space...
His confirmSpace function will check for 00s, again, though... And if there is a non-zero... Then he'll split the entry into two (The general idea is that the first and last chucks are kept as freespace, anything in the middle isn't)... to ensure that data is only containing zeros.
However, the 00 checks in confirmSpace only applies when (freeSpace address)>>28 does not equal 1. .... Makes sense b/c that could mean things that are repointed (the old data) does not need to be checked for 00s... ... And there may be code that can set an entire section to 00s as well. But I'm thinking/guessing that only applies to what was originally found to be 00. (My guess is that he was aiming to keep the size of patches low.... A lot of that is guessing, though... when I actually look at tha data, I'm like..... Huh? Doesn't look like old/outdated freespace tables are cleared out....


Hmmm.....
3  The Editor / Golden Sun: The Lost Age Editor / Re: Questions about Space Manager on: June 21, 2017, 03:44:05 PM
@1: Okay. It's always worth making sure, though... Right?
@2: For which? The fact that he did it address, size, address, size, etc. or???
4  The Editor / Golden Sun: The Lost Age Editor / Re: Questions about Space Manager on: June 21, 2017, 09:43:59 AM
Quote
Yeah "if (list[i<<1]==list[(i-1)<<1])".
so when i = 0x00005000 for example,
list[0x00012000] == list[0x0005FFE] (correct me if I am wrong, still very tired)
that would make little sense to me. I am sure there is some reason that range between the two indices makes sense, but I simply don't know it.
When i=0x5000
if list[0xA000] == list[0x9FFE]

<<1 is like multiplying by 2.

If you do the calculation for any i, the two address will always be the same distance apart (The entry before and the current one... for when the two addresses match... The problem is I'm not sure how they'd ever match based on the rest of the code used? But I'm sure I could have easily missed something.)

list[0] = The first entry's free space address
list[1] = The first entry's free space size
list[2] = second entry's free space address
list[3] = and size (and so on.)

Also, any i that is 0x4000 or above could be out of bounds. Since he has 0x8000 elements. Although, if it turns out that all the list variable is just a pointer to the data (That's the way I think of * after a type)... (As in, no bounds checking), there may still not be an actual error message....

Only the LOAD_INTs and WRITE_INTs / etc. read/write from the ROM, he puts the contents of interest into a "list" variable instead of messing with it directly from the ROM.

Quote
I guess the bitwise OR is some kind of marking that methods afterwards can use.
I get that he's basically adding the bit 0x40000000 for some reason, just wasn't sure why it was needed in this case. (As again, it requires addresses to match to even get to that part. It makes it feel like it is so that next bolded code doesn't get executed or something. But not sure what the reason for all this is.)

---
My WIP code for C# idea:  (A function that may do similar to Atrius's Repointing system... As for right now, we can't assume that any data in a file table has already been repointed from a hex hacker anyway... that, and patch-friendliness (keeping a smaller patch size than my alternative idea.)....However, I do plan to look into the table resizing idea further, just I was thinking I'll probably want to support both ways. (If possible.) )

int claimSpace(int size)
{
//Find space in a possibly "unorganized" list of the lowest size we can get away with.
//Increased free space address/decreases free space size, if new freeSpace size of entry is 0 , remove entry. (Could be set to the last entry's rather than moving everything over.)
//POSSIBLY after a base is done and if I ever feel like it ... if there's enough free space, but there's not one single section that has enough, then do code to organize some data a bit. - It's possible the function that frees space could have something similar as well. Especially if you can run out of free space entries.  (Not sure how I intend to do that yet, so can be ignored.)
//return that address.
}

Might change it to take an address (and maybe another size value) as well, if I decide it should also be responsible for freeing up the invalidated data... and perhaps even updating the pointer. (e.g. freespace and claimspace function often used together?)
But most of that can probably be done via a separate function... Hmm... freeSpace, claimSpace, reallocate....
5  The Editor / Golden Sun: The Lost Age Editor / Re: Questions about Space Manager on: June 20, 2017, 08:26:10 PM
First if? Don't try to understand it without seeing the rest of it: (From Atrius's Source code... C++ Space Manager code file.)

The code before it is about looking for an entry that is of a lower size. Whether one is found or not, depends on how that "if" statement is true or false.
If one is found... the code inside the if block shown in the first post basically swaps them. I'm not sure why there's an "|0x40000000" though...

Spoiler for Hiden:
#include "spacemanager.h"

int spacemanager::list_num;

int spacemanager::organizeList(int *list)
{
     int i, ii, pos, val, size;
     for (i=0; i<list_num-1; i++)
     {
          val=list[(i<<1)+1]; pos=i;
          for (ii=i+1; ii<list_num; ii++)
          {
               if (list[(ii<<1)+1]<val)
               {
                    pos=ii; val=list[(ii<<1)+1];
               }
          }
          if (pos!=i)
          {
               val=list[pos<<1];
               size=list[(pos<<1)+1];
               list[pos<<1]=list[i<<1];
               list[(pos<<1)+1]=list[(i<<1)+1];
               if (val==list[i<<1])
               { list[i<<1]=val|0x40000000; }
               else
               { list[i<<1]=val; }
               list[(i<<1)+1]=size;
          }
          if (list[i<<1]==list[(i-1)<<1])
          {
               list_num--;
               for (ii=i; ii<list_num; ii++)
               {
                    list[ii<<1]=list[(ii+1)<<1];
                    list[(ii<<1)+1]=list[((ii+1)<<1)+1];
               }
               list[list_num<<1]=0; list[(list_num<<1)+1]=0;
               i--;
          }
     }
     //return list_num;
     if ((LOAD_INT(FileTable())>>24)!=8)
     { return list_num; }
     if ((LOAD_INT(FileTable())&0x1FFFFFF)!=0)
     {
          int tlist[32768]; int tnum, tnum2; tnum=list_num;
          pos=LOAD_INT(FileTable());
          WRITE_INT(FileTable(), pos|0x70000000);
          tnum2=spacemanager::mapSpace(tlist); list_num=tnum;
          spacemanager::freeSpace(list, pos,(tnum2<<3)+4);
     }
     else
     { WRITE_INT(FileTable(), 0x7FFFFFFF); }
     pos=spacemanager::findSpace(list, (list_num<<3)+4);
     if (pos>0)
     {
          spacemanager::claimSpace(list, pos, (list_num<<3)+4);
          i=0;
          for (i=0; i<list_num; i++)
          {
               val=list[i<<1];
               WRITE_INT(pos+(i<<3),list[i<<1]);
               WRITE_INT(pos+(i<<3)+4,list[(i<<1)+1]);
          }
          WRITE_INT(pos+(list_num<<3),0x7FFFFFFF);
          WRITE_INT((FileTable()),pos);
          //WRITE_INT(0,0x12345678);
     }
     else
     {
          WRITE_INT(FileTable(),0x08000000);
     }
     return list_num;
}

int spacemanager::mapSpace(int *list)
{
     int pos, val, size;
     for (list_num=0; list_num<32768; list_num++)
     { list[list_num]=0; }
     list_num=0;
     pos=LOAD_INT(FileTable())&0x09FFFFFF;
     if ((pos&0x1FFFFFF)!=0x0)
     {
          val=LOAD_INT(pos+(list_num<<3));
          while (val!=0x7FFFFFFF)
          {
               list[list_num<<1]=val;
               list[(list_num<<1)+1]=LOAD_INT(pos+4+(list_num<<3)); list_num++;
               val=LOAD_INT(pos+(list_num<<3));
               if (val==0)
               { val=0x7FFFFFFF; }
          }
          list[list_num<<1]=0;
          list[(list_num<<1)+1]=0;
          return list_num;
     }
     val=0;
     do
     {
          if (val==1)
          { val++; continue; }
          pos=LOAD_INT(FileTable()+0x4+(val<<2))&0x1FFFFFF;
          if (pos>(FileTable()&0x1FFFFFF))
          {
               pos=FileSize();
          }
          size=0;
          do
          { size++; }
          while (LOAD_BYTE(pos-size)==0);
          size--;
          size=size&0xFFFFFFFC;
          pos-=size;
          if (pos+size==FileSize())
          {
               size+=(32<<20)-FileSize();
          }
          if (size>0)
          {
               list[list_num<<1]=pos|0x08000000;
               list[(list_num<<1)+1]=size;
               list_num++;
          }
          val++;
     }
     while (pos<=(FileTable()&0x1FFFFFF));
     spacemanager::organizeList(list);
     return list_num;
}

int spacemanager::findSpace(int*list, int size)
{
     //size=(size+3)&0xFFFFFFFC;
     int pos, i;
     do
     {
          pos=0;
          for (i=0; i<list_num; i++)
          {
               if (list[(i<<1)+1]>=size)
               {
                    if (spacemanager::confirmSpace(list,list[i<<1],int(size)))
                    {
                         pos=list[i<<1]; i=list_num;
                    }
                    else
                    {
                         pos=-1; i=list_num;
                    }
               }
          }
     }
     while (pos==-1);
     if (pos==0)
     { return pos; }
     return (pos&0x1FFFFFF)|0x08000000;
}
    
int spacemanager::confirmSpace(int *list, int pos, int size)
{
     //size=(size+3)&0xFFFFFFFC;
     int i, index; index=-1;
     for (i=0; i<list_num; i++)
     {
          if ((list[i<<1]&0x1FFFFFF)<=(pos&0x1FFFFFF))
          {
               if (((list[i<<1]+list[(i<<1)+1])&0x1FFFFFF)>=((pos+size)&0x1FFFFFF))
               {
                    index=i; i=list_num;
               }
          }
     }
     if (index<0)
     { return -list_num; }
     if ((list[index<<1]>>28)==1)
     { return list_num; }
     int length, ppos; ppos=pos;
     pos=list[index<<1];
     for (length=0; length<size+(ppos-list[index<<1]); length++)
     {
          if  (LOAD_BYTE(pos+length)!=0)
          {
               size=list[(index<<1)+1]; length--;
               list[(index<<1)+1]=length;
               pos+=size; length=0;
               do
               {
                    length++;
               }
               while (LOAD_BYTE(pos-length)==0);
               length--;
               pos-=length;
               list[list_num<<1]=pos|0x08000000;
               list[(list_num<<1)+1]=length;
               list_num++;
               spacemanager::organizeList(list);
               return -list_num;
          }
     }
     return list_num;
}

int spacemanager::freeSpace(int *list, int pos, int size)
{
     int i, ii, index, pos2, pos3; index=-1; pos2=pos+size;
     pos|=0x10000000;
     for (i=0; i<list_num; i++)
     {
          if ((list[i<<1]&0x1FFFFFF)>(pos&0x1FFFFFF))
          {
               if ((pos2&0x1FFFFFF)>=(list[i<<1]&0x1FFFFFF))
               {
                    pos=pos&0x09FFFFFF|(list[i<<1]&0xF6000000);
                    pos3=list[i<<1]+list[(i<<1)+1];
                    if ((pos3&0x1FFFFFF)>(pos2&0x1FFFFFF))
                    {
                        pos2=pos3;
                        size=(pos2&0x09FFFFFF)-(pos&0x09FFFFFF);
                    }
                    list_num-=1;
                    for (ii=i; ii<list_num; ii++)
                    {
                        list[ii<<1]=list[(ii+1)<<1];
                        list[(ii<<1)+1]=list[((ii+1)<<1)+1];
                    }
                    list[list_num<<1]=0;
                    list[(list_num<<1)+1]=0;
                    i=-1;
               }
          }
          else
          {
               pos3=list[i<<1]+list[(i<<1)+1];
               if ((pos&0x1FFFFFF)<=(pos3&0x1FFFFFF))
               {
                    pos=list[i<<1];
                    if ((pos3&0x1FFFFFF)>(pos2&0x1FFFFFF))
                    {
                        pos2=pos3;
                    }
                    size=(pos2&0x09FFFFFF)-(pos&0x09FFFFFF);
                    list_num-=1;
                    for (ii=i; ii<list_num; ii++)
                    {
                        list[ii<<1]=list[(ii+1)<<1];
                        list[(ii<<1)+1]=list[((ii+1)<<1)+1];
                    }
                    list[list_num<<1]=0;
                    list[(list_num<<1)+1]=0;
                    i=-1;
               }
          }
     }
    
     list[list_num<<1]=(pos&0x1FFFFFF)|0x08000000;
     if ((pos>>28)==1)
     { list[list_num<<1]|=0x10000000; }
     else
     {
          for (i=0; i<size; i++)
          { WRITE_BYTE(pos+i,0); }
     }
     list[(list_num<<1)+1]=size;
     list_num++;
     spacemanager::organizeList(list);
     return list_num;
}

int spacemanager::claimSpace(int *list, int pos, int size)
{
     //size=(size+3)&0xFFFFFFFC;
     if (pos<=0 || size<=0)
     { return -list_num; }
     if (spacemanager::confirmSpace(list, pos, size)<=0)
     { return -list_num; }
     int i, index; index=-1;
     for (i=0; i<list_num; i++)
     {
          if ((list[i<<1]&0x1FFFFFF)<=(pos&0x1FFFFFF))
          {
               if (((list[i<<1]+list[(i<<1)+1])&0x1FFFFFF)>=((pos+size)&0x1FFFFFF))
               {
                    index=i; i=list_num;
               }
          }
     }
     if (index<0)
     { return -list_num; }
     if ((pos&0x1FFFFFF)==(list[index<<1]&0x1FFFFFF))
     {
          if (size<list[(index<<1)+1])
          {
               list[index<<1]+=size;
               list[(index<<1)+1]-=size;
               spacemanager::organizeList(list);
               return list_num;
          }
          else
          {
               list_num-=1;
               for (i=index; i<list_num; i++)
               {
                    list[i<<1]=list[(i+1)<<1];
                    list[(i<<1)+1]=list[((i+1)<<1)+1];
               }
               list[list_num<<1]=0; list[(list_num<<1)+1]=0;
               spacemanager::organizeList(list);
               return list_num;
          }
     }
     else
     {
          i=list[(index<<1)+1]-((pos&0x1FFFFFF)-(list[index<<1]&0x1FFFFFF))-size;
          if (i>0)
          {
               list[list_num<<1]=((pos+size)&0x1FFFFFF)|0x08000000;
               list[(list_num<<1)+1]=i;
               list_num+=1;
          }
          list[(index<<1)+1]=(pos&0x1FFFFFF)-(list[index<<1]&0x1FFFFFF);
     }
     spacemanager::organizeList(list);
     return list_num;
}
6  The Editor / Golden Sun: The Lost Age Editor / Questions about Space Manager on: June 20, 2017, 11:39:05 AM
I went through the space manager code... and I get that it is mostly a simple thing with a lot of code... but a small portion of it confuses me.

For those who don't know, here are details of the space manager functions.
Quote
#pragma once
#import "includes.h"

class spacemanager
{
public:
     static int list_num;
     static int organizeList(int *list);
     static int mapSpace(int *list);
     static int findSpace(int *list, int size);
     static int confirmSpace(int *list, int index, int size);
     static int freeSpace(int *list, int pos, int size);
     static int claimSpace( int *list, int pos, int size);
};
list_num is the total number of entries in Atrius's free space table.
orgaizeList - pretty self-explanatory, but is where my question(s) are.
mapSpace will either load the free space table, or if there isn't one, scan for free space. (Based on MFT pointers that point before MFT address. And after those, will scan from end of ROM.) It scan backwards, though, so once there is a non-zero, the space for that section is known. (32-bit aligned size.)
findSpace is simple, looks for the first entry in the free space list that has enough size that is needed.
confirmSpace checks if the entire section has 00s or not. (Depending on a flag) (It may also check if the freeSpace being used is all in freeSpace, but that's probably pointless with the findSpace function.) - It is obvious that this helps reduce overwritting any hex editor related edits... but otherwise is not required to have.
freeSpace literally adds another entry of freeSpace. (Checks each of the freeSpace entries to see whether that space can be added to it, if not, it will be added as a separate entry.)
claimSpace is similar to freeSpace, except that it removes the freeSpace.



My question is with organizeList.
I get that it sorts the list from least to greatest size... but I don't get the next part:
Quote
         if (pos!=i)
          {
               val=list[pos<<1];
               size=list[(pos<<1)+1];
               list[pos<<1]=list[i<<1];
               list[(pos<<1)+1]=list[(i<<1)+1];
               if (val==list[i<<1])
               { list[i<<1]=val|0x40000000; }
               else
               { list[i<<1]=val; }
               list[(i<<1)+1]=size;
          }
          if (list[i<<1]==list[(i-1)<<1])
          {
               list_num--;
               for (ii=i; ii<list_num; ii++)
               {
                    list[ii<<1]=list[(ii+1)<<1];
                    list[(ii<<1)+1]=list[((ii+1)<<1)+1];
               }
               list[list_num<<1]=0; list[(list_num<<1)+1]=0;
               i--;
          }
The bolded sections.... Do those ever happen? And if so how? Otherwise, is it free to remove without problems?
The top section is for switching entries (For the small to large sizes)
The bottom section looks like it removes an entry for when two addresses next to each other match.

And after this code is basically the stuff that frees the old free space table from the ROM and puts the updated free space table back into the ROM.



When doing this for the C# version, I think I'll try to make it a little simpler if I can... by removing confirmSpace, and also that the freeSpace table shouldn't "claim space" for itself. If table is going to be managed outside the ROM data. Maybe.)
7  General Hacking / Coding / Re: Image transforming on: June 19, 2017, 06:50:12 PM
A message? Might as well spell out to them.... that you are the copyright holder/etc.

But anyway... in the situation where a program is not open-sourced... data/images that are stored outside the program can still be checked against a checksum/signature type thing... if they need not be edited by a user. If editing was the main concern and not necessarily exposure/etc. But that's more me just speaking of an alternative. (That is definitely not foolproof. But then again, neither method is.)

Now I wonder if it is possible to encrypt a file using certain built-in techniques... and make it so one's own program can decrypt it... but only into RAM. (Without actually grabbing any encryption related code yourself.)
8  General Hacking / Coding / Re: Image transforming on: June 19, 2017, 02:43:19 PM
@ 1st post:  Yep. I do believe that is the way you do it.

@ Last post: I see it more as a way for hiding information / decluttering the user experience rather than anti-hack, but okay. (Maybe anti-hack for the inexperienced, though...) Closest I can think of to anti-hacking is a server+client approach that requires an internet connection. Any sensitive data (e.g. Save data) could stay on the server. (That being the server isn't on the player's machine, but the client connects to it.) But of course... if one is going to build a server+client thing... then there's the possible issue of DDOS and such... so, eh. It's never that simple.

Anyway... the client should only send input data like mouse clicks and keyboard presses... and receive image data/audio data.... in best case circumstances... but that's probably a lot of data, though... (graphics/audio), so probably not recommended. But if it was done... I recommend a small resolution (e.g. 240x160=0x9600 pixels)that could possibly be zoomed in to full screen. (So less data is sent across the internet than otherwise.) As for music... I'd say just send the audio file over to the user... As people will probably document it anyway. And less internet traffic=better.)
@My idea:  I can see its potential for a 4-player game, maybe... but a large MMO, probably not. - In that case, image caching would be the way to go, most likely.
9  The Community / Open Discussion / Re: Prox news on: June 19, 2017, 12:33:16 PM
Oh cool. Prox News is back! They went on a year long hiatus, it seems.

Alex Hey everybody! I have a puppet show going! Let me get words into peoples mouths before I start....
Garet Who goes on a year long hiatus?! That's creepy. Must have went on vacation. Right Isaac?
Isaac No! No one goes on a year long vacation without me!
Ivan A vacation? I happen to be on one right now. And the ironic part is, it's all thanks to Hamma for her not knowing how to spell her own name.
Felix Speaking of irony, I went back to elementary school.
Jenna The funny part is that I'm his teacher! I love my job.
Mia Jenna is one fine teacher to be teaching Felix! Teehee!
Felix Apparently, after that fall from Venus Lighthouse, I lost my vocabulary, so I had to relearn it! We're all good now, though!
Sheba He's a quick learner! And for that, I think we know why he was our leader.
Piers I didn't have to go to school to get my vocabulary.
God of All Ventriloquism is so fun! Anyone else wanna try?

Alex Now, which of our puppets took the cookie? Anyone know?
Piers *Munch*munch*
"Alex Shame Kraden, Don't give it away!
God of All Oh, don't worry! I'm not! :P

Alex Oh... look. We've got guests! Give them some cookies!
Saturos Hey umm.. we're just dropping by to delivery the news.
Menardi Yes. She just passed away.
Alex Heheh... Another one down. She didn't see worthwhile anyway.
Jenna Who just passed away?!
Saturos Bye!

Isaac While I was sleeping last night, I dreamed that Saturos wanted to become a game developer... Or wait. Maybe that was someone else... uhhh.... What's his name? I think it was Lord Wolfram. Yes, Lord Wolfram!
Garet So how did that go?
Isaac Actually, I thought it was going to be bad, but it surprisingly turned out to be pretty good! I was scared to wake up it was that good!
Garet I always dreamed I could play Fire Emblem.
Isaac You had a dream too?
Garet Nah... Just wish I could. But I suck bad.

Sheba Boy, it sure is getting hot in here. Why did they pick South Africa for the tourist attraction.
Ivan I don't know, but we still need to find Hamma! No time for video games or anything! Hamma's waiting!

Do they find Hamma... Could she be the one who died? Yadda yadda yadda.... Find out next time... (or never :P) !
10  The Community / Open Discussion / Re: You are beautiful on: June 19, 2017, 09:52:01 AM
I get the feeling that you're mostly right... definitely feels like the reason for why the topic was posted in the first place, anyway....  but I'm guessing he then needed to figure out a better topic then just the name by itself, and that's where the dummy-motivational stuff comes into play.... (So it looks less spammy, but unfortunately, it still looks spammy. And thus I label this a random chat.)

Well.. Funny or not, I like to at least try to be optimistic... and it is his name...  We're all a bunch of crazy people.
11  The Community / Open Discussion / Re: You are beautiful on: June 19, 2017, 08:56:50 AM
^Same! - This topic (like the chatbox) looked like a random chat for discussing random things...  think of it like what a drunk person would do.... (not saying anyone's drunk, of course. Esp. since I kind of doubt it?).... type of vague.  (And if we did take the topic to mean Insprational Quotes... then I would assume it be a duplicate... OR wait, do we even have a duplicate... I feel like there was something, but I don't remember.
Edit again: Here's one: http://forum.goldensunhacking.net/index.php?topic=773.0
A topic named "Motivation", sweet. http://forum.goldensunhacking.net/index.php?topic=402.0)

He could... but no admin is here to do any yelling... (w/o a user report anyway = Which is the assumption right now/not sure about later?) so.... o.O Well, at least he apologized in advance, as well... so ummm.... ouch.
12  The Community / Open Discussion / Re: You are beautiful on: June 19, 2017, 05:20:27 AM
Huh. Are we? This topic seems too vague for me.  I would think this site is beautiful, and very motivational to GS hacking, so why not discuss it? :P

And sounds good that you found the Forbes article. Not sure if it is because of your ad-blocker? Or if the page really is messed up? (Most likely the latter.)



---
Oh yeah! It just occurred to me!
Want something (maybe/maybe not) inspirational?
Watch Big Brother (U.S.)
It's coming on for the summer! Aren't they beautiful?! If you had All Access or a way to see the feeds... You can watch them in bed and stuff... (Black/white in pitch dark, though....) I remember seeing them once in a previous year... (Don't worry, I believe they sleep with their clothes on, or at least, that's as far as I know.) ... but now days, I figure it is a huge waste of time.
(For those who don't know, Big Brother is a 24/7 game show lasting nearly 100 days. Usually less, I think... The whole thing is just a social game where you eliminate 1~2 people a week... similar to Survivor.)

http://bigbrothernetwork.com/big-brother-19-live-feeds-houseguests-cast-reveal/ = Hope you're excited to meet the new cast. (Literally Today = Monday.)  (And no, I don't have All Access... But I do like to look at updates on fansites from time to time. If I'm into it/probably not always.)
13  The Community / Open Discussion / Re: You are beautiful on: June 19, 2017, 04:33:35 AM
It does feels that way a little bit, doesn't it?

I wonder the same.  I think it would be fair if he's the one to decide that, though... (Although, Atrius does technically own the site/ as in... actually paying for it.... Without him, we wouldn't even be here.... so I can't say??)

--
Switch on adminship to us:  I'd be surprise if that was done. But if it is, then cool beans... I have a lot of things I'd like to try to do. Or at least think/consider. (Ideas could change, or maybe not.)
-Username changes (once per 2 week period, can switch back at anytime.)
-Clan joining.
-Revitalize the badge system/ add more. / Maybe even do a weekly sales program. (10% discount? If I change the value of money.)
-Would be cool to have special events again... (If I can think of any?) And have badges for them. One idea is that each user can have an opt-in feature. If they are not opt-in by the time the event starts, they can't claim the badge. (Or I dunno...) ... So like, one example is when opt-in, then that is basically giving us permission to change you name specifically for the event when deemed necessary. Although, it might would be an auto-opt-in thing, where you have to manually opt-out.
-I have my doubts, but should people be able to require a coin purchase for others to download their own hacks? (One idea is to also require that same coin purchase for the author of the patch requiring it... as to sort of deter people from doing it. There could even be a set maximum for the price.)
-Make it so users can get coins without needing others to give it to them. (So the above makes more sense. ... As in, keeping every patch easily obtainable.)

-Bring back Rep system . (Well, only the upping posts part, I think.) , Alternatives include a Like system where you see who liked your post.

-I also would like to add the documentation to the website itself, if ever possible... but anyway...


Ofcourse, if worst comes to worst, the main thing is that we just need an admin who is open to making such arrangements so we can have things like that.

Quick question is... does Kain even have code access???
14  The Community / Open Discussion / Re: You are beautiful on: June 19, 2017, 03:13:59 AM
Good choice.  I myself think it is interesting that we have people who are willing to do something. The alternative is having nothing, which is even more messed up.

As for admins: Guys... I suppose... It feels like it should (not judging by acceptance of it.) be me, Salanewt, and the OpenGS guy (If he really does do a thing/become the #1 choice for GS content.... it'd do what Atrius's fan-game maker thingy was likely intended to do, but probably way better.).... for some reason. ... However, neither Atrius, Kain, nor the OpenGS guy is that active here.
15  The Community / Open Discussion / Re: You are beautiful on: June 19, 2017, 02:21:06 AM
Hmm... Well, to think of it one way... Do you prefer Charon naming us all silly things that we have little control over (for April Fools)... Or Salanewt using a crazy long name? ...


"Dendrophiliafish_the_skull_licker_xx" = Based on the width of the cells... Seems to be true  for Posts and PMs... but Profile Comments will display the rest (like the Cbox.)
Pages: [1] 2 3 ... 220
Cbox
Yesterday at 08:57:37 PM
Fox: @conundrum = Think about 8/16/32 bit aligned address, and what that means... Etc.
Yesterday at 08:55:23 PM
Fox: @Space manager thought for gsmagic = What a conundrum... Whelp... I'll just do whatever.... Probably would waste more time thinking about preventing bugs than coding anyway. :P
June 21, 2017, 09:30:34 AM
Fox: Because he quit a long time ago and has other priorities?
June 21, 2017, 08:35:54 AM
javi3: Atrius, por que no sigues con el editor de golden sun?
June 20, 2017, 10:52:48 AM
Fox: It feels like the safest bet is to do Atrius's repointering system, and have something that organizes the tables done a bit separate... er... Well, it's something to think about.
June 20, 2017, 08:53:41 AM
Fox: HOWEVER... I can see other problems that might cause..... (Even with just the pointer in the MFT)  Meh. It's like you actually need a program to apply patches to do it appropriately.
June 20, 2017, 08:46:38 AM
Fox: ... So... What am I thinking? You ask? That the patches the point data after MFT, should have had pointers in the MFT themselves.... In that case, I can see a possibility of everything working smoothly even if space is needed to the very end of the ROM.
June 20, 2017, 08:37:22 AM
Fox: It's basically that everthink from the point of  editing, to the closest free space to the last entry's address would get repointed forward/backwards depending on space needed... and if space is mapped after patches are added, then that could mean the patches are also repointed. (:o)
June 20, 2017, 08:29:03 AM
Fox: Well, I mean if I map the space out the same way Atrius did it.
June 20, 2017, 08:26:41 AM
Fox: I have a hunch... when I add Map Palette editing the way I'm thinking about... it will cause all patches that repoint to after the MFT to break.... Especially if Atrius's editor wasn't used beforehand. Etc.
June 20, 2017, 07:27:17 AM
Fox: Hmmm... Let's see... regardless of method, I think I still do want to take some of Atrius's Space Manager code... Hmm.....
June 20, 2017, 07:07:27 AM
Fox: say*
June 20, 2017, 07:07:19 AM
Fox: I'd go so far as to see.. even if you are trying to be accurate, there could still be inaccuracies... However, that one was just an example where it was clearly intentional.
June 20, 2017, 07:04:03 AM
Fox: Like*
June 20, 2017, 07:03:55 AM
Fox: Let that one time where they tried to clip a guy out... To put it as short and vague as possible.
June 20, 2017, 06:58:52 AM
Fox: But in case you do watch it... I do know the story on TV that they tell... is not always accurate to what actually happened... (From what one can find out from the feed.) ... but usually the fansites will let you know about that.
June 20, 2017, 06:37:54 AM
Fox: Depends, as each person may have a different opinion... (I'm thinking you might find it like other "reality" shows..)  ... I'm not really into Survivor at current.... I also question if it was something about Julie Chen that made it a little more interesting.... .being the an iconic host that she is.. Weird.
June 19, 2017, 11:57:31 PM
Dendrophiliafish_the_skull_licker_xxXXDx101XyeahbabyyeahxxXX: Honest opinion but is it any good or is it just like all other "reality" television?
June 19, 2017, 11:57:00 PM
Dendrophiliafish_the_skull_licker_xxXXDx101XyeahbabyyeahxxXX: I have a friend who is obsessed with that show and Survivor and he wants me to watch with him.
June 19, 2017, 07:47:18 PM
Fox: So.. as soon as I saw the cast of BB19, I wanted to try to pick my favs on first impression... And I'm curious about these: Elena Davies (Female pick, maybe.) and Kevin Schlehuber (Male pick, maybe. - He's the oldest.) ... whether they even get close to the end or not... I have no idea. Would have to watch them play the game.

Affiliates
Temple of Kraden Golden Sunrise
Powered by MySQL Powered by PHP Powered by SMF 1.1.21 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!
Page created in 0.148 seconds with 20 queries.