void UART4_IRQHandler(void) //涓插彛1涓柇鏈嶅姟绋嬪簭
{
// LED0=0;
{
u8 Res;
if(USART_GetITStatus(UART4, USART_IT_RXNE) != RESET) //鎺ユ敹涓柇(鎺ユ敹鍒扮殑鏁版嵁蹇呴』鏄?x0d 0x0a缁撳熬)
{
Res =USART_ReceiveData(UART4);//(USART1->DR); //璇诲彇鎺ユ敹鍒扮殑鏁版嵁
if((UART4_RX_STA&0x8000)==0)//接收未完成
{
if(UART4_RX_STA&0x4000)//接收到了0x0d
{
if(Res!=0x0a)
UART4_RX_STA=0;//接收错误,重新开始
else{
UART4_RX_STA|=0x8000; //接收完成了
UART4_RX_BUF[UART4_RX_STA&0X3FFF]=Res;
flag_change();
}
}
else //还没收到0X0D
{
if(Res==0x0d)
UART4_RX_STA|=0x4000;
else
{
UART4_RX_BUF[UART4_RX_STA&0X3FFF]=Res ;
UART4_RX_STA++;
if(UART4_RX_STA>(USART_REC_LEN-1))
UART4_RX_STA=0;//接收数据错误,重新开始接收
}
}
}
}
}
#ifdef OS_TICKS_PER_SEC //如果时钟节拍数定义了,说明要使用ucosII了.
OSIntExit();
#endif
}
static void keypress_process(int keypress)
{
switch (keypress) {
case KEYCODE_DOWN: case 'e': case 'j': case 0x0d:
buffer_down(1);
break;
case KEYCODE_UP: case 'y': case 'k':
buffer_up(1);
break;
case KEYCODE_PAGEDOWN: case ' ': case 'z': case 'f':
buffer_down(max_displayed_line + 1);
break;
case KEYCODE_PAGEUP: case 'w': case 'b':
buffer_up(max_displayed_line + 1);
break;
case 'd':
buffer_down((max_displayed_line + 1) / 2);
break;
case 'u':
buffer_up((max_displayed_line + 1) / 2);
break;
case KEYCODE_HOME: case 'g': case 'p': case '<': case '%':
buffer_line(0);
break;
case KEYCODE_END: case 'G': case '>':
cur_fline = MAXLINES;
read_lines();
buffer_line(cur_fline);
break;
case 'q': case 'Q':
less_exit(EXIT_SUCCESS);
break;
#if ENABLE_FEATURE_LESS_MARKS
case 'm':
add_mark();
buffer_print();
break;
case '\'':
goto_mark();
buffer_print();
break;
#endif
case 'r': case 'R':
buffer_print();
break;
/*case 'R':
full_repaint();
break;*/
case 's':
save_input_to_file();
break;
case 'E':
examine_file();
break;
#if ENABLE_FEATURE_LESS_FLAGS
case '=':
m_status_print();
break;
#endif
#if ENABLE_FEATURE_LESS_REGEXP
case '/':
option_mask32 &= ~LESS_STATE_MATCH_BACKWARDS;
regex_process();
break;
case 'n':
goto_match(match_pos + 1);
break;
case 'N':
goto_match(match_pos - 1);
break;
case '?':
option_mask32 |= LESS_STATE_MATCH_BACKWARDS;
regex_process();
break;
#endif
#if ENABLE_FEATURE_LESS_DASHCMD
case '-':
flag_change();
buffer_print();
break;
#ifdef BLOAT
case '_':
show_flag_status();
break;
#endif
#endif
#if ENABLE_FEATURE_LESS_BRACKETS
case '{': case '(': case '[':
match_right_bracket(keypress);
break;
case '}': case ')': case ']':
match_left_bracket(keypress);
break;
#endif
case ':':
colon_process();
break;
}
if (isdigit(keypress))
number_process(keypress);
}
HeapWord* GenCollectorPolicy::satisfy_failed_allocation(size_t size,
bool is_tlab) {
GenCollectedHeap *gch = GenCollectedHeap::heap();
GCCauseSetter x(gch, GCCause::_allocation_failure);
HeapWord* result = NULL;
assert(size != 0, "Precondition violated");
if (GC_locker::is_active_and_needs_gc()) {
// GC locker is active; instead of a collection we will attempt
// to expand the heap, if there's room for expansion.
if (!gch->is_maximal_no_gc()) {
result = expand_heap_and_allocate(size, is_tlab);
}
return result; // could be null if we are out of space
} else if (!gch->incremental_collection_will_fail(false /* don't consult_young */)) {
// Do an incremental collection.
gch->do_collection(false /* full */,
false /* clear_all_soft_refs */,
size /* size */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */);
} else {
if (Verbose && PrintGCDetails) {
gclog_or_tty->print(" :: Trying full because partial may fail :: ");
}
// Try a full collection; see delta for bug id 6266275
// for the original code and why this has been simplified
// with from-space allocation criteria modified and
// such allocation moved out of the safepoint path.
gch->do_collection(true /* full */,
false /* clear_all_soft_refs */,
size /* size */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */);
}
result = gch->attempt_allocation(size, is_tlab, false /*first_only*/);
if (result != NULL) {
assert(gch->is_in_reserved(result), "result not in heap");
return result;
}
// OK, collection failed, try expansion.
result = expand_heap_and_allocate(size, is_tlab);
if (result != NULL) {
return result;
}
// If we reach this point, we're really out of memory. Try every trick
// we can to reclaim memory. Force collection of soft references. Force
// a complete compaction of the heap. Any additional methods for finding
// free memory should be here, especially if they are expensive. If this
// attempt fails, an OOM exception will be thrown.
{
UIntFlagSetting flag_change(MarkSweepAlwaysCompactCount, 1); // Make sure the heap is fully compacted
gch->do_collection(true /* full */,
true /* clear_all_soft_refs */,
size /* size */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */);
}
result = gch->attempt_allocation(size, is_tlab, false /* first_only */);
if (result != NULL) {
assert(gch->is_in_reserved(result), "result not in heap");
return result;
}
assert(!should_clear_all_soft_refs(),
"Flag should have been handled and cleared prior to this point");
// What else? We might try synchronous finalization later. If the total
// space available is large enough for the allocation, then a more
// complete compaction phase than we've tried so far might be
// appropriate.
return NULL;
}
HeapWord* TwoGenerationCollectorPolicy::satisfy_failed_allocation(size_t size,
bool is_large_noref,
bool is_tlab,
bool* notify_ref_lock) {
GenCollectedHeap *gch = GenCollectedHeap::heap();
GCCauseSetter x(gch, GCCause::_allocation_failure);
HeapWord* result = NULL;
// The gc_prologues have not executed yet. The value
// for incremental_collection_will_fail() is the remanent
// of the last collection.
if (!gch->incremental_collection_will_fail()) {
// Do an incremental collection.
gch->do_collection(false /* full */,
false /* clear_all_soft_refs */,
size /* size */,
is_large_noref /* is_large_noref */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */,
notify_ref_lock /* notify_ref_lock */);
} else {
// The incremental_collection_will_fail flag is set if the
// next incremental collection will not succeed (e.g., the
// DefNewGeneration didn't think it had space to promote all
// its objects). However, that last incremental collection
// continued, allowing all older generations to collect (and
// perhaps change the state of the flag).
//
// If we reach here, we know that an incremental collection of
// all generations left us in the state where incremental collections
// will fail, so we just try allocating the requested space.
// If the allocation fails everywhere, force a full collection.
// We're probably very close to being out of memory, so forcing many
// collections now probably won't help.
if (PrintGC && Verbose) {
gclog_or_tty->print_cr("TwoGenerationCollectorPolicy::satisfy_failed_allocation:"
" attempting allocation anywhere before full collection");
}
result = gch->attempt_allocation(size,
is_large_noref,
is_tlab,
false /* first_only */);
if (result != NULL) {
assert(gch->is_in(result), "result not in heap");
return result;
}
// Allocation request hasn't yet been met; try a full collection.
gch->do_collection(true /* full */,
false /* clear_all_soft_refs */,
size /* size */,
is_large_noref /* is_large_noref */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */,
notify_ref_lock /* notify_ref_lock */);
}
result = gch->attempt_allocation(size, is_large_noref, is_tlab, false /*first_only*/);
if (result != NULL) {
assert(gch->is_in(result), "result not in heap");
return result;
}
// OK, collection failed, try expansion.
for (int i = number_of_generations() - 1 ; i>= 0; i--) {
Generation *gen = gch->get_gen(i);
if (gen->should_allocate(size, is_large_noref, is_tlab)) {
result = gen->expand_and_allocate(size, is_large_noref, is_tlab);
if (result != NULL) {
assert(gch->is_in(result), "result not in heap");
return result;
}
}
}
// If we reach this point, we're really out of memory. Try every trick
// we can to reclaim memory. Force collection of soft references. Force
// a complete compaction of the heap. Any additional methods for finding
// free memory should be here, especially if they are expensive. If this
// attempt fails, an OOM exception will be thrown.
{
IntFlagSetting flag_change(MarkSweepAlwaysCompactCount, 1); // Make sure the heap is fully compacted
gch->do_collection(true /* full */,
true /* clear_all_soft_refs */,
size /* size */,
is_large_noref /* is_large_noref */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */,
notify_ref_lock /* notify_ref_lock */);
}
result = gch->attempt_allocation(size, is_large_noref, is_tlab, false /* first_only */);
if (result != NULL) {
assert(gch->is_in(result), "result not in heap");
return result;
}
// What else? We might try synchronous finalization later. If the total
// space available is large enough for the allocation, then a more
// complete compaction phase than we've tried so far might be
// appropriate.
return NULL;
}
static void keypress_process(int keypress)
{
switch (keypress) {
case KEY_DOWN: case 'e': case 'j': case '\015':
buffer_down(1);
buffer_print();
break;
case KEY_UP: case 'y': case 'k':
buffer_up(1);
buffer_print();
break;
case PAGE_DOWN: case ' ': case 'z':
buffer_down(height - 1);
buffer_print();
break;
case PAGE_UP: case 'w': case 'b':
buffer_up(height - 1);
buffer_print();
break;
case 'd':
buffer_down((height - 1) / 2);
buffer_print();
break;
case 'u':
buffer_up((height - 1) / 2);
buffer_print();
break;
case 'g': case 'p': case '<': case '%':
buffer_line(0);
break;
case 'G': case '>':
buffer_line(num_flines - height + 2);
break;
case 'q': case 'Q':
tless_exit(0);
break;
#ifdef CONFIG_FEATURE_LESS_MARKS
case 'm':
add_mark();
buffer_print();
break;
case '\'':
goto_mark();
buffer_print();
break;
#endif
case 'r':
buffer_print();
break;
case 'R':
full_repaint();
break;
case 's':
if (inp_stdin)
save_input_to_file();
break;
case 'E':
examine_file();
break;
#ifdef CONFIG_FEATURE_LESS_FLAGS
case '=':
clear_line();
m_status_print();
break;
#endif
#ifdef CONFIG_FEATURE_LESS_REGEXP
case '/':
match_backwards = 0;
regex_process();
break;
case 'n':
goto_match(match_pos + 1);
break;
case 'N':
goto_match(match_pos - 1);
break;
case '?':
match_backwards = 1;
regex_process();
break;
#endif
#ifdef CONFIG_FEATURE_LESS_FLAGCS
case '-':
flag_change();
buffer_print();
break;
case '_':
show_flag_status();
break;
#endif
#ifdef CONFIG_FEATURE_LESS_BRACKETS
case '{': case '(': case '[':
match_right_bracket(keypress);
break;
case '}': case ')': case ']':
match_left_bracket(keypress);
break;
#endif
case ':':
colon_process();
break;
default:
break;
}
if (isdigit(keypress))
number_process(keypress);
}
/**
* 处理上层应用线程(Java级线程)的一次内存申请失败
* 1. Gc类型选择
* 1).如果Gc操作已被触发但还无法被执行,则放弃本次Gc操作
* 2).如果执行增量式安全,则执行一次MinorGc
* 3).只能执行一次Full Gc
* 2. 从年青代-老年代依次尝试分配内存块
* 3. 从老年代-年青代依次扩展内存容量尝试分配内存块
* 4. 执行一次彻底的Full Gc(清理所有的软引用)
* 5. 从年青代-老年代依次尝试分配内存块
*/
HeapWord* GenCollectorPolicy::satisfy_failed_allocation(size_t size,
bool is_tlab) {
GenCollectedHeap *gch = GenCollectedHeap::heap();
GCCauseSetter x(gch, GCCause::_allocation_failure);
HeapWord* result = NULL;
assert(size != 0, "Precondition violated");
if (GC_locker::is_active_and_needs_gc()) { //Gc操作已被触发但还无法被执行
if (!gch->is_maximal_no_gc()) { // 当前有内存代允许扩展内存容量,则试图通过扩展内存代的容量来分配内存块
result = expand_heap_and_allocate(size, is_tlab);
}
return result; // could be null if we are out of space
} else if (!gch->incremental_collection_will_fail(false /* don't consult_young */)) { //如果当前增量式可行,则只触发一个Minor Gc
//增量式GC
gch->do_collection(false /* full */,
false /* clear_all_soft_refs */,
size /* size */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */);
} else { //执行一次Full Gc
if (Verbose && PrintGCDetails) {
gclog_or_tty->print(" :: Trying full because partial may fail :: ");
}
// Try a full collection; see delta for bug id 6266275
// for the original code and why this has been simplified
// with from-space allocation criteria modified and
// such allocation moved out of the safepoint path.
gch->do_collection(true /* full */,
false /* clear_all_soft_refs */,
size /* size */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */);
}
//执行一次Gc之后，再次从内存堆的各个内存代中依次分配指定大小的内存块
result = gch->attempt_allocation(size, is_tlab, false /*first_only*/);
if (result != NULL) {
assert(gch->is_in_reserved(result), "result not in heap");
return result;
}
//执行一次Gc之后可能有剩余的空间来扩展各内存代的容量，
//所以再次尝试通过允许扩展内存代容量的方式来试图分配指定大小的内存块
result = expand_heap_and_allocate(size, is_tlab);
if (result != NULL) {
return result;
}
// If we reach this point, we're really out of memory. Try every trick
// we can to reclaim memory. Force collection of soft references. Force
// a complete compaction of the heap. Any additional methods for finding
// free memory should be here, especially if they are expensive. If this
// attempt fails, an OOM exception will be thrown.
{
IntFlagSetting flag_change(MarkSweepAlwaysCompactCount, 1); // Make sure the heap is fully compacted
//最后再进行一次彻底的Gc: 回收所有的内存代+清除软引用
gch->do_collection(true /* full */,
true /* clear_all_soft_refs */,
size /* size */,
is_tlab /* is_tlab */,
number_of_generations() - 1 /* max_level */);
}
//经过一次彻底的Gc之后，最后一次尝试依次从各内存代分配指定大小的内存块
result = gch->attempt_allocation(size, is_tlab, false /* first_only */);
if (result != NULL) {
assert(gch->is_in_reserved(result), "result not in heap");
return result;
}
assert(!should_clear_all_soft_refs(), "Flag should have been handled and cleared prior to this point");
// What else? We might try synchronous finalization later. If the total
// space available is large enough for the allocation, then a more
// complete compaction phase than we've tried so far might be
// appropriate.
return NULL;
}