Changeset 368 for soft/giet_vm/giet_libs
- Timestamp:
- Jul 31, 2014, 8:47:14 PM (10 years ago)
- Location:
- soft/giet_vm/giet_libs
- Files:
-
- 2 added
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
soft/giet_vm/giet_libs/barrier.c
r352 r368 5 5 // Copyright (c) UPMC-LIP6 6 6 /////////////////////////////////////////////////////////////////////////////////// 7 // These barrier.c and barrier.h files are part of the GIET nano-kernel.8 // This user-level library provides a synchronisation service between several9 // tasks sharing the same address space in a parallel multi-tasks application.10 // Neither the barrier_init(), nor the barrier_wait() function require a syscall.11 // The barrier itself must have been allocated in a shared data segment.12 ///////////////////////////////////////////////////////////////////////////////////13 7 14 8 #include "barrier.h" 15 16 /////////////////////////////////////////////////////////////////////////////////// 17 // This function initializes the barrier: this should be done by a single task. 18 /////////////////////////////////////////////////////////////////////////////////// 9 #include "remote_malloc.h" 10 #include "stdio.h" 11 #include "giet_config.h" 12 13 /////////////////////////////////////////////////////////////////////////////////// 14 /////////////////////////////////////////////////////////////////////////////////// 15 // Simple barrier access functions 16 /////////////////////////////////////////////////////////////////////////////////// 17 /////////////////////////////////////////////////////////////////////////////////// 18 19 /////////////////////////////////////////// 19 20 void barrier_init( giet_barrier_t* barrier, 20 unsigned int value ) 21 { 22 barrier->init = (volatile unsigned int)value; 23 barrier->count = (volatile unsigned int)value; 21 unsigned int ntasks ) 22 { 23 barrier->ntasks = ntasks; 24 barrier->count = ntasks; 25 barrier->sense = 0; 26 24 27 asm volatile ("sync" ::: "memory"); 25 28 } 26 29 27 28 /////////////////////////////////////////////////////////////////////////////////// 29 // This blocking function uses LL/SC to decrement the barrier's counter. 30 // Then, it uses a busy_waiting mechanism if it is not the last. 31 /////////////////////////////////////////////////////////////////////////////////// 30 //////////////////////////////////////////// 32 31 void barrier_wait( giet_barrier_t* barrier ) 33 32 { 34 volatile unsigned int * pcount = (unsigned int *) &barrier->count; 35 volatile unsigned int maxcount = barrier->init; 36 volatile unsigned int count = 0; 33 // compute expected sense value 34 unsigned int expected; 35 if ( barrier->sense == 0 ) expected = 1; 36 else expected = 0; 37 37 38 38 // parallel decrement barrier counter using atomic instructions LL/SC 39 // - input : pointer on the barrier counter 40 // - output : counter value 41 asm volatile ( 42 "_barrier_decrement: \n" 43 "ll %0, 0(%1) \n" 44 "addi $3, %0, -1 \n" 45 "sc $3, 0(%1) \n" 46 "beqz $3, _barrier_decrement \n" 47 : "+r"(count) 48 : "r"(pcount) 49 : "$3", "memory"); 50 51 // the last task re-initializes the barrier counter to the max value, 39 // - input : pointer on the barrier counter (pcount) 40 // - output : counter value (count) 41 volatile unsigned int* pcount = (unsigned int *)&barrier->count; 42 volatile unsigned int count = 0; // avoid a warning 43 asm volatile ("barrier_llsc: \n" 44 "ll $2, 0(%1) \n" 45 "addi $3, $2, -1 \n" 46 "sc $3, 0(%1) \n" 47 "addu %0, $2, $0 \n" 48 "beqz $3, barrier_llsc \n" 49 : "=r" (count) 50 : "r" (pcount) 51 : "$3", "$2", "memory" ); 52 53 // the last task re-initializes count and toggle sense, 52 54 // waking up all other waiting tasks 53 54 if (count == 1) 55 { 56 // last task 57 *pcount = maxcount; 58 } 59 else { 60 // other tasks busy-wait 61 while (*pcount != maxcount); 55 if (count == 1) // last task 56 { 57 barrier->count = barrier->ntasks; 58 barrier->sense = expected; 59 } 60 else // other tasks busy waiting the sense flag 61 { 62 // polling sense flag 63 // input: pointer on the sens flag (psense) 64 // input: expected sense value (expected) 65 volatile unsigned int* psense = (unsigned int *)&barrier->sense; 66 asm volatile ("barrier_sense: \n" 67 "lw $3, 0(%0) \n" 68 "bne $3, %1, barrier_sense \n" 69 : 70 : "r"(psense), "r"(expected) 71 : "$3" ); 62 72 } 63 73 64 74 asm volatile ("sync" ::: "memory"); 65 75 } 76 77 /////////////////////////////////////////////////////////////////////////////////// 78 /////////////////////////////////////////////////////////////////////////////////// 79 // SBT barrier access functions 80 /////////////////////////////////////////////////////////////////////////////////// 81 /////////////////////////////////////////////////////////////////////////////////// 82 83 84 //////////////////////////////////////////////////// 85 void sbt_barrier_init( giet_sbt_barrier_t* barrier, 86 unsigned int ntasks ) 87 { 88 unsigned int x; // x coordinate for one SBT node 89 unsigned int y; // y coordinate for one SBT node 90 unsigned int l; // level for one SBT node 91 unsigned int x_size; // max number of clusters in a row for the SBT 92 unsigned int y_size; // max number of clusters in a column for the SBT 93 unsigned int levels; // depth of the SBT (number of levels) 94 95 96 // compute SBT characteristics 97 if ( ntasks == NB_PROCS_MAX ) // mesh 1*1 98 { 99 x_size = 1; 100 y_size = 1; 101 levels = 1; 102 } 103 else if ( ntasks == NB_PROCS_MAX * 2 ) // mesh 2*1 104 { 105 x_size = 2; 106 y_size = 1; 107 levels = 2; 108 } 109 else if ( ntasks == NB_PROCS_MAX * 4 ) // mesh 2*2 110 { 111 x_size = 2; 112 y_size = 2; 113 levels = 3; 114 } 115 else if ( ntasks == NB_PROCS_MAX * 8 ) // mesh 4*2 116 { 117 x_size = 4; 118 y_size = 2; 119 levels = 4; 120 } 121 else if ( ntasks == NB_PROCS_MAX * 16 ) // mesh 4*4 122 { 123 x_size = 4; 124 y_size = 4; 125 levels = 5; 126 } 127 else if ( ntasks == NB_PROCS_MAX * 32 ) // mesh 8*4 128 { 129 x_size = 8; 130 y_size = 4; 131 levels = 6; 132 } 133 else if ( ntasks == NB_PROCS_MAX * 64 ) // mesh 8*8 134 { 135 x_size = 8; 136 y_size = 8; 137 levels = 7; 138 } 139 else if ( ntasks == NB_PROCS_MAX * 128 ) // mesh 16*8 140 { 141 x_size = 16; 142 y_size = 8; 143 levels = 8; 144 } 145 else if ( ntasks == NB_PROCS_MAX * 256 ) // mesh 16*16 146 { 147 x_size = 16; 148 y_size = 16; 149 levels = 9; 150 } 151 else 152 { 153 x_size = 0; // avoid warning 154 y_size = 0; 155 levels = 0; 156 giet_exit("error in tree_barrier_init() : number of tasks must be power of 2\n"); 157 } 158 159 // ntasks initialisation 160 barrier->ntasks = ntasks; 161 162 #if GIET_DEBUG_SBT 163 giet_shr_printf("\n[DEBUG SBT] SBT nodes allocation / ntasks = %d\n", ntasks ); 164 #endif 165 166 // allocates memory for the SBT nodes and initializes SBT nodes pointers array 167 // the number of SBT nodes in a cluster(x,y) depends on (x,y). 168 // At least 1 node / at most 9 nodes 169 for ( x = 0 ; x < x_size ; x++ ) 170 { 171 for ( y = 0 ; y < y_size ; y++ ) 172 { 173 for ( l = 0 ; l < levels ; l++ ) // level 0 nodes 174 { 175 176 if ( ( (l == 0) && ((x&0x00) == 0) && ((y&0x00) == 0) ) || 177 ( (l == 1) && ((x&0x01) == 0) && ((y&0x00) == 0) ) || 178 ( (l == 2) && ((x&0x01) == 0) && ((y&0x01) == 0) ) || 179 ( (l == 3) && ((x&0x03) == 0) && ((y&0x01) == 0) ) || 180 ( (l == 4) && ((x&0x03) == 0) && ((y&0x03) == 0) ) || 181 ( (l == 5) && ((x&0x07) == 0) && ((y&0x03) == 0) ) || 182 ( (l == 6) && ((x&0x07) == 0) && ((y&0x07) == 0) ) || 183 ( (l == 7) && ((x&0x0F) == 0) && ((y&0x07) == 0) ) || 184 ( (l == 8) && ((x&0x0F) == 0) && ((y&0x0F) == 0) ) ) 185 { 186 barrier->node[x][y][l] = remote_malloc( SBT_NODE_SIZE, 0, x, y ); 187 188 #if GIET_DEBUG_SBT 189 giet_shr_printf("[DEBUG SBT] node[%d][%d][%d] : vaddr = %x\n", 190 x, y, l, (unsigned int)barrier->node[x][y][l] ); 191 #endif 192 } 193 } 194 } 195 } 196 197 #if GIET_DEBUG_SBT 198 giet_shr_printf("\n[DEBUG SBT] SBT nodes initialisation\n"); 199 #endif 200 201 // recursively initialize all SBT nodes from root to bottom 202 sbt_build( barrier, 0, 0, levels-1, NULL ); 203 204 asm volatile ("sync" ::: "memory"); 205 } 206 207 //////////////////////////////////////////////////// 208 void sbt_barrier_wait( giet_sbt_barrier_t* barrier ) 209 { 210 // compute cluster coordinates for the calling task 211 unsigned int procid = giet_procid(); 212 unsigned int cluster_xy = procid / NB_PROCS_MAX; 213 unsigned int x = cluster_xy >> Y_WIDTH; 214 unsigned int y = cluster_xy & ((1<<Y_WIDTH)-1); 215 216 // recursively decrement count from bottom to root 217 sbt_decrement( barrier->node[x][y][0] ); 218 219 asm volatile ("sync" ::: "memory"); 220 } 221 222 223 ///////////////////////////////////////////// 224 void sbt_build( giet_sbt_barrier_t* barrier, 225 unsigned int x, 226 unsigned int y, 227 unsigned int level, 228 sbt_node_t* parent ) 229 { 230 // This recursive function initializes the SBT notes 231 // traversing the SBT from root to bottom 232 233 // get target node address 234 sbt_node_t* node = barrier->node[x][y][level]; 235 236 if (level == 0 ) // terminal case 237 { 238 // initializes target node 239 node->arity = NB_PROCS_MAX; 240 node->count = NB_PROCS_MAX; 241 node->sense = 0; 242 node->level = 0; 243 node->parent = parent; 244 node->child0 = NULL; 245 node->child1 = NULL; 246 } 247 else // non terminal case 248 { 249 unsigned int x0; // x coordinate for child0 250 unsigned int y0; // y coordinate for child0; 251 unsigned int x1; // x coordinate for child1; 252 unsigned int y1; // y coordinate for child1; 253 254 // the child1 coordinates depends on the level value 255 if ( level & 0x1 ) // odd level => X binary tree 256 { 257 x0 = x; 258 y0 = y; 259 x1 = x + (1 << ((level-1)>>2)); 260 y1 = y; 261 } 262 else // even level => Y binary tree 263 { 264 x0 = x; 265 y0 = y; 266 x1 = x; 267 y1 = y + (1 << ((level-1)>>2)); 268 } 269 270 // initializes target node 271 node->arity = 2; 272 node->count = 2; 273 node->sense = 0; 274 node->level = level; 275 node->parent = parent; 276 node->child0 = barrier->node[x0][y0][level-1]; 277 node->child1 = barrier->node[x1][y1][level-1]; 278 279 // recursive calls for children nodes 280 sbt_build( barrier , x0 , y0 , level-1 , node ); 281 sbt_build( barrier , x1 , y1 , level-1 , node ); 282 } 283 284 #if GIET_DEBUG_SBT 285 giet_shr_printf("[DEBUG SBT] initialize node[%d][%d][%d] :" 286 " arity = %d / child0 = %x / child1 = %x\n", 287 x, y, level, 288 node->arity, node->child0, node->child1 ); 289 #endif 290 291 } // end sbt_build() 292 293 294 /////////////////////////////////////// 295 void sbt_decrement( sbt_node_t* node ) 296 { 297 // This recursive function decrements the distributed "count" variables, 298 // traversing the SBT from bottom to root. 299 300 // compute expected sense value (toggle) 301 unsigned int expected; 302 if ( node->sense == 0) expected = 1; 303 else expected = 0; 304 305 // atomic decrement 306 // - input : count address (pcount) 307 // - output : modified counter value (count) 308 unsigned int* pcount = (unsigned int*)&node->count; 309 unsigned int count = 0; // avoid a warning 310 311 asm volatile( "sbt_llsc: \n" 312 "ll $2, 0(%1) \n" 313 "addi $3, $2, -1 \n" 314 "sc $3, 0(%1) \n" 315 "addu %0, $2, $0 \n" 316 "beqz $3, sbt_llsc \n" 317 : "=r" (count) 318 : "r" (pcount) 319 : "$3", "$2", "memory" ); 320 321 if ( count == 1 ) // last task for this level 322 { 323 if ( node->parent == NULL ) // root node : call sbt_release() 324 { 325 sbt_release( node, expected ); 326 } 327 else // call sbt_decrement() for parent 328 { 329 sbt_decrement( node->parent ); 330 } 331 } 332 else // not the last: busy waiting on current "sense" flag 333 { 334 // polling sense flag 335 // input: pointer on the sens flag (psense) 336 // input: expected sense value (expected) 337 volatile unsigned int* psense = (unsigned int *)&node->sense; 338 asm volatile ("sbt_sense: \n" 339 "lw $3, 0(%0) \n" 340 "bne $3, %1, sbt_sense \n" 341 : 342 : "r"(psense), "r"(expected) 343 : "$3" ); 344 } 345 } // end sbt_decrement() 346 347 348 /////////////////////////////////// 349 void sbt_release( sbt_node_t* node, 350 unsigned int expected ) 351 { 352 // This recursive function reset all sense and count variables 353 // traversing the SBT from root to bottom 354 355 // toggle sense flag for the target node 356 node->sense = expected; 357 358 // re-initialise count for the target node 359 node->count = node->arity; 360 361 // call recursively sbt_release() for children if not terminal 362 if ( node->level > 0 ) 363 { 364 sbt_release( node->child0, expected ); 365 sbt_release( node->child1, expected ); 366 } 367 } // end sbt_release() 368 369 // Local Variables: 370 // tab-width: 4 371 // c-basic-offset: 4 372 // c-file-offsets:((innamespace . 0)(inline-open . 0)) 373 // indent-tabs-mode: nil 374 // End: 375 // vim: filetype=c:expandtab:shiftwidth=4:tabsroot=4:softtabsroot=4 66 376 67 377 // Local Variables: -
soft/giet_vm/giet_libs/barrier.h
r295 r368 5 5 // Copyright (c) UPMC-LIP6 6 6 /////////////////////////////////////////////////////////////////////////////////// 7 // The barrier.c and barrier.h files are part of the GIET-VM nano-kernel. 8 // This user-level library provides a synchronisation service between several 9 // tasks sharing the same address space in a parallel multi-tasks application. 10 // 11 // There is actually two types of barriers: 12 // 1) The "giet_barrier_t" is a simple sense-reversing barrier. 13 // It can be safely used several times (in a loop for example), 14 // but it does not scale, and should not be used when the number 15 // of tasks is larger than few tens. 16 // 17 // 2) The giet_sbt_barrier_t" can be used in multi-clusters architectures, 18 // and is implemented as a physically distributed Sliced-Binary-Tree (SBT). 19 // WARNING: The following placement constraints must be respected: 20 // - The number of tasks must be a power of 2. 21 // - There is one task per processor in a given cluster. 22 // - The involved clusters form a mesh[N][N] or a mesh[N][N/2] 23 // - The lower left involved cluster is cluster(0,0) 24 // 25 // Neither the barrier_init(), nor the barrier_wait() function require a syscall. 26 // For both types of barriers, the barrier initialisation should be done by 27 // one single task. 28 /////////////////////////////////////////////////////////////////////////////////// 7 29 8 30 #ifndef _BARRIER_H_ 9 31 #define _BARRIER_H_ 10 32 33 #include "hard_config.h" 34 11 35 /////////////////////////////////////////////////////////////////////////////////// 12 // barrier structure 36 /////////////////////////////////////////////////////////////////////////////////// 37 // simple barrier structure and access functions 38 /////////////////////////////////////////////////////////////////////////////////// 13 39 /////////////////////////////////////////////////////////////////////////////////// 14 40 15 41 typedef struct giet_barrier_s 16 42 { 17 char name[32]; // barrier name 18 unsigned int init; // total number of participants 19 unsigned int count; // number of not yet arrived tasks 43 char name[32]; // barrier name 44 unsigned int sense; // barrier state (toggle) 45 unsigned int ntasks; // total number of expected tasks 46 unsigned int count; // number of not arrived tasks 20 47 } giet_barrier_t; 21 48 22 /////////////////////////////////////////////////// ///////////////////////////23 // access functions 24 ////////////////////////////////////////////////////////////////////////////// 49 /////////////////////////////////////////////////// 50 extern void barrier_init( giet_barrier_t* barrier, 51 unsigned int ntasks ); 25 52 26 void barrier_init( giet_barrier_t* barrier, 27 unsigned int value ); // number of tasks 53 //////////////////////////////////////////////////// 54 extern void barrier_wait( giet_barrier_t* barrier ); 28 55 29 void barrier_wait( giet_barrier_t* barrier ); 56 /////////////////////////////////////////////////////////////////////////////////// 57 ////////////////////////////////////////////////////////////////////////////////// 58 // SBT barrier structures and access functions 59 ////////////////////////////////////////////////////////////////////////////////// 60 ////////////////////////////////////////////////////////////////////////////////// 61 62 typedef struct sbt_node_s 63 { 64 unsigned int arity; // number of children (must be 2 or 4) 65 unsigned int count; // number of not arrived children 66 unsigned int sense; // barrier state (toggle) 67 unsigned int level; // hierarchical level (0 is bottom) 68 struct sbt_node_s* parent; // pointer on parent node (NULL for root) 69 struct sbt_node_s* child0; // pointer on children node 70 struct sbt_node_s* child1; // pointer on children node 71 } sbt_node_t; 72 73 #define SBT_NODE_SIZE 32 74 75 typedef struct giet_sbt_barrier_s 76 { 77 char name[32]; // barrier name 78 unsigned int ntasks; // total number of expected tasks 79 sbt_node_t* node[X_SIZE][Y_SIZE][9]; // array of pointers on SBT nodes 80 } giet_sbt_barrier_t; 81 82 /////////////////////////////////////////////////////////// 83 extern void sbt_barrier_init( giet_sbt_barrier_t* barrier, 84 unsigned int ntasks ); 85 86 ///////////////////////////////////////////////////////////// 87 extern void sbt_barrier_wait( giet_sbt_barrier_t* barrier ); 88 89 ///////////////////////////////////////////// 90 void sbt_build( giet_sbt_barrier_t* barrier, 91 unsigned int x, 92 unsigned int y, 93 unsigned int level, 94 sbt_node_t* parent ); 95 96 /////////////////////////////////////// 97 void sbt_decrement( sbt_node_t* node ); 98 99 /////////////////////////////////// 100 void sbt_release( sbt_node_t* node, 101 unsigned int expected ); 102 103 30 104 31 105 #endif -
soft/giet_vm/giet_libs/malloc.c
r325 r368 828 828 /****** First call to malloc ******/ 829 829 if (_first_malloc[task_id] == 0) { 830 giet_heap_info(&_heap_base[task_id], &_heap_length[task_id]); 830 giet_heap_info( &_heap_base[task_id], 831 &_heap_length[task_id], 832 0xFFFFFFFF, 833 0xFFFFFFFF ); 831 834 832 835 if (_heap_length[task_id] == 0) { -
soft/giet_vm/giet_libs/spin_lock.c
r266 r368 4 4 // Author : alain greiner 5 5 // Copyright (c) UPMC-LIP6 6 ///////////////////////////////////////////////////////////////////////////////////7 // The spin_lock.c and spin_lock.h files are part of the GIET nano-kernel.8 // This middlewre implements a user-level lock (busy waiting mechanism,9 // because the GIET does not support task scheduling / descheduling).10 // It is a simple binary lock, without waiting queue.11 //12 // The lock_acquire() and lock_release() functions do not require a system call.13 // The barrier itself must have been allocated in a non cacheable segment,14 // if the platform does not provide hardwate cache coherence.15 //16 // ALL locks must be defined in the mapping_info data structure,17 // to be initialised by the GIET in the boot phase.18 // The vobj_get_vbase() system call (defined in stdio.c and stdio.h files)19 // can be used to get the virtual base address of the lock fro it's name.20 6 /////////////////////////////////////////////////////////////////////////////////// 21 7 … … 28 14 // If the lock is already taken a random delay is introduced before retry. 29 15 /////////////////////////////////////////////////////////////////////////////////// 30 void lock_acquire(giet_lock_t * lock) { 16 void lock_acquire(giet_lock_t * lock) 17 { 31 18 unsigned int * plock = &lock->value; 32 19 unsigned int delay = giet_rand(); … … 62 49 // lock_release() 63 50 ////////////////////////////////////////////////////////////////////////////// 64 void lock_release(giet_lock_t * lock) { 51 void lock_release(giet_lock_t * lock) 52 { 65 53 unsigned int * plock = &lock->value; 66 54 -
soft/giet_vm/giet_libs/spin_lock.h
r258 r368 4 4 // Author : alain greiner 5 5 // Copyright (c) UPMC-LIP6 6 /////////////////////////////////////////////////////////////////////////////////// 7 // The spin_lock.c and spin_lock.h files are part of the GIET-VM nano-kernel. 8 // This library implements a user-level lock. 9 // It is a simple binary lock, without waiting queue. 10 // The lock_acquire() and lock_release() functions do not require a system call. 11 // If the platform does not provide hardware cache coherence, the lock must be 12 // declared in a non cacheable segment, 13 // 14 // When a lock is defined in the mapping, it has not to be declared in the 15 // application code: it will be initialised in the boot phase, 16 // and the vobj_get_vbase() system call (defined in stdio.c and stdio.h files) 17 // can be used to get the virtual base address of the lock from it's name. 6 18 /////////////////////////////////////////////////////////////////////////////////// 7 19 … … 11 23 /////////////////////////////////////////////////////////////////////////////////// 12 24 // lock structure 13 // This is a simple binary lock (without waiting queue).14 25 /////////////////////////////////////////////////////////////////////////////////// 15 26 16 typedef struct giet_lock_s { 17 char name[32]; // lock name 27 typedef struct giet_lock_s 28 { 29 char name[60]; // lock name 18 30 unsigned int value; // taken if value != 0 19 31 } giet_lock_t; … … 23 35 ////////////////////////////////////////////////////////////////////////////// 24 36 25 void lock_acquire(giet_lock_t * lock);26 void lock_release(giet_lock_t * lock);37 extern void lock_acquire(giet_lock_t * lock); 38 extern void lock_release(giet_lock_t * lock); 27 39 28 40 #endif -
soft/giet_vm/giet_libs/stdio.c
r352 r368 13 13 #include <stdio.h> 14 14 #include <giet_config.h> 15 16 ////////////////////////////////////////////////////////////////////////////////////17 ////////////////////// MIPS32 related system calls ///////////////////////////////18 ////////////////////////////////////////////////////////////////////////////////////19 15 20 16 //////////////////////////////////////////////////////////////////////////////////// … … 645 641 /////////////////////////////////////////////// 646 642 void giet_proc_number( unsigned int cluster_id, 647 unsigned int* buffer )643 unsigned int* buffer ) 648 644 { 649 645 if ( sys_call( SYSCALL_PROC_NUMBER, … … 662 658 ///////////////////////////////////////// 663 659 void giet_heap_info( unsigned int* vaddr, 664 unsigned int* length ) 660 unsigned int* length, 661 unsigned int x, 662 unsigned int y ) 665 663 { 666 664 if ( sys_call( SYSCALL_HEAP_INFO, 667 665 (unsigned int)vaddr, 668 666 (unsigned int)length, 669 0, 0 ) ) giet_exit("in giet_heap_info()"); 667 x, 668 y ) ) giet_exit("in giet_heap_info()"); 670 669 } 671 670 -
soft/giet_vm/giet_libs/stdio.h
r352 r368 52 52 #define SYSCALL_FAT_FSTAT 0x24 53 53 #define SYSCALL_FAT_CLOSE 0x25 54 55 ////////////////////////////////////////////////////////////////////////////////// 56 // NULL pointer definition 57 ////////////////////////////////////////////////////////////////////////////////// 58 59 #define NULL (void *)0 54 60 55 61 ////////////////////////////////////////////////////////////////////////////////// … … 422 428 423 429 ////////////////////////////////////////////////////////////////////////// 424 // This function returns the base address and size of the task's heap 430 // This function supports access to the task's heap or to a remote heap: 431 // - If (x < X_SIZE) and (y < Y_SIZE), this function returns the base 432 // address and length of the heap associated to any task running 433 // on cluster(x,y) => remote heap 434 // - Else, this function returns the base address and length of the 435 // heap associated to the calling task => local heap 425 436 ////////////////////////////////////////////////////////////////////////// 426 437 extern void giet_heap_info( unsigned int* vaddr, 427 unsigned int* size ); 438 unsigned int* length, 439 unsigned int x, 440 unsigned int y ); 428 441 429 442 #endif
Note: See TracChangeset
for help on using the changeset viewer.