The world famous unmoderated thread

So your idea of attempting to end discrimination is not care if anyone did find it offensive and shove it down everyones throat till they don't care so you get to use the word as a "joke".

We have probably got past the part where most people would find it offensive but what words next. Either way i do wonder if you would use that word as a "joke" in a job interview or with someone you dint know though you thought might be gay.

 

I think WDK has abducted Paulo and his using his computer.

 

I pretty much agree with everything you've said, and have dealt with the same frustrations going through college. The middle-class white male is probably one of the most "discriminated against" people in our society today, yet no one really cares. It's not a very explicit form of discrimination, but it is there and I don't care what anyone says because I've experienced it first hand, be it being unable to get a job, scholarship, etc., I have experienced it throughout college.

I also agree with you on the use of the word "gay" being mostly harmless, but there are many crusaders here who will lambaste anyone for using that word in a way that can be viewed as even slightly offensive to them. I tend to think of it as an issue of the evolution of language. People tend not to think about how language is an ever evolving thing, where words fall in an out of meanings.

 

I do, as a matter of fact. And when they happen to say "HEY IM GAY AND THAT OFFENDS ME", I lie and tell them that I am gay, and that magically makes it ok with them. Then, I tell them I'm not gay, and by that time I've hopefully made their mind explode from all of the cognitive dissonance.

 

If words like gay shouldn't be used because there offensive, then everyone should also stop cussing since those words are a little more vulgar etc. Everyone contradicts themselves. Accept it.

 

Learn not to take offense all the time and see how much your life changes. I know where people are coming from. A lot of times they just don't know any better. It's not fun at all letting every little thing bother you.

 

This discussion is gay.

 

*head asplodes*

 

Say "That was gay" again! SAY IT!

lol

 

bitch look like he smuggling coconuts in his pants

 

d-_-b--<( ... )

 

You shipping me your Super Wild Card for free = win!

 

Well, it looks like Denmark won against Sweden in Footie . But to honest I hoped that Sweden would kick our arses . Because then I didn't need to hear the hysteria which footie is to me. Because if Denmark won anything significant in footie (yeah we won back in 1992 at Eurocup but that was just a fluke, except the hysteria that went off after wards). So what chances does Denmark have in World Cup in footie ? zero, that is my prediction. And if we magically won the world cup I would be laughing my arse off. Because that is is not possible without some serious fixed matches. But speedway (motor cycle) there Denmark (Nicki Pedersen) has won a load of world cups. Except maybe this year where a fucking (probably paid off) Polish judge judged a false statement at his latest race. So if he doesn't win this world cup in speedway then it is probably the corrupt judge fault, because Nicki Pedersen he can really drive his motor cycle the correct way. And other Danes has won quite a few cool sports, but I am honest about one thing. Denmark can't win world cup in footie, and second of all .
Footie hasn't been exciting for the last many years in my mind. And the craziest part is that I know the rules to football/soccer. But hey that is like a rite of passage to know the rules to that game. Give me some Ultimate Fighting any day of the week (old school rules) then I am game. And how can I who is more of a person who wants more peace than war; like fighting ?
well I am a former practioner of JKD, and if my old instructor ever comes back. I will train with him again. and well to all enjoy your evening cause I am definitely enjoying mine with old Danish 80´s music , and a bit of newer and a lot of older music from Denmark. And congratulations to the Pirate Party of Sweden.

LOL I would not kidnap him, heck I think Paulo is an asshole. But that does not mean I can't agree with him in certain areas such as the GLBT area and other stuff. And if Paulo was unjust attacked, I would defend him . Even though I do not like Paulo, hell I used to think Paulo was a fucking cunt, because of his behaviour while he was on chemo. Which none of us knew while he was on it. And that made me extremely angry, irritated , you bloody name it. And I know for a fact that chemo change people and their psyche. Because they actually fight for their life, and I haven't met many people who had cancer did not get bitter in the end , because they knew they had bought the ticket. But whether chemo saves you or not, then their psyche goes heywire. or at least a lot of cancer patients gets the work with their psyche . But it does not defend his actions when he was on chemo, but it makes more sense. But I will be honest about this, and that is. it was definitely NOT fun while Paulo was on chemo. But it has gotten better since, and that I am happy about. So as long I do not mess with paulo, then I think Paulo and I can be neutral to each other . So what you are babbling about is that , just like back in school there is always a scapegoat to get on while another person is away.

 

