February 2016 - kernelnewbies@kernelnewbies.org

can't read this
by Ruben Safir Feb. 22, 2016

Feb. 22, 2016

ASCII? --===============3901919624009551412== Content-Type: multipart/alternative; boundary="----=_Part_49324_945639701.1456072194657" ------=_Part_49324_945639701.1456072194657 Content-Type: text/plain; charset=GBK Content-Transfer-Encoding: base64 SGksCiAgV2hlbiAgcmVhZCB0aGUgc291cmNlIGNvZGUgb2YgbW1fdHlwZXMuaCwgaSBlbmNvdW50 ZXIgX2NvZGluZyBzdHlsZV8gY29kZSAsc3VjaCBsaWtlOgpodHRwOi8vbHhyLmZyZWUtZWxlY3Ry b25zLmNvbS9zb3VyY2UvaW5jbHVkZS9saW51eC9tbV90eXBlcy5oI0wzNDYgaW4gY29tbWVudHMu CldoeSBub3QgdHJ5IHRvIGZpeCBpdD8gQmVjYXVzZSBpdCBpcyB0cml2YWw/IApBY3R1YWxseSwg Y2hlY2twYXRjaC5wbCByZXBvcnRzIG1hbnkgZXJyb3JzIGFuZCB3YXJubmluZ3MgZm9yIGl0LgpP bmx5IGNhbiBpIGZpeCB0aGUgY29kaW5nIHN0eWxlIGlzc3VlIGluIHN0YWdpbmc/ClNvcnJ5IGZv ciB0aGUgbm9pc3kuIAoKCgoKLS0KQmVzdCBSZWdhcmRzCg== ------=_Part_49324_945639701.1456072194657 Content-Type: text/html; charset=GBK Content-Transfer-Encoding: base64 PGRpdiBzdHlsZT0ibGluZS1oZWlnaHQ6MS43O2NvbG9yOiMwMDAwMDA7Zm9udC1zaXplOjE0cHg7 Zm9udC1mYW1pbHk6QXJpYWwiPjxkaXY+SGksPC9kaXY+PGRpdj4mbmJzcDsgV2hlbiAmbmJzcDty ZWFkIHRoZSBzb3VyY2UgY29kZSBvZiBtbV90eXBlcy5oLCBpIGVuY291bnRlciBfY29kaW5nIHN0 eWxlXyBjb2RlICxzdWNoIGxpa2U6PC9kaXY+PGRpdj48YSBocmVmPSJodHRwOi8vbHhyLmZyZWUt ZWxlY3Ryb25zLmNvbS9zb3VyY2UvaW5jbHVkZS9saW51eC9tbV90eXBlcy5oI0wzNDYiIF9zcmM9 Imh0dHA6Ly9seHIuZnJlZS1lbGVjdHJvbnMuY29tL3NvdXJjZS9pbmNsdWRlL2xpbnV4L21tX3R5 cGVzLmgjTDM0NiIgc3R5bGU9ImxpbmUtaGVpZ2h0OiAxLjc7Ij5odHRwOi8vbHhyLmZyZWUtZWxl Y3Ryb25zLmNvbS9zb3VyY2UvaW5jbHVkZS9saW51eC9tbV90eXBlcy5oI0wzNDY8L2E+Jm5ic3A7 aW4gY29tbWVudHMuPC9kaXY+PGRpdj5XaHkgbm90IHRyeSB0byBmaXggaXQ/IEJlY2F1c2UgaXQg aXMgdHJpdmFsPyZuYnNwOzwvZGl2PjxkaXY+QWN0dWFsbHksIGNoZWNrcGF0Y2gucGwgcmVwb3J0 cyBtYW55IGVycm9ycyBhbmQgd2Fybm5pbmdzIGZvciBpdC48L2Rpdj48ZGl2Pk9ubHkgY2FuIGkg Zml4IHRoZSBjb2Rpbmcgc3R5bGUgaXNzdWUgaW4gc3RhZ2luZz88L2Rpdj48ZGl2PlNvcnJ5IGZv ciB0aGUgbm9pc3kuJm5ic3A7PC9kaXY+PGRpdj48YnI+PC9kaXY+PGRpdj48YnI+PC9kaXY+PGRp diBzdHlsZT0icG9zaXRpb246cmVsYXRpdmU7em9vbToxIj4tLTxicj5CZXN0IFJlZ2FyZHM8YnI+ PGRpdiBzdHlsZT0iY2xlYXI6Ym90aCI+PC9kaXY+PC9kaXY+PC9kaXY+ ------=_Part_49324_945639701.1456072194657-- --===============3901919624009551412== Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Disposition: inline _______________________________________________ Kernelnewbies mailing list Kernelnewbies(a)kernelnewbies.org http://lists.kernelnewbies.org/mailman/listinfo/kernelnewbies --===============3901919624009551412==-- -- So many immigrant groups have swept through our town that Brooklyn, like Atlantis, reaches mythological proportions in the mind of the world - RI Safir 1998 http://www.mrbrklyn.com DRM is THEFT - We are the STAKEHOLDERS - RI Safir 2002 http://www.nylxs.com - Leadership Development in Free Software http://www2.mrbrklyn.com/resources - Unpublished Archive http://www.coinhangout.com - coins! http://www.brooklyn-living.com Being so tracked is for FARM ANIMALS and and extermination camps, but incompatible with living as a free human being. -RI Safir 2013

