Android 8 native crash at native library -


since rollout of android 8 oreo, our app has been consistently crashing in different places. play store crash reports show native crashes. occuring 1 seems @ native library.

the frequent device crashes google pixel , pixel xl have shown few.

i ll post crash log below. m struggling find causes crash.

any appreciated. 

*** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** build fingerprint: 'google/sailfish/sailfish:8.0.0/opr6.170623.012/4283428:user/release-keys' revision: '0' abi: 'arm' pid: 9857, tid: 9857, name: stampphoto  >>> com.******.***** <<< signal 11 (sigsegv), code 1 (segv_maperr), fault addr 0x0 cause: null pointer dereference     r0 ea26cec8  r1 00000001  r2 0000007f  r3 00000002     r4 000030ca  r5 00000000  r6 ff7ed650  r7 ff7ed628     r8 13b40240  r9 00000043  sl ea26b470  fp ff7ed664     ip ea0985d1  sp ff7ed5a8  lr ea168b15  pc ea168b1e  cpsr 600b0030 backtrace:     #00 pc 00332b1e  /system/lib/libart.so (_zn3art35invokevirtualorinterfacewithvarargserkns_33scopedobjectaccessalreadyrunnableep8_jobjectp10_jmethodidst9__va_list+89)     #01 pc 00262785  /system/lib/libart.so (_zn3art3jni17callobjectmethodvep7_jnienvp8_jobjectp10_jmethodidst9__va_list+436)     #02 pc 0006398b  /data/app/com.a.a-h8ba8dmi-3kj2bp4gkgvoa==/base.apk (offset 0x3c4000)     #03 pc 0006468b  /data/app/com.a.a-h8ba8dmi-3kj2bp4gkgvoa==/base.apk (offset 0x3c4000)     #04 pc 0006fddf  /data/app/com.a.a-h8ba8dmi-3kj2bp4gkgvoa==/oat/arm/base.odex (offset 0x45000)

thanks in advance...


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more