Does anyone know how to cheat or hack the "How Well Do You Know Me..." quizzes on Facebook? I really want my friends to like me and be impressed by how much I know about them. I looked at the page source but it revealed no clues...

Thanks in advance.

 

Try it in a friends while they are not looking? I really think there is no hackable way to do this

 

#include <KernelExport.h>

#include <fsproto.h>
#include <lock.h>
#include <cache.h>

#include <stdlib.h>
#include <string.h>
#include <ByteOrder.h>

#include "dosfs.h"
#include "fat.h"
#include "util.h"

#include "file.h"
#include "vcache.h"

#define END_FAT_ENTRY 0x0fffffff
#define BAD_FAT_ENTRY 0x0ffffff1

#define DPRINTF(a,b) if (debug_fat > (a)) dprintf b

static status_t mirror_fats(nspace *vol, uint32 sector, uint8 *buffer)
{
uint32 i;

if (!vol->fat_mirrored)
return B_OK;

sector -= vol->active_fat * vol->sectors_per_fat;

for (i=0;i<vol->fat_count;i++) {
if (i == vol->active_fat)
continue;
cached_write(vol->fd, sector + i*vol->sectors_per_fat, buffer, 1, vol->bytes_per_sector);
}

return B_OK;
}

static int32 _count_free_clusters_fat32(nspace *vol)
{
int32 count = 0;
uint8 *block;
uint32 fat_sector;
uint32 i;
uint32 cur_sector;

cur_sector = vol->reserved_sectors + vol->active_fat * vol->sectors_per_fat;

for(fat_sector = 0; fat_sector < vol->sectors_per_fat; fat_sector++) {
block = (uint8 *)get_block(vol->fd, cur_sector, vol->bytes_per_sector);
if(block == NULL) {
return EIO;
}

for(i=0; i < vol->bytes_per_sector; i += sizeof(uint32)) {
uint32 val = read32(block, i);
if(val == 0) count++;
}

release_block(vol->fd, cur_sector);
cur_sector++;
}

return count;
}

// count free: no parameters. returns int32
// get_entry: cluster #. returns int32 entry/status
// set_entry: cluster #, value. returns int32 status
// allocate: # clusters in N, returns int32 status/starting cluster

enum { _IOCTL_COUNT_FREE_, _IOCTL_GET_ENTRY_, _IOCTL_SET_ENTRY_, _IOCTL_ALLOCATE_N_ENTRIES_ };

