Author Archives: manoelramon

How to download quickly the kernel source code used on your Ubuntu

Posted on by
114

I am really sorry if this post is so shot and newbie but I will use these instructions on my next posts.

Try typing:

#> sudo -i

#> cd /usr/src

#> apt-get source linux-image-$(uname -r)

If fails complaining about dpkg-source, you need the debian package development tools.

Install it doing:

#> apt-get install dpkg-dev

and try to download the source again.

You can get using git. If you prefer this method check this page.

I am using root (sudo -i) on this example because next post I will compile some code that requires the right permission to run the example codes.

Debugging tombstones with ndk-stack and addr2line

Posted on by
138

android

I really like to work with several components in a system including linux kernel or keep my emotions on userspace.

If you work with android and your are a real engineer, it is very difficult to resist the native support using Android NDK. If your software requires performance using graphic API like in OpenGL or if you need to access some specific information provided by some native library, the NDK fits for you.

However, bugs in native side sometimes takes time and usually it is not an easy and fast task. If you have the device and an easy way to reproduce the issue, it is ok but suppose you need to collect logs from remote users and the scenario is very difficult to reproduce. Some cases the users even see the crash visually but the system contains the logs blocking the approval of your software that must be completed to some costumer.. at this point the program/project managers team are “talking” in your ears… “fix it!”.

Working with Android, every time a process that runs on native side crashes, we have some small pieces of your stack in files called tombstones.

The tombstones are located at /data/tombstones as isolated files (one files represents one crash) or you can see them in your logcat Take a look in the adb shell:

root@android:/ # find . |grep tombs

./data/tombstones
./data/tombstones/tombstone_00
./data/tombstones/tombstone_01
root@android:/ #

The tombstone inform you about:

  1. Build fingerprint
  2. Crashed process and PIDs
  3. Terminated signal and fault address
  4. CPU registers
  5. Call stack
  6. Stack content of each call

I will not post a full tombstone here. Check the /data on your device and you will observe the 7 sessions mentioned above . Let’s go straight to the point.. how to debug the stack in tombstones files!

Continue reading →

Android Services: Recommendations when using AIDL for continuous service and low current drain impact

Posted on by
116

Last month a lot things happened.. I lost my dad, moved to another location .. thus, this blog was not the priority but was not forgotten.

This post is related to some issues I have observed in some Dalvik implementation and some recommendations is you want to create a service that must remains running all the time even after a device power on/off or reset.

Suppose you need to create a “light” service that must be:

1) starts when every time your devices boots.

2) contains very nice parcelable objects using aidl syntax sharing them thru IPC

3) is used to monitor something every X minutes but cannot impact the current drain.

4) the service must use the “uptime”, I mean, must reports “how long” is running

5) must be able to receive interruptions and reports them

A good application of this service could be an alarm central unit for your car. You could create this project using your old Android phone and transforming your old phone and hidden it in your car. You can also connect this old phone disassembling a 12V charging and connecting in some spot using the terminals of your battery.

So, let’s go to some mistakes.. see the list below:

Continue reading →

POSIX Threads and Joins – Parallel Programming – PART 1

Posted on by
129

During a long time we were “blessed” with computers that had only single CPU. The single CPU usually had a mediocre single core and thread. All software developed on that time executed sequential processing.

However, multi-cores and multi-threads processors were introduced in the market but if you do not develop your software trying to explore the hardware advantages your software might have the same performance if running in a single cpu machine.

You need to think also if you software will run in a computer isolated or if your software will be able to run in multiple computers sharing a common network and organize different tasks to resolve a common problem.

Today, I will write this post for my own reference using the POSIX threads and how to have the best usage of joins and mutex implementation. I am running in a ubuntu 10.04 but if you are running Windows you can use these examples installing the POSIX win32 compatibility module or installing Cygwin to simulate a linux shell.

Code compilation

All codes on this post were compiled using gcc and invoking the POSIX libraries thru command like under ubuntu 10.04. For example you can use:

gcc -pthread <my source code.c>

Threads

The first code is related to a model where we do not share the same memory space and there is no policy regarding the thread priorities or resources access management (although the threads runs in the same process sharing the same memory space this first example to resource are conflicted).

It is a simple code that creates 3 threads, passes arguments to them using strings and integers and then they are terminated.

Take a look in the code below:

Continue reading →

I love a Duck! Why DuckDuckGo search engine is better than Google ?

Posted on by
135

I am kind of person – or alien as they call me in USA even being from Brazil not Mars :), that usually try different ways to improve how I study or work. I am using a new search engine and I am really loving it! Click in DuckDuckGo.com and try yourself.

Why DuckDuckGo ?

The quality of results and how you can filter are much more better than google search engine. Google already recognized them as a real competitor and looks like Mr Larry Page not dared to say “really bad job” as he did with new facebook graphic search.

Done based in github, perl5 and other open softwares, I will tell you why this search really rocks!

What they do ?

  1. do not track you !! it means privacy! Your personal information is safe!
  2. do not use bubble-filter !! Oh yeah this really makes different because I can have different type of results not based what the system “think” compatible with my profile
  3. They have a feature called !bang. Bangs are very cool.. if you wanna have all searches in a specific site you only add “!” following the site.. for example if you type in the search box “stamps!ebay” the search goes directly to ebay showing the search you did!!! The same can be done with facebook, amazon, and multiples sites.. some sites you have option to use bang with few words, for example, you can use “asus!a” to search in amazon.
  4. When you make a search if have a list with results and in front of each link there is a icon related to the site you searched. If you click in the icon instead the link, the engine re-searches and give you more results related to that site!
  5. There is not “NEXT PAGE”.. Only scroll and the new searches will be automatically loaded

Newton Raphson C++ class for float division and other functions

Posted on by
5

Some months ago when I was searching for a job, a company asked to write a class to evaluate float divisions and find srq() of a number using Microsoft Visual C++. But the challenge was in create a class to perform this operations avoiding the division operator “/”.

I decided to use a old methodology I learnt when I was in college, more specifically in the computer methods. The name of method is Newton Raphson.

About the Newton-Raphson’s Method

The idea is very simple… given a function you guess a initial x0. Then you evaluate the tangent function on that point using derivative function. You will have x1… then you do the same with x1, and even so… Continue reading →

Booting…

Posted on by
4

My name is Manoel Ramon and I am addicted in software programming… this first post is a testimony about myself…

I was something around 10 years old when my cousin broke up with her boyfriend and he decided to try to reconnect with her thru me… well.. bad mistake 🙂
He showed up in my home with a personal computer.. it was a TK85 with amazing ROM 8Kb and RAM 16Kb based in Z80 processor… I could see loading programs using a regular tape (cassette) using a tape player and some wires..

After some minutes, the computer loaded a game in my TV !!! That was really cool!!! So, he left the computer with me and I started to read a BASIC MANUAL.

This was the first problem of my life:

10 PRINT "MANOEL RAMON"
20 GOTO 10

Then I typed “RUN” following ENTER

After this… I was totally addicted.. See the machine doing something that I created was fantastic.. Then, every morning I woke up at 7:00AM to watch a TV series called “Bits & Bytes” in the TV Cultura Brasil. This was a canadian TV series teaching people what is a personal computer, a processor, a interpreter, a computer program, how the memory works, etc.

After couple years I bough a revolutionary micro-computer called HOTBIT MSX Continue reading →