drives.c

Go to the documentation of this file.

/****************************************************************

 drives.c

 =============================================================

 Copyright 1996-2014 Tom Barbalet. All rights reserved.

 Permission is hereby granted, free of charge, to any person
 obtaining a copy of this software and associated documentation
 files (the "Software"), to deal in the Software without
 restriction, including without limitation the rights to use,
 copy, modify, merge, publish, distribute, sublicense, and/or
 sell copies of the Software, and to permit persons to whom the
 Software is furnished to do so, subject to the following
 conditions:

 The above copyright notice and this permission notice shall be
 included in all copies or substantial portions of the Software.

 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
 OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
 HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
 WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
 OTHER DEALINGS IN THE SOFTWARE.

 This software and Noble Ape are a continuing work of Tom Barbalet,
 begun on 13 June 1996. No apes or cats were harmed in the writing
 of this software.

 ****************************************************************/

#include "entity.h"
#include "entity_internal.h"

#define GENE_MATE_SEEK(gene)                GENE_VAL_REG(gene, 8, 9, 14, 2)

static void drives_hunger(noble_being * local)
{
    if (being_energy_less_than(local, BEING_HUNGRY))
    {
        being_inc_drive(local, DRIVE_HUNGER);
        being_dec_drive(local, DRIVE_SEX);
    }
    else
    {
        being_dec_drive(local, DRIVE_HUNGER);
    }
}

typedef struct
{
    n_int         beings_in_vacinity;
    noble_being * being;
} drives_sociability_data;

static void drives_sociability_loop(noble_simulation * local_sim, noble_being * other, void * data)
{
    drives_sociability_data * dsd = (drives_sociability_data *)data;
    n_int   distance_squared;
    n_vect2 difference_vector;
    /* this needs to be checked against simulation near sight and sound values */
    const n_int apespace_span = APESPACE_TO_MAPSPACE(10);
    being_delta(dsd->being, other, &difference_vector);
    /* los should not be used here, it's too expensive */
    distance_squared = vect2_dot(&difference_vector, &difference_vector, 1, 1);
    if (distance_squared < (apespace_span * apespace_span))
    {
        dsd->beings_in_vacinity++;
    }
}

static void drives_sociability(
    noble_being * local,
    noble_simulation * sim)
{
    drives_sociability_data dsd;
    dsd.beings_in_vacinity = 0;
    dsd.being = local;
    being_loop_no_thread(sim, local, drives_sociability_loop, &dsd);
    
    if (dsd.beings_in_vacinity < local->crowding + SOCIAL_TOLLERANCE)
    {
        being_inc_drive(local, DRIVE_SOCIAL);
    }
    else
    {
        being_dec_drive(local, DRIVE_SOCIAL);
    }

    if (dsd.beings_in_vacinity < local->crowding) local->crowding--;
    if (dsd.beings_in_vacinity > local->crowding) local->crowding++;

    if (local->crowding < MIN_CROWDING) local->crowding = MIN_CROWDING;

    if (local->crowding > MAX_CROWDING) local->crowding = MAX_CROWDING;
}

static void drives_sex(
    noble_being * local,
    n_int awake,
    noble_simulation * local_sim)
{
    n_int i,max;
    noble_social * local_social_graph = being_social(local);
    n_int age_in_days = AGE_IN_DAYS(local_sim,local);

#ifdef EPISODIC_ON
    noble_episodic * local_episodic = being_episodic(local);
#endif

    if (age_in_days > AGE_OF_MATURITY)
    {
        if (awake)
        {
            being_inc_drive(local, DRIVE_SEX);

            if ((being_drive(local, DRIVE_SEX) > THRESHOLD_SEEK_MATE) &&
                    (local->goal[0] == GOAL_NONE))
            {
                if (GENE_MATE_SEEK(being_genetics(local))&1)
                {
#ifdef EPISODIC_ON
                    if (!local_episodic) return;

                    for(i=0; i<EPISODIC_SIZE; i++)
                    {
                        if (local_episodic[i].event == EVENT_MATE)
                        {
                            if (being_name_comparison(local, local_episodic[i].first_name[BEING_MEETER], local_episodic[i].family_name[BEING_MEETER]))
                            {
                                local->goal[0]=GOAL_MATE;
                                local->goal[1]=local_episodic[i].first_name[BEING_MET];
                                local->goal[2]=local_episodic[i].family_name[BEING_MET];
                                local->goal[3]=GOAL_TIMEOUT;
                                episodic_store_memory(
                                    local, EVENT_SEEK_MATE, AFFECT_SEEK_MATE,
                                    local_sim,
                                    being_gender_name(local), being_family_name(local),
                                    local->goal[1], local->goal[2],0);
                                break;
                            }
                        }
                    }
#endif

                    if (local->goal[0]!=GOAL_MATE)
                    {
                        max = 0;
                        if (!local_social_graph) return;

                        for(i=1; i<SOCIAL_SIZE_BEINGS; i++)
                        {
                            if (!SOCIAL_GRAPH_ENTRY_EMPTY(local_social_graph,i))
                            {
                                if ((local_social_graph[i].attraction) > max)
                                {
                                    max=local_social_graph[i].attraction;
                                    local->goal[0]=GOAL_MATE;
                                    local->goal[1]=
                                        local_social_graph[i].first_name[BEING_MET];
                                    local->goal[2]=
                                        local_social_graph[i].family_name[BEING_MET];
                                    local->goal[3]=GOAL_TIMEOUT;
                                }
                            }
                        }
                        if (local->goal[0]==GOAL_MATE)
                        {
                            episodic_store_memory(
                                local, EVENT_SEEK_MATE, AFFECT_SEEK_MATE,
                                local_sim,
                                being_gender_name(local), being_family_name(local),
                                local->goal[1], local->goal[2],0);
                        }
                    }
                }
            }
            if (being_pregnant(local) != 0)
            {
                if (being_drive(local, DRIVE_SEX) >= GESTATION_SEX_DRIVE_DECREMENT)
                {
                    being_dec_drive(local, DRIVE_SEX);
                }
            }
        }
        else
        {
            being_dec_drive(local, DRIVE_SEX);
        }
        if ((being_drive(local, DRIVE_SEX) < THRESHOLD_SEEK_MATE) &&
                (local->goal[0]==GOAL_MATE))
        {
            local->goal[0]=GOAL_NONE;
        }
    }
}

static void drives_fatigue(
    noble_being * local)
{
    if (being_speed(local) > FATIGUE_SPEED_THRESHOLD)
    {
        being_inc_drive(local, DRIVE_FATIGUE);
        if (being_state(local) & BEING_STATE_SWIMMING)
        {
            being_inc_drive(local, DRIVE_FATIGUE);
        }
        being_dec_drive(local, DRIVE_SEX);
    }
    else
    {
        being_dec_drive(local, DRIVE_FATIGUE);
    }
}

void drives_cycle(noble_simulation * local_sim, noble_being * local_being, void * data)
{
    drives_hunger(local_being);
    drives_sociability(local_being, local_sim);
    drives_sex(local_being, being_awake(local_sim,local_being), local_sim);
    drives_fatigue(local_being);
}