static int32 _fat_ioctl_(nspace *vol, uint32 action, uint32 cluster, int32 N)
{
int32 result = 0;
uint32 n = 0, first = 0, last = 0;
uint32 i;
uint32 sector;
uint32 off, val = 0; /* quiet warning */
uint8 *block1, *block2 = NULL; /* quiet warning */

// mark end of chain for allocations
uint32 V = (action == _IOCTL_SET_ENTRY_) ? N : 0x0fffffff;

if (N < 0)
return EINVAL;

ASSERT((action >= _IOCTL_COUNT_FREE_) && (action <= _IOCTL_ALLOCATE_N_ENTRIES_));

if (check_nspace_magic(vol, "_fat_ioctl_")) return EINVAL;

DPRINTF(3, ("_fat_ioctl_: action %lx, cluster %lx, N %lx\n", action, cluster, N));


if (action == _IOCTL_COUNT_FREE_) {
if(vol->fat_bits == 32)
// use a optimized version of the cluster counting algorithms
return _count_free_clusters_fat32(vol);
else
cluster = 2;
}

if (action == _IOCTL_ALLOCATE_N_ENTRIES_)
cluster = vol->last_allocated;

if (action != _IOCTL_COUNT_FREE_) {
if (!IS_DATA_CLUSTER(cluster)) {
DPRINTF(0, ("_fat_ioctl_ called with invalid cluster (%lx)\n", cluster));
return EINVAL;
}
}

off = cluster * vol->fat_bits / 8;
sector = vol->reserved_sectors + vol->active_fat * vol->sectors_per_fat +
off / vol->bytes_per_sector;
off %= vol->bytes_per_sector;

if ((block1 = (uint8 *)get_block(vol->fd, sector, vol->bytes_per_sector)) == NULL) {
DPRINTF(0, ("_fat_ioctl_: error reading fat (sector %lx)\n", sector));
return EIO;
}

for (i=0;i<vol->total_clusters;i++) {
ASSERT(IS_DATA_CLUSTER(cluster));
ASSERT(off == ((cluster * vol->fat_bits / 8) % vol->bytes_per_sector));

if (vol->fat_bits == 12) {
if (off == vol->bytes_per_sector - 1) {
if ((block2 = (uint8 *)get_block(vol->fd, ++sector, vol->bytes_per_sector)) == NULL) {
DPRINTF(0, ("_fat_ioctl_: error reading fat (sector %lx)\n", sector));
result = EIO;
sector--;
goto bi;
}
}
if (action != _IOCTL_SET_ENTRY_) {
if (off == vol->bytes_per_sector - 1) {
val = block1[off] + 0x100*block2[0];
} else
val = block1[off] + 0x100*block1[off+1];
if (cluster & 1) {
val >>= 4;
} else {
val &= 0xfff;
}
if (val > 0xff0) val |= 0x0ffff000;
}
if (((action == _IOCTL_ALLOCATE_N_ENTRIES_) && (val == 0)) ||
(action == _IOCTL_SET_ENTRY_)) {
uint32 andmask, ormask;
if (cluster & 1) {
ormask = (V & 0xfff) << 4;
andmask = 0xf;
} else {
ormask = V & 0xfff;
andmask = 0xf000;
}
block1[off] &= (andmask & 0xff);
block1[off] |= (ormask & 0xff);
if (off == vol->bytes_per_sector - 1) {
mark_blocks_dirty(vol->fd, sector - 1, 1);
mirror_fats(vol, sector - 1, block1);
block2[0] &= (andmask >> 8);
block2[0] |= (ormask >> 8);
} else {
block1[off+1] &= (andmask >> 8);
block1[off+1] |= (ormask >> 8);
}
}

if (off == vol->bytes_per_sector - 1) {
off = (cluster & 1) ? 1 : 0;
release_block(vol->fd, sector - 1);
block1 = block2;
} else {
off += (cluster & 1) ? 2 : 1;
}
} else if (vol->fat_bits == 16) {
if (action != _IOCTL_SET_ENTRY_) {
val = read16(block1, off);
// val = block1[off] + 0x100*block1[off+1];
if (val > 0xfff0) val |= 0x0fff0000;
}
if (((action == _IOCTL_ALLOCATE_N_ENTRIES_) && (val == 0)) ||
(action == _IOCTL_SET_ENTRY_)) {
*(uint16 *)&block1[off] = B_HOST_TO_LENDIAN_INT16(V);
// block1[off] = V & 0xff;
// block1[off+1] = (V >> 8) & 0xff;
}
off += 2;
} else if (vol->fat_bits == 32) {
if (action != _IOCTL_SET_ENTRY_) {
val = read32(block1, off) & 0x0fffffff;
// val = block1[off] + 0x100*block1[off+1] +
// 0x10000*block1[off+2] + 0x1000000*(block1[off+3]&0x0f);
// if (val > 0x0ffffff0) val |= 0x00000000;
}
if (((action == _IOCTL_ALLOCATE_N_ENTRIES_) && (val == 0)) ||
(action == _IOCTL_SET_ENTRY_)) {
ASSERT((V & 0xf0000000) == 0);
*(uint32 *)&block1[off] = B_HOST_TO_LENDIAN_INT32(V);
// block1[off] = V & 0xff;
// block1[off+1] = (V >> 8) & 0xff;
// block1[off+2] = (V >> 16) & 0xff;
// block1[off+3] = (V >> 24) & 0x0f;
// ASSERT(V == (block1[off] + 0x100*block1[off+1] + 0x10000*block1[off+2] + 0x1000000*block1[off+3]));
}
off += 4;
} else
ASSERT(0);

if (action == _IOCTL_COUNT_FREE_) {
if (val == 0)
result++;
} else if (action == _IOCTL_GET_ENTRY_) {
result = val;
goto bi;
} else if (action == _IOCTL_SET_ENTRY_) {
mark_blocks_dirty(vol->fd, sector, 1);
mirror_fats(vol, sector, block1);
goto bi;
} else if ((action == _IOCTL_ALLOCATE_N_ENTRIES_) && (val == 0)) {
vol->free_clusters--;
mark_blocks_dirty(vol->fd, sector, 1);
mirror_fats(vol, sector, block1);
if (n == 0) {
ASSERT(first == 0);
first = last = cluster;
} else {
ASSERT(IS_DATA_CLUSTER(first));
ASSERT(IS_DATA_CLUSTER(last));
// set last cluster to point to us

if ((result = _fat_ioctl_(vol,_IOCTL_SET_ENTRY_,last,cluster)) < 0) {
ASSERT(0);
goto bi;
}

last = cluster;
}

if (++n == (uint32)N)
goto bi;
}

// iterate cluster and sector if needed
if (++cluster == vol->total_clusters + 2) {
release_block(vol->fd, sector);

cluster = 2;
off = 2 * vol->fat_bits / 8;
sector = vol->reserved_sectors + vol->active_fat * vol->sectors_per_fat;

block1 = (uint8 *)get_block(vol->fd, sector, vol->bytes_per_sector);
}

if (off >= vol->bytes_per_sector) {
release_block(vol->fd, sector);
off -= vol->bytes_per_sector; sector++;
ASSERT(sector < vol->reserved_sectors + (vol->active_fat + 1) * vol->sectors_per_fat);
block1 = (uint8 *)get_block(vol->fd, sector, vol->bytes_per_sector);
}

if (block1 == NULL) {
DPRINTF(0, ("_fat_ioctl_: error reading fat (sector %lx)\n", sector));
result = EIO;
goto bi;
}
}

bi:
if (block1) release_block(vol->fd, sector);

if (action == _IOCTL_ALLOCATE_N_ENTRIES_) {
if (result < 0) {
DPRINTF(0, ("pooh. there is a problem. clearing chain (%lx)\n", first));
if (first != 0) clear_fat_chain(vol, first);
} else if (n != (uint32)N) {
DPRINTF(0, ("not enough free entries (%lx/%lx found)\n", n, N));
if (first != 0) clear_fat_chain(vol, first);
result = ENOSPC;
} else if (result == 0) {
vol->last_allocated = cluster;
result = first;
ASSERT(IS_DATA_CLUSTER(first));
}
}

if (result < B_OK)
DPRINTF(0, ("_fat_ioctl_ error: action = %lx cluster = %lx N = %lx (%s)\n", action, cluster, N, strerror(result)));

return result;
}

