On 24-10-08 09:25, Prasad Joshi wrote:
My understanding is when a process does a fork
1. a new page table will be allocated to the process
2. it will be exactly same copy of the parent process
3. both the page tables (parent's and child's) will have entries
marked as read-only
So any
On 22-10-08 11:25, Ray Kinsella wrote:
I have a process that fork's itself into 10 sub-processes, all of which
are very active, CPU usage is about 85%.
The system I am using has a very small L1/L2 cache that is being
trashed by the processes's working set moving in and out of cache.
I am
On 07-10-08 10:15, Peter Teoh wrote:
In general, I am just trying to understand what are the entities that
can be schedule on the runqueue.
Threads (ie, things with a task_struct). So yes -- if you specifically
create a thread, such as with kthread_run(), that thread is scheduled.
(and it's
On 07-10-08 06:02, Peter Teoh wrote:
2. lsmod will list all the modules loaded. I printk() the
current, and each running module have its own task struct ptr
value. But ps cannot see any of them. But I supposed they should be
on the schedulable list of task-struct right? Or may be not?
On 07-10-08 17:55, Peter Teoh wrote:
thank you for the answer. next question (out of curiosity, sorry if
it is overstretching the OP) is in architecture without any MMU,
what does syscall like fork() get translate into?
Please note that this is not something generic for a
On 30-09-08 02:12, Simon wrote:
I have 3 computers, they are all slightly different yet they all
require pretty much the same basic options. However, I am still a
newbie with the kernel and have found it tedious try to make such
hardware work or have it work in such a way... to the point
On 27-09-08 02:50, Om wrote:
How do we stop the kernel make right after preprocessing stage?
I have a module, which gives me a strange message and I would like to
see the preprocessor output.
I knew how to produce preprocessed files in the kernel. I can't recall
it. If anybody knows, please
On 21-08-08 11:31, Welch, Martyn (GE EntSol, Intelligent Platforms) wrote:
Rajat Jain wrote:
OK. But who does it in an embedded environment (PPC for eg) where
there is no POST software. The first piece of code that gets
executed is U-boot and then the kernel. So who writes the LINE
value
On 20-08-08 17:22, Bernd Petrovitsch wrote:
On Mon, 2008-08-11 at 11:31 +0200, Rene Herman wrote:
On 11-08-08 10:02, Rohit Sharma wrote:
What all possible use cases are there for multiple data stream? (
apart from spy wares and other destructive uses )
As in filesystem forks? The most
On 20-08-08 06:50, Rajat Jain wrote:
On 19-08-08 07:11, Rajat Jain wrote:
I want to understand who decides the IRQ number that a agiven PCI
card will use. I understand that from a PCI device drivers point of
view, it'll find the IRQ vector that it needs to attach by reading
it from the
On 20-08-08 10:43, Mayuresh wrote:
A process has both user space stack and kernel space stack. When a
system call happens, all parameters are either copied to stack or in
registers and using exception it switches to kernel. As from
asmlinkage, I understand parameters are passed onto stack. So
On 20-08-08 20:21, Stanichenko Marat wrote:
-credit_entropy_bits(input_pool,
-min_t(int, fls(delta1), 11));
+nbits = min_t(int, fls(delta1), 11);
+spin_lock_irqsave(state-lock, flags);
+state-nbits += nbits;
+
On 19-08-08 07:11, Rajat Jain wrote:
I want to understand who decides the IRQ number that a agiven PCI
card will use. I understand that from a PCI device drivers point of
view, it'll find the IRQ vector that it needs to attach by reading it
from the configuration space of the device.
On 19-08-08 06:25, Mohamed Thalib .H wrote:
- what kernel version to choose. I understand it depends on system
requirements and hardware specs, and I think 2.6.x branch should be
given a preference, as it supports a lot more hardware then 2.4 and
community provides better support as well :)
On 18-08-08 02:28, Roman Mashak wrote:
I'm looking for a pre-compiled toolchain for a ARM926EJ-S based
platform. Every sites I found are describing procedure to build
croostools rather then offer pre-built ones. Can you recommend binary
ready-to-use, Debian-based desireble?
Both the 926EJ-S
On 18-08-08 16:53, Gagan Grover wrote:
I am getting below problem. What is the reason behind this ?
Somebody probably forgot to release a lock.
[ ... ]
Modules linked in: dbg(U) ccp_ib(U) ccp(U) xpc4drvr(U) windrvr6(U) md5
ipv6 parport_pc lp parport autofs4 i2c_dev i2c_core nfs lockd
On 18-08-08 19:25, Stanichenko Marat wrote:
From: Stanichenko Marat [EMAIL PROTECTED]
Add the interface that shows the amount of entropy generated via the
interfaces and also the amount consumed. This patch adds two files in
proc. The first of them shows the entropy generated per interface,
On 17-08-08 14:52, Himanshu Chauhan wrote:
Patches now should be generated against the linus' tree or the
linux-next tree?
You'd be ill-adviced to do development against -next, but it does make
sense to check -next before submission.
What to submit depends a bit on who's you'd be
On 15-08-08 08:27, Stoyan Gaydarov wrote:
What does this mean:
syslogd-listfil used greatest stack depth: 5788 bytes left
cc1 used greatest stack depth: 5664 bytes left
http used greatest stack depth: 5192 bytes left
(Part of the dmesg log)
Theres quite a few of them and I think it has to do
On 13-08-08 07:53, Manish Katiyar wrote:
On Wed, Aug 13, 2008 at 11:21 AM, Johannes Weiner [EMAIL PROTECTED] wrote:
Manish Katiyar [EMAIL PROTECTED] writes:
On Wed, Aug 13, 2008 at 10:07 AM, Rene Herman [EMAIL PROTECTED] wrote:
int main()
{
char *p_name = santosh;
char *q_name
On 13-08-08 08:40, Peter Teoh wrote:
Not to annoy you further, but this is actually a fairly important point:
But if it is written as such:
#define NAME santosh
int main()
{
char *p_name = NAME;
char *q_name = NAME;
if (p_name == q_name)
printf(Hello, World\n);
On 13-08-08 14:05, Neal Becker wrote:
I need 2 different major # for 1 pci device. Are there any examples
of how to do this?
I'm wondering about whether this would be a problem with
pci_register_driver.
Not any problem. Just register two character devices.
Rene.
--
To unsubscribe from
On 12-08-08 09:40, MinChan Kim wrote:
AFAIK, many people use ramfs or ramdisk to boot up system temporally.
But I want to know other ramfs use case(include ramfs, ramdisk and
others ramfile system which I don't know) except that.
How do you use ram filesytsem and for what ?
tmpfs is a
On 12-08-08 09:54, rishi agrawal wrote:
I was trying to use the xgprof utility.
Its has a piece of code bundled with it named as big.c
On compiling it i got the error message
[EMAIL PROTECTED] test]# gcc big.c
cc1: out of memory allocating 19208 bytes after a total of 1803980800 bytes
so
On 13-08-08 02:57, Peter Teoh wrote:
But since u have assigned it to the same address of NAME, it will
always print HELLO world. So the whole thing has nothing got to do
with optimization (gcc -O0 to disable it, which is also default).
Can y'all please just listen to Johannes? It
On 06-08-08 07:54, Rajat Jain wrote:
In the PCI addess (domain + PCI bus num + PCI Device num + function num)
of a PCI device, who decides the PCI device number assigned to a PCI
device?
- Is it hard wired for a particular PCI slot? (So that any PCI card
plugged into this slot will always
On 06-08-08 21:19, Belisko Marek wrote:
A: Because it messes up the natural reading order
Q: Why do email users complain about top-posting?
On Wed, Aug 6, 2008 at 7:56 PM, Rene Herman
[EMAIL PROTECTED] wrote:
On 06-08-08 11:05, Belisko Marek wrote:
it is possible to call request_firmware
On 05-08-08 07:51, Prasad Joshi wrote:
Thanks a lot Rene and Mark,
I am in a phase of learning the Linux Device Drivers. I am trying to
write a KDB module. This will add a new command in KDB to display the
registered filesystem specific data. Hence I need a way to read all the
registered
On 05-08-08 17:55, Peter Teoh wrote:
On Tue, Aug 5, 2008 at 2:02 AM, Rene Herman [EMAIL PROTECTED] wrote:
On 04-08-08 17:36, Peter Teoh wrote:
I don't quite understand. Normal spin lock is poll-based, but
sleeping spin lock is not, then how does it differed from mutex
On 05-08-08 11:24, Thomas Petazzoni wrote:
A very good source of information to understand the basics of the -rt
tree is the paper of the talk « Internals of the RT patch » given by
Steven Rostedt at the Ottawa Linux Symposium 2007. This paper is freely
available at :
On 04-08-08 17:36, Peter Teoh wrote:
I read about this sleeping spin lock:
http://lwn.net/Articles/271817/
What is that?
A marketing oxymoron in the same style as, say, voluntary preemption.
Ofcourse, sleeping spinlocks do not exist. Although adaptive spinlocks
which spin for a while
On 03-08-08 16:06, Rene Herman wrote:
On 03-08-08 09:58, Manish Katiyar wrote:
ok... I know i am going to be embarrassed but I am confused by the
below function.
I'd not be embarrased...
The last parameter in do_mpage_readpage() is of type get_block_t, but
when passed
On 03-08-08 09:58, Manish Katiyar wrote:
ok... I know i am going to be embarrassed but I am confused by the
below function.
I'd not be embarrased...
The last parameter in do_mpage_readpage() is of type get_block_t, but
when passed to block_read_full_page() it gets passed as get_block_t *
On 03-08-08 18:51, Rene Herman wrote:
On 03-08-08 17:38, rahul p wrote:
On Sun, Aug 3, 2008 at 7:36 PM, Rene Herman
[EMAIL PROTECTED] mailto:[EMAIL PROTECTED] wrote:
In C, except as an operand of sizeof or unary , an expression
having function type is automatically converted from function
On 01-08-08 10:41, Prasad Joshi wrote:
Here is the code for __do_clear_user, I am not getting how does it work.
Can any one please explain?
#define __do_clear_user(addr,size) \
do {\
On 31-07-08 08:33, Sukanto Ghosh wrote:
On Thu, Jul 31, 2008 at 5:51 AM, Greg KH [EMAIL PROTECTED] wrote:
On Wed, Jul 30, 2008 at 10:13:28PM +0530, Sukanto Ghosh wrote:
In PCI DMA operation, a device (consider it to be bus-master) can
directly transfer data to a memory location (some bus
On 31-07-08 08:20, Scott Lovenberg wrote:
Rene Herman wrote:
On 29-07-08 21:35, Rohit Sharma wrote:
I was going through the function ext2_find_near in inode.c and
could not interpret the meaning of the last part of this code :
Am definitely not an fs person, but the comment just above
On 31-07-08 22:59, Thomas Petazzoni wrote:
Using that kind of hardware, the OS has control over which parts of the
physical memory is visible to a particular device. So the OS can
protect itself against malicious devices.
The IOMMU being broken is quite comparable to the device or (with his
On 29-07-08 21:17, Alexander Beregalov wrote:
What is it a right way to fix these warnings?
smth function()
{
switch (var) {
case one:
return 1;
default:
BUG();
}
}
warning: control reaches end of non-void function
BUG() may
On 29-07-08 21:35, Rohit Sharma wrote:
I was going through the function ext2_find_near in inode.c and
could not interpret the meaning of the last part of this code :
Am definitely not an fs person, but the comment just above
ext2_find_near() explains a bit.
Colouring the location like that
On 11-07-08 07:25, William Case wrote:
Let's rejoin the list if we're going to continue this conversation anyway...
Please do, even if only with a large brush. Until then, at least I
personally am going to view your model as a little ridiculous and
of no substance or use.
Suggest another one
On 11-07-08 06:46, jelari wrote:
In message queue implementation, where exactly the messages are
stored. Process A stores data in MQ-1, and Process B retrieves
messages from MQ-1. Is message queue is implemented as shared
memory or with any other technique. If any one let know the URL where
the
On 11-07-08 08:04, jelari wrote:
is there any API exists to check if the message is arrived in the
message queue, rather than retrieving the message?.. Checking the
existence of the message should not remove the message from message
queue. !
Yes, that's a bit of a standard trick. You can
On 11-07-08 09:08, William Case wrote:
If not, I could come in here and say I'd like to view kernels as
large collections of independent nano-bots and then demand that
people tell why they weren't.
I haven't seen a pattern of nano-bots within the kernel, nor do I
think, have you. Describing
On 06-07-08 02:27, Peter Teoh wrote:
And for the phenomena of unbounded priority inversion, I found
this very useful:
http://lkml.org/lkml/2006/5/10/52
Thank you to Rene and Roberto for the discussion.
Just a final note; note that the above linked document does use a
slightly different
On 04-07-08 02:05, Peter Teoh wrote:
I seeeh...or I don't see..the original problem was that the
highest prio cannot acquire the lock, even though it has the highest
prio.
No. That is or was not the problem. This I believe is the fundamental
misunderstanding left.
Please note how
On 04-07-08 18:28, Peter Teoh wrote:
And for the phenomena of unbounded priority inversion, I found this
very useful:
http://lkml.org/lkml/2006/5/10/52
Thank you to Rene and Roberto for the discussion.
Just a final note; note that the above linked document does use a
slightly different
On 28-06-08 02:49, Bruce Moffat wrote:
I am looking for a way to test whether I am running in a bottom half
context or user context. There are kernel functions which may be called
from both user and bottom half contex. For eg, tcp_transmit_skb, may be
called from user context for first time
On 03-06-08 07:07, Adil Mujeeb wrote:
But when i try to get modinfo, its fail to find the module:-
localhost:/home/adil/module/sample # insmod hello-1.ko
localhost:/home/adil/module/sample # modinfo hello-1
modinfo: could not find module hello-1
localhost:/home/adil/module/sample # lsmod |
On 21-05-08 12:04, Vegard Nossum wrote:
In addition to this, I must _not_ access any memory allocated by
kmalloc(), as this may generate a new (recursive) page fault.
Do feel free to educate me; I completely don't understand the question.
kmalloc() alocated memory is non-swappable. How are
On 21-05-08 14:08, Rene Herman wrote:
On 21-05-08 12:04, Vegard Nossum wrote:
In addition to this, I must _not_ access any memory allocated by
kmalloc(), as this may generate a new (recursive) page fault.
Do feel free to educate me; I completely don't understand the question.
kmalloc
On 20-05-08 05:47, Payphone LIOU wrote:
in a kernel modules, i used snprintf() to ouput some strings to the
terminal.
snprintf() doesn't output to anything; it writes to the buffer it's
given as its first parameter. To actually output something you need
printk() and friends.
Rene.
--
To
On 14-05-08 14:38, Shreyansh Jain wrote:
On 5/14/08, Sandeep K Sinha [EMAIL PROTECTED] wrote:
Block I/O is the basic mechanism for DISK access using the SCSI
protocol as the command set. Block I/O is fast and data can be
transmitted in various block sizes like 2K, 4K, 8K, 16K, 64K, 128K,
On 13-05-08 12:17, Mulyadi Santosa wrote:
On Tue, May 13, 2008 at 9:20 AM, Peter Teoh [EMAIL PROTECTED] wrote:
With this, fdisk cannot write to the partition table, mount read-write
cannot work etc. And specifically just on this PC.
weird i just blindly said, something non standard
On 06-05-08 05:15, Peter Teoh wrote:
Greg: added to the CC as one of the LDD3 authors. perhaps it's interesting
to note for a possible followup edition.
Please be aware that /proc/iomem lists physical addresses, while his
request was for availability of a virtual address.
I was aware of
On 05-05-08 11:38, Mulyadi Santosa wrote:
On Sun, May 4, 2008 at 6:48 PM, Rene Herman [EMAIL PROTECTED] wrote:
It depends. There's obviously no way that the user stack can reside in
kernelspace (well, sanely) so the question is, is there any way to have
kernelspace limited to the last 512M
On 30-04-08 20:07, Bizhan Gholikhamseh (bgholikh) wrote:
My understanding is the readahead algorithm causes kernel to read more
data ahead of the time from ide device, this will improve the
ide access, however, in our case we find out it is also impacting over
all system performance. Is there
On 30-04-08 22:42, Greg Freemyer wrote:
Is there similar thing for write access for Linux 2.6.11?
Okay, if you're as dumb as me, this is an extremely amusing question.
What would you have the system write ahead?
Come on Rene, the opposite of read ahead is write behind. ;)
Yes, well,
On 29-04-08 08:42, Scott Lovenberg wrote:
Scott Lovenberg wrote:
Rene Herman wrote:
The proper way of setting sysctl's is in fact though the sysctl
program:
# sysctl kernel.randomize_va_space=0
but hey...
Actually, I think sysctl is deprecated and on its way out. I'd better
double
On 28-04-08 07:59, Chetan Nanda wrote:
I have a few basic question regarding mapping of memory (and other
device) in Linux kernel.
suppose if I have 32bit machine with more then 4GB of RAM , and also
there are other devices that are memory mapped, so how will linux
managed to access the devices
On 28-04-08 16:58, Rene Herman wrote:
Anyways, usually, even when not guaranteed anything, you'd expect to be
able to in practice get the same address. I know recent Red Hat
distributions use addressspace randomization which easily could
interfere. I suppose you are using Debian:
`- Debian
On 28-04-08 10:03, Andreas Leppert wrote:
1) Suppose I have a machine with 512 MB RAM. How is the memory node
structured into zones? Is it in this way?
ZONE_DMA: 1-16 MB
ZONE_NORMAL: 17-512 MB
That means, there is no high memory available for those machines with
less than 896 MB RAM ?
On 28-04-08 18:36, ?? wrote:
Why would heap randomization prevent me from getting a same address?
Because in process B the heap could be placed in the region where your 1,5G
map is in process A, meaning shmat needs to map elsewhere.
Rene
--
To unsubscribe from this list: send an email
On 28-04-08 18:40, Rene Herman wrote:
On 28-04-08 18:36, ?? wrote:
Why would heap randomization prevent me from getting a same address?
Because in process B the heap could be placed in the region where your
1,5G map is in process A, meaning shmat needs to map elsewhere.
Looking closer
On 28-04-08 16:18, Vaughn Clinton wrote:
This is a good question because I'm not sure how different this would be
defined in an x86_64 environment. If someone does answer this can they
include the explaination for the x86_64 as well as the x86 please.
Highmem does not exist on it so all
On 28-04-08 22:15, Rene Herman wrote:
On 27-04-08 18:44, Robert P. J. Day wrote:
so what does that comment mean? it seems to be exactly backwards
from what i'm used to believing.
The comment seems confused yes. alloc_pages() is just the buddy
allocator and gets you contiguous pages
On 28-04-08 21:03, Rene Herman wrote:
On 27-04-08 21:24, Robert P. J. Day wrote:
where in the early kernel boot sequence is the space allocated for the
necessary array of struct pages, one for each page of physical
memory?
The mem_map is node local. It's allocated in (through
On 28-04-08 22:51, Rene Herman wrote:
On 28-04-08 22:15, Rene Herman wrote:
On 27-04-08 18:44, Robert P. J. Day wrote:
so what does that comment mean? it seems to be exactly backwards
from what i'm used to believing.
The comment seems confused yes. alloc_pages() is just the buddy
On 26-04-08 12:16, Andreas Leppert wrote:
Please do not set Mail-Followup-To or Reply-To headers when posting to linux
related mailing lists. They turn CCs into To for one, possibly screwing over
people's mail filters. Many people in this environment get upto thousands of
messages per day
To whom may be able to arrange such.
Would it be possible to have an automatic posting of the LinuxChanges
document (http://kernelnewbies.org/LinuxChanges) to the list? perhaps just
after every release, or once a month if it's maintained as an in-progress
thing, or ...
I know I could just
On 26-04-08 20:02, sahlot arvind wrote:
I am trying to understand linux memory management stuff. I am reading
Understanding Linux Kernel - 2nd Edition. I am at chapter 2 only and I
am confused like anything.
It says that kernel uses 3-level paging. In case of PAE is enabled it
actually uses
On 26-04-08 20:53, William Case wrote:
I am a new member looking for the best way to search the archives of the
mailing list for subjects that have already been dealt with. If it is
just using google, what is the simplest search criteria?
kernelnewbies:xxx ??
Archives are at
On 24-04-08 17:58, Robert P. J. Day wrote:
as a related thread to the earlier one, is there any protection against
the kernel stack extending downwards until it overruns the thread_info
structure?
Not really no. There's some debugging infrastructure which can warn but
basically, you just
On 24-04-08 08:28, jeyram jadenthradevan wrote:
i am a beginner level in driver programming. please help to solve this
problem.
this is a part of the internal modem driver coding. this is for intel
chip set internal modem.
On 25-04-08 21:02, Robert P. J. Day wrote:
oh man, i'm going to sound dumb by asking this, but what precisely is
it that embeds that macro value in the module?
MODULE_STACKSIZE gets added to VERMAGIC_STRING (linux/vermagic.h) as part of
MODULE_ARCH_VERMAGIC (asm/module.h). VERMAGIC_STRING is
On 19-04-08 02:34, Mrunal Gawade wrote:
Does Linux kernel has assert?
A few dozen of them...
I am trying to port a user land program with asserts and want to use them
in kernel too. What is the header file in which its declared, if it is. I
tried grep and other commands but could not find.
On 15-04-08 15:38, Daniel Baluta wrote:
I have recently subscribed to this list and i want to know where I can
find the archives.
Welcome. http://mail.nl.linux.org/kernelnewbies/
Rene.
--
To unsubscribe from this list: send an email with
unsubscribe kernelnewbies to [EMAIL PROTECTED]
Please
On 11-04-08 11:56, Robert P. J. Day wrote:
i know well enough that, if i write and load a driver that allocates
a device major number and one or more minor numbers, i can see the
allocated major number via /proc/devices. but is there a userspace
way to see the minor number(s)? or, as LDD3
On 07-04-08 20:38, Robert P. J. Day wrote:
i'm playing with a sample program to make direct system calls as
described here:
http://www.ibm.com/developerworks/linux/library/l-system-calls/
and i've written a trivial program that should theoretically work, but
the compilation fails on the
On 24-03-08 08:59, Robert P. J. Day wrote:
does the kernel do any floating point *at all* in the kernel these
days?
These days? But no. Only some MMX use (MMX registers alias the FP registers).
Rene.
--
To unsubscribe from this list: send an email with
unsubscribe kernelnewbies to [EMAIL
On 29-02-08 01:34, Peter Teoh wrote:
On Sat, Feb 9, 2008 at 8:10 AM, Rene Herman [EMAIL PROTECTED] wrote:
On 09-02-08 00:22, Diego Woitasen wrote:
I was reading the code of include/linux/fs.h and saw a comment
before i_size_read() that says:
/*
* NOTE
On 23-02-08 11:41, Erik Mouw wrote:
On Sat, Feb 23, 2008 at 02:03:49AM +0100, Rene Herman wrote:
On 22-02-08 15:45, Erik Mouw wrote:
NUMA (Non-Uniform Memory Arcitecture)
Access... :-)
Architecture... :-)
It depends who you're talking to. I first learned about NUMA when my
group
On 22-02-08 09:12, Peter Teoh wrote:
This timing of 8Mhz (or 8.33Mhz right?)
It's generally implemented as something like 7.5 to 8.33 yes, with that 8.33
being a specification figure.
is supposed to be 1/4 of the PCI bus speed of 33Mhz right? (read from
altera website).
No. It _can_
On 22-02-08 15:45, Erik Mouw wrote:
NUMA (Non-Uniform Memory Arcitecture)
Access... :-)
Rene.
--
To unsubscribe from this list: send an email with
unsubscribe kernelnewbies to [EMAIL PROTECTED]
Please read the FAQ at http://kernelnewbies.org/FAQ
On 13-02-08 02:23, Peter Teoh wrote:
see the variable even if CONFIG_X86 is taken away. Anyway, in summary,
for x86 and some architecture, kstack_depth can be controlled via sysfs,
but for others it is hardcoded. not sure why, hardware depedent?
Not too much it seems. Not sure why this has
On 09-02-08 00:22, Diego Woitasen wrote:
I was reading the code of include/linux/fs.h and saw a comment
before i_size_read() that says:
/*
* NOTE: in a 32bit arch with a preemptable kernel and an UP
* compile the i_size_read/write must be atomic with
On 28-01-08 17:12, Peter Teoh wrote:
In Documentation/DMA-mapping.txt:
If you acquired your memory via the page allocator
(i.e. __get_free_page*()) or the generic memory allocators
(i.e. kmalloc() or kmem_cache_alloc()) then you may DMA to/from
that memory using the addresses returned from
On 24-01-08 14:02, sahlot arvind wrote:
That makes sense. Thanks a lot. So position independent code is one
wherein all the branch instructions are PC relative. Right?
More the other way around -- if all branches are PC relative you'll get
position independent code (codewise that is; it's
On 18-01-08 10:52, Onkar wrote:
i have two disks sda(160GB) and sdb (80GB) I want my root fs on sdb ??
What is the significance of Boot flag ???
Nothing really, for non MS operating systems at least. The BIOS loads the
first sector (MBR, Master Boot Record) from disk and executes the code
On 16-01-08 13:02, Mulyadi Santosa wrote:
Arg! I confused you...sorry! yeah after 2nd thought, it should be
on stack, because registers are clobbered during context switch
/me takes this opportunity to confuse the discussion further...
No they aren't. The stack _is_ switched though.
On 10-01-08 16:33, Nikolay N. Ivanov wrote:
I'm really newbie in kernel programming but I fond of daring experiments.
So I have written a simple module which is runs infinite cycle in the
init function. After insmodding system hangs up (it is not a problem
because i use qemu). I also tryed to
On 27-12-07 16:27, Grob Team wrote:
I've been looking on the net to find the specification of the I/O space
for the x86. For example, something telling that writing 0x80 to the I/O
port 0x70 will disable NMI. I thought it was maybe in the Intel
Architectures Software Developer's Manuals but I
On 19-12-07 09:18, [EMAIL PROTECTED] wrote:
Could someone tell me how to know the file is binary or ASCII? I know
both of them are stream of bytes but interpreted by different ways.
I'm afraid your question means you are still confused with respect to this.
Both type of files are _nothing_
On 19-12-07 11:45, Santosh Pradhan wrote:
I am new to this group. I am not sure whether this is the right place to
ask this kind of question. Here is my doubt.
It's fine here, although it might be the case that you don't actually get an
answer from here. At least I seem to not know the
On 19-12-07 22:44, Binyamin Dissen wrote:
:The easiest way is using an editor that supports tags. After you run make
:tags in the root of the source tree (and have the ctags program installed)
:vim -t foobar will take you to the definition of the foobar function.
I issued MAKE TAGS (which is
On 05-12-07 15:45, Vegard Nossum wrote:
On Dec 5, 2007 12:41 PM, Binyamin Dissen [EMAIL PROTECTED] wrote:
Give a Kernel source tree, how can I generate assembly listings for all or
part?
Running GCC -S against an individual module does not work - generates many
compiler errors.
I suggest
On 05-12-07 15:10, Saquib Imam wrote:
Is there any difference in the processing of REPORT_LUNS in AS4 and
AS5 ?
I didn't even know AS5 was out already. I'm still still stuck on level 8 of
Alien Secret 4.
Or, put differently, you might have better luck on some list that more
specifically
On 05-12-07 20:19, ninjaboy wrote:
Ehm... int3 works for me too, the TF doesn't work.
pushf
xor %rax, %rax
pop %rax
orq $0x100, %rax
pushq %rax
popf
the trap released here doesn't exec my handler.
Ah, I just skipped reading the bit with the fucks
On 05-12-07 22:23, Justin Ferguson wrote:
I suppose there was some text to go here, but anyways:
void
unsetTF(void)
{
__asm__ __volatile__(
pushf \n
mov$0x100, %eax\n
On 04-12-07 12:12, Robert P. J. Day wrote:
i've verified that a couple posts i made more than two hours ago are
officially in the archives, but i haven't seen them on the list.
what's up with that time lag?
Please check the timestamps on the Received: headers on your own posts
when/if they
1 - 100 of 129 matches
Mail list logo