4 3

call graph
by masoud hematpour Feb. 21, 2016

Feb. 21, 2016

Hello all, I need to create call graph of memory management. Is there any tool. I found "cflow" but the output is not good enough. Can anyone help me in preparing? or I should prepare manually. Thank you

3 4

Distributed Process Scheduling Algorithm
by Nitin Varyani Feb. 19, 2016

Feb. 19, 2016

Hi, I am given a task to design a distributed process scheduling algorithm. Current distributed OS are patch work over the linux kernels, that is, they are responsible for load balancing through process migration but the scheduling is taken care by the single machine linux kernels. My task is to make the scheduling algorithm itself as distributed. That is a scheduler itself makes a decision whether to migrate a task or to keep the task in the current system. I need some design aspects of how to achieve it. Another thing which I want to know is that whether this job is possible for a kernel newbie like me. Need urgent help. Nitin

8 17

Difference dma_alloc_coherent() in x86_32 and x86_64
by tochansky＠tochlab.net Feb. 19, 2016

Feb. 19, 2016

Hello! I have a driver for PCI device which uses CMA framework for allocating big coherent blocks of memory for DMA. Allocation looks like: typedef struct { struct list_head list; uint32_t size8; void *kaddr; dma_addr_t paddr; } dma_region_t; LIST_HEAD(region_list); ...... void* AllocDMA( size_t size ) { dma_region_t *new_region; new_region = kmalloc(sizeof(dma_region_t), GFP_KERNEL); new_region->size8 = size; new_region->kaddr = dma_alloc_coherent( NULL, size, &new_region->paddr, GFP_KERNEL | GFP_DMA32 ); list_add(&new_region->list, &region_list); printk("pcidev: cma_alloc paddr %pad kaddr %p size %d\n", &new_region->paddr, new_region->kaddr, new_region->size8); return new_region->kaddr; } It works fine on kernel 3.18.26 in 32bit mode. When I reconfigure same kernel to run in 64bit mode(enabling in 'menuconfig' option '64-bit kernel') and trying to use this driver with it allocation failed with message in dmesg: ... [ 1393.835535] fallback device: swiotlb buffer is full (sz: 8388608 bytes) [ 1393.835579] pcidev: cma_alloc paddr 0xffff880234861220 kaddr (null) size 8388608 ... My kernel command line is: swiotlb=16384 iommu=soft cma=256M Anyone can explain this strange behavior? -- D

1 0

Help about Ctrl-Z and Ctrl-Y(urgent)
by 慕冬亮 Feb. 19, 2016

Feb. 19, 2016

Hi everyone, Unix systems support a large number of special characters that receive special processing by the OS. One such character is the “suspend” character (ctrl-Z by default), that causes a SIGTSTP signal to be sent to the application process. The default action for the signal is to suspend execution of the process. The system responds to the suspend character (by sending the signal) as soon as possible after it is typed in. In older Unix systems there was another special character known as the “delayed suspend” character (ctrl-Y by default) that had the same effect as the suspend character, except that the signal is sent when the application process consumes the character, rather than right away. (That this feature is no longer supported is perhaps some indication of how useful it was ...) The suspend and the delayed-suspend characters have the effect, when they are processed, of deleting all characters currently waiting to be read by the user application that arrived before them. Explain, how both special characters are implemented? -- My best regards to you. No System Is Safe! mudongliang

2 2

Question regarding upstreaming patches written by multiple people and checkpatch
by Joseph Bisch Feb. 18, 2016

Feb. 18, 2016

Hi, I am trying to upstream a patch set that wasn't written by me. The original patch has a lot of warnings and errors reported by checkpatch. Someone else corrected some of those with another patch and I added on a third patch correcting the rest of the warnings and errors that I thought were appropriate to fix. When checkpatch is run on the file that the patches affect, the output looks okay to me, but when I run checkpatch on the patches themselves, the patches still have the same errors and warnings, because I made my changes in a separate patch. So is it okay to have checkpatch errors/warnings for individual patches as long as the patch series as a whole is reasonably checkpatch clean or should I be amending my changes to the original commit and squashing the other cleanup patch into the first patch, so that I am left with one patch that passes checkpatch? If I should be squashing the patches into a single patch, how do I handle the signed-off-by lines as each of the three patches is currently signed off by the respective author of the patch? Obviously I can sign off on the squashed patch for myself. Do I just send it to the mailing list with just my sign off and CC the authors, so that they can sign off on it? From what I've been told, it sounds like CC'ing the authors and having them reply with their sign off is the appropriate way to handle this, but I want to make sure before I start mailing out patches, and this isn't something that I have been able to find an answer to. Cheers, Joseph

2 2

