00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030 #include "mem.h"
00031 #include "nip_error.h"
00032 #include "os_core.h"
00033
00034 #if (NIP_MEM_ENABLE == 1)
00035
00036
00037 nip_mem_block_t *debug_block;
00038
00039
00040 static uint8_t nip_mem_pool[ NIP_MEM_DYNAMIC_SIZE ];
00041
00042
00043
00044 void nip_mem_init()
00045 {
00046 nip_mem_block_t *current = (nip_mem_block_t *)nip_mem_pool;
00047
00048 current->id = 1;
00049 current->res_length = NIP_MEM_DYNAMIC_SIZE;
00050 current->min_length = 0;
00051 current->used_length = 0;
00052
00053
00054
00055 current->flags = NIP_MEM_FLGS_UNUSED;
00056
00057 }
00058
00059
00060 void nip_mem_free_bytes_ex( nip_mem_block_t *block, nip_mem_size_t size )
00061 {
00062
00063
00064 }
00065
00066
00067 static nip_mem_block_t *nip_mem_locate_block( nip_mem_handle_t block_id )
00068 {
00069 nip_mem_block_t *block;
00070
00071
00072 for ( block = (nip_mem_block_t*) nip_mem_pool;
00073 (uint8_t*)block < &nip_mem_pool[NIP_MEM_DYNAMIC_SIZE];
00074 block = (nip_mem_block_t*)&((uint8_t*)block)[block->res_length])
00075 {
00076 if ( block->id == block_id )
00077 {
00078 return block;
00079 }
00080 }
00081
00082 return NULL;
00083 }
00084
00085
00086 void nip_mem_free( nip_mem_handle_t block_id )
00087 {
00088 nip_mem_block_t *block;
00089
00090
00091 block = nip_mem_locate_block( block_id );
00092 if ( block != NULL )
00093 {
00094
00095 block->flags = NIP_MEM_FLGS_UNUSED;
00096 block->used_length = 0;
00097 block->min_length = 0;
00098
00099 nip_error = NIP_E_OK;
00100 return;
00101 }
00102 nip_error = NIP_E_INVALID_BLOCK;
00103 }
00104
00105
00106
00107
00108
00109
00110
00111 static nip_mem_block_t *nip_mem_split( nip_mem_block_t *block, nip_mem_size_t new_size, nip_mem_handle_t next_id )
00112 {
00113 nip_mem_size_t next_size = block->res_length - new_size;
00114
00115
00116 block->res_length = new_size;
00117
00118
00119 block = (nip_mem_block_t*)&(((uint8_t *)block)[block->res_length]);
00120 block->id = next_id;
00121 block->res_length = next_size;
00122 block->min_length = 0;
00123 block->used_length = 0;
00124 block->flags = NIP_MEM_FLGS_UNUSED;
00125
00126 #if NIP_MEM_DEBUG == 1
00127 if ( block->res_length == 0 )
00128 {
00129
00130 return NIP_MEM_NULL;
00131 }
00132 #endif
00133 return block;
00134 }
00135
00136
00137
00138
00139
00140
00141
00142
00143
00144
00145
00146
00147
00148
00149
00150
00151
00152
00153
00154
00155
00156
00157
00158 nip_mem_block_t *nip_mem_defrag( nip_mem_size_t needed_size,
00159 nip_mem_handle_t free_at_block_id, nip_mem_handle_t new_block_id )
00160 {
00161 nip_mem_size_t request_memory;
00162 nip_mem_size_t free_available;
00163 nip_mem_size_t smallest_available;
00164 nip_mem_size_t total_available;
00165 nip_mem_size_t freed_memory = 0;
00166 nip_mem_size_t unused_memory;
00167 nip_mem_size_t mem_free = 0;
00168 nip_mem_size_t tmp_free;
00169 nip_mem_size_t mem_count;
00170 nip_mem_handle_t block_count;
00171 nip_mem_block_t *block;
00172 nip_mem_block_t *first_block;
00173 uint8_t *insert_pos;
00174 uint8_t scan_pos;
00175
00176
00177
00178 uint8_t free_unused_block;
00179 uint8_t i = 0;
00180
00181 request_memory = needed_size;
00182
00183 if ( new_block_id != free_at_block_id )
00184 request_memory += sizeof( nip_mem_block_t );
00185
00186
00187 first_block = NULL;
00188
00189
00190 if ( free_at_block_id == NIP_MEM_NULL )
00191 insert_pos = nip_mem_pool;
00192 else
00193 insert_pos = NULL;
00194
00195 do
00196 {
00197 scan_pos = 1;
00198
00199 if ( free_at_block_id == NIP_MEM_NULL )
00200 {
00201 scan_pos = 3;
00202 block = (nip_mem_block_t *)(nip_mem_pool + freed_memory);
00203 }
00204 if ( first_block == NULL || request_memory <= freed_memory )
00205 {
00206
00207
00208
00209
00210 block = (nip_mem_block_t *)nip_mem_pool;
00211 }
00212 else
00213 {
00214 block = first_block;
00215 if ( (uint8_t*)block >= insert_pos )
00216 scan_pos = 3;
00217 }
00218
00219
00220 block_count = 0 ;
00221 smallest_available = 0;
00222 total_available = 0;
00223 free_available = 0;
00224
00225
00226 first_block = NULL;
00227
00228
00229 do
00230 {
00231
00232 #if NIP_MEM_DEBUG == 1
00233 if ( (uint8_t *)block > &nip_mem_pool[ NIP_MEM_DYNAMIC_SIZE ]
00234 || block == NULL
00235 || block->res_length < 8 )
00236 {
00237
00238 return NULL;
00239 }
00240 #endif
00241
00242
00243 free_unused_block = 0;
00244
00245
00246 if ( NIP_MEM_BLOCK_LOCKED( block ) )
00247 {
00248
00249
00250 switch ( scan_pos )
00251 {
00252 case 1:
00253
00254
00255
00256 first_block = NULL;
00257 total_available = 0;
00258 smallest_available = 0;
00259 free_available = 0;
00260 break;
00261
00262 case 3:
00263
00264
00265
00266 scan_pos = 4;
00267 break;
00268
00269 default:
00270 break;
00271 }
00272
00273
00274 if ( block->id == free_at_block_id )
00275 {
00276 nip_error = NIP_E_PARAM_FAILED;
00277 return NULL;
00278 }
00279
00280 } else
00281 {
00282
00283
00284
00285
00286 unused_memory = 0;
00287 tmp_free = 0;
00288
00289
00290 if ( !NIP_MEM_BLOCK_USED( block )
00291 && request_memory > freed_memory
00292 && block->id != new_block_id
00293
00294 )
00295 {
00296
00297
00298
00299
00300
00301
00302
00303
00304
00305
00306
00307
00308
00309
00310
00311
00312 if ( i==1 )
00313 {
00314 tmp_free = request_memory - freed_memory;
00315
00316
00317
00318
00319
00320
00321
00322 if ( tmp_free < sizeof( nip_mem_block_t) )
00323 tmp_free = sizeof( nip_mem_block_t );
00324
00325
00326 if ( block->res_length > (tmp_free + sizeof( nip_mem_block_t )) )
00327 {
00328
00329
00330
00331
00332
00333 nip_mem_split( block, tmp_free, block->id );
00334
00335 }
00336 else
00337 tmp_free = block->res_length;
00338
00339 free_unused_block = 1;
00340 }
00341
00342
00343
00344 else
00345 {
00346 free_available += block->res_length;
00347 }
00348
00349
00350
00351
00352
00353 if ( first_block == NULL )
00354 first_block = block;
00355
00356 } else
00357 if ( block->id != new_block_id )
00358 {
00359 if (!NIP_MEM_BLOCK_USED( block ))
00360 free_unused_block = 0;
00361
00362
00363
00364 unused_memory = block->res_length - sizeof( nip_mem_block_t );
00365 if ( block->min_length < block->used_length)
00366 unused_memory -= block->used_length;
00367 else
00368 unused_memory -= block->min_length;
00369
00370
00371 if ( mem_free > unused_memory )
00372 tmp_free = unused_memory;
00373 else
00374 tmp_free = mem_free;
00375 }
00376 else
00377 {
00378
00379
00380 }
00381
00382
00383
00384
00385
00386
00387
00388
00389 if ( tmp_free > 0 )
00390 {
00391 block->res_length -= tmp_free;
00392 freed_memory += tmp_free;
00393 if ( unused_memory > 0 )
00394 unused_memory -= tmp_free;
00395 switch ( scan_pos )
00396 {
00397 case 1:
00398
00399 mem_count = tmp_free + block->res_length;
00400
00401 for (
00402 ;
00403 &((uint8_t*)block)[mem_count] < insert_pos;
00404 mem_count++ )
00405 {
00406 ((uint8_t*)block)[mem_count-tmp_free] = ((uint8_t*)block)[mem_count];
00407 }
00408
00409 break;
00410 case 3:
00411
00412 mem_count = (uint8_t*)block - insert_pos + block->res_length;
00413 while ( mem_count > 0 )
00414 {
00415 mem_count--;
00416 ((uint8_t*)insert_pos)[mem_count+tmp_free] = ((uint8_t*)insert_pos)[mem_count];
00417 }
00418
00419
00420 block = ( nip_mem_block_t *) ((uint8_t*) block + tmp_free);
00421 break;
00422 }
00423 }
00424
00425
00426 total_available += unused_memory;
00427
00428 if ( unused_memory > 0 )
00429 {
00430
00431
00432 if ( first_block == NULL )
00433 first_block = block;
00434
00435 block_count++;
00436
00437 if ( unused_memory < smallest_available || smallest_available == 0)
00438 smallest_available = unused_memory;
00439
00440 }
00441 }
00442
00443
00444
00445
00446
00447 if ( block->id == free_at_block_id )
00448 {
00449 insert_pos = &(( uint8_t* )block)[block->res_length];
00450 }
00451
00452
00453
00454
00455 if ( request_memory <= freed_memory && block->id == free_at_block_id )
00456 scan_pos = 2;
00457 else
00458 if ( free_unused_block )
00459 {
00460
00461
00462 }
00463 else
00464 {
00465
00466 block = (nip_mem_block_t*)(((uint8_t*)block)+ block->res_length);
00467 if ( block == ( nip_mem_block_t *) insert_pos )
00468 {
00469
00470 block = ( nip_mem_block_t* )( insert_pos + freed_memory );
00471 scan_pos = 3;
00472 }
00473
00474 #if NIP_MEM_DEBUG == 1
00475 if ( (uint8_t *)block > &nip_mem_pool[ NIP_MEM_DYNAMIC_SIZE ]
00476 || block == NULL
00477 || ((uint8_t *)block < &nip_mem_pool[ NIP_MEM_DYNAMIC_SIZE ] && block->res_length < 8) )
00478 {
00479
00480 return NULL;
00481 }
00482 #endif
00483 }
00484
00485
00486 if ( (uint8_t*)block == &nip_mem_pool[ NIP_MEM_DYNAMIC_SIZE ] )
00487 scan_pos = 4;
00488
00489
00490 if ( request_memory < freed_memory + mem_free )
00491 mem_free = request_memory - freed_memory;
00492
00493
00494 if ( free_available > 0 || request_memory <= freed_memory )
00495 mem_free = 0;
00496
00497 } while ( scan_pos != 2 && scan_pos != 4 );
00498
00499
00500
00501
00502
00503
00504
00505
00506
00507
00508 if ( request_memory > total_available + free_available + freed_memory )
00509 {
00510 nip_error = NIP_E_OUT_OF_MEMORY;
00511 return NULL;
00512 }
00513
00514
00515 if ( request_memory <= freed_memory && scan_pos == 2 )
00516 {
00517
00518 if ( new_block_id != free_at_block_id )
00519 {
00520 block = ( nip_mem_block_t *) insert_pos;
00521 block->id = new_block_id;
00522 block->res_length = freed_memory;
00523 block->flags = NIP_MEM_FLGS_UNUSED;
00524
00525 block->min_length = freed_memory;
00526 block->used_length = 0;
00527 }
00528 else
00529 {
00530 block->res_length += freed_memory;
00531 }
00532 #if NIP_MEM_DEBUG == 1
00533 debug_block = (nip_mem_block_t*)&((uint8_t*)block)[block->res_length];
00534 #endif
00535 nip_error = NIP_E_OK;
00536 return block;
00537 }
00538
00539 else if ( block_count > 0 && request_memory > freed_memory)
00540 {
00541 mem_free = ( request_memory - freed_memory ) / block_count;
00542
00543
00544
00545 if ( mem_free > smallest_available )
00546 mem_free = smallest_available;
00547
00548 if ( request_memory - freed_memory == 1 )
00549 mem_free = 1;
00550 }
00551
00552 i = 1;
00553 } while (1);
00554
00555 }
00556
00557
00558
00559 nip_error_t nip_mem_set_min_length( nip_mem_handle_t block_id, nip_mem_size_t min_length )
00560 {
00561 nip_mem_block_t *block;
00562 nip_mem_size_t block_user_size;
00563
00564
00565 block = nip_mem_locate_block( block_id );
00566 if ( block != NULL )
00567 {
00568
00569
00570
00571
00572
00573 block_user_size = block->res_length - sizeof( nip_mem_block_t );
00574 if ( min_length > block_user_size )
00575 {
00576 block = nip_mem_defrag( min_length - block_user_size, block->id, block->id );
00577 if ( block == NULL )
00578 return nip_error;
00579 }
00580 block->min_length = min_length;
00581 } else
00582 return NIP_E_INVALID_BLOCK;
00583
00584 return NIP_E_OK;
00585
00586 }
00587
00588
00589
00590
00591
00592
00593
00594
00595
00596
00597
00598
00599
00600
00601
00602 nip_mem_handle_t nip_mem_alloc( nip_mem_size_t size, nip_mem_size_t min_length, nip_mem_flags_t flags, nip_mem_size_t *res_length)
00603 {
00604 nip_mem_block_t *block;
00605 nip_mem_block_t *next_block;
00606 nip_mem_block_t *new_block;
00607 nip_mem_size_t new_size;
00608 nip_mem_size_t block_user_size;
00609 uint8_t i;
00610 nip_mem_handle_t new_block_id;
00611 nip_mem_handle_t at_block_id;
00612 nip_error_t result = NIP_E_OUT_OF_MEMORY;
00613
00614
00615
00616
00617
00618
00619
00620
00621
00622 for ( i = 0; i < 4; i++ )
00623 {
00624 at_block_id = 0;
00625
00626 for ( block = ( nip_mem_block_t *) nip_mem_pool; block != NULL; block = next_block)
00627 {
00628 if ( block->id > NIP_MEM_NULL )
00629 at_block_id = block->id;
00630
00631 #if NIP_MEM_DEBUG == 1
00632 if ( block->res_length == 0 )
00633 {
00634
00635 return NIP_MEM_NULL;
00636 }
00637 #endif
00638 calc_user_size:
00639 block_user_size = block->res_length - sizeof( nip_mem_block_t );
00640
00641
00642 next_block = (nip_mem_block_t*)&(((uint8_t*)block)[block->res_length]);
00643 if ( (uint8_t*)next_block == &nip_mem_pool[ NIP_MEM_DYNAMIC_SIZE ] )
00644 next_block = NULL;
00645 #if NIP_MEM_DEBUG == 1
00646 if ( next_block != NULL && ( next_block->res_length == 0
00647 || &((uint8_t*)next_block)[next_block->res_length]>&nip_mem_pool[ NIP_MEM_DYNAMIC_SIZE ]))
00648 {
00649
00650 return NIP_MEM_NULL;
00651 }
00652 #endif
00653
00654 if ( !NIP_MEM_BLOCK_USED( block ) && next_block != NULL && !NIP_MEM_BLOCK_USED( next_block ))
00655 {
00656 block->res_length += next_block->res_length;
00657 goto calc_user_size;
00658 }
00659
00660 if ( i==0 && !NIP_MEM_BLOCK_USED( block ) && block_user_size >= size )
00661 {
00662
00663
00664
00665 if ( block_user_size >= size + sizeof( nip_mem_block_t ) )
00666 {
00667
00668
00669 if (( next_block != NULL && (next_block->id > block->id+1 ))
00670 ||( next_block == NULL && block->id+1 < NIP_MEM_MAX_BLOCKS ))
00671 {
00672 next_block = nip_mem_split( block, size + sizeof( nip_mem_block_t ), block->id+1 );
00673 #if NIP_MEM_DEBUG == 1
00674 if ( block->res_length == 0 || next_block->res_length == 0
00675 || &((uint8_t*)next_block)[next_block->res_length]>&nip_mem_pool[ NIP_MEM_DYNAMIC_SIZE ])
00676 {
00677
00678 return NIP_MEM_NULL;
00679 }
00680 #endif
00681
00682 }
00683
00684
00685
00686
00687
00688 }
00689
00690
00691 result = NIP_E_OK;
00692
00693 i = 10;
00694 break;
00695 }
00696 else
00697 if (( i==1 && !NIP_MEM_BLOCK_USED( block ) && block->id > NIP_MEM_NULL && block_user_size >= min_length && !NIP_MEM_BLOCK_LOCKED( block ) )
00698 || ( i==2 && !NIP_MEM_BLOCK_USED( block ) && block->id > NIP_MEM_NULL && !NIP_MEM_BLOCK_LOCKED( block ))
00699 || ( i==3 && next_block != NULL && at_block_id+1 < next_block->id)
00700 || ( i==3 && next_block == NULL && at_block_id+1 < NIP_MEM_MAX_BLOCKS ))
00701 {
00702 if ( i>2 && block == ( nip_mem_block_t *) nip_mem_pool && block->id > 1)
00703 {
00704
00705 new_size = size;
00706 new_block_id = 1;
00707 at_block_id = 0;
00708 }
00709 if ( i>2 )
00710 {
00711
00712 new_size = size;
00713 new_block_id = block->id+1;
00714 }
00715 else
00716 {
00717
00718 new_size = size - block_user_size;
00719 new_block_id = block->id;
00720 }
00721
00722 new_block = nip_mem_defrag( new_size, block->id, new_block_id);
00723
00724
00725 if ( new_block == NULL && nip_error == NIP_E_OUT_OF_MEMORY )
00726 {
00727 new_size -= size - min_length;
00728 new_block = nip_mem_defrag( new_size, block->id, new_block_id);
00729 }
00730
00731 if ( new_block != NULL )
00732 {
00733 block = new_block;
00734
00735 result = NIP_E_OK;
00736 i = 10;
00737 break;
00738 }
00739 }
00740 }
00741 }
00742
00743 nip_error = result;
00744
00745 if ( result == NIP_E_OK )
00746 {
00747 block->min_length = min_length;
00748 block->flags = flags | NIP_MEM_FLG_USED;
00749 if ( res_length != NULL )
00750 *res_length = block->res_length - sizeof( nip_mem_block_t );
00751 return block->id;
00752 }
00753
00754
00755 return NIP_MEM_NULL;
00756
00757 }
00758
00759
00760
00761
00762
00763
00764
00765
00766
00767
00768
00769
00770
00771
00772
00773
00774
00775 nip_error_t nip_mem_write( nip_mem_handle_t block_id, void *buf, nip_mem_size_t size )
00776 {
00777 nip_mem_block_t *block;
00778 nip_mem_size_t unused_bytes;
00779
00780
00781 block = nip_mem_locate_block( block_id );
00782 if ( block != NULL )
00783 {
00784 unused_bytes = block->res_length - block->used_length - sizeof( nip_mem_block_t );
00785
00786 if ( size > unused_bytes )
00787 {
00788 if ( (block = nip_mem_defrag( size - unused_bytes, block_id, block_id )) == NULL )
00789 {
00790 return NIP_E_OUT_OF_MEMORY;
00791 }
00792 }
00793
00794 if ( buf != NULL )
00795 {
00796
00797 nip_memcpy(
00798 &((uint8_t*)block)[ sizeof( nip_mem_block_t ) + block->used_length ],
00799 buf,
00800 size);
00801 }
00802 else
00803 {
00804
00805 nip_memset(
00806 &((uint8_t*)block)[ sizeof( nip_mem_block_t ) + block->used_length ],
00807 0,
00808 size);
00809 }
00810 block->used_length += size;
00811 return NIP_E_OK;
00812 }
00813 return NIP_E_INVALID_BLOCK;
00814 }
00815
00816
00817
00818 nip_error_t nip_mem_cut( nip_mem_ptr_t *location, nip_mem_size_t len )
00819 {
00820 uint8_t *l;
00821 nip_mem_size_t bufsize = nip_mem_buf_used( location->id);
00822
00823 if ( len + (nip_mem_size_t)location->ptr > bufsize )
00824 return NIP_E_PARAM_FAILED;
00825
00826 l = nip_mem_ptr( location );
00827 if ( l == NULL ) return nip_error;
00828
00829 nip_memmove( l, l+len, bufsize-len-(nip_mem_size_t)location->ptr );
00830
00831 nip_mem_release_block( location->id );
00832
00833
00834 nip_mem_set_used( location->id, bufsize - len );
00835
00836 return NIP_E_OK;
00837 }
00838
00839
00840
00841
00842
00843
00844
00845
00846
00847
00848
00849
00850
00851
00852
00853
00854
00855
00856
00857 nip_error_t nip_mem_insert( nip_mem_ptr_t *dst, nip_mem_ptr_t *src, nip_mem_size_t len )
00858 {
00859 nip_error_t res;
00860 nip_mem_size_t dst_size;
00861 uint8_t *dst_buf, *src_buf;
00862
00863 if ( dst == NULL || src == NULL )
00864 return NIP_E_PARAM_FAILED;
00865
00866 dst_size = nip_mem_buf_used( dst->id );
00867
00868 if ( (nip_mem_size_t)dst->ptr > dst_size )
00869 dst->ptr = (void*)dst_size;
00870
00871
00872 res = nip_mem_write( dst->id, NULL, len );
00873 if ( res != NIP_E_OK )
00874 goto quit;
00875
00876
00877 src_buf = nip_mem_ptr( src );
00878
00879 if ( ( dst_buf = nip_mem_ptr( dst ) ) == NULL )
00880 {
00881 res = nip_error;
00882 goto release_src;
00883 }
00884
00885
00886 nip_memmove( dst_buf+len, dst_buf, dst_size - (nip_mem_size_t)dst->ptr );
00887
00888
00889 if ( src_buf != NULL )
00890 nip_memcpy( dst_buf, src_buf, len );
00891 else
00892 nip_memset( dst_buf, 0x00, len );
00893
00894
00895 dst->ptr += len;
00896
00897 nip_mem_release_ptr( dst );
00898
00899 release_src:
00900 nip_mem_release_ptr( src );
00901
00902 quit:
00903 return res;
00904 }
00905
00906
00907
00908
00909
00910
00911
00912
00913
00914
00915
00916
00917 nip_mem_size_t nip_mem_read_at_pos( nip_mem_handle_t block_id, uint8_t *buf,
00918 nip_mem_size_t size, nip_mem_size_t pos)
00919 {
00920 nip_mem_block_t *block;
00921 nip_mem_size_t data_length;
00922
00923
00924 block = nip_mem_locate_block( block_id );
00925 if ( block == NULL )
00926 {
00927 nip_error = NIP_E_INVALID_BLOCK;
00928 return 0;
00929 }
00930
00931 data_length = block->used_length;
00932 if ( pos >= data_length )
00933 {
00934 nip_error = NIP_E_EOF;
00935 return 0;
00936 }
00937
00938
00939 if ( pos + size > data_length )
00940 size = data_length - pos;
00941
00942
00943 if ( buf != NULL )
00944 nip_memmove( buf, &((uint8_t*)block)[ sizeof( nip_mem_block_t ) + pos ], size );
00945
00946 return size;
00947 }
00948
00949
00950
00951
00952
00953
00954
00955
00956
00957
00958
00959
00960
00961
00962
00963
00964
00965
00966
00967 nip_mem_size_t nip_mem_read( nip_mem_handle_t block_id, uint8_t *buf, nip_mem_size_t size )
00968 {
00969 nip_mem_block_t *block;
00970 nip_mem_size_t bytes_copied;
00971
00972
00973 block = nip_mem_locate_block( block_id );
00974 if ( block == NULL )
00975 {
00976 nip_error = NIP_E_INVALID_BLOCK;
00977 return 0;
00978 }
00979
00980 bytes_copied = nip_mem_read_at_pos( block_id, buf, size, 0 );
00981
00982 if ( bytes_copied > 0 )
00983 {
00984
00985 block->used_length -= bytes_copied;
00986 nip_memmove(
00987 &((uint8_t*)block)[ sizeof( nip_mem_block_t ) ],
00988 &((uint8_t*)block)[ sizeof( nip_mem_block_t ) + bytes_copied],
00989 block->used_length
00990 );
00991 }
00992
00993 return bytes_copied;
00994 }
00995
00996
00997
00998
00999
01000
01001
01002
01003
01004
01005
01006 nip_mem_size_t nip_mem_move( nip_mem_handle_t dst_block, nip_mem_handle_t src_block, nip_mem_size_t size )
01007 {
01008 nip_mem_size_t moved_size = 0;
01009 nip_mem_size_t available_size = size;
01010 nip_mem_block_t *block;
01011
01012 do
01013 {
01014 if ( available_size > size )
01015 available_size = size;
01016
01017
01018 nip_error = nip_mem_write( dst_block, NULL, available_size );
01019
01020 if ( nip_error == NIP_E_OUT_OF_MEMORY )
01021 {
01022 if ( available_size == 1 )
01023 {
01024
01025 break;
01026 }
01027
01028
01029 available_size /= 2;
01030 }
01031 else
01032 if ( nip_error == NIP_E_OK )
01033 {
01034
01035 block = nip_mem_locate_block( dst_block );
01036 if ( block == NULL ) break;
01037
01038
01039 nip_mem_read( src_block, &((uint8_t*)block)[sizeof(nip_mem_block_t)+block->used_length-available_size], available_size );
01040
01041 moved_size += available_size;
01042 size -= available_size;
01043 }
01044 else
01045 {
01046
01047 break;
01048 }
01049 } while ( size > 0 );
01050
01051 return moved_size;
01052 }
01053
01054
01055
01056
01057
01058
01059
01060
01061
01062
01063
01064
01065
01066
01067
01068
01069
01070
01071
01072
01073 void *nip_mem_obtain_ptr( nip_mem_handle_t block_id )
01074 {
01075 nip_mem_block_t *block;
01076
01077
01078 block = nip_mem_locate_block( block_id );
01079 if ( block == NULL || !NIP_MEM_BLOCK_USED( block ) )
01080 {
01081 nip_error = NIP_E_INVALID_BLOCK;
01082 return NULL;
01083 }
01084
01085 if ( NIP_MEM_BLOCK_LOCKED( block ) )
01086 {
01087 nip_error = NIP_E_BLOCK_LOCKED;
01088 return NULL;
01089 }
01090
01091 block->flags |= NIP_MEM_FLG_LOCKED;
01092
01093 return ++block;
01094 }
01095
01096
01097
01098
01099 void nip_mem_release_block( nip_mem_handle_t block_id )
01100 {
01101 nip_mem_block_t *block;
01102
01103
01104 block = nip_mem_locate_block( block_id );
01105 if ( block == NULL || !NIP_MEM_BLOCK_LOCKED( block ) )
01106 {
01107 return;
01108 }
01109
01110 block->flags &= ~NIP_MEM_FLG_LOCKED;
01111 }
01112
01113
01114
01115
01116
01117
01118
01119
01120
01121 void *nip_mem_ptr( nip_mem_ptr_t *p )
01122 {
01123 uint8_t *res;
01124
01125 if ( p == NULL )
01126 return NULL;
01127
01128
01129 if ( p->id == NIP_MEM_NULL )
01130 return p->ptr;
01131
01132
01133 if ( (nip_mem_size_t)p->ptr >= nip_mem_buf_used( p->id ) )
01134 return NULL;
01135
01136 res = nip_mem_obtain_ptr( p->id );
01137 if ( res != NULL )
01138 res = res + (nip_mem_size_t)p->ptr;
01139
01140 return res;
01141 }
01142
01143
01144
01145
01146 void nip_mem_release_ptr( nip_mem_ptr_t *p )
01147 {
01148 if ( p != NULL )
01149 {
01150 nip_mem_release_block( p->id );
01151 }
01152 }
01153
01154
01155
01156
01157
01158 nip_mem_size_t nip_mem_buf_used( nip_mem_handle_t block_id )
01159 {
01160 nip_mem_block_t *block;
01161
01162
01163 block = nip_mem_locate_block( block_id );
01164
01165
01166
01167 if ( block == NULL )
01168 {
01169 nip_error = NIP_E_INVALID_BLOCK;
01170 return 0;
01171 }
01172
01173 return block->used_length;
01174 }
01175
01176
01177
01178
01179
01180
01181 void nip_mem_set_used( nip_mem_handle_t block_id, nip_mem_size_t new_size )
01182 {
01183 nip_mem_block_t *block;
01184
01185
01186 block = nip_mem_locate_block( block_id );
01187 if ( block == NULL )
01188 {
01189 nip_error = NIP_E_INVALID_BLOCK;
01190 }
01191 else
01192 block->used_length = new_size;
01193 }
01194
01195 #endif