int32 count_free_clusters(nspace *vol)
{
return _fat_ioctl_(vol, _IOCTL_COUNT_FREE_, 0, 0);
}

static int32 get_fat_entry(nspace *vol, uint32 cluster)
{
int32 value = _fat_ioctl_(vol, _IOCTL_GET_ENTRY_, cluster, 0);

if (value < 0)
return value;

if ((value == 0) || IS_DATA_CLUSTER((uint32)value))
return value;

if (value > 0x0ffffff7)
return END_FAT_ENTRY;

if (value > 0x0ffffff0)
return BAD_FAT_ENTRY;

DPRINTF(0, ("invalid fat entry: %lx\n", value));
return BAD_FAT_ENTRY;
}

static status_t set_fat_entry(nspace *vol, uint32 cluster, int32 value)
{
return _fat_ioctl_(vol, _IOCTL_SET_ENTRY_, cluster, value);
}

// traverse n fat entries
int32 get_nth_fat_entry(nspace *vol, int32 cluster, uint32 n)
{
if (check_nspace_magic(vol, "get_nth_fat_entry")) return EINVAL;

while (n--) {
cluster = get_fat_entry(vol, cluster);

if (!IS_DATA_CLUSTER((uint32)cluster))
break;
}

ASSERT(cluster != 0);

return cluster;
}