Walk list of processes attached to a shared page
by W. Michael Petullo Feb. 18, 2016

Feb. 18, 2016

Is it possible to walk the processes already attached to a shared page in an implementation of security_shm_shmat()? I have a function: static int my_shm_shmat(struct shmid_kernel *shp, char __user *shmaddr, int shmflag) and I would like to find the processes already attached. It seems like rmap_walk() would help, but I cannot figure out how to get an appropriate struct page out of a struct shmid_kernel or unmapped address (i.e., shmaddr above). -- Mike :wq

1 0

Re: Process scheduling
by Nitin Varyani Feb. 17, 2016

Feb. 17, 2016

On Mon, Feb 15, 2016 at 6:06 PM, Nitin Varyani <varyani.nitin1(a)gmail.com> wrote: > Hi > I have studied LInux kernel CFS scheduling algorithm - the > vruntime, weights, nice value, etc. I am able to understand the code. > Actually the task given to me is really very huge. I am told to design a > distributed process scheduling algorithm. A very simple implementation of > it will be sufficient for me. Current distributed OS are patch work over > the linux kernels, that is, they are responsible for load balancing through > process migration but the scheduling is taken care by the single machine > linux kernels. My task is to make the scheduling algorithm itself as > distributed. That is a scheduler makes a decision whether to migrate a task > or to keep the task in the current system. I need some design aspects of > how to achieve it. Another thing which I want to know is that whether this > job is possible for a kernel newbie like me. > > On Sat, Feb 13, 2016 at 3:12 PM, Nitin Varyani <varyani.nitin1(a)gmail.com> > wrote: > >> thanks >> >> On Sat, Feb 13, 2016 at 2:19 PM, Henrik Austad <henrik(a)austad.us> wrote: >> >>> On Sat, Feb 13, 2016 at 11:42:57AM +0530, Nitin Varyani wrote: >>> > Hello, >>> >>> Hi Nitin, >>> >>> > I want to understand the flow of code of process scheduler of >>> > linux kernel. What I have understood is that >>> > The task marks itself as sleeping, >>> > puts itself on a wait queue, >>> > removes itself from the red-black tree of runnable, and >>> > calls schedule() to select a new process to execute. >>> > >>> > for Waking back up >>> > The task is set as runnable, >>> > removed from the wait queue, >>> > and added back to the red-black tree. >>> > >>> > Can I get the details of which function does what? in sched/core.c and >>> in >>> > sched/fair.c >>> > I am concerned only with fair scheduler. There are so many functions in >>> > these two files that I am totally confused. >>> >>> Then core.c and fair.c is the best bet. >>> >>> You could also pick up a copy of Linux kernel development (By Love), it >>> gives a nice introduction to the overall flow of .. well mostly >>> everything. >>> :) >>> >>> In kernel/sched/sched.h you have a struct called 'struct sched_class" >>> which >>> is a set of function-points. This is used by the core machinery to call >>> into scheduling-class specific code. At the bottom of fair.c, you see >>> said >>> struct being populated. >>> >>> Also, if you want to see what really happens, try enabling >>> function-tracing, but limit it to sched-functions only (and sched-events, >>> those are also useful to see what triggers things) >>> >>> mount -t debugfs nodev /sys/kernel/debug >>> cd /sys/kernel/debug/tracing >>> echo 0 > tracing_on >>> echo function > current_tracer >>> echo "sched*" > set_ftrace_filter >>> echo 1 > events/sched/enable >>> echo 1 > tracing_on >>> ... wait for a few secs >>> echo 0 > tracing_on >>> >>> cat trace > /tmp/trace.txt >>> >>> Now, look at trace.txt and correlate it to the scheduler code :) >>> >>> Good luck! >>> >>> -- >>> Henrik Austad >>> >> >> >

4 5

Patch Series
by Roger H Newell Feb. 17, 2016

Feb. 17, 2016

Hi all: I have a question about creating a patch series. I'm working in drivers/staging/wilc1000 fixing code style. If for example 2 errors are reported by checkpatch.pl error A and error B, it seems logical that I could fix all occurrences of error A as one patch and all occurrences of error B in a second patch. My question is, is it OK to fix all occurrences of error A across the files inside drivers/staging/wilc1000 as one patch and all occurrences of error B across all files inside drivers/staging/wilc1000 as a second patch? The alternative would be to create a patch that fixes all errors of A and a patch that fixes all errors of B per file ? In some cases there are so many occurrences of a particular error across files it probably does make more sense to create the patches per file. Any thoughts or clarifications on this ? Cheers: Roger H. Newell

4 3

Finding when a chip was supported in the kernel
by Rob Groner Feb. 16, 2016

Feb. 16, 2016

Is there some specific place/way I can find the specific kernel version when support for an arbitrary chip was added? An example is the Intel 82574 Ethernet chip. I'm finding that google is failing me for finding the specific kernel of inclusion. This comes up somewhat often here at work (having to determine how far back our Linux support goes), so I'm trying to find the best way to determine this. Thank you. Rob Groner

4 6