Can I build the PCRE C/C++ library using Windows driver kits

Question

0.00/5 (No votes)

See more:

Are the PCRE/PCRE2[^] libraries compatible with the WDK environments? If yes, how can I build them?

Thank you very much!

Posted 16-Jan-15 2:07am

Daroosh

Updated 16-Jan-15 2:08am

v2

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Richard MacCutchan · Accepted Answer · 2015-01-16T03:22:00

Solution 1

Probably not, as they most likely have never been designed to run in the kernel. The only way to be sure would be to check the source code.

Posted 16-Jan-15 3:22am

Richard MacCutchan

Comments

Daroosh 16-Jan-15 9:36am

Is there any other solution? Is there an RegEx library that I can use with WDK?

Richard MacCutchan 16-Jan-15 9:38am

I don't know, have you searched for one?

bling · Accepted Answer · 2015-01-16T11:57:00

I know the above solution was already accepted but here is a better reason why Regex does not belong in kernel mode.

Consider a simple expression like A.*B ... any substring that starts with the letter A and ends with the letter B - zero or more characters in between.

Now consider an input of one million A's followed by one B.

That's one million potential matches that the regex pattern matching code must track until it sees the letter B. That requires a lot of dynamic memory to track all these potential matches.

This type of work is more appropriate for user mode.