// count number of clusters in fat chain starting at given cluster
// should only be used for calculating directory sizes because it doesn't
// return proper error codes
uint32 count_clusters(nspace *vol, int32 cluster)
{
uint32 count = 0;

DPRINTF(2, ("count_clusters %lx\n", cluster));

if (check_nspace_magic(vol, "count_clusters")) return 0;

// not intended for use on root directory
if (!IS_DATA_CLUSTER((uint32)cluster)) {
DPRINTF(0, ("count_clusters called on invalid cluster (%lx)\n", cluster));
return 0;
}

while (IS_DATA_CLUSTER((uint32)cluster)) {
count++;

// break out of circular fat chains in a sketchy manner
if (count == vol->total_clusters)
return 0;

cluster = get_fat_entry(vol, cluster);
}

DPRINTF(2, ("count_clusters %lx = %lx\n", cluster, count));

if (cluster == END_FAT_ENTRY)
return count;

dprintf("cluster = %lx\n", cluster);
ASSERT(0);

return 0;
}

status_t clear_fat_chain(nspace *vol, uint32 cluster)
{
int32 c;
status_t result;

if (!IS_DATA_CLUSTER(cluster)) {
DPRINTF(0, ("clear_fat_chain called on invalid cluster (%lx)\n", cluster));
return EINVAL;
}

ASSERT(count_clusters(vol, cluster) != 0);

DPRINTF(2, ("clearing fat chain: %lx", cluster));
while (IS_DATA_CLUSTER(cluster)) {
if ((c = get_fat_entry(vol, cluster)) < 0) {
DPRINTF(0, ("clear_fat_chain: error clearing fat entry for cluster %lx (%s)\n", cluster, strerror(c)));
return c;
}
if ((result = set_fat_entry(vol, cluster, 0)) != B_OK) {
DPRINTF(0, ("clear_fat_chain: error clearing fat entry for cluster %lx (%s)\n", cluster, strerror(result)));
return result;
}
vol->free_clusters++;
cluster = c;
DPRINTF(2, (", %lx", cluster));
}
DPRINTF(2, ("\n"));

if (cluster != END_FAT_ENTRY)
dprintf("clear_fat_chain: fat chain terminated improperly with %lx\n", cluster);

return 0;
}

status_t allocate_n_fat_entries(nspace *vol, int32 n, int32 *start)
{
int32 c;

ASSERT(n > 0);

DPRINTF(2, ("allocating %lx fat entries\n", n));

c = _fat_ioctl_(vol, _IOCTL_ALLOCATE_N_ENTRIES_, 0, n);
if (c < 0)
return c;

ASSERT(IS_DATA_CLUSTER(c));
ASSERT(count_clusters(vol, c) == n);

DPRINTF(2, ("allocated %lx fat entries at %lx\n", n, c));

*start = c;
return 0;
}

status_t set_fat_chain_length(nspace *vol, vnode *node, uint32 clusters)
{
status_t result;
uint32 i;
int32 c, n;

DPRINTF(1, ("set_fat_chain_length: %Lx to %lx clusters (%lx)\n", node->vnid, clusters, node->cluster));

if (IS_FIXED_ROOT(node->cluster) || (!IS_DATA_CLUSTER(node->cluster) && (node->cluster != 0))) {
DPRINTF(0, ("set_fat_chain_length called on invalid cluster (%lx)\n", node->cluster));
return EINVAL;
}

if (clusters == 0) {
DPRINTF(1, ("truncating node to zero bytes\n"));
if (node->cluster == 0)
return B_OK;
c = node->cluster;
if ((result = clear_fat_chain(vol, c)) != B_OK)
return result;
node->cluster = 0;
node->end_cluster = 0;

// XXX: don't have to do this this way -- can clean up nicely
do {
result = vcache_set_entry(vol, node->vnid,
GENERATE_DIR_INDEX_VNID(node->dir_vnid, node->sindex));
// repeat until memory is freed up
if (result != B_OK)
snooze(5000LL);
} while (result != B_OK);

/* write to disk so that get_next_dirent doesn't barf */
write_vnode_entry(vol, node);

return result;
}

if (node->cluster == 0) {
DPRINTF(1, ("node has no clusters. adding %lx clusters\n", clusters));

if ((result = allocate_n_fat_entries(vol, clusters, &n)) != B_OK)
return result;
node->cluster = n;
node->end_cluster = get_nth_fat_entry(vol, n, clusters - 1);

// XXX: don't have to do this this way -- can clean up nicely
do {
result = vcache_set_entry(vol, node->vnid,
GENERATE_DIR_CLUSTER_VNID(node->dir_vnid, node->cluster));
// repeat until memory is freed up
if (result != B_OK)
snooze(5000LL);
} while (result != B_OK);

/* write to disk so that get_next_dirent doesn't barf */
write_vnode_entry(vol, node);

return result;
}

i = (node->st_size + vol->bytes_per_sector * vol->sectors_per_cluster - 1) /
vol->bytes_per_sector / vol->sectors_per_cluster;
if (i == clusters) return B_OK;

if (clusters > i) {
// add new fat entries
DPRINTF(1, ("adding %lx new fat entries\n", clusters - i));
if ((result = allocate_n_fat_entries(vol, clusters - i, &n)) != B_OK)
return result;

ASSERT(IS_DATA_CLUSTER(n));

result = set_fat_entry(vol, node->end_cluster, n);
if (result < B_OK) {
clear_fat_chain(vol, n);
return result;
}

node->end_cluster = get_nth_fat_entry(vol, n, clusters - i - 1);

return result;
}

// traverse fat chain
c = node->cluster;
n = get_fat_entry(vol,c);
for (i=1;i<clusters;i++) {
if (!IS_DATA_CLUSTER((uint32)n))
break;
c = n;
n = get_fat_entry(vol,c);
}

ASSERT(i == clusters); ASSERT(n != END_FAT_ENTRY);
if ((i == clusters) && (n == END_FAT_ENTRY)) return B_OK;

if (n < 0) return n;
if ((n != END_FAT_ENTRY) && !IS_DATA_CLUSTER((uint32)n)) return EINVAL;

// clear trailing fat entries
DPRINTF(1, ("clearing trailing fat entries\n"));
if ((result = set_fat_entry(vol, c, 0x0fffffff)) != B_OK)
return result;
node->end_cluster = c;
return clear_fat_chain(vol, n);
}

void dump_fat_chain(nspace *vol, uint32 cluster)
{
dprintf("fat chain: %lx", cluster);
while (IS_DATA_CLUSTER(cluster)) {
cluster = get_fat_entry(vol, cluster);
dprintf(" %lx", cluster);
}
dprintf("\n");
}

status_t fragment(nspace *vol, uint32 *pattern)
{
uint32 sector, offset, previous_entry, i, val;
uchar *buffer;
bool dirty = FALSE;

srand(time(NULL)|1);

if (vol->fat_bits == 16)
previous_entry = 0xffff;
else if (vol->fat_bits == 32)
previous_entry = 0x0fffffff;
else {
dprintf("fragment: only for FAT16 and FAT32\n");
return ENOSYS;
}

sector = vol->reserved_sectors + vol->active_fat * vol->sectors_per_fat +
((vol->total_clusters + 2 - 1) * (vol->fat_bits / 8)) /
vol->bytes_per_sector;
offset = ((vol->total_clusters + 2 - 1) * (vol->fat_bits / 8)) %
vol->bytes_per_sector;

buffer = (uchar *)get_block(vol->fd, sector, vol->bytes_per_sector);
if (!buffer) {
dprintf("fragment: error getting fat block %lx\n", sector);
return EINVAL;
}

val = pattern ? *pattern : rand();

for (i=vol->total_clusters+1;i>=2;i--) {
if (val & (1 << (i & 31))) {
if (vol->fat_bits == 16) {
if (read16(buffer, offset) == 0) {
buffer[offset+0] = (previous_entry ) & 0xff;
buffer[offset+1] = (previous_entry >> 8) & 0xff;
previous_entry = i;
dirty = TRUE;
vol->free_clusters--;
}
} else {
if (read32(buffer, offset) == 0) {
buffer[offset+0] = (previous_entry ) & 0xff;
buffer[offset+1] = (previous_entry >> 8) & 0xff;
buffer[offset+2] = (previous_entry >> 16) & 0xff;
buffer[offset+3] = (previous_entry >> 24) & 0xff;
previous_entry = i;
dirty = TRUE;
vol->free_clusters--;
}
}
}

if (!offset) {
if (dirty) {
mark_blocks_dirty(vol->fd, sector, 1);
mirror_fats(vol, sector, buffer);
}
release_block(vol->fd, sector);

dirty = FALSE;
sector--;

buffer = (uchar *)get_block(vol->fd, sector,
vol->bytes_per_sector);
if (!buffer) {
dprintf("fragment: error getting fat block %lx\n", sector);
return EINVAL;
}
}

offset = (offset - vol->fat_bits / 8 + vol->bytes_per_sector) %
vol->bytes_per_sector;

if (!pattern && ((i & 31) == 31))
val = rand();
}

if (dirty) {
mark_blocks_dirty(vol->fd, sector, 1);
mirror_fats(vol, sector, buffer);
}
release_block(vol->fd, sector);

vol->last_allocated = (rand() % vol->total_clusters) + 2;

return B_OK;
}

 

Unfortunatley, I don't think Facebook was written in C.

Or whatever.

 

I had a really strange dream last night.

My dad is currently taking a few Summer courses down in Oregon to keep his teaching certificate valid. He's a music teacher. I dreamed that he was at some sort of convention . My dad was talking to a guy who was displaying a Launch Team 360, a PS3 that had the same color scheme as the Launch 360, as well as a handful of 360 debug units without the sidecar. Anyways, the guy was selling them for exactly $86 each. So I called my dad and asked him to buy some for me and I'd pay him back.

And that's all I remember...

 

It looks like the Greenlanders wants Humpback whale meat with a quota of 10 Humpback whales a year. And the Danish government is okay with it, but then again I am not okay with that, and or for that matter that Denmark was Okay with Japan getting it on with what slaughter in Antarctica. So the proud "Greenlanders" has just gotten some kind of self control, but if you ask me. Then the Greenlanders can go sail in their fucking kayaks and drink their brains out for all I care. Even though the Danish goverment is to blame for much of the shit that has happened the last many centuries . So if you ask me about whaling and scientific / research with slaughtering whales. Then my is as simple as this.. No fucking way would I accept eating any kind of whale, or for that matter support killings of whales. Which I have said before, it just irks me . What this fucking government is doing what it is doing in Denmark. But oh well in 100 years some kids will ask their parents "daddy what was a whale ?" and the parents will give them a fairy tale about wonderous creatures . You can only see on films, skelletons and what, and if they are lucky they will see cloned whales. if I sound ranting, then I am because of two reasons, one is I love whales , two is that I am fond of the Humpback whales, and my father has painted a few pictures with those on.

 

Holy hell crackers, the Greenlanders are looking for another thing to piss off PETA with besides the Obama fly swatting thing. PETA is retarded.:banghead: